/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:
 P(x1) -> Q(Q(p(x1)))
 p(p(x1)) -> q(q(x1))
 p(Q(Q(x1))) -> Q(Q(p(x1)))
 Q(p(q(x1))) -> q(p(Q(x1)))
 q(q(p(x1))) -> p(q(q(x1)))
 q(Q(x1)) -> x1
 Q(q(x1)) -> x1
 p(P(x1)) -> x1
 P(p(x1)) -> x1

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [q](x0) = x0 + 7,
   
   [Q](x0) = x0 + 2,
   
   [p](x0) = x0 + 7,
   
   [P](x0) = x0 + 11
  orientation:
   P(x1) = x1 + 11 >= x1 + 11 = Q(Q(p(x1)))
   
   p(p(x1)) = x1 + 14 >= x1 + 14 = q(q(x1))
   
   p(Q(Q(x1))) = x1 + 11 >= x1 + 11 = Q(Q(p(x1)))
   
   Q(p(q(x1))) = x1 + 16 >= x1 + 16 = q(p(Q(x1)))
   
   q(q(p(x1))) = x1 + 21 >= x1 + 21 = p(q(q(x1)))
   
   q(Q(x1)) = x1 + 9 >= x1 = x1
   
   Q(q(x1)) = x1 + 9 >= x1 = x1
   
   p(P(x1)) = x1 + 18 >= x1 = x1
   
   P(p(x1)) = x1 + 18 >= x1 = x1
  problem:
   P(x1) -> Q(Q(p(x1)))
   p(p(x1)) -> q(q(x1))
   p(Q(Q(x1))) -> Q(Q(p(x1)))
   Q(p(q(x1))) -> q(p(Q(x1)))
   q(q(p(x1))) -> p(q(q(x1)))
  String Reversal Processor:
   P(x1) -> p(Q(Q(x1)))
   p(p(x1)) -> q(q(x1))
   Q(Q(p(x1))) -> p(Q(Q(x1)))
   q(p(Q(x1))) -> Q(p(q(x1)))
   p(q(q(x1))) -> q(q(p(x1)))
   Matrix Interpretation Processor: dim=1
    
    interpretation:
     [q](x0) = 2x0,
     
     [Q](x0) = 2x0,
     
     [p](x0) = 2x0,
     
     [P](x0) = 11x0 + 8
    orientation:
     P(x1) = 11x1 + 8 >= 8x1 = p(Q(Q(x1)))
     
     p(p(x1)) = 4x1 >= 4x1 = q(q(x1))
     
     Q(Q(p(x1))) = 8x1 >= 8x1 = p(Q(Q(x1)))
     
     q(p(Q(x1))) = 8x1 >= 8x1 = Q(p(q(x1)))
     
     p(q(q(x1))) = 8x1 >= 8x1 = q(q(p(x1)))
    problem:
     p(p(x1)) -> q(q(x1))
     Q(Q(p(x1))) -> p(Q(Q(x1)))
     q(p(Q(x1))) -> Q(p(q(x1)))
     p(q(q(x1))) -> q(q(p(x1)))
    Matrix Interpretation Processor: dim=1
     
     interpretation:
      [q](x0) = 2x0 + 2,
      
      [Q](x0) = 2x0 + 2,
      
      [p](x0) = 4x0 + 6
     orientation:
      p(p(x1)) = 16x1 + 30 >= 4x1 + 6 = q(q(x1))
      
      Q(Q(p(x1))) = 16x1 + 30 >= 16x1 + 30 = p(Q(Q(x1)))
      
      q(p(Q(x1))) = 16x1 + 30 >= 16x1 + 30 = Q(p(q(x1)))
      
      p(q(q(x1))) = 16x1 + 30 >= 16x1 + 30 = q(q(p(x1)))
     problem:
      Q(Q(p(x1))) -> p(Q(Q(x1)))
      q(p(Q(x1))) -> Q(p(q(x1)))
      p(q(q(x1))) -> q(q(p(x1)))
     Bounds Processor:
      bound: 0
      enrichment: match
      automaton:
       final states: {8,5,1}
       transitions:
        f40() -> 2*
        p0(2) -> 9*
        p0(4) -> 1*
        p0(6) -> 7*
        Q0(7) -> 5*
        Q0(2) -> 3*
        Q0(3) -> 4*
        q0(10) -> 8*
        q0(2) -> 6*
        q0(9) -> 10*
        1 -> 3,4
        5 -> 6,10
        8 -> 9,7
      problem:
       
      Qed