TSTP Solution File: SET936+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET936+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:21:21 EDT 2023
% Result : Theorem 1.81s 0.66s
% Output : CNFRefutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 54 ( 23 unt; 0 def)
% Number of atoms : 133 ( 29 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 139 ( 60 ~; 62 |; 11 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 114 ( 13 sgn; 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t1_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.OHRFJoN1Kx/E---3.1_20060.p',t1_xboole_1) ).
fof(t17_xboole_1,axiom,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/tmp.OHRFJoN1Kx/E---3.1_20060.p',t17_xboole_1) ).
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OHRFJoN1Kx/E---3.1_20060.p',d1_zfmisc_1) ).
fof(t83_zfmisc_1,conjecture,
! [X1,X2] : powerset(set_intersection2(X1,X2)) = set_intersection2(powerset(X1),powerset(X2)),
file('/export/starexec/sandbox2/tmp/tmp.OHRFJoN1Kx/E---3.1_20060.p',t83_zfmisc_1) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OHRFJoN1Kx/E---3.1_20060.p',d3_xboole_0) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.OHRFJoN1Kx/E---3.1_20060.p',commutativity_k3_xboole_0) ).
fof(idempotence_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.OHRFJoN1Kx/E---3.1_20060.p',idempotence_k3_xboole_0) ).
fof(t19_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3) )
=> subset(X1,set_intersection2(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.OHRFJoN1Kx/E---3.1_20060.p',t19_xboole_1) ).
fof(c_0_8,plain,
! [X34,X35,X36] :
( ~ subset(X34,X35)
| ~ subset(X35,X36)
| subset(X34,X36) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).
fof(c_0_9,plain,
! [X29,X30] : subset(set_intersection2(X29,X30),X29),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
fof(c_0_10,plain,
! [X9,X10,X11,X12,X13,X14] :
( ( ~ in(X11,X10)
| subset(X11,X9)
| X10 != powerset(X9) )
& ( ~ subset(X12,X9)
| in(X12,X10)
| X10 != powerset(X9) )
& ( ~ in(esk1_2(X13,X14),X14)
| ~ subset(esk1_2(X13,X14),X13)
| X14 = powerset(X13) )
& ( in(esk1_2(X13,X14),X14)
| subset(esk1_2(X13,X14),X13)
| X14 = powerset(X13) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_zfmisc_1])])])])])]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1,X2] : powerset(set_intersection2(X1,X2)) = set_intersection2(powerset(X1),powerset(X2)),
inference(assume_negation,[status(cth)],[t83_zfmisc_1]) ).
cnf(c_0_12,plain,
( subset(X1,X3)
| ~ subset(X1,X2)
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
subset(set_intersection2(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( subset(X1,X3)
| ~ in(X1,X2)
| X2 != powerset(X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,negated_conjecture,
powerset(set_intersection2(esk6_0,esk7_0)) != set_intersection2(powerset(esk6_0),powerset(esk7_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_16,plain,
! [X16,X17,X18,X19,X20,X21,X22,X23] :
( ( in(X19,X16)
| ~ in(X19,X18)
| X18 != set_intersection2(X16,X17) )
& ( in(X19,X17)
| ~ in(X19,X18)
| X18 != set_intersection2(X16,X17) )
& ( ~ in(X20,X16)
| ~ in(X20,X17)
| in(X20,X18)
| X18 != set_intersection2(X16,X17) )
& ( ~ in(esk2_3(X21,X22,X23),X23)
| ~ in(esk2_3(X21,X22,X23),X21)
| ~ in(esk2_3(X21,X22,X23),X22)
| X23 = set_intersection2(X21,X22) )
& ( in(esk2_3(X21,X22,X23),X21)
| in(esk2_3(X21,X22,X23),X23)
| X23 = set_intersection2(X21,X22) )
& ( in(esk2_3(X21,X22,X23),X22)
| in(esk2_3(X21,X22,X23),X23)
| X23 = set_intersection2(X21,X22) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_xboole_0])])])])])]) ).
cnf(c_0_17,plain,
( in(X1,X3)
| ~ subset(X1,X2)
| X3 != powerset(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| ~ subset(X1,set_intersection2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( subset(X1,X2)
| ~ in(X1,powerset(X2)) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
powerset(set_intersection2(esk6_0,esk7_0)) != set_intersection2(powerset(esk6_0),powerset(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( X2 = powerset(X1)
| ~ in(esk1_2(X1,X2),X2)
| ~ subset(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X1,X3)
| X4 != set_intersection2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( subset(X1,X2)
| ~ in(X1,powerset(set_intersection2(X2,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_25,plain,
! [X7,X8] : set_intersection2(X7,X8) = set_intersection2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_26,negated_conjecture,
( ~ subset(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),set_intersection2(esk6_0,esk7_0))
| ~ in(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),set_intersection2(powerset(esk6_0),powerset(esk7_0))) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_27,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( in(X1,powerset(X2))
| ~ in(X1,powerset(set_intersection2(X2,X3))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( in(esk1_2(X1,X2),X2)
| subset(esk1_2(X1,X2),X1)
| X2 = powerset(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,negated_conjecture,
( ~ subset(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),set_intersection2(esk6_0,esk7_0))
| ~ in(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),powerset(esk7_0))
| ~ in(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),powerset(esk6_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( in(X1,powerset(X2))
| ~ in(X1,powerset(set_intersection2(X3,X2))) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_34,negated_conjecture,
( subset(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),set_intersection2(esk6_0,esk7_0))
| in(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),set_intersection2(powerset(esk6_0),powerset(esk7_0))) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_30])]) ).
cnf(c_0_35,negated_conjecture,
~ in(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),powerset(set_intersection2(esk6_0,esk7_0))),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_19]),c_0_28]),c_0_32]) ).
cnf(c_0_36,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_37,plain,
( subset(X1,X2)
| ~ subset(X1,X3)
| ~ in(X3,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_38,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_39,negated_conjecture,
in(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),set_intersection2(powerset(esk6_0),powerset(esk7_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_34]),c_0_35]) ).
cnf(c_0_40,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_41,plain,
( subset(set_intersection2(X1,X2),X3)
| ~ in(X1,powerset(X3)) ),
inference(spm,[status(thm)],[c_0_37,c_0_13]) ).
cnf(c_0_42,negated_conjecture,
in(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),powerset(esk7_0)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
fof(c_0_43,plain,
! [X25] : set_intersection2(X25,X25) = X25,
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[idempotence_k3_xboole_0])]) ).
cnf(c_0_44,negated_conjecture,
in(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),powerset(esk6_0)),
inference(spm,[status(thm)],[c_0_40,c_0_39]) ).
fof(c_0_45,plain,
! [X31,X32,X33] :
( ~ subset(X31,X32)
| ~ subset(X31,X33)
| subset(X31,set_intersection2(X32,X33)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_xboole_1])]) ).
cnf(c_0_46,negated_conjecture,
subset(set_intersection2(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),X1),esk7_0),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
set_intersection2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_48,negated_conjecture,
subset(set_intersection2(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),X1),esk6_0),
inference(spm,[status(thm)],[c_0_41,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
~ subset(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),set_intersection2(esk6_0,esk7_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_39])]) ).
cnf(c_0_50,plain,
( subset(X1,set_intersection2(X2,X3))
| ~ subset(X1,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_51,negated_conjecture,
subset(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),esk7_0),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
subset(esk1_2(set_intersection2(esk6_0,esk7_0),set_intersection2(powerset(esk6_0),powerset(esk7_0))),esk6_0),
inference(spm,[status(thm)],[c_0_48,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SET936+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n017.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 16:10:56 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.OHRFJoN1Kx/E---3.1_20060.p
% 1.81/0.66 # Version: 3.1pre001
% 1.81/0.66 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.81/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.81/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.81/0.66 # Starting new_bool_3 with 300s (1) cores
% 1.81/0.66 # Starting new_bool_1 with 300s (1) cores
% 1.81/0.66 # Starting sh5l with 300s (1) cores
% 1.81/0.66 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20138 completed with status 0
% 1.81/0.66 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.81/0.66 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.81/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.81/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.81/0.66 # No SInE strategy applied
% 1.81/0.66 # Search class: FGHSM-FFMF32-SFFFFFNN
% 1.81/0.66 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.81/0.66 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 813s (1) cores
% 1.81/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.81/0.66 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.81/0.66 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 1.81/0.66 # Starting H----_011_C18_F1_PI_SE_SP_S2S with 136s (1) cores
% 1.81/0.66 # G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with pid 20148 completed with status 0
% 1.81/0.66 # Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A
% 1.81/0.66 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.81/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.81/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.81/0.66 # No SInE strategy applied
% 1.81/0.66 # Search class: FGHSM-FFMF32-SFFFFFNN
% 1.81/0.66 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.81/0.66 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 813s (1) cores
% 1.81/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.81/0.66 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.81/0.66 # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 1.81/0.66 # Preprocessing time : 0.001 s
% 1.81/0.66 # Presaturation interreduction done
% 1.81/0.66
% 1.81/0.66 # Proof found!
% 1.81/0.66 # SZS status Theorem
% 1.81/0.66 # SZS output start CNFRefutation
% See solution above
% 1.81/0.66 # Parsed axioms : 13
% 1.81/0.66 # Removed by relevancy pruning/SinE : 0
% 1.81/0.66 # Initial clauses : 22
% 1.81/0.66 # Removed in clause preprocessing : 0
% 1.81/0.66 # Initial clauses in saturation : 22
% 1.81/0.66 # Processed clauses : 841
% 1.81/0.66 # ...of these trivial : 48
% 1.81/0.66 # ...subsumed : 460
% 1.81/0.66 # ...remaining for further processing : 332
% 1.81/0.66 # Other redundant clauses eliminated : 91
% 1.81/0.66 # Clauses deleted for lack of memory : 0
% 1.81/0.66 # Backward-subsumed : 7
% 1.81/0.66 # Backward-rewritten : 4
% 1.81/0.66 # Generated clauses : 15861
% 1.81/0.66 # ...of the previous two non-redundant : 15393
% 1.81/0.66 # ...aggressively subsumed : 0
% 1.81/0.66 # Contextual simplify-reflections : 6
% 1.81/0.66 # Paramodulations : 15756
% 1.81/0.66 # Factorizations : 14
% 1.81/0.66 # NegExts : 0
% 1.81/0.66 # Equation resolutions : 91
% 1.81/0.66 # Total rewrite steps : 1338
% 1.81/0.66 # Propositional unsat checks : 0
% 1.81/0.66 # Propositional check models : 0
% 1.81/0.66 # Propositional check unsatisfiable : 0
% 1.81/0.66 # Propositional clauses : 0
% 1.81/0.66 # Propositional clauses after purity: 0
% 1.81/0.66 # Propositional unsat core size : 0
% 1.81/0.66 # Propositional preprocessing time : 0.000
% 1.81/0.66 # Propositional encoding time : 0.000
% 1.81/0.66 # Propositional solver time : 0.000
% 1.81/0.66 # Success case prop preproc time : 0.000
% 1.81/0.66 # Success case prop encoding time : 0.000
% 1.81/0.66 # Success case prop solver time : 0.000
% 1.81/0.66 # Current number of processed clauses : 294
% 1.81/0.66 # Positive orientable unit clauses : 33
% 1.81/0.66 # Positive unorientable unit clauses: 1
% 1.81/0.66 # Negative unit clauses : 26
% 1.81/0.66 # Non-unit-clauses : 234
% 1.81/0.66 # Current number of unprocessed clauses: 14520
% 1.81/0.66 # ...number of literals in the above : 58759
% 1.81/0.66 # Current number of archived formulas : 0
% 1.81/0.66 # Current number of archived clauses : 33
% 1.81/0.66 # Clause-clause subsumption calls (NU) : 8944
% 1.81/0.66 # Rec. Clause-clause subsumption calls : 6724
% 1.81/0.66 # Non-unit clause-clause subsumptions : 312
% 1.81/0.66 # Unit Clause-clause subsumption calls : 223
% 1.81/0.66 # Rewrite failures with RHS unbound : 0
% 1.81/0.66 # BW rewrite match attempts : 51
% 1.81/0.66 # BW rewrite match successes : 14
% 1.81/0.66 # Condensation attempts : 0
% 1.81/0.66 # Condensation successes : 0
% 1.81/0.66 # Termbank termtop insertions : 271693
% 1.81/0.66
% 1.81/0.66 # -------------------------------------------------
% 1.81/0.66 # User time : 0.225 s
% 1.81/0.66 # System time : 0.007 s
% 1.81/0.66 # Total time : 0.232 s
% 1.81/0.66 # Maximum resident set size: 1748 pages
% 1.81/0.66
% 1.81/0.66 # -------------------------------------------------
% 1.81/0.66 # User time : 1.110 s
% 1.81/0.66 # System time : 0.031 s
% 1.81/0.66 # Total time : 1.141 s
% 1.81/0.66 # Maximum resident set size: 1684 pages
% 1.81/0.66 % E---3.1 exiting
% 1.81/0.67 % E---3.1 exiting
%------------------------------------------------------------------------------