%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM584+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 : n005.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:39 PM UTC 2026
% Result : Theorem 0.46s 0.50s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 28 ( 17 unt; 0 def)
% Number of atoms : 106 ( 19 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 133 ( 55 ~; 55 |; 17 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 8 con; 0-3 aty)
% Number of variables : 26 ( 0 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mDefSel,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aSet0(X1) )
=> ! [X3] :
( X3 = slbdtsldtrb0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( sbrdtbr0(X4) = X2
& aSubsetOf0(X4,X1) ) )
& aSet0(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSel) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
fof(m__4007,hypothesis,
sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4007) ).
fof(m__3418,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3418) ).
fof(m__3435,hypothesis,
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
fof(m__3453,hypothesis,
( aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& aFunction0(xc) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3453) ).
fof(m__4024,hypothesis,
aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4024) ).
fof(c_0_9,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_10,plain,
! [X120,X121,X122,X123,X124,X125] :
( ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| aElementOf0(esk11_3(X120,X121,X125),X125)
| sbrdtbr0(esk11_3(X120,X121,X125)) = X121 )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| aElementOf0(esk11_3(X120,X121,X125),X125)
| aSubsetOf0(esk11_3(X120,X121,X125),X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| sbrdtbr0(esk11_3(X120,X121,X125)) != X121
| ~ aSubsetOf0(esk11_3(X120,X121,X125),X120)
| ~ aElementOf0(esk11_3(X120,X121,X125),X125) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| aElementOf0(X124,X122)
| sbrdtbr0(X124) != X121
| ~ aSubsetOf0(X124,X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| ~ aElementOf0(X123,X122)
| sbrdtbr0(X123) = X121 )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| ~ aElementOf0(X123,X122)
| aSubsetOf0(X123,X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| aSet0(X122) ) ),
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)],[mDefSel])])])])])])]) ).
fof(c_0_11,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( ~ aElementOf0(X3,szNzAzT0)
| ~ aSet0(X2)
| X4 != slbdtsldtrb0(X2,X3)
| sbrdtbr0(X1) != X3
| ~ aSubsetOf0(X1,X2)
| aElementOf0(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X19,X20,X21,X22] :
( ( ~ aSet0(X19)
| aSubsetOf0(X22,X19)
| ~ aSet0(X22)
| ~ aElementOf0(esk2_2(X19,X22),X19) )
& ( ~ aSet0(X19)
| aSubsetOf0(X22,X19)
| ~ aSet0(X22)
| aElementOf0(esk2_2(X19,X22),X22) )
& ( ~ aSet0(X19)
| ~ aSubsetOf0(X20,X19)
| aElementOf0(X21,X19)
| ~ aElementOf0(X21,X20) )
& ( ~ aSet0(X19)
| ~ aSubsetOf0(X20,X19)
| aSet0(X20) ) ),
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])])])])])])]) ).
fof(c_0_14,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ aSet0(X2)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| ~ aSubsetOf0(X1,X2)
| aElementOf0(X1,slbdtsldtrb0(X2,sbrdtbr0(X1))) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_12])]) ).
cnf(c_0_16,hypothesis,
sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK,
inference(split_conjunct,[status(thm)],[m__4007]) ).
cnf(c_0_17,hypothesis,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3418]) ).
cnf(c_0_18,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_20,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_21,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,hypothesis,
szDzozmdt0(xc) = slbdtsldtrb0(xS,xK),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_23,hypothesis,
( ~ aSet0(X1)
| ~ aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),X1)
| aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(X1,xK)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_24,hypothesis,
aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS),
inference(split_conjunct,[status(thm)],[m__4024]) ).
cnf(c_0_25,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_26,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),szDzozmdt0(xc)),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_24]),c_0_25])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM584+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n005.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:41:48 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.46/0.50 % Version: 3.5.1
% 0.46/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.46/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.46/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.46/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.46/0.50 % Starting sh5l with 300s (1) cores
% 0.46/0.50 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2377975 completed with status 0
% 0.46/0.50 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.46/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.46/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.46/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.46/0.50 % No SInE strategy applied
% 0.46/0.50 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.46/0.50 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.46/0.50 % Starting SubtermCWHack with 151s (1) cores
% 0.46/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 0.46/0.50 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.46/0.50 % Starting G-E--_302_C18_F1_URBAN_S0Y with 151s (1) cores
% 0.46/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 146s (1) cores
% 0.46/0.50 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2377981 completed with status 0
% 0.46/0.50 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.46/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.46/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.46/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.46/0.50 % No SInE strategy applied
% 0.46/0.50 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.46/0.50 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.46/0.50 % Starting SubtermCWHack with 151s (1) cores
% 0.46/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 0.46/0.50 % Preprocessing time : 0.003 s
% 0.46/0.50 % Presaturation interreduction done
% 0.46/0.50
% 0.46/0.50 % Proof found!
% 0.46/0.50 % SZS status Theorem
% 0.46/0.50 % SZS output start CNFRefutation
% See solution above
% 0.46/0.50 % Parsed axioms : 89
% 0.46/0.50 % Removed by relevancy pruning/SinE : 0
% 0.46/0.50 % Initial clauses : 174
% 0.46/0.50 % Removed in clause preprocessing : 7
% 0.46/0.50 % Initial clauses in saturation : 167
% 0.46/0.50 % Processed clauses : 542
% 0.46/0.50 % ...of these trivial : 1
% 0.46/0.50 % ...subsumed : 55
% 0.46/0.50 % ...remaining for further processing : 486
% 0.46/0.50 % Other redundant clauses eliminated : 53
% 0.46/0.50 % Clauses deleted for lack of memory : 0
% 0.46/0.50 % Backward-subsumed : 2
% 0.46/0.50 % Backward-rewritten : 4
% 0.46/0.50 % Generated clauses : 965
% 0.46/0.50 % ...of the previous two non-redundant : 867
% 0.46/0.50 % ...aggressively subsumed : 0
% 0.46/0.50 % Contextual simplify-reflections : 19
% 0.46/0.50 % Paramodulations : 914
% 0.46/0.50 % Factorizations : 0
% 0.46/0.50 % NegExts : 0
% 0.46/0.50 % Equation resolutions : 56
% 0.46/0.50 % Disequality decompositions : 0
% 0.46/0.50 % Total rewrite steps : 478
% 0.46/0.50 % ...of those cached : 438
% 0.46/0.50 % Propositional unsat checks : 0
% 0.46/0.50 % Propositional check models : 0
% 0.46/0.50 % Propositional check unsatisfiable : 0
% 0.46/0.50 % Propositional clauses : 0
% 0.46/0.50 % Propositional clauses after purity: 0
% 0.46/0.50 % Propositional unsat core size : 0
% 0.46/0.50 % Propositional preprocessing time : 0.000
% 0.46/0.50 % Propositional encoding time : 0.000
% 0.46/0.50 % Propositional solver time : 0.000
% 0.46/0.50 % Success case prop preproc time : 0.000
% 0.46/0.50 % Success case prop encoding time : 0.000
% 0.46/0.50 % Success case prop solver time : 0.000
% 0.46/0.50 % Current number of processed clauses : 274
% 0.46/0.50 % Positive orientable unit clauses : 53
% 0.46/0.50 % Positive unorientable unit clauses: 0
% 0.46/0.50 % Negative unit clauses : 11
% 0.46/0.50 % Non-unit-clauses : 210
% 0.46/0.50 % Current number of unprocessed clauses: 654
% 0.46/0.50 % ...number of literals in the above : 3702
% 0.46/0.50 % Current number of archived formulas : 0
% 0.46/0.50 % Current number of archived clauses : 172
% 0.46/0.50 % Clause-clause subsumption calls (NU) : 12801
% 0.46/0.50 % Rec. Clause-clause subsumption calls : 2766
% 0.46/0.50 % Non-unit clause-clause subsumptions : 53
% 0.46/0.50 % Unit Clause-clause subsumption calls : 268
% 0.46/0.50 % Rewrite failures with RHS unbound : 0
% 0.46/0.50 % BW rewrite match attempts : 4
% 0.46/0.50 % BW rewrite match successes : 4
% 0.46/0.50 % Condensation attempts : 0
% 0.46/0.50 % Condensation successes : 0
% 0.46/0.50 % Termbank termtop insertions : 34299
% 0.46/0.50 % Search garbage collected termcells : 3465
% 0.46/0.50
% 0.46/0.50 % -------------------------------------------------
% 0.46/0.50 % User time : 0.058 s
% 0.46/0.50 % System time : 0.007 s
% 0.46/0.50 % Total time : 0.065 s
% 0.46/0.50 % Maximum resident set size: 4000 pages
% 0.46/0.50
% 0.46/0.50 % -------------------------------------------------
% 0.46/0.50 % User time : 0.170 s
% 0.46/0.50 % System time : 0.024 s
% 0.46/0.50 % Total time : 0.194 s
% 0.46/0.50 % Maximum resident set size: 4608 pages
% 0.46/0.50 % E exiting
%------------------------------------------------------------------------------