details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	7.98488 seconds
cpu usage	29.746
user time	28.375
system time	1.37094
max virtual memory	6960320.0
max residence set size	135240.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(1(0(1(2(x1))))) -> 1(3(3(2(x1)))) 0(0(3(0(0(4(x1)))))) -> 5(1(5(2(2(x1))))) 3(2(1(2(1(4(x1)))))) -> 4(4(3(5(1(4(x1)))))) 4(2(3(0(3(4(x1)))))) -> 4(2(2(1(0(x1))))) 5(2(5(5(4(3(x1)))))) -> 1(1(4(4(3(x1))))) 1(4(1(4(3(1(2(x1))))))) -> 1(3(2(0(1(2(5(x1))))))) 2(5(4(2(5(5(2(x1))))))) -> 2(1(2(2(0(2(x1)))))) 3(3(2(3(5(5(0(x1))))))) -> 4(3(5(1(2(1(x1)))))) 5(3(3(4(0(1(4(x1))))))) -> 5(1(1(4(1(4(x1)))))) 0(4(5(5(3(5(1(2(1(3(x1)))))))))) -> 3(2(2(3(1(5(0(2(5(x1))))))))) 2(5(5(0(2(5(3(5(0(3(x1)))))))))) -> 2(0(5(3(3(0(2(2(0(x1))))))))) 5(5(0(1(2(1(4(3(0(4(x1)))))))))) -> 2(2(5(4(3(4(1(0(4(x1))))))))) 4(2(4(1(0(4(4(0(3(4(3(x1))))))))))) -> 4(2(2(5(5(3(1(2(4(4(3(x1))))))))))) 0(1(0(1(3(2(2(4(0(4(1(2(x1)))))))))))) -> 4(4(4(3(5(0(0(2(5(1(3(4(x1)))))))))))) 3(5(5(1(4(4(1(3(2(0(4(0(x1)))))))))))) -> 4(1(1(5(1(5(2(1(1(5(3(1(x1)))))))))))) 0(0(2(4(2(5(2(5(0(4(4(5(4(x1))))))))))))) -> 4(5(0(3(1(1(1(0(0(0(1(2(5(x1))))))))))))) 0(5(0(5(2(5(2(3(0(2(5(5(5(x1))))))))))))) -> 0(3(0(2(0(5(0(4(2(5(2(3(x1)))))))))))) 4(4(0(0(4(4(0(5(0(5(2(0(2(x1))))))))))))) -> 4(5(5(2(3(3(3(4(1(2(2(2(x1)))))))))))) 0(1(3(0(5(5(4(3(1(2(2(4(0(4(3(x1))))))))))))))) -> 2(5(5(2(3(3(1(1(0(5(1(5(0(2(x1)))))))))))))) 5(2(0(2(2(2(4(0(2(1(3(4(5(5(3(x1))))))))))))))) -> 2(5(0(3(2(2(3(0(0(3(3(0(4(1(3(x1))))))))))))))) 5(5(1(5(3(3(5(2(0(2(0(4(5(5(2(x1))))))))))))))) -> 1(2(0(5(5(5(4(0(4(4(5(2(3(3(2(x1))))))))))))))) 1(5(0(5(4(0(0(2(5(3(2(3(0(5(5(3(x1)))))))))))))))) -> 1(2(3(3(0(0(3(1(2(0(1(0(0(0(4(x1))))))))))))))) 2(1(5(1(1(3(3(4(5(0(2(1(3(1(3(0(4(x1))))))))))))))))) -> 2(5(0(3(5(0(0(5(5(5(2(5(3(3(2(1(5(4(x1)))))))))))))))))) 5(2(1(1(0(2(4(2(3(0(5(1(5(4(2(2(4(x1))))))))))))))))) -> 2(3(0(2(5(5(3(1(5(3(4(2(4(2(1(2(4(x1))))))))))))))))) 0(1(5(5(4(2(4(5(5(1(2(4(1(2(1(5(2(1(3(x1))))))))))))))))))) -> 2(5(1(1(0(5(3(5(0(3(3(4(2(0(1(1(4(2(x1)))))))))))))))))) 2(0(3(2(0(2(0(2(5(4(2(5(2(4(0(4(0(5(1(x1))))))))))))))))))) -> 2(2(1(3(0(4(0(2(2(4(0(5(4(0(5(0(2(1(x1)))))))))))))))))) 2(3(0(0(4(5(4(0(0(0(4(5(5(5(0(3(5(1(3(x1))))))))))))))))))) -> 2(5(4(5(3(5(5(5(3(1(2(3(5(4(5(0(0(3(1(x1))))))))))))))))))) 1(5(2(1(1(5(5(4(4(5(2(3(2(0(1(5(1(5(5(4(3(x1))))))))))))))))))))) -> 1(3(4(1(4(0(0(1(4(0(5(3(5(3(4(0(0(2(1(x1))))))))))))))))))) 3(5(0(3(4(0(2(1(4(4(1(5(4(5(3(4(5(5(1(3(5(x1))))))))))))))))))))) -> 4(4(1(0(2(4(5(4(1(0(3(4(0(1(4(1(1(4(2(0(x1)))))))))))))))))))) 5(3(1(2(1(5(3(1(4(5(5(3(0(3(0(2(0(2(3(4(1(x1))))))))))))))))))))) -> 5(5(1(1(4(0(4(2(0(5(4(3(1(1(3(3(5(1(4(1(x1)))))))))))))))))))) Proof: Bounds Processor: bound: 0 enrichment: match automaton: final states: {299,281,265,248,232,215,199,182,169,157,143,131,121, 110,101,90,79,71,63,55,48,44,38,33,26,21,16,10,6,1} transitions: 40(266) -> 267* 40(272) -> 273* 40(113) -> 114* 40(2) -> 11* 40(204) -> 205* 40(12) -> 45* 40(291) -> 292* 40(23) -> 24* 40(313) -> 314* 40(130) -> 121* 40(109) -> 101* 40(262) -> 263* 40(144) -> 145* 40(311) -> 312* 40(65) -> 66* 40(3) -> 216* 40(298) -> 281* 40(14) -> 15* 40(307) -> 308* 40(159) -> 160* 40(251) -> 252* 40(235) -> 236* 40(15) -> 10* 40(89) -> 79* 40(276) -> 277* 40(67) -> 68* 40(20) -> 16* 40(22) -> 23* 40(39) -> 300* 40(220) -> 221* 40(162) -> 163* 40(284) -> 285* 40(43) -> 38* 40(56) -> 282* 40(202) -> 203* 40(242) -> 243* 40(297) -> 298* 40(88) -> 89* 40(123) -> 124* 40(278) -> 279* 40(293) -> 294* 40(78) -> 71* 40(287) -> 288* 40(160) -> 161* 40(100) -> 90* 40(238) -> 239* 40(87) -> 88* 10(171) -> 172* 10(168) -> 157* popout

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

job log

popout

actions

all output return to SRS Standard