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