Problem ICFP 2010 40708

Tool LMPO

Execution Time
0.277
Answer
MAYBE
InputICFP 2010 40708

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  0(1(2(3(4(5(1(x1))))))) ->
       0(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))
     , 0(1(2(3(4(5(1(x1))))))) ->
       1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))))))))
     , 0(1(2(3(4(5(1(x1))))))) ->
       1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.425
Answer
MAYBE
InputICFP 2010 40708

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  0(1(2(3(4(5(1(x1))))))) ->
       0(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))
     , 0(1(2(3(4(5(1(x1))))))) ->
       1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))))))))
     , 0(1(2(3(4(5(1(x1))))))) ->
       1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.391
Answer
MAYBE
InputICFP 2010 40708

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  0(1(2(3(4(5(1(x1))))))) ->
       0(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))
     , 0(1(2(3(4(5(1(x1))))))) ->
       1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))))))))
     , 0(1(2(3(4(5(1(x1))))))) ->
       1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.273
Answer
MAYBE
InputICFP 2010 40708

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  0(1(2(3(4(5(1(x1))))))) ->
       0(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))
     , 0(1(2(3(4(5(1(x1))))))) ->
       1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))))))))
     , 0(1(2(3(4(5(1(x1))))))) ->
       1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.363
Answer
MAYBE
InputICFP 2010 40708

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  0(1(2(3(4(5(1(x1))))))) ->
       0(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))
     , 0(1(2(3(4(5(1(x1))))))) ->
       1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))))))))
     , 0(1(2(3(4(5(1(x1))))))) ->
       1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.326
Answer
MAYBE
InputICFP 2010 40708

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  0(1(2(3(4(5(1(x1))))))) ->
       0(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))
     , 0(1(2(3(4(5(1(x1))))))) ->
       1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))))))))
     , 0(1(2(3(4(5(1(x1))))))) ->
       1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x1)))))))))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..