details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	5.51496 seconds
cpu usage	20.1287
user time	18.9712
system time	1.15747
max virtual memory	6697288.0
max residence set size	103036.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(1(2(3(2(x1))))) -> 4(3(1(3(x1)))) 3(2(4(4(2(0(x1)))))) -> 3(1(1(0(x1)))) 1(2(5(3(4(0(3(2(x1)))))))) -> 3(4(1(1(4(5(5(x1))))))) 2(1(3(1(0(4(5(0(1(x1))))))))) -> 2(1(1(2(3(3(2(0(0(x1))))))))) 3(5(4(3(4(4(4(3(4(x1))))))))) -> 5(0(5(0(0(1(4(x1))))))) 4(5(3(3(2(1(0(3(2(x1))))))))) -> 4(5(4(5(3(1(4(3(x1)))))))) 0(1(4(0(5(3(4(4(4(5(x1)))))))))) -> 0(5(5(5(0(3(5(x1))))))) 4(1(2(0(5(2(4(4(2(0(x1)))))))))) -> 0(4(3(1(0(0(3(0(x1)))))))) 0(1(0(3(1(2(1(3(5(5(2(x1))))))))))) -> 4(3(0(2(4(5(3(3(2(5(0(2(x1)))))))))))) 4(1(2(2(3(0(1(0(3(0(2(x1))))))))))) -> 4(3(3(0(2(0(2(2(2(2(x1)))))))))) 4(3(4(5(1(5(3(4(2(2(5(x1))))))))))) -> 4(3(2(2(4(3(3(1(0(5(5(x1))))))))))) 3(0(3(3(2(0(3(1(0(5(4(1(4(x1))))))))))))) -> 3(5(5(4(4(1(5(0(1(5(4(3(x1)))))))))))) 3(0(5(5(5(2(0(0(0(2(4(2(2(x1))))))))))))) -> 1(3(5(4(1(1(2(1(0(4(0(4(2(x1))))))))))))) 0(0(3(1(5(1(4(2(1(0(4(4(0(5(x1)))))))))))))) -> 0(3(4(3(2(1(2(1(2(0(2(4(0(5(x1)))))))))))))) 2(1(4(5(4(3(3(4(3(4(2(2(1(5(x1)))))))))))))) -> 0(5(4(2(2(2(4(3(3(1(3(1(0(0(x1)))))))))))))) 0(1(0(1(4(4(4(0(3(2(4(0(4(5(0(x1))))))))))))))) -> 4(1(5(2(5(2(4(0(1(2(3(0(0(x1))))))))))))) 5(2(2(5(5(1(0(4(4(3(1(2(0(2(4(x1))))))))))))))) -> 5(0(3(1(0(1(0(4(4(3(2(4(2(1(1(4(x1)))))))))))))))) 4(5(4(1(1(5(3(4(0(3(5(3(1(0(0(3(1(x1))))))))))))))))) -> 4(3(3(1(4(4(2(1(1(3(2(0(4(2(1(4(3(1(x1)))))))))))))))))) 1(0(1(2(0(5(3(2(0(5(4(0(0(3(2(0(5(2(x1)))))))))))))))))) -> 1(1(1(4(3(4(3(4(4(3(0(3(4(4(0(1(4(2(2(x1))))))))))))))))))) 0(0(1(0(1(0(2(4(3(5(4(3(1(4(4(2(3(1(5(x1))))))))))))))))))) -> 4(0(5(4(3(3(3(4(3(3(0(2(2(4(1(5(2(3(x1)))))))))))))))))) 0(1(5(4(3(2(4(3(1(3(3(4(4(3(3(0(1(2(2(x1))))))))))))))))))) -> 4(1(0(3(0(4(4(0(5(0(1(5(5(2(1(1(5(4(2(x1))))))))))))))))))) 4(5(3(0(4(2(1(1(3(0(3(0(0(5(1(3(2(4(5(x1))))))))))))))))))) -> 4(5(5(1(1(2(4(0(3(2(5(1(2(5(3(0(3(x1))))))))))))))))) 5(2(5(1(4(3(3(3(3(3(3(3(1(4(5(2(2(5(1(2(x1)))))))))))))))))))) -> 1(3(2(3(1(3(4(1(0(1(2(5(0(5(5(4(5(0(4(5(x1)))))))))))))))))))) 1(5(3(1(4(2(0(1(1(0(3(5(4(1(4(5(2(0(1(0(0(x1))))))))))))))))))))) -> 1(4(0(1(1(5(0(3(4(1(2(4(1(1(4(5(4(1(3(3(0(x1))))))))))))))))))))) 4(0(1(3(0(2(0(2(0(4(0(5(0(2(1(0(2(5(5(0(2(x1))))))))))))))))))))) -> 2(0(1(3(4(1(2(3(5(2(2(4(5(0(3(5(2(1(3(x1))))))))))))))))))) Proof: String Reversal Processor: 2(3(2(1(0(x1))))) -> 3(1(3(4(x1)))) 0(2(4(4(2(3(x1)))))) -> 0(1(1(3(x1)))) 2(3(0(4(3(5(2(1(x1)))))))) -> 5(5(4(1(1(4(3(x1))))))) 1(0(5(4(0(1(3(1(2(x1))))))))) -> 0(0(2(3(3(2(1(1(2(x1))))))))) 4(3(4(4(4(3(4(5(3(x1))))))))) -> 4(1(0(0(5(0(5(x1))))))) 2(3(0(1(2(3(3(5(4(x1))))))))) -> 3(4(1(3(5(4(5(4(x1)))))))) 5(4(4(4(3(5(0(4(1(0(x1)))))))))) -> 5(3(0(5(5(5(0(x1))))))) 0(2(4(4(2(5(0(2(1(4(x1)))))))))) -> 0(3(0(0(1(3(4(0(x1)))))))) 2(5(5(3(1(2(1(3(0(1(0(x1))))))))))) -> 2(0(5(2(3(3(5(4(2(0(3(4(x1)))))))))))) 2(0(3(0(1(0(3(2(2(1(4(x1))))))))))) -> 2(2(2(2(0(2(0(3(3(4(x1)))))))))) 5(2(2(4(3(5(1(5(4(3(4(x1))))))))))) -> 5(5(0(1(3(3(4(2(2(3(4(x1))))))))))) 4(1(4(5(0(1(3(0(2(3(3(0(3(x1))))))))))))) -> 3(4(5(1(0(5(1(4(4(5(5(3(x1)))))))))))) 2(2(4(2(0(0(0(2(5(5(5(0(3(x1))))))))))))) -> 2(4(0(4(0(1(2(1(1(4(5(3(1(x1))))))))))))) 5(0(4(4(0(1(2(4(1(5(1(3(0(0(x1)))))))))))))) -> 5(0(4(2(0(2(1(2(1(2(3(4(3(0(x1)))))))))))))) 5(1(2(2(4(3(4(3(3(4(5(4(1(2(x1)))))))))))))) -> 0(0(1(3(1(3(3(4(2(2(2(4(5(0(x1)))))))))))))) 0(5(4(0(4(2(3(0(4(4(4(1(0(1(0(x1))))))))))))))) -> 0(0(3(2(1(0(4(2(5(2(5(1(4(x1))))))))))))) 4(2(0(2(1(3(4(4(0(1(5(5(2(2(5(x1))))))))))))))) -> 4(1(1(2(4(2(3(4(4(0(1(0(1(3(0(5(x1)))))))))))))))) 1(3(0(0(1(3(5(3(0(4(3(5(1(1(4(5(4(x1))))))))))))))))) -> 1(3(4(1(2(4(0(2(3(1(1(2(4(4(1(3(3(4(x1)))))))))))))))))) 2(5(0(2(3(0(0(4(5(0(2(3(5(0(2(1(0(1(x1)))))))))))))))))) -> 2(2(4(1(0(4(4(3(0(3(4(4(3(4(3(4(1(1(1(x1))))))))))))))))))) 5(1(3(2(4(4(1(3(4(5(3(4(2(0(1(0(1(0(0(x1))))))))))))))))))) -> 3(2(5(1(4(2(2(0(3(3(4(3(3(3(4(5(0(4(x1)))))))))))))))))) 2(2(1(0(3(3(4(4(3(3(1(3(4(2(3(4(5(1(0(x1))))))))))))))))))) -> 2(4(5(1(1(2(5(5(1(0(5(0(4(4(0(3(0(1(4(x1))))))))))))))))))) 5(4(2(3(1(5(0(0(3(0(3(1(1(2(4(0(3(5(4(x1))))))))))))))))))) -> 3(0(3(5(2(1(5(2(3(0(4(2(1(1(5(5(4(x1))))))))))))))))) 2(1(5(2(2(5(4(1(3(3(3(3(3(3(3(4(1(5(2(5(x1)))))))))))))))))))) -> 5(4(0(5(4(5(5(0(5(2(1(0(1(4(3(1(3(2(3(1(x1)))))))))))))))))))) 0(0(1(0(2(5(4(1(4(5(3(0(1(1(0(2(4(1(3(5(1(x1))))))))))))))))))))) -> 0(3(3(1(4(5(4(1(1(4(2(1(4(3(0(5(1(1(0(4(1(x1))))))))))))))))))))) 2(0(5(5(2(0(1(2(0(5(0(4(0(2(0(2(0(3(1(0(4(x1))))))))))))))))))))) -> 3(1(2(5(3(0(5(4(2(2(5(3(2(1(4(3(1(0(2(x1))))))))))))))))))) Bounds Processor: bound: 0 enrichment: match automaton: final states: {275,255,237,222,205,188,170,155,141,129,117,104,91, 80,71,63,53,46,39,32,25,16,10,6,1} transitions: 30(168) -> 169* 30(47) -> 48* 30(122) -> 123* 30(273) -> 274* 30(193) -> 194* 30(148) -> 149* 30(106) -> 107* 30(5) -> 1* 30(58) -> 59* 30(261) -> 262* 30(44) -> 45* 30(57) -> 58* 30(40) -> 105* 30(20) -> 21* 30(75) -> 76* 30(240) -> 241* 30(195) -> 196* 30(35) -> 36* 30(27) -> 142* popout

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

job log

popout

actions

all output return to SRS Standard