/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

Problem:
 strict:
  a(c(b(x1))) -> a(a(b(x1)))
  b(c(b(x1))) -> b(a(b(x1)))
  a(c(b(x1))) -> b(a(a(x1)))
 weak:
  a(b(a(x1))) -> c(a(b(x1)))
  a(b(a(x1))) -> c(c(a(x1)))
  c(b(c(x1))) -> b(a(c(x1)))
  a(b(c(x1))) -> c(c(a(x1)))

Proof:
 String Reversal Processor:
  strict:
   b(c(a(x1))) -> b(a(a(x1)))
   b(c(b(x1))) -> b(a(b(x1)))
   b(c(a(x1))) -> a(a(b(x1)))
  weak:
   a(b(a(x1))) -> b(a(c(x1)))
   a(b(a(x1))) -> a(c(c(x1)))
   c(b(c(x1))) -> c(a(b(x1)))
   c(b(a(x1))) -> a(c(c(x1)))
  Arctic Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0,
    
    [b](x0) = 1x0,
    
    [a](x0) = x0
   orientation:
    b(c(a(x1))) = 1x1 >= 1x1 = b(a(a(x1)))
    
    b(c(b(x1))) = 2x1 >= 2x1 = b(a(b(x1)))
    
    b(c(a(x1))) = 1x1 >= 1x1 = a(a(b(x1)))
    
    a(b(a(x1))) = 1x1 >= 1x1 = b(a(c(x1)))
    
    a(b(a(x1))) = 1x1 >= x1 = a(c(c(x1)))
    
    c(b(c(x1))) = 1x1 >= 1x1 = c(a(b(x1)))
    
    c(b(a(x1))) = 1x1 >= x1 = a(c(c(x1)))
   problem:
    strict:
     b(c(a(x1))) -> b(a(a(x1)))
     b(c(b(x1))) -> b(a(b(x1)))
     b(c(a(x1))) -> a(a(b(x1)))
    weak:
     a(b(a(x1))) -> b(a(c(x1)))
     c(b(c(x1))) -> c(a(b(x1)))
   Bounds Processor:
    bound: 1
    enrichment: match-rt
    automaton:
     final states: {4}
     transitions:
      b1(25) -> 26*
      b1(29) -> 30*
      c1(81) -> 82*
      c1(96) -> 97*
      c1(63) -> 64*
      a1(27) -> 28*
      a1(26) -> 27*
      a1(61) -> 62*
      b0(4) -> 4*
      a0(4) -> 4*
      c0(4) -> 4*
      27 -> 63,29
      64 -> 82,97,26
      30 -> 28,62,27,4,26
      28 -> 26,4
      4 -> 81,61,25
      82 -> 26*
      26 -> 96*
      62 -> 26*
      97 -> 26*
    problem:
     strict:
      b(c(a(x1))) -> b(a(a(x1)))
      b(c(b(x1))) -> b(a(b(x1)))
     weak:
      a(b(a(x1))) -> b(a(c(x1)))
      c(b(c(x1))) -> c(a(b(x1)))
    Bounds Processor:
     bound: 1
     enrichment: match-rt
     automaton:
      final states: {4}
      transitions:
       b1(25) -> 26*
       b1(11) -> 12*
       b1(80) -> 81*
       b1(63) -> 64*
       c1(31) -> 32*
       c1(45) -> 46*
       c1(92) -> 93*
       c1(55) -> 56*
       a1(64) -> 65*
       a1(10) -> 11*
       a1(9) -> 10*
       b0(4) -> 4*
       a0(4) -> 4*
       c0(4) -> 4*
       56 -> 9*
       46 -> 93,56,9
       64 -> 92*
       12 -> 64,4
       93 -> 9*
       4 -> 63,45,9
       26 -> 65,64,11,10,4
       65 -> 80,45
       9 -> 55*
       10 -> 31,25
       81 -> 64*
       32 -> 9*
     problem:
      strict:
       b(c(b(x1))) -> b(a(b(x1)))
      weak:
       a(b(a(x1))) -> b(a(c(x1)))
       c(b(c(x1))) -> c(a(b(x1)))
     Bounds Processor:
      bound: 1
      enrichment: match-rt
      automaton:
       final states: {3,2,1}
       transitions:
        b1(7) -> 8*
        b1(31) -> 32*
        b1(5) -> 6*
        b1(17) -> 18*
        b1(15) -> 16*
        c1(47) -> 48*
        c1(59) -> 60*
        c1(33) -> 34*
        c1(29) -> 30*
        c1(53) -> 54*
        c1(43) -> 44*
        c1(55) -> 56*
        c1(49) -> 50*
        a1(6) -> 7*
        a1(30) -> 31*
        a1(23) -> 24*
        a1(37) -> 38*
        b0(3) -> 1*
        b0(2) -> 1*
        b0(1) -> 1*
        c0(2) -> 2*
        c0(1) -> 2*
        c0(3) -> 2*
        a0(1) -> 3*
        a0(3) -> 3*
        a0(2) -> 3*
        56 -> 6*
        24 -> 7*
        48 -> 30*
        30 -> 55*
        7 -> 59*
        16 -> 6*
        2 -> 49,15
        54 -> 30*
        6 -> 29*
        38 -> 7*
        44 -> 30*
        60 -> 48,44,30
        8 -> 38,16,23,1
        1 -> 43,3,17
        34 -> 30*
        37 -> 53*
        50 -> 30*
        3 -> 47,5
        18 -> 6*
        32 -> 37,3,24
        23 -> 33*
      problem:
       strict:
        
       weak:
        a(b(a(x1))) -> b(a(c(x1)))
        c(b(c(x1))) -> c(a(b(x1)))
      Qed