details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	9.06057 seconds
cpu usage	34.0255
user time	32.5683
system time	1.45718
max virtual memory	7057904.0
max residence set size	148828.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(0(1(0(x1)))) -> 0(0(2(0(x1)))) 3(2(3(3(x1)))) -> 3(1(4(x1))) 1(3(4(2(2(x1))))) -> 1(5(0(1(x1)))) 1(2(5(1(3(3(x1)))))) -> 3(1(3(5(4(x1))))) 1(3(3(5(5(2(x1)))))) -> 1(5(0(1(4(x1))))) 1(3(5(0(4(4(x1)))))) -> 2(5(2(2(5(4(x1)))))) 5(0(3(4(1(5(x1)))))) -> 5(5(2(2(2(5(x1)))))) 0(1(0(4(3(2(0(3(x1)))))))) -> 0(1(3(5(1(5(4(x1))))))) 4(2(2(3(5(4(3(3(x1)))))))) -> 4(1(4(5(5(5(1(x1))))))) 5(1(1(2(1(2(1(0(2(x1))))))))) -> 5(2(5(3(5(0(4(1(x1)))))))) 1(2(1(4(4(4(5(5(2(0(x1)))))))))) -> 1(0(0(0(3(4(5(3(2(0(x1)))))))))) 2(1(5(1(2(4(4(1(0(2(x1)))))))))) -> 2(2(0(3(2(2(1(2(4(1(x1)))))))))) 4(1(0(4(1(3(1(0(1(1(4(x1))))))))))) -> 5(1(0(0(0(5(1(3(4(3(1(x1))))))))))) 4(3(3(3(0(5(5(2(5(5(0(x1))))))))))) -> 4(3(3(2(2(5(0(2(3(4(0(x1))))))))))) 4(5(0(1(1(5(2(3(1(2(5(x1))))))))))) -> 4(4(0(3(4(4(2(3(4(2(5(x1))))))))))) 5(5(4(4(5(0(1(5(3(4(0(x1))))))))))) -> 0(0(0(5(0(3(1(0(0(4(3(0(x1)))))))))))) 4(3(1(1(3(1(4(3(1(2(4(1(x1)))))))))))) -> 3(4(1(1(3(2(2(1(1(2(3(4(x1)))))))))))) 1(0(1(0(5(4(2(3(0(1(4(0(2(x1))))))))))))) -> 3(3(2(1(2(3(4(5(4(3(0(0(1(x1))))))))))))) 3(3(4(5(2(5(5(1(1(2(4(3(0(x1))))))))))))) -> 3(1(2(2(5(2(2(3(3(5(0(4(0(x1))))))))))))) 0(3(0(5(2(1(3(0(5(2(0(3(0(3(x1)))))))))))))) -> 2(3(3(4(1(1(0(1(3(5(0(3(4(x1))))))))))))) 4(4(2(2(5(1(3(3(3(5(3(4(2(1(x1)))))))))))))) -> 4(2(1(2(4(5(0(2(2(5(1(1(2(1(x1)))))))))))))) 1(3(1(1(2(2(2(0(0(1(2(0(5(1(2(x1))))))))))))))) -> 0(5(5(3(5(2(1(0(0(4(1(2(3(2(x1)))))))))))))) 4(0(0(4(2(5(3(2(3(0(5(3(5(3(0(4(x1)))))))))))))))) -> 4(5(5(0(2(1(0(1(2(5(4(1(0(1(0(2(x1)))))))))))))))) 0(4(1(5(0(1(3(0(3(1(2(0(5(5(4(0(3(1(x1)))))))))))))))))) -> 5(3(5(3(2(0(5(5(1(1(0(0(1(2(3(4(4(x1))))))))))))))))) 3(5(2(0(1(1(2(3(0(3(4(5(1(1(2(2(4(2(x1)))))))))))))))))) -> 3(2(2(5(2(5(2(5(4(3(4(3(3(4(5(0(5(x1))))))))))))))))) 5(0(2(4(0(4(1(0(4(0(5(5(1(3(1(4(1(2(4(x1))))))))))))))))))) -> 5(4(2(2(3(0(0(4(1(4(3(3(4(4(0(3(4(3(1(x1))))))))))))))))))) 2(3(0(4(5(4(1(2(3(2(4(4(5(4(3(2(0(3(3(2(x1)))))))))))))))))))) -> 1(4(4(0(3(4(1(1(2(4(0(1(3(1(2(4(5(3(4(2(x1)))))))))))))))))))) 5(4(3(5(1(2(4(5(1(5(0(0(4(4(0(3(0(1(4(2(x1)))))))))))))))))))) -> 5(4(4(1(3(2(3(0(1(0(4(4(5(0(0(4(5(5(2(x1))))))))))))))))))) 0(4(1(1(2(2(2(1(5(4(3(5(5(0(0(3(1(1(1(5(4(x1))))))))))))))))))))) -> 0(2(3(4(0(4(2(3(3(2(4(5(5(3(0(4(5(3(1(4(x1)))))))))))))))))))) 5(5(0(2(2(1(5(1(5(2(1(5(2(3(1(3(1(0(4(3(3(x1))))))))))))))))))))) -> 4(4(4(2(5(2(0(2(1(4(0(3(5(1(1(3(0(4(4(4(2(x1))))))))))))))))))))) Proof: Bounds Processor: bound: 1 enrichment: match automaton: final states: {291,274,256,237,222,206,190,175,161,148,137,126,115, 104,93,84,74,64,56,48,41,35,30,24,20,17,13,9,6,1} transitions: 40(309) -> 291* 40(213) -> 214* 40(258) -> 259* 40(272) -> 273* 40(113) -> 114* 40(2) -> 7* 40(253) -> 254* 40(91) -> 92* 40(300) -> 301* 40(38) -> 39* 40(262) -> 263* 40(144) -> 145* 40(250) -> 251* 40(254) -> 255* 40(179) -> 180* 40(292) -> 293* 40(229) -> 230* 40(65) -> 66* 40(224) -> 225* 40(308) -> 309* 40(240) -> 241* 40(165) -> 166* 40(3) -> 75* 40(189) -> 175* 40(40) -> 35* 40(119) -> 120* 40(271) -> 272* 40(307) -> 308* 40(235) -> 236* 40(83) -> 74* 40(156) -> 157* 40(285) -> 286* 40(92) -> 84* 40(10) -> 42* 40(280) -> 281* 40(162) -> 238* 40(275) -> 276* 40(7) -> 191* 40(26) -> 85* 40(117) -> 118* 40(94) -> 95* 40(211) -> 212* 40(50) -> 51* 40(263) -> 264* 40(208) -> 209* 40(88) -> 89* 40(227) -> 228* 40(223) -> 224* 40(287) -> 288* 40(160) -> 148* popout

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

job log

popout

actions

all output return to SRS Standard