Problem Transformed CSR 04 Ex4 4 Luc96b GM

Tool LMPO

Execution Time
0.040
Answer
MAYBE
InputTransformed CSR 04 Ex4 4 Luc96b GM

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a__f(g(X), Y) -> a__f(mark(X), f(g(X), Y))
     , mark(f(X1, X2)) -> a__f(mark(X1), X2)
     , mark(g(X)) -> g(mark(X))
     , a__f(X1, X2) -> f(X1, X2)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.038
Answer
MAYBE
InputTransformed CSR 04 Ex4 4 Luc96b GM

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a__f(g(X), Y) -> a__f(mark(X), f(g(X), Y))
     , mark(f(X1, X2)) -> a__f(mark(X1), X2)
     , mark(g(X)) -> g(mark(X))
     , a__f(X1, X2) -> f(X1, X2)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.047
Answer
MAYBE
InputTransformed CSR 04 Ex4 4 Luc96b GM

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a__f(g(X), Y) -> a__f(mark(X), f(g(X), Y))
     , mark(f(X1, X2)) -> a__f(mark(X1), X2)
     , mark(g(X)) -> g(mark(X))
     , a__f(X1, X2) -> f(X1, X2)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.080
Answer
MAYBE
InputTransformed CSR 04 Ex4 4 Luc96b GM

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a__f(g(X), Y) -> a__f(mark(X), f(g(X), Y))
     , mark(f(X1, X2)) -> a__f(mark(X1), X2)
     , mark(g(X)) -> g(mark(X))
     , a__f(X1, X2) -> f(X1, X2)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.039
Answer
MAYBE
InputTransformed CSR 04 Ex4 4 Luc96b GM

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a__f(g(X), Y) -> a__f(mark(X), f(g(X), Y))
     , mark(f(X1, X2)) -> a__f(mark(X1), X2)
     , mark(g(X)) -> g(mark(X))
     , a__f(X1, X2) -> f(X1, X2)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.046
Answer
MAYBE
InputTransformed CSR 04 Ex4 4 Luc96b GM

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a__f(g(X), Y) -> a__f(mark(X), f(g(X), Y))
     , mark(f(X1, X2)) -> a__f(mark(X1), X2)
     , mark(g(X)) -> g(mark(X))
     , a__f(X1, X2) -> f(X1, X2)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..