Matrix generation: 0
Determinant computation: 10
Matrix generation: 0
Determinant computation: 0
Graph generation: 20
Negative clauses identification: 20
Matrix generation: 0
Determinant computation: 0
Clause removal: 0
Incremental addition of new clauses: 60
Negative clauses identfication: 10
Detection of no-exit-edge nodes: 0
Detection of no-entry-edge nodes: 0
Adding edges corresponding to no-exit-edge nodes: 270
Total number of increments:108
Number of increments zero:69
Efficiency:0.3611111111111111
total running time:390