%------------------------------------------------------------------------------
% File : E---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 : n010.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:29 PM UTC 2026
% Result : Theorem 0.25s 0.58s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 9 unt; 0 def)
% Number of atoms : 93 ( 23 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 120 ( 53 ~; 50 |; 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(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(c_0_5,plain,
! [X11,X12,X13,X14,X15] :
( ( ~ aElementOf0(X11,szNzAzT0)
| X15 = slbdtrb0(X11)
| ~ aSet0(X15)
| aElementOf0(esk2_2(X11,X15),X15)
| sdtlseqdt0(szszuzczcdt0(esk2_2(X11,X15)),X11) )
& ( ~ aElementOf0(X11,szNzAzT0)
| X15 = slbdtrb0(X11)
| ~ aSet0(X15)
| aElementOf0(esk2_2(X11,X15),X15)
| aElementOf0(esk2_2(X11,X15),szNzAzT0) )
& ( ~ aElementOf0(X11,szNzAzT0)
| X15 = slbdtrb0(X11)
| ~ aSet0(X15)
| ~ sdtlseqdt0(szszuzczcdt0(esk2_2(X11,X15)),X11)
| ~ aElementOf0(esk2_2(X11,X15),szNzAzT0)
| ~ aElementOf0(esk2_2(X11,X15),X15) )
& ( ~ aElementOf0(X11,szNzAzT0)
| X12 != slbdtrb0(X11)
| aElementOf0(X14,X12)
| ~ sdtlseqdt0(szszuzczcdt0(X14),X11)
| ~ aElementOf0(X14,szNzAzT0) )
& ( ~ aElementOf0(X11,szNzAzT0)
| X12 != slbdtrb0(X11)
| ~ aElementOf0(X13,X12)
| sdtlseqdt0(szszuzczcdt0(X13),X11) )
& ( ~ aElementOf0(X11,szNzAzT0)
| X12 != slbdtrb0(X11)
| ~ aElementOf0(X13,X12)
| aElementOf0(X13,szNzAzT0) )
& ( ~ aElementOf0(X11,szNzAzT0)
| X12 != slbdtrb0(X11)
| aSet0(X12) ) ),
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__]) ).
fof(c_0_7,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
inference(fof_simplification,[status(thm)],[mNoScLessZr]) ).
cnf(c_0_8,plain,
( ~ aElementOf0(X2,szNzAzT0)
| X3 != slbdtrb0(X2)
| ~ aElementOf0(X1,X3)
| sdtlseqdt0(szszuzczcdt0(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,plain,
! [X5,X6,X7] :
( ( X7 = slcrc0
| aElementOf0(esk1_1(X7),X7)
| ~ aSet0(X7) )
& ( X5 != slcrc0
| ~ aElementOf0(X6,X5) )
& ( X5 != slcrc0
| aSet0(X5) ) ),
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_10,plain,
( ~ aElementOf0(X2,szNzAzT0)
| X1 != slbdtrb0(X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_11,negated_conjecture,
slbdtrb0(sz00) != slcrc0,
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X22] :
( ~ sdtlseqdt0(szszuzczcdt0(X22),sz00)
| ~ aElementOf0(X22,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_13,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtrb0(X2))
| sdtlseqdt0(szszuzczcdt0(X1),X2) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ aSet0(X1)
| X1 = slcrc0
| aElementOf0(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ aElementOf0(X1,szNzAzT0)
| aSet0(slbdtrb0(X1)) ),
inference(er,[status(thm)],[c_0_10]) ).
fof(c_0_16,negated_conjecture,
slbdtrb0(sz00) != slcrc0,
inference(fof_nnf,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ aElementOf0(X3,szNzAzT0)
| X2 != slbdtrb0(X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,plain,
( ~ sdtlseqdt0(szszuzczcdt0(X1),sz00)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(szszuzczcdt0(esk1_1(slbdtrb0(X1))),X1)
| slbdtrb0(X1) = slcrc0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_20,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_21,negated_conjecture,
slbdtrb0(sz00) != slcrc0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtrb0(X2))
| aElementOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_23,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_18,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_24,plain,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(esk1_1(slbdtrb0(X1)),szNzAzT0)
| slbdtrb0(X1) = slcrc0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_14]),c_0_15]) ).
cnf(c_0_25,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM540+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n010.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 21 02:38:55 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.50 Running first-order theorem proving
% 0.25/0.50 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.25/0.58 % Version: 3.5.1
% 0.25/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.58 % Starting sh5l with 300s (1) cores
% 0.25/0.58 % new_bool_3 with pid 4056927 completed with status 0
% 0.25/0.58 % Result found by new_bool_3
% 0.25/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.58 % Search class: FGHSF-FFMS31-MFFFFFNN
% 0.25/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.58 % SubtermCWHack with pid 4056930 completed with status 0
% 0.25/0.58 % Result found by SubtermCWHack
% 0.25/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.58 % Search class: FGHSF-FFMS31-MFFFFFNN
% 0.25/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.58 % Preprocessing time : 0.003 s
% 0.25/0.58
% 0.25/0.58 % Proof found!
% 0.25/0.58 % SZS status Theorem
% 0.25/0.58 % SZS output start CNFRefutation
% See solution above
% 0.25/0.58 % Parsed axioms : 52
% 0.25/0.58 % Removed by relevancy pruning/SinE : 5
% 0.25/0.58 % Initial clauses : 81
% 0.25/0.58 % Removed in clause preprocessing : 5
% 0.25/0.58 % Initial clauses in saturation : 76
% 0.25/0.58 % Processed clauses : 139
% 0.25/0.58 % ...of these trivial : 0
% 0.25/0.58 % ...subsumed : 24
% 0.25/0.58 % ...remaining for further processing : 115
% 0.25/0.58 % Other redundant clauses eliminated : 21
% 0.25/0.58 % Clauses deleted for lack of memory : 0
% 0.25/0.58 % Backward-subsumed : 2
% 0.25/0.58 % Backward-rewritten : 2
% 0.25/0.58 % Generated clauses : 197
% 0.25/0.58 % ...of the previous two non-redundant : 160
% 0.25/0.58 % ...aggressively subsumed : 0
% 0.25/0.58 % Contextual simplify-reflections : 17
% 0.25/0.58 % Paramodulations : 177
% 0.25/0.58 % Factorizations : 0
% 0.25/0.58 % NegExts : 0
% 0.25/0.58 % Equation resolutions : 22
% 0.25/0.58 % Disequality decompositions : 0
% 0.25/0.58 % Total rewrite steps : 86
% 0.25/0.58 % ...of those cached : 78
% 0.25/0.58 % Propositional unsat checks : 0
% 0.25/0.58 % Propositional check models : 0
% 0.25/0.58 % Propositional check unsatisfiable : 0
% 0.25/0.58 % Propositional clauses : 0
% 0.25/0.58 % Propositional clauses after purity: 0
% 0.25/0.58 % Propositional unsat core size : 0
% 0.25/0.58 % Propositional preprocessing time : 0.000
% 0.25/0.58 % Propositional encoding time : 0.000
% 0.25/0.58 % Propositional solver time : 0.000
% 0.25/0.58 % Success case prop preproc time : 0.000
% 0.25/0.58 % Success case prop encoding time : 0.000
% 0.25/0.58 % Success case prop solver time : 0.000
% 0.25/0.58 % Current number of processed clauses : 94
% 0.25/0.58 % Positive orientable unit clauses : 9
% 0.25/0.58 % Positive unorientable unit clauses: 0
% 0.25/0.58 % Negative unit clauses : 5
% 0.25/0.58 % Non-unit-clauses : 80
% 0.25/0.58 % Current number of unprocessed clauses: 89
% 0.25/0.58 % ...number of literals in the above : 532
% 0.25/0.58 % Current number of archived formulas : 0
% 0.25/0.58 % Current number of archived clauses : 4
% 0.25/0.58 % Clause-clause subsumption calls (NU) : 1630
% 0.25/0.58 % Rec. Clause-clause subsumption calls : 653
% 0.25/0.58 % Non-unit clause-clause subsumptions : 42
% 0.25/0.58 % Unit Clause-clause subsumption calls : 25
% 0.25/0.58 % Rewrite failures with RHS unbound : 0
% 0.25/0.58 % BW rewrite match attempts : 2
% 0.25/0.58 % BW rewrite match successes : 2
% 0.25/0.58 % Condensation attempts : 0
% 0.25/0.58 % Condensation successes : 0
% 0.25/0.58 % Termbank termtop insertions : 10171
% 0.25/0.58 % Search garbage collected termcells : 1651
% 0.25/0.58
% 0.25/0.58 % -------------------------------------------------
% 0.25/0.58 % User time : 0.027 s
% 0.25/0.58 % System time : 0.005 s
% 0.25/0.58 % Total time : 0.032 s
% 0.25/0.58 % Maximum resident set size: 3944 pages
% 0.25/0.58
% 0.25/0.58 % -------------------------------------------------
% 0.25/0.58 % User time : 0.031 s
% 0.25/0.58 % System time : 0.012 s
% 0.25/0.58 % Total time : 0.043 s
% 0.25/0.58 % Maximum resident set size: 4864 pages
% 0.25/0.58 % E exiting
%------------------------------------------------------------------------------