%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM578+1 : 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 : n013.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 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 57 ( 19 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 66 ( 26 ~; 16 |; 10 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X1),X2)
=> ( szmzizndt0(sdtlpdtrp0(xN,X2)) != szmzizndt0(sdtlpdtrp0(xN,X1))
& aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) ) ) )
=> ( xi != xj
=> szmzizndt0(sdtlpdtrp0(xN,xi)) != szmzizndt0(sdtlpdtrp0(xN,xj)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__3856_02,hypothesis,
( xi != xj
=> ( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3856_02) ).
fof(m__3856,hypothesis,
( aElementOf0(xj,szNzAzT0)
& aElementOf0(xi,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3856) ).
fof(c_0_3,negated_conjecture,
~ ( ! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X1),X2)
=> ( szmzizndt0(sdtlpdtrp0(xN,X2)) != szmzizndt0(sdtlpdtrp0(xN,X1))
& aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) ) ) )
=> ( xi != xj
=> szmzizndt0(sdtlpdtrp0(xN,xi)) != szmzizndt0(sdtlpdtrp0(xN,xj)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,hypothesis,
( xi != xj
=> ( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi) ) ),
inference(fof_simplification,[status(thm)],[m__3856_02]) ).
fof(c_0_5,negated_conjecture,
~ ( ! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X1),X2)
=> ( szmzizndt0(sdtlpdtrp0(xN,X2)) != szmzizndt0(sdtlpdtrp0(xN,X1))
& aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) ) ) )
=> ( xi != xj
=> szmzizndt0(sdtlpdtrp0(xN,xi)) != szmzizndt0(sdtlpdtrp0(xN,xj)) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_6,hypothesis,
( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi)
| xi = xj ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
fof(c_0_7,negated_conjecture,
! [X187,X188] :
( szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj))
& xi != xj
& ( ~ aElementOf0(X188,szNzAzT0)
| ~ aElementOf0(X187,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X187),X188)
| szmzizndt0(sdtlpdtrp0(xN,X188)) != szmzizndt0(sdtlpdtrp0(xN,X187)) )
& ( ~ aElementOf0(X188,szNzAzT0)
| ~ aElementOf0(X187,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X187),X188)
| aSubsetOf0(sdtlpdtrp0(xN,X188),sdtmndt0(sdtlpdtrp0(xN,X187),szmzizndt0(sdtlpdtrp0(xN,X187)))) ) ),
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_5])])])])]) ).
cnf(c_0_8,hypothesis,
( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi)
| xi = xj ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
xi != xj,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X2),X1)
| szmzizndt0(sdtlpdtrp0(xN,X1)) != szmzizndt0(sdtlpdtrp0(xN,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi) ),
inference(sr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,hypothesis,
aElementOf0(xj,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3856]) ).
cnf(c_0_14,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3856]) ).
cnf(c_0_15,hypothesis,
sdtlseqdt0(szszuzczcdt0(xi),xj),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_12]),c_0_14]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM578+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n013.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 02:41:07 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.43 Running first-order theorem proving
% 0.10/0.43 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.18/0.47 % Version: 3.5.1
% 0.18/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 % Starting sh5l with 300s (1) cores
% 0.18/0.47 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3970232 completed with status 0
% 0.18/0.47 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.18/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.47 % No SInE strategy applied
% 0.18/0.47 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.18/0.47 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.47 % Starting SubtermCWHack with 151s (1) cores
% 0.18/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 0.18/0.47 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.18/0.47 % Starting G-E--_302_C18_F1_URBAN_S0Y with 151s (1) cores
% 0.18/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 146s (1) cores
% 0.18/0.47 % G-E--_300_C18_F1_SE_CS_SP_S0Y with pid 3970241 completed with status 0
% 0.18/0.47 % Result found by G-E--_300_C18_F1_SE_CS_SP_S0Y
% 0.18/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.47 % No SInE strategy applied
% 0.18/0.47 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.18/0.47 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.47 % Starting SubtermCWHack with 151s (1) cores
% 0.18/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 0.18/0.47 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.18/0.47 % Preprocessing time : 0.004 s
% 0.18/0.47
% 0.18/0.47 % Proof found!
% 0.18/0.47 % SZS status Theorem
% 0.18/0.47 % SZS output start CNFRefutation
% See solution above
% 0.18/0.47 % Parsed axioms : 86
% 0.18/0.47 % Removed by relevancy pruning/SinE : 0
% 0.18/0.47 % Initial clauses : 175
% 0.18/0.47 % Removed in clause preprocessing : 7
% 0.18/0.47 % Initial clauses in saturation : 168
% 0.18/0.47 % Processed clauses : 74
% 0.18/0.47 % ...of these trivial : 0
% 0.18/0.47 % ...subsumed : 4
% 0.18/0.47 % ...remaining for further processing : 70
% 0.18/0.47 % Other redundant clauses eliminated : 7
% 0.18/0.47 % Clauses deleted for lack of memory : 0
% 0.18/0.47 % Backward-subsumed : 0
% 0.18/0.47 % Backward-rewritten : 1
% 0.18/0.47 % Generated clauses : 42
% 0.18/0.47 % ...of the previous two non-redundant : 32
% 0.18/0.47 % ...aggressively subsumed : 0
% 0.18/0.47 % Contextual simplify-reflections : 0
% 0.18/0.47 % Paramodulations : 35
% 0.18/0.47 % Factorizations : 0
% 0.18/0.47 % NegExts : 0
% 0.18/0.47 % Equation resolutions : 8
% 0.18/0.47 % Disequality decompositions : 0
% 0.18/0.47 % Total rewrite steps : 39
% 0.18/0.47 % ...of those cached : 24
% 0.18/0.47 % Propositional unsat checks : 0
% 0.18/0.47 % Propositional check models : 0
% 0.18/0.47 % Propositional check unsatisfiable : 0
% 0.18/0.47 % Propositional clauses : 0
% 0.18/0.47 % Propositional clauses after purity: 0
% 0.18/0.47 % Propositional unsat core size : 0
% 0.18/0.47 % Propositional preprocessing time : 0.000
% 0.18/0.47 % Propositional encoding time : 0.000
% 0.18/0.47 % Propositional solver time : 0.000
% 0.18/0.47 % Success case prop preproc time : 0.000
% 0.18/0.47 % Success case prop encoding time : 0.000
% 0.18/0.47 % Success case prop solver time : 0.000
% 0.18/0.47 % Current number of processed clauses : 64
% 0.18/0.47 % Positive orientable unit clauses : 28
% 0.18/0.47 % Positive unorientable unit clauses: 0
% 0.18/0.47 % Negative unit clauses : 7
% 0.18/0.47 % Non-unit-clauses : 29
% 0.18/0.47 % Current number of unprocessed clauses: 126
% 0.18/0.47 % ...number of literals in the above : 611
% 0.18/0.47 % Current number of archived formulas : 0
% 0.18/0.47 % Current number of archived clauses : 1
% 0.18/0.47 % Clause-clause subsumption calls (NU) : 201
% 0.18/0.47 % Rec. Clause-clause subsumption calls : 129
% 0.18/0.47 % Non-unit clause-clause subsumptions : 2
% 0.18/0.47 % Unit Clause-clause subsumption calls : 54
% 0.18/0.47 % Rewrite failures with RHS unbound : 0
% 0.18/0.47 % BW rewrite match attempts : 1
% 0.18/0.47 % BW rewrite match successes : 1
% 0.18/0.47 % Condensation attempts : 0
% 0.18/0.47 % Condensation successes : 0
% 0.18/0.47 % Termbank termtop insertions : 14987
% 0.18/0.47 % Search garbage collected termcells : 3540
% 0.18/0.47
% 0.18/0.47 % -------------------------------------------------
% 0.18/0.47 % User time : 0.019 s
% 0.18/0.47 % System time : 0.004 s
% 0.18/0.47 % Total time : 0.023 s
% 0.18/0.47 % Maximum resident set size: 4256 pages
% 0.18/0.47
% 0.18/0.47 % -------------------------------------------------
% 0.18/0.47 % User time : 0.046 s
% 0.18/0.47 % System time : 0.014 s
% 0.18/0.47 % Total time : 0.060 s
% 0.18/0.47 % Maximum resident set size: 4608 pages
% 0.18/0.47 % E exiting
%------------------------------------------------------------------------------