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