%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM612+3 : 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 : n005.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.15s 5.86s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 57 ( 18 unt; 0 def)
% Number of atoms : 172 ( 31 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 179 ( 64 ~; 55 |; 37 &)
% ( 3 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn 36 !; 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/sandbox/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/sandbox/benchmark/theBenchmark.p',m__5147) ).
fof(mSubFSet,axiom,
! [X1] :
( ( isFinite0(X1)
& aSet0(X1) )
=> ! [X2] :
( aSubsetOf0(X2,X1)
=> isFinite0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubFSet) ).
fof(m__5195,hypothesis,
( aSubsetOf0(xP,xQ)
& ! [X1] :
( aElementOf0(X1,xP)
=> aElementOf0(X1,xQ) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',m__5078) ).
fof(mConsDiff,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> sdtpldt0(sdtmndt0(X1,X2),X2) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mConsDiff) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(mCardNum,axiom,
! [X1] :
( aSet0(X1)
=> ( aElementOf0(sbrdtbr0(X1),szNzAzT0)
<=> isFinite0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardNum) ).
fof(m__,conjecture,
( aElementOf0(sbrdtbr0(xP),szNzAzT0)
& szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mFConsSet,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( ( isFinite0(X2)
& aSet0(X2) )
=> isFinite0(sdtpldt0(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mFConsSet) ).
fof(m__3418,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3418) ).
fof(mCardCons,axiom,
! [X1] :
( ( isFinite0(X1)
& aSet0(X1) )
=> ! [X2] :
( aElement0(X2)
=> ( ~ aElementOf0(X2,X1)
=> sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardCons) ).
fof(c_0_12,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_13,hypothesis,
! [X262,X263] :
( xP = sdtmndt0(xQ,szmzizndt0(xQ))
& ( aElementOf0(X263,xP)
| X263 = szmzizndt0(xQ)
| ~ aElementOf0(X263,xQ)
| ~ aElement0(X263) )
& ( ~ aElementOf0(X263,xP)
| X263 != szmzizndt0(xQ) )
& ( ~ aElementOf0(X263,xP)
| aElementOf0(X263,xQ) )
& ( ~ aElementOf0(X263,xP)
| aElement0(X263) )
& ( sdtlseqdt0(szmzizndt0(xQ),X262)
| ~ aElementOf0(X262,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_12])])])])]) ).
fof(c_0_14,hypothesis,
! [X261] :
( xp = szmzizndt0(xQ)
& ( sdtlseqdt0(xp,X261)
| ~ aElementOf0(X261,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_15,plain,
! [X25,X26] :
( isFinite0(X26)
| ~ aSubsetOf0(X26,X25)
| ~ isFinite0(X25)
| ~ aSet0(X25) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubFSet])])])]) ).
fof(c_0_16,hypothesis,
! [X265] :
( aSubsetOf0(xP,xQ)
& ( aElementOf0(X265,xQ)
| ~ aElementOf0(X265,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_17,hypothesis,
! [X255] :
( aElementOf0(xQ,slbdtsldtrb0(xO,xK))
& sbrdtbr0(xQ) = xK
& aSubsetOf0(xQ,xO)
& ( aElementOf0(X255,xO)
| ~ aElementOf0(X255,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_18,plain,
! [X47,X48] :
( sdtpldt0(sdtmndt0(X47,X48),X48) = X47
| ~ aElementOf0(X48,X47)
| ~ aSet0(X47) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mConsDiff])])])]) ).
cnf(c_0_19,hypothesis,
xP = sdtmndt0(xQ,szmzizndt0(xQ)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,hypothesis,
xp = szmzizndt0(xQ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_21,plain,
! [X10,X11] :
( aElement0(X11)
| ~ aElementOf0(X11,X10)
| ~ aSet0(X10) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_22,plain,
! [X84] :
( ( ~ aSet0(X84)
| aElementOf0(sbrdtbr0(X84),szNzAzT0)
| ~ isFinite0(X84) )
& ( ~ aSet0(X84)
| isFinite0(X84)
| ~ aElementOf0(sbrdtbr0(X84),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardNum])])])]) ).
cnf(c_0_23,plain,
( ~ aSubsetOf0(X2,X1)
| ~ isFinite0(X1)
| ~ aSet0(X1)
| isFinite0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,hypothesis,
aSubsetOf0(xP,xQ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,hypothesis,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_26,negated_conjecture,
~ ( aElementOf0(sbrdtbr0(xP),szNzAzT0)
& szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_27,plain,
! [X55,X56] :
( isFinite0(sdtpldt0(X56,X55))
| ~ isFinite0(X56)
| ~ aSet0(X56)
| ~ aElement0(X55) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mFConsSet])])])]) ).
cnf(c_0_28,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| sdtpldt0(sdtmndt0(X1,X2),X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,hypothesis,
sdtmndt0(xQ,xp) = xP,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_30,hypothesis,
aElementOf0(xp,xQ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_31,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,plain,
( ~ aSet0(X1)
| ~ isFinite0(X1)
| aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,hypothesis,
( ~ isFinite0(xQ)
| isFinite0(xP) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_34,hypothesis,
aSet0(xP),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_35,negated_conjecture,
( ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| szszuzczcdt0(sbrdtbr0(xP)) != sbrdtbr0(xQ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])]) ).
cnf(c_0_36,plain,
( ~ isFinite0(X2)
| ~ aSet0(X2)
| ~ aElement0(X1)
| isFinite0(sdtpldt0(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
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_28,c_0_29]),c_0_30]),c_0_25])]) ).
cnf(c_0_38,hypothesis,
aElement0(xp),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_30]),c_0_25])]) ).
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_32,c_0_33]),c_0_34])]) ).
cnf(c_0_40,plain,
( ~ aSet0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| isFinite0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_41,hypothesis,
sbrdtbr0(xQ) = xK,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_42,hypothesis,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3418]) ).
cnf(c_0_43,negated_conjecture,
( ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| szszuzczcdt0(sbrdtbr0(xP)) != sbrdtbr0(xQ) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_44,plain,
! [X1] :
( ( isFinite0(X1)
& aSet0(X1) )
=> ! [X2] :
( aElement0(X2)
=> ( ~ aElementOf0(X2,X1)
=> sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1)) ) ) ),
inference(fof_simplification,[status(thm)],[mCardCons]) ).
cnf(c_0_45,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_34])]) ).
cnf(c_0_46,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_25])]) ).
cnf(c_0_47,negated_conjecture,
( ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| szszuzczcdt0(sbrdtbr0(xP)) != xK ),
inference(rw,[status(thm)],[c_0_43,c_0_41]) ).
fof(c_0_48,plain,
! [X86,X87] :
( sbrdtbr0(sdtpldt0(X86,X87)) = szszuzczcdt0(sbrdtbr0(X86))
| aElementOf0(X87,X86)
| ~ aElement0(X87)
| ~ isFinite0(X86)
| ~ aSet0(X86) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_44])])])]) ).
cnf(c_0_49,hypothesis,
isFinite0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_40]),c_0_46]),c_0_34])]) ).
cnf(c_0_50,negated_conjecture,
szszuzczcdt0(sbrdtbr0(xP)) != xK,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_46])]) ).
cnf(c_0_51,plain,
( ~ aElement0(X2)
| ~ isFinite0(X1)
| ~ aSet0(X1)
| sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1))
| aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_52,hypothesis,
isFinite0(xP),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_49])]) ).
cnf(c_0_53,hypothesis,
( ~ aElementOf0(X1,xP)
| X1 != szmzizndt0(xQ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_54,negated_conjecture,
( ~ aElement0(X1)
| sbrdtbr0(sdtpldt0(xP,X1)) != xK
| aElementOf0(X1,xP) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_34])]) ).
cnf(c_0_55,hypothesis,
~ aElementOf0(xp,xP),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_20])]) ).
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_37]),c_0_41]),c_0_38])]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM612+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.39 % Computer : n005.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Mon Sep 21 02:44:38 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.40 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.44 Running first-order theorem proving
% 0.15/5.44 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.15/5.86 % Version: 3.5.1
% 0.15/5.86 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.86 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.86 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.86 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.86 % Starting sh5l with 300s (1) cores
% 0.15/5.86 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2383383 completed with status 0
% 0.15/5.86 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/5.86 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.86 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.86 % No SInE strategy applied
% 0.15/5.86 % Search class: FGHSF-SMLM32-MFFFFFNN
% 0.15/5.86 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.86 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.86 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/5.86 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.15/5.86 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.15/5.86 % Starting new_bool_3 with 136s (1) cores
% 0.15/5.86 % SubtermCWHack with pid 2383390 completed with status 0
% 0.15/5.86 % Result found by SubtermCWHack
% 0.15/5.86 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.86 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.86 % No SInE strategy applied
% 0.15/5.86 % Search class: FGHSF-SMLM32-MFFFFFNN
% 0.15/5.86 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.86 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.86 % Preprocessing time : 0.061 s
% 0.15/5.86
% 0.15/5.86 % Proof found!
% 0.15/5.86 % SZS status Theorem
% 0.15/5.86 % SZS output start CNFRefutation
% See solution above
% 0.15/5.86 % Parsed axioms : 109
% 0.15/5.86 % Removed by relevancy pruning/SinE : 0
% 0.15/5.86 % Initial clauses : 4909
% 0.15/5.86 % Removed in clause preprocessing : 7
% 0.15/5.86 % Initial clauses in saturation : 4902
% 0.15/5.86 % Processed clauses : 917
% 0.15/5.86 % ...of these trivial : 22
% 0.15/5.86 % ...subsumed : 265
% 0.15/5.86 % ...remaining for further processing : 630
% 0.15/5.86 % Other redundant clauses eliminated : 45
% 0.15/5.86 % Clauses deleted for lack of memory : 0
% 0.15/5.86 % Backward-subsumed : 17
% 0.15/5.86 % Backward-rewritten : 34
% 0.15/5.86 % Generated clauses : 1939
% 0.15/5.86 % ...of the previous two non-redundant : 1597
% 0.15/5.86 % ...aggressively subsumed : 0
% 0.15/5.86 % Contextual simplify-reflections : 14
% 0.15/5.86 % Paramodulations : 1894
% 0.15/5.86 % Factorizations : 0
% 0.15/5.86 % NegExts : 0
% 0.15/5.86 % Equation resolutions : 46
% 0.15/5.86 % Disequality decompositions : 0
% 0.15/5.86 % Total rewrite steps : 1305
% 0.15/5.86 % ...of those cached : 1199
% 0.15/5.86 % Propositional unsat checks : 0
% 0.15/5.86 % Propositional check models : 0
% 0.15/5.86 % Propositional check unsatisfiable : 0
% 0.15/5.86 % Propositional clauses : 0
% 0.15/5.86 % Propositional clauses after purity: 0
% 0.15/5.86 % Propositional unsat core size : 0
% 0.15/5.86 % Propositional preprocessing time : 0.000
% 0.15/5.86 % Propositional encoding time : 0.000
% 0.15/5.86 % Propositional solver time : 0.000
% 0.15/5.86 % Success case prop preproc time : 0.000
% 0.15/5.86 % Success case prop encoding time : 0.000
% 0.15/5.86 % Success case prop solver time : 0.000
% 0.15/5.86 % Current number of processed clauses : 540
% 0.15/5.86 % Positive orientable unit clauses : 121
% 0.15/5.86 % Positive unorientable unit clauses: 0
% 0.15/5.86 % Negative unit clauses : 28
% 0.15/5.86 % Non-unit-clauses : 391
% 0.15/5.86 % Current number of unprocessed clauses: 5251
% 0.15/5.86 % ...number of literals in the above : 57904
% 0.15/5.86 % Current number of archived formulas : 0
% 0.15/5.86 % Current number of archived clauses : 53
% 0.15/5.86 % Clause-clause subsumption calls (NU) : 26714
% 0.15/5.86 % Rec. Clause-clause subsumption calls : 18690
% 0.15/5.86 % Non-unit clause-clause subsumptions : 203
% 0.15/5.86 % Unit Clause-clause subsumption calls : 3073
% 0.15/5.86 % Rewrite failures with RHS unbound : 0
% 0.15/5.86 % BW rewrite match attempts : 24
% 0.15/5.86 % BW rewrite match successes : 22
% 0.15/5.86 % Condensation attempts : 0
% 0.15/5.86 % Condensation successes : 0
% 0.15/5.86 % Termbank termtop insertions : 406493
% 0.15/5.86 % Search garbage collected termcells : 32023
% 0.15/5.86
% 0.15/5.86 % -------------------------------------------------
% 0.15/5.86 % User time : 0.359 s
% 0.15/5.86 % System time : 0.034 s
% 0.15/5.86 % Total time : 0.392 s
% 0.15/5.86 % Maximum resident set size: 15852 pages
% 0.15/5.86
% 0.15/5.86 % -------------------------------------------------
% 0.15/5.86 % User time : 0.742 s
% 0.15/5.86 % System time : 0.081 s
% 0.15/5.86 % Total time : 0.823 s
% 0.15/5.86 % Maximum resident set size: 4864 pages
% 0.15/5.86 % E exiting
%------------------------------------------------------------------------------