details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	7.41605520248 seconds
cpu usage	27.810660371
max memory	1.850281984E9

stage attributes

key	value
output-size	9368
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: 0(0(1(2(x1)))) -> 0(3(4(2(x1)))) 2(0(1(0(5(3(x1)))))) -> 2(0(3(1(3(3(x1)))))) 4(1(1(5(0(4(x1)))))) -> 4(4(2(2(0(4(x1)))))) 2(3(2(5(5(0(0(0(x1)))))))) -> 0(2(1(4(2(5(3(2(x1)))))))) 5(0(0(5(3(3(4(3(x1)))))))) -> 5(3(1(3(0(3(0(3(x1)))))))) 1(0(0(1(5(5(4(2(4(x1))))))))) -> 4(3(1(0(4(1(0(3(3(x1))))))))) 3(0(0(1(0(4(5(4(2(x1))))))))) -> 4(4(5(3(1(2(3(4(2(x1))))))))) 3(2(3(1(2(2(2(4(3(5(x1)))))))))) -> 5(3(4(4(4(4(0(4(0(x1))))))))) 0(0(1(2(5(1(4(4(5(5(4(x1))))))))))) -> 0(0(0(4(1(1(3(5(3(4(2(x1))))))))))) 1(5(2(2(5(1(1(2(4(4(5(4(x1)))))))))))) -> 1(2(2(3(3(3(3(0(1(1(3(4(x1)))))))))))) 4(1(5(3(3(5(0(4(5(1(4(4(1(x1))))))))))))) -> 5(4(3(2(2(3(3(2(1(2(5(0(5(x1))))))))))))) 1(0(3(0(0(0(0(2(3(1(4(0(2(0(4(x1))))))))))))))) -> 1(4(4(0(4(1(4(0(3(2(4(1(0(2(4(x1))))))))))))))) 2(5(0(5(1(5(2(3(5(3(1(3(5(4(5(x1))))))))))))))) -> 2(2(5(4(2(0(1(5(1(1(4(1(0(3(4(x1))))))))))))))) 5(2(5(1(1(5(0(0(3(0(5(5(3(3(2(x1))))))))))))))) -> 5(5(3(3(1(5(0(3(1(0(4(3(1(3(2(x1))))))))))))))) 2(1(1(5(2(5(5(0(1(3(4(1(4(4(5(3(x1)))))))))))))))) -> 2(5(2(3(3(5(4(3(5(4(5(5(0(0(3(1(x1)))))))))))))))) 0(4(4(5(0(4(5(0(5(2(3(0(0(2(4(4(2(x1))))))))))))))))) -> 0(4(4(3(0(2(5(0(5(4(1(3(5(4(4(1(0(x1))))))))))))))))) 1(1(0(0(3(1(3(0(2(1(2(5(2(5(0(2(0(x1))))))))))))))))) -> 2(2(4(3(2(1(3(2(2(1(4(3(0(2(2(5(5(x1))))))))))))))))) 2(5(4(4(4(2(3(5(4(0(4(0(0(5(4(5(5(x1))))))))))))))))) -> 5(3(1(4(4(5(0(5(0(3(1(2(1(1(2(4(3(x1))))))))))))))))) 5(0(0(1(3(3(2(5(3(4(0(3(4(3(5(4(4(2(x1)))))))))))))))))) -> 5(5(0(0(1(1(1(0(2(2(2(1(3(2(1(2(2(2(x1)))))))))))))))))) 4(4(0(2(2(1(1(4(1(1(1(0(0(0(2(3(4(4(4(x1))))))))))))))))))) -> 3(1(0(3(4(2(2(1(0(1(5(2(0(5(4(4(2(1(4(x1))))))))))))))))))) 0(3(2(2(1(4(5(3(3(5(5(1(5(1(0(5(1(5(5(1(x1)))))))))))))))))))) -> 0(3(1(4(0(2(0(0(2(4(5(0(2(3(0(5(2(1(5(1(x1)))))))))))))))))))) 4(2(3(1(4(3(0(3(1(1(5(0(4(1(3(4(3(1(4(4(x1)))))))))))))))))))) -> 4(1(4(4(2(5(5(1(5(4(5(5(2(0(5(0(2(0(5(x1))))))))))))))))))) 1(4(1(4(2(5(4(5(5(0(5(0(4(0(4(5(0(0(5(4(2(x1))))))))))))))))))))) -> 1(5(5(1(1(3(0(3(5(5(3(2(4(2(0(3(5(1(0(3(2(x1))))))))))))))))))))) 2(2(4(0(0(1(4(3(1(4(4(3(1(2(1(1(5(0(4(5(0(x1))))))))))))))))))))) -> 4(3(0(2(4(0(4(3(0(4(2(0(5(1(4(2(3(2(3(0(0(x1))))))))))))))))))))) 4(2(4(2(5(5(2(0(2(0(2(0(3(1(5(3(0(1(4(4(2(x1))))))))))))))))))))) -> 4(2(4(5(1(3(5(2(4(4(2(0(5(0(1(2(5(2(4(5(0(x1))))))))))))))))))))) Proof: Bounds Processor: bound: 0 enrichment: match automaton: final states: {300,280,261,244,225,207,190,174,158,142,126,113,100, 86,73,62,54,45,39,32,25,18,12,6,1} transitions: 00(297) -> 298* 00(153) -> 154* 00(47) -> 48* 00(119) -> 120* 00(265) -> 266* 00(116) -> 117* 00(273) -> 274* 00(13) -> 14* 00(199) -> 200* 00(5) -> 1* 00(59) -> 60* 00(243) -> 225* 00(229) -> 230* 00(212) -> 213* 00(60) -> 61* 00(183) -> 184* 00(129) -> 130* 00(35) -> 36* 00(27) -> 28* 00(7) -> 26* 00(161) -> 162* 00(216) -> 217* 00(203) -> 204* 00(245) -> 246* 00(87) -> 88* 00(96) -> 97* 00(181) -> 182* 00(150) -> 151* 00(74) -> 75* 00(222) -> 223* 00(236) -> 237* 00(61) -> 54* 00(63) -> 101* 00(8) -> 33* 00(92) -> 93* 00(107) -> 108* 00(239) -> 240* 00(291) -> 292* 00(247) -> 248* 00(294) -> 295* 00(24) -> 18* 00(308) -> 309* 00(232) -> 233* 00(19) -> 262* 00(10) -> 11* 00(204) -> 205* popout

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

job log

popout

actions

all output return to SRS Standard