%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM576+3 : 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 : n003.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:38 PM UTC 2026
% Result : Theorem 1.35s 0.83s
% Output : CNFRefutation 1.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 49 ( 8 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 53 ( 23 ~; 18 |; 6 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 12 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( xi != xj
=> ( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mLessTotal,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X2),X1)
| sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLessTotal) ).
fof(mLessASymm,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( ( sdtlseqdt0(X2,X1)
& sdtlseqdt0(X1,X2) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLessASymm) ).
fof(m__3856,hypothesis,
( aElementOf0(xj,szNzAzT0)
& aElementOf0(xi,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3856) ).
fof(c_0_4,negated_conjecture,
~ ( xi != xj
=> ( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
~ ( xi != xj
=> ( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
( ~ sdtlseqdt0(szszuzczcdt0(xi),xj)
& ~ sdtlseqdt0(szszuzczcdt0(xj),xi)
& xi != xj ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
fof(c_0_7,plain,
! [X128,X129] :
( sdtlseqdt0(szszuzczcdt0(X129),X128)
| sdtlseqdt0(X128,X129)
| ~ aElementOf0(X129,szNzAzT0)
| ~ aElementOf0(X128,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessTotal])])]) ).
fof(c_0_8,plain,
! [X160,X161] :
( X160 = X161
| ~ sdtlseqdt0(X161,X160)
| ~ sdtlseqdt0(X160,X161)
| ~ aElementOf0(X161,szNzAzT0)
| ~ aElementOf0(X160,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessASymm])])]) ).
cnf(c_0_9,negated_conjecture,
~ sdtlseqdt0(szszuzczcdt0(xi),xj),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(szszuzczcdt0(X2),X1)
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3856]) ).
cnf(c_0_12,hypothesis,
aElementOf0(xj,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3856]) ).
cnf(c_0_13,negated_conjecture,
~ sdtlseqdt0(szszuzczcdt0(xj),xi),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
sdtlseqdt0(xj,xi),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_16,negated_conjecture,
sdtlseqdt0(xi,xj),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_10]),c_0_12]),c_0_11])]) ).
cnf(c_0_17,negated_conjecture,
xi != xj,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_12]),c_0_11])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM576+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n003.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 02:43:17 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/0.42 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
% 1.35/0.83 % Version: 3.5.1
% 1.35/0.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.35/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.35/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.35/0.83 % Starting new_bool_3 with 300s (1) cores
% 1.35/0.83 % Starting new_bool_1 with 300s (1) cores
% 1.35/0.83 % Starting sh5l with 300s (1) cores
% 1.35/0.83 % new_bool_3 with pid 3234386 completed with status 0
% 1.35/0.83 % Result found by new_bool_3
% 1.35/0.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.35/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.35/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.35/0.83 % Starting new_bool_3 with 300s (1) cores
% 1.35/0.83 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.35/0.83 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.35/0.83 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.35/0.83 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.35/0.83 % Starting SubtermCWHack with 31s (1) cores
% 1.35/0.83 % SubtermCWHack with pid 3234407 completed with status 0
% 1.35/0.83 % Result found by SubtermCWHack
% 1.35/0.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.35/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.35/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.35/0.83 % Starting new_bool_3 with 300s (1) cores
% 1.35/0.83 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.35/0.83 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.35/0.83 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.35/0.83 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.35/0.83 % Starting SubtermCWHack with 31s (1) cores
% 1.35/0.83 % Preprocessing time : 0.090 s
% 1.35/0.83
% 1.35/0.83 % Proof found!
% 1.35/0.83 % SZS status Theorem
% 1.35/0.83 % SZS output start CNFRefutation
% See solution above
% 1.35/0.83 % Parsed axioms : 85
% 1.35/0.83 % Removed by relevancy pruning/SinE : 5
% 1.35/0.83 % Initial clauses : 4167
% 1.35/0.83 % Removed in clause preprocessing : 7
% 1.35/0.83 % Initial clauses in saturation : 4160
% 1.35/0.83 % Processed clauses : 352
% 1.35/0.83 % ...of these trivial : 0
% 1.35/0.83 % ...subsumed : 74
% 1.35/0.83 % ...remaining for further processing : 278
% 1.35/0.83 % Other redundant clauses eliminated : 29
% 1.35/0.83 % Clauses deleted for lack of memory : 0
% 1.35/0.83 % Backward-subsumed : 11
% 1.35/0.83 % Backward-rewritten : 8
% 1.35/0.83 % Generated clauses : 556
% 1.35/0.83 % ...of the previous two non-redundant : 417
% 1.35/0.83 % ...aggressively subsumed : 0
% 1.35/0.83 % Contextual simplify-reflections : 14
% 1.35/0.83 % Paramodulations : 526
% 1.35/0.83 % Factorizations : 0
% 1.35/0.83 % NegExts : 0
% 1.35/0.83 % Equation resolutions : 30
% 1.35/0.83 % Disequality decompositions : 0
% 1.35/0.83 % Total rewrite steps : 399
% 1.35/0.83 % ...of those cached : 359
% 1.35/0.83 % Propositional unsat checks : 0
% 1.35/0.83 % Propositional check models : 0
% 1.35/0.83 % Propositional check unsatisfiable : 0
% 1.35/0.83 % Propositional clauses : 0
% 1.35/0.83 % Propositional clauses after purity: 0
% 1.35/0.83 % Propositional unsat core size : 0
% 1.35/0.83 % Propositional preprocessing time : 0.000
% 1.35/0.83 % Propositional encoding time : 0.000
% 1.35/0.83 % Propositional solver time : 0.000
% 1.35/0.83 % Success case prop preproc time : 0.000
% 1.35/0.83 % Success case prop encoding time : 0.000
% 1.35/0.83 % Success case prop solver time : 0.000
% 1.35/0.83 % Current number of processed clauses : 234
% 1.35/0.83 % Positive orientable unit clauses : 55
% 1.35/0.83 % Positive unorientable unit clauses: 0
% 1.35/0.83 % Negative unit clauses : 19
% 1.35/0.83 % Non-unit-clauses : 160
% 1.35/0.83 % Current number of unprocessed clauses: 4213
% 1.35/0.83 % ...number of literals in the above : 51489
% 1.35/0.83 % Current number of archived formulas : 0
% 1.35/0.83 % Current number of archived clauses : 21
% 1.35/0.83 % Clause-clause subsumption calls (NU) : 3040
% 1.35/0.83 % Rec. Clause-clause subsumption calls : 1946
% 1.35/0.83 % Non-unit clause-clause subsumptions : 58
% 1.35/0.83 % Unit Clause-clause subsumption calls : 513
% 1.35/0.83 % Rewrite failures with RHS unbound : 0
% 1.35/0.83 % BW rewrite match attempts : 7
% 1.35/0.83 % BW rewrite match successes : 7
% 1.35/0.83 % Condensation attempts : 0
% 1.35/0.83 % Condensation successes : 0
% 1.35/0.83 % Termbank termtop insertions : 339206
% 1.35/0.83 % Search garbage collected termcells : 26269
% 1.35/0.83
% 1.35/0.83 % -------------------------------------------------
% 1.35/0.83 % User time : 0.335 s
% 1.35/0.83 % System time : 0.033 s
% 1.35/0.83 % Total time : 0.368 s
% 1.35/0.83 % Maximum resident set size: 15028 pages
% 1.35/0.83
% 1.35/0.83 % -------------------------------------------------
% 1.35/0.83 % User time : 0.338 s
% 1.35/0.83 % System time : 0.040 s
% 1.35/0.83 % Total time : 0.379 s
% 1.35/0.83 % Maximum resident set size: 4608 pages
% 1.35/0.83 % E exiting
%------------------------------------------------------------------------------