Problem ICFP 2010 212043

Tool Bounds

Execution Time	60.121323ms
Answer	TIMEOUT
Input	ICFP 2010 212043

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  5(3(1(5(2(x1))))) -> 2(5(5(1(5(3(x1))))))
     , 5(3(1(2(2(x1))))) -> 5(1(3(2(2(2(x1))))))
     , 5(3(0(5(2(x1))))) -> 5(5(3(0(2(4(x1))))))
     , 5(3(0(2(2(x1))))) -> 5(3(3(2(0(2(x1))))))
     , 5(2(3(1(2(x1))))) -> 2(3(2(4(1(5(x1))))))
     , 5(2(3(0(2(x1))))) -> 4(5(0(2(3(2(x1))))))
     , 4(3(3(1(2(x1))))) -> 1(3(0(4(3(2(x1))))))
     , 4(3(0(5(3(x1))))) -> 5(4(3(5(0(3(x1))))))
     , 4(3(0(2(3(x1))))) -> 0(3(3(3(2(4(x1))))))
     , 1(3(3(4(2(x1))))) -> 5(1(3(3(2(4(x1))))))
     , 1(3(0(5(2(x1))))) -> 1(3(0(0(2(5(x1))))))
     , 1(3(0(5(2(x1))))) -> 0(5(1(0(3(2(x1))))))
     , 1(2(5(2(3(x1))))) -> 5(1(2(3(3(2(x1))))))
     , 0(5(4(3(2(x1))))) -> 0(0(4(3(2(5(x1))))))
     , 0(5(3(4(2(x1))))) -> 3(2(0(3(5(4(x1))))))
     , 0(5(3(1(2(x1))))) -> 5(0(1(4(3(2(x1))))))
     , 0(5(3(1(2(x1))))) -> 0(1(5(0(2(3(x1))))))
     , 0(5(1(4(3(x1))))) -> 4(5(5(1(0(3(x1))))))
     , 0(5(1(4(3(x1))))) -> 1(0(3(5(4(5(x1))))))
     , 0(5(1(0(2(x1))))) -> 1(5(0(0(3(2(x1))))))
     , 0(5(0(1(2(x1))))) -> 1(2(0(1(5(0(x1))))))
     , 0(1(4(5(2(x1))))) -> 4(1(0(3(2(5(x1))))))
     , 0(1(2(1(2(x1))))) -> 1(1(0(2(2(2(x1))))))
     , 0(0(1(5(2(x1))))) -> 1(5(0(0(3(2(x1))))))
     , 0(0(1(3(3(x1))))) -> 0(0(3(1(0(3(x1))))))
     , 0(0(1(3(2(x1))))) -> 1(0(2(0(0(3(x1))))))
     , 0(0(1(2(3(x1))))) -> 3(2(1(0(0(3(x1))))))
     , 4(3(1(2(x1)))) -> 3(2(5(4(1(1(x1))))))
     , 4(3(0(2(x1)))) -> 4(0(0(3(2(x1)))))
     , 4(0(1(2(x1)))) -> 4(1(0(0(2(x1)))))
     , 1(2(1(2(x1)))) -> 1(1(5(2(2(x1)))))
     , 0(5(2(3(x1)))) -> 5(0(3(2(3(x1)))))
     , 0(4(1(2(x1)))) -> 0(4(5(5(1(2(x1))))))
     , 0(1(4(2(x1)))) -> 4(4(1(0(2(x1)))))
     , 0(1(2(4(x1)))) -> 4(5(1(0(2(x1)))))
     , 0(1(2(3(x1)))) -> 1(3(2(0(3(x1)))))
     , 0(0(5(2(x1)))) -> 0(2(0(3(5(5(x1))))))
     , 0(5(3(x1))) -> 5(5(0(3(x1))))
     , 0(5(3(x1))) -> 5(0(0(3(x1))))
     , 0(5(2(x1))) -> 5(0(3(3(2(x1)))))
     , 0(5(2(x1))) -> 5(5(0(2(x1))))
     , 0(5(2(x1))) -> 5(0(0(2(x1))))
     , 0(1(2(x1))) -> 4(5(1(0(2(x1)))))
     , 0(1(2(x1))) -> 1(0(0(3(2(x1)))))
     , 0(1(2(x1))) -> 1(0(3(2(x1))))
     , 0(1(2(x1))) -> 1(0(0(2(x1))))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	60.04997ms
Answer	TIMEOUT
Input	ICFP 2010 212043

stdout:

TIMEOUT

Statistics:
Number of monomials: 0
Last formula building started for bound 0
Last SAT solving started for bound 0

Tool EDA

Execution Time	60.11871ms
Answer	TIMEOUT
Input	ICFP 2010 212043

stdout:

Tool IDA

Execution Time	60.125465ms
Answer	TIMEOUT
Input	ICFP 2010 212043

stdout:

Tool TRI

Execution Time	61.062046ms
Answer	TIMEOUT
Input	ICFP 2010 212043

stdout:

Tool TRI2

Execution Time	27.853086ms
Answer	MAYBE
Input	ICFP 2010 212043

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  5(3(1(5(2(x1))))) -> 2(5(5(1(5(3(x1))))))
     , 5(3(1(2(2(x1))))) -> 5(1(3(2(2(2(x1))))))
     , 5(3(0(5(2(x1))))) -> 5(5(3(0(2(4(x1))))))
     , 5(3(0(2(2(x1))))) -> 5(3(3(2(0(2(x1))))))
     , 5(2(3(1(2(x1))))) -> 2(3(2(4(1(5(x1))))))
     , 5(2(3(0(2(x1))))) -> 4(5(0(2(3(2(x1))))))
     , 4(3(3(1(2(x1))))) -> 1(3(0(4(3(2(x1))))))
     , 4(3(0(5(3(x1))))) -> 5(4(3(5(0(3(x1))))))
     , 4(3(0(2(3(x1))))) -> 0(3(3(3(2(4(x1))))))
     , 1(3(3(4(2(x1))))) -> 5(1(3(3(2(4(x1))))))
     , 1(3(0(5(2(x1))))) -> 1(3(0(0(2(5(x1))))))
     , 1(3(0(5(2(x1))))) -> 0(5(1(0(3(2(x1))))))
     , 1(2(5(2(3(x1))))) -> 5(1(2(3(3(2(x1))))))
     , 0(5(4(3(2(x1))))) -> 0(0(4(3(2(5(x1))))))
     , 0(5(3(4(2(x1))))) -> 3(2(0(3(5(4(x1))))))
     , 0(5(3(1(2(x1))))) -> 5(0(1(4(3(2(x1))))))
     , 0(5(3(1(2(x1))))) -> 0(1(5(0(2(3(x1))))))
     , 0(5(1(4(3(x1))))) -> 4(5(5(1(0(3(x1))))))
     , 0(5(1(4(3(x1))))) -> 1(0(3(5(4(5(x1))))))
     , 0(5(1(0(2(x1))))) -> 1(5(0(0(3(2(x1))))))
     , 0(5(0(1(2(x1))))) -> 1(2(0(1(5(0(x1))))))
     , 0(1(4(5(2(x1))))) -> 4(1(0(3(2(5(x1))))))
     , 0(1(2(1(2(x1))))) -> 1(1(0(2(2(2(x1))))))
     , 0(0(1(5(2(x1))))) -> 1(5(0(0(3(2(x1))))))
     , 0(0(1(3(3(x1))))) -> 0(0(3(1(0(3(x1))))))
     , 0(0(1(3(2(x1))))) -> 1(0(2(0(0(3(x1))))))
     , 0(0(1(2(3(x1))))) -> 3(2(1(0(0(3(x1))))))
     , 4(3(1(2(x1)))) -> 3(2(5(4(1(1(x1))))))
     , 4(3(0(2(x1)))) -> 4(0(0(3(2(x1)))))
     , 4(0(1(2(x1)))) -> 4(1(0(0(2(x1)))))
     , 1(2(1(2(x1)))) -> 1(1(5(2(2(x1)))))
     , 0(5(2(3(x1)))) -> 5(0(3(2(3(x1)))))
     , 0(4(1(2(x1)))) -> 0(4(5(5(1(2(x1))))))
     , 0(1(4(2(x1)))) -> 4(4(1(0(2(x1)))))
     , 0(1(2(4(x1)))) -> 4(5(1(0(2(x1)))))
     , 0(1(2(3(x1)))) -> 1(3(2(0(3(x1)))))
     , 0(0(5(2(x1)))) -> 0(2(0(3(5(5(x1))))))
     , 0(5(3(x1))) -> 5(5(0(3(x1))))
     , 0(5(3(x1))) -> 5(0(0(3(x1))))
     , 0(5(2(x1))) -> 5(0(3(3(2(x1)))))
     , 0(5(2(x1))) -> 5(5(0(2(x1))))
     , 0(5(2(x1))) -> 5(0(0(2(x1))))
     , 0(1(2(x1))) -> 4(5(1(0(2(x1)))))
     , 0(1(2(x1))) -> 1(0(0(3(2(x1)))))
     , 0(1(2(x1))) -> 1(0(3(2(x1))))
     , 0(1(2(x1))) -> 1(0(0(2(x1))))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..