/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: b(a(x1)) -> a(a(d(x1))) a(c(x1)) -> b(b(x1)) d(a(b(x1))) -> b(d(d(c(x1)))) d(x1) -> a(x1) b(a(c(a(x1)))) -> x1 Proof: String Reversal Processor: a(b(x1)) -> d(a(a(x1))) c(a(x1)) -> b(b(x1)) b(a(d(x1))) -> c(d(d(b(x1)))) d(x1) -> a(x1) a(c(a(b(x1)))) -> x1 Bounds Processor: bound: 4 enrichment: match automaton: final states: {2,3,7,5,1} transitions: a1(10) -> 11* a1(27) -> 28* a1(26) -> 27* a1(16) -> 17* a1(18) -> 19* b1(124) -> 125* b1(64) -> 65* b1(34) -> 35* b1(33) -> 34* d1(65) -> 66* d1(66) -> 67* d1(28) -> 29* a2(40) -> 41* a2(87) -> 88* a2(49) -> 50* a2(86) -> 87* a2(76) -> 77* a2(41) -> 42* a2(36) -> 37* a2(128) -> 129* a2(78) -> 79* a2(48) -> 49* d2(50) -> 51* d2(42) -> 43* d2(88) -> 89* a3(60) -> 61* a3(107) -> 108* a3(104) -> 105* a3(106) -> 107* a3(101) -> 102* a3(138) -> 139* a3(58) -> 59* a3(100) -> 101* f40() -> 2* c1(67) -> 68* d0(4) -> 1* d0(6) -> 8* d0(8) -> 9* b2(132) -> 133* b2(94) -> 95* b2(93) -> 94* a0(2) -> 3* a0(3) -> 4* d3(102) -> 103* d3(108) -> 109* b0(2) -> 6* b0(6) -> 5* a4(112) -> 113* a4(120) -> 121* c0(9) -> 7* 1 -> 113,121,59,108,102,139,42,58,112,120,61,79,107,105,129,50,88,49,17,104,87,19,37,28,4,36,27,3 2 -> 101,1,37,28,4,36,27,3,26 4 -> 64,18 6 -> 10* 7 -> 6,10 8 -> 16* 11 -> 8* 16 -> 33* 17 -> 9* 18 -> 132,124 19 -> 1* 28 -> 36* 29 -> 11,16 33 -> 48* 34 -> 40* 35 -> 7* 37 -> 29,11,8 42 -> 58* 43 -> 11,8 50 -> 60* 51 -> 41* 59 -> 43,11,8 61 -> 51,41 64 -> 86* 65 -> 76* 66 -> 78* 68 -> 133,125,94,100,65,34,40 77 -> 66* 78 -> 93* 79 -> 67* 88 -> 104* 89 -> 77,66 93 -> 106* 94 -> 100* 95 -> 68,65,34,76 102 -> 112* 103 -> 101,41,77 105 -> 89* 108 -> 120* 109 -> 101* 113 -> 103,77,66,41 121 -> 109,101 124 -> 128* 125 -> 34* 129 -> 49* 132 -> 138* 133 -> 94* 139 -> 101* problem: Qed