%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM540+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 : 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:55:25 PM UTC 2026
% Result : Theorem 0.24s 0.65s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 11 unt; 0 def)
% Number of atoms : 93 ( 21 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 117 ( 52 ~; 48 |; 11 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 15 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSeg,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( X2 = slbdtrb0(X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
<=> ( sdtlseqdt0(szszuzczcdt0(X3),X1)
& aElementOf0(X3,szNzAzT0) ) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSeg) ).
fof(m__,conjecture,
slbdtrb0(sz00) = slcrc0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mNoScLessZr,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNoScLessZr) ).
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(c_0_5,plain,
! [X104,X105,X106,X107,X108] :
( ( ~ aElementOf0(X104,szNzAzT0)
| X108 = slbdtrb0(X104)
| ~ aSet0(X108)
| aElementOf0(esk9_2(X104,X108),X108)
| sdtlseqdt0(szszuzczcdt0(esk9_2(X104,X108)),X104) )
& ( ~ aElementOf0(X104,szNzAzT0)
| X108 = slbdtrb0(X104)
| ~ aSet0(X108)
| aElementOf0(esk9_2(X104,X108),X108)
| aElementOf0(esk9_2(X104,X108),szNzAzT0) )
& ( ~ aElementOf0(X104,szNzAzT0)
| X108 = slbdtrb0(X104)
| ~ aSet0(X108)
| ~ sdtlseqdt0(szszuzczcdt0(esk9_2(X104,X108)),X104)
| ~ aElementOf0(esk9_2(X104,X108),szNzAzT0)
| ~ aElementOf0(esk9_2(X104,X108),X108) )
& ( ~ aElementOf0(X104,szNzAzT0)
| X105 != slbdtrb0(X104)
| aElementOf0(X107,X105)
| ~ sdtlseqdt0(szszuzczcdt0(X107),X104)
| ~ aElementOf0(X107,szNzAzT0) )
& ( ~ aElementOf0(X104,szNzAzT0)
| X105 != slbdtrb0(X104)
| ~ aElementOf0(X106,X105)
| sdtlseqdt0(szszuzczcdt0(X106),X104) )
& ( ~ aElementOf0(X104,szNzAzT0)
| X105 != slbdtrb0(X104)
| ~ aElementOf0(X106,X105)
| aElementOf0(X106,szNzAzT0) )
& ( ~ aElementOf0(X104,szNzAzT0)
| X105 != slbdtrb0(X104)
| aSet0(X105) ) ),
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)],[mDefSeg])])])])])])]) ).
fof(c_0_6,negated_conjecture,
slbdtrb0(sz00) != slcrc0,
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_7,plain,
( ~ aElementOf0(X2,szNzAzT0)
| X3 != slbdtrb0(X2)
| ~ aElementOf0(X1,X3)
| sdtlseqdt0(szszuzczcdt0(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ aElementOf0(X2,szNzAzT0)
| X1 != slbdtrb0(X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,negated_conjecture,
slbdtrb0(sz00) != slcrc0,
inference(fof_simplification,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ aElementOf0(X3,szNzAzT0)
| X2 != slbdtrb0(X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_11,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
inference(fof_simplification,[status(thm)],[mNoScLessZr]) ).
cnf(c_0_12,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtrb0(X2))
| sdtlseqdt0(szszuzczcdt0(X1),X2) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
fof(c_0_14,plain,
! [X10,X11,X12] :
( ( X12 = slcrc0
| aElementOf0(esk1_1(X12),X12)
| ~ aSet0(X12) )
& ( X10 != slcrc0
| ~ aElementOf0(X11,X10) )
& ( X10 != slcrc0
| 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)],[mDefEmp])])])])])])]) ).
cnf(c_0_15,plain,
( ~ aElementOf0(X1,szNzAzT0)
| aSet0(slbdtrb0(X1)) ),
inference(er,[status(thm)],[c_0_8]) ).
fof(c_0_16,negated_conjecture,
slbdtrb0(sz00) != slcrc0,
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtrb0(X2))
| aElementOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X65] :
( ~ sdtlseqdt0(szszuzczcdt0(X65),sz00)
| ~ aElementOf0(X65,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_19,plain,
( ~ aElementOf0(X1,slbdtrb0(sz00))
| sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,plain,
( ~ aSet0(X1)
| X1 = slcrc0
| aElementOf0(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
aSet0(slbdtrb0(sz00)),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_22,negated_conjecture,
slbdtrb0(sz00) != slcrc0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( ~ aElementOf0(X1,slbdtrb0(sz00))
| aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_24,plain,
( ~ sdtlseqdt0(szszuzczcdt0(X1),sz00)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
sdtlseqdt0(szszuzczcdt0(esk1_1(slbdtrb0(sz00))),sz00),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_26,plain,
aElementOf0(esk1_1(slbdtrb0(sz00)),szNzAzT0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_27,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM540+1 : 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.46 % Computer : n007.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 02:36:35 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.57 Running first-order theorem proving
% 0.24/0.57 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.24/0.65 % Version: 3.5.1
% 0.24/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.65 % Starting sh5l with 300s (1) cores
% 0.24/0.65 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 4181590 completed with status 0
% 0.24/0.65 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.24/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.65 % No SInE strategy applied
% 0.24/0.65 % Search class: FGHSF-FFMS31-MFFFFFNN
% 0.24/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.24/0.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.24/0.65 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.65 % Starting new_bool_1 with 136s (1) cores
% 0.24/0.65 % new_bool_1 with pid 4181599 completed with status 0
% 0.24/0.65 % Result found by new_bool_1
% 0.24/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.65 % No SInE strategy applied
% 0.24/0.65 % Search class: FGHSF-FFMS31-MFFFFFNN
% 0.24/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.24/0.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.24/0.65 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.65 % Starting new_bool_1 with 136s (1) cores
% 0.24/0.65 % Preprocessing time : 0.002 s
% 0.24/0.65 % Presaturation interreduction done
% 0.24/0.65
% 0.24/0.65 % Proof found!
% 0.24/0.65 % SZS status Theorem
% 0.24/0.65 % SZS output start CNFRefutation
% See solution above
% 0.24/0.65 % Parsed axioms : 52
% 0.24/0.65 % Removed by relevancy pruning/SinE : 0
% 0.24/0.65 % Initial clauses : 92
% 0.24/0.65 % Removed in clause preprocessing : 6
% 0.24/0.65 % Initial clauses in saturation : 86
% 0.24/0.65 % Processed clauses : 203
% 0.24/0.65 % ...of these trivial : 1
% 0.24/0.65 % ...subsumed : 4
% 0.24/0.65 % ...remaining for further processing : 198
% 0.24/0.65 % Other redundant clauses eliminated : 24
% 0.24/0.65 % Clauses deleted for lack of memory : 0
% 0.24/0.65 % Backward-subsumed : 0
% 0.24/0.65 % Backward-rewritten : 0
% 0.24/0.65 % Generated clauses : 143
% 0.24/0.65 % ...of the previous two non-redundant : 128
% 0.24/0.65 % ...aggressively subsumed : 0
% 0.24/0.65 % Contextual simplify-reflections : 12
% 0.24/0.65 % Paramodulations : 120
% 0.24/0.65 % Factorizations : 0
% 0.24/0.65 % NegExts : 0
% 0.24/0.65 % Equation resolutions : 25
% 0.24/0.65 % Disequality decompositions : 0
% 0.24/0.65 % Total rewrite steps : 52
% 0.24/0.65 % ...of those cached : 42
% 0.24/0.65 % Propositional unsat checks : 0
% 0.24/0.65 % Propositional check models : 0
% 0.24/0.65 % Propositional check unsatisfiable : 0
% 0.24/0.65 % Propositional clauses : 0
% 0.24/0.65 % Propositional clauses after purity: 0
% 0.24/0.65 % Propositional unsat core size : 0
% 0.24/0.65 % Propositional preprocessing time : 0.000
% 0.24/0.65 % Propositional encoding time : 0.000
% 0.24/0.65 % Propositional solver time : 0.000
% 0.24/0.65 % Success case prop preproc time : 0.000
% 0.24/0.65 % Success case prop encoding time : 0.000
% 0.24/0.65 % Success case prop solver time : 0.000
% 0.24/0.65 % Current number of processed clauses : 90
% 0.24/0.65 % Positive orientable unit clauses : 30
% 0.24/0.65 % Positive unorientable unit clauses: 0
% 0.24/0.65 % Negative unit clauses : 4
% 0.24/0.65 % Non-unit-clauses : 56
% 0.24/0.65 % Current number of unprocessed clauses: 97
% 0.24/0.65 % ...number of literals in the above : 331
% 0.24/0.65 % Current number of archived formulas : 0
% 0.24/0.65 % Current number of archived clauses : 86
% 0.24/0.65 % Clause-clause subsumption calls (NU) : 2382
% 0.24/0.65 % Rec. Clause-clause subsumption calls : 567
% 0.24/0.65 % Non-unit clause-clause subsumptions : 14
% 0.24/0.65 % Unit Clause-clause subsumption calls : 140
% 0.24/0.65 % Rewrite failures with RHS unbound : 0
% 0.24/0.65 % BW rewrite match attempts : 4
% 0.24/0.65 % BW rewrite match successes : 0
% 0.24/0.65 % Condensation attempts : 0
% 0.24/0.65 % Condensation successes : 0
% 0.24/0.65 % Termbank termtop insertions : 10570
% 0.24/0.65 % Search garbage collected termcells : 1884
% 0.24/0.65
% 0.24/0.65 % -------------------------------------------------
% 0.24/0.65 % User time : 0.023 s
% 0.24/0.65 % System time : 0.009 s
% 0.24/0.65 % Total time : 0.032 s
% 0.24/0.65 % Maximum resident set size: 3432 pages
% 0.24/0.65
% 0.24/0.65 % -------------------------------------------------
% 0.24/0.65 % User time : 0.077 s
% 0.24/0.65 % System time : 0.032 s
% 0.24/0.65 % Total time : 0.108 s
% 0.24/0.65 % Maximum resident set size: 4608 pages
% 0.24/0.65 % E exiting
%------------------------------------------------------------------------------