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