details

property	value
status	complete
benchmark	4282.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)	16.0272 seconds
cpu usage	61.5049
user time	59.5714
system time	1.93356
max virtual memory	7374480.0
max residence set size	233740.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 3(0(0(x1))) -> 3(3(3(1(3(1(3(2(3(3(x1)))))))))) 0(0(1(4(x1)))) -> 5(2(3(5(5(2(5(1(1(4(x1)))))))))) 0(4(0(1(x1)))) -> 5(3(2(2(2(3(2(2(3(1(x1)))))))))) 4(0(0(3(x1)))) -> 5(3(3(4(2(3(5(5(2(3(x1)))))))))) 4(2(4(0(x1)))) -> 1(1(5(0(2(1(3(0(3(4(x1)))))))))) 5(0(0(4(x1)))) -> 5(2(3(1(1(0(5(4(4(4(x1)))))))))) 0(4(0(1(0(x1))))) -> 5(2(3(5(4(1(5(5(3(2(x1)))))))))) 1(0(0(1(0(x1))))) -> 1(0(4(4(5(2(2(3(3(2(x1)))))))))) 2(4(0(0(1(x1))))) -> 2(0(2(3(3(3(3(3(4(1(x1)))))))))) 3(0(4(0(5(x1))))) -> 3(4(1(1(3(4(0(5(2(2(x1)))))))))) 3(2(5(2(1(x1))))) -> 3(2(2(3(1(1(4(3(1(1(x1)))))))))) 5(0(0(4(1(x1))))) -> 1(3(1(1(2(2(3(0(0(3(x1)))))))))) 0(0(5(0(0(0(x1)))))) -> 0(3(4(5(4(4(4(0(4(4(x1)))))))))) 1(0(0(0(4(3(x1)))))) -> 1(5(5(2(2(4(3(2(3(3(x1)))))))))) 1(3(0(5(3(2(x1)))))) -> 1(2(3(0(3(3(1(5(2(2(x1)))))))))) 1(3(2(4(5(0(x1)))))) -> 1(1(1(0(3(3(1(5(2(0(x1)))))))))) 1(4(5(0(2(1(x1)))))) -> 1(2(1(1(2(1(3(5(5(1(x1)))))))))) 2(0(4(2(5(3(x1)))))) -> 2(1(4(2(3(1(5(5(4(1(x1)))))))))) 4(0(1(0(0(1(x1)))))) -> 4(2(4(1(3(4(1(5(5(1(x1)))))))))) 4(1(4(4(0(4(x1)))))) -> 4(1(3(3(1(5(0(2(4(4(x1)))))))))) 5(0(0(0(4(0(x1)))))) -> 5(0(5(3(4(1(1(0(3(4(x1)))))))))) 5(4(2(0(0(5(x1)))))) -> 5(4(5(1(1(0(5(2(1(4(x1)))))))))) 0(0(0(3(2(4(3(x1))))))) -> 5(2(2(5(5(4(0(1(2(3(x1)))))))))) 0(0(2(4(0(5(0(x1))))))) -> 5(2(2(4(1(0(4(4(3(4(x1)))))))))) 0(1(5(2(0(4(3(x1))))))) -> 0(1(1(1(3(2(0(3(4(3(x1)))))))))) 0(4(3(3(0(0(5(x1))))))) -> 2(5(4(1(3(3(3(0(0(5(x1)))))))))) 1(0(0(0(0(0(3(x1))))))) -> 5(2(5(1(1(2(5(1(0(1(x1)))))))))) 1(0(0(0(5(4(1(x1))))))) -> 1(2(3(1(0(2(4(3(4(1(x1)))))))))) 1(3(2(1(2(0(1(x1))))))) -> 1(4(2(1(3(1(1(5(3(1(x1)))))))))) 2(0(2(0(1(4(4(x1))))))) -> 2(0(2(3(5(4(3(0(1(3(x1)))))))))) 2(0(5(3(0(5(0(x1))))))) -> 2(5(5(1(2(1(1(4(4(0(x1)))))))))) 2(1(4(2(5(0(1(x1))))))) -> 2(4(0(2(3(5(5(4(5(3(x1)))))))))) 2(4(3(3(2(5(3(x1))))))) -> 2(4(4(2(3(2(2(4(4(5(x1)))))))))) 2(5(3(0(4(3(2(x1))))))) -> 2(2(5(3(0(3(3(0(3(0(x1)))))))))) 3(3(0(5(3(0(4(x1))))))) -> 3(3(4(1(0(5(5(3(1(4(x1)))))))))) 3(4(1(4(5(4(2(x1))))))) -> 3(5(3(3(1(1(3(1(1(2(x1)))))))))) 3(4(3(2(4(1(2(x1))))))) -> 3(5(1(1(1(5(3(1(3(0(x1)))))))))) 4(2(5(4(0(2(1(x1))))))) -> 1(1(1(1(5(5(1(4(5(1(x1)))))))))) 4(3(2(0(1(0(5(x1))))))) -> 4(3(1(3(3(0(1(0(3(4(x1)))))))))) 4(3(3(2(3(4(3(x1))))))) -> 4(0(3(0(3(3(3(5(4(4(x1)))))))))) 5(0(1(0(5(0(0(x1))))))) -> 5(0(0(1(1(3(4(3(0(0(x1)))))))))) 5(4(0(1(4(0(1(x1))))))) -> 4(1(4(5(3(5(1(2(4(1(x1)))))))))) Proof: String Reversal Processor: 0(0(3(x1))) -> 3(3(2(3(1(3(1(3(3(3(x1)))))))))) 4(1(0(0(x1)))) -> 4(1(1(5(2(5(5(3(2(5(x1)))))))))) 1(0(4(0(x1)))) -> 1(3(2(2(3(2(2(2(3(5(x1)))))))))) 3(0(0(4(x1)))) -> 3(2(5(5(3(2(4(3(3(5(x1)))))))))) 0(4(2(4(x1)))) -> 4(3(0(3(1(2(0(5(1(1(x1)))))))))) 4(0(0(5(x1)))) -> 4(4(4(5(0(1(1(3(2(5(x1)))))))))) 0(1(0(4(0(x1))))) -> 2(3(5(5(1(4(5(3(2(5(x1)))))))))) 0(1(0(0(1(x1))))) -> 2(3(3(2(2(5(4(4(0(1(x1)))))))))) 1(0(0(4(2(x1))))) -> 1(4(3(3(3(3(3(2(0(2(x1)))))))))) 5(0(4(0(3(x1))))) -> 2(2(5(0(4(3(1(1(4(3(x1)))))))))) 1(2(5(2(3(x1))))) -> 1(1(3(4(1(1(3(2(2(3(x1)))))))))) 1(4(0(0(5(x1))))) -> 3(0(0(3(2(2(1(1(3(1(x1)))))))))) 0(0(0(5(0(0(x1)))))) -> 4(4(0(4(4(4(5(4(3(0(x1)))))))))) 3(4(0(0(0(1(x1)))))) -> 3(3(2(3(4(2(2(5(5(1(x1)))))))))) 2(3(5(0(3(1(x1)))))) -> 2(2(5(1(3(3(0(3(2(1(x1)))))))))) 0(5(4(2(3(1(x1)))))) -> 0(2(5(1(3(3(0(1(1(1(x1)))))))))) 1(2(0(5(4(1(x1)))))) -> 1(5(5(3(1(2(1(1(2(1(x1)))))))))) 3(5(2(4(0(2(x1)))))) -> 1(4(5(5(1(3(2(4(1(2(x1)))))))))) 1(0(0(1(0(4(x1)))))) -> 1(5(5(1(4(3(1(4(2(4(x1)))))))))) 4(0(4(4(1(4(x1)))))) -> 4(4(2(0(5(1(3(3(1(4(x1)))))))))) 0(4(0(0(0(5(x1)))))) -> 4(3(0(1(1(4(3(5(0(5(x1)))))))))) 5(0(0(2(4(5(x1)))))) -> 4(1(2(5(0(1(1(5(4(5(x1)))))))))) 3(4(2(3(0(0(0(x1))))))) -> 3(2(1(0(4(5(5(2(2(5(x1)))))))))) 0(5(0(4(2(0(0(x1))))))) -> 4(3(4(4(0(1(4(2(2(5(x1)))))))))) 3(4(0(2(5(1(0(x1))))))) -> 3(4(3(0(2(3(1(1(1(0(x1)))))))))) 5(0(0(3(3(4(0(x1))))))) -> 5(0(0(3(3(3(1(4(5(2(x1)))))))))) 3(0(0(0(0(0(1(x1))))))) -> 1(0(1(5(2(1(1(5(2(5(x1)))))))))) 1(4(5(0(0(0(1(x1))))))) -> 1(4(3(4(2(0(1(3(2(1(x1)))))))))) 1(0(2(1(2(3(1(x1))))))) -> 1(3(5(1(1(3(1(2(4(1(x1)))))))))) 4(4(1(0(2(0(2(x1))))))) -> 3(1(0(3(4(5(3(2(0(2(x1)))))))))) 0(5(0(3(5(0(2(x1))))))) -> 0(4(4(1(1(2(1(5(5(2(x1)))))))))) 1(0(5(2(4(1(2(x1))))))) -> 3(5(4(5(5(3(2(0(4(2(x1)))))))))) 3(5(2(3(3(4(2(x1))))))) -> 5(4(4(2(2(3(2(4(4(2(x1)))))))))) 2(3(4(0(3(5(2(x1))))))) -> 0(3(0(3(3(0(3(5(2(2(x1)))))))))) 4(0(3(5(0(3(3(x1))))))) -> 4(1(3(5(5(0(1(4(3(3(x1)))))))))) 2(4(5(4(1(4(3(x1))))))) -> 2(1(1(3(1(1(3(3(5(3(x1)))))))))) 2(1(4(2(3(4(3(x1))))))) -> 0(3(1(3(5(1(1(1(5(3(x1)))))))))) 1(2(0(4(5(2(4(x1))))))) -> 1(5(4(1(5(5(1(1(1(1(x1)))))))))) 5(0(1(0(2(3(4(x1))))))) -> 4(3(0(1(0(3(3(1(3(4(x1)))))))))) 3(4(3(2(3(3(4(x1))))))) -> 4(4(5(3(3(3(0(3(0(4(x1)))))))))) 0(0(5(0(1(0(5(x1))))))) -> 0(0(3(4(3(1(1(0(0(5(x1)))))))))) 1(0(4(1(0(4(5(x1))))))) -> 1(4(2(1(5(3(5(4(1(4(x1)))))))))) Bounds Processor: bound: 1 enrichment: match automaton: final states: {353,345,336,327,320,312,303,295,286,278,269,261,255, 246,239,231,222,213,206,198,189,180,171,161,152,144, 136,127,118,108,99,90,81,71,62,56,49,39,31,22,12,1} transitions: 31(370) -> 371* 31(446) -> 447* popout

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

job log

popout

actions

all output return to SRS Standard