Matrix generation: 90
Determinant computation: 20
Matrix generation: 0
Determinant computation: 20
Graph generation: 70
Negative clauses identification: 40
Matrix generation: 0
Determinant computation: 0
Clause removal: 0
Incremental addition of new clauses: 110
Negative clauses identfication: 20
Detection of no-exit-edge nodes: 0
Detection of no-entry-edge nodes: 10
Adding edges corresponding to no-exit-edge nodes: 9959
Total number of increments:658
Number of increments zero:304
Efficiency:0.5379939209726444
total running time:10339