inc-maxsatz is based on maxsatz. Besides the powerful lower bound computation methods in maxsatz, incmaxsatz incorporates a new technique with a nice property that guarantees the increment of lower bounds. At each branch point in the search-tree, the current node is enabled to inherit inconsistencies from its parent and learn information about effectiveness of the lower bound computing procedure from previous nodes. Furthermore, after branching on a new variable, the inconsistencies may shrink by applying unit propagation to them.