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