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