Problem Strategy outermost added 08 Ex9 Luc06 FR

LMPO

Execution Time (secs)
0.026
Answer
MAYBE
InputStrategy outermost added 08 Ex9 Luc06 FR
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(n__a(), X, X) -> f(activate(X), b(), n__b())
     , b() -> a()
     , a() -> n__a()
     , b() -> n__b()
     , activate(n__a()) -> a()
     , activate(n__b()) -> b()
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.047
Answer
MAYBE
InputStrategy outermost added 08 Ex9 Luc06 FR
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(n__a(), X, X) -> f(activate(X), b(), n__b())
     , b() -> a()
     , a() -> n__a()
     , b() -> n__b()
     , activate(n__a()) -> a()
     , activate(n__b()) -> b()
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.055
Answer
MAYBE
InputStrategy outermost added 08 Ex9 Luc06 FR
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(n__a(), X, X) -> f(activate(X), b(), n__b())
     , b() -> a()
     , a() -> n__a()
     , b() -> n__b()
     , activate(n__a()) -> a()
     , activate(n__b()) -> b()
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.042
Answer
MAYBE
InputStrategy outermost added 08 Ex9 Luc06 FR
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(n__a(), X, X) -> f(activate(X), b(), n__b())
     , b() -> a()
     , a() -> n__a()
     , b() -> n__b()
     , activate(n__a()) -> a()
     , activate(n__b()) -> b()
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.062
Answer
MAYBE
InputStrategy outermost added 08 Ex9 Luc06 FR
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(n__a(), X, X) -> f(activate(X), b(), n__b())
     , b() -> a()
     , a() -> n__a()
     , b() -> n__b()
     , activate(n__a()) -> a()
     , activate(n__b()) -> b()
     , 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.033
Answer
MAYBE
InputStrategy outermost added 08 Ex9 Luc06 FR
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(n__a(), X, X) -> f(activate(X), b(), n__b())
     , b() -> a()
     , a() -> n__a()
     , b() -> n__b()
     , activate(n__a()) -> a()
     , activate(n__b()) -> b()
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..