Problem ICFP 2010 26123

Tool LMPO

Execution Time
0.145
Answer
MAYBE
InputICFP 2010 26123

stdout:

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)))))))))))))))))))
     , 0(1(2(1(x1)))) ->
       1(2(1(1(0(1(2(0(1(2(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(0(1(2(0(1(2(x1)))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.187
Answer
MAYBE
InputICFP 2010 26123

stdout:

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)))))))))))))))))))
     , 0(1(2(1(x1)))) ->
       1(2(1(1(0(1(2(0(1(2(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(0(1(2(0(1(2(x1)))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.136
Answer
MAYBE
InputICFP 2010 26123

stdout:

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)))))))))))))))))))
     , 0(1(2(1(x1)))) ->
       1(2(1(1(0(1(2(0(1(2(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(0(1(2(0(1(2(x1)))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.136
Answer
MAYBE
InputICFP 2010 26123

stdout:

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)))))))))))))))))))
     , 0(1(2(1(x1)))) ->
       1(2(1(1(0(1(2(0(1(2(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(0(1(2(0(1(2(x1)))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.157
Answer
MAYBE
InputICFP 2010 26123

stdout:

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)))))))))))))))))))
     , 0(1(2(1(x1)))) ->
       1(2(1(1(0(1(2(0(1(2(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(0(1(2(0(1(2(x1)))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.137
Answer
MAYBE
InputICFP 2010 26123

stdout:

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)))))))))))))))))))
     , 0(1(2(1(x1)))) ->
       1(2(1(1(0(1(2(0(1(2(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(0(1(2(0(1(2(x1)))))))))))))))))))))))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..