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


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


NO

Problem:
 incr(nil()) -> nil()
 incr(cons(X,L)) -> cons(s(X),n__incr(activate(L)))
 adx(nil()) -> nil()
 adx(cons(X,L)) -> incr(cons(X,n__adx(activate(L))))
 nats() -> adx(zeros())
 zeros() -> cons(0(),n__zeros())
 head(cons(X,L)) -> X
 tail(cons(X,L)) -> activate(L)
 incr(X) -> n__incr(X)
 adx(X) -> n__adx(X)
 zeros() -> n__zeros()
 activate(n__incr(X)) -> incr(activate(X))
 activate(n__adx(X)) -> adx(activate(X))
 activate(n__zeros()) -> zeros()
 activate(X) -> X

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [tail](x0) = 3x0 + 6,
   
   [head](x0) = 6x0 + 1,
   
   [n__zeros] = 0,
   
   [0] = 0,
   
   [zeros] = 0,
   
   [nats] = 0,
   
   [n__adx](x0) = 4x0,
   
   [adx](x0) = 4x0,
   
   [n__incr](x0) = x0,
   
   [activate](x0) = x0,
   
   [s](x0) = x0,
   
   [cons](x0, x1) = 2x0 + 2x1,
   
   [incr](x0) = x0,
   
   [nil] = 0
  orientation:
   incr(nil()) = 0 >= 0 = nil()
   
   incr(cons(X,L)) = 2L + 2X >= 2L + 2X = cons(s(X),n__incr(activate(L)))
   
   adx(nil()) = 0 >= 0 = nil()
   
   adx(cons(X,L)) = 8L + 8X >= 8L + 2X = incr(cons(X,n__adx(activate(L))))
   
   nats() = 0 >= 0 = adx(zeros())
   
   zeros() = 0 >= 0 = cons(0(),n__zeros())
   
   head(cons(X,L)) = 12L + 12X + 1 >= X = X
   
   tail(cons(X,L)) = 6L + 6X + 6 >= L = activate(L)
   
   incr(X) = X >= X = n__incr(X)
   
   adx(X) = 4X >= 4X = n__adx(X)
   
   zeros() = 0 >= 0 = n__zeros()
   
   activate(n__incr(X)) = X >= X = incr(activate(X))
   
   activate(n__adx(X)) = 4X >= 4X = adx(activate(X))
   
   activate(n__zeros()) = 0 >= 0 = zeros()
   
   activate(X) = X >= X = X
  problem:
   incr(nil()) -> nil()
   incr(cons(X,L)) -> cons(s(X),n__incr(activate(L)))
   adx(nil()) -> nil()
   adx(cons(X,L)) -> incr(cons(X,n__adx(activate(L))))
   nats() -> adx(zeros())
   zeros() -> cons(0(),n__zeros())
   incr(X) -> n__incr(X)
   adx(X) -> n__adx(X)
   zeros() -> n__zeros()
   activate(n__incr(X)) -> incr(activate(X))
   activate(n__adx(X)) -> adx(activate(X))
   activate(n__zeros()) -> zeros()
   activate(X) -> X
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [n__zeros] = 0,
    
    [0] = 0,
    
    [zeros] = 0,
    
    [nats] = 0,
    
    [n__adx](x0) = 4x0,
    
    [adx](x0) = 4x0,
    
    [n__incr](x0) = x0,
    
    [activate](x0) = x0,
    
    [s](x0) = x0,
    
    [cons](x0, x1) = x0 + 4x1,
    
    [incr](x0) = x0,
    
    [nil] = 3
   orientation:
    incr(nil()) = 3 >= 3 = nil()
    
    incr(cons(X,L)) = 4L + X >= 4L + X = cons(s(X),n__incr(activate(L)))
    
    adx(nil()) = 12 >= 3 = nil()
    
    adx(cons(X,L)) = 16L + 4X >= 16L + X = incr(cons(X,n__adx(activate(L))))
    
    nats() = 0 >= 0 = adx(zeros())
    
    zeros() = 0 >= 0 = cons(0(),n__zeros())
    
    incr(X) = X >= X = n__incr(X)
    
    adx(X) = 4X >= 4X = n__adx(X)
    
    zeros() = 0 >= 0 = n__zeros()
    
    activate(n__incr(X)) = X >= X = incr(activate(X))
    
    activate(n__adx(X)) = 4X >= 4X = adx(activate(X))
    
    activate(n__zeros()) = 0 >= 0 = zeros()
    
    activate(X) = X >= X = X
   problem:
    incr(nil()) -> nil()
    incr(cons(X,L)) -> cons(s(X),n__incr(activate(L)))
    adx(cons(X,L)) -> incr(cons(X,n__adx(activate(L))))
    nats() -> adx(zeros())
    zeros() -> cons(0(),n__zeros())
    incr(X) -> n__incr(X)
    adx(X) -> n__adx(X)
    zeros() -> n__zeros()
    activate(n__incr(X)) -> incr(activate(X))
    activate(n__adx(X)) -> adx(activate(X))
    activate(n__zeros()) -> zeros()
    activate(X) -> X
   Matrix Interpretation Processor: dim=1
    
    interpretation:
     [n__zeros] = 4,
     
     [0] = 0,
     
     [zeros] = 4,
     
     [nats] = 6,
     
     [n__adx](x0) = x0,
     
     [adx](x0) = x0,
     
     [n__incr](x0) = x0,
     
     [activate](x0) = x0,
     
     [s](x0) = x0,
     
     [cons](x0, x1) = x0 + x1,
     
     [incr](x0) = x0,
     
     [nil] = 4
    orientation:
     incr(nil()) = 4 >= 4 = nil()
     
     incr(cons(X,L)) = L + X >= L + X = cons(s(X),n__incr(activate(L)))
     
     adx(cons(X,L)) = L + X >= L + X = incr(cons(X,n__adx(activate(L))))
     
     nats() = 6 >= 4 = adx(zeros())
     
     zeros() = 4 >= 4 = cons(0(),n__zeros())
     
     incr(X) = X >= X = n__incr(X)
     
     adx(X) = X >= X = n__adx(X)
     
     zeros() = 4 >= 4 = n__zeros()
     
     activate(n__incr(X)) = X >= X = incr(activate(X))
     
     activate(n__adx(X)) = X >= X = adx(activate(X))
     
     activate(n__zeros()) = 4 >= 4 = zeros()
     
     activate(X) = X >= X = X
    problem:
     incr(nil()) -> nil()
     incr(cons(X,L)) -> cons(s(X),n__incr(activate(L)))
     adx(cons(X,L)) -> incr(cons(X,n__adx(activate(L))))
     zeros() -> cons(0(),n__zeros())
     incr(X) -> n__incr(X)
     adx(X) -> n__adx(X)
     zeros() -> n__zeros()
     activate(n__incr(X)) -> incr(activate(X))
     activate(n__adx(X)) -> adx(activate(X))
     activate(n__zeros()) -> zeros()
     activate(X) -> X
    Matrix Interpretation Processor: dim=3
     
     interpretation:
                   [0]
      [n__zeros] = [0]
                   [0],
      
            [0]
      [0] = [0]
            [0],
      
                [0]
      [zeros] = [0]
                [0],
      
                     [1 0 0]  
      [n__adx](x0) = [0 0 0]x0
                     [0 0 0]  ,
      
                  [1 0 0]  
      [adx](x0) = [0 0 0]x0
                  [0 0 0]  ,
      
                      [1 0 1]  
      [n__incr](x0) = [0 1 0]x0
                      [0 0 1]  ,
      
                         
      [activate](x0) = x0
                         ,
      
                [1 0 0]  
      [s](x0) = [0 0 0]x0
                [0 0 0]  ,
      
                       [1 1 0]     [1 1 0]  
      [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1
                       [0 0 0]     [0 0 1]  ,
      
                   [1 0 1]  
      [incr](x0) = [0 1 0]x0
                   [0 0 1]  ,
      
              [0]
      [nil] = [0]
              [1]
     orientation:
                    [1]    [0]        
      incr(nil()) = [0] >= [0] = nil()
                    [1]    [1]        
      
                        [1 1 1]    [1 1 0]     [1 1 1]    [1 0 0]                                   
      incr(cons(X,L)) = [0 0 0]L + [0 0 0]X >= [0 0 0]L + [0 0 0]X = cons(s(X),n__incr(activate(L)))
                        [0 0 1]    [0 0 0]     [0 0 1]    [0 0 0]                                   
      
                       [1 1 0]    [1 1 0]     [1 0 0]    [1 1 0]                                     
      adx(cons(X,L)) = [0 0 0]L + [0 0 0]X >= [0 0 0]L + [0 0 0]X = incr(cons(X,n__adx(activate(L))))
                       [0 0 0]    [0 0 0]     [0 0 0]    [0 0 0]                                     
      
                [0]    [0]                       
      zeros() = [0] >= [0] = cons(0(),n__zeros())
                [0]    [0]                       
      
                [1 0 1]     [1 0 1]              
      incr(X) = [0 1 0]X >= [0 1 0]X = n__incr(X)
                [0 0 1]     [0 0 1]              
      
               [1 0 0]     [1 0 0]             
      adx(X) = [0 0 0]X >= [0 0 0]X = n__adx(X)
               [0 0 0]     [0 0 0]             
      
                [0]    [0]             
      zeros() = [0] >= [0] = n__zeros()
                [0]    [0]             
      
                             [1 0 1]     [1 0 1]                     
      activate(n__incr(X)) = [0 1 0]X >= [0 1 0]X = incr(activate(X))
                             [0 0 1]     [0 0 1]                     
      
                            [1 0 0]     [1 0 0]                    
      activate(n__adx(X)) = [0 0 0]X >= [0 0 0]X = adx(activate(X))
                            [0 0 0]     [0 0 0]                    
      
                             [0]    [0]          
      activate(n__zeros()) = [0] >= [0] = zeros()
                             [0]    [0]          
      
                              
      activate(X) = X >= X = X
                              
     problem:
      incr(cons(X,L)) -> cons(s(X),n__incr(activate(L)))
      adx(cons(X,L)) -> incr(cons(X,n__adx(activate(L))))
      zeros() -> cons(0(),n__zeros())
      incr(X) -> n__incr(X)
      adx(X) -> n__adx(X)
      zeros() -> n__zeros()
      activate(n__incr(X)) -> incr(activate(X))
      activate(n__adx(X)) -> adx(activate(X))
      activate(n__zeros()) -> zeros()
      activate(X) -> X
     Unfolding Processor:
      loop length: 6
      terms:
       incr(cons(X,n__adx(n__zeros())))
       cons(s(X),n__incr(activate(n__adx(n__zeros()))))
       cons(s(X),n__incr(adx(activate(n__zeros()))))
       cons(s(X),n__incr(adx(zeros())))
       cons(s(X),n__incr(adx(cons(0(),n__zeros()))))
       cons(s(X),n__incr(incr(cons(0(),n__adx(activate(n__zeros()))))))
      context: cons(s(X),n__incr([]))
      substitution:
       X -> 0()
      Qed