%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM620+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:48 PM UTC 2026
% Result : Theorem 0.09s 0.46s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 49 ( 12 unt; 0 def)
% Number of atoms : 154 ( 34 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 174 ( 69 ~; 62 |; 26 &)
% ( 4 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 10 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 29 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mDefMin,axiom,
! [X1] :
( ( X1 != slcrc0
& aSubsetOf0(X1,szNzAzT0) )
=> ! [X2] :
( X2 = szmzizndt0(X1)
<=> ( ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aElementOf0(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefMin) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
fof(m__3671,hypothesis,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( isCountable0(sdtlpdtrp0(xN,X1))
& aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3671) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
fof(mSuccNum,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSuccNum) ).
fof(mCountNFin_01,axiom,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> X1 != slcrc0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCountNFin_01) ).
fof(m__5401,hypothesis,
xx = szmzizndt0(sdtlpdtrp0(xN,xm)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5401) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( ~ ? [X2] : aElementOf0(X2,X1)
& aSet0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmp) ).
fof(m__5389,hypothesis,
( xx = sdtlpdtrp0(xe,xm)
& aElementOf0(xm,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5389) ).
fof(m__5309,hypothesis,
( sdtlpdtrp0(xe,xn) = xp
& aElementOf0(xn,szNzAzT0)
& aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5309) ).
fof(c_0_11,negated_conjecture,
~ ( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_12,plain,
! [X1] :
( ( X1 != slcrc0
& aSubsetOf0(X1,szNzAzT0) )
=> ! [X2] :
( X2 = szmzizndt0(X1)
<=> ( ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aElementOf0(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[mDefMin]) ).
fof(c_0_13,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_14,negated_conjecture,
( ~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
fof(c_0_15,hypothesis,
! [X184] :
( ( ~ aElementOf0(X184,szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,X184)) )
& ( ~ aElementOf0(X184,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X184),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3671])])])]) ).
fof(c_0_16,plain,
! [X94,X95,X96,X97] :
( ( X94 = slcrc0
| ~ aSubsetOf0(X94,szNzAzT0)
| X97 = szmzizndt0(X94)
| ~ aElementOf0(X97,X94)
| ~ sdtlseqdt0(X97,esk7_2(X94,X97)) )
& ( X94 = slcrc0
| ~ aSubsetOf0(X94,szNzAzT0)
| X97 = szmzizndt0(X94)
| ~ aElementOf0(X97,X94)
| aElementOf0(esk7_2(X94,X97),X94) )
& ( X94 = slcrc0
| ~ aSubsetOf0(X94,szNzAzT0)
| X95 != szmzizndt0(X94)
| sdtlseqdt0(X95,X96)
| ~ aElementOf0(X96,X94) )
& ( X94 = slcrc0
| ~ aSubsetOf0(X94,szNzAzT0)
| X95 != szmzizndt0(X94)
| aElementOf0(X95,X94) ) ),
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)],[c_0_12])])])])])])]) ).
cnf(c_0_17,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_22,plain,
( ~ aSubsetOf0(X2,szNzAzT0)
| X1 != szmzizndt0(X2)
| X2 = slcrc0
| aElementOf0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( ~ aSet0(sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xm))
| aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aSet0(sdtlpdtrp0(xN,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
fof(c_0_25,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
inference(fof_simplification,[status(thm)],[mSuccNum]) ).
fof(c_0_26,plain,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> X1 != slcrc0 ),
inference(fof_simplification,[status(thm)],[mCountNFin_01]) ).
cnf(c_0_27,plain,
( ~ aSubsetOf0(X1,szNzAzT0)
| aElementOf0(szmzizndt0(X1),X1)
| X1 = slcrc0 ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_28,hypothesis,
xx = szmzizndt0(sdtlpdtrp0(xN,xm)),
inference(split_conjunct,[status(thm)],[m__5401]) ).
cnf(c_0_29,negated_conjecture,
~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,hypothesis,
( ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xm))
| aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_31,plain,
! [X58] :
( ( ~ aElementOf0(X58,szNzAzT0)
| szszuzczcdt0(X58) != sz00 )
& ( ~ aElementOf0(X58,szNzAzT0)
| aElementOf0(szszuzczcdt0(X58),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
fof(c_0_32,plain,
! [X18] :
( X18 != slcrc0
| ~ isCountable0(X18)
| ~ aSet0(X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])]) ).
fof(c_0_33,plain,
! [X12,X13,X14] :
( ( X14 = slcrc0
| aElementOf0(esk1_1(X14),X14)
| ~ aSet0(X14) )
& ( X12 != slcrc0
| ~ aElementOf0(X13,X12) )
& ( X12 != slcrc0
| aSet0(X12) ) ),
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)],[mDefEmp])])])])])])]) ).
cnf(c_0_34,hypothesis,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0)
| aElementOf0(xx,sdtlpdtrp0(xN,xm))
| sdtlpdtrp0(xN,xm) = slcrc0 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,hypothesis,
aElementOf0(xm,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5389]) ).
cnf(c_0_36,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| ~ aElementOf0(xx,sdtlpdtrp0(xN,xm)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(szszuzczcdt0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,hypothesis,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5309]) ).
cnf(c_0_39,plain,
( X1 != slcrc0
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
( X1 != slcrc0
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,hypothesis,
( aElementOf0(xx,sdtlpdtrp0(xN,xm))
| sdtlpdtrp0(xN,xm) = slcrc0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_20]),c_0_35])]) ).
cnf(c_0_42,negated_conjecture,
~ aElementOf0(xx,sdtlpdtrp0(xN,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_43,plain,
( ~ aSet0(slcrc0)
| ~ isCountable0(slcrc0) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_44,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_45,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_46,hypothesis,
sdtlpdtrp0(xN,xm) = slcrc0,
inference(sr,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
~ isCountable0(slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_48,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_35])]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM620+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n016.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 02:49:22 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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/benchmark/theBenchmark.p
% 0.09/0.46 % Version: 3.5.1
% 0.09/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.46 % Starting sh5l with 300s (1) cores
% 0.09/0.46 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1394573 completed with status 0
% 0.09/0.46 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.09/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.46 % No SInE strategy applied
% 0.09/0.46 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.09/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.09/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.09/0.46 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.09/0.46 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.09/0.46 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1394582 completed with status 0
% 0.09/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.09/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.46 % No SInE strategy applied
% 0.09/0.46 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.09/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.09/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.09/0.46 % Preprocessing time : 0.003 s
% 0.09/0.46 % Presaturation interreduction done
% 0.09/0.46
% 0.09/0.46 % Proof found!
% 0.09/0.46 % SZS status Theorem
% 0.09/0.46 % SZS output start CNFRefutation
% See solution above
% 0.09/0.46 % Parsed axioms : 117
% 0.09/0.46 % Removed by relevancy pruning/SinE : 0
% 0.09/0.46 % Initial clauses : 226
% 0.09/0.46 % Removed in clause preprocessing : 7
% 0.09/0.46 % Initial clauses in saturation : 219
% 0.09/0.46 % Processed clauses : 480
% 0.09/0.46 % ...of these trivial : 4
% 0.09/0.46 % ...subsumed : 10
% 0.09/0.46 % ...remaining for further processing : 466
% 0.09/0.46 % Other redundant clauses eliminated : 49
% 0.09/0.46 % Clauses deleted for lack of memory : 0
% 0.09/0.46 % Backward-subsumed : 8
% 0.09/0.46 % Backward-rewritten : 16
% 0.09/0.46 % Generated clauses : 280
% 0.09/0.46 % ...of the previous two non-redundant : 226
% 0.09/0.46 % ...aggressively subsumed : 0
% 0.09/0.46 % Contextual simplify-reflections : 20
% 0.09/0.46 % Paramodulations : 234
% 0.09/0.46 % Factorizations : 0
% 0.09/0.46 % NegExts : 0
% 0.09/0.46 % Equation resolutions : 50
% 0.09/0.46 % Disequality decompositions : 0
% 0.09/0.46 % Total rewrite steps : 250
% 0.09/0.46 % ...of those cached : 204
% 0.09/0.46 % Propositional unsat checks : 0
% 0.09/0.46 % Propositional check models : 0
% 0.09/0.46 % Propositional check unsatisfiable : 0
% 0.09/0.46 % Propositional clauses : 0
% 0.09/0.46 % Propositional clauses after purity: 0
% 0.09/0.46 % Propositional unsat core size : 0
% 0.09/0.46 % Propositional preprocessing time : 0.000
% 0.09/0.46 % Propositional encoding time : 0.000
% 0.09/0.46 % Propositional solver time : 0.000
% 0.09/0.46 % Success case prop preproc time : 0.000
% 0.09/0.46 % Success case prop encoding time : 0.000
% 0.09/0.46 % Success case prop solver time : 0.000
% 0.09/0.46 % Current number of processed clauses : 184
% 0.09/0.46 % Positive orientable unit clauses : 82
% 0.09/0.46 % Positive unorientable unit clauses: 0
% 0.09/0.46 % Negative unit clauses : 15
% 0.09/0.46 % Non-unit-clauses : 87
% 0.09/0.46 % Current number of unprocessed clauses: 169
% 0.09/0.46 % ...number of literals in the above : 706
% 0.09/0.46 % Current number of archived formulas : 0
% 0.09/0.46 % Current number of archived clauses : 242
% 0.09/0.46 % Clause-clause subsumption calls (NU) : 6908
% 0.09/0.46 % Rec. Clause-clause subsumption calls : 1782
% 0.09/0.46 % Non-unit clause-clause subsumptions : 24
% 0.09/0.46 % Unit Clause-clause subsumption calls : 359
% 0.09/0.46 % Rewrite failures with RHS unbound : 0
% 0.09/0.46 % BW rewrite match attempts : 6
% 0.09/0.46 % BW rewrite match successes : 6
% 0.09/0.46 % Condensation attempts : 0
% 0.09/0.46 % Condensation successes : 0
% 0.09/0.46 % Termbank termtop insertions : 22768
% 0.09/0.46 % Search garbage collected termcells : 3751
% 0.09/0.46
% 0.09/0.46 % -------------------------------------------------
% 0.09/0.46 % User time : 0.030 s
% 0.09/0.46 % System time : 0.006 s
% 0.09/0.46 % Total time : 0.035 s
% 0.09/0.46 % Maximum resident set size: 4288 pages
% 0.09/0.46
% 0.09/0.46 % -------------------------------------------------
% 0.09/0.46 % User time : 0.083 s
% 0.09/0.46 % System time : 0.026 s
% 0.09/0.46 % Total time : 0.108 s
% 0.09/0.46 % Maximum resident set size: 4608 pages
% 0.09/0.46 % E exiting
%------------------------------------------------------------------------------