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


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


YES

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

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