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