 
   July 1, 1994                                                        SIS(1)
 
   simplify [-d][-i <num>[:<num>]] [-m method] [-f filter] [node-list]
 
     Simplify each node in the node-list using _m_e_t_h_o_d with the don't-care set
     generated according to _d_c_t_y_p_e.
 
     _m_e_t_h_o_d specifies the algorithm used to minimize the nodes.  _s_n_o_c_o_m_p
     (default) invokes a single pass minimization procedure that does not
     compute the complete offset.  _n_o_c_o_m_p invokes the full minimization pro-
     cedure (ala ESPRESSO) but does not compute the complete offset.  _d_c_s_i_m_p
     invokes single pass tautology-based minimizer.
 
     _d_c_t_y_p_e specifies how the don't-care set is generated.  The default don't
     care set generated is a subset of the fanin don't care set.  -d option
     specifies that no don't care set is used.  -i m:n specifies that the
     fanin don't cares of nodes within m levels of transitive fanin and n
     levels of transitive fanout of these transitive fanin are to be gen-
     erated.
 
     _f_i_l_t_e_r specifies how the don't-care set is filtered.  _e_x_a_c_t (default)
     uses the exact filter.  _d_i_s_j__s_u_p uses the disjoint support filter.
 
     Note that a node function is replaced with the simplified version if the
     new function has fewer literals in factored form.  In the case of a tie,
     the node function is replaced if the new function has fewer literals in
     sum-of-products form.
 
                                                                            1
