Problem ICFP 2010 26069

LMPO

Execution Time (secs)
0.104
Answer
MAYBE
InputICFP 2010 26069
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.122
Answer
MAYBE
InputICFP 2010 26069
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.109
Answer
MAYBE
InputICFP 2010 26069
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.096
Answer
MAYBE
InputICFP 2010 26069
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.100
Answer
MAYBE
InputICFP 2010 26069
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.179
Answer
MAYBE
InputICFP 2010 26069
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..