Problem Secret 05 TRS tpa2

Tool LMPO

Execution Time
0.061
Answer
MAYBE
InputSecret 05 TRS tpa2

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  -(x, 0()) -> x
     , -(s(x), s(y)) -> -(x, y)
     , p(s(x)) -> x
     , f(s(x), y) -> f(p(-(s(x), y)), p(-(y, s(x))))
     , f(x, s(y)) -> f(p(-(x, s(y))), p(-(s(y), x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.077
Answer
MAYBE
InputSecret 05 TRS tpa2

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  -(x, 0()) -> x
     , -(s(x), s(y)) -> -(x, y)
     , p(s(x)) -> x
     , f(s(x), y) -> f(p(-(s(x), y)), p(-(y, s(x))))
     , f(x, s(y)) -> f(p(-(x, s(y))), p(-(s(y), x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.053
Answer
MAYBE
InputSecret 05 TRS tpa2

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  -(x, 0()) -> x
     , -(s(x), s(y)) -> -(x, y)
     , p(s(x)) -> x
     , f(s(x), y) -> f(p(-(s(x), y)), p(-(y, s(x))))
     , f(x, s(y)) -> f(p(-(x, s(y))), p(-(s(y), x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.057
Answer
MAYBE
InputSecret 05 TRS tpa2

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  -(x, 0()) -> x
     , -(s(x), s(y)) -> -(x, y)
     , p(s(x)) -> x
     , f(s(x), y) -> f(p(-(s(x), y)), p(-(y, s(x))))
     , f(x, s(y)) -> f(p(-(x, s(y))), p(-(s(y), x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.061
Answer
MAYBE
InputSecret 05 TRS tpa2

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  -(x, 0()) -> x
     , -(s(x), s(y)) -> -(x, y)
     , p(s(x)) -> x
     , f(s(x), y) -> f(p(-(s(x), y)), p(-(y, s(x))))
     , f(x, s(y)) -> f(p(-(x, s(y))), p(-(s(y), x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.113
Answer
MAYBE
InputSecret 05 TRS tpa2

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  -(x, 0()) -> x
     , -(s(x), s(y)) -> -(x, y)
     , p(s(x)) -> x
     , f(s(x), y) -> f(p(-(s(x), y)), p(-(y, s(x))))
     , f(x, s(y)) -> f(p(-(x, s(y))), p(-(s(y), x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..