%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM574+1 : 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 : n018.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 0.38s 0.53s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 42 ( 13 unt; 0 def)
% Number of atoms : 123 ( 22 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 131 ( 50 ~; 47 |; 21 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__3786_02,hypothesis,
( ( ? [X1] :
( szszuzczcdt0(X1) = xi
& aElementOf0(X1,szNzAzT0) )
& sdtlseqdt0(xj,xi) )
=> ( sdtlseqdt0(xj,xi)
=> aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3786_02) ).
fof(m__,conjecture,
( sdtlseqdt0(xj,xi)
=> aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mNatExtra,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ? [X2] :
( X1 = szszuzczcdt0(X2)
& aElementOf0(X2,szNzAzT0) )
| X1 = sz00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNatExtra) ).
fof(mNoScLessZr,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNoScLessZr) ).
fof(m__3786,hypothesis,
( aElementOf0(xi,szNzAzT0)
& aElementOf0(xj,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3786) ).
fof(m__3623,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ( isCountable0(sdtlpdtrp0(xN,X1))
& aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) )
=> ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) ) ) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3623) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSubRefl) ).
fof(m__3435,hypothesis,
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3435) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet) ).
fof(c_0_10,hypothesis,
! [X17] :
( aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj))
| ~ sdtlseqdt0(xj,xi)
| szszuzczcdt0(X17) != xi
| ~ aElementOf0(X17,szNzAzT0)
| ~ sdtlseqdt0(xj,xi) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3786_02])])])]) ).
fof(c_0_11,negated_conjecture,
~ ( sdtlseqdt0(xj,xi)
=> aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_12,hypothesis,
( ~ sdtlseqdt0(xj,xi)
| szszuzczcdt0(X1) != xi
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(xj,xi)
| aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,negated_conjecture,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj))
& sdtlseqdt0(xj,xi) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
cnf(c_0_14,hypothesis,
( ~ sdtlseqdt0(xj,xi)
| ~ aElementOf0(X1,szNzAzT0)
| szszuzczcdt0(X1) != xi
| aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)) ),
inference(cn,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
sdtlseqdt0(xj,xi),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X81] :
( ( ~ aElementOf0(X81,szNzAzT0)
| X81 = sz00
| X81 = szszuzczcdt0(esk11_1(X81)) )
& ( ~ aElementOf0(X81,szNzAzT0)
| X81 = sz00
| aElementOf0(esk11_1(X81),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mNatExtra])])])])]) ).
fof(c_0_18,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
inference(fof_simplification,[status(thm)],[mNoScLessZr]) ).
cnf(c_0_19,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| szszuzczcdt0(X1) != xi ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),c_0_16]) ).
cnf(c_0_20,plain,
( ~ aElementOf0(X1,szNzAzT0)
| X1 = sz00
| X1 = szszuzczcdt0(esk11_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3786]) ).
fof(c_0_22,plain,
! [X84] :
( ~ sdtlseqdt0(szszuzczcdt0(X84),sz00)
| ~ aElementOf0(X84,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])]) ).
cnf(c_0_23,hypothesis,
( ~ aElementOf0(esk11_1(xi),szNzAzT0)
| xi = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20])]),c_0_21])]) ).
cnf(c_0_24,plain,
( ~ aElementOf0(X1,szNzAzT0)
| X1 = sz00
| aElementOf0(esk11_1(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( ~ sdtlseqdt0(szszuzczcdt0(X1),sz00)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,hypothesis,
xi = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21])]) ).
cnf(c_0_27,plain,
( ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(X1,sz00)
| X1 = sz00 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_24]) ).
cnf(c_0_28,negated_conjecture,
sdtlseqdt0(xj,sz00),
inference(rw,[status(thm)],[c_0_15,c_0_26]) ).
cnf(c_0_29,hypothesis,
aElementOf0(xj,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3786]) ).
fof(c_0_30,hypothesis,
! [X13] :
( ( ~ aElementOf0(X13,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X13))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X13),szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X13))) )
& ( ~ aElementOf0(X13,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X13))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X13),szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X13)),sdtmndt0(sdtlpdtrp0(xN,X13),szmzizndt0(sdtlpdtrp0(xN,X13)))) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3623])])])])]) ).
fof(c_0_31,plain,
! [X23,X24,X25,X26] :
( ( ~ aSet0(X23)
| aSubsetOf0(X26,X23)
| ~ aSet0(X26)
| ~ aElementOf0(esk3_2(X23,X26),X23) )
& ( ~ aSet0(X23)
| aSubsetOf0(X26,X23)
| ~ aSet0(X26)
| aElementOf0(esk3_2(X23,X26),X26) )
& ( ~ aSet0(X23)
| ~ aSubsetOf0(X24,X23)
| aElementOf0(X25,X23)
| ~ aElementOf0(X25,X24) )
& ( ~ aSet0(X23)
| ~ aSubsetOf0(X24,X23)
| aSet0(X24) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSub])])])])])])]) ).
cnf(c_0_32,negated_conjecture,
xj = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_33,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_34,plain,
! [X28] :
( aSubsetOf0(X28,X28)
| ~ aSet0(X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])])]) ).
cnf(c_0_35,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_37,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_38,negated_conjecture,
~ aSubsetOf0(xS,xS),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_32]),c_0_26]),c_0_33]),c_0_33]) ).
cnf(c_0_39,plain,
( ~ aSet0(X1)
| aSubsetOf0(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM574+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n018.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 02:43:15 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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
% 0.38/0.53 % Version: 3.5.1
% 0.38/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.38/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.38/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.38/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.38/0.53 % Starting sh5l with 300s (1) cores
% 0.38/0.53 % new_bool_3 with pid 793292 completed with status 0
% 0.38/0.53 % Result found by new_bool_3
% 0.38/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.38/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.38/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.38/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.38/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.38/0.53 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.38/0.53 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.53 % Starting SubtermCWHack with 28s (1) cores
% 0.38/0.53 % SubtermCWHack with pid 793295 completed with status 0
% 0.38/0.53 % Result found by SubtermCWHack
% 0.38/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.38/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.38/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.38/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.38/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.38/0.53 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.38/0.53 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.53 % Starting SubtermCWHack with 28s (1) cores
% 0.38/0.53 % Preprocessing time : 0.005 s
% 0.38/0.53
% 0.38/0.53 % Proof found!
% 0.38/0.53 % SZS status Theorem
% 0.38/0.53 % SZS output start CNFRefutation
% See solution above
% 0.38/0.53 % Parsed axioms : 86
% 0.38/0.53 % Removed by relevancy pruning/SinE : 5
% 0.38/0.53 % Initial clauses : 154
% 0.38/0.53 % Removed in clause preprocessing : 7
% 0.38/0.53 % Initial clauses in saturation : 147
% 0.38/0.53 % Processed clauses : 362
% 0.38/0.53 % ...of these trivial : 0
% 0.38/0.53 % ...subsumed : 96
% 0.38/0.53 % ...remaining for further processing : 266
% 0.38/0.53 % Other redundant clauses eliminated : 35
% 0.38/0.53 % Clauses deleted for lack of memory : 0
% 0.38/0.53 % Backward-subsumed : 9
% 0.38/0.53 % Backward-rewritten : 22
% 0.38/0.53 % Generated clauses : 561
% 0.38/0.53 % ...of the previous two non-redundant : 457
% 0.38/0.53 % ...aggressively subsumed : 0
% 0.38/0.53 % Contextual simplify-reflections : 12
% 0.38/0.53 % Paramodulations : 528
% 0.38/0.53 % Factorizations : 0
% 0.38/0.53 % NegExts : 0
% 0.38/0.53 % Equation resolutions : 36
% 0.38/0.53 % Disequality decompositions : 0
% 0.38/0.53 % Total rewrite steps : 405
% 0.38/0.53 % ...of those cached : 364
% 0.38/0.53 % Propositional unsat checks : 0
% 0.38/0.53 % Propositional check models : 0
% 0.38/0.53 % Propositional check unsatisfiable : 0
% 0.38/0.53 % Propositional clauses : 0
% 0.38/0.53 % Propositional clauses after purity: 0
% 0.38/0.53 % Propositional unsat core size : 0
% 0.38/0.53 % Propositional preprocessing time : 0.000
% 0.38/0.53 % Propositional encoding time : 0.000
% 0.38/0.53 % Propositional solver time : 0.000
% 0.38/0.53 % Success case prop preproc time : 0.000
% 0.38/0.53 % Success case prop encoding time : 0.000
% 0.38/0.53 % Success case prop solver time : 0.000
% 0.38/0.53 % Current number of processed clauses : 209
% 0.38/0.53 % Positive orientable unit clauses : 46
% 0.38/0.53 % Positive unorientable unit clauses: 0
% 0.38/0.53 % Negative unit clauses : 16
% 0.38/0.53 % Non-unit-clauses : 147
% 0.38/0.53 % Current number of unprocessed clauses: 239
% 0.38/0.53 % ...number of literals in the above : 1240
% 0.38/0.53 % Current number of archived formulas : 0
% 0.38/0.53 % Current number of archived clauses : 31
% 0.38/0.53 % Clause-clause subsumption calls (NU) : 5261
% 0.38/0.53 % Rec. Clause-clause subsumption calls : 2714
% 0.38/0.53 % Non-unit clause-clause subsumptions : 75
% 0.38/0.53 % Unit Clause-clause subsumption calls : 858
% 0.38/0.53 % Rewrite failures with RHS unbound : 0
% 0.38/0.53 % BW rewrite match attempts : 8
% 0.38/0.53 % BW rewrite match successes : 8
% 0.38/0.53 % Condensation attempts : 0
% 0.38/0.53 % Condensation successes : 0
% 0.38/0.53 % Termbank termtop insertions : 20716
% 0.38/0.53 % Search garbage collected termcells : 3059
% 0.38/0.53
% 0.38/0.53 % -------------------------------------------------
% 0.38/0.53 % User time : 0.051 s
% 0.38/0.53 % System time : 0.010 s
% 0.38/0.53 % Total time : 0.061 s
% 0.38/0.53 % Maximum resident set size: 4256 pages
% 0.38/0.53
% 0.38/0.53 % -------------------------------------------------
% 0.38/0.53 % User time : 0.056 s
% 0.38/0.53 % System time : 0.017 s
% 0.38/0.53 % Total time : 0.073 s
% 0.38/0.53 % Maximum resident set size: 4864 pages
% 0.38/0.53 % E exiting
%------------------------------------------------------------------------------