%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM623+3 : 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:55:45 PM UTC 2026
% Result : Theorem 2.46s 6.39s
% Output : CNFRefutation 2.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 10 unt; 0 def)
% Number of atoms : 66 ( 14 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 62 ( 23 ~; 16 |; 18 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__5106,hypothesis,
( aSubsetOf0(xQ,szNzAzT0)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,szNzAzT0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5106) ).
fof(m__5147,hypothesis,
( xp = szmzizndt0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(xp,X1) )
& aElementOf0(xp,xQ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5147) ).
fof(m__,conjecture,
xp = xx,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mLessASymm,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( ( sdtlseqdt0(X2,X1)
& sdtlseqdt0(X1,X2) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLessASymm) ).
fof(m__5348,hypothesis,
( aElementOf0(xx,xP)
& xx != szmzizndt0(xQ)
& aElementOf0(xx,xQ)
& aElement0(xx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5348) ).
fof(m__5401,hypothesis,
! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xm))
=> sdtlseqdt0(xx,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5401) ).
fof(m__5481,hypothesis,
( aElementOf0(xx,xQ)
& aElementOf0(xp,sdtlpdtrp0(xN,xm)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5481) ).
fof(c_0_7,hypothesis,
! [X88] :
( aSubsetOf0(xQ,szNzAzT0)
& ( aElementOf0(X88,szNzAzT0)
| ~ aElementOf0(X88,xQ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5106])])])]) ).
fof(c_0_8,hypothesis,
! [X91] :
( xp = szmzizndt0(xQ)
& ( sdtlseqdt0(xp,X91)
| ~ aElementOf0(X91,xQ) )
& aElementOf0(xp,xQ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5147])])])]) ).
fof(c_0_9,negated_conjecture,
xp != xx,
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_10,plain,
! [X215,X216] :
( X215 = X216
| ~ sdtlseqdt0(X216,X215)
| ~ sdtlseqdt0(X215,X216)
| ~ aElementOf0(X216,szNzAzT0)
| ~ aElementOf0(X215,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessASymm])])]) ).
cnf(c_0_11,hypothesis,
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
aElementOf0(xp,xQ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,hypothesis,
( aElementOf0(xx,xP)
& xx != szmzizndt0(xQ)
& aElementOf0(xx,xQ)
& aElement0(xx) ),
inference(fof_simplification,[status(thm)],[m__5348]) ).
fof(c_0_14,negated_conjecture,
xp != xx,
inference(fof_simplification,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,hypothesis,
( ~ aElementOf0(X1,xQ)
| sdtlseqdt0(xp,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,hypothesis,
aElementOf0(xp,szNzAzT0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_18,hypothesis,
! [X98] :
( sdtlseqdt0(xx,X98)
| ~ aElementOf0(X98,sdtlpdtrp0(xN,xm)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5401])])]) ).
fof(c_0_19,hypothesis,
( aElementOf0(xx,xP)
& xx != szmzizndt0(xQ)
& aElementOf0(xx,xQ)
& aElement0(xx) ),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
fof(c_0_20,negated_conjecture,
xp != xx,
inference(fof_nnf,[status(thm)],[c_0_14]) ).
cnf(c_0_21,hypothesis,
( ~ aElementOf0(X1,xQ)
| ~ sdtlseqdt0(X1,xp)
| X1 = xp ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_11]) ).
cnf(c_0_22,hypothesis,
( ~ aElementOf0(X1,sdtlpdtrp0(xN,xm))
| sdtlseqdt0(xx,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,hypothesis,
aElementOf0(xx,xQ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,hypothesis,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(split_conjunct,[status(thm)],[m__5481]) ).
cnf(c_0_25,negated_conjecture,
xp != xx,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM623+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/5.45 % Computer : n010.cluster.edu
% 0.19/5.45 % Model : x86_64 x86_64
% 0.19/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.45 % Memory : 8046.5625MB
% 0.19/5.45 % OS : Linux 6.8.0-71-generic
% 0.19/5.45 % CPULimit : 300
% 0.19/5.45 % WCLimit : 300
% 0.19/5.45 % DateTime : Mon Sep 21 02:45:45 UTC 2026
% 0.19/5.45 % CPUTime :
% 0.19/5.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/5.52 Running first-order theorem proving
% 0.22/5.53 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
% 2.46/6.39 % Version: 3.5.1
% 2.46/6.39 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.46/6.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.46/6.39 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.46/6.39 % Starting new_bool_3 with 300s (1) cores
% 2.46/6.39 % Starting new_bool_1 with 300s (1) cores
% 2.46/6.39 % Starting sh5l with 300s (1) cores
% 2.46/6.39 % new_bool_1 with pid 4069851 completed with status 0
% 2.46/6.39 % Result found by new_bool_1
% 2.46/6.39 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.46/6.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.46/6.39 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.46/6.39 % Starting new_bool_3 with 300s (1) cores
% 2.46/6.39 % Starting new_bool_1 with 300s (1) cores
% 2.46/6.39 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.46/6.39 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.46/6.39 % Search class: FGHSF-SMLM32-MFFFFFNN
% 2.46/6.39 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 2.46/6.39 % Starting SubtermCWHack with 28s (1) cores
% 2.46/6.39 % SubtermCWHack with pid 4069855 completed with status 0
% 2.46/6.39 % Result found by SubtermCWHack
% 2.46/6.39 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.46/6.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.46/6.39 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.46/6.39 % Starting new_bool_3 with 300s (1) cores
% 2.46/6.39 % Starting new_bool_1 with 300s (1) cores
% 2.46/6.39 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.46/6.39 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.46/6.39 % Search class: FGHSF-SMLM32-MFFFFFNN
% 2.46/6.39 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 2.46/6.39 % Starting SubtermCWHack with 28s (1) cores
% 2.46/6.39 % Preprocessing time : 0.104 s
% 2.46/6.39
% 2.46/6.39 % Proof found!
% 2.46/6.39 % SZS status Theorem
% 2.46/6.39 % SZS output start CNFRefutation
% See solution above
% 2.46/6.39 % Parsed axioms : 120
% 2.46/6.39 % Removed by relevancy pruning/SinE : 9
% 2.46/6.39 % Initial clauses : 4908
% 2.46/6.39 % Removed in clause preprocessing : 7
% 2.46/6.39 % Initial clauses in saturation : 4901
% 2.46/6.39 % Processed clauses : 2093
% 2.46/6.39 % ...of these trivial : 60
% 2.46/6.39 % ...subsumed : 631
% 2.46/6.39 % ...remaining for further processing : 1402
% 2.46/6.39 % Other redundant clauses eliminated : 48
% 2.46/6.39 % Clauses deleted for lack of memory : 0
% 2.46/6.39 % Backward-subsumed : 153
% 2.46/6.39 % Backward-rewritten : 148
% 2.46/6.39 % Generated clauses : 7689
% 2.46/6.39 % ...of the previous two non-redundant : 6612
% 2.46/6.39 % ...aggressively subsumed : 0
% 2.46/6.39 % Contextual simplify-reflections : 30
% 2.46/6.39 % Paramodulations : 7642
% 2.46/6.39 % Factorizations : 0
% 2.46/6.39 % NegExts : 0
% 2.46/6.39 % Equation resolutions : 50
% 2.46/6.39 % Disequality decompositions : 0
% 2.46/6.39 % Total rewrite steps : 5530
% 2.46/6.39 % ...of those cached : 5327
% 2.46/6.39 % Propositional unsat checks : 0
% 2.46/6.39 % Propositional check models : 0
% 2.46/6.39 % Propositional check unsatisfiable : 0
% 2.46/6.39 % Propositional clauses : 0
% 2.46/6.39 % Propositional clauses after purity: 0
% 2.46/6.39 % Propositional unsat core size : 0
% 2.46/6.39 % Propositional preprocessing time : 0.000
% 2.46/6.39 % Propositional encoding time : 0.000
% 2.46/6.39 % Propositional solver time : 0.000
% 2.46/6.39 % Success case prop preproc time : 0.000
% 2.46/6.39 % Success case prop encoding time : 0.000
% 2.46/6.39 % Success case prop solver time : 0.000
% 2.46/6.39 % Current number of processed clauses : 1063
% 2.46/6.39 % Positive orientable unit clauses : 227
% 2.46/6.39 % Positive unorientable unit clauses: 0
% 2.46/6.39 % Negative unit clauses : 38
% 2.46/6.39 % Non-unit-clauses : 798
% 2.46/6.39 % Current number of unprocessed clauses: 8718
% 2.46/6.39 % ...number of literals in the above : 73827
% 2.46/6.39 % Current number of archived formulas : 0
% 2.46/6.39 % Current number of archived clauses : 303
% 2.46/6.39 % Clause-clause subsumption calls (NU) : 106941
% 2.46/6.39 % Rec. Clause-clause subsumption calls : 57331
% 2.46/6.39 % Non-unit clause-clause subsumptions : 525
% 2.46/6.39 % Unit Clause-clause subsumption calls : 8069
% 2.46/6.39 % Rewrite failures with RHS unbound : 0
% 2.46/6.39 % BW rewrite match attempts : 137
% 2.46/6.39 % BW rewrite match successes : 28
% 2.46/6.39 % Condensation attempts : 0
% 2.46/6.39 % Condensation successes : 0
% 2.46/6.39 % Termbank termtop insertions : 506185
% 2.46/6.39 % Search garbage collected termcells : 31572
% 2.46/6.39
% 2.46/6.39 % -------------------------------------------------
% 2.46/6.39 % User time : 0.767 s
% 2.46/6.39 % System time : 0.031 s
% 2.46/6.39 % Total time : 0.798 s
% 2.46/6.39 % Maximum resident set size: 16120 pages
% 2.46/6.39
% 2.46/6.39 % -------------------------------------------------
% 2.46/6.39 % User time : 0.779 s
% 2.46/6.39 % System time : 0.037 s
% 2.46/6.39 % Total time : 0.816 s
% 2.46/6.39 % Maximum resident set size: 5120 pages
% 2.46/6.39 % E exiting
%------------------------------------------------------------------------------