details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	1.40508699417 seconds
cpu usage	4.266940258
max memory	9.14796544E8

stage attributes

key	value
output-size	4112
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: 1(2(1(1(0(0(1(0(2(1(1(0(2(x1))))))))))))) -> 1(2(2(1(0(0(2(0(1(2(2(0(1(0(0(2(2(x1))))))))))))))))) 2(0(1(2(1(2(1(2(1(0(0(1(0(x1))))))))))))) -> 2(2(0(0(2(1(1(1(0(0(0(1(1(1(2(2(0(x1))))))))))))))))) 2(1(0(0(2(1(1(1(0(1(2(2(0(x1))))))))))))) -> 0(0(2(1(0(0(1(1(2(2(2(2(2(1(2(1(0(x1))))))))))))))))) 2(2(0(0(1(0(2(1(1(1(0(0(1(x1))))))))))))) -> 2(2(1(1(2(0(0(1(2(2(0(2(0(0(2(2(2(x1))))))))))))))))) 2(2(1(0(1(0(1(1(0(0(0(2(0(x1))))))))))))) -> 0(2(2(1(0(0(1(0(0(1(1(1(1(0(0(2(0(x1))))))))))))))))) 2(2(1(1(0(2(0(0(0(2(2(0(0(x1))))))))))))) -> 0(0(1(2(0(0(0(2(2(0(1(2(2(2(2(0(0(x1))))))))))))))))) 2(2(2(1(0(2(0(0(1(0(1(0(2(x1))))))))))))) -> 0(2(2(0(0(2(2(2(1(2(0(0(2(2(0(2(2(x1))))))))))))))))) Proof: String Reversal Processor: 2(0(1(1(2(0(1(0(0(1(1(2(1(x1))))))))))))) -> 2(2(0(0(1(0(2(2(1(0(2(0(0(1(2(2(1(x1))))))))))))))))) 0(1(0(0(1(2(1(2(1(2(1(0(2(x1))))))))))))) -> 0(2(2(1(1(1(0(0(0(1(1(1(2(0(0(2(2(x1))))))))))))))))) 0(2(2(1(0(1(1(1(2(0(0(1(2(x1))))))))))))) -> 0(1(2(1(2(2(2(2(2(1(1(0(0(1(2(0(0(x1))))))))))))))))) 1(0(0(1(1(1(2(0(1(0(0(2(2(x1))))))))))))) -> 2(2(2(0(0(2(0(2(2(1(0(0(2(1(1(2(2(x1))))))))))))))))) 0(2(0(0(0(1(1(0(1(0(1(2(2(x1))))))))))))) -> 0(2(0(0(1(1(1(1(0(0(1(0(0(1(2(2(0(x1))))))))))))))))) 0(0(2(2(0(0(0(2(0(1(1(2(2(x1))))))))))))) -> 0(0(2(2(2(2(1(0(2(2(0(0(0(2(1(0(0(x1))))))))))))))))) 2(0(1(0(1(0(0(2(0(1(2(2(2(x1))))))))))))) -> 2(2(0(2(2(0(0(2(1(2(2(2(0(0(2(2(0(x1))))))))))))))))) Bounds Processor: bound: 0 enrichment: match automaton: final states: {99,84,68,53,36,19,1} transitions: 00(7) -> 8* 00(16) -> 17* 00(40) -> 41* 00(83) -> 68* 00(27) -> 28* 00(9) -> 10* 00(52) -> 36* 00(57) -> 58* 00(61) -> 62* 00(37) -> 38* 00(72) -> 73* 00(21) -> 22* 00(2) -> 37* 00(35) -> 19* 00(74) -> 75* 00(91) -> 92* 00(28) -> 29* 00(98) -> 84* 00(87) -> 88* 00(106) -> 107* 00(81) -> 82* 00(86) -> 87* 00(80) -> 81* 00(88) -> 89* 00(63) -> 64* 00(13) -> 14* 00(6) -> 7* 00(70) -> 100* 00(29) -> 30* 00(15) -> 16* 00(56) -> 57* 00(110) -> 111* 00(41) -> 42* 00(107) -> 108* 00(100) -> 101* 00(71) -> 72* 00(75) -> 76* 00(97) -> 98* 00(22) -> 23* 00(64) -> 65* f30() -> 2* 20(34) -> 35* 20(105) -> 106* 20(94) -> 95* 20(48) -> 49* 20(67) -> 53* 20(3) -> 4* 20(50) -> 51* 20(62) -> 63* 20(46) -> 47* 20(44) -> 45* 20(96) -> 97* 20(108) -> 109* 20(38) -> 39* 20(11) -> 12* 20(95) -> 96* 20(66) -> 67* 20(89) -> 90* 20(109) -> 110* 20(4) -> 5* 20(60) -> 61* popout

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

job log

popout

actions

all output return to SRS Standard