Problem ICFP 2010 264370

LMPO

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

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.214
Answer
YES(?,PRIMREC)
InputICFP 2010 264370
YES(?,PRIMREC)

We consider the following Problem:

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

Certificate: YES(?,PRIMREC)

Proof:
  The input was oriented with the instance of
  'multiset path orders' as induced by the precedence
  
   1 > 2, 1 > 3, 4 > 2, 5 > 1 .

Hurray, we answered YES(?,PRIMREC)

POP*

Execution Time (secs)
0.119
Answer
MAYBE
InputICFP 2010 264370
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

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

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.101
Answer
MAYBE
InputICFP 2010 264370
MAYBE

We consider the following Problem:

  Strict Trs:
    {  0(1(2(3(4(x1))))) -> 0(2(1(3(4(x1)))))
     , 0(5(1(2(4(3(x1)))))) -> 0(5(2(1(4(3(x1))))))
     , 0(5(2(4(1(3(x1)))))) -> 0(1(5(2(4(3(x1))))))
     , 0(5(3(1(2(4(x1)))))) -> 0(1(5(3(2(4(x1))))))
     , 0(5(4(1(3(2(x1)))))) -> 0(5(4(3(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.107
Answer
MAYBE
InputICFP 2010 264370
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..