Problem ICFP 2010 25192

Tool Bounds

Execution Time	6.338e-2ms
Answer	YES(?,O(n^1))
Input	ICFP 2010 25192

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

Certificate: YES(?,O(n^1))

Proof:
  The problem is match-bounded by 1.
  The enriched problem is compatible with the following automaton:
  {  0_0(1) -> 1
   , 1_0(1) -> 1
   , 1_1(1) -> 1
   , 5_0(1) -> 1
   , 5_1(1) -> 4
   , 5_1(4) -> 3
   , 4_0(1) -> 1
   , 4_1(2) -> 1
   , 4_1(3) -> 2
   , 2_0(1) -> 1
   , 2_1(1) -> 1
   , 2_1(1) -> 3
   , 2_1(1) -> 4
   , 2_1(2) -> 1
   , 2_1(2) -> 3
   , 2_1(2) -> 4
   , 2_1(3) -> 1
   , 2_1(3) -> 3
   , 2_1(3) -> 4}

Hurray, we answered YES(?,O(n^1))

Tool CDI

Execution Time	60.04494ms
Answer	TIMEOUT
Input	ICFP 2010 25192

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.050583ms
Answer	TIMEOUT
Input	ICFP 2010 25192

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time	60.0724ms
Answer	TIMEOUT
Input	ICFP 2010 25192

stdout:

Tool TRI

Execution Time	1.0280521ms
Answer	YES(?,O(n^2))
Input	ICFP 2010 25192

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

Certificate: YES(?,O(n^2))

Proof:
  We have the following triangular matrix interpretation:
  Interpretation Functions:
   0(x1) = [1 3] x1 + [3]
           [0 1]      [3]
   1(x1) = [1 3] x1 + [2]
           [0 1]      [3]
   5(x1) = [1 0] x1 + [0]
           [0 0]      [1]
   4(x1) = [1 1] x1 + [1]
           [0 0]      [0]
   2(x1) = [1 1] x1 + [1]
           [0 0]      [1]

Hurray, we answered YES(?,O(n^2))

Tool TRI2

Execution Time	1.0055029ms
Answer	YES(?,O(n^2))
Input	ICFP 2010 25192

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

Certificate: YES(?,O(n^2))

Proof:
  We have the following triangular matrix interpretation:
  Interpretation Functions:
   0(x1) = [1 3] x1 + [3]
           [0 1]      [3]
   1(x1) = [1 3] x1 + [2]
           [0 1]      [3]
   5(x1) = [1 2] x1 + [0]
           [0 1]      [2]
   4(x1) = [1 0] x1 + [0]
           [0 1]      [2]
   2(x1) = [1 0] x1 + [3]
           [0 1]      [0]

Hurray, we answered YES(?,O(n^2))