details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	5.05535197258 seconds
cpu usage	18.776290092
max memory	1.620803584E9

stage attributes

key	value
output-size	7389
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: 0(1(2(x1))) -> 3(4(1(x1))) 0(2(0(2(x1)))) -> 3(5(4(4(x1)))) 1(0(4(5(x1)))) -> 1(5(4(5(x1)))) 2(2(1(0(4(x1))))) -> 1(5(4(2(5(x1))))) 1(1(0(1(4(3(x1)))))) -> 1(1(4(2(3(3(x1)))))) 1(4(0(2(0(4(x1)))))) -> 1(4(4(2(4(5(x1)))))) 2(2(2(0(3(5(0(x1))))))) -> 0(5(2(4(4(5(0(x1))))))) 0(0(4(0(0(5(3(0(x1)))))))) -> 0(0(0(0(2(4(5(0(x1)))))))) 1(2(4(3(0(5(4(4(x1)))))))) -> 1(4(2(3(3(1(4(x1))))))) 0(2(5(4(4(1(3(4(2(x1))))))))) -> 0(0(4(5(4(5(4(2(2(x1))))))))) 1(2(4(1(4(4(3(1(4(x1))))))))) -> 1(1(5(5(5(2(4(3(2(x1))))))))) 5(5(4(1(0(1(5(3(5(5(x1)))))))))) -> 3(4(3(4(4(4(0(4(2(5(x1)))))))))) 0(0(2(5(2(1(0(3(1(5(4(x1))))))))))) -> 0(4(2(4(5(5(5(1(0(3(1(x1))))))))))) 4(2(3(5(4(5(1(4(3(0(4(1(x1)))))))))))) -> 3(2(0(2(2(1(3(1(1(x1))))))))) 5(2(5(0(0(2(2(5(1(2(2(2(x1)))))))))))) -> 5(0(3(1(0(1(0(1(5(5(3(x1))))))))))) 2(2(3(2(2(0(2(2(2(3(0(2(4(x1))))))))))))) -> 2(4(1(3(2(4(3(1(4(4(5(4(1(x1))))))))))))) 4(0(2(2(3(2(4(2(5(5(5(3(3(x1))))))))))))) -> 4(0(5(0(4(0(4(2(4(4(2(5(3(x1))))))))))))) 0(3(5(4(3(0(5(0(3(1(2(4(5(1(x1)))))))))))))) -> 0(0(2(1(2(5(5(4(3(0(0(1(1(x1))))))))))))) 0(4(2(4(1(5(0(4(0(3(4(3(1(2(x1)))))))))))))) -> 0(0(5(4(0(4(0(1(2(2(0(0(0(1(x1)))))))))))))) 2(5(5(4(4(2(3(3(1(5(5(3(2(5(3(x1))))))))))))))) -> 2(4(0(5(3(3(5(4(2(4(3(1(5(2(x1)))))))))))))) 0(5(4(5(1(1(2(5(3(0(4(5(3(5(4(3(x1)))))))))))))))) -> 0(0(5(0(3(4(0(2(0(3(2(2(5(5(4(3(x1)))))))))))))))) 2(3(3(1(2(4(5(4(3(2(5(0(4(2(2(3(x1)))))))))))))))) -> 0(4(0(0(4(5(4(5(2(1(1(5(0(2(4(3(x1)))))))))))))))) 2(3(1(2(5(0(5(3(2(2(5(1(2(1(5(0(4(1(x1)))))))))))))))))) -> 1(1(5(3(3(1(1(5(4(4(5(2(2(3(5(2(5(5(1(x1))))))))))))))))))) 2(5(5(2(5(0(0(1(0(3(3(3(4(1(3(2(3(3(5(x1))))))))))))))))))) -> 3(2(4(0(1(5(5(4(0(3(4(4(2(0(3(1(0(3(5(x1))))))))))))))))))) 2(4(4(1(0(3(3(2(5(5(0(3(5(4(4(3(3(1(3(3(x1)))))))))))))))))))) -> 3(0(1(2(3(2(1(1(4(4(4(3(4(5(1(4(1(5(x1)))))))))))))))))) Proof: Bounds Processor: bound: 1 enrichment: match automaton: final states: {221,203,185,171,156,143,130,119,108,97,87,79,69,62,54,45,39,34,27,23,17,13,9,5,1} transitions: 20(2) -> 46* 20(187) -> 188* 20(127) -> 128* 20(111) -> 112* 20(76) -> 77* 20(134) -> 135* 20(85) -> 86* 20(176) -> 177* 20(163) -> 164* 20(219) -> 220* 20(190) -> 191* 20(133) -> 134* 20(30) -> 35* 20(31) -> 32* 20(103) -> 104* 20(159) -> 160* 20(232) -> 233* 20(83) -> 84* 20(155) -> 143* 20(107) -> 97* 20(147) -> 148* 20(10) -> 14* 20(234) -> 235* 20(56) -> 57* 20(157) -> 172* 20(11) -> 24* 20(208) -> 209* 20(88) -> 109* 20(46) -> 47* 20(82) -> 83* 20(160) -> 161* 20(191) -> 192* 20(42) -> 43* 20(125) -> 126* 20(19) -> 20* 11(246) -> 247* 11(242) -> 243* 41(243) -> 244* 41(247) -> 248* 30(68) -> 62* 30(199) -> 200* 30(145) -> 146* 30(41) -> 42* 30(226) -> 227* 30(40) -> 41* 30(101) -> 102* 30(161) -> 162* 30(121) -> 122* 30(94) -> 95* 30(198) -> 199* 30(66) -> 67* 30(211) -> 212* 30(86) -> 79* popout

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

job log

popout

actions

all output return to SRS Standard