%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM564+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 : n007.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:35 PM UTC 2026
% Result : Theorem 0.25s 0.59s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 57 ( 24 unt; 0 def)
% Number of atoms : 186 ( 43 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 228 ( 99 ~; 88 |; 25 &)
% ( 5 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 60 ( 0 sgn 34 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mCountNFin,axiom,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> ~ isFinite0(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCountNFin) ).
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(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/sandbox/benchmark/theBenchmark.p',mDefSel) ).
fof(mSelNSet,axiom,
! [X1] :
( ( ~ isFinite0(X1)
& aSet0(X1) )
=> ! [X2] :
( aElementOf0(X2,szNzAzT0)
=> slbdtsldtrb0(X1,X2) != slcrc0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSelNSet) ).
fof(m__3435,hypothesis,
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
fof(m__3453,hypothesis,
( aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& aFunction0(xc) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3453) ).
fof(m__3462,hypothesis,
xK = sz00,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3462) ).
fof(mDomSet,axiom,
! [X1] :
( aFunction0(X1)
=> aSet0(szDzozmdt0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDomSet) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroNum) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( ~ ? [X2] : aElementOf0(X2,X1)
& aSet0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmp) ).
fof(m__,conjecture,
aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mCardEmpty,axiom,
! [X1] :
( aSet0(X1)
=> ( sbrdtbr0(X1) = sz00
<=> X1 = slcrc0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardEmpty) ).
fof(c_0_13,plain,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> ~ isFinite0(X1) ),
inference(fof_simplification,[status(thm)],[mCountNFin]) ).
fof(c_0_14,plain,
! [X18] :
( ~ isFinite0(X18)
| ~ isCountable0(X18)
| ~ aSet0(X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_15,plain,
! [X22,X23,X24,X25] :
( ( ~ aSet0(X22)
| aSubsetOf0(X25,X22)
| ~ aSet0(X25)
| ~ aElementOf0(esk3_2(X22,X25),X22) )
& ( ~ aSet0(X22)
| aSubsetOf0(X25,X22)
| ~ aSet0(X25)
| aElementOf0(esk3_2(X22,X25),X25) )
& ( ~ aSet0(X22)
| ~ aSubsetOf0(X23,X22)
| aElementOf0(X24,X22)
| ~ aElementOf0(X24,X23) )
& ( ~ aSet0(X22)
| ~ aSubsetOf0(X23,X22)
| aSet0(X23) ) ),
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_16,plain,
! [X51,X52,X53,X54,X55,X56] :
( ( ~ aElementOf0(X52,szNzAzT0)
| ~ aSet0(X51)
| X56 = slbdtsldtrb0(X51,X52)
| ~ aSet0(X56)
| aElementOf0(esk9_3(X51,X52,X56),X56)
| sbrdtbr0(esk9_3(X51,X52,X56)) = X52 )
& ( ~ aElementOf0(X52,szNzAzT0)
| ~ aSet0(X51)
| X56 = slbdtsldtrb0(X51,X52)
| ~ aSet0(X56)
| aElementOf0(esk9_3(X51,X52,X56),X56)
| aSubsetOf0(esk9_3(X51,X52,X56),X51) )
& ( ~ aElementOf0(X52,szNzAzT0)
| ~ aSet0(X51)
| X56 = slbdtsldtrb0(X51,X52)
| ~ aSet0(X56)
| sbrdtbr0(esk9_3(X51,X52,X56)) != X52
| ~ aSubsetOf0(esk9_3(X51,X52,X56),X51)
| ~ aElementOf0(esk9_3(X51,X52,X56),X56) )
& ( ~ aElementOf0(X52,szNzAzT0)
| ~ aSet0(X51)
| X53 != slbdtsldtrb0(X51,X52)
| aElementOf0(X55,X53)
| sbrdtbr0(X55) != X52
| ~ aSubsetOf0(X55,X51) )
& ( ~ aElementOf0(X52,szNzAzT0)
| ~ aSet0(X51)
| X53 != slbdtsldtrb0(X51,X52)
| ~ aElementOf0(X54,X53)
| sbrdtbr0(X54) = X52 )
& ( ~ aElementOf0(X52,szNzAzT0)
| ~ aSet0(X51)
| X53 != slbdtsldtrb0(X51,X52)
| ~ aElementOf0(X54,X53)
| aSubsetOf0(X54,X51) )
& ( ~ aElementOf0(X52,szNzAzT0)
| ~ aSet0(X51)
| X53 != slbdtsldtrb0(X51,X52)
| aSet0(X53) ) ),
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_17,plain,
! [X1] :
( ( ~ isFinite0(X1)
& aSet0(X1) )
=> ! [X2] :
( aElementOf0(X2,szNzAzT0)
=> slbdtsldtrb0(X1,X2) != slcrc0 ) ),
inference(fof_simplification,[status(thm)],[mSelNSet]) ).
cnf(c_0_18,plain,
( ~ isFinite0(X1)
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,hypothesis,
isCountable0(xS),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_20,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_22,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_23,plain,
( ~ aElementOf0(X4,szNzAzT0)
| ~ aSet0(X2)
| X3 != slbdtsldtrb0(X2,X4)
| ~ aElementOf0(X1,X3)
| aSubsetOf0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,hypothesis,
szDzozmdt0(xc) = slbdtsldtrb0(xS,xK),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_25,hypothesis,
xK = sz00,
inference(split_conjunct,[status(thm)],[m__3462]) ).
fof(c_0_26,plain,
! [X50] :
( aSet0(szDzozmdt0(X50))
| ~ aFunction0(X50) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDomSet])])]) ).
fof(c_0_27,plain,
! [X60,X61] :
( slbdtsldtrb0(X60,X61) != slcrc0
| ~ aElementOf0(X61,szNzAzT0)
| isFinite0(X60)
| ~ aSet0(X60) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
cnf(c_0_28,hypothesis,
( ~ aSet0(xS)
| ~ isFinite0(xS) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_29,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_30,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X4)
| X3 != slbdtsldtrb0(X4,X2)
| ~ aElementOf0(X1,X3)
| sbrdtbr0(X1) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_31,plain,
( ~ aSet0(X2)
| ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X1,slbdtsldtrb0(X2,X3))
| aSubsetOf0(X1,X2) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_32,hypothesis,
slbdtsldtrb0(xS,sz00) = szDzozmdt0(xc),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
fof(c_0_34,plain,
! [X81,X82,X83] :
( ( X83 = slcrc0
| aElementOf0(esk12_1(X83),X83)
| ~ aSet0(X83) )
& ( X81 != slcrc0
| ~ aElementOf0(X82,X81) )
& ( X81 != slcrc0
| aSet0(X81) ) ),
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_35,plain,
( ~ aFunction0(X1)
| aSet0(szDzozmdt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,hypothesis,
aFunction0(xc),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_37,plain,
( slbdtsldtrb0(X1,X2) != slcrc0
| ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X1)
| isFinite0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,hypothesis,
~ isFinite0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
fof(c_0_39,negated_conjecture,
~ aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_40,plain,
! [X80] :
( ( ~ aSet0(X80)
| sbrdtbr0(X80) = sz00
| X80 != slcrc0 )
& ( ~ aSet0(X80)
| X80 = slcrc0
| sbrdtbr0(X80) != sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardEmpty])])])]) ).
cnf(c_0_41,plain,
( ~ aSet0(X3)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
| sbrdtbr0(X1) = X2 ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_42,hypothesis,
( ~ aElementOf0(X1,szDzozmdt0(xc))
| aSubsetOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_29])]) ).
cnf(c_0_43,plain,
( ~ aSet0(X1)
| X1 = slcrc0
| aElementOf0(esk12_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_44,hypothesis,
aSet0(szDzozmdt0(xc)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_45,hypothesis,
szDzozmdt0(xc) != slcrc0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_32]),c_0_33]),c_0_29])]),c_0_38]) ).
fof(c_0_46,negated_conjecture,
~ aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
inference(fof_simplification,[status(thm)],[c_0_39]) ).
cnf(c_0_47,plain,
( ~ aSet0(X1)
| sbrdtbr0(X1) != sz00
| X1 = slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_48,hypothesis,
( ~ aElementOf0(X1,szDzozmdt0(xc))
| sbrdtbr0(X1) = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_32]),c_0_33]),c_0_29])]) ).
cnf(c_0_49,hypothesis,
aSubsetOf0(esk12_1(szDzozmdt0(xc)),xS),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),c_0_45]) ).
fof(c_0_50,negated_conjecture,
~ aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
inference(fof_nnf,[status(thm)],[c_0_46]) ).
cnf(c_0_51,hypothesis,
( ~ aSet0(X1)
| ~ aElementOf0(X1,szDzozmdt0(xc))
| X1 = slcrc0 ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,hypothesis,
aSet0(esk12_1(szDzozmdt0(xc))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_49]),c_0_29])]) ).
cnf(c_0_53,negated_conjecture,
~ aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_54,hypothesis,
esk12_1(szDzozmdt0(xc)) = slcrc0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_43]),c_0_52]),c_0_44])]),c_0_45]) ).
cnf(c_0_55,negated_conjecture,
~ aElementOf0(slcrc0,szDzozmdt0(xc)),
inference(rw,[status(thm)],[c_0_53,c_0_32]) ).
cnf(c_0_56,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_54]),c_0_44])]),c_0_45]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM564+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n007.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 02:38:05 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.51 Running first-order theorem proving
% 0.25/0.51 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.25/0.59 % Version: 3.5.1
% 0.25/0.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.59 % Starting sh5l with 300s (1) cores
% 0.25/0.59 % new_bool_3 with pid 4184419 completed with status 0
% 0.25/0.59 % Result found by new_bool_3
% 0.25/0.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.59 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.25/0.59 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.59 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.59 % SubtermCWHack with pid 4184422 completed with status 0
% 0.25/0.59 % Result found by SubtermCWHack
% 0.25/0.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.59 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.25/0.59 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.59 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.59 % Preprocessing time : 0.004 s
% 0.25/0.59
% 0.25/0.59 % Proof found!
% 0.25/0.59 % SZS status Theorem
% 0.25/0.59 % SZS output start CNFRefutation
% See solution above
% 0.25/0.59 % Parsed axioms : 79
% 0.25/0.59 % Removed by relevancy pruning/SinE : 7
% 0.25/0.59 % Initial clauses : 134
% 0.25/0.59 % Removed in clause preprocessing : 7
% 0.25/0.59 % Initial clauses in saturation : 127
% 0.25/0.59 % Processed clauses : 381
% 0.25/0.59 % ...of these trivial : 1
% 0.25/0.59 % ...subsumed : 142
% 0.25/0.59 % ...remaining for further processing : 238
% 0.25/0.59 % Other redundant clauses eliminated : 31
% 0.25/0.59 % Clauses deleted for lack of memory : 0
% 0.25/0.59 % Backward-subsumed : 5
% 0.25/0.59 % Backward-rewritten : 19
% 0.25/0.59 % Generated clauses : 629
% 0.25/0.59 % ...of the previous two non-redundant : 534
% 0.25/0.59 % ...aggressively subsumed : 0
% 0.25/0.59 % Contextual simplify-reflections : 20
% 0.25/0.59 % Paramodulations : 600
% 0.25/0.59 % Factorizations : 0
% 0.25/0.59 % NegExts : 0
% 0.25/0.59 % Equation resolutions : 32
% 0.25/0.59 % Disequality decompositions : 0
% 0.25/0.59 % Total rewrite steps : 405
% 0.25/0.59 % ...of those cached : 378
% 0.25/0.59 % Propositional unsat checks : 0
% 0.25/0.59 % Propositional check models : 0
% 0.25/0.59 % Propositional check unsatisfiable : 0
% 0.25/0.59 % Propositional clauses : 0
% 0.25/0.59 % Propositional clauses after purity: 0
% 0.25/0.59 % Propositional unsat core size : 0
% 0.25/0.59 % Propositional preprocessing time : 0.000
% 0.25/0.59 % Propositional encoding time : 0.000
% 0.25/0.59 % Propositional solver time : 0.000
% 0.25/0.59 % Success case prop preproc time : 0.000
% 0.25/0.59 % Success case prop encoding time : 0.000
% 0.25/0.59 % Success case prop solver time : 0.000
% 0.25/0.59 % Current number of processed clauses : 190
% 0.25/0.59 % Positive orientable unit clauses : 26
% 0.25/0.59 % Positive unorientable unit clauses: 0
% 0.25/0.59 % Negative unit clauses : 8
% 0.25/0.59 % Non-unit-clauses : 156
% 0.25/0.59 % Current number of unprocessed clauses: 272
% 0.25/0.59 % ...number of literals in the above : 1492
% 0.25/0.59 % Current number of archived formulas : 0
% 0.25/0.59 % Current number of archived clauses : 24
% 0.25/0.59 % Clause-clause subsumption calls (NU) : 4743
% 0.25/0.59 % Rec. Clause-clause subsumption calls : 2357
% 0.25/0.59 % Non-unit clause-clause subsumptions : 129
% 0.25/0.59 % Unit Clause-clause subsumption calls : 257
% 0.25/0.59 % Rewrite failures with RHS unbound : 0
% 0.25/0.59 % BW rewrite match attempts : 5
% 0.25/0.59 % BW rewrite match successes : 5
% 0.25/0.59 % Condensation attempts : 0
% 0.25/0.59 % Condensation successes : 0
% 0.25/0.59 % Termbank termtop insertions : 20994
% 0.25/0.59 % Search garbage collected termcells : 2808
% 0.25/0.59
% 0.25/0.59 % -------------------------------------------------
% 0.25/0.59 % User time : 0.047 s
% 0.25/0.59 % System time : 0.005 s
% 0.25/0.59 % Total time : 0.052 s
% 0.25/0.59 % Maximum resident set size: 3988 pages
% 0.25/0.59
% 0.25/0.59 % -------------------------------------------------
% 0.25/0.59 % User time : 0.054 s
% 0.25/0.59 % System time : 0.011 s
% 0.25/0.59 % Total time : 0.064 s
% 0.25/0.59 % Maximum resident set size: 4864 pages
% 0.25/0.59 % E exiting
%------------------------------------------------------------------------------