details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	12.3034379482 seconds
cpu usage	47.600757213
max memory	2.302132224E9

stage attributes

key	value
output-size	11037
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(0(0(x1))) -> 0(4(2(2(3(2(3(3(5(5(x1)))))))))) 0(0(5(x1))) -> 1(2(3(4(1(5(0(3(3(4(x1)))))))))) 0(0(0(2(x1)))) -> 0(2(2(1(0(4(2(3(4(2(x1)))))))))) 1(3(0(0(x1)))) -> 1(2(2(2(2(3(4(3(0(3(x1)))))))))) 1(3(0(0(x1)))) -> 1(2(3(3(5(5(4(0(2(4(x1)))))))))) 5(4(2(0(x1)))) -> 5(3(4(4(0(3(5(2(3(2(x1)))))))))) 0(0(0(4(0(x1))))) -> 1(4(3(0(5(5(5(5(1(2(x1)))))))))) 0(1(3(0(0(x1))))) -> 0(5(1(0(2(3(5(2(3(0(x1)))))))))) 4(0(1(3(4(x1))))) -> 4(2(3(2(4(4(1(4(4(4(x1)))))))))) 4(0(2(0(2(x1))))) -> 5(3(1(4(3(2(1(1(2(3(x1)))))))))) 4(0(2(5(0(x1))))) -> 3(1(2(3(4(4(5(1(0(3(x1)))))))))) 5(0(0(2(5(x1))))) -> 0(1(0(3(3(4(5(3(0(5(x1)))))))))) 5(2(0(0(0(x1))))) -> 5(5(2(3(3(4(2(5(0(5(x1)))))))))) 1(0(0(5(0(0(x1)))))) -> 2(1(5(5(5(5(0(1(0(4(x1)))))))))) 1(3(5(0(5(0(x1)))))) -> 2(4(2(3(2(3(5(3(3(0(x1)))))))))) 1(5(4(0(2(4(x1)))))) -> 1(0(1(2(3(1(1(0(5(5(x1)))))))))) 2(0(0(0(0(3(x1)))))) -> 1(0(5(4(3(3(1(3(5(1(x1)))))))))) 2(0(0(5(1(0(x1)))))) -> 2(5(3(5(2(2(3(5(2(3(x1)))))))))) 2(2(1(3(1(4(x1)))))) -> 1(1(5(3(2(2(2(1(4(3(x1)))))))))) 3(0(2(0(1(3(x1)))))) -> 3(0(5(5(1(5(3(3(4(3(x1)))))))))) 4(1(2(1(4(1(x1)))))) -> 3(5(5(2(1(4(4(4(5(1(x1)))))))))) 5(0(1(3(3(2(x1)))))) -> 0(3(3(5(5(5(1(5(1(0(x1)))))))))) 5(1(3(0(2(0(x1)))))) -> 2(4(5(5(1(0(1(5(3(4(x1)))))))))) 0(0(0(1(4(0(4(x1))))))) -> 2(4(4(2(1(2(1(2(4(5(x1)))))))))) 0(2(0(2(1(4(2(x1))))))) -> 2(4(4(2(4(1(1(3(4(2(x1)))))))))) 0(3(0(0(2(2(4(x1))))))) -> 0(1(0(5(3(5(5(4(3(0(x1)))))))))) 0(3(5(0(0(2(0(x1))))))) -> 0(2(3(1(5(4(3(0(4(4(x1)))))))))) 1(0(1(3(0(0(2(x1))))))) -> 1(0(1(0(3(5(0(1(1(4(x1)))))))))) 1(0(2(0(0(2(0(x1))))))) -> 1(2(2(1(3(1(1(0(4(4(x1)))))))))) 2(0(0(2(1(3(5(x1))))))) -> 2(5(4(2(2(1(0(0(3(4(x1)))))))))) 2(0(0(4(0(0(3(x1))))))) -> 1(1(1(1(0(0(5(4(2(3(x1)))))))))) 2(1(4(0(0(0(0(x1))))))) -> 2(1(4(0(2(1(1(3(1(4(x1)))))))))) 2(4(0(5(3(2(1(x1))))))) -> 2(0(3(0(4(2(3(1(2(1(x1)))))))))) 2(5(2(0(4(5(0(x1))))))) -> 1(2(2(2(2(5(0(2(1(0(x1)))))))))) 3(0(2(2(0(1(3(x1))))))) -> 3(1(4(5(1(1(4(2(3(4(x1)))))))))) 3(4(0(2(4(0(0(x1))))))) -> 3(2(4(5(3(1(1(0(3(0(x1)))))))))) 4(0(2(4(0(1(3(x1))))))) -> 4(3(1(1(2(2(1(3(0(3(x1)))))))))) 4(4(0(5(4(0(4(x1))))))) -> 4(4(5(1(1(0(3(4(2(4(x1)))))))))) 5(0(2(5(0(2(0(x1))))))) -> 3(2(3(4(2(5(0(2(4(4(x1)))))))))) 5(2(1(4(1(4(2(x1))))))) -> 1(3(2(4(3(1(2(0(3(0(x1)))))))))) 5(4(1(1(0(5(0(x1))))))) -> 4(3(4(5(5(5(1(4(0(3(x1)))))))))) 5(4(1(1(2(0(4(x1))))))) -> 4(3(5(5(4(4(4(2(2(4(x1)))))))))) 5(4(2(0(0(1(3(x1))))))) -> 2(3(4(2(4(3(1(1(2(4(x1)))))))))) Proof: Bounds Processor: bound: 1 enrichment: match automaton: final states: {358,350,342,335,327,319,312,304,296,288,279,271,263, 255,248,239,231,223,216,207,199,190,182,174,165,157, 147,139,131,122,114,105,97,88,79,69,60,51,42,32,22, 12,1} transitions: 50(225) -> 226* 50(324) -> 325* 50(2) -> 3* 50(187) -> 188* 50(178) -> 179* 50(264) -> 265* 50(204) -> 205* 50(127) -> 128* 50(188) -> 189* 50(300) -> 301* 50(64) -> 65* 50(77) -> 78* 50(45) -> 46* 50(126) -> 127* 50(121) -> 114* 50(179) -> 180* 50(345) -> 346* 50(176) -> 177* 50(163) -> 164* 50(195) -> 196* 50(224) -> 225* 50(354) -> 355* 50(308) -> 309* 50(62) -> 63* 50(329) -> 330* 50(261) -> 262* 50(346) -> 347* 50(3) -> 4* 50(16) -> 17* 50(14) -> 200* 50(154) -> 155* 50(193) -> 194* 50(290) -> 291* 50(72) -> 73* 50(194) -> 195* 50(89) -> 158* 50(107) -> 108* popout

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

job log

popout

actions

all output return to SRS Standard