From: plfriko@yahoo.de   
      
   Hi,   
      
   > if (x > 10)   
   >     assert( x > 10 && ((firstScope && x == 1) || (x >= 1 && !   
   > firstScope)) );   
   >     // |   
   >     // V   
   >     assert( x > 10 && !firstScope);   
   >     x = 10;   
   > }   
      
   A question on this simplification after "->". What type of rules to   
   do apply to infer that "   
   ((firstScope && x == 1) || (x >= 1 && !> firstScope)) )"   
   becomes   
   "!firstScope" ?   
      
   > But if they're unclear, I can try to give an informal explanation.   
      
   That would be fine.   
      
   In general, how do you call this type of equations and their   
   solving? Are there any known approaches for that?   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)