Problem Transformed outermost 08 ex5.8

LMPO

Execution Time (secs)
0.037
Answer
MAYBE
InputTransformed outermost 08 ex5.8
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.043
Answer
MAYBE
InputTransformed outermost 08 ex5.8
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.039
Answer
MAYBE
InputTransformed outermost 08 ex5.8
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.041
Answer
MAYBE
InputTransformed outermost 08 ex5.8
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.032
Answer
MAYBE
InputTransformed outermost 08 ex5.8
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.075
Answer
MAYBE
InputTransformed outermost 08 ex5.8
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..