details

property	value
status	complete
benchmark	96403.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n148.star.cs.uiowa.edu
space	ICFP_2010

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	5.13599 seconds
cpu usage	18.5003
user time	17.4189
system time	1.08142
max virtual memory	6295136.0
max residence set size	99096.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(1(2(1(x1)))) -> 3(1(1(x1))) 0(2(4(5(0(x1))))) -> 0(5(2(0(x1)))) 0(4(3(5(5(x1))))) -> 0(3(5(5(x1)))) 1(1(4(4(3(x1))))) -> 1(2(2(4(4(x1))))) 5(1(5(5(5(4(x1)))))) -> 5(2(4(1(1(4(x1)))))) 0(1(3(3(4(3(3(x1))))))) -> 0(3(2(0(3(x1))))) 2(5(1(2(3(2(2(x1))))))) -> 4(1(1(1(1(4(1(x1))))))) 1(2(0(0(3(5(0(0(x1)))))))) -> 5(1(0(4(0(5(3(2(x1)))))))) 3(5(1(2(0(4(1(1(x1)))))))) -> 3(5(4(0(3(4(1(x1))))))) 2(0(2(4(0(0(3(1(2(x1))))))))) -> 2(3(0(1(2(4(1(3(3(x1))))))))) 3(0(0(4(0(1(1(0(5(3(x1)))))))))) -> 0(1(0(0(4(3(2(4(3(x1))))))))) 3(4(3(0(4(2(1(1(4(3(x1)))))))))) -> 3(2(5(1(3(1(1(1(1(x1))))))))) 4(0(2(0(3(4(3(0(3(0(4(x1))))))))))) -> 4(4(5(2(0(3(2(4(1(5(4(x1))))))))))) 4(1(0(2(5(4(5(2(4(4(5(x1))))))))))) -> 2(0(2(0(1(2(5(1(4(5(x1)))))))))) 3(1(4(0(3(1(0(3(0(2(4(4(x1)))))))))))) -> 3(2(3(0(0(0(2(5(5(1(2(4(x1)))))))))))) 0(3(1(1(2(2(3(5(1(5(5(4(0(x1))))))))))))) -> 0(3(2(5(0(1(5(0(1(1(5(3(0(x1))))))))))))) 1(3(3(5(2(5(2(4(5(3(0(2(4(x1))))))))))))) -> 4(5(1(4(3(2(1(5(5(5(5(x1))))))))))) 1(2(5(0(2(3(2(4(1(3(4(3(2(4(x1)))))))))))))) -> 2(3(1(2(3(0(2(0(2(2(0(0(2(x1))))))))))))) 5(4(3(5(0(3(0(3(1(0(1(1(1(2(x1)))))))))))))) -> 5(2(3(1(4(1(5(5(1(4(2(0(x1)))))))))))) 2(1(4(5(4(3(2(5(2(2(2(4(1(2(5(4(x1)))))))))))))))) -> 2(3(0(0(1(1(2(4(1(4(5(5(0(3(x1)))))))))))))) 1(5(2(3(5(2(3(0(5(5(0(1(0(3(1(5(0(x1))))))))))))))))) -> 0(2(2(0(4(1(3(4(0(5(4(2(0(4(1(5(1(0(x1)))))))))))))))))) 3(3(1(1(3(2(0(2(4(2(1(2(1(1(4(4(1(x1))))))))))))))))) -> 1(2(2(2(3(3(0(2(4(5(3(4(0(4(1(4(1(x1))))))))))))))))) 5(1(2(0(0(2(1(4(1(5(3(0(1(4(4(5(1(x1))))))))))))))))) -> 5(5(2(5(4(5(4(2(5(2(5(1(0(2(3(1(x1)))))))))))))))) 1(0(4(3(0(3(5(5(0(4(3(5(5(2(4(4(4(1(4(x1))))))))))))))))))) -> 1(1(3(5(1(1(0(5(0(0(3(3(1(5(4(4(4(1(x1)))))))))))))))))) 0(5(3(5(5(1(0(3(4(3(1(1(5(5(1(4(3(5(5(1(x1)))))))))))))))))))) -> 0(0(5(1(2(1(1(4(4(4(2(3(1(5(5(5(1(4(2(x1))))))))))))))))))) Proof: Bounds Processor: bound: 0 enrichment: match automaton: final states: {217,201,186,172,155,143,133,121,112,100,89,80,70,63,55,47,42,34,28,23,18,13,9,5,1} transitions: 20(73) -> 74* 20(2) -> 35* 20(187) -> 188* 20(178) -> 179* 20(115) -> 116* 20(68) -> 69* 20(76) -> 77* 20(109) -> 110* 20(126) -> 127* 20(183) -> 184* 20(224) -> 225* 20(16) -> 17* 20(14) -> 90* 20(154) -> 143* 20(193) -> 194* 20(182) -> 183* 20(83) -> 84* 20(15) -> 16* 20(148) -> 149* 20(93) -> 94* 20(6) -> 7* 20(56) -> 57* 20(184) -> 185* 20(54) -> 47* 20(198) -> 199* 20(169) -> 170* 20(124) -> 125* 20(129) -> 130* 20(230) -> 231* 20(50) -> 51* 20(141) -> 142* 20(98) -> 99* 20(88) -> 80* 20(86) -> 87* 20(123) -> 124* 20(160) -> 161* 20(132) -> 121* 20(191) -> 192* 20(21) -> 22* 20(25) -> 26* 20(170) -> 171* 30(69) -> 63* 30(153) -> 154* 30(116) -> 117* 30(97) -> 98* 30(57) -> 58* 30(205) -> 206* 30(35) -> 36* 30(165) -> 166* 30(180) -> 181* 30(29) -> 43* 30(140) -> 141* 30(53) -> 54* 30(6) -> 101* 30(11) -> 12* 30(214) -> 215* 30(3) -> 187* 30(206) -> 207* 30(223) -> 224* popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to SRS Standard