%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM611+3 : 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 : n026.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:55:42 PM UTC 2026
% Result : Theorem 2.22s 1.34s
% Output : CNFRefutation 2.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 59 ( 23 unt; 0 def)
% Number of atoms : 171 ( 38 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 173 ( 61 ~; 55 |; 36 &)
% ( 3 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__5164,hypothesis,
( xP = sdtmndt0(xQ,szmzizndt0(xQ))
& ! [X1] :
( aElementOf0(X1,xP)
<=> ( X1 != szmzizndt0(xQ)
& aElementOf0(X1,xQ)
& aElement0(X1) ) )
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(szmzizndt0(xQ),X1) )
& aSet0(xP) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5164) ).
fof(m__5147,hypothesis,
( xp = szmzizndt0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(xp,X1) )
& aElementOf0(xp,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__5195,hypothesis,
( aSubsetOf0(xP,xQ)
& ! [X1] :
( aElementOf0(X1,xP)
=> aElementOf0(X1,xQ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5195) ).
fof(m__5078,hypothesis,
( aElementOf0(xQ,slbdtsldtrb0(xO,xK))
& sbrdtbr0(xQ) = xK
& aSubsetOf0(xQ,xO)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xO) )
& aSet0(xQ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5078) ).
fof(mConsDiff,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> sdtpldt0(sdtmndt0(X1,X2),X2) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mConsDiff) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(mCardNum,axiom,
! [X1] :
( aSet0(X1)
=> ( aElementOf0(sbrdtbr0(X1),szNzAzT0)
<=> isFinite0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardNum) ).
fof(mFConsSet,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( ( isFinite0(X2)
& aSet0(X2) )
=> isFinite0(sdtpldt0(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mFConsSet) ).
fof(m__3418,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3418) ).
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__3533,hypothesis,
( szszuzczcdt0(xk) = xK
& aElementOf0(xk,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3533) ).
fof(c_0_14,hypothesis,
( xP = sdtmndt0(xQ,szmzizndt0(xQ))
& ! [X1] :
( aElementOf0(X1,xP)
<=> ( X1 != szmzizndt0(xQ)
& aElementOf0(X1,xQ)
& aElement0(X1) ) )
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(szmzizndt0(xQ),X1) )
& aSet0(xP) ),
inference(fof_simplification,[status(thm)],[m__5164]) ).
fof(c_0_15,hypothesis,
! [X92,X93] :
( xP = sdtmndt0(xQ,szmzizndt0(xQ))
& ( aElementOf0(X93,xP)
| X93 = szmzizndt0(xQ)
| ~ aElementOf0(X93,xQ)
| ~ aElement0(X93) )
& ( ~ aElementOf0(X93,xP)
| X93 != szmzizndt0(xQ) )
& ( ~ aElementOf0(X93,xP)
| aElementOf0(X93,xQ) )
& ( ~ aElementOf0(X93,xP)
| aElement0(X93) )
& ( sdtlseqdt0(szmzizndt0(xQ),X92)
| ~ aElementOf0(X92,xQ) )
& aSet0(xP) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])]) ).
fof(c_0_16,hypothesis,
! [X91] :
( xp = szmzizndt0(xQ)
& ( sdtlseqdt0(xp,X91)
| ~ aElementOf0(X91,xQ) )
& aElementOf0(xp,xQ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5147])])])]) ).
fof(c_0_17,plain,
! [X99,X100] :
( isFinite0(X100)
| ~ aSubsetOf0(X100,X99)
| ~ isFinite0(X99)
| ~ aSet0(X99) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubFSet])])])]) ).
fof(c_0_18,hypothesis,
! [X95] :
( aSubsetOf0(xP,xQ)
& ( aElementOf0(X95,xQ)
| ~ aElementOf0(X95,xP) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5195])])])]) ).
fof(c_0_19,hypothesis,
! [X85] :
( aElementOf0(xQ,slbdtsldtrb0(xO,xK))
& sbrdtbr0(xQ) = xK
& aSubsetOf0(xQ,xO)
& ( aElementOf0(X85,xO)
| ~ aElementOf0(X85,xQ) )
& aSet0(xQ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5078])])])]) ).
fof(c_0_20,plain,
! [X191,X192] :
( sdtpldt0(sdtmndt0(X191,X192),X192) = X191
| ~ aElementOf0(X192,X191)
| ~ aSet0(X191) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mConsDiff])])])]) ).
cnf(c_0_21,hypothesis,
xP = sdtmndt0(xQ,szmzizndt0(xQ)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,hypothesis,
xp = szmzizndt0(xQ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_23,plain,
! [X205,X206] :
( aElement0(X206)
| ~ aElementOf0(X206,X205)
| ~ aSet0(X205) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_24,plain,
! [X101] :
( ( ~ aSet0(X101)
| aElementOf0(sbrdtbr0(X101),szNzAzT0)
| ~ isFinite0(X101) )
& ( ~ aSet0(X101)
| isFinite0(X101)
| ~ aElementOf0(sbrdtbr0(X101),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardNum])])])]) ).
cnf(c_0_25,plain,
( ~ aSubsetOf0(X2,X1)
| ~ isFinite0(X1)
| ~ aSet0(X1)
| isFinite0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,hypothesis,
aSubsetOf0(xP,xQ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,hypothesis,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_28,plain,
! [X224,X225] :
( isFinite0(sdtpldt0(X225,X224))
| ~ isFinite0(X225)
| ~ aSet0(X225)
| ~ aElement0(X224) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mFConsSet])])])]) ).
cnf(c_0_29,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| sdtpldt0(sdtmndt0(X1,X2),X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,hypothesis,
sdtmndt0(xQ,xp) = xP,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_31,hypothesis,
aElementOf0(xp,xQ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_32,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
( ~ aSet0(X1)
| ~ isFinite0(X1)
| aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,hypothesis,
( ~ isFinite0(xQ)
| isFinite0(xP) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_35,hypothesis,
aSet0(xP),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_36,plain,
( ~ isFinite0(X2)
| ~ aSet0(X2)
| ~ aElement0(X1)
| isFinite0(sdtpldt0(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,hypothesis,
sdtpldt0(xP,xp) = xQ,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_27])]) ).
cnf(c_0_38,hypothesis,
aElement0(xp),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_31]),c_0_27])]) ).
cnf(c_0_39,hypothesis,
( ~ isFinite0(xQ)
| aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_40,plain,
( ~ aSet0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| isFinite0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_41,hypothesis,
sbrdtbr0(xQ) = xK,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_42,hypothesis,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3418]) ).
fof(c_0_43,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_44,plain,
! [X174,X175] :
( X174 = X175
| szszuzczcdt0(X174) != szszuzczcdt0(X175)
| ~ aElementOf0(X175,szNzAzT0)
| ~ aElementOf0(X174,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccEquSucc])])]) ).
fof(c_0_45,plain,
! [X182,X183] :
( szszuzczcdt0(sbrdtbr0(sdtmndt0(X182,X183))) = sbrdtbr0(X182)
| ~ aElementOf0(X183,X182)
| ~ isFinite0(X182)
| ~ aSet0(X182) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardDiff])])])]) ).
cnf(c_0_46,hypothesis,
( ~ isFinite0(xP)
| isFinite0(xQ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_35])]) ).
cnf(c_0_47,hypothesis,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42]),c_0_27])]) ).
fof(c_0_48,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(fof_simplification,[status(thm)],[c_0_43]) ).
cnf(c_0_49,plain,
( szszuzczcdt0(X1) != szszuzczcdt0(X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,hypothesis,
szszuzczcdt0(xk) = xK,
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_51,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_52,plain,
( ~ aElementOf0(X2,X1)
| ~ isFinite0(X1)
| ~ aSet0(X1)
| szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))) = sbrdtbr0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_53,hypothesis,
isFinite0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_40]),c_0_47]),c_0_35])]) ).
fof(c_0_54,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(fof_nnf,[status(thm)],[c_0_48]) ).
cnf(c_0_55,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| szszuzczcdt0(X1) != xK
| X1 = xk ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_56,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_52,c_0_30]),c_0_41]),c_0_53]),c_0_31]),c_0_27])]) ).
cnf(c_0_57,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_58,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_47])]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM611+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n026.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 02:47:06 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 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
% 2.22/1.34 % Version: 3.5.1
% 2.22/1.34 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.22/1.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.22/1.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.22/1.34 % Starting new_bool_3 with 300s (1) cores
% 2.22/1.34 % Starting new_bool_1 with 300s (1) cores
% 2.22/1.34 % Starting sh5l with 300s (1) cores
% 2.22/1.34 % new_bool_1 with pid 1200815 completed with status 0
% 2.22/1.34 % Result found by new_bool_1
% 2.22/1.34 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.22/1.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.22/1.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.22/1.34 % Starting new_bool_3 with 300s (1) cores
% 2.22/1.34 % Starting new_bool_1 with 300s (1) cores
% 2.22/1.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.22/1.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.22/1.34 % Search class: FGHSF-SMLM32-MFFFFFNN
% 2.22/1.34 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 2.22/1.34 % Starting SubtermCWHack with 28s (1) cores
% 2.22/1.34 % SubtermCWHack with pid 1200823 completed with status 0
% 2.22/1.34 % Result found by SubtermCWHack
% 2.22/1.34 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.22/1.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.22/1.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.22/1.34 % Starting new_bool_3 with 300s (1) cores
% 2.22/1.34 % Starting new_bool_1 with 300s (1) cores
% 2.22/1.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.22/1.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.22/1.34 % Search class: FGHSF-SMLM32-MFFFFFNN
% 2.22/1.34 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 2.22/1.34 % Starting SubtermCWHack with 28s (1) cores
% 2.22/1.34 % Preprocessing time : 0.132 s
% 2.22/1.34
% 2.22/1.34 % Proof found!
% 2.22/1.34 % SZS status Theorem
% 2.22/1.34 % SZS output start CNFRefutation
% See solution above
% 2.22/1.34 % Parsed axioms : 109
% 2.22/1.34 % Removed by relevancy pruning/SinE : 9
% 2.22/1.34 % Initial clauses : 4883
% 2.22/1.34 % Removed in clause preprocessing : 7
% 2.22/1.34 % Initial clauses in saturation : 4876
% 2.22/1.34 % Processed clauses : 804
% 2.22/1.34 % ...of these trivial : 22
% 2.22/1.34 % ...subsumed : 215
% 2.22/1.34 % ...remaining for further processing : 567
% 2.22/1.34 % Other redundant clauses eliminated : 35
% 2.22/1.34 % Clauses deleted for lack of memory : 0
% 2.22/1.34 % Backward-subsumed : 10
% 2.22/1.34 % Backward-rewritten : 27
% 2.22/1.34 % Generated clauses : 1641
% 2.22/1.34 % ...of the previous two non-redundant : 1344
% 2.22/1.34 % ...aggressively subsumed : 0
% 2.22/1.34 % Contextual simplify-reflections : 11
% 2.22/1.34 % Paramodulations : 1606
% 2.22/1.34 % Factorizations : 0
% 2.22/1.34 % NegExts : 0
% 2.22/1.34 % Equation resolutions : 36
% 2.22/1.34 % Disequality decompositions : 0
% 2.22/1.34 % Total rewrite steps : 1128
% 2.22/1.34 % ...of those cached : 1026
% 2.22/1.34 % Propositional unsat checks : 0
% 2.22/1.34 % Propositional check models : 0
% 2.22/1.34 % Propositional check unsatisfiable : 0
% 2.22/1.34 % Propositional clauses : 0
% 2.22/1.34 % Propositional clauses after purity: 0
% 2.22/1.34 % Propositional unsat core size : 0
% 2.22/1.34 % Propositional preprocessing time : 0.000
% 2.22/1.34 % Propositional encoding time : 0.000
% 2.22/1.34 % Propositional solver time : 0.000
% 2.22/1.34 % Success case prop preproc time : 0.000
% 2.22/1.34 % Success case prop encoding time : 0.000
% 2.22/1.34 % Success case prop solver time : 0.000
% 2.22/1.34 % Current number of processed clauses : 500
% 2.22/1.34 % Positive orientable unit clauses : 121
% 2.22/1.34 % Positive unorientable unit clauses: 0
% 2.22/1.34 % Negative unit clauses : 27
% 2.22/1.34 % Non-unit-clauses : 352
% 2.22/1.34 % Current number of unprocessed clauses: 5133
% 2.22/1.34 % ...number of literals in the above : 57404
% 2.22/1.34 % Current number of archived formulas : 0
% 2.22/1.34 % Current number of archived clauses : 39
% 2.22/1.34 % Clause-clause subsumption calls (NU) : 16308
% 2.22/1.34 % Rec. Clause-clause subsumption calls : 11594
% 2.22/1.34 % Non-unit clause-clause subsumptions : 160
% 2.22/1.34 % Unit Clause-clause subsumption calls : 2500
% 2.22/1.34 % Rewrite failures with RHS unbound : 0
% 2.22/1.34 % BW rewrite match attempts : 20
% 2.22/1.34 % BW rewrite match successes : 17
% 2.22/1.34 % Condensation attempts : 0
% 2.22/1.34 % Condensation successes : 0
% 2.22/1.34 % Termbank termtop insertions : 400998
% 2.22/1.34 % Search garbage collected termcells : 31509
% 2.22/1.34
% 2.22/1.34 % -------------------------------------------------
% 2.22/1.34 % User time : 0.638 s
% 2.22/1.34 % System time : 0.033 s
% 2.22/1.34 % Total time : 0.671 s
% 2.22/1.34 % Maximum resident set size: 15800 pages
% 2.22/1.34
% 2.22/1.34 % -------------------------------------------------
% 2.22/1.34 % User time : 0.644 s
% 2.22/1.34 % System time : 0.040 s
% 2.22/1.34 % Total time : 0.684 s
% 2.22/1.34 % Maximum resident set size: 4864 pages
% 2.22/1.34 % E exiting
%------------------------------------------------------------------------------