Problem Strategy outermost added 08 test77

Tool LMPO

Execution Time
0.041
Answer
MAYBE
InputStrategy outermost added 08 test77

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  +(X, 0()) -> X
     , +(X, s(Y)) -> s(+(X, Y))
     , double(X) -> +(X, X)
     , f(0(), s(0()), X) -> f(X, double(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.058
Answer
MAYBE
InputStrategy outermost added 08 test77

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  +(X, 0()) -> X
     , +(X, s(Y)) -> s(+(X, Y))
     , double(X) -> +(X, X)
     , f(0(), s(0()), X) -> f(X, double(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.047
Answer
MAYBE
InputStrategy outermost added 08 test77

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  +(X, 0()) -> X
     , +(X, s(Y)) -> s(+(X, Y))
     , double(X) -> +(X, X)
     , f(0(), s(0()), X) -> f(X, double(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.055
Answer
MAYBE
InputStrategy outermost added 08 test77

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  +(X, 0()) -> X
     , +(X, s(Y)) -> s(+(X, Y))
     , double(X) -> +(X, X)
     , f(0(), s(0()), X) -> f(X, double(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.080
Answer
MAYBE
InputStrategy outermost added 08 test77

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  +(X, 0()) -> X
     , +(X, s(Y)) -> s(+(X, Y))
     , double(X) -> +(X, X)
     , f(0(), s(0()), X) -> f(X, double(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.050
Answer
MAYBE
InputStrategy outermost added 08 test77

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  +(X, 0()) -> X
     , +(X, s(Y)) -> s(+(X, Y))
     , double(X) -> +(X, X)
     , f(0(), s(0()), X) -> f(X, double(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..