Problem SK90 4.31

Tool LMPO

Execution Time
0.056
Answer
MAYBE
InputSK90 4.31

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  purge(nil()) -> nil()
     , purge(.(x, y)) -> .(x, purge(remove(x, y)))
     , remove(x, nil()) -> nil()
     , remove(x, .(y, z)) ->
       if(=(x, y), remove(x, z), .(y, remove(x, z)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.083
Answer
MAYBE
InputSK90 4.31

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  purge(nil()) -> nil()
     , purge(.(x, y)) -> .(x, purge(remove(x, y)))
     , remove(x, nil()) -> nil()
     , remove(x, .(y, z)) ->
       if(=(x, y), remove(x, z), .(y, remove(x, z)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.057
Answer
MAYBE
InputSK90 4.31

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  purge(nil()) -> nil()
     , purge(.(x, y)) -> .(x, purge(remove(x, y)))
     , remove(x, nil()) -> nil()
     , remove(x, .(y, z)) ->
       if(=(x, y), remove(x, z), .(y, remove(x, z)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.050
Answer
MAYBE
InputSK90 4.31

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  purge(nil()) -> nil()
     , purge(.(x, y)) -> .(x, purge(remove(x, y)))
     , remove(x, nil()) -> nil()
     , remove(x, .(y, z)) ->
       if(=(x, y), remove(x, z), .(y, remove(x, z)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.053
Answer
MAYBE
InputSK90 4.31

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  purge(nil()) -> nil()
     , purge(.(x, y)) -> .(x, purge(remove(x, y)))
     , remove(x, nil()) -> nil()
     , remove(x, .(y, z)) ->
       if(=(x, y), remove(x, z), .(y, remove(x, z)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.037
Answer
MAYBE
InputSK90 4.31

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  purge(nil()) -> nil()
     , purge(.(x, y)) -> .(x, purge(remove(x, y)))
     , remove(x, nil()) -> nil()
     , remove(x, .(y, z)) ->
       if(=(x, y), remove(x, z), .(y, remove(x, z)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..