details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	10.0151 seconds
cpu usage	37.726
user time	36.2699
system time	1.45611
max virtual memory	7146500.0
max residence set size	161336.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(0(1(2(x1)))) -> 3(1(3(x1))) 4(2(5(5(x1)))) -> 1(3(0(5(x1)))) 1(5(3(5(2(x1))))) -> 1(2(3(2(4(x1))))) 2(2(0(2(0(4(x1)))))) -> 2(2(1(1(4(x1))))) 3(4(0(2(2(0(x1)))))) -> 3(4(4(5(2(x1))))) 0(3(0(1(2(1(0(x1))))))) -> 3(5(0(2(0(2(x1)))))) 1(2(3(1(2(0(2(x1))))))) -> 1(4(5(0(3(5(x1)))))) 5(4(1(4(5(1(5(x1))))))) -> 5(2(0(2(1(4(5(x1))))))) 2(0(4(5(5(1(2(2(x1)))))))) -> 2(5(5(4(4(2(2(x1))))))) 5(3(1(5(2(0(5(0(x1)))))))) -> 5(0(0(0(4(3(1(0(x1)))))))) 0(2(3(2(0(5(1(0(2(x1))))))))) -> 5(1(2(5(5(0(3(4(x1)))))))) 2(1(3(1(1(0(0(2(2(x1))))))))) -> 1(1(3(1(2(4(5(4(x1)))))))) 3(3(2(0(5(0(1(5(2(x1))))))))) -> 3(0(2(1(4(2(5(2(x1)))))))) 4(3(2(2(5(3(1(5(0(4(x1)))))))))) -> 4(4(3(0(2(0(4(4(0(3(0(x1))))))))))) 2(4(3(3(2(4(1(1(2(0(0(x1))))))))))) -> 4(3(4(4(4(5(0(3(5(1(x1)))))))))) 0(0(0(2(3(5(5(2(4(3(2(0(x1)))))))))))) -> 2(5(1(0(3(0(5(0(2(3(2(0(x1)))))))))))) 1(4(1(3(3(4(5(1(0(1(2(0(x1)))))))))))) -> 1(3(1(0(5(3(2(4(0(2(1(x1))))))))))) 0(1(5(1(1(4(3(0(0(0(2(1(2(x1))))))))))))) -> 5(5(1(1(4(0(0(4(5(5(0(3(x1)))))))))))) 5(4(2(2(4(5(0(4(3(1(2(5(4(x1))))))))))))) -> 5(3(5(5(1(5(0(0(2(1(1(3(4(x1))))))))))))) 3(0(3(3(1(0(1(0(1(4(3(3(3(4(x1)))))))))))))) -> 3(5(4(0(3(2(4(0(1(4(0(5(4(x1))))))))))))) 0(2(4(1(5(1(5(0(1(1(2(4(1(5(4(x1))))))))))))))) -> 0(3(1(5(3(4(0(2(5(5(4(5(1(4(4(x1))))))))))))))) 3(0(2(3(3(4(1(1(4(2(1(1(1(5(4(x1))))))))))))))) -> 3(3(1(5(1(3(0(1(4(5(1(0(3(0(4(x1))))))))))))))) 4(4(4(3(4(1(1(1(0(1(0(1(0(3(1(0(4(x1))))))))))))))))) -> 3(4(2(1(5(0(0(3(1(3(0(3(3(1(3(5(x1)))))))))))))))) 5(2(1(3(0(3(5(4(3(2(2(4(5(2(5(2(3(x1))))))))))))))))) -> 0(5(2(5(4(5(0(0(5(5(4(2(3(0(0(1(2(3(x1)))))))))))))))))) 3(0(4(4(5(5(5(5(2(4(4(1(0(0(2(3(2(4(x1)))))))))))))))))) -> 3(0(5(2(0(2(3(1(2(0(4(4(5(4(0(4(2(3(4(x1))))))))))))))))))) 3(2(0(3(2(1(2(4(3(5(1(3(3(2(5(5(0(4(x1)))))))))))))))))) -> 4(2(5(2(4(3(4(2(0(2(2(4(1(0(2(1(0(4(x1)))))))))))))))))) 4(0(3(3(2(5(0(3(0(1(3(3(4(4(0(5(0(2(4(x1))))))))))))))))))) -> 4(0(1(1(2(3(5(5(2(4(2(3(1(5(5(2(5(x1))))))))))))))))) 2(3(2(3(4(0(4(2(3(1(4(4(2(0(0(3(3(2(0(0(x1)))))))))))))))))))) -> 2(4(2(0(2(5(2(4(4(2(5(4(3(1(4(1(5(1(x1)))))))))))))))))) 0(4(1(5(0(2(3(3(0(3(0(5(2(0(4(3(4(2(1(2(2(x1))))))))))))))))))))) -> 5(4(3(1(4(5(0(5(5(2(3(1(0(4(0(4(4(2(3(0(x1)))))))))))))))))))) 1(5(5(3(2(4(0(4(1(5(5(0(4(2(4(3(4(2(2(1(4(x1))))))))))))))))))))) -> 1(2(2(1(4(5(1(4(4(1(5(3(4(0(2(0(4(4(2(5(0(x1))))))))))))))))))))) Proof: Bounds Processor: bound: 1 enrichment: match automaton: final states: {289,271,255,239,223,206,189,175,161,147,136,125,114, 104,93,83,73,67,60,53,45,39,33,28,23,18,14,9,5,1} transitions: 31(309) -> 310* 31(311) -> 312* 31(333) -> 334* 31(324) -> 325* 01(323) -> 324* 30(297) -> 298* 30(47) -> 48* 30(72) -> 67* 30(169) -> 170* 30(193) -> 194* 30(179) -> 180* 30(286) -> 287* 30(188) -> 175* 30(278) -> 279* 30(162) -> 163* 30(243) -> 244* 30(108) -> 109* 30(142) -> 143* 30(174) -> 161* 30(85) -> 86* 30(22) -> 18* 30(27) -> 23* 30(7) -> 8* 30(112) -> 113* 30(173) -> 174* 30(216) -> 217* 30(94) -> 95* 30(176) -> 177* 30(6) -> 29* 30(11) -> 12* 30(249) -> 250* 30(181) -> 182* 30(222) -> 206* 30(233) -> 234* 30(159) -> 160* 30(4) -> 1* 30(80) -> 81* 30(99) -> 100* 30(64) -> 65* 30(146) -> 136* 30(10) -> 54* 30(258) -> 259* 30(134) -> 135* 30(91) -> 92* 30(156) -> 157* 30(46) -> 74* 30(177) -> 178* 30(2) -> 3* f60() -> 2* 40(209) -> 210* popout

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

job log

popout

actions

all output return to SRS Standard