details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	9.29301095009 seconds
cpu usage	35.748816116
max memory	1.907994624E9

stage attributes

key	value
output-size	11606
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: 1(1(0(x1))) -> 4(0(1(1(4(0(0(3(3(4(x1)))))))))) 0(5(1(0(x1)))) -> 0(5(2(2(4(3(0(2(2(2(x1)))))))))) 1(0(1(0(x1)))) -> 1(0(3(2(0(4(4(2(4(2(x1)))))))))) 1(0(3(1(x1)))) -> 1(2(3(3(2(4(4(3(0(1(x1)))))))))) 2(1(0(5(x1)))) -> 2(3(4(4(2(0(2(3(0(5(x1)))))))))) 0(1(0(2(1(x1))))) -> 2(2(0(0(0(4(0(1(2(1(x1)))))))))) 1(0(5(0(1(x1))))) -> 5(0(2(2(3(4(0(2(0(1(x1)))))))))) 3(1(0(5(2(x1))))) -> 2(1(4(0(2(5(5(2(2(3(x1)))))))))) 4(4(5(3(0(x1))))) -> 4(3(1(1(3(2(0(3(3(0(x1)))))))))) 0(3(5(5(2(0(x1)))))) -> 2(2(0(1(2(0(0(2(3(4(x1)))))))))) 1(0(0(3(5(4(x1)))))) -> 1(0(3(3(4(1(3(3(4(4(x1)))))))))) 1(5(3(0(3(1(x1)))))) -> 1(2(2(1(3(0(4(4(3(1(x1)))))))))) 1(5(4(1(2(5(x1)))))) -> 1(4(4(0(2(4(2(0(3(5(x1)))))))))) 3(0(4(5(1(0(x1)))))) -> 4(1(4(2(3(4(4(2(4(0(x1)))))))))) 3(0(5(3(2(5(x1)))))) -> 4(3(1(1(3(3(2(0(0(5(x1)))))))))) 3(0(5(3(4(1(x1)))))) -> 4(2(4(3(0(3(1(1(4(1(x1)))))))))) 4(1(2(1(1(0(x1)))))) -> 4(5(3(3(0(1(1(4(0(2(x1)))))))))) 4(4(4(5(0(5(x1)))))) -> 3(4(3(3(2(4(2(4(1(4(x1)))))))))) 5(2(0(4(5(1(x1)))))) -> 5(2(2(2(3(1(0(4(0(3(x1)))))))))) 0(5(4(5(3(0(5(x1))))))) -> 0(4(2(4(4(4(3(0(0(5(x1)))))))))) 1(0(5(5(3(2(5(x1))))))) -> 3(5(5(3(3(0(2(0(4(5(x1)))))))))) 3(0(5(3(5(3(0(x1))))))) -> 1(1(2(4(1(2(0(1(4(0(x1)))))))))) 3(1(0(1(5(5(1(x1))))))) -> 2(4(1(1(3(3(3(3(1(1(x1)))))))))) 3(2(5(3(0(1(0(x1))))))) -> 2(4(1(2(3(4(3(1(1(2(x1)))))))))) 3(3(5(3(4(5(3(x1))))))) -> 0(2(2(4(2(2(1(1(1(2(x1)))))))))) 3(4(2(5(0(2(1(x1))))))) -> 3(0(4(3(2(4(4(0(0(1(x1)))))))))) 3(4(3(2(1(4(4(x1))))))) -> 3(4(3(4(3(0(3(3(0(2(x1)))))))))) 3(5(2(3(5(3(4(x1))))))) -> 3(5(1(0(3(0(0(2(4(2(x1)))))))))) 4(4(5(3(2(1(0(x1))))))) -> 4(0(5(4(1(2(2(2(3(0(x1)))))))))) 4(5(1(0(0(5(1(x1))))))) -> 5(5(2(2(2(5(5(5(1(4(x1)))))))))) 4(5(1(3(1(2(3(x1))))))) -> 5(4(1(1(1(2(3(4(0(2(x1)))))))))) 5(1(4(5(2(5(3(x1))))))) -> 5(5(1(4(2(3(0(0(3(4(x1)))))))))) 5(1(5(4(2(5(1(x1))))))) -> 5(5(2(3(0(3(4(2(1(0(x1)))))))))) 5(4(5(0(5(2(3(x1))))))) -> 5(1(1(4(2(3(0(1(3(0(x1)))))))))) Proof: String Reversal Processor: 0(1(1(x1))) -> 4(3(3(0(0(4(1(1(0(4(x1)))))))))) 0(1(5(0(x1)))) -> 2(2(2(0(3(4(2(2(5(0(x1)))))))))) 0(1(0(1(x1)))) -> 2(4(2(4(4(0(2(3(0(1(x1)))))))))) 1(3(0(1(x1)))) -> 1(0(3(4(4(2(3(3(2(1(x1)))))))))) 5(0(1(2(x1)))) -> 5(0(3(2(0(2(4(4(3(2(x1)))))))))) 1(2(0(1(0(x1))))) -> 1(2(1(0(4(0(0(0(2(2(x1)))))))))) 1(0(5(0(1(x1))))) -> 1(0(2(0(4(3(2(2(0(5(x1)))))))))) 2(5(0(1(3(x1))))) -> 3(2(2(5(5(2(0(4(1(2(x1)))))))))) 0(3(5(4(4(x1))))) -> 0(3(3(0(2(3(1(1(3(4(x1)))))))))) 0(2(5(5(3(0(x1)))))) -> 4(3(2(0(0(2(1(0(2(2(x1)))))))))) 4(5(3(0(0(1(x1)))))) -> 4(4(3(3(1(4(3(3(0(1(x1)))))))))) 1(3(0(3(5(1(x1)))))) -> 1(3(4(4(0(3(1(2(2(1(x1)))))))))) 5(2(1(4(5(1(x1)))))) -> 5(3(0(2(4(2(0(4(4(1(x1)))))))))) 0(1(5(4(0(3(x1)))))) -> 0(4(2(4(4(3(2(4(1(4(x1)))))))))) 5(2(3(5(0(3(x1)))))) -> 5(0(0(2(3(3(1(1(3(4(x1)))))))))) 1(4(3(5(0(3(x1)))))) -> 1(4(1(1(3(0(3(4(2(4(x1)))))))))) 0(1(1(2(1(4(x1)))))) -> 2(0(4(1(1(0(3(3(5(4(x1)))))))))) 5(0(5(4(4(4(x1)))))) -> 4(1(4(2(4(2(3(3(4(3(x1)))))))))) 1(5(4(0(2(5(x1)))))) -> 3(0(4(0(1(3(2(2(2(5(x1)))))))))) 5(0(3(5(4(5(0(x1))))))) -> 5(0(0(3(4(4(4(2(4(0(x1)))))))))) 5(2(3(5(5(0(1(x1))))))) -> 5(4(0(2(0(3(3(5(5(3(x1)))))))))) 0(3(5(3(5(0(3(x1))))))) -> 0(4(1(0(2(1(4(2(1(1(x1)))))))))) 1(5(5(1(0(1(3(x1))))))) -> 1(1(3(3(3(3(1(1(4(2(x1)))))))))) 0(1(0(3(5(2(3(x1))))))) -> 2(1(1(3(4(3(2(1(4(2(x1)))))))))) 3(5(4(3(5(3(3(x1))))))) -> 2(1(1(1(2(2(4(2(2(0(x1)))))))))) 1(2(0(5(2(4(3(x1))))))) -> 1(0(0(4(4(2(3(4(0(3(x1)))))))))) 4(4(1(2(3(4(3(x1))))))) -> 2(0(3(3(0(3(4(3(4(3(x1)))))))))) 4(3(5(3(2(5(3(x1))))))) -> 2(4(2(0(0(3(0(1(5(3(x1)))))))))) 0(1(2(3(5(4(4(x1))))))) -> 0(3(2(2(2(1(4(5(0(4(x1)))))))))) 1(5(0(0(1(5(4(x1))))))) -> 4(1(5(5(5(2(2(2(5(5(x1)))))))))) 3(2(1(3(1(5(4(x1))))))) -> 2(0(4(3(2(1(1(1(4(5(x1)))))))))) 3(5(2(5(4(1(5(x1))))))) -> 4(3(0(0(3(2(4(1(5(5(x1)))))))))) 1(5(2(4(5(1(5(x1))))))) -> 0(1(2(4(3(0(3(2(5(5(x1)))))))))) 3(2(5(0(5(4(5(x1))))))) -> 0(3(1(0(3(2(4(1(1(5(x1)))))))))) Bounds Processor: bound: 1 enrichment: match automaton: final states: {287,280,272,263,254,246,238,231,222,213,206,197,188, 179,170,161,151,142,133,128,119,110,102,95,88,79,70, 60,51,41,32,22,12,1} transitions: 41(311) -> 312* 41(316) -> 317* 41(322) -> 323* 41(307) -> 308* 01(318) -> 319* 01(313) -> 314* 01(308) -> 309* 01(324) -> 325* 01(312) -> 313* 40(160) -> 151* 40(273) -> 274* 40(158) -> 159* popout

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

job log

popout

actions

all output return to SRS Standard