details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	9.3403 seconds
cpu usage	35.0406
user time	33.5931
system time	1.44755
max virtual memory	7095492.0
max residence set size	158012.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(0(1(1(x1)))) -> 0(2(1(x1))) 0(0(3(3(0(0(x1)))))) -> 0(0(4(0(4(0(x1)))))) 1(5(5(2(1(0(x1)))))) -> 1(5(4(3(1(0(x1)))))) 4(0(3(4(2(2(x1)))))) -> 4(5(2(2(3(x1))))) 2(2(4(1(3(4(1(x1))))))) -> 5(2(4(5(3(x1))))) 0(3(1(5(2(3(1(5(x1)))))))) -> 0(3(3(5(3(5(1(5(x1)))))))) 3(1(5(1(5(0(4(2(x1)))))))) -> 3(1(4(5(0(5(2(x1))))))) 3(0(0(2(2(0(4(4(0(x1))))))))) -> 2(5(5(0(2(0(2(0(x1)))))))) 3(0(1(3(1(5(1(4(2(x1))))))))) -> 1(1(2(4(2(4(1(0(2(x1))))))))) 3(0(4(4(0(2(4(4(4(x1))))))))) -> 2(5(5(0(3(3(4(x1))))))) 0(2(5(2(4(3(4(0(4(3(x1)))))))))) -> 0(3(5(3(1(3(4(0(3(x1))))))))) 1(4(5(3(1(1(1(0(3(2(x1)))))))))) -> 1(3(2(5(3(5(2(1(x1)))))))) 2(4(0(4(5(3(3(3(2(0(x1)))))))))) -> 0(3(1(5(4(5(5(0(x1)))))))) 1(3(2(1(5(1(1(0(5(2(2(x1))))))))))) -> 1(0(2(5(4(2(2(0(5(3(x1)))))))))) 3(2(4(0(1(0(0(2(0(1(3(x1))))))))))) -> 2(4(0(3(5(5(1(3(3(x1))))))))) 4(4(1(0(1(3(3(1(4(1(2(x1))))))))))) -> 3(1(2(4(4(4(2(1(2(2(x1)))))))))) 4(0(4(2(2(0(4(2(1(4(1(4(x1)))))))))))) -> 4(5(0(5(4(5(5(4(x1)))))))) 4(3(5(4(3(4(0(0(4(2(5(0(x1)))))))))))) -> 4(0(2(0(3(3(3(5(3(1(2(4(x1)))))))))))) 2(5(5(1(5(1(2(0(2(1(3(3(4(x1))))))))))))) -> 3(1(1(1(2(5(2(1(4(0(0(4(4(x1))))))))))))) 3(4(1(1(3(1(1(1(5(4(3(4(1(x1))))))))))))) -> 3(4(0(0(3(5(3(5(0(4(4(4(x1)))))))))))) 1(1(2(0(2(4(1(1(3(3(3(5(1(3(x1)))))))))))))) -> 5(1(3(4(5(1(1(0(3(4(0(2(0(x1))))))))))))) 1(4(0(0(5(2(2(5(2(2(3(0(2(5(x1)))))))))))))) -> 1(5(4(2(3(0(1(3(0(3(2(2(0(5(x1)))))))))))))) 2(2(0(2(0(0(5(3(2(3(2(0(3(2(x1)))))))))))))) -> 4(5(1(5(3(3(3(4(4(2(0(4(x1)))))))))))) 4(2(3(5(4(2(5(5(1(1(4(4(0(4(1(0(x1)))))))))))))))) -> 4(1(2(5(4(0(5(3(2(5(0(4(2(4(0(x1))))))))))))))) 5(0(3(4(0(0(0(4(3(4(2(4(3(3(2(0(4(x1))))))))))))))))) -> 5(2(3(3(1(2(0(4(3(0(1(5(5(2(3(4(x1)))))))))))))))) 5(5(4(4(0(5(5(2(4(0(5(1(2(3(2(4(0(x1))))))))))))))))) -> 0(3(2(0(4(3(1(2(4(5(3(3(0(1(1(5(1(3(x1)))))))))))))))))) 0(1(4(3(5(3(0(4(1(1(2(3(3(1(4(0(5(2(3(x1))))))))))))))))))) -> 0(3(0(0(5(4(5(0(4(0(2(2(1(4(0(0(0(4(x1)))))))))))))))))) 4(2(1(0(0(4(4(4(3(0(5(1(3(1(2(3(5(1(0(2(x1)))))))))))))))))))) -> 4(4(1(4(5(0(4(2(4(5(2(3(4(2(2(5(5(1(x1)))))))))))))))))) 4(4(4(1(4(5(2(2(0(1(4(5(2(2(1(4(5(0(0(4(x1)))))))))))))))))))) -> 2(1(2(1(4(0(4(5(3(2(5(0(3(2(0(2(2(5(1(4(x1)))))))))))))))))))) 5(3(2(0(4(1(4(1(4(2(5(2(3(4(4(4(3(2(5(2(4(x1))))))))))))))))))))) -> 5(0(4(3(0(0(2(1(5(4(4(2(5(3(4(3(0(5(5(x1))))))))))))))))))) Proof: String Reversal Processor: 1(1(0(0(x1)))) -> 1(2(0(x1))) 0(0(3(3(0(0(x1)))))) -> 0(4(0(4(0(0(x1)))))) 0(1(2(5(5(1(x1)))))) -> 0(1(3(4(5(1(x1)))))) 2(2(4(3(0(4(x1)))))) -> 3(2(2(5(4(x1))))) 1(4(3(1(4(2(2(x1))))))) -> 3(5(4(2(5(x1))))) 5(1(3(2(5(1(3(0(x1)))))))) -> 5(1(5(3(5(3(3(0(x1)))))))) 2(4(0(5(1(5(1(3(x1)))))))) -> 2(5(0(5(4(1(3(x1))))))) 0(4(4(0(2(2(0(0(3(x1))))))))) -> 0(2(0(2(0(5(5(2(x1)))))))) 2(4(1(5(1(3(1(0(3(x1))))))))) -> 2(0(1(4(2(4(2(1(1(x1))))))))) 4(4(4(2(0(4(4(0(3(x1))))))))) -> 4(3(3(0(5(5(2(x1))))))) 3(4(0(4(3(4(2(5(2(0(x1)))))))))) -> 3(0(4(3(1(3(5(3(0(x1))))))))) 2(3(0(1(1(1(3(5(4(1(x1)))))))))) -> 1(2(5(3(5(2(3(1(x1)))))))) 0(2(3(3(3(5(4(0(4(2(x1)))))))))) -> 0(5(5(4(5(1(3(0(x1)))))))) 2(2(5(0(1(1(5(1(2(3(1(x1))))))))))) -> 3(5(0(2(2(4(5(2(0(1(x1)))))))))) 3(1(0(2(0(0(1(0(4(2(3(x1))))))))))) -> 3(3(1(5(5(3(0(4(2(x1))))))))) 2(1(4(1(3(3(1(0(1(4(4(x1))))))))))) -> 2(2(1(2(4(4(4(2(1(3(x1)))))))))) 4(1(4(1(2(4(0(2(2(4(0(4(x1)))))))))))) -> 4(5(5(4(5(0(5(4(x1)))))))) 0(5(2(4(0(0(4(3(4(5(3(4(x1)))))))))))) -> 4(2(1(3(5(3(3(3(0(2(0(4(x1)))))))))))) 4(3(3(1(2(0(2(1(5(1(5(5(2(x1))))))))))))) -> 4(4(0(0(4(1(2(5(2(1(1(1(3(x1))))))))))))) 1(4(3(4(5(1(1(1(3(1(1(4(3(x1))))))))))))) -> 4(4(4(0(5(3(5(3(0(0(4(3(x1)))))))))))) 3(1(5(3(3(3(1(1(4(2(0(2(1(1(x1)))))))))))))) -> 0(2(0(4(3(0(1(1(5(4(3(1(5(x1))))))))))))) 5(2(0(3(2(2(5(2(2(5(0(0(4(1(x1)))))))))))))) -> 5(0(2(2(3(0(3(1(0(3(2(4(5(1(x1)))))))))))))) 2(3(0(2(3(2(3(5(0(0(2(0(2(2(x1)))))))))))))) -> 4(0(2(4(4(3(3(3(5(1(5(4(x1)))))))))))) 0(1(4(0(4(4(1(1(5(5(2(4(5(3(2(4(x1)))))))))))))))) -> 0(4(2(4(0(5(2(3(5(0(4(5(2(1(4(x1))))))))))))))) 4(0(2(3(3(4(2(4(3(4(0(0(0(4(3(0(5(x1))))))))))))))))) -> 4(3(2(5(5(1(0(3(4(0(2(1(3(3(2(5(x1)))))))))))))))) 0(4(2(3(2(1(5(0(4(2(5(5(0(4(4(5(5(x1))))))))))))))))) -> 3(1(5(1(1(0(3(3(5(4(2(1(3(4(0(2(3(0(x1)))))))))))))))))) 3(2(5(0(4(1(3(3(2(1(1(4(0(3(5(3(4(1(0(x1))))))))))))))))))) -> 4(0(0(0(4(1(2(2(0(4(0(5(4(5(0(0(3(0(x1)))))))))))))))))) 2(0(1(5(3(2(1(3(1(5(0(3(4(4(4(0(0(1(2(4(x1)))))))))))))))))))) -> 1(5(5(2(2(4(3(2(5(4(2(4(0(5(4(1(4(4(x1)))))))))))))))))) 4(0(0(5(4(1(2(2(5(4(1(0(2(2(5(4(1(4(4(4(x1)))))))))))))))))))) -> 4(1(5(2(2(0(2(3(0(5(2(3(5(4(0(4(1(2(1(2(x1)))))))))))))))))))) 4(2(5(2(3(4(4(4(3(2(5(2(4(1(4(1(4(0(2(3(5(x1))))))))))))))))))))) -> 5(5(0(3(4(3(5(2(4(4(5(1(2(0(0(3(4(0(5(x1))))))))))))))))))) Bounds Processor: bound: 0 enrichment: match automaton: final states: {272,253,236,220,204,190,176,166,155,143,132,121,110, 104,96,88,79,73,66,59,56,48,40,33,26,21,16,10,5,1} transitions: 30(213) -> 214* 30(168) -> 169* 30(113) -> 114* 30(2) -> 34* 30(264) -> 265* 30(115) -> 116* 30(23) -> 191* 30(212) -> 213* 30(114) -> 115* 30(144) -> 145* 30(95) -> 88* 30(150) -> 151* 30(57) -> 58* popout

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

job log

popout

actions

all output return to SRS Standard