%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM576+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 : 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:55:33 PM UTC 2026
% Result : Theorem 1.43s 0.79s
% Output : CNFRefutation 1.43s
% 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/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',mLessASymm) ).
fof(m__3856,hypothesis,
( aElementOf0(xj,szNzAzT0)
& aElementOf0(xi,szNzAzT0) ),
file('/export/starexec/sandbox2/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,
! [X78,X79] :
( sdtlseqdt0(szszuzczcdt0(X79),X78)
| sdtlseqdt0(X78,X79)
| ~ aElementOf0(X79,szNzAzT0)
| ~ aElementOf0(X78,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessTotal])])]) ).
fof(c_0_8,plain,
! [X73,X74] :
( X73 = X74
| ~ sdtlseqdt0(X74,X73)
| ~ sdtlseqdt0(X73,X74)
| ~ aElementOf0(X74,szNzAzT0)
| ~ aElementOf0(X73,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.02 % Problem : NUM576+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.36 % Computer : n003.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon Sep 21 02:43:17 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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
% 1.43/0.79 % Version: 3.5.1
% 1.43/0.79 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.43/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.43/0.79 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.43/0.79 % Starting new_bool_3 with 300s (1) cores
% 1.43/0.79 % Starting new_bool_1 with 300s (1) cores
% 1.43/0.79 % Starting sh5l with 300s (1) cores
% 1.43/0.79 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3234398 completed with status 0
% 1.43/0.79 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.43/0.79 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.43/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.43/0.79 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.43/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.43/0.79 % No SInE strategy applied
% 1.43/0.79 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.43/0.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.43/0.79 % Starting SubtermCWHack with 136s (1) cores
% 1.43/0.79 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.43/0.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 1.43/0.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.43/0.79 % Starting new_bool_3 with 136s (1) cores
% 1.43/0.79 % SubtermCWHack with pid 3234402 completed with status 0
% 1.43/0.79 % Result found by SubtermCWHack
% 1.43/0.79 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.43/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.43/0.79 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.43/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.43/0.79 % No SInE strategy applied
% 1.43/0.79 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.43/0.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.43/0.79 % Starting SubtermCWHack with 136s (1) cores
% 1.43/0.79 % Preprocessing time : 0.138 s
% 1.43/0.79
% 1.43/0.79 % Proof found!
% 1.43/0.79 % SZS status Theorem
% 1.43/0.79 % SZS output start CNFRefutation
% See solution above
% 1.43/0.79 % Parsed axioms : 85
% 1.43/0.79 % Removed by relevancy pruning/SinE : 0
% 1.43/0.79 % Initial clauses : 4186
% 1.43/0.79 % Removed in clause preprocessing : 7
% 1.43/0.79 % Initial clauses in saturation : 4179
% 1.43/0.79 % Processed clauses : 418
% 1.43/0.79 % ...of these trivial : 0
% 1.43/0.79 % ...subsumed : 93
% 1.43/0.79 % ...remaining for further processing : 325
% 1.43/0.79 % Other redundant clauses eliminated : 36
% 1.43/0.79 % Clauses deleted for lack of memory : 0
% 1.43/0.79 % Backward-subsumed : 15
% 1.43/0.79 % Backward-rewritten : 9
% 1.43/0.79 % Generated clauses : 679
% 1.43/0.79 % ...of the previous two non-redundant : 516
% 1.43/0.79 % ...aggressively subsumed : 0
% 1.43/0.79 % Contextual simplify-reflections : 19
% 1.43/0.79 % Paramodulations : 642
% 1.43/0.79 % Factorizations : 0
% 1.43/0.79 % NegExts : 0
% 1.43/0.79 % Equation resolutions : 37
% 1.43/0.79 % Disequality decompositions : 0
% 1.43/0.79 % Total rewrite steps : 463
% 1.43/0.79 % ...of those cached : 417
% 1.43/0.79 % Propositional unsat checks : 0
% 1.43/0.79 % Propositional check models : 0
% 1.43/0.79 % Propositional check unsatisfiable : 0
% 1.43/0.79 % Propositional clauses : 0
% 1.43/0.79 % Propositional clauses after purity: 0
% 1.43/0.79 % Propositional unsat core size : 0
% 1.43/0.79 % Propositional preprocessing time : 0.000
% 1.43/0.79 % Propositional encoding time : 0.000
% 1.43/0.79 % Propositional solver time : 0.000
% 1.43/0.79 % Success case prop preproc time : 0.000
% 1.43/0.79 % Success case prop encoding time : 0.000
% 1.43/0.79 % Success case prop solver time : 0.000
% 1.43/0.79 % Current number of processed clauses : 269
% 1.43/0.79 % Positive orientable unit clauses : 58
% 1.43/0.79 % Positive unorientable unit clauses: 0
% 1.43/0.79 % Negative unit clauses : 19
% 1.43/0.79 % Non-unit-clauses : 192
% 1.43/0.79 % Current number of unprocessed clauses: 4259
% 1.43/0.79 % ...number of literals in the above : 51744
% 1.43/0.79 % Current number of archived formulas : 0
% 1.43/0.79 % Current number of archived clauses : 26
% 1.43/0.79 % Clause-clause subsumption calls (NU) : 4456
% 1.43/0.79 % Rec. Clause-clause subsumption calls : 2843
% 1.43/0.79 % Non-unit clause-clause subsumptions : 76
% 1.43/0.79 % Unit Clause-clause subsumption calls : 648
% 1.43/0.79 % Rewrite failures with RHS unbound : 0
% 1.43/0.79 % BW rewrite match attempts : 8
% 1.43/0.79 % BW rewrite match successes : 8
% 1.43/0.79 % Condensation attempts : 0
% 1.43/0.79 % Condensation successes : 0
% 1.43/0.79 % Termbank termtop insertions : 342540
% 1.43/0.79 % Search garbage collected termcells : 26791
% 1.43/0.79
% 1.43/0.79 % -------------------------------------------------
% 1.43/0.79 % User time : 0.285 s
% 1.43/0.79 % System time : 0.029 s
% 1.43/0.79 % Total time : 0.314 s
% 1.43/0.79 % Maximum resident set size: 15028 pages
% 1.43/0.79
% 1.43/0.79 % -------------------------------------------------
% 1.43/0.79 % User time : 0.993 s
% 1.43/0.79 % System time : 0.080 s
% 1.43/0.79 % Total time : 1.073 s
% 1.43/0.79 % Maximum resident set size: 4864 pages
% 1.43/0.79 % E exiting
%------------------------------------------------------------------------------