/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(c(a(x1)))
 c(c(a(x1))) -> a(b(a(x1)))

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