Problem Strategy outermost added 08 test76

LMPO

Execution Time (secs)
0.040
Answer
MAYBE
InputStrategy outermost added 08 test76
MAYBE

We consider the following Problem:

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

MPO

Execution Time (secs)
0.054
Answer
MAYBE
InputStrategy outermost added 08 test76
MAYBE

We consider the following Problem:

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

POP*

Execution Time (secs)
0.038
Answer
MAYBE
InputStrategy outermost added 08 test76
MAYBE

We consider the following Problem:

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

POP* (PS)

Execution Time (secs)
0.054
Answer
MAYBE
InputStrategy outermost added 08 test76
MAYBE

We consider the following Problem:

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

Small POP*

Execution Time (secs)
0.069
Answer
MAYBE
InputStrategy outermost added 08 test76
MAYBE

We consider the following Problem:

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

Small POP* (PS)

Execution Time (secs)
0.077
Answer
MAYBE
InputStrategy outermost added 08 test76
MAYBE

We consider the following Problem:

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