Matrix generation: 80
Determinant computation: 20
Matrix generation: 0
Determinant computation: 20
Graph generation: 30
Negative clauses identification: 50
Matrix generation: 0
Determinant computation: 0
Clause removal: 81
Incremental addition of new clauses: 30
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: 12876
Total number of increments:862
Number of increments zero:424
Efficiency:0.5081206496519721
total running time:13217