%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM566+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 : n017.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.28s 0.46s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 63 ( 19 unt; 0 def)
% Number of atoms : 169 ( 23 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 187 ( 81 ~; 66 |; 23 &)
% ( 2 <=>; 15 =>; 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 : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 65 ( 1 sgn 34 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mCountNFin,axiom,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> ~ isFinite0(X1) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
fof(m__3453,hypothesis,
( aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& aFunction0(xc) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3453) ).
fof(m__3291,hypothesis,
( isFinite0(xT)
& aSet0(xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3291) ).
fof(mImgRng,axiom,
! [X1] :
( aFunction0(X1)
=> ! [X2] :
( aElementOf0(X2,szDzozmdt0(X1))
=> aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mImgRng) ).
fof(m__3507,hypothesis,
! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xS,sz00))
=> sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3507) ).
fof(m__3462,hypothesis,
xK = sz00,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3462) ).
fof(mSelNSet,axiom,
! [X1] :
( ( ~ isFinite0(X1)
& aSet0(X1) )
=> ! [X2] :
( aElementOf0(X2,szNzAzT0)
=> slbdtsldtrb0(X1,X2) != slcrc0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSelNSet) ).
fof(m__3435,hypothesis,
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3435) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet) ).
fof(mDomSet,axiom,
! [X1] :
( aFunction0(X1)
=> aSet0(szDzozmdt0(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDomSet) ).
fof(m__,conjecture,
? [X1] :
( ? [X2] :
( ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> sdtlpdtrp0(xc,X3) = X1 )
& isCountable0(X2)
& aSubsetOf0(X2,xS) )
& aElementOf0(X1,xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( ~ ? [X2] : aElementOf0(X2,X1)
& aSet0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mZeroNum) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSubRefl) ).
fof(c_0_15,plain,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> ~ isFinite0(X1) ),
inference(fof_simplification,[status(thm)],[mCountNFin]) ).
fof(c_0_16,plain,
! [X26,X27,X28,X29] :
( ( ~ aSet0(X26)
| aSubsetOf0(X29,X26)
| ~ aSet0(X29)
| ~ aElementOf0(esk4_2(X26,X29),X26) )
& ( ~ aSet0(X26)
| aSubsetOf0(X29,X26)
| ~ aSet0(X29)
| aElementOf0(esk4_2(X26,X29),X29) )
& ( ~ aSet0(X26)
| ~ aSubsetOf0(X27,X26)
| aElementOf0(X28,X26)
| ~ aElementOf0(X28,X27) )
& ( ~ aSet0(X26)
| ~ aSubsetOf0(X27,X26)
| aSet0(X27) ) ),
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_17,plain,
! [X22] :
( ~ isFinite0(X22)
| ~ isCountable0(X22)
| ~ aSet0(X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_18,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,hypothesis,
aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_20,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[m__3291]) ).
fof(c_0_21,plain,
! [X48,X49] :
( aElementOf0(sdtlpdtrp0(X48,X49),sdtlcdtrc0(X48,szDzozmdt0(X48)))
| ~ aElementOf0(X49,szDzozmdt0(X48))
| ~ aFunction0(X48) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mImgRng])])])]) ).
fof(c_0_22,hypothesis,
! [X13] :
( sdtlpdtrp0(xc,X13) = sdtlpdtrp0(xc,slcrc0)
| ~ aElementOf0(X13,slbdtsldtrb0(xS,sz00)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3507])])]) ).
cnf(c_0_23,hypothesis,
szDzozmdt0(xc) = slbdtsldtrb0(xS,xK),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_24,hypothesis,
xK = sz00,
inference(split_conjunct,[status(thm)],[m__3462]) ).
fof(c_0_25,plain,
! [X1] :
( ( ~ isFinite0(X1)
& aSet0(X1) )
=> ! [X2] :
( aElementOf0(X2,szNzAzT0)
=> slbdtsldtrb0(X1,X2) != slcrc0 ) ),
inference(fof_simplification,[status(thm)],[mSelNSet]) ).
cnf(c_0_26,plain,
( ~ isFinite0(X1)
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,hypothesis,
isCountable0(xS),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_28,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_30,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_31,hypothesis,
( ~ aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))
| aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_32,plain,
( ~ aElementOf0(X2,szDzozmdt0(X1))
| ~ aFunction0(X1)
| aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_33,hypothesis,
aFunction0(xc),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_34,hypothesis,
( ~ aElementOf0(X1,slbdtsldtrb0(xS,sz00))
| sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_35,hypothesis,
slbdtsldtrb0(xS,sz00) = szDzozmdt0(xc),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_36,plain,
! [X54] :
( aSet0(szDzozmdt0(X54))
| ~ aFunction0(X54) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDomSet])])]) ).
fof(c_0_37,plain,
! [X66,X67] :
( slbdtsldtrb0(X66,X67) != slcrc0
| ~ aElementOf0(X67,szNzAzT0)
| isFinite0(X66)
| ~ aSet0(X66) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
cnf(c_0_38,hypothesis,
( ~ aSet0(xS)
| ~ isFinite0(xS) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_39,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
fof(c_0_40,negated_conjecture,
~ ? [X1] :
( ? [X2] :
( ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> sdtlpdtrp0(xc,X3) = X1 )
& isCountable0(X2)
& aSubsetOf0(X2,xS) )
& aElementOf0(X1,xT) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_41,hypothesis,
( ~ aElementOf0(X1,szDzozmdt0(xc))
| aElementOf0(sdtlpdtrp0(xc,X1),xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_42,hypothesis,
( ~ aElementOf0(X1,szDzozmdt0(xc))
| sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0) ),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_43,plain,
! [X85,X86,X87] :
( ( X87 = slcrc0
| aElementOf0(esk13_1(X87),X87)
| ~ aSet0(X87) )
& ( X85 != slcrc0
| ~ aElementOf0(X86,X85) )
& ( X85 != slcrc0
| aSet0(X85) ) ),
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_44,plain,
( ~ aFunction0(X1)
| aSet0(szDzozmdt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,plain,
( slbdtsldtrb0(X1,X2) != slcrc0
| ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X1)
| isFinite0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_46,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_47,hypothesis,
~ isFinite0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
fof(c_0_48,negated_conjecture,
! [X14,X15] :
( ( ~ aElementOf0(X14,xT)
| ~ isCountable0(X15)
| ~ aSubsetOf0(X15,xS)
| sdtlpdtrp0(xc,esk3_2(X14,X15)) != X14 )
& ( ~ aElementOf0(X14,xT)
| ~ isCountable0(X15)
| ~ aSubsetOf0(X15,xS)
| aElementOf0(esk3_2(X14,X15),slbdtsldtrb0(X15,xK)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])])])])]) ).
cnf(c_0_49,hypothesis,
( ~ aElementOf0(X1,szDzozmdt0(xc))
| aElementOf0(sdtlpdtrp0(xc,slcrc0),xT) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,plain,
( ~ aSet0(X1)
| X1 = slcrc0
| aElementOf0(esk13_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_51,hypothesis,
aSet0(szDzozmdt0(xc)),
inference(spm,[status(thm)],[c_0_44,c_0_33]) ).
cnf(c_0_52,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_45,c_0_35]),c_0_46]),c_0_39])]),c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS)
| aElementOf0(esk3_2(X1,X2),slbdtsldtrb0(X2,xK)) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_54,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS)
| sdtlpdtrp0(xc,esk3_2(X1,X2)) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_55,hypothesis,
aElementOf0(sdtlpdtrp0(xc,slcrc0),xT),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]),c_0_52]) ).
cnf(c_0_56,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS)
| aElementOf0(esk3_2(X1,X2),slbdtsldtrb0(X2,sz00)) ),
inference(rw,[status(thm)],[c_0_53,c_0_24]) ).
cnf(c_0_57,hypothesis,
( ~ aElementOf0(esk3_2(sdtlpdtrp0(xc,slcrc0),X1),szDzozmdt0(xc))
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_42])]),c_0_55])]) ).
cnf(c_0_58,hypothesis,
( ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(xS,xS)
| aElementOf0(esk3_2(X1,xS),szDzozmdt0(xc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_35]),c_0_27])]) ).
fof(c_0_59,plain,
! [X31] :
( aSubsetOf0(X31,X31)
| ~ aSet0(X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])])]) ).
cnf(c_0_60,hypothesis,
~ aSubsetOf0(xS,xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_27]),c_0_55])]) ).
cnf(c_0_61,plain,
( ~ aSet0(X1)
| aSubsetOf0(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_62,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM566+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n017.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 02:35:11 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/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.28/0.46 % Version: 3.5.1
% 0.28/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.46 % Starting sh5l with 300s (1) cores
% 0.28/0.46 % new_bool_3 with pid 1239587 completed with status 0
% 0.28/0.46 % Result found by new_bool_3
% 0.28/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.46 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.28/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.28/0.46 % SubtermCWHack with pid 1239592 completed with status 0
% 0.28/0.46 % Result found by SubtermCWHack
% 0.28/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.46 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.28/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.28/0.46 % Preprocessing time : 0.003 s
% 0.28/0.46
% 0.28/0.46 % Proof found!
% 0.28/0.46 % SZS status Theorem
% 0.28/0.46 % SZS output start CNFRefutation
% See solution above
% 0.28/0.46 % Parsed axioms : 81
% 0.28/0.46 % Removed by relevancy pruning/SinE : 7
% 0.28/0.46 % Initial clauses : 137
% 0.28/0.46 % Removed in clause preprocessing : 7
% 0.28/0.46 % Initial clauses in saturation : 130
% 0.28/0.46 % Processed clauses : 383
% 0.28/0.46 % ...of these trivial : 3
% 0.28/0.46 % ...subsumed : 142
% 0.28/0.46 % ...remaining for further processing : 238
% 0.28/0.46 % Other redundant clauses eliminated : 32
% 0.28/0.46 % Clauses deleted for lack of memory : 0
% 0.28/0.46 % Backward-subsumed : 9
% 0.28/0.46 % Backward-rewritten : 10
% 0.28/0.46 % Generated clauses : 634
% 0.28/0.46 % ...of the previous two non-redundant : 531
% 0.28/0.46 % ...aggressively subsumed : 0
% 0.28/0.46 % Contextual simplify-reflections : 12
% 0.28/0.46 % Paramodulations : 604
% 0.28/0.46 % Factorizations : 0
% 0.28/0.46 % NegExts : 0
% 0.28/0.46 % Equation resolutions : 33
% 0.28/0.46 % Disequality decompositions : 0
% 0.28/0.46 % Total rewrite steps : 409
% 0.28/0.46 % ...of those cached : 378
% 0.28/0.46 % Propositional unsat checks : 0
% 0.28/0.46 % Propositional check models : 0
% 0.28/0.46 % Propositional check unsatisfiable : 0
% 0.28/0.46 % Propositional clauses : 0
% 0.28/0.46 % Propositional clauses after purity: 0
% 0.28/0.46 % Propositional unsat core size : 0
% 0.28/0.46 % Propositional preprocessing time : 0.000
% 0.28/0.46 % Propositional encoding time : 0.000
% 0.28/0.46 % Propositional solver time : 0.000
% 0.28/0.46 % Success case prop preproc time : 0.000
% 0.28/0.46 % Success case prop encoding time : 0.000
% 0.28/0.46 % Success case prop solver time : 0.000
% 0.28/0.46 % Current number of processed clauses : 195
% 0.28/0.46 % Positive orientable unit clauses : 33
% 0.28/0.46 % Positive unorientable unit clauses: 0
% 0.28/0.46 % Negative unit clauses : 8
% 0.28/0.46 % Non-unit-clauses : 154
% 0.28/0.46 % Current number of unprocessed clauses: 270
% 0.28/0.46 % ...number of literals in the above : 1462
% 0.28/0.46 % Current number of archived formulas : 0
% 0.28/0.46 % Current number of archived clauses : 19
% 0.28/0.46 % Clause-clause subsumption calls (NU) : 4814
% 0.28/0.46 % Rec. Clause-clause subsumption calls : 2725
% 0.28/0.46 % Non-unit clause-clause subsumptions : 122
% 0.28/0.46 % Unit Clause-clause subsumption calls : 107
% 0.28/0.46 % Rewrite failures with RHS unbound : 0
% 0.28/0.46 % BW rewrite match attempts : 7
% 0.28/0.46 % BW rewrite match successes : 7
% 0.28/0.46 % Condensation attempts : 0
% 0.28/0.46 % Condensation successes : 0
% 0.28/0.46 % Termbank termtop insertions : 21182
% 0.28/0.46 % Search garbage collected termcells : 2886
% 0.28/0.46
% 0.28/0.46 % -------------------------------------------------
% 0.28/0.46 % User time : 0.026 s
% 0.28/0.46 % System time : 0.003 s
% 0.28/0.46 % Total time : 0.029 s
% 0.28/0.46 % Maximum resident set size: 3992 pages
% 0.28/0.46
% 0.28/0.46 % -------------------------------------------------
% 0.28/0.46 % User time : 0.029 s
% 0.28/0.46 % System time : 0.007 s
% 0.28/0.46 % Total time : 0.037 s
% 0.28/0.46 % Maximum resident set size: 4864 pages
% 0.28/0.46 % E exiting
%------------------------------------------------------------------------------