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

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