Matrix generation: 10
Determinant computation: 0
Matrix generation: 0
Determinant computation: 0
Graph generation: 10
Negative clauses identification: 10
Matrix generation: 0
Determinant computation: 0
Clause removal: 10
Incremental addition of new clauses: 20
Negative clauses identfication: 71
Detection of no-exit-edge nodes: 0
Detection of no-entry-edge nodes: 0
Adding edges corresponding to no-exit-edge nodes: 140
Total number of increments:55
Number of increments zero:33
Efficiency:0.4
total running time:271