Tool LMPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ -(0(), y) -> 0()
, -(x, 0()) -> x
, -(x, s(y)) -> if(greater(x, s(y)), s(-(x, p(s(y)))), 0())
, p(0()) -> 0()
, p(s(x)) -> x}
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:
{ -(0(), y) -> 0()
, -(x, 0()) -> x
, -(x, s(y)) -> if(greater(x, s(y)), s(-(x, p(s(y)))), 0())
, p(0()) -> 0()
, p(s(x)) -> x}
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:
{ -(0(), y) -> 0()
, -(x, 0()) -> x
, -(x, s(y)) -> if(greater(x, s(y)), s(-(x, p(s(y)))), 0())
, p(0()) -> 0()
, p(s(x)) -> x}
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:
{ -(0(), y) -> 0()
, -(x, 0()) -> x
, -(x, s(y)) -> if(greater(x, s(y)), s(-(x, p(s(y)))), 0())
, p(0()) -> 0()
, p(s(x)) -> x}
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:
{ -(0(), y) -> 0()
, -(x, 0()) -> x
, -(x, s(y)) -> if(greater(x, s(y)), s(-(x, p(s(y)))), 0())
, p(0()) -> 0()
, p(s(x)) -> x}
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:
{ -(0(), y) -> 0()
, -(x, 0()) -> x
, -(x, s(y)) -> if(greater(x, s(y)), s(-(x, p(s(y)))), 0())
, p(0()) -> 0()
, p(s(x)) -> x}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..