Problem Strategy outermost added 08 ExConc Zan97 Z

LMPO

Execution Time (secs)
0.027
Answer
MAYBE
InputStrategy outermost added 08 ExConc Zan97 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> g(n__h(f(X)))
     , h(X) -> n__h(X)
     , activate(n__h(X)) -> h(X)
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.029
Answer
MAYBE
InputStrategy outermost added 08 ExConc Zan97 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> g(n__h(f(X)))
     , h(X) -> n__h(X)
     , activate(n__h(X)) -> h(X)
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.021
Answer
MAYBE
InputStrategy outermost added 08 ExConc Zan97 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> g(n__h(f(X)))
     , h(X) -> n__h(X)
     , activate(n__h(X)) -> h(X)
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.029
Answer
MAYBE
InputStrategy outermost added 08 ExConc Zan97 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> g(n__h(f(X)))
     , h(X) -> n__h(X)
     , activate(n__h(X)) -> h(X)
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.017
Answer
MAYBE
InputStrategy outermost added 08 ExConc Zan97 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> g(n__h(f(X)))
     , h(X) -> n__h(X)
     , activate(n__h(X)) -> h(X)
     , 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.025
Answer
MAYBE
InputStrategy outermost added 08 ExConc Zan97 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> g(n__h(f(X)))
     , h(X) -> n__h(X)
     , activate(n__h(X)) -> h(X)
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..