details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	3.48073792458 seconds
cpu usage	12.398669452
max memory	1.204375552E9

stage attributes

key	value
output-size	6319
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: 0(1(1(x1))) -> 1(0(2(1(x1)))) 0(1(1(x1))) -> 1(1(0(3(2(x1))))) 0(1(1(x1))) -> 1(4(0(0(2(1(x1)))))) 0(1(4(x1))) -> 1(4(0(3(x1)))) 0(1(4(x1))) -> 4(0(2(1(x1)))) 0(1(4(x1))) -> 4(0(2(1(3(x1))))) 0(4(1(x1))) -> 0(2(4(1(x1)))) 0(4(1(x1))) -> 4(0(2(1(x1)))) 0(4(1(x1))) -> 4(0(3(1(x1)))) 0(4(1(x1))) -> 1(4(4(0(2(x1))))) 0(4(1(x1))) -> 2(1(4(0(2(x1))))) 0(5(4(x1))) -> 1(4(0(0(2(5(x1)))))) 0(5(4(x1))) -> 4(0(2(5(2(5(x1)))))) 0(5(4(x1))) -> 5(0(4(0(3(3(x1)))))) 4(2(1(x1))) -> 4(0(2(1(x1)))) 4(2(1(x1))) -> 1(2(4(0(2(x1))))) 0(1(0(4(x1)))) -> 0(0(2(2(1(4(x1)))))) 0(1(1(2(x1)))) -> 5(1(0(2(1(x1))))) 0(1(1(3(x1)))) -> 1(1(5(0(3(x1))))) 0(1(4(1(x1)))) -> 1(0(2(4(1(x1))))) 0(1(4(3(x1)))) -> 1(0(2(4(3(x1))))) 0(1(4(3(x1)))) -> 4(0(2(1(3(x1))))) 0(4(1(2(x1)))) -> 2(0(3(1(4(x1))))) 0(4(2(1(x1)))) -> 0(4(3(0(2(1(x1)))))) 0(5(0(4(x1)))) -> 1(5(4(0(0(2(x1)))))) 0(5(1(3(x1)))) -> 1(1(5(0(3(x1))))) 0(5(1(3(x1)))) -> 5(3(1(0(3(x1))))) 0(5(4(1(x1)))) -> 4(1(5(4(0(2(x1)))))) 0(5(4(3(x1)))) -> 0(2(5(0(3(4(x1)))))) 0(5(4(3(x1)))) -> 1(5(3(4(0(3(x1)))))) 1(0(5(4(x1)))) -> 1(4(5(0(3(3(x1)))))) 1(0(5(4(x1)))) -> 5(5(1(0(2(4(x1)))))) 1(4(2(1(x1)))) -> 4(0(2(1(2(1(x1)))))) 4(1(2(1(x1)))) -> 4(1(0(2(1(x1))))) 4(1(2(1(x1)))) -> 3(4(0(2(1(1(x1)))))) 4(3(2(1(x1)))) -> 0(3(4(0(2(1(x1)))))) 0(0(1(2(3(x1))))) -> 1(0(3(0(0(2(x1)))))) 0(0(5(1(2(x1))))) -> 0(0(2(5(0(1(x1)))))) 0(0(5(1(3(x1))))) -> 4(5(0(0(3(1(x1)))))) 0(1(3(4(2(x1))))) -> 1(3(4(3(0(2(x1)))))) 0(4(5(3(4(x1))))) -> 0(3(2(5(4(4(x1)))))) 0(5(0(2(2(x1))))) -> 0(0(2(5(2(4(x1)))))) 0(5(1(1(3(x1))))) -> 0(3(2(1(1(5(x1)))))) 0(5(1(4(3(x1))))) -> 3(0(2(1(5(4(x1)))))) 0(5(5(1(2(x1))))) -> 1(5(3(0(2(5(x1)))))) 1(0(1(2(4(x1))))) -> 1(1(0(2(3(4(x1)))))) 1(4(2(1(2(x1))))) -> 0(2(2(1(1(4(x1)))))) 4(0(0(5(4(x1))))) -> 5(0(0(4(4(5(x1)))))) 4(2(5(4(1(x1))))) -> 4(4(1(5(3(2(x1)))))) Proof: Bounds Processor: bound: 1 enrichment: match automaton: final states: {161,156,152,148,145,140,135,131,126,122,119,114,111, 109,104,103,99,94,91,88,83,80,77,73,70,67,63,62,59, 58,52,50,45,41,35,33,29,26,23,19,18,14,11,6,1} transitions: 41(167) -> 168* 41(183) -> 184* 01(207) -> 208* 01(182) -> 183* 01(204) -> 205* 01(191) -> 192* 01(166) -> 167* 21(202) -> 203* 21(181) -> 182* 21(190) -> 191* 11(189) -> 190* 11(168) -> 169* 11(205) -> 206* 11(185) -> 186* 11(180) -> 181* 31(203) -> 204* 31(165) -> 166* f60() -> 2* 10(60) -> 61* 10(40) -> 35* 10(15) -> 20* 10(10) -> 6* 10(5) -> 1* 10(162) -> 163* 10(147) -> 145* 10(32) -> 29* 10(17) -> 14* 10(2) -> 3* 10(54) -> 153* 10(9) -> 10* 10(4) -> 100* 10(151) -> 148* popout

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

job log

popout

actions

all output return to SRS Stand 10685