details

property	value
status	complete
benchmark	96289.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.40544 seconds
cpu usage	19.7713
user time	18.6753
system time	1.09596
max virtual memory	6699420.0
max residence set size	105332.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(1(2(2(x1)))) -> 3(3(2(x1))) 4(1(1(0(2(x1))))) -> 0(3(2(0(x1)))) 4(5(3(4(5(x1))))) -> 2(3(1(5(x1)))) 0(0(5(2(2(0(x1)))))) -> 3(5(0(3(2(x1))))) 2(0(1(2(0(3(x1)))))) -> 2(5(3(2(3(x1))))) 0(5(1(5(4(0(4(1(0(x1))))))))) -> 2(4(2(1(1(2(5(5(x1)))))))) 1(4(3(0(0(5(1(4(3(x1))))))))) -> 5(4(2(5(2(2(4(3(x1)))))))) 2(5(2(3(4(0(0(4(4(3(x1)))))))))) -> 3(0(3(5(2(1(2(2(3(x1))))))))) 4(2(1(3(2(4(4(2(4(2(x1)))))))))) -> 3(0(3(3(4(1(3(4(2(2(x1)))))))))) 1(1(5(4(0(2(0(3(4(0(2(x1))))))))))) -> 1(5(0(4(2(2(0(0(3(0(1(x1))))))))))) 3(3(1(4(4(2(2(1(1(3(4(x1))))))))))) -> 3(3(3(5(5(5(4(1(2(3(x1)))))))))) 4(4(2(0(3(1(2(0(0(0(1(x1))))))))))) -> 4(0(0(3(3(1(1(5(0(1(x1)))))))))) 4(4(4(3(1(1(3(0(3(0(3(x1))))))))))) -> 1(4(3(4(4(3(5(3(0(3(x1)))))))))) 4(2(4(5(0(4(0(5(3(1(0(5(3(x1))))))))))))) -> 4(0(4(5(5(0(3(0(5(5(5(4(x1)))))))))))) 4(5(4(0(3(0(2(1(5(5(4(2(2(x1))))))))))))) -> 2(1(0(0(1(2(0(0(4(0(1(2(3(3(x1)))))))))))))) 1(1(1(5(1(0(5(3(1(5(4(4(0(0(x1)))))))))))))) -> 5(5(2(4(4(0(4(0(5(0(4(2(4(5(x1)))))))))))))) 4(0(0(5(2(4(3(4(3(4(4(0(0(3(x1)))))))))))))) -> 3(0(3(4(0(1(2(4(0(5(2(5(3(x1))))))))))))) 5(2(5(0(1(1(3(0(4(4(2(4(3(2(x1)))))))))))))) -> 5(3(2(0(1(2(5(1(2(2(5(1(3(x1))))))))))))) 4(0(1(5(3(3(4(0(4(4(4(5(4(0(2(x1))))))))))))))) -> 4(4(0(1(5(5(3(1(3(4(1(4(4(4(1(x1))))))))))))))) 4(1(5(0(3(4(0(3(2(5(5(0(4(0(0(3(x1)))))))))))))))) -> 2(1(3(3(4(2(1(4(3(0(0(0(1(2(3(x1))))))))))))))) 1(4(1(2(3(5(3(0(0(5(3(4(2(2(2(5(2(1(x1)))))))))))))))))) -> 1(5(4(4(3(4(1(0(3(4(5(0(0(5(5(1(2(5(x1)))))))))))))))))) 2(1(5(4(3(5(0(1(2(1(4(5(0(1(2(2(3(4(x1)))))))))))))))))) -> 0(0(0(0(4(5(2(0(2(0(1(2(5(1(5(2(1(4(x1)))))))))))))))))) 4(2(5(0(2(3(3(2(1(4(0(2(4(0(2(5(3(4(x1)))))))))))))))))) -> 4(0(2(4(5(2(2(1(0(2(3(0(5(1(4(5(2(4(x1)))))))))))))))))) 0(4(4(2(5(4(5(0(3(5(3(4(3(1(4(1(2(1(0(x1))))))))))))))))))) -> 3(0(4(0(2(0(5(3(2(5(3(4(4(3(4(4(3(4(x1)))))))))))))))))) 4(5(2(1(1(3(3(5(4(4(4(4(3(3(4(0(2(1(4(2(2(x1))))))))))))))))))))) -> 2(1(4(3(1(3(1(1(1(2(3(4(3(4(4(2(3(0(2(1(x1)))))))))))))))))))) Proof: Bounds Processor: bound: 0 enrichment: match automaton: final states: {243,226,209,192,175,163,149,137,125,112,99,87,78,70,62,51,42,35,28,21,16,13,9,5,1} transitions: 50(213) -> 214* 50(221) -> 222* 50(2) -> 10* 50(178) -> 179* 50(127) -> 128* 50(233) -> 234* 50(38) -> 39* 50(64) -> 65* 50(210) -> 211* 50(138) -> 139* 50(95) -> 96* 50(34) -> 28* 50(158) -> 159* 50(190) -> 191* 50(65) -> 66* 50(31) -> 32* 50(80) -> 81* 50(14) -> 15* 50(194) -> 195* 50(116) -> 117* 50(89) -> 90* 50(181) -> 182* 50(148) -> 137* 50(10) -> 22* 50(90) -> 91* 50(236) -> 237* 50(196) -> 197* 50(157) -> 158* 50(60) -> 61* 50(66) -> 67* 50(124) -> 112* 50(94) -> 95* 50(53) -> 71* 50(88) -> 89* 50(203) -> 204* 50(177) -> 178* 50(123) -> 124* 50(142) -> 143* 50(17) -> 126* 50(19) -> 20* 30(69) -> 62* 30(171) -> 172* 30(47) -> 48* 30(68) -> 69* 30(88) -> 227* 30(242) -> 226* 30(187) -> 188* 30(44) -> 45* 30(41) -> 35* 30(229) -> 230* 30(154) -> 155* 30(73) -> 74* 30(39) -> 40* 30(183) -> 184* 30(172) -> 173* 30(15) -> 13* 30(7) -> 8* 30(251) -> 252* popout

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

job log

popout

actions

all output return to SRS Standard