TSTP Solution File: SEU232+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU232+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:25:23 EDT 2023
% Result : Theorem 15.30s 2.52s
% Output : CNFRefutation 15.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 62 ( 8 unt; 0 def)
% Number of atoms : 183 ( 10 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 189 ( 68 ~; 83 |; 24 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 90 ( 0 sgn; 43 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t23_ordinal1,conjecture,
! [X1,X2] :
( ordinal(X2)
=> ( in(X1,X2)
=> ordinal(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.toKzwhlbEg/E---3.1_6618.p',t23_ordinal1) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.toKzwhlbEg/E---3.1_6618.p',d2_ordinal1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.toKzwhlbEg/E---3.1_6618.p',d3_tarski) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_transitive(X1)
& epsilon_connected(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.toKzwhlbEg/E---3.1_6618.p',cc1_ordinal1) ).
fof(d3_ordinal1,axiom,
! [X1] :
( epsilon_connected(X1)
<=> ! [X2,X3] :
~ ( in(X2,X1)
& in(X3,X1)
& ~ in(X2,X3)
& X2 != X3
& ~ in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.toKzwhlbEg/E---3.1_6618.p',d3_ordinal1) ).
fof(t3_ordinal1,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& in(X2,X3)
& in(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.toKzwhlbEg/E---3.1_6618.p',t3_ordinal1) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.toKzwhlbEg/E---3.1_6618.p',antisymmetry_r2_hidden) ).
fof(cc2_ordinal1,axiom,
! [X1] :
( ( epsilon_transitive(X1)
& epsilon_connected(X1) )
=> ordinal(X1) ),
file('/export/starexec/sandbox/tmp/tmp.toKzwhlbEg/E---3.1_6618.p',cc2_ordinal1) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] :
( ordinal(X2)
=> ( in(X1,X2)
=> ordinal(X1) ) ),
inference(assume_negation,[status(cth)],[t23_ordinal1]) ).
fof(c_0_9,plain,
! [X28,X29,X30] :
( ( ~ epsilon_transitive(X28)
| ~ in(X29,X28)
| subset(X29,X28) )
& ( in(esk7_1(X30),X30)
| epsilon_transitive(X30) )
& ( ~ subset(esk7_1(X30),X30)
| epsilon_transitive(X30) ) ),
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)],[d2_ordinal1])])])])])]) ).
fof(c_0_10,negated_conjecture,
( ordinal(esk2_0)
& in(esk1_0,esk2_0)
& ~ ordinal(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,plain,
! [X39,X40,X41,X42,X43] :
( ( ~ subset(X39,X40)
| ~ in(X41,X39)
| in(X41,X40) )
& ( in(esk12_2(X42,X43),X42)
| subset(X42,X43) )
& ( ~ in(esk12_2(X42,X43),X43)
| subset(X42,X43) ) ),
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_tarski])])])])])]) ).
cnf(c_0_12,plain,
( subset(X2,X1)
| ~ epsilon_transitive(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X7] :
( ( epsilon_transitive(X7)
| ~ ordinal(X7) )
& ( epsilon_connected(X7)
| ~ ordinal(X7) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])]) ).
cnf(c_0_15,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( in(esk7_1(X1),X1)
| epsilon_transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( subset(esk1_0,esk2_0)
| ~ epsilon_transitive(esk2_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
ordinal(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( epsilon_transitive(X1)
| in(esk7_1(X1),X2)
| ~ subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
subset(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
fof(c_0_22,plain,
! [X1] :
( epsilon_connected(X1)
<=> ! [X2,X3] :
~ ( in(X2,X1)
& in(X3,X1)
& ~ in(X2,X3)
& X2 != X3
& ~ in(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[d3_ordinal1]) ).
cnf(c_0_23,negated_conjecture,
( epsilon_transitive(esk1_0)
| in(esk7_1(esk1_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_24,plain,
! [X13,X14,X15] :
( ~ in(X13,X14)
| ~ in(X14,X15)
| ~ in(X15,X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_ordinal1])]) ).
fof(c_0_25,plain,
! [X22,X23,X24,X25] :
( ( ~ epsilon_connected(X22)
| ~ in(X23,X22)
| ~ in(X24,X22)
| in(X23,X24)
| X23 = X24
| in(X24,X23) )
& ( in(esk5_1(X25),X25)
| epsilon_connected(X25) )
& ( in(esk6_1(X25),X25)
| epsilon_connected(X25) )
& ( ~ in(esk5_1(X25),esk6_1(X25))
| epsilon_connected(X25) )
& ( esk5_1(X25) != esk6_1(X25)
| epsilon_connected(X25) )
& ( ~ in(esk6_1(X25),esk5_1(X25))
| epsilon_connected(X25) ) ),
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)],[c_0_22])])])])])]) ).
cnf(c_0_26,plain,
( epsilon_connected(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,plain,
( in(esk12_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,negated_conjecture,
( subset(esk7_1(esk1_0),esk2_0)
| epsilon_transitive(esk1_0)
| ~ epsilon_transitive(esk2_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_23]) ).
cnf(c_0_29,plain,
( ~ in(X1,X2)
| ~ in(X2,X3)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_30,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
cnf(c_0_31,plain,
( in(X2,X3)
| X2 = X3
| in(X3,X2)
| ~ epsilon_connected(X1)
| ~ in(X2,X1)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
epsilon_connected(esk2_0),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_33,plain,
( subset(X1,X2)
| in(esk12_2(X1,X2),X3)
| ~ subset(X1,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( subset(esk7_1(esk1_0),esk2_0)
| epsilon_transitive(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_18]),c_0_19])]) ).
cnf(c_0_35,plain,
( subset(X1,X2)
| ~ in(X3,esk12_2(X1,X2))
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
cnf(c_0_36,plain,
( in(esk6_1(X1),X1)
| epsilon_connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_37,plain,
! [X11,X12] :
( ~ in(X11,X12)
| ~ in(X12,X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])]) ).
cnf(c_0_38,negated_conjecture,
( X1 = esk1_0
| in(X1,esk1_0)
| in(esk1_0,X1)
| ~ in(X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_13]),c_0_32])]) ).
cnf(c_0_39,negated_conjecture,
( subset(esk7_1(esk1_0),X1)
| epsilon_transitive(esk1_0)
| in(esk12_2(esk7_1(esk1_0),X1),esk2_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
( subset(esk7_1(X1),X2)
| epsilon_transitive(X1)
| ~ in(X1,esk12_2(esk7_1(X1),X2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_16]) ).
cnf(c_0_41,plain,
( epsilon_connected(X1)
| in(esk6_1(X1),X2)
| ~ subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_36]) ).
cnf(c_0_42,plain,
( in(esk5_1(X1),X1)
| epsilon_connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_43,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,plain,
( subset(X1,X2)
| ~ in(esk12_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_45,negated_conjecture,
( esk12_2(esk7_1(esk1_0),X1) = esk1_0
| subset(esk7_1(esk1_0),X1)
| epsilon_transitive(esk1_0)
| in(esk12_2(esk7_1(esk1_0),X1),esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_46,plain,
( epsilon_transitive(X1)
| ~ subset(esk7_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_47,negated_conjecture,
( epsilon_connected(esk1_0)
| in(esk6_1(esk1_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_21]) ).
cnf(c_0_48,plain,
( epsilon_connected(X1)
| in(esk5_1(X1),X2)
| ~ subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_42]) ).
fof(c_0_49,plain,
! [X8] :
( ~ epsilon_transitive(X8)
| ~ epsilon_connected(X8)
| ordinal(X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_ordinal1])]) ).
cnf(c_0_50,plain,
( subset(X1,X2)
| ~ in(X1,esk12_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_27]) ).
cnf(c_0_51,negated_conjecture,
( esk12_2(esk7_1(esk1_0),esk1_0) = esk1_0
| epsilon_transitive(esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( X1 = esk6_1(esk1_0)
| epsilon_connected(esk1_0)
| in(X1,esk6_1(esk1_0))
| in(esk6_1(esk1_0),X1)
| ~ in(X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_47]),c_0_32])]) ).
cnf(c_0_53,negated_conjecture,
( epsilon_connected(esk1_0)
| in(esk5_1(esk1_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_21]) ).
cnf(c_0_54,plain,
( epsilon_connected(X1)
| ~ in(esk6_1(X1),esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_55,plain,
( epsilon_connected(X1)
| ~ in(esk5_1(X1),esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_56,plain,
( epsilon_connected(X1)
| esk5_1(X1) != esk6_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_57,plain,
( ordinal(X1)
| ~ epsilon_transitive(X1)
| ~ epsilon_connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_58,negated_conjecture,
epsilon_transitive(esk1_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_16]),c_0_46]) ).
cnf(c_0_59,negated_conjecture,
epsilon_connected(esk1_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_55]),c_0_56]) ).
cnf(c_0_60,negated_conjecture,
~ ordinal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]),c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU232+1 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n004.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 08:52:15 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.toKzwhlbEg/E---3.1_6618.p
% 15.30/2.52 # Version: 3.1pre001
% 15.30/2.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 15.30/2.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.30/2.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.30/2.52 # Starting new_bool_3 with 300s (1) cores
% 15.30/2.52 # Starting new_bool_1 with 300s (1) cores
% 15.30/2.52 # Starting sh5l with 300s (1) cores
% 15.30/2.52 # new_bool_3 with pid 6705 completed with status 0
% 15.30/2.52 # Result found by new_bool_3
% 15.30/2.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 15.30/2.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.30/2.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.30/2.52 # Starting new_bool_3 with 300s (1) cores
% 15.30/2.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 15.30/2.52 # Search class: FGHSF-FFMM21-SFFFFFNN
% 15.30/2.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 15.30/2.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 15.30/2.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 6708 completed with status 0
% 15.30/2.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 15.30/2.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 15.30/2.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.30/2.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.30/2.52 # Starting new_bool_3 with 300s (1) cores
% 15.30/2.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 15.30/2.52 # Search class: FGHSF-FFMM21-SFFFFFNN
% 15.30/2.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 15.30/2.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 15.30/2.52 # Preprocessing time : 0.001 s
% 15.30/2.52 # Presaturation interreduction done
% 15.30/2.52
% 15.30/2.52 # Proof found!
% 15.30/2.52 # SZS status Theorem
% 15.30/2.52 # SZS output start CNFRefutation
% See solution above
% 15.30/2.52 # Parsed axioms : 44
% 15.30/2.52 # Removed by relevancy pruning/SinE : 24
% 15.30/2.52 # Initial clauses : 40
% 15.30/2.52 # Removed in clause preprocessing : 0
% 15.30/2.52 # Initial clauses in saturation : 40
% 15.30/2.52 # Processed clauses : 18085
% 15.30/2.52 # ...of these trivial : 122
% 15.30/2.52 # ...subsumed : 13218
% 15.30/2.52 # ...remaining for further processing : 4745
% 15.30/2.52 # Other redundant clauses eliminated : 2
% 15.30/2.52 # Clauses deleted for lack of memory : 0
% 15.30/2.52 # Backward-subsumed : 128
% 15.30/2.52 # Backward-rewritten : 2203
% 15.30/2.52 # Generated clauses : 92108
% 15.30/2.52 # ...of the previous two non-redundant : 78192
% 15.30/2.52 # ...aggressively subsumed : 0
% 15.30/2.52 # Contextual simplify-reflections : 117
% 15.30/2.52 # Paramodulations : 92104
% 15.30/2.52 # Factorizations : 2
% 15.30/2.52 # NegExts : 0
% 15.30/2.52 # Equation resolutions : 2
% 15.30/2.52 # Total rewrite steps : 25790
% 15.30/2.52 # Propositional unsat checks : 0
% 15.30/2.52 # Propositional check models : 0
% 15.30/2.52 # Propositional check unsatisfiable : 0
% 15.30/2.52 # Propositional clauses : 0
% 15.30/2.52 # Propositional clauses after purity: 0
% 15.30/2.52 # Propositional unsat core size : 0
% 15.30/2.52 # Propositional preprocessing time : 0.000
% 15.30/2.52 # Propositional encoding time : 0.000
% 15.30/2.52 # Propositional solver time : 0.000
% 15.30/2.52 # Success case prop preproc time : 0.000
% 15.30/2.52 # Success case prop encoding time : 0.000
% 15.30/2.52 # Success case prop solver time : 0.000
% 15.30/2.52 # Current number of processed clauses : 2377
% 15.30/2.52 # Positive orientable unit clauses : 27
% 15.30/2.52 # Positive unorientable unit clauses: 0
% 15.30/2.52 # Negative unit clauses : 14
% 15.30/2.52 # Non-unit-clauses : 2336
% 15.30/2.52 # Current number of unprocessed clauses: 55870
% 15.30/2.52 # ...number of literals in the above : 290874
% 15.30/2.52 # Current number of archived formulas : 0
% 15.30/2.52 # Current number of archived clauses : 2368
% 15.30/2.52 # Clause-clause subsumption calls (NU) : 1517861
% 15.30/2.52 # Rec. Clause-clause subsumption calls : 556328
% 15.30/2.52 # Non-unit clause-clause subsumptions : 10754
% 15.30/2.52 # Unit Clause-clause subsumption calls : 1409
% 15.30/2.52 # Rewrite failures with RHS unbound : 0
% 15.30/2.52 # BW rewrite match attempts : 23
% 15.30/2.52 # BW rewrite match successes : 20
% 15.30/2.52 # Condensation attempts : 0
% 15.30/2.52 # Condensation successes : 0
% 15.30/2.52 # Termbank termtop insertions : 2135743
% 15.30/2.52
% 15.30/2.52 # -------------------------------------------------
% 15.30/2.52 # User time : 1.877 s
% 15.30/2.52 # System time : 0.044 s
% 15.30/2.52 # Total time : 1.921 s
% 15.30/2.52 # Maximum resident set size: 1856 pages
% 15.30/2.52
% 15.30/2.52 # -------------------------------------------------
% 15.30/2.52 # User time : 1.879 s
% 15.30/2.52 # System time : 0.046 s
% 15.30/2.52 # Total time : 1.925 s
% 15.30/2.52 # Maximum resident set size: 1704 pages
% 15.30/2.52 % E---3.1 exiting
% 15.30/2.52 % E---3.1 exiting
%------------------------------------------------------------------------------