details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	4.71707 seconds
cpu usage	17.0781
user time	16.0017
system time	1.07641
max virtual memory	6650736.0
max residence set size	98520.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(1(1(2(3(x1))))) -> 0(1(3(3(4(x1))))) 1(4(2(1(4(x1))))) -> 1(1(1(0(x1)))) 1(4(5(1(4(x1))))) -> 5(5(5(2(x1)))) 2(0(5(2(5(x1))))) -> 2(2(3(2(1(x1))))) 0(1(0(5(0(4(x1)))))) -> 0(1(5(5(1(x1))))) 1(0(5(5(1(2(4(x1))))))) -> 2(5(4(5(1(1(4(x1))))))) 4(0(2(5(4(3(5(x1))))))) -> 1(1(3(5(1(5(x1)))))) 0(4(0(0(3(1(4(1(2(x1))))))))) -> 2(5(3(2(2(1(2(2(x1)))))))) 5(4(5(4(2(5(0(1(5(4(x1)))))))))) -> 0(0(1(2(1(2(3(2(2(x1))))))))) 1(2(3(2(1(4(5(2(5(4(5(x1))))))))))) -> 2(1(2(4(2(2(3(0(2(1(x1)))))))))) 4(2(0(4(2(2(5(0(5(3(5(x1))))))))))) -> 4(5(2(5(1(2(4(5(4(3(3(5(x1)))))))))))) 2(4(0(0(0(3(3(3(3(0(0(4(x1)))))))))))) -> 2(0(0(2(0(4(4(3(1(0(2(x1))))))))))) 3(0(3(1(2(0(1(2(2(4(0(4(x1)))))))))))) -> 0(4(1(4(3(2(0(2(5(4(3(3(x1)))))))))))) 4(0(2(5(2(1(1(2(0(1(2(1(x1)))))))))))) -> 0(2(0(0(0(1(0(1(5(2(1(x1))))))))))) 4(3(4(5(2(4(4(5(4(3(4(3(x1)))))))))))) -> 2(5(3(0(2(5(2(4(4(1(3(x1))))))))))) 5(5(4(1(1(1(3(2(2(5(1(2(3(5(4(x1))))))))))))))) -> 5(5(0(3(1(2(0(2(0(2(0(4(1(2(x1)))))))))))))) 4(2(5(1(1(3(1(3(2(5(5(4(3(5(5(4(x1)))))))))))))))) -> 4(2(2(5(1(0(2(5(1(0(3(0(3(5(3(x1))))))))))))))) 1(5(5(5(3(2(0(1(3(4(0(2(5(0(0(3(4(3(x1)))))))))))))))))) -> 5(4(3(1(4(2(4(5(4(5(0(3(1(0(2(2(1(3(x1)))))))))))))))))) 3(0(3(4(3(3(5(1(0(4(5(0(0(0(2(2(1(4(x1)))))))))))))))))) -> 0(1(5(5(0(1(5(0(5(0(0(4(0(4(3(4(x1)))))))))))))))) 5(4(4(5(3(5(2(2(3(4(0(2(0(3(2(5(4(3(x1)))))))))))))))))) -> 5(4(0(5(1(1(1(1(3(2(0(0(3(5(0(1(3(x1))))))))))))))))) 1(5(4(3(4(4(3(3(4(5(4(1(5(5(0(1(4(0(2(x1))))))))))))))))))) -> 0(4(3(3(2(2(0(5(1(0(4(4(3(2(3(5(4(2(x1)))))))))))))))))) 3(2(0(3(1(4(3(1(0(5(5(1(3(4(2(1(5(4(3(x1))))))))))))))))))) -> 3(0(3(1(1(3(0(4(1(1(2(1(5(2(0(0(4(2(3(x1))))))))))))))))))) 1(1(1(3(3(0(0(1(2(2(5(1(4(4(4(5(4(3(4(1(x1)))))))))))))))))))) -> 3(4(0(2(1(0(4(1(0(3(1(4(0(3(4(2(0(5(x1)))))))))))))))))) 4(1(1(5(1(4(3(3(0(3(0(5(4(1(0(4(2(1(4(1(x1)))))))))))))))))))) -> 4(3(4(5(3(1(1(4(1(3(0(2(0(2(5(1(1(3(1(x1))))))))))))))))))) 5(4(2(4(0(4(1(4(4(2(0(1(3(4(1(3(5(4(4(4(x1)))))))))))))))))))) -> 5(4(4(2(2(1(4(4(5(1(4(5(4(5(2(2(0(3(x1)))))))))))))))))) Proof: Bounds Processor: bound: 0 enrichment: match automaton: final states: {252,234,217,199,182,167,153,137,123,110,100,91,79,69, 58,50,43,36,30,24,20,15,11,7,1} transitions: 50(168) -> 169* 50(2) -> 31* 50(178) -> 179* 50(204) -> 205* 50(12) -> 13* 50(268) -> 252* 50(104) -> 105* 50(183) -> 184* 50(121) -> 122* 50(163) -> 164* 50(32) -> 33* 50(158) -> 159* 50(65) -> 66* 50(133) -> 134* 50(80) -> 124* 50(145) -> 146* 50(16) -> 21* 50(14) -> 11* 50(181) -> 167* 50(248) -> 249* 50(67) -> 68* 50(41) -> 42* 50(13) -> 14* 50(28) -> 29* 50(260) -> 261* 50(26) -> 27* 50(152) -> 137* 50(129) -> 130* 50(257) -> 258* 50(237) -> 238* 50(61) -> 62* 50(122) -> 110* 50(164) -> 165* 50(255) -> 256* 50(82) -> 83* 50(160) -> 161* 50(191) -> 192* 50(21) -> 22* 50(17) -> 92* 50(143) -> 144* 50(108) -> 109* 00(171) -> 172* 00(116) -> 117* 00(179) -> 180* 00(77) -> 78* 00(106) -> 107* 00(231) -> 232* 00(210) -> 211* 00(31) -> 218* 00(162) -> 163* 00(142) -> 143* 00(154) -> 155* 00(97) -> 98* 00(12) -> 70* popout

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

job log

popout

actions

all output return to SRS Standard