details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	10.5526 seconds
cpu usage	40.0653
user time	38.4759
system time	1.58933
max virtual memory	7134800.0
max residence set size	194348.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(0(1(x1))) -> 0(0(2(1(2(x1))))) 0(0(1(x1))) -> 0(0(3(1(4(x1))))) 0(1(0(x1))) -> 0(0(1(2(4(x1))))) 0(1(0(x1))) -> 2(1(2(0(0(x1))))) 0(1(0(x1))) -> 0(0(1(2(2(4(x1)))))) 0(1(0(x1))) -> 0(0(2(4(1(4(x1)))))) 0(4(0(x1))) -> 3(4(3(2(0(0(x1)))))) 0(0(1(0(x1)))) -> 0(0(0(1(4(x1))))) 0(0(4(1(x1)))) -> 0(0(2(1(4(x1))))) 0(0(4(1(x1)))) -> 0(0(2(1(4(3(x1)))))) 0(1(0(4(x1)))) -> 0(0(3(4(1(2(x1)))))) 0(1(3(0(x1)))) -> 0(0(3(1(4(x1))))) 0(1(3(0(x1)))) -> 0(3(0(1(2(x1))))) 0(1(3(0(x1)))) -> 0(0(1(3(2(5(x1)))))) 0(1(4(0(x1)))) -> 0(2(0(3(1(4(x1)))))) 0(1(5(1(x1)))) -> 2(1(1(4(5(0(x1)))))) 0(1(5(4(x1)))) -> 1(2(4(2(5(0(x1)))))) 0(1(5(4(x1)))) -> 4(1(0(3(2(5(x1)))))) 0(1(5(4(x1)))) -> 5(0(2(4(1(4(x1)))))) 0(3(0(1(x1)))) -> 0(0(3(1(2(2(x1)))))) 0(3(1(0(x1)))) -> 0(0(3(1(4(x1))))) 0(4(0(1(x1)))) -> 0(0(2(1(4(x1))))) 0(4(5(1(x1)))) -> 1(2(4(2(5(0(x1)))))) 0(4(5(1(x1)))) -> 3(1(4(5(0(2(x1)))))) 0(4(5(1(x1)))) -> 3(2(5(1(4(0(x1)))))) 0(4(5(1(x1)))) -> 5(3(0(5(1(4(x1)))))) 0(4(5(1(x1)))) -> 5(5(0(5(1(4(x1)))))) 0(4(5(4(x1)))) -> 5(2(4(4(0(4(x1)))))) 0(5(1(0(x1)))) -> 0(0(5(1(2(x1))))) 3(5(0(1(x1)))) -> 3(0(2(1(2(5(x1)))))) 3(5(1(0(x1)))) -> 0(5(1(3(2(x1))))) 3(5(1(0(x1)))) -> 2(1(2(0(5(3(x1)))))) 3(5(1(0(x1)))) -> 3(1(2(2(0(5(x1)))))) 3(5(1(0(x1)))) -> 5(1(3(2(0(2(x1)))))) 0(1(3(3(0(x1))))) -> 3(3(2(0(0(1(x1)))))) 0(1(3(5(1(x1))))) -> 1(1(3(4(5(0(x1)))))) 0(1(3(5(1(x1))))) -> 1(1(5(0(3(3(x1)))))) 0(1(5(2(0(x1))))) -> 5(0(3(1(0(2(x1)))))) 0(1(5(4(1(x1))))) -> 5(3(4(1(0(1(x1)))))) 0(1(5(4(4(x1))))) -> 4(5(2(1(4(0(x1)))))) 0(1(5(4(4(x1))))) -> 5(0(4(3(4(1(x1)))))) 0(3(1(0(4(x1))))) -> 0(0(3(1(2(4(x1)))))) 0(4(3(3(0(x1))))) -> 0(2(3(4(0(3(x1)))))) 0(4(5(2(0(x1))))) -> 0(2(2(5(0(4(x1)))))) 0(5(1(5(1(x1))))) -> 5(5(3(0(1(1(x1)))))) 3(0(1(5(4(x1))))) -> 0(5(3(4(1(2(x1)))))) 3(5(0(1(0(x1))))) -> 5(1(2(0(0(3(x1)))))) 3(5(4(0(0(x1))))) -> 5(0(3(0(4(4(x1)))))) 3(5(5(0(1(x1))))) -> 5(5(0(3(1(2(x1)))))) Proof: Bounds Processor: bound: 1 enrichment: match automaton: final states: {181,176,172,170,165,161,156,153,148,145,141,137,132, 129,123,119,114,109,105,101,98,93,91,87,82,77,72,71, 68,64,59,57,51,48,44,38,35,32,29,25,21,16,12,7,1} transitions: 01(189) -> 190* 01(206) -> 207* 01(231) -> 232* 01(213) -> 214* 01(230) -> 231* 01(309) -> 310* 01(289) -> 290* 01(236) -> 237* 01(188) -> 189* 01(237) -> 238* 01(290) -> 291* 01(207) -> 208* 01(308) -> 309* 01(212) -> 213* 11(210) -> 211* 11(287) -> 288* 11(204) -> 205* 11(270) -> 271* 11(282) -> 283* 11(234) -> 235* 11(228) -> 229* 11(306) -> 307* 11(254) -> 255* 11(266) -> 267* 11(250) -> 251* 11(186) -> 187* 00(171) -> 170* 00(182) -> 183* 00(47) -> 44* 00(160) -> 156* 00(88) -> 89* 00(179) -> 180* 00(5) -> 6* 00(58) -> 57* 00(34) -> 32* 00(108) -> 105* 00(154) -> 155* 00(39) -> 157* popout

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

job log

popout

actions

all output return to SRS Standard