details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	6.87883996964 seconds
cpu usage	25.943826869
max memory	1.6700416E9

stage attributes

key	value
output-size	8620
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: 2(4(2(x1))) -> 0(2(0(0(5(1(0(2(0(4(x1)))))))))) 1(4(2(1(x1)))) -> 2(4(1(5(4(3(2(3(1(2(x1)))))))))) 1(4(4(2(x1)))) -> 3(4(0(3(0(2(5(5(1(2(x1)))))))))) 1(5(3(1(x1)))) -> 1(1(5(4(3(0(2(1(1(1(x1)))))))))) 1(5(4(0(x1)))) -> 3(3(1(1(1(4(0(1(0(0(x1)))))))))) 2(2(4(1(x1)))) -> 0(2(2(0(3(0(2(5(0(0(x1)))))))))) 2(4(2(1(x1)))) -> 0(1(0(3(5(3(2(3(2(1(x1)))))))))) 1(4(1(2(0(x1))))) -> 5(2(0(4(0(5(0(5(1(2(x1)))))))))) 1(4(2(4(0(x1))))) -> 5(1(4(3(5(0(0(0(3(0(x1)))))))))) 1(4(4(1(4(x1))))) -> 3(3(2(1(0(5(0(5(2(4(x1)))))))))) 1(5(4(2(1(x1))))) -> 3(4(1(3(3(3(3(3(0(1(x1)))))))))) 2(1(4(4(1(x1))))) -> 2(5(0(2(2(1(2(0(0(0(x1)))))))))) 3(2(4(4(2(x1))))) -> 3(3(3(0(2(3(1(4(0(4(x1)))))))))) 5(3(2(1(5(x1))))) -> 0(4(0(4(3(4(3(2(2(5(x1)))))))))) 1(4(0(4(0(5(x1)))))) -> 5(1(1(2(4(0(2(1(3(5(x1)))))))))) 1(5(5(3(2(2(x1)))))) -> 0(1(2(4(0(5(0(1(2(3(x1)))))))))) 2(5(3(0(4(4(x1)))))) -> 2(2(5(0(4(4(5(0(4(4(x1)))))))))) 3(1(2(4(2(4(x1)))))) -> 4(3(2(0(1(2(3(0(5(4(x1)))))))))) 3(4(2(2(0(5(x1)))))) -> 0(1(3(1(2(0(2(0(4(3(x1)))))))))) 4(1(1(4(0(4(x1)))))) -> 4(0(2(3(5(0(4(1(5(2(x1)))))))))) 5(5(0(1(4(2(x1)))))) -> 5(2(0(1(2(4(1(3(3(3(x1)))))))))) 0(1(4(0(0(4(2(x1))))))) -> 0(1(0(1(5(2(1(0(1(2(x1)))))))))) 1(0(4(4(2(5(5(x1))))))) -> 1(0(4(1(0(5(3(5(2(5(x1)))))))))) 1(3(0(5(4(1(4(x1))))))) -> 1(0(3(0(1(3(1(3(2(4(x1)))))))))) 1(4(2(4(1(3(5(x1))))))) -> 4(4(3(3(5(0(0(0(2(5(x1)))))))))) 1(5(5(4(0(2(5(x1))))))) -> 1(1(4(3(2(1(4(1(1(5(x1)))))))))) 2(4(2(1(5(4(1(x1))))))) -> 0(1(0(4(0(3(0(5(4(1(x1)))))))))) 4(2(5(0(1(4(2(x1))))))) -> 4(2(5(3(0(1(2(3(2(1(x1)))))))))) 5(2(2(0(4(4(2(x1))))))) -> 2(0(1(1(2(4(5(5(0(2(x1)))))))))) 5(2(2(0(5(4(0(x1))))))) -> 1(5(1(3(0(0(1(3(2(1(x1)))))))))) 5(3(1(4(2(4(0(x1))))))) -> 5(5(3(1(1(3(0(1(5(2(x1)))))))))) 5(5(1(4(4(2(5(x1))))))) -> 3(5(0(5(4(0(1(5(2(5(x1)))))))))) Proof: Bounds Processor: bound: 1 enrichment: match automaton: final states: {270,263,256,247,241,232,223,215,207,199,191,182,173, 164,155,146,136,127,117,109,101,92,83,74,67,58,50,40, 30,22,12,1} transitions: 01(288) -> 289* 01(302) -> 303* 01(297) -> 298* 01(292) -> 293* 01(289) -> 290* 01(294) -> 295* 01(300) -> 301* 01(306) -> 307* 01(305) -> 306* 01(308) -> 309* 31(293) -> 294* 00(69) -> 70* 00(119) -> 216* 00(160) -> 161* 00(13) -> 248* 00(77) -> 78* 00(106) -> 107* 00(145) -> 136* 00(5) -> 6* 00(31) -> 93* 00(188) -> 189* 00(242) -> 243* 00(41) -> 42* 00(34) -> 35* 00(57) -> 50* 00(126) -> 117* 00(85) -> 86* 00(75) -> 76* 00(42) -> 102* 00(172) -> 164* 00(205) -> 206* 00(240) -> 232* 00(52) -> 53* 00(165) -> 166* 00(27) -> 28* 00(180) -> 181* 00(130) -> 131* 00(139) -> 140* 00(216) -> 217* 00(23) -> 68* 00(198) -> 191* 00(238) -> 239* 00(66) -> 58* 00(141) -> 142* 00(176) -> 177* 00(211) -> 212* 00(87) -> 88* 00(14) -> 192* 00(147) -> 148* popout

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

job log

popout

actions

all output return to SRS Standard