Problem:
 apply (\x. F x) X -> F X
 a -> b

Proof:
 Modularity Decomposition: 
 0:apply (\x. F x) X -> F X
 1:a -> b
 -----
 0:apply (\x. F x) X -> F X
   Higher-Order Church Rosser Processor:
    apply (\x. F x) X -> F X
    critical peaks: 0
     
     
     Higher-Order Closedness Processor:
       all critical pairs are trivial
      
      Qed
   
   
   1:a -> b
     Higher-Order Church Rosser Processor:
      a -> b
      critical peaks: 0
       
       
       Higher-Order Closedness Processor:
         all critical pairs are trivial
        
        Qed