Problem Strategy outermost added 08 Ex24 Luc06 FR

LMPO

Execution Time (secs)
0.032
Answer
MAYBE
InputStrategy outermost added 08 Ex24 Luc06 FR
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

Execution Time (secs)
0.033
Answer
MAYBE
InputStrategy outermost added 08 Ex24 Luc06 FR
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*

Execution Time (secs)
0.029
Answer
MAYBE
InputStrategy outermost added 08 Ex24 Luc06 FR
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)

Execution Time (secs)
0.038
Answer
MAYBE
InputStrategy outermost added 08 Ex24 Luc06 FR
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*

Execution Time (secs)
0.035
Answer
MAYBE
InputStrategy outermost added 08 Ex24 Luc06 FR
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)

Execution Time (secs)
0.028
Answer
MAYBE
InputStrategy outermost added 08 Ex24 Luc06 FR
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..