Problem Strategy outermost added 08 Ex5 Zan97

LMPO

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

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.046
Answer
MAYBE
InputStrategy outermost added 08 Ex5 Zan97
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.019
Answer
MAYBE
InputStrategy outermost added 08 Ex5 Zan97
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.024
Answer
MAYBE
InputStrategy outermost added 08 Ex5 Zan97
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.024
Answer
MAYBE
InputStrategy outermost added 08 Ex5 Zan97
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X) -> if(X, c(), f(true()))
     , if(true(), X, Y) -> X
     , if(false(), X, Y) -> Y}
  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 Ex5 Zan97
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..