Tool LMPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0()) -> cons(0())
, f(s(0())) -> f(p(s(0())))
, p(s(0())) -> 0()}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool MPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0()) -> cons(0())
, f(s(0())) -> f(p(s(0())))
, p(s(0())) -> 0()}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0()) -> cons(0())
, f(s(0())) -> f(p(s(0())))
, p(s(0())) -> 0()}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool POP* (PS)
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0()) -> cons(0())
, f(s(0())) -> f(p(s(0())))
, p(s(0())) -> 0()}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool Small POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0()) -> cons(0())
, f(s(0())) -> f(p(s(0())))
, p(s(0())) -> 0()}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool Small POP* (PS)
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0()) -> cons(0())
, f(s(0())) -> f(p(s(0())))
, p(s(0())) -> 0()}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..