details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	4.59668493271 seconds
cpu usage	17.021998017
max memory	1.595449344E9

stage attributes

key	value
output-size	8833
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(0(x1)) -> 0(1(0(2(x1)))) 0(0(x1)) -> 1(0(2(0(x1)))) 0(0(x1)) -> 1(0(1(0(1(x1))))) 0(0(x1)) -> 1(0(1(2(0(x1))))) 0(0(x1)) -> 1(0(2(0(3(x1))))) 0(0(x1)) -> 1(0(2(2(0(x1))))) 0(0(x1)) -> 2(1(0(2(0(x1))))) 0(0(x1)) -> 0(1(0(2(1(2(x1)))))) 0(0(x1)) -> 1(0(1(0(2(2(x1)))))) 0(0(x1)) -> 1(0(1(3(0(1(x1)))))) 0(0(x1)) -> 1(0(4(1(0(2(x1)))))) 0(0(x1)) -> 1(1(1(0(2(0(x1)))))) 0(0(x1)) -> 3(0(4(0(2(2(x1)))))) 0(0(x1)) -> 3(1(0(1(0(4(x1)))))) 0(0(0(x1))) -> 0(1(0(4(0(4(x1)))))) 0(0(0(x1))) -> 3(0(0(1(0(2(x1)))))) 3(0(0(x1))) -> 3(0(2(0(3(x1))))) 3(0(0(x1))) -> 3(0(2(4(0(2(x1)))))) 5(2(0(x1))) -> 0(2(3(5(x1)))) 5(2(0(x1))) -> 3(5(0(2(x1)))) 5(2(0(x1))) -> 0(2(3(3(5(x1))))) 5(2(0(x1))) -> 1(0(2(3(5(x1))))) 5(2(0(x1))) -> 5(1(0(2(4(x1))))) 5(2(0(x1))) -> 5(0(1(2(2(2(x1)))))) 5(2(0(x1))) -> 5(3(5(1(0(2(x1)))))) 0(5(2(0(x1)))) -> 0(5(0(2(2(x1))))) 3(4(0(0(x1)))) -> 0(3(3(0(4(5(x1)))))) 3(4(0(0(x1)))) -> 3(0(4(5(3(0(x1)))))) 5(1(0(0(x1)))) -> 0(3(1(0(1(5(x1)))))) 5(1(4(0(x1)))) -> 0(1(5(2(4(x1))))) 5(1(5(0(x1)))) -> 5(1(0(3(5(x1))))) 5(2(2(0(x1)))) -> 0(2(1(2(4(5(x1)))))) 5(3(2(0(x1)))) -> 5(3(0(1(2(x1))))) 5(3(2(0(x1)))) -> 3(3(5(3(0(2(x1)))))) 5(4(0(0(x1)))) -> 0(4(5(5(0(2(x1)))))) 5(4(2(0(x1)))) -> 2(4(3(5(0(x1))))) 5(4(2(0(x1)))) -> 5(0(2(2(4(x1))))) 5(4(2(0(x1)))) -> 5(4(5(0(2(x1))))) 0(3(5(2(0(x1))))) -> 3(0(2(5(3(0(x1)))))) 3(3(5(2(0(x1))))) -> 3(5(2(3(0(2(x1)))))) 3(3(5(2(0(x1))))) -> 4(3(3(5(0(2(x1)))))) 5(0(5(2(0(x1))))) -> 0(3(5(5(0(2(x1)))))) 5(1(4(0(0(x1))))) -> 0(2(5(0(1(4(x1)))))) 5(3(3(2(0(x1))))) -> 5(2(3(3(0(2(x1)))))) 5(4(3(0(0(x1))))) -> 1(0(4(0(3(5(x1)))))) Proof: String Reversal Processor: 0(0(x1)) -> 2(0(1(0(x1)))) 0(0(x1)) -> 0(2(0(1(x1)))) 0(0(x1)) -> 1(0(1(0(1(x1))))) 0(0(x1)) -> 0(2(1(0(1(x1))))) 0(0(x1)) -> 3(0(2(0(1(x1))))) 0(0(x1)) -> 0(2(2(0(1(x1))))) 0(0(x1)) -> 0(2(0(1(2(x1))))) 0(0(x1)) -> 2(1(2(0(1(0(x1)))))) 0(0(x1)) -> 2(2(0(1(0(1(x1)))))) 0(0(x1)) -> 1(0(3(1(0(1(x1)))))) 0(0(x1)) -> 2(0(1(4(0(1(x1)))))) 0(0(x1)) -> 0(2(0(1(1(1(x1)))))) 0(0(x1)) -> 2(2(0(4(0(3(x1)))))) 0(0(x1)) -> 4(0(1(0(1(3(x1)))))) 0(0(0(x1))) -> 4(0(4(0(1(0(x1)))))) 0(0(0(x1))) -> 2(0(1(0(0(3(x1)))))) 0(0(3(x1))) -> 3(0(2(0(3(x1))))) 0(0(3(x1))) -> 2(0(4(2(0(3(x1)))))) 0(2(5(x1))) -> 5(3(2(0(x1)))) 0(2(5(x1))) -> 2(0(5(3(x1)))) 0(2(5(x1))) -> 5(3(3(2(0(x1))))) 0(2(5(x1))) -> 5(3(2(0(1(x1))))) 0(2(5(x1))) -> 4(2(0(1(5(x1))))) 0(2(5(x1))) -> 2(2(2(1(0(5(x1)))))) 0(2(5(x1))) -> 2(0(1(5(3(5(x1)))))) 0(2(5(0(x1)))) -> 2(2(0(5(0(x1))))) 0(0(4(3(x1)))) -> 5(4(0(3(3(0(x1)))))) 0(0(4(3(x1)))) -> 0(3(5(4(0(3(x1)))))) 0(0(1(5(x1)))) -> 5(1(0(1(3(0(x1)))))) 0(4(1(5(x1)))) -> 4(2(5(1(0(x1))))) 0(5(1(5(x1)))) -> 5(3(0(1(5(x1))))) 0(2(2(5(x1)))) -> 5(4(2(1(2(0(x1)))))) 0(2(3(5(x1)))) -> 2(1(0(3(5(x1))))) 0(2(3(5(x1)))) -> 2(0(3(5(3(3(x1)))))) 0(0(4(5(x1)))) -> 2(0(5(5(4(0(x1)))))) 0(2(4(5(x1)))) -> 0(5(3(4(2(x1))))) 0(2(4(5(x1)))) -> 4(2(2(0(5(x1))))) 0(2(4(5(x1)))) -> 2(0(5(4(5(x1))))) 0(2(5(3(0(x1))))) -> 0(3(5(2(0(3(x1)))))) 0(2(5(3(3(x1))))) -> 2(0(3(2(5(3(x1)))))) 0(2(5(3(3(x1))))) -> 2(0(5(3(3(4(x1)))))) 0(2(5(0(5(x1))))) -> 2(0(5(5(3(0(x1)))))) 0(0(4(1(5(x1))))) -> 4(1(0(5(2(0(x1)))))) popout

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

job log

popout

actions

all output return to SRS Standard