Problem ICFP 2010 4002

Tool Bounds

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

stdout:

YES(?,O(n^1))

We consider the following Problem:

  Strict Trs:
    {  3(5(4(5(1(4(0(x1))))))) -> 1(1(1(0(0(3(3(1(2(5(x1))))))))))
     , 3(5(4(2(5(2(3(x1))))))) -> 4(0(4(0(0(2(2(3(4(4(x1))))))))))
     , 3(5(0(0(5(4(3(x1))))))) -> 0(1(2(1(1(5(5(2(1(0(x1))))))))))
     , 5(5(5(5(5(3(x1)))))) -> 5(5(0(1(4(0(0(5(0(1(x1))))))))))
     , 5(4(5(1(1(2(x1)))))) -> 5(4(0(3(3(3(3(2(5(5(x1))))))))))
     , 4(5(3(5(5(0(x1)))))) -> 4(2(2(3(0(2(4(1(1(5(x1))))))))))
     , 4(4(2(5(5(0(x1)))))) -> 4(4(0(0(3(3(3(2(2(3(x1))))))))))
     , 3(5(4(3(5(2(x1)))))) -> 2(0(5(2(0(5(2(2(3(2(x1))))))))))
     , 3(0(5(5(4(3(x1)))))) -> 3(3(0(3(2(3(5(5(1(0(x1))))))))))
     , 2(2(5(0(5(4(x1)))))) -> 2(1(4(1(3(3(2(2(5(4(x1))))))))))
     , 5(4(4(2(5(x1))))) -> 4(3(1(1(1(1(5(3(3(5(x1))))))))))
     , 5(1(3(5(0(x1))))) -> 5(1(4(3(0(4(4(5(2(1(x1))))))))))
     , 1(3(5(4(3(x1))))) -> 2(1(4(1(4(0(3(0(1(1(x1))))))))))
     , 2(5(3(0(x1)))) -> 1(0(0(1(3(0(4(5(1(2(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
   , 0_1(1) -> 28
   , 0_1(5) -> 4
   , 0_1(6) -> 5
   , 0_1(12) -> 11
   , 0_1(14) -> 13
   , 0_1(15) -> 14
   , 0_1(20) -> 1
   , 0_1(20) -> 59
   , 0_1(20) -> 89
   , 0_1(31) -> 30
   , 0_1(34) -> 33
   , 0_1(35) -> 34
   , 0_1(37) -> 36
   , 0_1(39) -> 38
   , 0_1(48) -> 47
   , 0_1(53) -> 52
   , 0_1(54) -> 53
   , 0_1(61) -> 60
   , 0_1(64) -> 63
   , 0_1(69) -> 28
   , 0_1(71) -> 70
   , 0_1(83) -> 28
   , 0_1(93) -> 92
   , 0_1(98) -> 97
   , 0_1(100) -> 99
   , 0_1(101) -> 2
   , 0_1(102) -> 101
   , 0_1(105) -> 104
   , 3_0(1) -> 1
   , 3_1(1) -> 59
   , 3_1(7) -> 6
   , 3_1(8) -> 7
   , 3_1(10) -> 89
   , 3_1(18) -> 17
   , 3_1(20) -> 59
   , 3_1(31) -> 59
   , 3_1(40) -> 39
   , 3_1(41) -> 40
   , 3_1(42) -> 41
   , 3_1(43) -> 42
   , 3_1(47) -> 46
   , 3_1(55) -> 54
   , 3_1(56) -> 55
   , 3_1(57) -> 56
   , 3_1(68) -> 67
   , 3_1(69) -> 1
   , 3_1(69) -> 59
   , 3_1(70) -> 69
   , 3_1(72) -> 71
   , 3_1(74) -> 73
   , 3_1(79) -> 78
   , 3_1(80) -> 79
   , 3_1(83) -> 11
   , 3_1(89) -> 88
   , 3_1(92) -> 91
   , 3_1(99) -> 98
   , 3_1(104) -> 103
   , 5_0(1) -> 1
   , 5_1(1) -> 10
   , 5_1(10) -> 44
   , 5_1(12) -> 10
   , 5_1(19) -> 82
   , 5_1(20) -> 10
   , 5_1(25) -> 24
   , 5_1(26) -> 25
   , 5_1(27) -> 75
   , 5_1(29) -> 1
   , 5_1(29) -> 10
   , 5_1(29) -> 44
   , 5_1(29) -> 82
   , 5_1(30) -> 29
   , 5_1(31) -> 10
   , 5_1(36) -> 35
   , 5_1(60) -> 10
   , 5_1(62) -> 61
   , 5_1(65) -> 64
   , 5_1(75) -> 74
   , 5_1(88) -> 87
   , 5_1(96) -> 95
   , 5_1(107) -> 106
   , 2_0(1) -> 1
   , 2_1(1) -> 68
   , 2_1(10) -> 9
   , 2_1(16) -> 15
   , 2_1(17) -> 16
   , 2_1(20) -> 68
   , 2_1(22) -> 21
   , 2_1(27) -> 26
   , 2_1(37) -> 96
   , 2_1(44) -> 43
   , 2_1(45) -> 11
   , 2_1(46) -> 45
   , 2_1(49) -> 48
   , 2_1(58) -> 57
   , 2_1(59) -> 58
   , 2_1(60) -> 1
   , 2_1(60) -> 37
   , 2_1(60) -> 59
   , 2_1(60) -> 68
   , 2_1(60) -> 80
   , 2_1(60) -> 89
   , 2_1(63) -> 62
   , 2_1(66) -> 65
   , 2_1(67) -> 66
   , 2_1(68) -> 80
   , 2_1(73) -> 72
   , 2_1(81) -> 80
   , 2_1(82) -> 81
   , 1_0(1) -> 1
   , 1_1(1) -> 37
   , 1_1(2) -> 1
   , 1_1(2) -> 9
   , 1_1(2) -> 59
   , 1_1(2) -> 68
   , 1_1(2) -> 89
   , 1_1(3) -> 2
   , 1_1(4) -> 3
   , 1_1(9) -> 8
   , 1_1(10) -> 51
   , 1_1(20) -> 37
   , 1_1(21) -> 20
   , 1_1(23) -> 22
   , 1_1(24) -> 23
   , 1_1(28) -> 27
   , 1_1(32) -> 31
   , 1_1(37) -> 100
   , 1_1(51) -> 50
   , 1_1(68) -> 107
   , 1_1(69) -> 37
   , 1_1(76) -> 60
   , 1_1(78) -> 77
   , 1_1(83) -> 37
   , 1_1(84) -> 83
   , 1_1(85) -> 84
   , 1_1(86) -> 85
   , 1_1(87) -> 86
   , 1_1(90) -> 29
   , 1_1(103) -> 102
   , 4_0(1) -> 1
   , 4_1(1) -> 19
   , 4_1(11) -> 1
   , 4_1(11) -> 10
   , 4_1(11) -> 18
   , 4_1(11) -> 19
   , 4_1(11) -> 59
   , 4_1(11) -> 82
   , 4_1(11) -> 89
   , 4_1(13) -> 12
   , 4_1(19) -> 18
   , 4_1(33) -> 32
   , 4_1(38) -> 29
   , 4_1(50) -> 49
   , 4_1(52) -> 11
   , 4_1(69) -> 11
   , 4_1(77) -> 76
   , 4_1(91) -> 90
   , 4_1(94) -> 93
   , 4_1(95) -> 94
   , 4_1(97) -> 78
   , 4_1(106) -> 105}

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

Tool CDI

Execution Time	60.042603ms
Answer	TIMEOUT
Input	ICFP 2010 4002

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	61.451042ms
Answer	TIMEOUT
Input	ICFP 2010 4002

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time	60.076077ms
Answer	TIMEOUT
Input	ICFP 2010 4002

stdout:

Tool TRI

Execution Time	60.34941ms
Answer	TIMEOUT
Input	ICFP 2010 4002

stdout:

Tool TRI2

Execution Time	60.048763ms
Answer	TIMEOUT
Input	ICFP 2010 4002