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