%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM538+2 : 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 : n006.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.26s 0.57s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 95 ( 19 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 104 ( 39 ~; 29 |; 18 &)
% ( 3 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ! [X1] :
( aElementOf0(X1,sdtmndt0(xS,xx))
<=> ( X1 != xx
& aElementOf0(X1,xS)
& aElement0(X1) ) )
& aSet0(sdtmndt0(xS,xx)) )
=> szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) = sbrdtbr0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mCardCons,axiom,
! [X1] :
( ( isFinite0(X1)
& aSet0(X1) )
=> ! [X2] :
( aElement0(X2)
=> ( ~ aElementOf0(X2,X1)
=> sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardCons) ).
fof(mConsDiff,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> sdtpldt0(sdtmndt0(X1,X2),X2) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mConsDiff) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__1522_02,hypothesis,
( aElementOf0(xx,xS)
& isFinite0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1522_02) ).
fof(m__1522,hypothesis,
aSet0(xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1522) ).
fof(mFDiffSet,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( ( isFinite0(X2)
& aSet0(X2) )
=> isFinite0(sdtmndt0(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mFDiffSet) ).
fof(c_0_7,negated_conjecture,
~ ( ( ! [X1] :
( aElementOf0(X1,sdtmndt0(xS,xx))
<=> ( X1 != xx
& aElementOf0(X1,xS)
& aElement0(X1) ) )
& aSet0(sdtmndt0(xS,xx)) )
=> szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) = sbrdtbr0(xS) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,negated_conjecture,
~ ( ( ! [X1] :
( aElementOf0(X1,sdtmndt0(xS,xx))
<=> ( X1 != xx
& aElementOf0(X1,xS)
& aElement0(X1) ) )
& aSet0(sdtmndt0(xS,xx)) )
=> szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) = sbrdtbr0(xS) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,plain,
! [X1] :
( ( isFinite0(X1)
& aSet0(X1) )
=> ! [X2] :
( aElement0(X2)
=> ( ~ aElementOf0(X2,X1)
=> sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1)) ) ) ),
inference(fof_simplification,[status(thm)],[mCardCons]) ).
fof(c_0_10,plain,
! [X44,X45] :
( sdtpldt0(sdtmndt0(X44,X45),X45) = X44
| ~ aElementOf0(X45,X44)
| ~ aSet0(X44) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mConsDiff])])])]) ).
fof(c_0_11,plain,
! [X7,X8] :
( aElement0(X8)
| ~ aElementOf0(X8,X7)
| ~ aSet0(X7) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_12,negated_conjecture,
! [X85] :
( szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) != sbrdtbr0(xS)
& ( aElementOf0(X85,sdtmndt0(xS,xx))
| X85 = xx
| ~ aElementOf0(X85,xS)
| ~ aElement0(X85) )
& ( ~ aElementOf0(X85,sdtmndt0(xS,xx))
| X85 != xx )
& ( ~ aElementOf0(X85,sdtmndt0(xS,xx))
| aElementOf0(X85,xS) )
& ( ~ aElementOf0(X85,sdtmndt0(xS,xx))
| aElement0(X85) )
& aSet0(sdtmndt0(xS,xx)) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
fof(c_0_13,plain,
! [X83,X84] :
( sbrdtbr0(sdtpldt0(X83,X84)) = szszuzczcdt0(sbrdtbr0(X83))
| aElementOf0(X84,X83)
| ~ aElement0(X84)
| ~ isFinite0(X83)
| ~ aSet0(X83) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_14,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| sdtpldt0(sdtmndt0(X1,X2),X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
aElementOf0(xx,xS),
inference(split_conjunct,[status(thm)],[m__1522_02]) ).
cnf(c_0_16,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[m__1522]) ).
cnf(c_0_17,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( ~ aElementOf0(X1,sdtmndt0(xS,xx))
| X1 != xx ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ aElement0(X2)
| ~ isFinite0(X1)
| ~ aSet0(X1)
| sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1))
| aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,hypothesis,
sdtpldt0(sdtmndt0(xS,xx),xx) = xS,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_21,hypothesis,
aElement0(xx),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_16])]) ).
cnf(c_0_22,negated_conjecture,
aSet0(sdtmndt0(xS,xx)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,negated_conjecture,
szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) != sbrdtbr0(xS),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,negated_conjecture,
~ aElementOf0(xx,sdtmndt0(xS,xx)),
inference(er,[status(thm)],[c_0_18]) ).
fof(c_0_25,plain,
! [X54,X55] :
( isFinite0(sdtmndt0(X55,X54))
| ~ isFinite0(X55)
| ~ aSet0(X55)
| ~ aElement0(X54) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mFDiffSet])])])]) ).
cnf(c_0_26,hypothesis,
~ isFinite0(sdtmndt0(xS,xx)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]),c_0_23]),c_0_24]) ).
cnf(c_0_27,plain,
( ~ isFinite0(X2)
| ~ aSet0(X2)
| ~ aElement0(X1)
| isFinite0(sdtmndt0(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,hypothesis,
isFinite0(xS),
inference(split_conjunct,[status(thm)],[m__1522_02]) ).
cnf(c_0_29,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_21]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM538+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n006.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:28 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/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.26/0.57 % Version: 3.5.1
% 0.26/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.57 % Starting sh5l with 300s (1) cores
% 0.26/0.57 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1824673 completed with status 0
% 0.26/0.57 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.26/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.57 % No SInE strategy applied
% 0.26/0.57 % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.26/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.26/0.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.26/0.57 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.57 % Starting new_bool_1 with 136s (1) cores
% 0.26/0.57 % new_bool_3 with pid 1824683 completed with status 0
% 0.26/0.57 % Result found by new_bool_3
% 0.26/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.57 % No SInE strategy applied
% 0.26/0.57 % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.26/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.26/0.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.26/0.57 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.57 % Preprocessing time : 0.002 s
% 0.26/0.57 % Presaturation interreduction done
% 0.26/0.57
% 0.26/0.57 % Proof found!
% 0.26/0.57 % SZS status Theorem
% 0.26/0.57 % SZS output start CNFRefutation
% See solution above
% 0.26/0.57 % Parsed axioms : 46
% 0.26/0.57 % Removed by relevancy pruning/SinE : 0
% 0.26/0.57 % Initial clauses : 79
% 0.26/0.57 % Removed in clause preprocessing : 6
% 0.26/0.57 % Initial clauses in saturation : 73
% 0.26/0.57 % Processed clauses : 200
% 0.26/0.57 % ...of these trivial : 2
% 0.26/0.57 % ...subsumed : 9
% 0.26/0.57 % ...remaining for further processing : 189
% 0.26/0.57 % Other redundant clauses eliminated : 17
% 0.26/0.57 % Clauses deleted for lack of memory : 0
% 0.26/0.57 % Backward-subsumed : 1
% 0.26/0.57 % Backward-rewritten : 0
% 0.26/0.57 % Generated clauses : 220
% 0.26/0.57 % ...of the previous two non-redundant : 197
% 0.26/0.57 % ...aggressively subsumed : 0
% 0.26/0.57 % Contextual simplify-reflections : 12
% 0.26/0.57 % Paramodulations : 204
% 0.26/0.57 % Factorizations : 0
% 0.26/0.57 % NegExts : 0
% 0.26/0.57 % Equation resolutions : 18
% 0.26/0.57 % Disequality decompositions : 0
% 0.26/0.57 % Total rewrite steps : 113
% 0.26/0.57 % ...of those cached : 100
% 0.26/0.57 % Propositional unsat checks : 0
% 0.26/0.57 % Propositional check models : 0
% 0.26/0.57 % Propositional check unsatisfiable : 0
% 0.26/0.57 % Propositional clauses : 0
% 0.26/0.57 % Propositional clauses after purity: 0
% 0.26/0.57 % Propositional unsat core size : 0
% 0.26/0.57 % Propositional preprocessing time : 0.000
% 0.26/0.57 % Propositional encoding time : 0.000
% 0.26/0.57 % Propositional solver time : 0.000
% 0.26/0.57 % Success case prop preproc time : 0.000
% 0.26/0.57 % Success case prop encoding time : 0.000
% 0.26/0.57 % Success case prop solver time : 0.000
% 0.26/0.57 % Current number of processed clauses : 100
% 0.26/0.57 % Positive orientable unit clauses : 33
% 0.26/0.57 % Positive unorientable unit clauses: 0
% 0.26/0.57 % Negative unit clauses : 8
% 0.26/0.57 % Non-unit-clauses : 59
% 0.26/0.57 % Current number of unprocessed clauses: 143
% 0.26/0.57 % ...number of literals in the above : 415
% 0.26/0.57 % Current number of archived formulas : 0
% 0.26/0.57 % Current number of archived clauses : 74
% 0.26/0.57 % Clause-clause subsumption calls (NU) : 2292
% 0.26/0.57 % Rec. Clause-clause subsumption calls : 587
% 0.26/0.57 % Non-unit clause-clause subsumptions : 20
% 0.26/0.57 % Unit Clause-clause subsumption calls : 85
% 0.26/0.57 % Rewrite failures with RHS unbound : 0
% 0.26/0.57 % BW rewrite match attempts : 42
% 0.26/0.57 % BW rewrite match successes : 0
% 0.26/0.57 % Condensation attempts : 0
% 0.26/0.57 % Condensation successes : 0
% 0.26/0.57 % Termbank termtop insertions : 10444
% 0.26/0.57 % Search garbage collected termcells : 1422
% 0.26/0.57
% 0.26/0.57 % -------------------------------------------------
% 0.26/0.57 % User time : 0.021 s
% 0.26/0.57 % System time : 0.005 s
% 0.26/0.57 % Total time : 0.026 s
% 0.26/0.57 % Maximum resident set size: 3680 pages
% 0.26/0.57
% 0.26/0.57 % -------------------------------------------------
% 0.26/0.57 % User time : 0.078 s
% 0.26/0.57 % System time : 0.018 s
% 0.26/0.57 % Total time : 0.096 s
% 0.26/0.57 % Maximum resident set size: 4864 pages
% 0.26/0.57 % E exiting
%------------------------------------------------------------------------------