details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	5.78027 seconds
cpu usage	21.1503
user time	20.0401
system time	1.11015
max virtual memory	6726244.0
max residence set size	105824.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(1(2(3(x1)))) -> 4(4(2(3(x1)))) 5(3(3(5(4(x1))))) -> 5(1(0(2(x1)))) 2(3(1(5(0(5(x1)))))) -> 2(1(3(5(0(5(x1)))))) 5(3(3(5(5(4(x1)))))) -> 4(2(4(3(2(x1))))) 5(1(4(5(1(1(5(x1))))))) -> 1(4(0(2(3(2(5(x1))))))) 3(3(4(3(1(3(0(5(x1)))))))) -> 3(5(2(4(5(0(5(2(x1)))))))) 3(1(2(2(2(1(3(1(3(x1))))))))) -> 1(4(3(1(5(0(2(2(x1)))))))) 3(4(2(0(5(2(3(5(3(x1))))))))) -> 3(5(4(4(2(2(0(5(1(x1))))))))) 5(5(1(3(3(5(4(0(0(x1))))))))) -> 3(1(0(1(4(2(4(3(x1)))))))) 3(0(2(5(1(5(0(1(5(0(x1)))))))))) -> 1(2(2(0(0(4(3(4(4(x1))))))))) 3(5(5(4(4(4(2(0(0(3(x1)))))))))) -> 1(1(2(3(2(3(4(1(x1)))))))) 3(0(4(3(3(5(0(4(4(0(4(2(x1)))))))))))) -> 3(4(5(5(3(2(0(5(1(4(2(x1))))))))))) 5(2(0(4(5(0(2(1(1(1(2(0(x1)))))))))))) -> 3(0(0(2(2(4(5(1(3(1(0(x1))))))))))) 5(5(4(3(3(4(5(4(5(0(0(4(5(x1))))))))))))) -> 5(0(1(0(3(1(4(1(2(3(1(x1))))))))))) 5(2(1(3(0(2(2(4(5(2(2(0(0(1(x1)))))))))))))) -> 3(4(5(1(4(3(3(5(0(3(0(1(x1)))))))))))) 3(1(5(2(5(5(3(3(4(4(5(2(3(2(4(x1))))))))))))))) -> 3(0(5(4(4(4(2(0(0(1(4(3(2(4(x1)))))))))))))) 4(5(5(4(3(4(4(2(4(2(4(3(3(3(3(x1))))))))))))))) -> 4(5(0(0(4(4(5(4(4(3(4(0(0(0(x1)))))))))))))) 0(1(2(4(3(1(1(4(1(5(0(2(5(3(2(4(3(x1))))))))))))))))) -> 4(2(2(1(3(1(3(0(4(5(1(2(2(5(5(4(1(x1))))))))))))))))) 2(4(3(0(4(2(0(0(2(5(1(0(2(0(0(4(4(x1))))))))))))))))) -> 5(4(1(2(1(2(1(0(2(0(4(3(1(0(0(2(x1)))))))))))))))) 3(3(3(1(0(2(1(1(5(2(4(0(0(4(5(2(2(0(2(x1))))))))))))))))))) -> 3(2(2(3(1(5(5(5(3(0(3(1(4(3(2(3(1(x1))))))))))))))))) 5(3(2(2(5(2(1(3(0(2(4(3(2(5(3(3(0(5(4(x1))))))))))))))))))) -> 1(3(0(3(3(4(5(5(0(5(5(4(0(2(1(1(0(0(2(x1))))))))))))))))))) 5(4(5(5(5(2(0(1(2(1(0(1(2(1(5(3(1(3(1(x1))))))))))))))))))) -> 0(0(3(5(3(0(2(0(1(4(0(5(4(3(0(2(4(1(x1)))))))))))))))))) 4(0(4(0(5(1(0(3(2(5(3(1(3(0(2(5(3(5(0(0(x1)))))))))))))))))))) -> 1(5(3(5(2(0(5(4(4(5(0(1(4(4(3(1(3(2(5(1(x1)))))))))))))))))))) 5(4(2(1(3(2(5(4(2(2(0(0(5(5(1(0(5(1(3(0(x1)))))))))))))))))))) -> 4(4(2(4(0(1(3(2(5(1(3(4(4(0(0(1(1(1(2(0(x1)))))))))))))))))))) 3(0(4(5(4(1(4(3(5(5(3(5(4(0(1(4(3(5(0(3(2(x1))))))))))))))))))))) -> 1(2(4(1(1(2(5(4(2(4(0(4(2(5(1(4(2(1(3(1(2(x1))))))))))))))))))))) Proof: String Reversal Processor: 3(2(1(0(x1)))) -> 3(2(4(4(x1)))) 4(5(3(3(5(x1))))) -> 2(0(1(5(x1)))) 5(0(5(1(3(2(x1)))))) -> 5(0(5(3(1(2(x1)))))) 4(5(5(3(3(5(x1)))))) -> 2(3(4(2(4(x1))))) 5(1(1(5(4(1(5(x1))))))) -> 5(2(3(2(0(4(1(x1))))))) 5(0(3(1(3(4(3(3(x1)))))))) -> 2(5(0(5(4(2(5(3(x1)))))))) 3(1(3(1(2(2(2(1(3(x1))))))))) -> 2(2(0(5(1(3(4(1(x1)))))))) 3(5(3(2(5(0(2(4(3(x1))))))))) -> 1(5(0(2(2(4(4(5(3(x1))))))))) 0(0(4(5(3(3(1(5(5(x1))))))))) -> 3(4(2(4(1(0(1(3(x1)))))))) 0(5(1(0(5(1(5(2(0(3(x1)))))))))) -> 4(4(3(4(0(0(2(2(1(x1))))))))) 3(0(0(2(4(4(4(5(5(3(x1)))))))))) -> 1(4(3(2(3(2(1(1(x1)))))))) 2(4(0(4(4(0(5(3(3(4(0(3(x1)))))))))))) -> 2(4(1(5(0(2(3(5(5(4(3(x1))))))))))) 0(2(1(1(1(2(0(5(4(0(2(5(x1)))))))))))) -> 0(1(3(1(5(4(2(2(0(0(3(x1))))))))))) 5(4(0(0(5(4(5(4(3(3(4(5(5(x1))))))))))))) -> 1(3(2(1(4(1(3(0(1(0(5(x1))))))))))) 1(0(0(2(2(5(4(2(2(0(3(1(2(5(x1)))))))))))))) -> 1(0(3(0(5(3(3(4(1(5(4(3(x1)))))))))))) 4(2(3(2(5(4(4(3(3(5(5(2(5(1(3(x1))))))))))))))) -> 4(2(3(4(1(0(0(2(4(4(4(5(0(3(x1)))))))))))))) 3(3(3(3(4(2(4(2(4(4(3(4(5(5(4(x1))))))))))))))) -> 0(0(0(4(3(4(4(5(4(4(0(0(5(4(x1)))))))))))))) 3(4(2(3(5(2(0(5(1(4(1(1(3(4(2(1(0(x1))))))))))))))))) -> 1(4(5(5(2(2(1(5(4(0(3(1(3(1(2(2(4(x1))))))))))))))))) 4(4(0(0(2(0(1(5(2(0(0(2(4(0(3(4(2(x1))))))))))))))))) -> 2(0(0(1(3(4(0(2(0(1(2(1(2(1(4(5(x1)))))))))))))))) 2(0(2(2(5(4(0(0(4(2(5(1(1(2(0(1(3(3(3(x1))))))))))))))))))) -> 1(3(2(3(4(1(3(0(3(5(5(5(1(3(2(2(3(x1))))))))))))))))) 4(5(0(3(3(5(2(3(4(2(0(3(1(2(5(2(2(3(5(x1))))))))))))))))))) -> 2(0(0(1(1(2(0(4(5(5(0(5(5(4(3(3(0(3(1(x1))))))))))))))))))) 1(3(1(3(5(1(2(1(0(1(2(1(0(2(5(5(5(4(5(x1))))))))))))))))))) -> 1(4(2(0(3(4(5(0(4(1(0(2(0(3(5(3(0(0(x1)))))))))))))))))) 0(0(5(3(5(2(0(3(1(3(5(2(3(0(1(5(0(4(0(4(x1)))))))))))))))))))) -> 1(5(2(3(1(3(4(4(1(0(5(4(4(5(0(2(5(3(5(1(x1)))))))))))))))))))) 0(3(1(5(0(1(5(5(0(0(2(2(4(5(2(3(1(2(4(5(x1)))))))))))))))))))) -> 0(2(1(1(1(0(0(4(4(3(1(5(2(3(1(0(4(2(4(4(x1)))))))))))))))))))) 2(3(0(5(3(4(1(0(4(5(3(5(5(3(4(1(4(5(4(0(3(x1))))))))))))))))))))) -> 2(1(3(1(2(4(1(5(2(4(0(4(2(4(5(2(1(1(4(2(1(x1))))))))))))))))))))) Bounds Processor: bound: 0 enrichment: match automaton: final states: {252,235,216,198,180,164,149,134,121,109,100,90,80, 70,63,55,48,41,35,27,20,16,10,6,1} transitions: 10(2) -> 21* 10(215) -> 198* 10(253) -> 254* 10(264) -> 265* 10(91) -> 92* 10(174) -> 175* 10(77) -> 78* 10(247) -> 248* 10(254) -> 255* 10(179) -> 164* 10(150) -> 151* 10(137) -> 138* 10(206) -> 207* 10(267) -> 268* 10(154) -> 155* 10(193) -> 194* 10(72) -> 101* 10(249) -> 250* 10(194) -> 195* 10(116) -> 117* 10(248) -> 249* popout

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

job log

popout

actions

all output return to SRS Standard