details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	0.510698080063 seconds
cpu usage	0.825800822
max memory	1.11837184E8

stage attributes

key	value
output-size	1311
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(1(2(3(4(x1))))) -> 0(2(1(3(4(x1))))) 0(5(1(2(4(3(x1)))))) -> 0(5(2(1(4(3(x1)))))) 0(5(2(4(1(3(x1)))))) -> 0(1(5(2(4(3(x1)))))) 0(5(3(1(2(4(x1)))))) -> 0(1(5(3(2(4(x1)))))) 0(5(4(1(3(2(x1)))))) -> 0(5(4(3(1(2(x1)))))) Proof: String Reversal Processor: 4(3(2(1(0(x1))))) -> 4(3(1(2(0(x1))))) 3(4(2(1(5(0(x1)))))) -> 3(4(1(2(5(0(x1)))))) 3(1(4(2(5(0(x1)))))) -> 3(4(2(5(1(0(x1)))))) 4(2(1(3(5(0(x1)))))) -> 4(2(3(5(1(0(x1)))))) 2(3(1(4(5(0(x1)))))) -> 2(1(3(4(5(0(x1)))))) Bounds Processor: bound: 0 enrichment: match automaton: final states: {20,17,12,7,1} transitions: f60() -> 2* 40(15) -> 16* 40(10) -> 11* 40(19) -> 17* 40(6) -> 1* 40(8) -> 21* 30(5) -> 6* 30(14) -> 18* 30(21) -> 22* 30(16) -> 12* 30(11) -> 7* 10(22) -> 23* 10(9) -> 10* 10(4) -> 5* 10(3) -> 13* 20(14) -> 15* 20(23) -> 20* 20(18) -> 19* 20(8) -> 9* 20(3) -> 4* 00(2) -> 3* 50(13) -> 14* 50(3) -> 8* problem: Qed popout

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

job log

popout

actions

all output return to SRS Stand 10685