details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	1.77997 seconds
cpu usage	5.82839
user time	5.1029
system time	0.725483
max virtual memory	6037424.0
max residence set size	69372.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: 1(3(3(x1))) -> 3(5(3(2(5(0(2(4(5(4(x1)))))))))) 0(3(3(3(x1)))) -> 5(4(3(5(3(0(5(4(4(0(x1)))))))))) 0(3(3(3(1(x1))))) -> 5(4(4(0(3(1(0(5(1(0(x1)))))))))) 1(2(3(3(3(x1))))) -> 4(1(1(2(3(5(0(4(0(5(x1)))))))))) 1(4(4(2(2(x1))))) -> 1(1(2(0(1(1(1(0(2(2(x1)))))))))) 0(3(3(1(4(3(x1)))))) -> 4(4(3(0(2(3(0(3(0(0(x1)))))))))) 3(3(3(3(4(0(x1)))))) -> 3(0(0(2(1(0(5(3(5(4(x1)))))))))) 4(0(1(3(4(0(x1)))))) -> 2(2(3(0(0(0(5(0(0(0(x1)))))))))) 4(1(4(4(4(1(x1)))))) -> 4(1(0(3(3(5(5(5(4(1(x1)))))))))) 0(1(3(5(2(2(3(x1))))))) -> 0(3(0(0(5(0(0(4(4(3(x1)))))))))) 0(2(3(1(3(2(5(x1))))))) -> 0(4(3(1(2(3(2(3(2(0(x1)))))))))) 1(1(3(3(5(3(1(x1))))))) -> 3(5(0(5(3(2(5(0(0(1(x1)))))))))) 3(5(2(0(1(3(3(x1))))))) -> 3(4(3(2(3(2(4(4(5(5(x1)))))))))) 4(1(4(2(4(0(1(x1))))))) -> 5(2(2(1(0(5(5(4(5(1(x1)))))))))) 4(5(1(2(4(4(4(x1))))))) -> 4(1(1(4(5(3(0(1(0(4(x1)))))))))) 5(1(4(5(3(3(3(x1))))))) -> 5(1(4(5(3(4(4(2(3(2(x1)))))))))) Proof: String Reversal Processor: 3(3(1(x1))) -> 4(5(4(2(0(5(2(3(5(3(x1)))))))))) 3(3(3(0(x1)))) -> 0(4(4(5(0(3(5(3(4(5(x1)))))))))) 1(3(3(3(0(x1))))) -> 0(1(5(0(1(3(0(4(4(5(x1)))))))))) 3(3(3(2(1(x1))))) -> 5(0(4(0(5(3(2(1(1(4(x1)))))))))) 2(2(4(4(1(x1))))) -> 2(2(0(1(1(1(0(2(1(1(x1)))))))))) 3(4(1(3(3(0(x1)))))) -> 0(0(3(0(3(2(0(3(4(4(x1)))))))))) 0(4(3(3(3(3(x1)))))) -> 4(5(3(5(0(1(2(0(0(3(x1)))))))))) 0(4(3(1(0(4(x1)))))) -> 0(0(0(5(0(0(0(3(2(2(x1)))))))))) 1(4(4(4(1(4(x1)))))) -> 1(4(5(5(5(3(3(0(1(4(x1)))))))))) 3(2(2(5(3(1(0(x1))))))) -> 3(4(4(0(0(5(0(0(3(0(x1)))))))))) 5(2(3(1(3(2(0(x1))))))) -> 0(2(3(2(3(2(1(3(4(0(x1)))))))))) 1(3(5(3(3(1(1(x1))))))) -> 1(0(0(5(2(3(5(0(5(3(x1)))))))))) 3(3(1(0(2(5(3(x1))))))) -> 5(5(4(4(2(3(2(3(4(3(x1)))))))))) 1(0(4(2(4(1(4(x1))))))) -> 1(5(4(5(5(0(1(2(2(5(x1)))))))))) 4(4(4(2(1(5(4(x1))))))) -> 4(0(1(0(3(5(4(1(1(4(x1)))))))))) 3(3(3(5(4(1(5(x1))))))) -> 2(3(2(4(4(3(5(4(1(5(x1)))))))))) Bounds Processor: bound: 0 enrichment: match automaton: final states: {138,131,122,113,105,96,86,78,68,59,50,40,30,22,12,1} transitions: 30(2) -> 3* 30(51) -> 52* 30(24) -> 25* 30(79) -> 80* 30(114) -> 115* 30(95) -> 86* 30(34) -> 35* 30(65) -> 66* 30(70) -> 71* 30(133) -> 134* 30(102) -> 103* 30(80) -> 81* 30(145) -> 146* 30(16) -> 17* 30(14) -> 15* 30(116) -> 117* 30(107) -> 108* 30(56) -> 57* 30(4) -> 5* 30(54) -> 55* 30(141) -> 142* 30(97) -> 98* 30(100) -> 101* 30(87) -> 88* 40(119) -> 120* 40(13) -> 14* 40(31) -> 51* 40(142) -> 143* 40(143) -> 144* 40(20) -> 21* 40(93) -> 94* 40(33) -> 132* 40(137) -> 131* 40(139) -> 140* 40(94) -> 95* 40(118) -> 119* 40(87) -> 97* 40(14) -> 23* 40(84) -> 85* 40(11) -> 1* 40(3) -> 114* 40(37) -> 38* 40(19) -> 20* 40(67) -> 59* 40(128) -> 129* 40(9) -> 10* 40(2) -> 31* 00(7) -> 8* 00(104) -> 96* 00(43) -> 44* 00(75) -> 76* 00(29) -> 22* 00(52) -> 53* 00(3) -> 60* 00(38) -> 39* 00(63) -> 64* popout

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

job log

popout

actions

all output return to SRS Standard