%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM612+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:49:46 PM UTC 2026
% Result : Theorem 0.21s 0.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 50 ( 22 unt; 0 def)
% Number of atoms : 161 ( 35 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 190 ( 79 ~; 76 |; 23 &)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 9 con; 0-3 aty)
% Number of variables : 42 ( 0 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSel,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aSet0(X1) )
=> ! [X3] :
( X3 = slbdtsldtrb0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( sbrdtbr0(X4) = X2
& aSubsetOf0(X4,X1) ) )
& aSet0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSel) ).
fof(m__5093,hypothesis,
( xQ != slcrc0
& aSubsetOf0(xQ,xO) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5093) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
fof(m__,conjecture,
( aElementOf0(sbrdtbr0(xP),szNzAzT0)
& szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mCardNum,axiom,
! [X1] :
( aSet0(X1)
=> ( aElementOf0(sbrdtbr0(X1),szNzAzT0)
<=> isFinite0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardNum) ).
fof(m__5078,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5078) ).
fof(m__3418,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3418) ).
fof(m__4891,hypothesis,
( xO = sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aSet0(xO) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4891) ).
fof(mCardDiff,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( ( aElementOf0(X2,X1)
& isFinite0(X1) )
=> szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))) = sbrdtbr0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardDiff) ).
fof(m__5164,hypothesis,
( xP = sdtmndt0(xQ,szmzizndt0(xQ))
& aSet0(xP) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5164) ).
fof(m__5147,hypothesis,
xp = szmzizndt0(xQ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5147) ).
fof(mSubFSet,axiom,
! [X1] :
( ( isFinite0(X1)
& aSet0(X1) )
=> ! [X2] :
( aSubsetOf0(X2,X1)
=> isFinite0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSubFSet) ).
fof(m__5173,hypothesis,
aElementOf0(xp,xQ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5173) ).
fof(m__5195,hypothesis,
aSubsetOf0(xP,xQ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5195) ).
fof(c_0_14,plain,
! [X120,X121,X122,X123,X124,X125] :
( ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| aElementOf0(esk11_3(X120,X121,X125),X125)
| sbrdtbr0(esk11_3(X120,X121,X125)) = X121 )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| aElementOf0(esk11_3(X120,X121,X125),X125)
| aSubsetOf0(esk11_3(X120,X121,X125),X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| sbrdtbr0(esk11_3(X120,X121,X125)) != X121
| ~ aSubsetOf0(esk11_3(X120,X121,X125),X120)
| ~ aElementOf0(esk11_3(X120,X121,X125),X125) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| aElementOf0(X124,X122)
| sbrdtbr0(X124) != X121
| ~ aSubsetOf0(X124,X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| ~ aElementOf0(X123,X122)
| sbrdtbr0(X123) = X121 )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| ~ aElementOf0(X123,X122)
| aSubsetOf0(X123,X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| aSet0(X122) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[mDefSel])])])])])])]) ).
fof(c_0_15,hypothesis,
( xQ != slcrc0
& aSubsetOf0(xQ,xO) ),
inference(fof_simplification,[status(thm)],[m__5093]) ).
cnf(c_0_16,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X4)
| X3 != slbdtsldtrb0(X4,X2)
| ~ aElementOf0(X1,X3)
| sbrdtbr0(X1) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X19,X20,X21,X22] :
( ( ~ aSet0(X19)
| aSubsetOf0(X22,X19)
| ~ aSet0(X22)
| ~ aElementOf0(esk2_2(X19,X22),X19) )
& ( ~ aSet0(X19)
| aSubsetOf0(X22,X19)
| ~ aSet0(X22)
| aElementOf0(esk2_2(X19,X22),X22) )
& ( ~ aSet0(X19)
| ~ aSubsetOf0(X20,X19)
| aElementOf0(X21,X19)
| ~ aElementOf0(X21,X20) )
& ( ~ aSet0(X19)
| ~ aSubsetOf0(X20,X19)
| aSet0(X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[mDefSub])])])])])])]) ).
fof(c_0_18,hypothesis,
( xQ != slcrc0
& aSubsetOf0(xQ,xO) ),
inference(fof_nnf,[status(thm)],[c_0_15]) ).
fof(c_0_19,negated_conjecture,
~ ( aElementOf0(sbrdtbr0(xP),szNzAzT0)
& szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_20,plain,
! [X83] :
( ( ~ aSet0(X83)
| aElementOf0(sbrdtbr0(X83),szNzAzT0)
| ~ isFinite0(X83) )
& ( ~ aSet0(X83)
| isFinite0(X83)
| ~ aElementOf0(sbrdtbr0(X83),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardNum])])])]) ).
cnf(c_0_21,plain,
( ~ aSet0(X3)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
| sbrdtbr0(X1) = X2 ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_22,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
inference(split_conjunct,[status(thm)],[m__5078]) ).
cnf(c_0_23,hypothesis,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3418]) ).
cnf(c_0_24,hypothesis,
aSet0(xO),
inference(split_conjunct,[status(thm)],[m__4891]) ).
cnf(c_0_25,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,hypothesis,
aSubsetOf0(xQ,xO),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_27,negated_conjecture,
( ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| szszuzczcdt0(sbrdtbr0(xP)) != sbrdtbr0(xQ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])]) ).
fof(c_0_28,plain,
! [X87,X88] :
( szszuzczcdt0(sbrdtbr0(sdtmndt0(X87,X88))) = sbrdtbr0(X87)
| ~ aElementOf0(X88,X87)
| ~ isFinite0(X87)
| ~ aSet0(X87) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardDiff])])])]) ).
cnf(c_0_29,hypothesis,
xP = sdtmndt0(xQ,szmzizndt0(xQ)),
inference(split_conjunct,[status(thm)],[m__5164]) ).
cnf(c_0_30,hypothesis,
xp = szmzizndt0(xQ),
inference(split_conjunct,[status(thm)],[m__5147]) ).
cnf(c_0_31,plain,
( ~ aSet0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| isFinite0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,hypothesis,
sbrdtbr0(xQ) = xK,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_33,hypothesis,
aSet0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24])]) ).
fof(c_0_34,plain,
! [X24,X25] :
( isFinite0(X25)
| ~ aSubsetOf0(X25,X24)
| ~ isFinite0(X24)
| ~ aSet0(X24) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubFSet])])])]) ).
cnf(c_0_35,negated_conjecture,
( ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| szszuzczcdt0(sbrdtbr0(xP)) != sbrdtbr0(xQ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
( ~ aElementOf0(X2,X1)
| ~ isFinite0(X1)
| ~ aSet0(X1)
| szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))) = sbrdtbr0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,hypothesis,
sdtmndt0(xQ,xp) = xP,
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,hypothesis,
isFinite0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_23]),c_0_33])]) ).
cnf(c_0_39,hypothesis,
aElementOf0(xp,xQ),
inference(split_conjunct,[status(thm)],[m__5173]) ).
cnf(c_0_40,plain,
( ~ aSubsetOf0(X2,X1)
| ~ isFinite0(X1)
| ~ aSet0(X1)
| isFinite0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,hypothesis,
aSubsetOf0(xP,xQ),
inference(split_conjunct,[status(thm)],[m__5195]) ).
cnf(c_0_42,negated_conjecture,
( ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| szszuzczcdt0(sbrdtbr0(xP)) != xK ),
inference(rw,[status(thm)],[c_0_35,c_0_32]) ).
cnf(c_0_43,hypothesis,
szszuzczcdt0(sbrdtbr0(xP)) = xK,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_32]),c_0_38]),c_0_39]),c_0_33])]) ).
cnf(c_0_44,hypothesis,
( ~ isFinite0(xQ)
| isFinite0(xP) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_33])]) ).
cnf(c_0_45,negated_conjecture,
~ aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_46,plain,
( ~ aSet0(X1)
| ~ isFinite0(X1)
| aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_47,hypothesis,
isFinite0(xP),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_38])]) ).
cnf(c_0_48,hypothesis,
aSet0(xP),
inference(split_conjunct,[status(thm)],[m__5164]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM612+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n010.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 02:44:39 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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/benchmark/theBenchmark.p
% 0.21/0.60 % Version: 3.5.1
% 0.21/0.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.60 % Starting sh5l with 300s (1) cores
% 0.21/0.60 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4067433 completed with status 0
% 0.21/0.60 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.60 % No SInE strategy applied
% 0.21/0.60 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.21/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.21/0.60 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.21/0.60 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.21/0.60 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4067440 completed with status 0
% 0.21/0.60 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.60 % No SInE strategy applied
% 0.21/0.60 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.21/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.60 % Preprocessing time : 0.006 s
% 0.21/0.60 % Presaturation interreduction done
% 0.21/0.60
% 0.21/0.60 % Proof found!
% 0.21/0.60 % SZS status Theorem
% 0.21/0.60 % SZS output start CNFRefutation
% See solution above
% 0.21/0.60 % Parsed axioms : 109
% 0.21/0.60 % Removed by relevancy pruning/SinE : 0
% 0.21/0.60 % Initial clauses : 213
% 0.21/0.60 % Removed in clause preprocessing : 7
% 0.21/0.60 % Initial clauses in saturation : 206
% 0.21/0.60 % Processed clauses : 453
% 0.21/0.60 % ...of these trivial : 3
% 0.21/0.60 % ...subsumed : 14
% 0.21/0.60 % ...remaining for further processing : 436
% 0.21/0.60 % Other redundant clauses eliminated : 48
% 0.21/0.60 % Clauses deleted for lack of memory : 0
% 0.21/0.60 % Backward-subsumed : 8
% 0.21/0.60 % Backward-rewritten : 7
% 0.21/0.60 % Generated clauses : 387
% 0.21/0.60 % ...of the previous two non-redundant : 342
% 0.21/0.60 % ...aggressively subsumed : 0
% 0.21/0.60 % Contextual simplify-reflections : 16
% 0.21/0.60 % Paramodulations : 342
% 0.21/0.60 % Factorizations : 0
% 0.21/0.60 % NegExts : 0
% 0.21/0.60 % Equation resolutions : 50
% 0.21/0.60 % Disequality decompositions : 0
% 0.21/0.60 % Total rewrite steps : 232
% 0.21/0.60 % ...of those cached : 194
% 0.21/0.60 % Propositional unsat checks : 0
% 0.21/0.60 % Propositional check models : 0
% 0.21/0.60 % Propositional check unsatisfiable : 0
% 0.21/0.60 % Propositional clauses : 0
% 0.21/0.60 % Propositional clauses after purity: 0
% 0.21/0.60 % Propositional unsat core size : 0
% 0.21/0.60 % Propositional preprocessing time : 0.000
% 0.21/0.60 % Propositional encoding time : 0.000
% 0.21/0.60 % Propositional solver time : 0.000
% 0.21/0.60 % Success case prop preproc time : 0.000
% 0.21/0.60 % Success case prop encoding time : 0.000
% 0.21/0.60 % Success case prop solver time : 0.000
% 0.21/0.60 % Current number of processed clauses : 177
% 0.21/0.60 % Positive orientable unit clauses : 62
% 0.21/0.60 % Positive unorientable unit clauses: 0
% 0.21/0.60 % Negative unit clauses : 13
% 0.21/0.60 % Non-unit-clauses : 102
% 0.21/0.60 % Current number of unprocessed clauses: 299
% 0.21/0.60 % ...number of literals in the above : 1313
% 0.21/0.60 % Current number of archived formulas : 0
% 0.21/0.60 % Current number of archived clauses : 219
% 0.21/0.60 % Clause-clause subsumption calls (NU) : 9401
% 0.21/0.60 % Rec. Clause-clause subsumption calls : 2816
% 0.21/0.60 % Non-unit clause-clause subsumptions : 22
% 0.21/0.60 % Unit Clause-clause subsumption calls : 506
% 0.21/0.60 % Rewrite failures with RHS unbound : 0
% 0.21/0.60 % BW rewrite match attempts : 5
% 0.21/0.60 % BW rewrite match successes : 5
% 0.21/0.60 % Condensation attempts : 0
% 0.21/0.60 % Condensation successes : 0
% 0.21/0.60 % Termbank termtop insertions : 24453
% 0.21/0.60 % Search garbage collected termcells : 3740
% 0.21/0.60
% 0.21/0.60 % -------------------------------------------------
% 0.21/0.60 % User time : 0.051 s
% 0.21/0.60 % System time : 0.010 s
% 0.21/0.60 % Total time : 0.061 s
% 0.21/0.60 % Maximum resident set size: 4284 pages
% 0.21/0.60
% 0.21/0.60 % -------------------------------------------------
% 0.21/0.60 % User time : 0.108 s
% 0.21/0.60 % System time : 0.030 s
% 0.21/0.60 % Total time : 0.138 s
% 0.21/0.60 % Maximum resident set size: 4864 pages
% 0.21/0.60 % E exiting
%------------------------------------------------------------------------------