Problem ICFP 2010 40093

LMPO

Execution Time (secs)
0.187
Answer
MAYBE
InputICFP 2010 40093
MAYBE

We consider the following Problem:

  Strict Trs:
    {  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(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)))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.238
Answer
MAYBE
InputICFP 2010 40093
MAYBE

We consider the following Problem:

  Strict Trs:
    {  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(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)))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.237
Answer
MAYBE
InputICFP 2010 40093
MAYBE

We consider the following Problem:

  Strict Trs:
    {  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(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)))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.205
Answer
MAYBE
InputICFP 2010 40093
MAYBE

We consider the following Problem:

  Strict Trs:
    {  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(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)))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.235
Answer
MAYBE
InputICFP 2010 40093
MAYBE

We consider the following Problem:

  Strict Trs:
    {  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(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)))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.175
Answer
MAYBE
InputICFP 2010 40093
MAYBE

We consider the following Problem:

  Strict Trs:
    {  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(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)))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..