details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	7.1632630825 seconds
cpu usage	27.091855311
max memory	1.756639232E9

stage attributes

key	value
output-size	7168
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: 0(1(2(x1))) -> 0(0(2(1(x1)))) 0(1(2(x1))) -> 0(2(1(3(x1)))) 0(1(2(x1))) -> 0(0(2(1(4(4(x1)))))) 0(3(1(x1))) -> 0(1(3(4(0(x1))))) 0(3(1(x1))) -> 0(1(3(4(4(x1))))) 0(3(1(x1))) -> 1(3(4(4(4(0(x1)))))) 0(3(2(x1))) -> 0(2(1(3(x1)))) 0(3(2(x1))) -> 0(2(3(4(x1)))) 0(3(2(x1))) -> 0(0(2(4(3(x1))))) 0(3(2(x1))) -> 0(2(1(4(3(x1))))) 0(3(2(x1))) -> 0(2(4(3(3(x1))))) 0(3(2(x1))) -> 0(2(1(3(3(4(x1)))))) 0(3(2(x1))) -> 0(2(3(4(5(5(x1)))))) 0(3(2(x1))) -> 2(4(4(3(4(0(x1)))))) 0(4(1(x1))) -> 0(1(4(4(x1)))) 0(4(1(x1))) -> 0(2(1(4(x1)))) 0(4(2(x1))) -> 0(2(1(4(x1)))) 0(4(2(x1))) -> 0(2(3(4(x1)))) 0(4(2(x1))) -> 0(2(4(3(x1)))) 2(0(1(x1))) -> 5(0(2(1(x1)))) 2(3(1(x1))) -> 1(3(5(2(x1)))) 2(3(1(x1))) -> 0(2(1(3(5(x1))))) 2(3(1(x1))) -> 1(4(3(5(2(x1))))) 0(2(0(1(x1)))) -> 5(0(0(2(1(x1))))) 0(3(1(1(x1)))) -> 0(1(4(1(3(4(x1)))))) 0(3(2(1(x1)))) -> 0(0(3(4(2(1(x1)))))) 0(3(2(2(x1)))) -> 1(3(4(0(2(2(x1)))))) 0(4(1(2(x1)))) -> 1(4(0(2(5(x1))))) 0(4(3(2(x1)))) -> 2(3(4(4(0(0(x1)))))) 0(5(3(1(x1)))) -> 0(1(4(3(5(4(x1)))))) 0(5(3(1(x1)))) -> 0(1(5(3(4(0(x1)))))) 0(5(3(2(x1)))) -> 0(2(4(5(3(x1))))) 0(5(3(2(x1)))) -> 0(2(5(3(3(x1))))) 2(0(3(1(x1)))) -> 2(0(1(3(5(2(x1)))))) 2(0(4(1(x1)))) -> 2(0(1(4(5(x1))))) 2(5(3(2(x1)))) -> 2(5(2(3(3(x1))))) 2(5(4(2(x1)))) -> 0(2(5(2(4(x1))))) 0(0(3(2(1(x1))))) -> 0(0(1(3(5(2(x1)))))) 0(1(0(3(2(x1))))) -> 0(1(4(3(2(0(x1)))))) 0(1(0(3(2(x1))))) -> 2(3(1(0(0(5(x1)))))) 0(3(2(5(1(x1))))) -> 0(2(5(1(3(3(x1)))))) 0(5(1(1(2(x1))))) -> 0(2(4(1(1(5(x1)))))) 0(5(1(2(2(x1))))) -> 0(2(5(2(1(2(x1)))))) 0(5(3(2(1(x1))))) -> 0(1(3(4(2(5(x1)))))) 0(5(5(3(2(x1))))) -> 0(2(5(1(3(5(x1)))))) 2(0(3(1(1(x1))))) -> 2(1(0(1(3(4(x1)))))) 2(2(0(3(1(x1))))) -> 1(3(0(2(5(2(x1)))))) 2(2(0(5(1(x1))))) -> 2(0(2(1(5(1(x1)))))) 2(5(5(4(1(x1))))) -> 5(5(2(1(3(4(x1)))))) Proof: Bounds Processor: bound: 1 enrichment: match automaton: final states: {165,160,156,153,150,146,141,136,132,127,122,121,117, 114,110,108,105,101,98,93,88,84,79,75,71,70,68,64,60, 59,34,56,55,52,46,42,38,35,31,28,24,21,16,10,6,1} transitions: 11(206) -> 207* 11(226) -> 227* 11(242) -> 243* 11(234) -> 235* 11(230) -> 231* 11(168) -> 169* 11(236) -> 237* 11(191) -> 192* 11(219) -> 220* 11(248) -> 249* 11(183) -> 184* 11(246) -> 247* 31(190) -> 191* 31(205) -> 206* 00(47) -> 128* 00(72) -> 154* 00(13) -> 55* 00(77) -> 78* 00(145) -> 141* 00(5) -> 1* 00(58) -> 56* 00(109) -> 121* 00(78) -> 75* 00(41) -> 38* 00(34) -> 31* 00(60) -> 109* 00(97) -> 93* 00(126) -> 122* 00(120) -> 117* 00(20) -> 16* 00(85) -> 86* 00(45) -> 42* popout

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

job log

popout

actions

all output return to SRS Standard