[]: Open (size=22, cost=0, time=0, max=0, total=1.40667e-05, pending=1)
[0]: Open (size=22, cost=22, time=0.769189, max=0.769189, total=0.795305, pending=1)
[1]: Open (size=22, cost=22, time=0.0258191, max=0.0258191, total=0.879396, pending=2)
[00]: Open (size=22, cost=22, time=0.829427, max=0.769189, total=0.895134, pending=2)
******* COMPLETION *******
and(X0,n1) -> X0
or(X0,n1) -> n1
or(X0,n0) -> X0
and(X0,n0) -> n0
not(n1) -> n0
not(n0) -> n1
**************************
On branch: [00]
With size, cost: 22, 22
Orientations: 14
Calls to AProVE (all, T, NT, ?): 9, 9, 0, 0
Time (all, branch, AProVE): 1.09487, 1.02798, 1.09226
Time/call in AProVE (Avg, Min, Max): 0.121363, 0.768844, 0.0155151
Time/T-call in AProVE (Avg, Min, Max): 0.121363, 0.768844, 0.769189
All conjectures solved.