details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	6.24123 seconds
cpu usage	22.7283
user time	21.4161
system time	1.31214
max virtual memory	6789516.0
max residence set size	112420.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(1(2(x1))) -> 0(3(3(x1))) 0(4(2(5(3(2(x1)))))) -> 0(1(2(4(0(x1))))) 4(4(1(4(2(1(1(x1))))))) -> 5(0(1(1(1(5(x1)))))) 4(5(0(3(2(5(3(x1))))))) -> 4(1(1(0(2(3(x1)))))) 0(0(1(0(0(3(5(3(x1)))))))) -> 0(0(0(2(3(2(2(3(x1)))))))) 5(1(1(3(1(5(4(2(x1)))))))) -> 5(5(3(4(4(2(0(2(x1)))))))) 1(1(0(0(5(2(5(2(2(x1))))))))) -> 1(3(1(1(5(3(3(5(1(x1))))))))) 4(3(2(4(0(0(2(2(3(5(0(x1))))))))))) -> 1(0(5(2(2(5(2(1(5(5(x1)))))))))) 5(1(2(5(5(2(4(1(1(5(2(x1))))))))))) -> 5(1(5(2(0(3(5(0(1(4(1(x1))))))))))) 1(0(4(3(2(1(4(1(5(1(1(2(x1)))))))))))) -> 4(2(0(3(3(5(3(1(4(5(3(3(5(x1))))))))))))) 5(2(0(5(0(1(1(1(2(4(4(2(x1)))))))))))) -> 5(2(0(2(0(3(3(0(0(4(2(4(x1)))))))))))) 4(1(5(5(5(3(3(1(3(3(3(4(5(x1))))))))))))) -> 4(1(4(3(4(5(1(1(1(1(2(5(x1)))))))))))) 1(1(5(5(0(3(1(4(0(0(3(5(5(4(x1)))))))))))))) -> 0(1(3(1(3(0(3(4(5(0(4(1(5(4(x1)))))))))))))) 3(1(3(0(1(4(5(2(5(0(2(2(4(3(x1)))))))))))))) -> 3(0(5(2(2(0(4(5(2(1(5(5(5(x1))))))))))))) 5(3(1(5(4(5(4(5(1(1(1(2(2(1(5(2(x1)))))))))))))))) -> 5(0(0(5(2(3(2(4(4(1(1(1(5(5(5(x1))))))))))))))) 0(3(0(2(1(3(4(2(1(5(2(4(3(0(1(0(2(x1))))))))))))))))) -> 2(0(4(5(5(2(0(0(1(0(3(2(5(4(1(3(3(x1))))))))))))))))) 1(2(0(4(4(0(3(0(5(2(4(0(3(3(1(1(4(x1))))))))))))))))) -> 4(5(4(0(4(3(5(0(2(5(0(5(3(0(3(1(4(x1))))))))))))))))) 4(0(1(5(4(1(3(5(5(0(0(5(4(5(4(0(5(4(x1)))))))))))))))))) -> 2(1(2(5(0(0(4(1(0(1(5(5(4(5(2(4(1(4(x1)))))))))))))))))) 4(4(4(4(4(1(3(4(1(5(1(4(0(1(4(0(4(5(x1)))))))))))))))))) -> 4(2(2(3(1(2(3(5(4(3(3(4(2(1(2(0(3(4(5(x1))))))))))))))))))) 4(3(3(3(5(5(1(2(5(0(4(1(4(4(2(3(0(4(2(x1))))))))))))))))))) -> 4(3(4(5(5(0(2(5(5(0(2(2(5(2(0(0(3(3(x1)))))))))))))))))) 0(3(2(2(5(4(0(2(4(0(1(3(3(1(0(3(4(3(1(5(x1)))))))))))))))))))) -> 0(3(1(0(5(4(3(2(0(3(3(4(1(0(4(3(3(3(1(1(x1)))))))))))))))))))) 1(0(5(2(2(3(2(0(5(5(3(4(4(3(1(0(0(2(1(2(x1)))))))))))))))))))) -> 1(3(1(4(5(3(3(3(3(0(2(5(1(4(5(4(3(1(5(1(x1)))))))))))))))))))) 5(4(4(2(2(2(3(0(1(5(3(5(1(0(2(3(1(5(4(1(x1)))))))))))))))))))) -> 5(1(0(5(1(1(3(0(5(0(3(5(5(2(4(0(1(5(5(x1))))))))))))))))))) 3(0(2(2(2(0(0(4(3(2(2(5(5(0(3(2(1(2(2(2(0(x1))))))))))))))))))))) -> 5(2(2(5(1(3(5(0(3(2(1(1(1(0(4(5(3(4(0(5(x1)))))))))))))))))))) 4(4(1(2(0(1(2(3(1(0(1(0(0(3(3(4(4(1(1(1(2(x1))))))))))))))))))))) -> 4(1(0(1(0(3(1(4(1(5(3(3(3(0(1(2(3(1(2(5(1(x1))))))))))))))))))))) Proof: Bounds Processor: bound: 1 enrichment: match automaton: final states: {285,266,250,232,213,198,180,164,148,133,122,111,98, 87,75,63,53,44,35,27,21,16,10,5,1} transitions: 40(2) -> 76* 40(115) -> 116* 40(303) -> 285* 40(212) -> 198* 40(77) -> 78* 40(134) -> 135* 40(210) -> 211* 40(173) -> 174* 40(95) -> 96* 40(163) -> 148* 40(197) -> 180* 40(30) -> 31* 40(74) -> 63* 40(31) -> 32* 40(217) -> 218* 40(189) -> 190* 40(145) -> 146* 40(103) -> 104* 40(267) -> 268* 40(159) -> 160* 40(251) -> 252* 40(149) -> 165* 40(161) -> 162* 40(167) -> 168* 40(20) -> 16* 40(220) -> 221* 40(234) -> 235* 40(93) -> 94* 40(270) -> 271* 40(6) -> 7* 40(236) -> 237* 40(36) -> 54* 40(226) -> 227* 40(66) -> 67* 40(11) -> 181* 40(124) -> 125* 40(97) -> 87* 40(296) -> 297* 40(246) -> 247* 40(186) -> 187* 40(100) -> 101* 40(125) -> 126* 31(312) -> 313* 31(309) -> 310* 31(308) -> 309* 31(313) -> 314* 00(171) -> 172* 00(182) -> 183* 00(153) -> 154* 00(301) -> 302* 00(116) -> 117* 00(207) -> 208* popout

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

job log

popout

actions

all output return to SRS Standard