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