%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM611+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 : n001.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.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of formulae : 57 ( 28 unt; 0 def)
% Number of atoms : 177 ( 44 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 207 ( 87 ~; 85 |; 21 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 9 con; 0-3 aty)
% Number of variables : 49 ( 0 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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,
sbrdtbr0(xP) = xk,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mSuccEquSucc,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( szszuzczcdt0(X1) = szszuzczcdt0(X2)
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSuccEquSucc) ).
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(m__5106,hypothesis,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5106) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet) ).
fof(m__3533,hypothesis,
( szszuzczcdt0(xk) = xK
& aElementOf0(xk,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3533) ).
fof(m__5173,hypothesis,
aElementOf0(xp,xQ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5173) ).
fof(mSubFSet,axiom,
! [X1] :
( ( isFinite0(X1)
& aSet0(X1) )
=> ! [X2] :
( aSubsetOf0(X2,X1)
=> isFinite0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSubFSet) ).
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(mCardNum,axiom,
! [X1] :
( aSet0(X1)
=> ( aElementOf0(sbrdtbr0(X1),szNzAzT0)
<=> isFinite0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardNum) ).
fof(m__5195,hypothesis,
aSubsetOf0(xP,xQ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5195) ).
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(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,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_19,plain,
! [X59,X60] :
( X59 = X60
| szszuzczcdt0(X59) != szszuzczcdt0(X60)
| ~ aElementOf0(X60,szNzAzT0)
| ~ aElementOf0(X59,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccEquSucc])])]) ).
fof(c_0_20,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_21,hypothesis,
xP = sdtmndt0(xQ,szmzizndt0(xQ)),
inference(split_conjunct,[status(thm)],[m__5164]) ).
cnf(c_0_22,hypothesis,
xp = szmzizndt0(xQ),
inference(split_conjunct,[status(thm)],[m__5147]) ).
cnf(c_0_23,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,hypothesis,
aSubsetOf0(xQ,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5106]) ).
cnf(c_0_25,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
fof(c_0_26,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(fof_simplification,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( szszuzczcdt0(X1) != szszuzczcdt0(X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,hypothesis,
szszuzczcdt0(xk) = xK,
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_29,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_30,plain,
( ~ aElementOf0(X2,X1)
| ~ isFinite0(X1)
| ~ aSet0(X1)
| szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))) = sbrdtbr0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,hypothesis,
sdtmndt0(xQ,xp) = xP,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_32,hypothesis,
aElementOf0(xp,xQ),
inference(split_conjunct,[status(thm)],[m__5173]) ).
cnf(c_0_33,hypothesis,
aSet0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
fof(c_0_34,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(fof_nnf,[status(thm)],[c_0_26]) ).
fof(c_0_35,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])])])]) ).
fof(c_0_36,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])])])])])])]) ).
cnf(c_0_37,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| szszuzczcdt0(X1) != xK
| X1 = xk ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_38,hypothesis,
( ~ isFinite0(xQ)
| szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_39,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_40,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_41,plain,
( ~ aSubsetOf0(X2,X1)
| ~ isFinite0(X1)
| ~ aSet0(X1)
| isFinite0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,hypothesis,
aSubsetOf0(xP,xQ),
inference(split_conjunct,[status(thm)],[m__5195]) ).
cnf(c_0_43,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X4)
| X3 != slbdtsldtrb0(X4,X2)
| ~ aElementOf0(X1,X3)
| sbrdtbr0(X1) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,hypothesis,
( ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| ~ isFinite0(xQ)
| sbrdtbr0(xQ) != xK ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_45,plain,
( ~ aSet0(X1)
| ~ isFinite0(X1)
| aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,hypothesis,
aSet0(xP),
inference(split_conjunct,[status(thm)],[m__5164]) ).
cnf(c_0_47,hypothesis,
( ~ isFinite0(xQ)
| isFinite0(xP) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_33])]) ).
cnf(c_0_48,plain,
( ~ aSet0(X3)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
| sbrdtbr0(X1) = X2 ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_49,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
inference(split_conjunct,[status(thm)],[m__5078]) ).
cnf(c_0_50,hypothesis,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3418]) ).
cnf(c_0_51,hypothesis,
aSet0(xO),
inference(split_conjunct,[status(thm)],[m__4891]) ).
cnf(c_0_52,hypothesis,
( ~ isFinite0(xQ)
| sbrdtbr0(xQ) != xK ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]),c_0_47]) ).
cnf(c_0_53,hypothesis,
sbrdtbr0(xQ) = xK,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51])]) ).
cnf(c_0_54,plain,
( ~ aSet0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| isFinite0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_55,hypothesis,
~ isFinite0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]) ).
cnf(c_0_56,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_53]),c_0_50]),c_0_33])]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM611+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.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 02:49:58 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 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.49 % Version: 3.5.1
% 0.21/0.49 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 % Starting sh5l with 300s (1) cores
% 0.21/0.49 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2028989 completed with status 0
% 0.21/0.49 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.49 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.49 % No SInE strategy applied
% 0.21/0.49 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.21/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.21/0.49 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.21/0.49 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.21/0.49 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2029007 completed with status 0
% 0.21/0.49 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.21/0.49 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.49 % No SInE strategy applied
% 0.21/0.49 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.21/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.21/0.49 % Preprocessing time : 0.005 s
% 0.21/0.49 % Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 % Proof found!
% 0.21/0.49 % SZS status Theorem
% 0.21/0.49 % SZS output start CNFRefutation
% See solution above
% 0.21/0.49 % Parsed axioms : 109
% 0.21/0.49 % Removed by relevancy pruning/SinE : 0
% 0.21/0.49 % Initial clauses : 213
% 0.21/0.49 % Removed in clause preprocessing : 7
% 0.21/0.49 % Initial clauses in saturation : 206
% 0.21/0.49 % Processed clauses : 631
% 0.21/0.49 % ...of these trivial : 4
% 0.21/0.49 % ...subsumed : 83
% 0.21/0.49 % ...remaining for further processing : 543
% 0.21/0.49 % Other redundant clauses eliminated : 50
% 0.21/0.49 % Clauses deleted for lack of memory : 0
% 0.21/0.49 % Backward-subsumed : 45
% 0.21/0.49 % Backward-rewritten : 14
% 0.21/0.49 % Generated clauses : 561
% 0.21/0.49 % ...of the previous two non-redundant : 500
% 0.21/0.49 % ...aggressively subsumed : 0
% 0.21/0.49 % Contextual simplify-reflections : 31
% 0.21/0.49 % Paramodulations : 514
% 0.21/0.49 % Factorizations : 0
% 0.21/0.49 % NegExts : 0
% 0.21/0.49 % Equation resolutions : 52
% 0.21/0.49 % Disequality decompositions : 0
% 0.21/0.49 % Total rewrite steps : 411
% 0.21/0.49 % ...of those cached : 361
% 0.21/0.49 % Propositional unsat checks : 0
% 0.21/0.49 % Propositional check models : 0
% 0.21/0.49 % Propositional check unsatisfiable : 0
% 0.21/0.49 % Propositional clauses : 0
% 0.21/0.49 % Propositional clauses after purity: 0
% 0.21/0.49 % Propositional unsat core size : 0
% 0.21/0.49 % Propositional preprocessing time : 0.000
% 0.21/0.49 % Propositional encoding time : 0.000
% 0.21/0.49 % Propositional solver time : 0.000
% 0.21/0.49 % Success case prop preproc time : 0.000
% 0.21/0.49 % Success case prop encoding time : 0.000
% 0.21/0.49 % Success case prop solver time : 0.000
% 0.21/0.49 % Current number of processed clauses : 240
% 0.21/0.49 % Positive orientable unit clauses : 72
% 0.21/0.49 % Positive unorientable unit clauses: 0
% 0.21/0.49 % Negative unit clauses : 20
% 0.21/0.49 % Non-unit-clauses : 148
% 0.21/0.49 % Current number of unprocessed clauses: 273
% 0.21/0.49 % ...number of literals in the above : 1254
% 0.21/0.49 % Current number of archived formulas : 0
% 0.21/0.49 % Current number of archived clauses : 263
% 0.21/0.49 % Clause-clause subsumption calls (NU) : 12299
% 0.21/0.49 % Rec. Clause-clause subsumption calls : 4744
% 0.21/0.49 % Non-unit clause-clause subsumptions : 87
% 0.21/0.49 % Unit Clause-clause subsumption calls : 690
% 0.21/0.49 % Rewrite failures with RHS unbound : 0
% 0.21/0.49 % BW rewrite match attempts : 6
% 0.21/0.49 % BW rewrite match successes : 6
% 0.21/0.49 % Condensation attempts : 0
% 0.21/0.49 % Condensation successes : 0
% 0.21/0.49 % Termbank termtop insertions : 26445
% 0.21/0.49 % Search garbage collected termcells : 3734
% 0.21/0.49
% 0.21/0.49 % -------------------------------------------------
% 0.21/0.49 % User time : 0.056 s
% 0.21/0.49 % System time : 0.007 s
% 0.21/0.49 % Total time : 0.064 s
% 0.21/0.49 % Maximum resident set size: 4280 pages
% 0.21/0.49
% 0.21/0.49 % -------------------------------------------------
% 0.21/0.49 % User time : 0.201 s
% 0.21/0.49 % System time : 0.024 s
% 0.21/0.49 % Total time : 0.225 s
% 0.21/0.49 % Maximum resident set size: 4864 pages
% 0.21/0.49 % E exiting
%------------------------------------------------------------------------------