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

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