Problem:
 f (\x. z x) y -> z (z y)
 g x -> h x

Proof:
 Modularity Decomposition: 
 0:f (\x. z x) y -> z (z y)
 1:g x -> h x
 -----
 0:f (\x. z x) y -> z (z y)
   Higher-Order Church Rosser Processor:
    f (\x. z x) y -> z (z y)
    critical peaks: 0
     
     
     Higher-Order Closedness Processor:
       all critical pairs are trivial
      
      Qed
   
   
   1:g x -> h x
     Higher-Order Church Rosser Processor:
      g x -> h x
      critical peaks: 0
       
       
       Higher-Order Closedness Processor:
         all critical pairs are trivial
        
        Qed