details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	5.3108 seconds
cpu usage	19.3503
user time	18.2151
system time	1.13522
max virtual memory	6677184.0
max residence set size	103188.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(1(2(3(x1)))) -> 0(2(2(3(x1)))) 1(1(4(4(5(x1))))) -> 5(1(0(0(5(x1))))) 2(3(3(2(5(x1))))) -> 3(5(4(5(5(x1))))) 5(1(1(5(3(x1))))) -> 5(1(4(5(3(x1))))) 0(2(5(1(1(4(x1)))))) -> 0(3(2(2(4(5(x1)))))) 1(2(1(4(0(3(x1)))))) -> 4(2(5(4(5(3(x1)))))) 1(5(2(0(4(3(x1)))))) -> 5(0(1(1(1(x1))))) 2(2(1(5(4(0(x1)))))) -> 2(3(5(4(0(3(x1)))))) 4(0(2(3(1(4(4(x1))))))) -> 4(1(3(0(5(0(5(x1))))))) 4(3(5(4(3(2(2(2(x1)))))))) -> 4(1(2(3(4(1(4(x1))))))) 0(2(2(2(3(4(3(3(3(x1))))))))) -> 0(5(4(0(5(3(5(5(3(x1))))))))) 4(5(3(4(1(1(0(5(2(x1))))))))) -> 4(4(3(1(3(2(0(5(2(x1))))))))) 3(3(4(1(0(4(5(1(5(2(x1)))))))))) -> 3(3(4(1(5(0(3(0(2(4(x1)))))))))) 2(4(5(4(0(5(5(1(2(1(4(2(x1)))))))))))) -> 4(1(0(1(1(3(3(0(1(4(2(x1))))))))))) 1(0(0(4(5(4(3(4(5(1(5(4(0(x1))))))))))))) -> 5(3(3(1(2(1(1(0(3(1(3(x1))))))))))) 1(2(2(1(2(3(2(4(4(0(0(3(2(x1))))))))))))) -> 4(4(4(3(2(0(1(3(1(2(2(4(5(x1))))))))))))) 4(1(5(4(5(3(3(3(1(2(0(2(0(x1))))))))))))) -> 4(1(4(3(4(4(0(1(3(1(1(5(x1)))))))))))) 2(2(3(3(0(2(0(2(5(0(5(5(5(1(0(3(1(x1))))))))))))))))) -> 5(5(5(2(0(2(5(0(0(4(3(2(1(4(3(3(1(x1))))))))))))))))) 1(5(1(1(3(0(3(3(3(3(1(1(5(1(5(2(5(2(x1)))))))))))))))))) -> 3(5(4(2(0(5(1(3(4(1(1(2(5(2(4(1(5(2(x1)))))))))))))))))) 2(4(3(3(4(2(3(5(4(0(4(0(2(3(0(3(3(0(x1)))))))))))))))))) -> 2(1(3(0(4(4(1(5(2(1(0(3(0(5(0(1(5(x1))))))))))))))))) 2(5(5(1(2(3(5(0(3(0(0(3(3(1(0(1(3(2(x1)))))))))))))))))) -> 2(1(5(0(0(1(5(2(2(2(3(1(0(5(0(4(3(3(x1)))))))))))))))))) 2(3(5(1(3(0(0(5(0(2(2(4(5(4(0(3(1(4(2(x1))))))))))))))))))) -> 5(2(0(2(0(3(2(3(5(2(2(4(1(3(5(5(1(2(x1)))))))))))))))))) 3(2(3(4(1(2(5(5(0(1(2(3(4(0(5(1(4(4(5(4(x1)))))))))))))))))))) -> 3(2(0(1(5(0(1(5(5(1(2(3(0(2(4(2(5(2(2(4(x1)))))))))))))))))))) 3(5(5(2(0(4(4(5(5(0(3(5(2(1(2(1(0(2(2(3(x1)))))))))))))))))))) -> 3(1(3(3(0(5(4(2(4(1(2(3(5(0(3(4(5(2(4(3(x1)))))))))))))))))))) 4(5(1(4(5(3(1(5(5(3(5(0(2(1(2(4(4(5(1(0(4(x1))))))))))))))))))))) -> 4(4(0(2(1(5(2(0(4(5(2(2(3(5(5(2(2(0(3(5(4(x1))))))))))))))))))))) Proof: String Reversal Processor: 3(2(1(0(x1)))) -> 3(2(2(0(x1)))) 5(4(4(1(1(x1))))) -> 5(0(0(1(5(x1))))) 5(2(3(3(2(x1))))) -> 5(5(4(5(3(x1))))) 3(5(1(1(5(x1))))) -> 3(5(4(1(5(x1))))) 4(1(1(5(2(0(x1)))))) -> 5(4(2(2(3(0(x1)))))) 3(0(4(1(2(1(x1)))))) -> 3(5(4(5(2(4(x1)))))) 3(4(0(2(5(1(x1)))))) -> 1(1(1(0(5(x1))))) 0(4(5(1(2(2(x1)))))) -> 3(0(4(5(3(2(x1)))))) 4(4(1(3(2(0(4(x1))))))) -> 5(0(5(0(3(1(4(x1))))))) 2(2(2(3(4(5(3(4(x1)))))))) -> 4(1(4(3(2(1(4(x1))))))) 3(3(3(4(3(2(2(2(0(x1))))))))) -> 3(5(5(3(5(0(4(5(0(x1))))))))) 2(5(0(1(1(4(3(5(4(x1))))))))) -> 2(5(0(2(3(1(3(4(4(x1))))))))) 2(5(1(5(4(0(1(4(3(3(x1)))))))))) -> 4(2(0(3(0(5(1(4(3(3(x1)))))))))) 2(4(1(2(1(5(5(0(4(5(4(2(x1)))))))))))) -> 2(4(1(0(3(3(1(1(0(1(4(x1))))))))))) 0(4(5(1(5(4(3(4(5(4(0(0(1(x1))))))))))))) -> 3(1(3(0(1(1(2(1(3(3(5(x1))))))))))) 2(3(0(0(4(4(2(3(2(1(2(2(1(x1))))))))))))) -> 5(4(2(2(1(3(1(0(2(3(4(4(4(x1))))))))))))) 0(2(0(2(1(3(3(3(5(4(5(1(4(x1))))))))))))) -> 5(1(1(3(1(0(4(4(3(4(1(4(x1)))))))))))) 1(3(0(1(5(5(5(0(5(2(0(2(0(3(3(2(2(x1))))))))))))))))) -> 1(3(3(4(1(2(3(4(0(0(5(2(0(2(5(5(5(x1))))))))))))))))) 2(5(2(5(1(5(1(1(3(3(3(3(0(3(1(1(5(1(x1)))))))))))))))))) -> 2(5(1(4(2(5(2(1(1(4(3(1(5(0(2(4(5(3(x1)))))))))))))))))) 0(3(3(0(3(2(0(4(0(4(5(3(2(4(3(3(4(2(x1)))))))))))))))))) -> 5(1(0(5(0(3(0(1(2(5(1(4(4(0(3(1(2(x1))))))))))))))))) 2(3(1(0(1(3(3(0(0(3(0(5(3(2(1(5(5(2(x1)))))))))))))))))) -> 3(3(4(0(5(0(1(3(2(2(2(5(1(0(0(5(1(2(x1)))))))))))))))))) 2(4(1(3(0(4(5(4(2(2(0(5(0(0(3(1(5(3(2(x1))))))))))))))))))) -> 2(1(5(5(3(1(4(2(2(5(3(2(3(0(2(0(2(5(x1)))))))))))))))))) 4(5(4(4(1(5(0(4(3(2(1(0(5(5(2(1(4(3(2(3(x1)))))))))))))))))))) -> 4(2(2(5(2(4(2(0(3(2(1(5(5(1(0(5(1(0(2(3(x1)))))))))))))))))))) 3(2(2(0(1(2(1(2(5(3(0(5(5(4(4(0(2(5(5(3(x1)))))))))))))))))))) -> 3(4(2(5(4(3(0(5(3(2(1(4(2(4(5(0(3(3(1(3(x1)))))))))))))))))))) 4(0(1(5(4(4(2(1(2(0(5(3(5(5(1(3(5(4(1(5(4(x1))))))))))))))))))))) -> 4(5(3(0(2(2(5(5(3(2(2(5(4(0(2(5(1(2(0(4(4(x1))))))))))))))))))))) Bounds Processor: bound: 0 enrichment: match automaton: final states: {234,215,196,179,163,147,132,116,106,95,85,76,67,59, 51,46,40,34,30,24,19,16,11,6,1} transitions: 10(113) -> 114* 10(204) -> 205* 10(127) -> 128* 10(111) -> 112* 10(12) -> 216* 10(33) -> 30* 10(77) -> 78* 10(114) -> 115* 10(131) -> 116* 10(144) -> 145* 10(138) -> 139* 10(32) -> 33* 10(190) -> 191* 10(31) -> 32* 10(35) -> 148* 10(49) -> 50* 10(194) -> 195* 10(155) -> 156* 10(89) -> 90* 10(139) -> 140* 10(161) -> 162* popout

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

job log

popout

actions

all output return to SRS Standard