Problem TCT 09 ma9

Tool LMPO

Execution Time
0.032
Answer
MAYBE
InputTCT 09 ma9

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.069
Answer
MAYBE
InputTCT 09 ma9

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.032
Answer
MAYBE
InputTCT 09 ma9

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.024
Answer
MAYBE
InputTCT 09 ma9

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.032
Answer
MAYBE
InputTCT 09 ma9

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.023
Answer
MAYBE
InputTCT 09 ma9

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..