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