details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	6.11823797226 seconds
cpu usage	22.736228724
max memory	1.572409344E9

stage attributes

key	value
output-size	10703
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(1(2(3(1(x1))))) -> 0(0(1(1(x1)))) 4(5(2(3(5(x1))))) -> 4(4(0(5(x1)))) 5(3(2(4(3(2(x1)))))) -> 5(3(0(5(4(x1))))) 2(2(5(5(2(2(1(x1))))))) -> 3(2(3(3(1(0(x1)))))) 4(5(2(1(1(3(4(x1))))))) -> 1(1(0(5(0(x1))))) 0(2(2(3(3(2(5(0(4(x1))))))))) -> 0(2(2(1(3(4(1(4(x1)))))))) 2(3(0(4(0(0(5(2(4(x1))))))))) -> 3(2(2(2(3(0(4(0(4(x1))))))))) 2(4(3(3(3(5(0(1(3(x1))))))))) -> 0(1(0(0(5(0(5(x1))))))) 2(3(5(3(3(4(1(5(1(2(x1)))))))))) -> 2(0(3(5(2(5(1(3(4(2(x1)))))))))) 3(0(1(2(4(0(0(3(3(4(x1)))))))))) -> 3(1(5(0(4(2(0(2(5(4(x1)))))))))) 1(1(4(0(4(2(1(2(4(5(3(x1))))))))))) -> 1(1(0(1(5(2(2(0(2(4(x1)))))))))) 3(1(2(4(0(0(3(3(1(4(5(x1))))))))))) -> 2(3(1(1(4(0(4(2(2(2(5(x1))))))))))) 4(3(0(4(1(0(4(1(5(0(3(x1))))))))))) -> 0(4(2(3(0(0(1(5(5(1(x1)))))))))) 0(5(1(0(1(1(2(2(1(1(2(2(2(2(x1)))))))))))))) -> 0(3(0(5(3(1(3(0(3(4(2(3(3(1(4(x1))))))))))))))) 0(5(2(1(1(4(2(5(2(0(1(3(3(3(x1)))))))))))))) -> 0(4(0(4(4(4(5(0(2(4(0(3(2(2(x1)))))))))))))) 3(0(2(3(2(0(3(3(2(1(2(2(0(1(3(x1))))))))))))))) -> 2(1(5(3(2(1(2(2(0(4(0(1(3(1(x1)))))))))))))) 0(5(2(3(4(0(5(3(2(4(2(2(4(0(3(4(x1)))))))))))))))) -> 0(0(0(5(1(3(2(2(3(0(1(3(2(1(x1)))))))))))))) 4(4(2(5(3(3(1(1(3(1(1(0(5(3(1(4(x1)))))))))))))))) -> 4(2(4(4(4(2(1(5(5(4(3(3(0(5(1(5(4(x1))))))))))))))))) 5(3(5(1(1(5(4(2(2(4(1(5(0(5(4(3(x1)))))))))))))))) -> 0(0(4(2(2(1(3(2(1(0(5(1(1(1(x1)))))))))))))) 2(2(0(1(4(3(5(4(2(2(5(1(0(5(0(5(4(5(2(x1))))))))))))))))))) -> 3(3(4(2(0(4(5(2(5(2(0(0(4(4(3(5(1(4(5(2(x1)))))))))))))))))))) 2(5(3(4(1(3(2(5(3(1(1(2(2(1(0(2(4(3(3(x1))))))))))))))))))) -> 0(3(5(2(3(1(1(0(3(4(3(4(0(0(5(2(2(3(x1)))))))))))))))))) 5(3(1(5(0(1(4(4(2(4(3(2(5(0(4(1(0(4(4(x1))))))))))))))))))) -> 5(2(2(4(1(1(5(2(3(4(2(5(2(0(2(0(2(5(4(x1))))))))))))))))))) 2(3(0(3(2(3(1(1(4(2(5(3(4(2(5(2(5(0(2(3(1(x1))))))))))))))))))))) -> 3(2(4(3(2(1(3(3(1(0(1(1(3(3(0(3(0(5(1(x1))))))))))))))))))) 3(1(2(1(3(1(2(2(4(1(1(3(2(4(4(3(2(0(3(4(5(x1))))))))))))))))))))) -> 2(5(5(1(1(2(1(0(1(3(1(0(5(2(4(1(1(5(x1)))))))))))))))))) 5(4(3(1(3(4(5(3(0(1(3(4(0(2(2(4(3(3(0(5(3(x1))))))))))))))))))))) -> 5(5(1(1(5(2(4(0(0(1(0(1(2(0(5(1(3(5(x1)))))))))))))))))) Proof: String Reversal Processor: 1(3(2(1(0(x1))))) -> 1(1(0(0(x1)))) 5(3(2(5(4(x1))))) -> 5(0(4(4(x1)))) 2(3(4(2(3(5(x1)))))) -> 4(5(0(3(5(x1))))) 1(2(2(5(5(2(2(x1))))))) -> 0(1(3(3(2(3(x1)))))) 4(3(1(1(2(5(4(x1))))))) -> 0(5(0(1(1(x1))))) 4(0(5(2(3(3(2(2(0(x1))))))))) -> 4(1(4(3(1(2(2(0(x1)))))))) 4(2(5(0(0(4(0(3(2(x1))))))))) -> 4(0(4(0(3(2(2(2(3(x1))))))))) 3(1(0(5(3(3(3(4(2(x1))))))))) -> 5(0(5(0(0(1(0(x1))))))) 2(1(5(1(4(3(3(5(3(2(x1)))))))))) -> 2(4(3(1(5(2(5(3(0(2(x1)))))))))) 4(3(3(0(0(4(2(1(0(3(x1)))))))))) -> 4(5(2(0(2(4(0(5(1(3(x1)))))))))) 3(5(4(2(1(2(4(0(4(1(1(x1))))))))))) -> 4(2(0(2(2(5(1(0(1(1(x1)))))))))) 5(4(1(3(3(0(0(4(2(1(3(x1))))))))))) -> 5(2(2(2(4(0(4(1(1(3(2(x1))))))))))) 3(0(5(1(4(0(1(4(0(3(4(x1))))))))))) -> 1(5(5(1(0(0(3(2(4(0(x1)))))))))) 2(2(2(2(1(1(2(2(1(1(0(1(5(0(x1)))))))))))))) -> 4(1(3(3(2(4(3(0(3(1(3(5(0(3(0(x1))))))))))))))) 3(3(3(1(0(2(5(2(4(1(1(2(5(0(x1)))))))))))))) -> 2(2(3(0(4(2(0(5(4(4(4(0(4(0(x1)))))))))))))) 3(1(0(2(2(1(2(3(3(0(2(3(2(0(3(x1))))))))))))))) -> 1(3(1(0(4(0(2(2(1(2(3(5(1(2(x1)))))))))))))) 4(3(0(4(2(2(4(2(3(5(0(4(3(2(5(0(x1)))))))))))))))) -> 1(2(3(1(0(3(2(2(3(1(5(0(0(0(x1)))))))))))))) 4(1(3(5(0(1(1(3(1(1(3(3(5(2(4(4(x1)))))))))))))))) -> 4(5(1(5(0(3(3(4(5(5(1(2(4(4(4(2(4(x1))))))))))))))))) 3(4(5(0(5(1(4(2(2(4(5(1(1(5(3(5(x1)))))))))))))))) -> 1(1(1(5(0(1(2(3(1(2(2(4(0(0(x1)))))))))))))) 2(5(4(5(0(5(0(1(5(2(2(4(5(3(4(1(0(2(2(x1))))))))))))))))))) -> 2(5(4(1(5(3(4(4(0(0(2(5(2(5(4(0(2(4(3(3(x1)))))))))))))))))))) 3(3(4(2(0(1(2(2(1(1(3(5(2(3(1(4(3(5(2(x1))))))))))))))))))) -> 3(2(2(5(0(0(4(3(4(3(0(1(1(3(2(5(3(0(x1)))))))))))))))))) 4(4(0(1(4(0(5(2(3(4(2(4(4(1(0(5(1(3(5(x1))))))))))))))))))) -> 4(5(2(0(2(0(2(5(2(4(3(2(5(1(1(4(2(2(5(x1))))))))))))))))))) 1(3(2(0(5(2(5(2(4(3(5(2(4(1(1(3(2(3(0(3(2(x1))))))))))))))))))))) -> 1(5(0(3(0(3(3(1(1(0(1(3(3(1(2(3(4(2(3(x1))))))))))))))))))) 5(4(3(0(2(3(4(4(2(3(1(1(4(2(2(1(3(1(2(1(3(x1))))))))))))))))))))) -> 5(1(1(4(2(5(0(1(3(1(0(1(2(1(1(5(5(2(x1)))))))))))))))))) 3(5(0(3(3(4(2(2(0(4(3(1(0(3(5(4(3(1(3(4(5(x1))))))))))))))))))))) -> 5(3(1(5(0(2(1(0(1(0(0(4(2(5(1(1(5(5(x1)))))))))))))))))) Bounds Processor: bound: 0 enrichment: match automaton: final states: {257,240,223,205,189,170,158,142,130,117,105,91,82, 72,65,56,46,40,33,26,21,15,10,6,1} transitions: 10(168) -> 169* 10(47) -> 118* 10(265) -> 266* 10(169) -> 158* 10(193) -> 194* 10(231) -> 232* 10(185) -> 186* 10(5) -> 1* 10(31) -> 32* 10(242) -> 243* 10(16) -> 57* 10(209) -> 210* 10(243) -> 244* 10(229) -> 230* 10(226) -> 227* popout

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

job log

popout

actions

all output return to SRS Standard