Problem Strategy outermost added 08 4.12a

Tool LMPO

Execution Time
0.027
Answer
MAYBE
InputStrategy outermost added 08 4.12a

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  h(x, y) -> f(x, y, x)
     , f(0(), 1(), x) -> h(x, x)
     , g(x, y) -> x
     , g(x, y) -> y}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.042
Answer
MAYBE
InputStrategy outermost added 08 4.12a

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  h(x, y) -> f(x, y, x)
     , f(0(), 1(), x) -> h(x, x)
     , g(x, y) -> x
     , g(x, y) -> y}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.061
Answer
MAYBE
InputStrategy outermost added 08 4.12a

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  h(x, y) -> f(x, y, x)
     , f(0(), 1(), x) -> h(x, x)
     , g(x, y) -> x
     , g(x, y) -> y}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.031
Answer
MAYBE
InputStrategy outermost added 08 4.12a

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  h(x, y) -> f(x, y, x)
     , f(0(), 1(), x) -> h(x, x)
     , g(x, y) -> x
     , g(x, y) -> y}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.045
Answer
MAYBE
InputStrategy outermost added 08 4.12a

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  h(x, y) -> f(x, y, x)
     , f(0(), 1(), x) -> h(x, x)
     , g(x, y) -> x
     , g(x, y) -> y}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.040
Answer
MAYBE
InputStrategy outermost added 08 4.12a

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  h(x, y) -> f(x, y, x)
     , f(0(), 1(), x) -> h(x, x)
     , g(x, y) -> x
     , g(x, y) -> y}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..