Problem Transformed outermost 08 ex5.3

LMPO

Execution Time (secs)
0.047
Answer
MAYBE
InputTransformed outermost 08 ex5.3
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from_2(x) -> cons_0(x, from_3(s_0(x)))
     , from_3(x) -> cons_1(x, from_3(s_0(x)))
     , from_1(x) -> cons_0(x, from_3(s_0(x)))
     , cons_1(s_0(x), xs) -> overflow_0()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.036
Answer
MAYBE
InputTransformed outermost 08 ex5.3
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from_2(x) -> cons_0(x, from_3(s_0(x)))
     , from_3(x) -> cons_1(x, from_3(s_0(x)))
     , from_1(x) -> cons_0(x, from_3(s_0(x)))
     , cons_1(s_0(x), xs) -> overflow_0()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.027
Answer
MAYBE
InputTransformed outermost 08 ex5.3
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from_2(x) -> cons_0(x, from_3(s_0(x)))
     , from_3(x) -> cons_1(x, from_3(s_0(x)))
     , from_1(x) -> cons_0(x, from_3(s_0(x)))
     , cons_1(s_0(x), xs) -> overflow_0()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.044
Answer
MAYBE
InputTransformed outermost 08 ex5.3
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from_2(x) -> cons_0(x, from_3(s_0(x)))
     , from_3(x) -> cons_1(x, from_3(s_0(x)))
     , from_1(x) -> cons_0(x, from_3(s_0(x)))
     , cons_1(s_0(x), xs) -> overflow_0()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.031
Answer
MAYBE
InputTransformed outermost 08 ex5.3
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from_2(x) -> cons_0(x, from_3(s_0(x)))
     , from_3(x) -> cons_1(x, from_3(s_0(x)))
     , from_1(x) -> cons_0(x, from_3(s_0(x)))
     , cons_1(s_0(x), xs) -> overflow_0()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.034
Answer
MAYBE
InputTransformed outermost 08 ex5.3
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from_2(x) -> cons_0(x, from_3(s_0(x)))
     , from_3(x) -> cons_1(x, from_3(s_0(x)))
     , from_1(x) -> cons_0(x, from_3(s_0(x)))
     , cons_1(s_0(x), xs) -> overflow_0()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..