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