Matrix generation: 81 Determinant computation: 20 Matrix generation: 0 Determinant computation: 110 Graph generation: 20 Negative clauses identification: 40 Matrix generation: 0 Determinant computation: 0 Clause removal: 10 Incremental addition of new clauses: 170 Negative clauses identfication: 211 Detection of no-exit-edge nodes: 0 Detection of no-entry-edge nodes: 10 Adding edges corresponding to no-exit-edge nodes: 4047 Total number of increments:316 Number of increments zero:220 Efficiency:0.3037974683544304 total running time:4719