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

Proof:
 Arctic Interpretation Processor:
  dimension: 2
  interpretation:
             [0  -&]  
   [c](x0) = [1  0 ]x0,
   
             [0  0 ]  
   [d](x0) = [-& 2 ]x0,
   
             [0  0 ]  
   [a](x0) = [-& -&]x0,
   
             [0  -&]  
   [b](x0) = [0  0 ]x0
  orientation:
              [0  0 ]      [0  0 ]          
   a(b(x1)) = [-& -&]x1 >= [-& -&]x1 = a(x1)
   
              [0 0]      [0  -&]          
   d(b(x1)) = [2 2]x1 >= [0  0 ]x1 = b(x1)
   
              [1 0]      [0  -&]          
   d(c(x1)) = [3 2]x1 >= [1  0 ]x1 = c(x1)
   
           [0  0 ]      [0  0 ]             
   a(x1) = [-& -&]x1 >= [-& -&]x1 = d(a(x1))
   
           [0  -&]      [0  -&]             
   c(x1) = [1  0 ]x1 >= [1  0 ]x1 = c(b(x1))
  problem:
   strict:
    a(b(x1)) -> a(x1)
    d(b(x1)) -> b(x1)
   weak:
    a(x1) -> d(a(x1))
    c(x1) -> c(b(x1))
  String Reversal Processor:
   strict:
    b(a(x1)) -> a(x1)
    b(d(x1)) -> b(x1)
   weak:
    a(x1) -> a(d(x1))
    c(x1) -> b(c(x1))
   Arctic Interpretation Processor:
    dimension: 2
    interpretation:
               [0 1]  
     [c](x0) = [0 1]x0,
     
               [0  -&]  
     [d](x0) = [1  6 ]x0,
     
               [1  -&]  
     [a](x0) = [0  -&]x0,
     
               [0  0 ]  
     [b](x0) = [-& 0 ]x0
    orientation:
                [1  -&]      [1  -&]          
     b(a(x1)) = [0  -&]x1 >= [0  -&]x1 = a(x1)
     
                [1 6]      [0  0 ]          
     b(d(x1)) = [1 6]x1 >= [-& 0 ]x1 = b(x1)
     
             [1  -&]      [1  -&]             
     a(x1) = [0  -&]x1 >= [0  -&]x1 = a(d(x1))
     
             [0 1]      [0 1]             
     c(x1) = [0 1]x1 >= [0 1]x1 = b(c(x1))
    problem:
     strict:
      b(a(x1)) -> a(x1)
     weak:
      a(x1) -> a(d(x1))
      c(x1) -> b(c(x1))
    String Reversal Processor:
     strict:
      a(b(x1)) -> a(x1)
     weak:
      a(x1) -> d(a(x1))
      c(x1) -> c(b(x1))
     Arctic Interpretation Processor:
      dimension: 2
      interpretation:
                 [6  -&]  
       [c](x0) = [-& -&]x0,
       
                 [0  0 ]  
       [d](x0) = [-& -&]x0,
       
                 [0 6]  
       [a](x0) = [0 0]x0,
       
                 [0  -&]  
       [b](x0) = [6  2 ]x0
      orientation:
                  [12 8 ]      [0 6]          
       a(b(x1)) = [6  2 ]x1 >= [0 0]x1 = a(x1)
       
               [0 6]      [0  6 ]             
       a(x1) = [0 0]x1 >= [-& -&]x1 = d(a(x1))
       
               [6  -&]      [6  -&]             
       c(x1) = [-& -&]x1 >= [-& -&]x1 = c(b(x1))
      problem:
       strict:
        
       weak:
        a(x1) -> d(a(x1))
        c(x1) -> c(b(x1))
      Qed