LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), 1(), X) -> f(g(X, X), X, X)
, g(X, Y) -> X
, g(X, Y) -> Y}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), 1(), X) -> f(g(X, X), X, X)
, g(X, Y) -> X
, g(X, Y) -> Y}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), 1(), X) -> f(g(X, X), X, X)
, g(X, Y) -> X
, g(X, Y) -> Y}
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:
{ f(0(), 1(), X) -> f(g(X, X), X, X)
, g(X, Y) -> X
, g(X, Y) -> Y}
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:
{ f(0(), 1(), X) -> f(g(X, X), X, X)
, g(X, Y) -> X
, g(X, Y) -> Y}
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:
{ f(0(), 1(), X) -> f(g(X, X), X, X)
, g(X, Y) -> X
, g(X, Y) -> Y}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..