details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	3.87504 seconds
cpu usage	13.8937
user time	12.8532
system time	1.04057
max virtual memory	6200404.0
max residence set size	86180.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 0(0(1(0(x1)))) -> 0(2(0(0(3(1(x1)))))) 0(0(1(0(x1)))) -> 0(2(0(4(1(0(x1)))))) 0(0(1(0(x1)))) -> 2(0(0(0(2(1(x1)))))) 3(0(1(0(x1)))) -> 0(2(3(1(0(x1))))) 3(0(1(0(x1)))) -> 3(1(0(0(2(x1))))) 3(0(1(0(x1)))) -> 3(1(1(0(0(x1))))) 3(0(1(0(x1)))) -> 3(1(2(0(0(x1))))) 3(0(1(0(x1)))) -> 3(1(5(0(0(x1))))) 3(0(1(0(x1)))) -> 3(5(1(0(0(x1))))) 3(0(1(0(x1)))) -> 5(0(3(1(0(x1))))) 3(0(1(0(x1)))) -> 2(0(2(3(1(0(x1)))))) 3(0(1(0(x1)))) -> 2(2(0(3(1(0(x1)))))) 3(0(1(0(x1)))) -> 3(1(5(0(0(0(x1)))))) 3(0(1(0(x1)))) -> 3(1(5(0(2(0(x1)))))) 3(0(1(0(x1)))) -> 3(1(5(1(0(0(x1)))))) 3(0(1(0(x1)))) -> 3(1(5(2(0(0(x1)))))) 3(0(1(0(x1)))) -> 3(1(5(5(0(0(x1)))))) 3(0(1(0(x1)))) -> 3(2(2(1(0(0(x1)))))) 3(0(1(0(x1)))) -> 3(5(1(0(0(2(x1)))))) 3(0(1(0(x1)))) -> 3(5(1(5(0(0(x1)))))) 3(0(1(0(x1)))) -> 5(1(1(3(0(0(x1)))))) 3(4(1(0(x1)))) -> 3(1(2(4(0(x1))))) 3(4(1(0(x1)))) -> 3(1(4(0(2(x1))))) 3(4(1(0(x1)))) -> 3(1(5(4(0(x1))))) 3(4(1(0(x1)))) -> 3(4(2(1(0(x1))))) 3(4(1(0(x1)))) -> 3(1(1(5(4(0(x1)))))) 3(4(1(0(x1)))) -> 3(1(2(1(4(0(x1)))))) 3(4(1(0(x1)))) -> 3(1(2(5(4(0(x1)))))) 3(4(1(0(x1)))) -> 3(1(4(2(0(2(x1)))))) 3(4(1(0(x1)))) -> 3(1(5(4(0(2(x1)))))) 3(4(1(0(x1)))) -> 3(1(5(5(4(0(x1)))))) 3(4(1(0(x1)))) -> 3(4(2(1(1(0(x1)))))) 3(4(1(0(x1)))) -> 3(4(5(1(2(0(x1)))))) 0(1(4(1(0(x1))))) -> 0(1(1(4(0(2(x1)))))) 0(2(0(1(0(x1))))) -> 0(2(0(0(3(1(x1)))))) 0(2(0(1(0(x1))))) -> 2(0(0(0(3(1(x1)))))) 0(3(0(1(0(x1))))) -> 0(0(3(1(3(0(x1)))))) 0(3(0(1(0(x1))))) -> 0(0(3(3(1(0(x1)))))) 0(3(0(1(0(x1))))) -> 0(0(3(5(1(0(x1)))))) 0(3(0(1(0(x1))))) -> 2(0(0(3(1(0(x1)))))) 0(3(4(1(0(x1))))) -> 0(2(0(4(3(1(x1)))))) 0(5(0(1(0(x1))))) -> 0(0(0(1(5(2(x1)))))) 0(5(0(1(0(x1))))) -> 0(0(1(5(1(0(x1)))))) 0(5(0(1(0(x1))))) -> 0(2(0(0(1(5(x1)))))) 3(0(1(0(0(x1))))) -> 3(1(3(0(0(0(x1)))))) 3(0(1(1(0(x1))))) -> 3(1(0(1(2(0(x1)))))) 3(0(2(1(0(x1))))) -> 2(0(3(1(1(0(x1)))))) 3(0(2(1(0(x1))))) -> 2(3(1(5(0(0(x1)))))) 3(0(2(1(0(x1))))) -> 3(1(2(0(1(0(x1)))))) 3(0(2(1(0(x1))))) -> 3(1(2(0(5(0(x1)))))) 3(0(5(1(0(x1))))) -> 3(1(5(2(0(0(x1)))))) 3(1(0(1(0(x1))))) -> 2(0(3(1(1(0(x1)))))) 3(1(0(1(0(x1))))) -> 3(1(1(1(0(0(x1)))))) 3(1(0(1(0(x1))))) -> 3(1(2(1(0(0(x1)))))) 3(1(4(1(0(x1))))) -> 3(1(2(1(4(0(x1)))))) 3(1(4(1(0(x1))))) -> 3(1(5(1(4(0(x1)))))) 3(2(0(1(0(x1))))) -> 0(2(3(1(5(0(x1)))))) 3(2(0(1(0(x1))))) -> 2(0(3(1(1(0(x1)))))) 3(3(0(1(0(x1))))) -> 3(1(2(0(3(0(x1)))))) 3(3(0(1(0(x1))))) -> 3(1(2(3(0(0(x1)))))) 3(3(4(1(0(x1))))) -> 3(1(2(4(3(0(x1)))))) 3(3(4(1(0(x1))))) -> 3(1(3(4(0(2(x1)))))) 3(3(4(1(0(x1))))) -> 3(1(4(3(1(0(x1)))))) 3(4(0(1(0(x1))))) -> 0(2(4(1(3(0(x1)))))) 3(4(0(1(0(x1))))) -> 3(1(4(0(0(2(x1)))))) 3(4(0(1(0(x1))))) -> 3(2(0(4(1(0(x1)))))) 3(4(4(1(0(x1))))) -> 3(1(1(4(4(0(x1)))))) Proof: Bounds Processor: bound: 0 enrichment: match automaton: final states: {202,201,198,195,192,189,185,182,178,174,171,169,167, 162,158,157,154,151,148,142,139,134,130,128,124,121, 116,114,112,108,104,101,98,94,91,87,85,82,79,76,72, 68,66,64,61,58,55,53,48,44,42,41,39,37,34,31,27,22, 19,14,8,1} transitions: 00(119) -> 120* 00(122) -> 123* 00(13) -> 8* 00(144) -> 145* 00(145) -> 146* 00(5) -> 6* 00(109) -> 152* 00(16) -> 17* 00(40) -> 129* 00(126) -> 127* 00(120) -> 116* 00(20) -> 40* 00(127) -> 124* 00(15) -> 16* 00(7) -> 1* 00(137) -> 138* 00(23) -> 24* 00(140) -> 141* popout

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

job log

popout

actions

all output return to SRS Standard