details

property	value
status	complete
benchmark	212364.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)	15.197 seconds
cpu usage	58.2857
user time	56.2422
system time	2.04356
max virtual memory	7511108.0
max residence set size	238144.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(1(0(x1))) -> 2(0(0(1(x1)))) 0(1(0(x1))) -> 0(1(2(2(0(x1))))) 0(1(0(x1))) -> 2(0(0(3(1(x1))))) 0(1(0(x1))) -> 0(1(2(4(0(3(x1)))))) 0(1(0(x1))) -> 1(2(2(0(0(4(x1)))))) 0(1(0(x1))) -> 1(2(3(4(0(0(x1)))))) 0(1(0(x1))) -> 1(3(2(0(0(0(x1)))))) 0(1(0(x1))) -> 1(3(4(0(2(0(x1)))))) 0(1(0(x1))) -> 1(3(4(4(0(0(x1)))))) 0(1(0(x1))) -> 2(0(0(1(2(2(x1)))))) 0(1(0(x1))) -> 2(0(0(2(0(1(x1)))))) 0(1(0(x1))) -> 2(0(0(3(0(1(x1)))))) 0(1(0(x1))) -> 2(0(2(0(4(1(x1)))))) 0(1(0(x1))) -> 2(1(2(2(0(0(x1)))))) 0(1(0(x1))) -> 2(4(0(4(0(1(x1)))))) 0(1(0(x1))) -> 4(1(2(2(0(0(x1)))))) 0(1(1(0(x1)))) -> 2(2(0(0(1(1(x1)))))) 0(1(5(0(x1)))) -> 0(3(5(1(0(x1))))) 0(1(5(0(x1)))) -> 0(3(3(5(1(0(x1)))))) 0(5(5(0(x1)))) -> 2(2(0(0(5(5(x1)))))) 1(0(1(0(x1)))) -> 1(1(3(5(0(0(x1)))))) 1(3(0(1(x1)))) -> 1(1(0(3(4(1(x1)))))) 1(3(0(1(x1)))) -> 5(1(1(3(4(0(x1)))))) 3(0(1(0(x1)))) -> 0(1(3(2(0(4(x1)))))) 3(0(1(0(x1)))) -> 2(0(4(3(0(1(x1)))))) 3(0(1(0(x1)))) -> 2(2(3(0(0(1(x1)))))) 3(0(1(0(x1)))) -> 3(0(2(2(0(1(x1)))))) 3(1(0(0(x1)))) -> 1(0(3(4(0(x1))))) 3(1(0(0(x1)))) -> 2(0(3(1(0(x1))))) 3(1(0(0(x1)))) -> 3(0(0(5(1(x1))))) 3(1(0(0(x1)))) -> 1(2(0(3(0(2(x1)))))) 3(1(0(0(x1)))) -> 3(1(3(0(2(0(x1)))))) 3(1(5(0(x1)))) -> 1(1(3(5(0(x1))))) 3(1(5(0(x1)))) -> 0(2(5(1(3(5(x1)))))) 3(1(5(0(x1)))) -> 0(3(1(3(4(5(x1)))))) 3(1(5(0(x1)))) -> 1(5(2(3(5(0(x1)))))) 3(1(5(0(x1)))) -> 3(1(4(0(2(5(x1)))))) 3(1(5(0(x1)))) -> 4(0(5(1(3(5(x1)))))) 0(0(2(1(0(x1))))) -> 2(0(0(0(3(1(x1)))))) 0(1(2(0(1(x1))))) -> 0(0(1(3(2(1(x1)))))) 0(1(2(0(1(x1))))) -> 0(2(0(3(1(1(x1)))))) 1(3(0(2(1(x1))))) -> 0(2(1(1(3(2(x1)))))) 1(3(0(2(1(x1))))) -> 0(3(2(2(1(1(x1)))))) 1(3(0(5(5(x1))))) -> 0(5(4(3(5(1(x1)))))) 1(3(1(5(0(x1))))) -> 1(3(1(5(2(0(x1)))))) 3(0(5(0(0(x1))))) -> 3(0(0(3(5(0(x1)))))) 3(0(5(5(0(x1))))) -> 5(0(2(3(5(0(x1)))))) 3(1(4(0(0(x1))))) -> 1(0(0(3(4(0(x1)))))) 3(1(4(5(0(x1))))) -> 0(5(1(3(5(4(x1)))))) Proof: Bounds Processor: bound: 1 enrichment: match automaton: final states: {190,188,186,183,179,175,171,166,162,157,155,153,148, 145,140,135,131,128,123,119,116,114,111,108,105,101, 96,92,88,82,80,76,71,70,66,62,57,53,49,43,40,36,32, 27,21,15,11,6,1} transitions: 40(2) -> 22* 40(68) -> 69* 40(37) -> 38* 40(176) -> 177* 40(150) -> 151* 40(65) -> 70* 40(3) -> 58* 40(154) -> 153* 40(83) -> 141* 40(7) -> 97* 40(28) -> 29* 40(4) -> 67* 40(54) -> 106* 40(17) -> 18* 40(29) -> 41* 21(264) -> 265* 21(635) -> 636* 21(617) -> 618* 21(231) -> 232* 21(553) -> 554* 21(520) -> 521* 21(285) -> 286* 21(265) -> 266* 21(644) -> 645* 21(211) -> 212* 21(270) -> 271* 21(347) -> 348* 21(564) -> 565* 21(466) -> 467* 21(284) -> 285* 21(427) -> 428* 21(500) -> 501* 21(202) -> 203* 21(304) -> 305* 21(459) -> 460* 21(540) -> 541* 21(403) -> 404* popout

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

job log

popout

actions

all output return to SRS Standard