details

property	value
status	complete
benchmark	3746.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)	9.52488 seconds
cpu usage	37.6849
user time	36.1686
system time	1.51632
max virtual memory	6822876.0
max residence set size	156360.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(5(0(x1))) -> 3(4(3(3(2(0(4(4(4(0(x1)))))))))) 0(2(5(0(x1)))) -> 0(2(1(1(5(2(1(4(1(3(x1)))))))))) 0(5(0(5(x1)))) -> 3(2(0(2(0(4(4(1(5(4(x1)))))))))) 2(5(5(3(x1)))) -> 4(3(0(2(1(0(1(3(4(3(x1)))))))))) 5(5(5(0(x1)))) -> 4(1(2(1(2(3(5(0(1(3(x1)))))))))) 0(5(1(5(0(x1))))) -> 3(4(0(1(4(5(2(2(3(1(x1)))))))))) 3(0(0(5(3(x1))))) -> 1(3(4(3(5(2(4(1(3(3(x1)))))))))) 3(5(5(0(0(x1))))) -> 1(4(1(0(0(4(4(0(4(1(x1)))))))))) 0(2(5(1(5(0(x1)))))) -> 2(1(0(1(5(2(4(0(2(0(x1)))))))))) 0(2(5(5(1(4(x1)))))) -> 4(0(1(1(1(1(0(4(1(5(x1)))))))))) 0(5(3(1(2(5(x1)))))) -> 0(2(3(1(1(2(4(4(5(5(x1)))))))))) 0(5(5(1(5(1(x1)))))) -> 0(5(1(1(3(3(4(2(1(0(x1)))))))))) 4(5(5(4(2(0(x1)))))) -> 2(4(0(1(3(4(4(4(1(0(x1)))))))))) 5(0(0(3(5(2(x1)))))) -> 4(4(2(3(0(1(2(0(5(2(x1)))))))))) 5(1(5(0(2(5(x1)))))) -> 5(0(0(1(4(2(3(2(1(5(x1)))))))))) 5(2(0(2(5(5(x1)))))) -> 5(5(4(4(4(5(4(4(1(4(x1)))))))))) 5(5(0(2(5(0(x1)))))) -> 2(0(5(0(2(1(0(0(3(0(x1)))))))))) 5(5(0(3(4(5(x1)))))) -> 2(0(5(5(2(1(3(2(3(2(x1)))))))))) 5(5(3(5(0(5(x1)))))) -> 5(4(4(3(5(1(3(3(4(5(x1)))))))))) 0(4(4(0(0(5(1(x1))))))) -> 1(3(2(0(4(1(5(1(1(2(x1)))))))))) 0(4(4(2(5(5(5(x1))))))) -> 0(2(4(5(5(4(2(0(1(1(x1)))))))))) 1(0(2(5(2(0(0(x1))))))) -> 3(1(4(4(0(3(0(1(2(2(x1)))))))))) 1(2(0(4(2(5(0(x1))))))) -> 4(2(4(0(3(2(2(4(1(0(x1)))))))))) 1(2(5(5(0(3(3(x1))))))) -> 3(4(1(2(0(3(3(1(0(3(x1)))))))))) 1(5(5(3(3(3(4(x1))))))) -> 1(5(1(0(0(2(2(2(3(5(x1)))))))))) 2(5(4(5(2(5(1(x1))))))) -> 4(3(2(1(4(2(2(4(5(2(x1)))))))))) 3(2(3(5(1(5(2(x1))))))) -> 2(0(3(2(3(2(1(5(5(1(x1)))))))))) 3(3(4(2(5(5(2(x1))))))) -> 1(2(3(3(4(4(1(4(0(1(x1)))))))))) 3(5(0(5(5(5(0(x1))))))) -> 0(0(3(0(3(5(0(3(2(0(x1)))))))))) 4(3(1(2(5(2(4(x1))))))) -> 2(3(1(1(4(3(4(4(2(4(x1)))))))))) 4(5(5(3(1(0(5(x1))))))) -> 1(1(5(2(0(3(3(3(2(1(x1)))))))))) 5(0(5(3(1(0(5(x1))))))) -> 5(2(4(4(2(1(3(5(1(5(x1)))))))))) 5(0(5(3(5(1(5(x1))))))) -> 5(1(1(2(4(0(0(3(2(5(x1)))))))))) 5(1(5(3(3(0(5(x1))))))) -> 4(4(3(2(2(2(5(0(1(1(x1)))))))))) 5(2(0(2(5(3(3(x1))))))) -> 5(2(0(5(1(1(3(2(0(3(x1)))))))))) Proof: Bounds Processor: bound: 1 enrichment: match automaton: final states: {304,297,288,280,271,262,254,245,236,228,219,210,203, 194,185,176,167,158,149,140,132,122,114,105,96,86,77, 68,59,49,41,32,22,12,1} transitions: 21(317) -> 318* 21(354) -> 355* 01(316) -> 317* 01(352) -> 353* 01(345) -> 346* 01(312) -> 313* 30(102) -> 103* 30(168) -> 169* 30(265) -> 266* 30(301) -> 302* 30(160) -> 161* 30(273) -> 274* 30(169) -> 170* 30(13) -> 60* 30(58) -> 49* 30(31) -> 22* 30(109) -> 110* 30(242) -> 243* 30(78) -> 255* 30(108) -> 109* 30(212) -> 213* 30(289) -> 290* 30(39) -> 40* 30(183) -> 184* 30(172) -> 173* 30(205) -> 206* 30(240) -> 241* 30(259) -> 260* 30(33) -> 34* 30(251) -> 252* 30(305) -> 306* 30(269) -> 270* 30(66) -> 67* 30(87) -> 220* 30(218) -> 210* 30(11) -> 1* 30(3) -> 150* 30(272) -> 273* 30(281) -> 282* 30(234) -> 235* 30(8) -> 9* 30(43) -> 44* 30(64) -> 65* 30(50) -> 51* 30(213) -> 214* 30(202) -> 194* 30(197) -> 198* 30(133) -> 134* 30(128) -> 129* 30(257) -> 258* 30(9) -> 10* 30(117) -> 118* popout

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

job log

popout

actions

all output return to SRS Standard