details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	7.00790286064 seconds
cpu usage	25.789665646
max memory	1.271771136E9

stage attributes

key	value
output-size	13690
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: 0(0(1(1(2(x1))))) -> 3(2(4(4(x1)))) 5(3(4(2(2(x1))))) -> 5(1(3(1(x1)))) 4(4(4(4(1(5(0(x1))))))) -> 5(4(0(3(3(4(5(x1))))))) 5(3(4(0(4(4(4(2(x1)))))))) -> 5(3(1(4(4(4(1(x1))))))) 1(3(3(0(4(5(4(5(1(2(x1)))))))))) -> 4(3(5(5(3(2(5(1(1(x1))))))))) 4(1(4(5(4(0(3(3(2(0(x1)))))))))) -> 5(4(1(5(1(3(2(3(1(x1))))))))) 0(1(3(0(3(4(2(2(1(2(3(x1))))))))))) -> 0(0(5(3(3(4(0(2(3(3(x1)))))))))) 4(0(2(0(2(1(4(3(3(0(3(x1))))))))))) -> 0(2(1(2(5(5(1(1(3(4(x1)))))))))) 2(2(3(5(3(1(0(5(0(1(3(5(x1)))))))))))) -> 2(2(2(5(3(4(2(0(2(2(1(4(x1)))))))))))) 3(3(3(5(2(2(2(5(1(0(1(0(x1)))))))))))) -> 5(5(3(2(1(2(2(1(3(1(0(x1))))))))))) 0(1(2(5(2(3(0(5(4(1(1(0(5(x1))))))))))))) -> 1(2(1(1(5(1(1(1(4(1(4(5(x1)))))))))))) 0(2(2(3(2(3(0(3(3(0(4(2(5(x1))))))))))))) -> 2(1(4(2(3(2(0(1(1(2(4(5(x1)))))))))))) 0(4(3(1(2(5(3(2(4(5(2(5(5(x1))))))))))))) -> 4(5(1(3(5(1(1(2(4(5(1(5(x1)))))))))))) 1(2(0(3(2(2(5(3(5(1(2(1(5(x1))))))))))))) -> 4(4(2(1(0(3(0(2(3(2(3(5(x1)))))))))))) 2(0(2(0(3(4(3(1(1(3(0(3(4(x1))))))))))))) -> 2(5(4(1(0(1(1(2(2(0(5(5(x1)))))))))))) 1(2(2(4(2(3(1(5(1(0(2(5(5(4(x1)))))))))))))) -> 4(1(0(1(4(3(2(0(2(3(4(5(4(x1))))))))))))) 4(1(3(4(3(0(4(2(0(1(0(2(1(2(x1)))))))))))))) -> 1(0(4(0(0(1(3(5(3(4(4(4(1(x1))))))))))))) 0(0(3(5(4(3(3(2(2(0(3(3(1(4(2(x1))))))))))))))) -> 0(4(4(0(1(4(3(0(3(0(0(0(2(4(x1)))))))))))))) 0(1(5(2(0(2(2(1(1(5(4(1(2(4(2(x1))))))))))))))) -> 1(4(5(0(4(3(3(4(3(1(2(1(4(2(x1)))))))))))))) 0(1(5(3(1(0(1(0(5(2(1(3(4(5(0(x1))))))))))))))) -> 0(1(1(1(4(0(4(1(5(1(4(5(5(5(0(x1))))))))))))))) 1(1(5(4(5(3(4(3(3(4(5(5(5(5(0(x1))))))))))))))) -> 2(5(4(3(4(2(0(5(2(4(1(2(5(0(2(x1))))))))))))))) 2(4(1(1(5(1(2(3(0(3(1(2(1(1(1(x1))))))))))))))) -> 2(4(0(4(5(1(1(0(0(2(0(0(3(1(x1)))))))))))))) 5(1(3(0(3(3(3(3(0(5(3(1(5(2(2(x1))))))))))))))) -> 5(0(2(4(5(5(5(2(2(4(1(1(1(2(x1)))))))))))))) 1(4(3(1(4(2(2(3(1(3(4(4(2(5(0(2(x1)))))))))))))))) -> 5(1(0(2(5(1(0(1(3(4(5(4(0(2(1(x1))))))))))))))) 1(1(0(0(1(3(4(5(2(2(1(4(4(4(4(5(3(0(x1)))))))))))))))))) -> 4(1(5(5(4(1(1(5(2(4(3(2(0(4(4(3(3(0(x1)))))))))))))))))) 3(2(4(4(5(1(4(5(3(3(5(1(0(4(3(3(2(0(x1)))))))))))))))))) -> 3(2(3(1(2(0(5(2(2(4(2(3(0(3(2(5(4(2(2(x1))))))))))))))))))) 3(5(4(5(2(4(4(3(1(1(2(4(4(0(4(1(4(0(0(x1))))))))))))))))))) -> 4(3(3(0(1(0(4(1(1(3(3(4(5(5(4(5(3(0(1(x1))))))))))))))))))) 4(0(5(2(2(3(2(2(5(3(1(2(1(0(3(1(2(5(1(2(x1)))))))))))))))))))) -> 1(2(0(1(2(0(2(1(5(0(5(3(5(5(3(1(0(5(1(x1))))))))))))))))))) 3(4(0(5(0(2(5(1(0(3(5(4(2(3(3(2(3(2(0(0(0(x1))))))))))))))))))))) -> 3(3(5(0(5(3(4(1(5(0(2(3(2(4(5(5(3(5(4(1(x1)))))))))))))))))))) 3(5(0(2(0(5(4(3(1(0(4(0(2(5(2(2(1(4(5(2(4(x1))))))))))))))))))))) -> 5(3(0(4(1(5(3(1(3(4(1(4(2(3(5(0(4(3(3(5(4(x1))))))))))))))))))))) Proof: String Reversal Processor: 2(1(1(0(0(x1))))) -> 4(4(2(3(x1)))) 2(2(4(3(5(x1))))) -> 1(3(1(5(x1)))) 0(5(1(4(4(4(4(x1))))))) -> 5(4(3(3(0(4(5(x1))))))) 2(4(4(4(0(4(3(5(x1)))))))) -> 1(4(4(4(1(3(5(x1))))))) 2(1(5(4(5(4(0(3(3(1(x1)))))))))) -> 1(1(5(2(3(5(5(3(4(x1))))))))) 0(2(3(3(0(4(5(4(1(4(x1)))))))))) -> 1(3(2(3(1(5(1(4(5(x1))))))))) 3(2(1(2(2(4(3(0(3(1(0(x1))))))))))) -> 3(3(2(0(4(3(3(5(0(0(x1)))))))))) 3(0(3(3(4(1(2(0(2(0(4(x1))))))))))) -> 4(3(1(1(5(5(2(1(2(0(x1)))))))))) 5(3(1(0(5(0(1(3(5(3(2(2(x1)))))))))))) -> 4(1(2(2(0(2(4(3(5(2(2(2(x1)))))))))))) 0(1(0(1(5(2(2(2(5(3(3(3(x1)))))))))))) -> 0(1(3(1(2(2(1(2(3(5(5(x1))))))))))) 5(0(1(1(4(5(0(3(2(5(2(1(0(x1))))))))))))) -> 5(4(1(4(1(1(1(5(1(1(2(1(x1)))))))))))) 5(2(4(0(3(3(0(3(2(3(2(2(0(x1))))))))))))) -> 5(4(2(1(1(0(2(3(2(4(1(2(x1)))))))))))) 5(5(2(5(4(2(3(5(2(1(3(4(0(x1))))))))))))) -> 5(1(5(4(2(1(1(5(3(1(5(4(x1)))))))))))) 5(1(2(1(5(3(5(2(2(3(0(2(1(x1))))))))))))) -> 5(3(2(3(2(0(3(0(1(2(4(4(x1)))))))))))) 4(3(0(3(1(1(3(4(3(0(2(0(2(x1))))))))))))) -> 5(5(0(2(2(1(1(0(1(4(5(2(x1)))))))))))) 4(5(5(2(0(1(5(1(3(2(4(2(2(1(x1)))))))))))))) -> 4(5(4(3(2(0(2(3(4(1(0(1(4(x1))))))))))))) 2(1(2(0(1(0(2(4(0(3(4(3(1(4(x1)))))))))))))) -> 1(4(4(4(3(5(3(1(0(0(4(0(1(x1))))))))))))) 2(4(1(3(3(0(2(2(3(3(4(5(3(0(0(x1))))))))))))))) -> 4(2(0(0(0(3(0(3(4(1(0(4(4(0(x1)))))))))))))) 2(4(2(1(4(5(1(1(2(2(0(2(5(1(0(x1))))))))))))))) -> 2(4(1(2(1(3(4(3(3(4(0(5(4(1(x1)))))))))))))) 0(5(4(3(1(2(5(0(1(0(1(3(5(1(0(x1))))))))))))))) -> 0(5(5(5(4(1(5(1(4(0(4(1(1(1(0(x1))))))))))))))) 0(5(5(5(5(4(3(3(4(3(5(4(5(1(1(x1))))))))))))))) -> 2(0(5(2(1(4(2(5(0(2(4(3(4(5(2(x1))))))))))))))) 1(1(1(2(1(3(0(3(2(1(5(1(1(4(2(x1))))))))))))))) -> 1(3(0(0(2(0(0(1(1(5(4(0(4(2(x1)))))))))))))) 2(2(5(1(3(5(0(3(3(3(3(0(3(1(5(x1))))))))))))))) -> 2(1(1(1(4(2(2(5(5(5(4(2(0(5(x1)))))))))))))) 2(0(5(2(4(4(3(1(3(2(2(4(1(3(4(1(x1)))))))))))))))) -> 1(2(0(4(5(4(3(1(0(1(5(2(0(1(5(x1))))))))))))))) 0(3(5(4(4(4(4(1(2(2(5(4(3(1(0(0(1(1(x1)))))))))))))))))) -> 0(3(3(4(4(0(2(3(4(2(5(1(1(4(5(5(1(4(x1)))))))))))))))))) 0(2(3(3(4(0(1(5(3(3(5(4(1(5(4(4(2(3(x1)))))))))))))))))) -> 2(2(4(5(2(3(0(3(2(4(2(2(5(0(2(1(3(2(3(x1))))))))))))))))))) 0(0(4(1(4(0(4(4(2(1(1(3(4(4(2(5(4(5(3(x1))))))))))))))))))) -> 1(0(3(5(4(5(5(4(3(3(1(1(4(0(1(0(3(3(4(x1))))))))))))))))))) 2(1(5(2(1(3(0(1(2(1(3(5(2(2(3(2(2(5(0(4(x1)))))))))))))))))))) -> 1(5(0(1(3(5(5(3(5(0(5(1(2(0(2(1(0(2(1(x1))))))))))))))))))) 0(0(0(2(3(2(3(3(2(4(5(3(0(1(5(2(0(5(0(4(3(x1))))))))))))))))))))) -> 1(4(5(3(5(5(4(2(3(2(0(5(1(4(3(5(0(5(3(3(x1)))))))))))))))))))) 4(2(5(4(1(2(2(5(2(0(4(0(1(3(4(5(0(2(0(5(3(x1))))))))))))))))))))) -> 4(5(3(3(4(0(5(3(2(4(1(4(3(1(3(5(1(4(0(3(5(x1))))))))))))))))))))) Bounds Processor: bound: 0 enrichment: match automaton: final states: {336,317,300,283,266,250,237,224,211,199,185,172,159, 147,135,124,113,102,91,79,69,57,48,38,31,22,16,10, 6,1} transitions: f60() -> 2* 40(262) -> 263* 40(257) -> 258* 40(252) -> 253* popout

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

job log

popout

actions

all output return to SRS Stand 10685