details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	3.83281 seconds
cpu usage	13.4395
user time	12.3746
system time	1.0649
max virtual memory	6220360.0
max residence set size	87428.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(0(1(2(x1)))) -> 0(2(1(3(3(0(x1)))))) 0(1(0(4(x1)))) -> 0(1(3(0(4(x1))))) 0(1(0(5(x1)))) -> 0(1(3(5(0(x1))))) 0(1(5(0(x1)))) -> 0(1(3(5(0(x1))))) 0(3(1(0(x1)))) -> 0(1(3(5(0(x1))))) 3(1(0(2(x1)))) -> 1(3(5(0(2(x1))))) 3(1(0(2(x1)))) -> 3(2(1(3(0(x1))))) 3(1(0(5(x1)))) -> 1(3(5(3(0(x1))))) 3(1(2(0(x1)))) -> 2(1(3(3(0(x1))))) 3(1(2(0(x1)))) -> 3(0(2(1(4(x1))))) 3(1(2(0(x1)))) -> 3(0(3(2(1(x1))))) 3(1(2(0(x1)))) -> 3(3(2(1(0(x1))))) 3(1(2(0(x1)))) -> 3(5(2(1(0(x1))))) 3(1(2(2(x1)))) -> 3(5(2(2(1(x1))))) 3(4(2(0(x1)))) -> 3(3(2(4(0(x1))))) 4(0(1(0(x1)))) -> 1(3(0(4(0(x1))))) 5(1(0(5(x1)))) -> 1(3(3(5(5(0(x1)))))) 5(2(5(0(x1)))) -> 5(2(3(5(0(x1))))) 5(3(1(0(x1)))) -> 0(1(3(5(5(x1))))) 0(0(4(1(0(x1))))) -> 0(4(1(3(0(0(x1)))))) 0(1(2(0(5(x1))))) -> 0(3(0(5(1(2(x1)))))) 0(1(3(1(2(x1))))) -> 3(0(2(2(1(1(x1)))))) 0(1(5(0(4(x1))))) -> 0(4(1(3(5(0(x1)))))) 0(1(5(3(5(x1))))) -> 0(1(3(5(3(5(x1)))))) 0(2(0(3(4(x1))))) -> 0(4(5(2(3(0(x1)))))) 0(2(3(1(5(x1))))) -> 0(1(3(5(5(2(x1)))))) 0(2(4(1(2(x1))))) -> 0(2(1(1(4(2(x1)))))) 0(2(5(0(2(x1))))) -> 0(0(3(5(2(2(x1)))))) 0(2(5(5(0(x1))))) -> 0(0(2(5(1(5(x1)))))) 0(3(1(5(0(x1))))) -> 1(3(0(5(3(0(x1)))))) 0(5(3(2(0(x1))))) -> 0(0(2(1(3(5(x1)))))) 3(1(0(5(2(x1))))) -> 2(4(1(3(5(0(x1)))))) 3(1(3(0(2(x1))))) -> 2(1(3(3(3(0(x1)))))) 3(1(3(2(0(x1))))) -> 3(1(3(0(5(2(x1)))))) 3(1(4(1(2(x1))))) -> 1(4(3(2(2(1(x1)))))) 3(1(4(2(0(x1))))) -> 2(1(3(3(0(4(x1)))))) 3(1(5(0(2(x1))))) -> 2(5(1(3(0(5(x1)))))) 3(3(1(0(0(x1))))) -> 5(1(3(3(0(0(x1)))))) 3(4(0(2(0(x1))))) -> 3(0(0(2(1(4(x1)))))) 3(4(2(3(2(x1))))) -> 3(3(2(5(4(2(x1)))))) 4(3(1(0(2(x1))))) -> 4(2(1(3(0(1(x1)))))) 4(3(1(2(0(x1))))) -> 1(3(0(1(4(2(x1)))))) 4(5(5(1(2(x1))))) -> 5(4(5(2(1(1(x1)))))) 4(5(5(5(0(x1))))) -> 5(5(1(5(0(4(x1)))))) 5(1(0(1(2(x1))))) -> 2(1(1(3(5(0(x1)))))) 5(1(1(0(4(x1))))) -> 5(1(1(4(3(0(x1)))))) 5(1(5(2(0(x1))))) -> 2(1(3(5(0(5(x1)))))) 5(4(1(0(5(x1))))) -> 4(1(3(5(5(0(x1)))))) Proof: Bounds Processor: bound: 0 enrichment: match automaton: final states: {170,166,162,160,156,153,150,145,141,139,136,131,128, 125,121,118,117,113,110,105,100,95,90,86,81,79,74,69, 64,59,57,53,50,46,43,41,37,32,28,7,25,22,17,13,8,1} transitions: 40(2) -> 9* 40(126) -> 127* 40(18) -> 96* 40(3) -> 47* 40(16) -> 80* 40(154) -> 155* 40(149) -> 145* 40(67) -> 68* 40(4) -> 163* 40(88) -> 89* 40(171) -> 170* 00(47) -> 51* 00(116) -> 113* 00(115) -> 116* 00(68) -> 64* 00(77) -> 78* 00(31) -> 140* 00(109) -> 105* 00(16) -> 13* 00(108) -> 109* 00(60) -> 132* 00(97) -> 151* 00(73) -> 69* 00(12) -> 8* 00(85) -> 81* 00(103) -> 104* 00(35) -> 36* 00(33) -> 146* 00(7) -> 1* 00(94) -> 90* 00(3) -> 65* 00(89) -> 86* 00(104) -> 100* 00(26) -> 111* 00(63) -> 59* 00(71) -> 72* 00(30) -> 31* 00(80) -> 79* 00(99) -> 95* popout

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

job log

popout

actions

all output return to SRS Standard