details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	4.9081 seconds
cpu usage	17.9586
user time	16.8575
system time	1.10107
max virtual memory	6326488.0
max residence set size	104184.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(1(1(2(x1)))) -> 0(1(0(3(1(2(x1)))))) 0(2(3(1(x1)))) -> 0(3(2(0(1(x1))))) 0(2(3(1(x1)))) -> 1(0(3(4(2(x1))))) 0(2(3(1(x1)))) -> 4(0(3(2(1(x1))))) 0(2(3(1(x1)))) -> 0(0(3(2(1(4(x1)))))) 3(0(1(1(x1)))) -> 0(3(4(1(1(0(x1)))))) 3(0(1(2(x1)))) -> 0(3(4(1(2(4(x1)))))) 3(0(1(2(x1)))) -> 0(3(4(4(1(2(x1)))))) 3(0(2(1(x1)))) -> 0(3(2(1(0(x1))))) 3(0(2(1(x1)))) -> 0(3(2(1(4(x1))))) 3(0(2(1(x1)))) -> 0(3(4(2(1(0(x1)))))) 0(1(0(1(2(x1))))) -> 0(0(2(1(1(3(x1)))))) 0(1(1(4(2(x1))))) -> 1(0(3(1(4(2(x1)))))) 0(1(2(3(1(x1))))) -> 1(0(3(1(2(2(x1)))))) 0(1(2(3(1(x1))))) -> 1(4(0(3(1(2(x1)))))) 0(1(2(3(1(x1))))) -> 2(1(0(3(2(1(x1)))))) 0(1(5(3(1(x1))))) -> 0(3(1(5(4(1(x1)))))) 0(2(3(2(1(x1))))) -> 0(3(2(4(1(2(x1)))))) 0(2(4(3(1(x1))))) -> 0(3(4(1(2(0(x1)))))) 0(2(4(3(1(x1))))) -> 1(0(0(3(4(2(x1)))))) 0(3(3(1(2(x1))))) -> 3(0(1(0(3(2(x1)))))) 0(3(3(2(1(x1))))) -> 0(3(2(3(1(4(x1)))))) 0(5(2(3(1(x1))))) -> 0(3(2(1(5(4(x1)))))) 0(5(2(3(1(x1))))) -> 0(5(0(3(2(1(x1)))))) 0(5(4(3(1(x1))))) -> 0(3(4(1(4(5(x1)))))) 1(4(0(1(2(x1))))) -> 2(1(4(0(3(1(x1)))))) 3(0(1(0(2(x1))))) -> 0(3(2(0(4(1(x1)))))) 3(0(2(3(1(x1))))) -> 3(0(0(3(1(2(x1)))))) 3(0(2(5(1(x1))))) -> 0(3(2(5(0(1(x1)))))) 3(0(2(5(1(x1))))) -> 0(3(5(2(1(4(x1)))))) 3(0(2(5(1(x1))))) -> 5(4(0(3(2(1(x1)))))) 3(0(4(5(1(x1))))) -> 5(0(0(3(4(1(x1)))))) 3(3(0(1(4(x1))))) -> 3(0(0(3(1(4(x1)))))) 3(3(1(1(1(x1))))) -> 0(3(1(3(1(1(x1)))))) 3(3(1(1(2(x1))))) -> 1(3(2(1(4(3(x1)))))) 3(3(1(1(4(x1))))) -> 4(4(3(1(3(1(x1)))))) 3(4(3(2(1(x1))))) -> 3(0(3(2(4(1(x1)))))) 3(5(0(2(1(x1))))) -> 0(3(2(0(5(1(x1)))))) 3(5(0(2(1(x1))))) -> 0(3(5(2(4(1(x1)))))) 4(0(1(1(4(x1))))) -> 1(0(3(4(4(1(x1)))))) 4(5(3(2(1(x1))))) -> 0(3(1(5(2(4(x1)))))) 5(0(1(1(4(x1))))) -> 0(3(1(5(1(4(x1)))))) 5(0(2(3(1(x1))))) -> 5(0(3(2(1(0(x1)))))) 5(3(0(1(1(x1))))) -> 0(3(1(1(5(0(x1)))))) 5(3(0(2(1(x1))))) -> 0(3(4(2(1(5(x1)))))) 5(3(0(2(1(x1))))) -> 0(3(5(1(2(4(x1)))))) 5(3(1(1(2(x1))))) -> 3(1(2(1(4(5(x1)))))) 5(3(1(1(4(x1))))) -> 3(4(1(5(2(1(x1)))))) 5(4(3(4(1(x1))))) -> 0(3(4(4(1(5(x1)))))) Proof: Bounds Processor: bound: 0 enrichment: match automaton: final states: {189,185,182,179,174,169,168,164,160,156,153,148,144, 140,135,130,127,123,122,119,115,113,109,104,98,96,91, 87,82,80,75,72,67,65,63,58,54,48,45,26,42,38,33,27, 21,17,13,8,1} transitions: 40(2) -> 22* 40(187) -> 188* 40(68) -> 157* 40(77) -> 78* 40(175) -> 190* 40(176) -> 177* 40(190) -> 191* 40(30) -> 31* 40(3) -> 14* 40(35) -> 36* 40(49) -> 136* 40(9) -> 68* 40(20) -> 17* 40(39) -> 40* 40(6) -> 64* 40(43) -> 46* 40(4) -> 39* 40(99) -> 100* 40(142) -> 143* 40(106) -> 107* 40(101) -> 102* 40(143) -> 140* 00(47) -> 45* 00(158) -> 159* 00(68) -> 110* 00(88) -> 128* 00(5) -> 6* 00(16) -> 81* 00(44) -> 42* 00(41) -> 38* 00(97) -> 96* 00(12) -> 8* 00(85) -> 86* 00(103) -> 98* 00(52) -> 53* 00(15) -> 16* 00(7) -> 1* popout

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

job log

popout

actions

all output return to SRS Standard