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