Problem Transformed CSR 04 Ex5 Zan97 Z

LMPO

Execution Time (secs)
0.041
Answer
MAYBE
InputTransformed CSR 04 Ex5 Zan97 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> if(X, c(), n__f(true()))
     , if(true(), X, Y) -> X
     , if(false(), X, Y) -> activate(Y)
     , f(X) -> n__f(X)
     , activate(n__f(X)) -> f(X)
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.064
Answer
MAYBE
InputTransformed CSR 04 Ex5 Zan97 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> if(X, c(), n__f(true()))
     , if(true(), X, Y) -> X
     , if(false(), X, Y) -> activate(Y)
     , f(X) -> n__f(X)
     , activate(n__f(X)) -> f(X)
     , 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
InputTransformed CSR 04 Ex5 Zan97 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> if(X, c(), n__f(true()))
     , if(true(), X, Y) -> X
     , if(false(), X, Y) -> activate(Y)
     , f(X) -> n__f(X)
     , activate(n__f(X)) -> f(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.034
Answer
MAYBE
InputTransformed CSR 04 Ex5 Zan97 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> if(X, c(), n__f(true()))
     , if(true(), X, Y) -> X
     , if(false(), X, Y) -> activate(Y)
     , f(X) -> n__f(X)
     , activate(n__f(X)) -> f(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.026
Answer
MAYBE
InputTransformed CSR 04 Ex5 Zan97 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> if(X, c(), n__f(true()))
     , if(true(), X, Y) -> X
     , if(false(), X, Y) -> activate(Y)
     , f(X) -> n__f(X)
     , activate(n__f(X)) -> f(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.051
Answer
MAYBE
InputTransformed CSR 04 Ex5 Zan97 Z
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> if(X, c(), n__f(true()))
     , if(true(), X, Y) -> X
     , if(false(), X, Y) -> activate(Y)
     , f(X) -> n__f(X)
     , activate(n__f(X)) -> f(X)
     , activate(X) -> X}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..