details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	5.10878 seconds
cpu usage	18.6307
user time	17.5507
system time	1.08003
max virtual memory	6651256.0
max residence set size	101348.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(1(2(3(x1)))) -> 1(4(3(x1))) 1(2(0(4(2(x1))))) -> 3(4(5(4(x1)))) 3(3(0(3(2(x1))))) -> 3(2(4(1(x1)))) 5(2(1(0(4(x1))))) -> 5(5(4(5(x1)))) 0(1(4(5(0(5(x1)))))) -> 3(0(4(0(3(5(x1)))))) 0(2(5(2(1(5(x1)))))) -> 5(2(1(5(4(x1))))) 0(3(5(1(5(5(x1)))))) -> 0(5(1(5(4(x1))))) 2(2(5(1(4(5(4(3(x1)))))))) -> 2(2(3(3(0(1(0(3(x1)))))))) 0(0(0(2(4(1(2(2(4(x1))))))))) -> 0(0(0(4(3(3(4(4(x1)))))))) 2(4(4(3(4(2(0(3(2(x1))))))))) -> 3(4(3(4(1(3(3(1(x1)))))))) 0(1(4(3(2(3(2(3(5(3(x1)))))))))) -> 1(4(3(0(3(4(2(5(3(x1))))))))) 0(2(1(5(0(4(3(1(4(2(2(x1))))))))))) -> 0(0(4(0(5(1(0(5(4(4(2(x1))))))))))) 4(4(3(3(0(2(4(2(4(4(1(5(x1)))))))))))) -> 4(4(0(4(3(1(5(5(5(2(5(x1))))))))))) 5(3(0(0(5(5(2(0(2(2(3(3(x1)))))))))))) -> 5(5(4(1(5(2(0(5(2(4(3(x1))))))))))) 0(2(0(2(5(5(1(5(0(2(5(2(2(x1))))))))))))) -> 5(4(3(1(4(0(1(0(1(5(2(x1))))))))))) 0(3(1(4(4(2(0(5(4(0(1(0(4(x1))))))))))))) -> 0(0(4(4(1(0(4(0(0(2(2(4(4(x1))))))))))))) 1(2(4(1(1(0(2(5(3(4(0(1(4(0(3(x1))))))))))))))) -> 1(1(0(4(5(0(3(2(0(5(2(0(0(3(3(x1))))))))))))))) 2(3(5(2(4(4(5(1(4(4(4(1(3(2(3(x1))))))))))))))) -> 2(3(3(1(1(1(5(3(3(5(1(3(5(2(3(x1))))))))))))))) 5(4(2(5(2(5(3(2(3(3(1(5(0(0(5(x1))))))))))))))) -> 5(2(3(5(4(1(3(1(4(4(4(4(1(3(5(x1))))))))))))))) 0(0(2(4(1(2(2(1(3(2(0(4(5(5(4(2(x1)))))))))))))))) -> 0(5(1(1(0(2(3(5(4(3(0(2(5(2(3(5(1(x1))))))))))))))))) 0(1(1(5(3(0(1(4(2(2(4(0(1(0(2(3(4(x1))))))))))))))))) -> 0(4(2(2(0(1(5(4(4(0(2(2(2(5(5(4(x1)))))))))))))))) 0(2(3(2(5(2(4(3(2(4(3(0(2(4(5(1(3(x1))))))))))))))))) -> 3(4(3(5(2(5(3(1(5(0(1(0(5(5(2(3(x1)))))))))))))))) 4(5(4(5(4(2(1(4(5(0(2(0(4(3(0(0(1(0(0(2(x1)))))))))))))))))))) -> 4(4(2(2(5(2(0(0(0(5(3(4(1(2(2(1(1(5(0(0(x1)))))))))))))))))))) 3(0(1(0(5(2(4(4(4(5(2(4(1(1(4(5(4(0(3(2(1(x1))))))))))))))))))))) -> 3(4(2(0(4(5(2(2(2(3(3(3(5(0(5(5(3(2(1(1(4(x1))))))))))))))))))))) 3(3(2(1(0(0(3(1(2(0(2(1(2(3(5(4(0(2(2(1(1(x1))))))))))))))))))))) -> 3(4(5(2(4(3(4(3(5(3(4(5(4(2(5(5(1(0(1(x1))))))))))))))))))) Proof: String Reversal Processor: 3(2(1(0(x1)))) -> 3(4(1(x1))) 2(4(0(2(1(x1))))) -> 4(5(4(3(x1)))) 2(3(0(3(3(x1))))) -> 1(4(2(3(x1)))) 4(0(1(2(5(x1))))) -> 5(4(5(5(x1)))) 5(0(5(4(1(0(x1)))))) -> 5(3(0(4(0(3(x1)))))) 5(1(2(5(2(0(x1)))))) -> 4(5(1(2(5(x1))))) 5(5(1(5(3(0(x1)))))) -> 4(5(1(5(0(x1))))) 3(4(5(4(1(5(2(2(x1)))))))) -> 3(0(1(0(3(3(2(2(x1)))))))) 4(2(2(1(4(2(0(0(0(x1))))))))) -> 4(4(3(3(4(0(0(0(x1)))))))) 2(3(0(2(4(3(4(4(2(x1))))))))) -> 1(3(3(1(4(3(4(3(x1)))))))) 3(5(3(2(3(2(3(4(1(0(x1)))))))))) -> 3(5(2(4(3(0(3(4(1(x1))))))))) 2(2(4(1(3(4(0(5(1(2(0(x1))))))))))) -> 2(4(4(5(0(1(5(0(4(0(0(x1))))))))))) 5(1(4(4(2(4(2(0(3(3(4(4(x1)))))))))))) -> 5(2(5(5(5(1(3(4(0(4(4(x1))))))))))) 3(3(2(2(0(2(5(5(0(0(3(5(x1)))))))))))) -> 3(4(2(5(0(2(5(1(4(5(5(x1))))))))))) 2(2(5(2(0(5(1(5(5(2(0(2(0(x1))))))))))))) -> 2(5(1(0(1(0(4(1(3(4(5(x1))))))))))) 4(0(1(0(4(5(0(2(4(4(1(3(0(x1))))))))))))) -> 4(4(2(2(0(0(4(0(1(4(4(0(0(x1))))))))))))) 3(0(4(1(0(4(3(5(2(0(1(1(4(2(1(x1))))))))))))))) -> 3(3(0(0(2(5(0(2(3(0(5(4(0(1(1(x1))))))))))))))) 3(2(3(1(4(4(4(1(5(4(4(2(5(3(2(x1))))))))))))))) -> 3(2(5(3(1(5(3(3(5(1(1(1(3(3(2(x1))))))))))))))) 5(0(0(5(1(3(3(2(3(5(2(5(2(4(5(x1))))))))))))))) -> 5(3(1(4(4(4(4(1(3(1(4(5(3(2(5(x1))))))))))))))) 2(4(5(5(4(0(2(3(1(2(2(1(4(2(0(0(x1)))))))))))))))) -> 1(5(3(2(5(2(0(3(4(5(3(2(0(1(1(5(0(x1))))))))))))))))) 4(3(2(0(1(0(4(2(2(4(1(0(3(5(1(1(0(x1))))))))))))))))) -> 4(5(5(2(2(2(0(4(4(5(1(0(2(2(4(0(x1)))))))))))))))) 3(1(5(4(2(0(3(4(2(3(4(2(5(2(3(2(0(x1))))))))))))))))) -> 3(2(5(5(0(1(0(5(1(3(5(2(5(3(4(3(x1)))))))))))))))) 2(0(0(1(0(0(3(4(0(2(0(5(4(1(2(4(5(4(5(4(x1)))))))))))))))))))) -> 0(0(5(1(1(2(2(1(4(3(5(0(0(0(2(5(2(2(4(4(x1)))))))))))))))))))) 1(2(3(0(4(5(4(1(1(4(2(5(4(4(4(2(5(0(1(0(3(x1))))))))))))))))))))) -> 4(1(1(2(3(5(5(0(5(3(3(3(2(2(2(5(4(0(2(4(3(x1))))))))))))))))))))) 1(1(2(2(0(4(5(3(2(1(2(0(2(1(3(0(0(1(2(3(3(x1))))))))))))))))))))) -> 1(0(1(5(5(2(4(5(4(3(5(3(4(3(4(2(5(4(3(x1))))))))))))))))))) Bounds Processor: bound: 0 enrichment: match automaton: final states: {225,206,188,175,160,146,133,119,105,95,85,77,66,57,51,45,38,30,25,21,16,12,9,5,1} transitions: 30(231) -> 232* 30(144) -> 145* 30(31) -> 120* 30(187) -> 175* 30(41) -> 42* 30(229) -> 230* 30(126) -> 127* 30(120) -> 121* 30(42) -> 43* 30(22) -> 134* 30(129) -> 130* 30(52) -> 53* 30(33) -> 34* 30(7) -> 46* 30(137) -> 138* 30(32) -> 33* 30(125) -> 126* 30(132) -> 119* 30(70) -> 71* 30(118) -> 105* 30(86) -> 87* 30(84) -> 77* 30(214) -> 215* popout

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

job log

popout

actions

all output return to SRS Standard