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