details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	3.72055 seconds
cpu usage	13.3307
user time	12.3731
system time	0.957639
max virtual memory	6228960.0
max residence set size	100816.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(1(2(x1))) -> 1(0(0(2(x1)))) 0(1(2(x1))) -> 1(0(3(2(x1)))) 0(1(2(x1))) -> 1(0(0(3(2(x1))))) 0(1(2(x1))) -> 4(5(1(0(2(x1))))) 0(5(2(x1))) -> 5(0(0(2(x1)))) 0(5(2(x1))) -> 5(5(0(2(x1)))) 0(5(2(x1))) -> 5(0(3(3(2(x1))))) 0(5(3(x1))) -> 5(0(0(3(x1)))) 0(5(3(x1))) -> 5(5(0(3(x1)))) 0(0(5(2(x1)))) -> 0(2(0(3(5(5(x1)))))) 0(1(2(3(x1)))) -> 1(3(2(0(3(x1))))) 0(1(2(4(x1)))) -> 4(5(1(0(2(x1))))) 0(1(4(2(x1)))) -> 4(4(1(0(2(x1))))) 0(4(1(2(x1)))) -> 0(4(5(5(1(2(x1)))))) 0(5(2(3(x1)))) -> 5(0(3(2(3(x1))))) 1(2(1(2(x1)))) -> 1(1(5(2(2(x1))))) 4(0(1(2(x1)))) -> 4(1(0(0(2(x1))))) 4(3(0(2(x1)))) -> 4(0(0(3(2(x1))))) 4(3(1(2(x1)))) -> 3(2(5(4(1(1(x1)))))) 0(0(1(2(3(x1))))) -> 3(2(1(0(0(3(x1)))))) 0(0(1(3(2(x1))))) -> 1(0(2(0(0(3(x1)))))) 0(0(1(3(3(x1))))) -> 0(0(3(1(0(3(x1)))))) 0(0(1(5(2(x1))))) -> 1(5(0(0(3(2(x1)))))) 0(1(2(1(2(x1))))) -> 1(1(0(2(2(2(x1)))))) 0(1(4(5(2(x1))))) -> 4(1(0(3(2(5(x1)))))) 0(5(0(1(2(x1))))) -> 1(2(0(1(5(0(x1)))))) 0(5(1(0(2(x1))))) -> 1(5(0(0(3(2(x1)))))) 0(5(1(4(3(x1))))) -> 1(0(3(5(4(5(x1)))))) 0(5(1(4(3(x1))))) -> 4(5(5(1(0(3(x1)))))) 0(5(3(1(2(x1))))) -> 0(1(5(0(2(3(x1)))))) 0(5(3(1(2(x1))))) -> 5(0(1(4(3(2(x1)))))) 0(5(3(4(2(x1))))) -> 3(2(0(3(5(4(x1)))))) 0(5(4(3(2(x1))))) -> 0(0(4(3(2(5(x1)))))) 1(2(5(2(3(x1))))) -> 5(1(2(3(3(2(x1)))))) 1(3(0(5(2(x1))))) -> 0(5(1(0(3(2(x1)))))) 1(3(0(5(2(x1))))) -> 1(3(0(0(2(5(x1)))))) 1(3(3(4(2(x1))))) -> 5(1(3(3(2(4(x1)))))) 4(3(0(2(3(x1))))) -> 0(3(3(3(2(4(x1)))))) 4(3(0(5(3(x1))))) -> 5(4(3(5(0(3(x1)))))) 4(3(3(1(2(x1))))) -> 1(3(0(4(3(2(x1)))))) 5(2(3(0(2(x1))))) -> 4(5(0(2(3(2(x1)))))) 5(2(3(1(2(x1))))) -> 2(3(2(4(1(5(x1)))))) 5(3(0(2(2(x1))))) -> 5(3(3(2(0(2(x1)))))) 5(3(0(5(2(x1))))) -> 5(5(3(0(2(4(x1)))))) 5(3(1(2(2(x1))))) -> 5(1(3(2(2(2(x1)))))) 5(3(1(5(2(x1))))) -> 2(5(5(1(5(3(x1)))))) Proof: Bounds Processor: bound: 0 enrichment: match automaton: final states: {152,149,145,141,136,132,129,126,124,119,115,113,110, 107,101,97,93,90,85,79,74,70,68,64,61,58,52,51,50,46, 42,37,35,32,26,24,20,17,15,14,11,9,6,1} transitions: 40(2) -> 102* 40(127) -> 128* 40(12) -> 36* 40(76) -> 108* 40(137) -> 138* 40(40) -> 41* 40(92) -> 90* 40(10) -> 51* 40(13) -> 11* 40(7) -> 98* 40(1) -> 50* 40(54) -> 55* 40(36) -> 35* 40(27) -> 86* 40(78) -> 74* 40(135) -> 132* 10(69) -> 68* 10(153) -> 154* 10(122) -> 123* 10(72) -> 73* 10(77) -> 78* 10(5) -> 1* 10(34) -> 32* 10(73) -> 70* 10(22) -> 65* 10(27) -> 137* 10(111) -> 112* 10(81) -> 82* 10(23) -> 59* 10(53) -> 54* 10(118) -> 115* 10(84) -> 79* 10(3) -> 38* 10(89) -> 85* 10(150) -> 151* 10(63) -> 61* 10(8) -> 6* 10(4) -> 12* 10(131) -> 129* 10(95) -> 96* 10(48) -> 49* popout

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

job log

popout

actions

all output return to SRS Standard