details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	5.32582497597 seconds
cpu usage	19.206951807
max memory	1.338355712E9

stage attributes

key	value
output-size	9165
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: 0(1(2(x1))) -> 0(3(3(x1))) 0(4(2(5(3(2(x1)))))) -> 0(1(2(4(0(x1))))) 4(4(1(4(2(1(1(x1))))))) -> 5(0(1(1(1(5(x1)))))) 4(5(0(3(2(5(3(x1))))))) -> 4(1(1(0(2(3(x1)))))) 0(0(1(0(0(3(5(3(x1)))))))) -> 0(0(0(2(3(2(2(3(x1)))))))) 5(1(1(3(1(5(4(2(x1)))))))) -> 5(5(3(4(4(2(0(2(x1)))))))) 1(1(0(0(5(2(5(2(2(x1))))))))) -> 1(3(1(1(5(3(3(5(1(x1))))))))) 4(3(2(4(0(0(2(2(3(5(0(x1))))))))))) -> 1(0(5(2(2(5(2(1(5(5(x1)))))))))) 5(1(2(5(5(2(4(1(1(5(2(x1))))))))))) -> 5(1(5(2(0(3(5(0(1(4(1(x1))))))))))) 1(0(4(3(2(1(4(1(5(1(1(2(x1)))))))))))) -> 4(2(0(3(3(5(3(1(4(5(3(3(5(x1))))))))))))) 5(2(0(5(0(1(1(1(2(4(4(2(x1)))))))))))) -> 5(2(0(2(0(3(3(0(0(4(2(4(x1)))))))))))) 4(1(5(5(5(3(3(1(3(3(3(4(5(x1))))))))))))) -> 4(1(4(3(4(5(1(1(1(1(2(5(x1)))))))))))) 1(1(5(5(0(3(1(4(0(0(3(5(5(4(x1)))))))))))))) -> 0(1(3(1(3(0(3(4(5(0(4(1(5(4(x1)))))))))))))) 3(1(3(0(1(4(5(2(5(0(2(2(4(3(x1)))))))))))))) -> 3(0(5(2(2(0(4(5(2(1(5(5(5(x1))))))))))))) 5(3(1(5(4(5(4(5(1(1(1(2(2(1(5(2(x1)))))))))))))))) -> 5(0(0(5(2(3(2(4(4(1(1(1(5(5(5(x1))))))))))))))) 0(3(0(2(1(3(4(2(1(5(2(4(3(0(1(0(2(x1))))))))))))))))) -> 2(0(4(5(5(2(0(0(1(0(3(2(5(4(1(3(3(x1))))))))))))))))) 1(2(0(4(4(0(3(0(5(2(4(0(3(3(1(1(4(x1))))))))))))))))) -> 4(5(4(0(4(3(5(0(2(5(0(5(3(0(3(1(4(x1))))))))))))))))) 4(0(1(5(4(1(3(5(5(0(0(5(4(5(4(0(5(4(x1)))))))))))))))))) -> 2(1(2(5(0(0(4(1(0(1(5(5(4(5(2(4(1(4(x1)))))))))))))))))) 4(4(4(4(4(1(3(4(1(5(1(4(0(1(4(0(4(5(x1)))))))))))))))))) -> 4(2(2(3(1(2(3(5(4(3(3(4(2(1(2(0(3(4(5(x1))))))))))))))))))) 4(3(3(3(5(5(1(2(5(0(4(1(4(4(2(3(0(4(2(x1))))))))))))))))))) -> 4(3(4(5(5(0(2(5(5(0(2(2(5(2(0(0(3(3(x1)))))))))))))))))) 0(3(2(2(5(4(0(2(4(0(1(3(3(1(0(3(4(3(1(5(x1)))))))))))))))))))) -> 0(3(1(0(5(4(3(2(0(3(3(4(1(0(4(3(3(3(1(1(x1)))))))))))))))))))) 1(0(5(2(2(3(2(0(5(5(3(4(4(3(1(0(0(2(1(2(x1)))))))))))))))))))) -> 1(3(1(4(5(3(3(3(3(0(2(5(1(4(5(4(3(1(5(1(x1)))))))))))))))))))) 5(4(4(2(2(2(3(0(1(5(3(5(1(0(2(3(1(5(4(1(x1)))))))))))))))))))) -> 5(1(0(5(1(1(3(0(5(0(3(5(5(2(4(0(1(5(5(x1))))))))))))))))))) 3(0(2(2(2(0(0(4(3(2(2(5(5(0(3(2(1(2(2(2(0(x1))))))))))))))))))))) -> 5(2(2(5(1(3(5(0(3(2(1(1(1(0(4(5(3(4(0(5(x1)))))))))))))))))))) 4(4(1(2(0(1(2(3(1(0(1(0(0(3(3(4(4(1(1(1(2(x1))))))))))))))))))))) -> 4(1(0(1(0(3(1(4(1(5(3(3(3(0(1(2(3(1(2(5(1(x1))))))))))))))))))))) Proof: Bounds Processor: bound: 1 enrichment: match automaton: final states: {285,266,250,232,213,198,180,164,148,133,122,111,98, 87,75,63,53,44,35,27,21,16,10,5,1} transitions: f60() -> 2* 00(277) -> 278* 00(55) -> 56* 00(25) -> 26* 00(207) -> 208* 00(182) -> 183* 00(299) -> 300* 00(82) -> 83* 00(72) -> 73* 00(17) -> 18* 00(2) -> 6* 00(174) -> 175* 00(301) -> 302* 00(84) -> 85* 00(79) -> 80* 00(271) -> 272* 00(256) -> 257* 00(231) -> 213* 00(24) -> 25* 00(14) -> 15* 00(9) -> 5* 00(4) -> 1* 00(171) -> 172* 00(156) -> 157* 00(146) -> 147* 00(141) -> 142* 00(131) -> 132* 00(116) -> 117* 00(101) -> 102* 00(263) -> 264* 00(258) -> 259* 00(51) -> 52* 00(46) -> 251* 00(228) -> 229* 00(26) -> 21* 00(223) -> 224* 00(218) -> 219* 00(11) -> 267* 00(203) -> 204* 00(1) -> 199* 00(153) -> 154* 00(138) -> 139* 00(290) -> 291* 00(78) -> 79* 00(58) -> 59* 00(240) -> 241* popout

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

job log

popout

actions

all output return to SRS Stand 10685