/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES

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

Proof:
 String Reversal Processor:
  a(x1) -> x1
  b(a(x1)) -> c(a(b(b(x1))))
  b(x1) -> x1
  c(c(x1)) -> a(b(x1))
  DP Processor:
   DPs:
    b#(a(x1)) -> b#(x1)
    b#(a(x1)) -> b#(b(x1))
    b#(a(x1)) -> a#(b(b(x1)))
    b#(a(x1)) -> c#(a(b(b(x1))))
    c#(c(x1)) -> b#(x1)
    c#(c(x1)) -> a#(b(x1))
   TRS:
    a(x1) -> x1
    b(a(x1)) -> c(a(b(b(x1))))
    b(x1) -> x1
    c(c(x1)) -> a(b(x1))
   TDG Processor:
    DPs:
     b#(a(x1)) -> b#(x1)
     b#(a(x1)) -> b#(b(x1))
     b#(a(x1)) -> a#(b(b(x1)))
     b#(a(x1)) -> c#(a(b(b(x1))))
     c#(c(x1)) -> b#(x1)
     c#(c(x1)) -> a#(b(x1))
    TRS:
     a(x1) -> x1
     b(a(x1)) -> c(a(b(b(x1))))
     b(x1) -> x1
     c(c(x1)) -> a(b(x1))
    graph:
     c#(c(x1)) -> b#(x1) -> b#(a(x1)) -> c#(a(b(b(x1))))
     c#(c(x1)) -> b#(x1) -> b#(a(x1)) -> a#(b(b(x1)))
     c#(c(x1)) -> b#(x1) -> b#(a(x1)) -> b#(b(x1))
     c#(c(x1)) -> b#(x1) -> b#(a(x1)) -> b#(x1)
     b#(a(x1)) -> c#(a(b(b(x1)))) -> c#(c(x1)) -> a#(b(x1))
     b#(a(x1)) -> c#(a(b(b(x1)))) -> c#(c(x1)) -> b#(x1)
     b#(a(x1)) -> b#(b(x1)) -> b#(a(x1)) -> c#(a(b(b(x1))))
     b#(a(x1)) -> b#(b(x1)) -> b#(a(x1)) -> a#(b(b(x1)))
     b#(a(x1)) -> b#(b(x1)) -> b#(a(x1)) -> b#(b(x1))
     b#(a(x1)) -> b#(b(x1)) -> b#(a(x1)) -> b#(x1)
     b#(a(x1)) -> b#(x1) -> b#(a(x1)) -> c#(a(b(b(x1))))
     b#(a(x1)) -> b#(x1) -> b#(a(x1)) -> a#(b(b(x1)))
     b#(a(x1)) -> b#(x1) -> b#(a(x1)) -> b#(b(x1))
     b#(a(x1)) -> b#(x1) -> b#(a(x1)) -> b#(x1)
    SCC Processor:
     #sccs: 1
     #rules: 4
     #arcs: 14/36
     DPs:
      c#(c(x1)) -> b#(x1)
      b#(a(x1)) -> b#(x1)
      b#(a(x1)) -> b#(b(x1))
      b#(a(x1)) -> c#(a(b(b(x1))))
     TRS:
      a(x1) -> x1
      b(a(x1)) -> c(a(b(b(x1))))
      b(x1) -> x1
      c(c(x1)) -> a(b(x1))
     Arctic Interpretation Processor:
      dimension: 2
      usable rules:
       a(x1) -> x1
       b(a(x1)) -> c(a(b(b(x1))))
       b(x1) -> x1
       c(c(x1)) -> a(b(x1))
      interpretation:
       [c#](x0) = [-& 1 ]x0 + [0],
       
       [b#](x0) = [0 2]x0 + [1],
       
                 [0 2]     [0]
       [c](x0) = [0 2]x0 + [0],
       
                 [0  -&]  
       [b](x0) = [0  0 ]x0,
       
                 [2  2 ]     [0 ]
       [a](x0) = [-& 0 ]x0 + [-&]
      orientation:
       c#(c(x1)) = [1 3]x1 + [1] >= [0 2]x1 + [1] = b#(x1)
       
       b#(a(x1)) = [2 2]x1 + [1] >= [0 2]x1 + [1] = b#(x1)
       
       b#(a(x1)) = [2 2]x1 + [1] >= [2 2]x1 + [1] = b#(b(x1))
       
       b#(a(x1)) = [2 2]x1 + [1] >= [1 1]x1 + [0] = c#(a(b(b(x1))))
       
               [2  2 ]     [0 ]           
       a(x1) = [-& 0 ]x1 + [-&] >= x1 = x1
       
                  [2 2]     [0]    [2 2]     [0]                 
       b(a(x1)) = [2 2]x1 + [0] >= [2 2]x1 + [0] = c(a(b(b(x1))))
       
               [0  -&]             
       b(x1) = [0  0 ]x1 >= x1 = x1
       
                  [2 4]     [2]    [2 2]     [0 ]           
       c(c(x1)) = [2 4]x1 + [2] >= [0 0]x1 + [-&] = a(b(x1))
      problem:
       DPs:
        c#(c(x1)) -> b#(x1)
        b#(a(x1)) -> b#(x1)
        b#(a(x1)) -> b#(b(x1))
       TRS:
        a(x1) -> x1
        b(a(x1)) -> c(a(b(b(x1))))
        b(x1) -> x1
        c(c(x1)) -> a(b(x1))
      Restore Modifier:
       DPs:
        c#(c(x1)) -> b#(x1)
        b#(a(x1)) -> b#(x1)
        b#(a(x1)) -> b#(b(x1))
       TRS:
        a(x1) -> x1
        b(a(x1)) -> c(a(b(b(x1))))
        b(x1) -> x1
        c(c(x1)) -> a(b(x1))
       EDG Processor:
        DPs:
         c#(c(x1)) -> b#(x1)
         b#(a(x1)) -> b#(x1)
         b#(a(x1)) -> b#(b(x1))
        TRS:
         a(x1) -> x1
         b(a(x1)) -> c(a(b(b(x1))))
         b(x1) -> x1
         c(c(x1)) -> a(b(x1))
        graph:
         c#(c(x1)) -> b#(x1) -> b#(a(x1)) -> b#(x1)
         c#(c(x1)) -> b#(x1) -> b#(a(x1)) -> b#(b(x1))
         b#(a(x1)) -> b#(b(x1)) -> b#(a(x1)) -> b#(x1)
         b#(a(x1)) -> b#(b(x1)) -> b#(a(x1)) -> b#(b(x1))
         b#(a(x1)) -> b#(x1) -> b#(a(x1)) -> b#(x1)
         b#(a(x1)) -> b#(x1) -> b#(a(x1)) -> b#(b(x1))
        SCC Processor:
         #sccs: 1
         #rules: 2
         #arcs: 6/9
         DPs:
          b#(a(x1)) -> b#(b(x1))
          b#(a(x1)) -> b#(x1)
         TRS:
          a(x1) -> x1
          b(a(x1)) -> c(a(b(b(x1))))
          b(x1) -> x1
          c(c(x1)) -> a(b(x1))
         Arctic Interpretation Processor:
          dimension: 2
          usable rules:
           a(x1) -> x1
           b(a(x1)) -> c(a(b(b(x1))))
           b(x1) -> x1
           c(c(x1)) -> a(b(x1))
          interpretation:
           [b#](x0) = [0 0]x0,
           
                     [2  0 ]     [1 ]
           [c](x0) = [2  -&]x0 + [-&],
           
                     [0 0]     [0 ]
           [b](x0) = [0 0]x0 + [-&],
           
                     [0 0]     [0]
           [a](x0) = [2 2]x0 + [2]
          orientation:
           b#(a(x1)) = [2 2]x1 + [2] >= [0 0]x1 + [0] = b#(b(x1))
           
           b#(a(x1)) = [2 2]x1 + [2] >= [0 0]x1 = b#(x1)
           
                   [0 0]     [0]           
           a(x1) = [2 2]x1 + [2] >= x1 = x1
           
                      [2 2]     [2]    [2 2]     [2]                 
           b(a(x1)) = [2 2]x1 + [2] >= [2 2]x1 + [2] = c(a(b(b(x1))))
           
                   [0 0]     [0 ]           
           b(x1) = [0 0]x1 + [-&] >= x1 = x1
           
                      [4 2]     [3]    [0 0]     [0]           
           c(c(x1)) = [4 2]x1 + [3] >= [2 2]x1 + [2] = a(b(x1))
          problem:
           DPs:
            
           TRS:
            a(x1) -> x1
            b(a(x1)) -> c(a(b(b(x1))))
            b(x1) -> x1
            c(c(x1)) -> a(b(x1))
          Qed