Matrix generation: 11
Determinant computation: 0
Matrix generation: 0
Determinant computation: 0
Graph generation: 20
Negative clauses identification: 100
Matrix generation: 0
Determinant computation: 10
Clause removal: 0
Incremental addition of new clauses: 30
Negative clauses identfication: 20
Detection of no-exit-edge nodes: 0
Detection of no-entry-edge nodes: 0
Adding edges corresponding to no-exit-edge nodes: 12829
Total number of increments:2639
Number of increments zero:2440
Efficiency:0.07540735126942023
total running time:13020