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