Problem Strategy outermost added 08 Ex4 4 Luc96b Z

LMPO

Execution Time (secs)
0.031
Answer
MAYBE
InputStrategy outermost added 08 Ex4 4 Luc96b Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(g(X), Y) -> f(X, n__f(g(X), activate(Y)))
     , f(X1, X2) -> n__f(X1, X2)
     , activate(n__f(X1, X2)) -> f(X1, X2)
     , 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 Ex4 4 Luc96b Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(g(X), Y) -> f(X, n__f(g(X), activate(Y)))
     , f(X1, X2) -> n__f(X1, X2)
     , activate(n__f(X1, X2)) -> f(X1, X2)
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.034
Answer
MAYBE
InputStrategy outermost added 08 Ex4 4 Luc96b Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(g(X), Y) -> f(X, n__f(g(X), activate(Y)))
     , f(X1, X2) -> n__f(X1, X2)
     , activate(n__f(X1, X2)) -> f(X1, X2)
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.030
Answer
MAYBE
InputStrategy outermost added 08 Ex4 4 Luc96b Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(g(X), Y) -> f(X, n__f(g(X), activate(Y)))
     , f(X1, X2) -> n__f(X1, X2)
     , activate(n__f(X1, X2)) -> f(X1, X2)
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.039
Answer
MAYBE
InputStrategy outermost added 08 Ex4 4 Luc96b Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(g(X), Y) -> f(X, n__f(g(X), activate(Y)))
     , f(X1, X2) -> n__f(X1, X2)
     , activate(n__f(X1, X2)) -> f(X1, X2)
     , 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.046
Answer
MAYBE
InputStrategy outermost added 08 Ex4 4 Luc96b Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(g(X), Y) -> f(X, n__f(g(X), activate(Y)))
     , f(X1, X2) -> n__f(X1, X2)
     , activate(n__f(X1, X2)) -> f(X1, X2)
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..