%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM545+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 : n014.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:30 PM UTC 2026
% Result : Theorem 0.13s 0.44s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 43 ( 12 unt; 0 def)
% Number of atoms : 138 ( 32 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 155 ( 60 ~; 57 |; 23 &)
% ( 4 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 27 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aSubsetOf0(xS,slbdtrb0(X1))
& aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__2035,hypothesis,
( xS != slcrc0
=> aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2035) ).
fof(mDefMax,axiom,
! [X1] :
( ( X1 != slcrc0
& isFinite0(X1)
& aSubsetOf0(X1,szNzAzT0) )
=> ! [X2] :
( X2 = szmzazxdt0(X1)
<=> ( ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X3,X2) )
& aElementOf0(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefMax) ).
fof(mSuccNum,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSuccNum) ).
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__1986,hypothesis,
( isFinite0(xS)
& aSubsetOf0(xS,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1986) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet) ).
fof(mSegZero,axiom,
slbdtrb0(sz00) = slcrc0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSegZero) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mZeroNum) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( ~ ? [X2] : aElementOf0(X2,X1)
& aSet0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSubRefl) ).
fof(c_0_11,negated_conjecture,
~ ? [X1] :
( aSubsetOf0(xS,slbdtrb0(X1))
& aElementOf0(X1,szNzAzT0) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_12,hypothesis,
( xS != slcrc0
=> aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ),
inference(fof_simplification,[status(thm)],[m__2035]) ).
fof(c_0_13,plain,
! [X1] :
( ( X1 != slcrc0
& isFinite0(X1)
& aSubsetOf0(X1,szNzAzT0) )
=> ! [X2] :
( X2 = szmzazxdt0(X1)
<=> ( ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X3,X2) )
& aElementOf0(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[mDefMax]) ).
fof(c_0_14,negated_conjecture,
! [X5] :
( ~ aSubsetOf0(xS,slbdtrb0(X5))
| ~ aElementOf0(X5,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_15,hypothesis,
( aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
| xS = slcrc0 ),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
inference(fof_simplification,[status(thm)],[mSuccNum]) ).
fof(c_0_17,plain,
! [X9,X10,X11,X12] :
( ( ~ aSet0(X9)
| aSubsetOf0(X12,X9)
| ~ aSet0(X12)
| ~ aElementOf0(esk1_2(X9,X12),X9) )
& ( ~ aSet0(X9)
| aSubsetOf0(X12,X9)
| ~ aSet0(X12)
| aElementOf0(esk1_2(X9,X12),X12) )
& ( ~ aSet0(X9)
| ~ aSubsetOf0(X10,X9)
| aElementOf0(X11,X9)
| ~ aElementOf0(X11,X10) )
& ( ~ aSet0(X9)
| ~ aSubsetOf0(X10,X9)
| aSet0(X10) ) ),
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,plain,
! [X39,X40,X41,X42] :
( ( X39 = slcrc0
| ~ isFinite0(X39)
| ~ aSubsetOf0(X39,szNzAzT0)
| X42 = szmzazxdt0(X39)
| ~ aElementOf0(X42,X39)
| ~ sdtlseqdt0(esk3_2(X39,X42),X42) )
& ( X39 = slcrc0
| ~ isFinite0(X39)
| ~ aSubsetOf0(X39,szNzAzT0)
| X42 = szmzazxdt0(X39)
| ~ aElementOf0(X42,X39)
| aElementOf0(esk3_2(X39,X42),X39) )
& ( X39 = slcrc0
| ~ isFinite0(X39)
| ~ aSubsetOf0(X39,szNzAzT0)
| X40 != szmzazxdt0(X39)
| sdtlseqdt0(X41,X40)
| ~ aElementOf0(X41,X39) )
& ( X39 = slcrc0
| ~ isFinite0(X39)
| ~ aSubsetOf0(X39,szNzAzT0)
| X40 != szmzazxdt0(X39)
| aElementOf0(X40,X39) ) ),
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)],[c_0_13])])])])])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ aSubsetOf0(xS,slbdtrb0(X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,hypothesis,
( aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
| xS = slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X59] :
( ( ~ aElementOf0(X59,szNzAzT0)
| szszuzczcdt0(X59) != sz00 )
& ( ~ aElementOf0(X59,szNzAzT0)
| aElementOf0(szszuzczcdt0(X59),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
cnf(c_0_22,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__1986]) ).
cnf(c_0_24,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_25,plain,
( ~ isFinite0(X2)
| ~ aSubsetOf0(X2,szNzAzT0)
| X1 != szmzazxdt0(X2)
| X2 = slcrc0
| aElementOf0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( ~ aElementOf0(szszuzczcdt0(szmzazxdt0(xS)),szNzAzT0)
| xS = slcrc0 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(szszuzczcdt0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
slbdtrb0(sz00) = slcrc0,
inference(split_conjunct,[status(thm)],[mSegZero]) ).
cnf(c_0_29,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_30,hypothesis,
( ~ aElementOf0(X1,xS)
| aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_31,plain,
( ~ isFinite0(X1)
| ~ aSubsetOf0(X1,szNzAzT0)
| aElementOf0(szmzazxdt0(X1),X1)
| X1 = slcrc0 ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_32,hypothesis,
isFinite0(xS),
inference(split_conjunct,[status(thm)],[m__1986]) ).
cnf(c_0_33,negated_conjecture,
( ~ aElementOf0(szmzazxdt0(xS),szNzAzT0)
| xS = slcrc0 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_34,plain,
! [X44,X45,X46] :
( ( X46 = slcrc0
| aElementOf0(esk4_1(X46),X46)
| ~ aSet0(X46) )
& ( X44 != slcrc0
| ~ aElementOf0(X45,X44) )
& ( X44 != slcrc0
| aSet0(X44) ) ),
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,negated_conjecture,
~ aSubsetOf0(xS,slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_28]),c_0_29])]) ).
cnf(c_0_36,hypothesis,
xS = slcrc0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_23]),c_0_32])]),c_0_33]) ).
fof(c_0_37,plain,
! [X14] :
( aSubsetOf0(X14,X14)
| ~ aSet0(X14) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])])]) ).
cnf(c_0_38,plain,
( X1 != slcrc0
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,negated_conjecture,
~ aSubsetOf0(slcrc0,slcrc0),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( ~ aSet0(X1)
| aSubsetOf0(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM545+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.36 % Computer : n014.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 02:39:04 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/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.13/0.44 % Version: 3.5.1
% 0.13/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.44 % Starting sh5l with 300s (1) cores
% 0.13/0.44 % new_bool_1 with pid 2968576 completed with status 0
% 0.13/0.44 % Result found by new_bool_1
% 0.13/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.44 % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.13/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.44 % SubtermCWHack with pid 2968578 completed with status 0
% 0.13/0.44 % Result found by SubtermCWHack
% 0.13/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.44 % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.13/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.44 % Preprocessing time : 0.002 s
% 0.13/0.44
% 0.13/0.44 % Proof found!
% 0.13/0.44 % SZS status Theorem
% 0.13/0.44 % SZS output start CNFRefutation
% See solution above
% 0.13/0.44 % Parsed axioms : 57
% 0.13/0.44 % Removed by relevancy pruning/SinE : 4
% 0.13/0.44 % Initial clauses : 94
% 0.13/0.44 % Removed in clause preprocessing : 5
% 0.13/0.44 % Initial clauses in saturation : 89
% 0.13/0.44 % Processed clauses : 81
% 0.13/0.44 % ...of these trivial : 0
% 0.13/0.44 % ...subsumed : 3
% 0.13/0.44 % ...remaining for further processing : 78
% 0.13/0.44 % Other redundant clauses eliminated : 10
% 0.13/0.44 % Clauses deleted for lack of memory : 0
% 0.13/0.44 % Backward-subsumed : 0
% 0.13/0.44 % Backward-rewritten : 14
% 0.13/0.44 % Generated clauses : 68
% 0.13/0.44 % ...of the previous two non-redundant : 50
% 0.13/0.44 % ...aggressively subsumed : 0
% 0.13/0.44 % Contextual simplify-reflections : 2
% 0.13/0.44 % Paramodulations : 57
% 0.13/0.44 % Factorizations : 0
% 0.13/0.44 % NegExts : 0
% 0.13/0.44 % Equation resolutions : 11
% 0.13/0.44 % Disequality decompositions : 0
% 0.13/0.44 % Total rewrite steps : 69
% 0.13/0.44 % ...of those cached : 59
% 0.13/0.44 % Propositional unsat checks : 0
% 0.13/0.44 % Propositional check models : 0
% 0.13/0.44 % Propositional check unsatisfiable : 0
% 0.13/0.44 % Propositional clauses : 0
% 0.13/0.44 % Propositional clauses after purity: 0
% 0.13/0.44 % Propositional unsat core size : 0
% 0.13/0.44 % Propositional preprocessing time : 0.000
% 0.13/0.44 % Propositional encoding time : 0.000
% 0.13/0.44 % Propositional solver time : 0.000
% 0.13/0.44 % Success case prop preproc time : 0.000
% 0.13/0.44 % Success case prop encoding time : 0.000
% 0.13/0.44 % Success case prop solver time : 0.000
% 0.13/0.44 % Current number of processed clauses : 56
% 0.13/0.44 % Positive orientable unit clauses : 10
% 0.13/0.44 % Positive unorientable unit clauses: 0
% 0.13/0.44 % Negative unit clauses : 4
% 0.13/0.44 % Non-unit-clauses : 42
% 0.13/0.44 % Current number of unprocessed clauses: 58
% 0.13/0.44 % ...number of literals in the above : 287
% 0.13/0.44 % Current number of archived formulas : 0
% 0.13/0.44 % Current number of archived clauses : 14
% 0.13/0.44 % Clause-clause subsumption calls (NU) : 366
% 0.13/0.44 % Rec. Clause-clause subsumption calls : 249
% 0.13/0.44 % Non-unit clause-clause subsumptions : 4
% 0.13/0.44 % Unit Clause-clause subsumption calls : 31
% 0.13/0.44 % Rewrite failures with RHS unbound : 0
% 0.13/0.44 % BW rewrite match attempts : 2
% 0.13/0.44 % BW rewrite match successes : 2
% 0.13/0.44 % Condensation attempts : 0
% 0.13/0.44 % Condensation successes : 0
% 0.13/0.44 % Termbank termtop insertions : 8716
% 0.13/0.44 % Search garbage collected termcells : 1842
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.008 s
% 0.13/0.44 % System time : 0.005 s
% 0.13/0.44 % Total time : 0.013 s
% 0.13/0.44 % Maximum resident set size: 3952 pages
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.013 s
% 0.13/0.44 % System time : 0.008 s
% 0.13/0.44 % Total time : 0.021 s
% 0.13/0.44 % Maximum resident set size: 4608 pages
% 0.13/0.44 % E exiting
%------------------------------------------------------------------------------