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