details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	6.37352 seconds
cpu usage	23.4672
user time	22.2427
system time	1.22451
max virtual memory	6823156.0
max residence set size	114888.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(1(1(2(x1)))) -> 0(1(0(x1))) 0(3(4(4(x1)))) -> 0(3(2(x1))) 3(0(4(3(4(x1))))) -> 5(1(0(3(4(x1))))) 3(1(1(1(4(x1))))) -> 3(2(0(4(x1)))) 3(3(1(2(2(1(x1)))))) -> 0(0(0(3(5(1(x1)))))) 4(1(4(0(0(3(x1)))))) -> 4(4(0(2(2(x1))))) 2(4(3(5(4(3(1(x1))))))) -> 5(1(2(0(4(1(x1)))))) 5(2(2(0(1(3(4(x1))))))) -> 5(2(5(3(4(0(0(x1))))))) 5(5(3(0(0(3(1(x1))))))) -> 5(4(4(1(4(2(3(x1))))))) 0(5(1(0(3(1(3(3(x1)))))))) -> 3(3(4(2(5(3(3(x1))))))) 1(2(2(2(4(5(3(0(3(0(x1)))))))))) -> 1(0(1(3(0(2(3(4(0(x1))))))))) 4(3(5(2(1(0(4(0(2(5(x1)))))))))) -> 1(0(1(1(1(4(3(4(5(5(x1)))))))))) 1(4(3(3(5(1(0(5(4(4(5(x1))))))))))) -> 4(2(5(5(3(0(3(3(1(5(x1)))))))))) 2(1(4(3(4(5(4(0(2(0(0(3(x1)))))))))))) -> 3(2(4(1(5(2(5(2(1(1(1(x1))))))))))) 3(2(3(3(2(4(2(4(2(4(0(1(x1)))))))))))) -> 2(0(3(0(3(0(0(0(2(2(0(1(x1)))))))))))) 4(1(5(3(4(4(2(4(4(5(2(4(x1)))))))))))) -> 4(3(5(3(1(0(0(4(5(4(4(x1))))))))))) 0(2(0(4(0(4(2(4(4(3(5(2(5(x1))))))))))))) -> 0(1(5(4(0(1(5(3(4(3(3(5(x1)))))))))))) 3(3(5(3(2(0(4(5(2(4(0(3(2(2(x1)))))))))))))) -> 3(3(5(3(5(3(3(5(1(3(3(5(0(2(x1)))))))))))))) 1(4(2(5(5(0(1(3(1(0(1(0(1(2(2(3(x1)))))))))))))))) -> 2(2(4(1(1(0(1(0(1(4(4(5(2(1(3(1(3(x1))))))))))))))))) 5(3(5(1(3(3(2(5(3(5(4(1(5(2(0(3(x1)))))))))))))))) -> 5(3(5(4(4(5(2(1(4(4(1(3(2(4(3(1(x1)))))))))))))))) 5(5(3(2(5(1(3(4(1(0(1(0(3(3(5(4(4(x1))))))))))))))))) -> 5(3(2(1(4(1(5(0(5(5(5(3(1(2(4(1(2(x1))))))))))))))))) 0(3(4(4(5(4(4(5(0(1(5(5(5(5(0(3(3(1(x1)))))))))))))))))) -> 0(2(1(1(5(3(5(2(4(4(0(2(3(2(3(0(1(1(x1)))))))))))))))))) 3(5(0(3(5(4(2(5(3(4(2(3(3(4(2(5(0(0(x1)))))))))))))))))) -> 0(1(2(1(4(0(5(2(0(2(5(3(5(1(3(2(0(x1))))))))))))))))) 0(3(4(1(2(4(5(1(3(2(2(1(3(1(5(5(1(5(0(x1))))))))))))))))))) -> 3(0(4(1(5(1(3(3(4(0(1(0(0(1(0(2(0(x1))))))))))))))))) 2(4(2(1(1(4(3(2(1(1(4(4(0(3(3(4(1(5(3(4(x1)))))))))))))))))))) -> 0(2(5(5(3(2(3(3(5(3(0(0(0(0(3(2(1(3(2(x1))))))))))))))))))) Proof: String Reversal Processor: 2(1(1(0(x1)))) -> 0(1(0(x1))) 4(4(3(0(x1)))) -> 2(3(0(x1))) 4(3(4(0(3(x1))))) -> 4(3(0(1(5(x1))))) 4(1(1(1(3(x1))))) -> 4(0(2(3(x1)))) 1(2(2(1(3(3(x1)))))) -> 1(5(3(0(0(0(x1)))))) 3(0(0(4(1(4(x1)))))) -> 2(2(0(4(4(x1))))) 1(3(4(5(3(4(2(x1))))))) -> 1(4(0(2(1(5(x1)))))) 4(3(1(0(2(2(5(x1))))))) -> 0(0(4(3(5(2(5(x1))))))) 1(3(0(0(3(5(5(x1))))))) -> 3(2(4(1(4(4(5(x1))))))) 3(3(1(3(0(1(5(0(x1)))))))) -> 3(3(5(2(4(3(3(x1))))))) 0(3(0(3(5(4(2(2(2(1(x1)))))))))) -> 0(4(3(2(0(3(1(0(1(x1))))))))) 5(2(0(4(0(1(2(5(3(4(x1)))))))))) -> 5(5(4(3(4(1(1(1(0(1(x1)))))))))) 5(4(4(5(0(1(5(3(3(4(1(x1))))))))))) -> 5(1(3(3(0(3(5(5(2(4(x1)))))))))) 3(0(0(2(0(4(5(4(3(4(1(2(x1)))))))))))) -> 1(1(1(2(5(2(5(1(4(2(3(x1))))))))))) 1(0(4(2(4(2(4(2(3(3(2(3(x1)))))))))))) -> 1(0(2(2(0(0(0(3(0(3(0(2(x1)))))))))))) 4(2(5(4(4(2(4(4(3(5(1(4(x1)))))))))))) -> 4(4(5(4(0(0(1(3(5(3(4(x1))))))))))) 5(2(5(3(4(4(2(4(0(4(0(2(0(x1))))))))))))) -> 5(3(3(4(3(5(1(0(4(5(1(0(x1)))))))))))) 2(2(3(0(4(2(5(4(0(2(3(5(3(3(x1)))))))))))))) -> 2(0(5(3(3(1(5(3(3(5(3(5(3(3(x1)))))))))))))) 3(2(2(1(0(1(0(1(3(1(0(5(5(2(4(1(x1)))))))))))))))) -> 3(1(3(1(2(5(4(4(1(0(1(0(1(1(4(2(2(x1))))))))))))))))) 3(0(2(5(1(4(5(3(5(2(3(3(1(5(3(5(x1)))))))))))))))) -> 1(3(4(2(3(1(4(4(1(2(5(4(4(5(3(5(x1)))))))))))))))) 4(4(5(3(3(0(1(0(1(4(3(1(5(2(3(5(5(x1))))))))))))))))) -> 2(1(4(2(1(3(5(5(5(0(5(1(4(1(2(3(5(x1))))))))))))))))) 1(3(3(0(5(5(5(5(1(0(5(4(4(5(4(4(3(0(x1)))))))))))))))))) -> 1(1(0(3(2(3(2(0(4(4(2(5(3(5(1(1(2(0(x1)))))))))))))))))) 0(0(5(2(4(3(3(2(4(3(5(2(4(5(3(0(5(3(x1)))))))))))))))))) -> 0(2(3(1(5(3(5(2(0(2(5(0(4(1(2(1(0(x1))))))))))))))))) 0(5(1(5(5(1(3(1(2(2(3(1(5(4(2(1(4(3(0(x1))))))))))))))))))) -> 0(2(0(1(0(0(1(0(4(3(3(1(5(1(4(0(3(x1))))))))))))))))) 4(3(5(1(4(3(3(0(4(4(1(1(2(3(4(1(1(2(4(2(x1)))))))))))))))))))) -> 2(3(1(2(3(0(0(0(0(3(5(3(3(2(3(5(5(2(0(x1))))))))))))))))))) Bounds Processor: bound: 1 enrichment: match automaton: final states: {220,204,189,172,157,142,126,114,104,94,82,73,64,57,48,42,36,30,26,21,16,12,7,5,1} transitions: 21(239) -> 240* 01(237) -> 238* 00(68) -> 69* 00(88) -> 89* 00(13) -> 205* 00(106) -> 107* 00(231) -> 232* 00(219) -> 204* 00(34) -> 35* 00(162) -> 163* 00(229) -> 230* 00(186) -> 187* 00(212) -> 213* 00(85) -> 86* 00(195) -> 196* 00(35) -> 30* 00(52) -> 53* 00(27) -> 28* 00(130) -> 131* 00(228) -> 229* 00(132) -> 133* 00(23) -> 24* 00(203) -> 189* 00(83) -> 84* popout

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

job log

popout

actions

all output return to SRS Standard