%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM607+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 : n011.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:45 PM UTC 2026
% Result : Theorem 0.15s 5.52s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 42 ( 20 unt; 0 def)
% Number of atoms : 150 ( 25 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 187 ( 79 ~; 76 |; 24 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 10 con; 0-3 aty)
% Number of variables : 46 ( 0 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(m__,conjecture,
aElementOf0(xQ,szDzozmdt0(xc)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__5078,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5078) ).
fof(m__3418,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3418) ).
fof(m__4891,hypothesis,
( xO = sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aSet0(xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4891) ).
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(mSubTrans,axiom,
! [X1,X2,X3] :
( ( aSet0(X3)
& aSet0(X2)
& aSet0(X1) )
=> ( ( aSubsetOf0(X2,X3)
& aSubsetOf0(X1,X2) )
=> aSubsetOf0(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubTrans) ).
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__5093,hypothesis,
( xQ != slcrc0
& aSubsetOf0(xQ,xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5093) ).
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__4998,hypothesis,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4998) ).
fof(c_0_12,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])])])])])])]) ).
cnf(c_0_13,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X4)
| X3 != slbdtsldtrb0(X4,X2)
| ~ aElementOf0(X1,X3)
| sbrdtbr0(X1) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_14,negated_conjecture,
~ aElementOf0(xQ,szDzozmdt0(xc)),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_15,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_12]) ).
cnf(c_0_16,plain,
( ~ aSet0(X3)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
| sbrdtbr0(X1) = X2 ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_17,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
inference(split_conjunct,[status(thm)],[m__5078]) ).
cnf(c_0_18,hypothesis,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3418]) ).
cnf(c_0_19,hypothesis,
aSet0(xO),
inference(split_conjunct,[status(thm)],[m__4891]) ).
fof(c_0_20,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_21,negated_conjecture,
~ aElementOf0(xQ,szDzozmdt0(xc)),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_22,plain,
! [X29,X30,X31] :
( aSubsetOf0(X29,X31)
| ~ aSubsetOf0(X30,X31)
| ~ aSubsetOf0(X29,X30)
| ~ aSet0(X31)
| ~ aSet0(X30)
| ~ aSet0(X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubTrans])])]) ).
cnf(c_0_23,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_15])]) ).
cnf(c_0_24,hypothesis,
sbrdtbr0(xQ) = xK,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_25,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_27,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
fof(c_0_28,negated_conjecture,
~ aElementOf0(xQ,szDzozmdt0(xc)),
inference(fof_nnf,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( ~ aSubsetOf0(X2,X3)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X3)
| ~ aSet0(X2)
| ~ aSet0(X1)
| aSubsetOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_30,hypothesis,
( xQ != slcrc0
& aSubsetOf0(xQ,xO) ),
inference(fof_simplification,[status(thm)],[m__5093]) ).
cnf(c_0_31,hypothesis,
( ~ aSet0(X1)
| ~ aSubsetOf0(xQ,X1)
| aElementOf0(xQ,slbdtsldtrb0(X1,xK)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18])]) ).
cnf(c_0_32,hypothesis,
szDzozmdt0(xc) = slbdtsldtrb0(xS,xK),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_33,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_34,negated_conjecture,
~ aElementOf0(xQ,szDzozmdt0(xc)),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSubsetOf0(X3,X2)
| aSubsetOf0(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_29,c_0_25]),c_0_25]) ).
cnf(c_0_36,hypothesis,
aSubsetOf0(xO,xS),
inference(split_conjunct,[status(thm)],[m__4998]) ).
fof(c_0_37,hypothesis,
( xQ != slcrc0
& aSubsetOf0(xQ,xO) ),
inference(fof_nnf,[status(thm)],[c_0_30]) ).
cnf(c_0_38,hypothesis,
~ aSubsetOf0(xQ,xS),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),c_0_34]) ).
cnf(c_0_39,hypothesis,
( ~ aSubsetOf0(X1,xO)
| aSubsetOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_33])]) ).
cnf(c_0_40,hypothesis,
aSubsetOf0(xQ,xO),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,hypothesis,
$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.02 % Problem : NUM607+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.10/5.38 % Computer : n011.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Mon Sep 21 02:44:46 UTC 2026
% 0.10/5.39 % CPUTime :
% 0.10/5.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.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
% 0.15/5.52 % Version: 3.5.1
% 0.15/5.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.52 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.52 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.52 % Starting sh5l with 300s (1) cores
% 0.15/5.52 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 800109 completed with status 0
% 0.15/5.52 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/5.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.52 % No SInE strategy applied
% 0.15/5.52 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.15/5.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.52 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/5.52 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/5.52 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.15/5.52 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.15/5.52 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 800116 completed with status 0
% 0.15/5.52 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.15/5.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.52 % No SInE strategy applied
% 0.15/5.52 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.15/5.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.52 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/5.52 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/5.52 % Preprocessing time : 0.005 s
% 0.15/5.52 % Presaturation interreduction done
% 0.15/5.52
% 0.15/5.52 % Proof found!
% 0.15/5.52 % SZS status Theorem
% 0.15/5.52 % SZS output start CNFRefutation
% See solution above
% 0.15/5.52 % Parsed axioms : 102
% 0.15/5.52 % Removed by relevancy pruning/SinE : 0
% 0.15/5.52 % Initial clauses : 205
% 0.15/5.52 % Removed in clause preprocessing : 7
% 0.15/5.52 % Initial clauses in saturation : 198
% 0.15/5.52 % Processed clauses : 742
% 0.15/5.52 % ...of these trivial : 4
% 0.15/5.52 % ...subsumed : 135
% 0.15/5.52 % ...remaining for further processing : 603
% 0.15/5.52 % Other redundant clauses eliminated : 52
% 0.15/5.52 % Clauses deleted for lack of memory : 0
% 0.15/5.52 % Backward-subsumed : 23
% 0.15/5.52 % Backward-rewritten : 7
% 0.15/5.52 % Generated clauses : 885
% 0.15/5.52 % ...of the previous two non-redundant : 773
% 0.15/5.52 % ...aggressively subsumed : 0
% 0.15/5.52 % Contextual simplify-reflections : 36
% 0.15/5.52 % Paramodulations : 836
% 0.15/5.52 % Factorizations : 0
% 0.15/5.52 % NegExts : 0
% 0.15/5.52 % Equation resolutions : 54
% 0.15/5.52 % Disequality decompositions : 0
% 0.15/5.52 % Total rewrite steps : 622
% 0.15/5.52 % ...of those cached : 562
% 0.15/5.52 % Propositional unsat checks : 0
% 0.15/5.52 % Propositional check models : 0
% 0.15/5.52 % Propositional check unsatisfiable : 0
% 0.15/5.52 % Propositional clauses : 0
% 0.15/5.52 % Propositional clauses after purity: 0
% 0.15/5.52 % Propositional unsat core size : 0
% 0.15/5.52 % Propositional preprocessing time : 0.000
% 0.15/5.52 % Propositional encoding time : 0.000
% 0.15/5.52 % Propositional solver time : 0.000
% 0.15/5.52 % Success case prop preproc time : 0.000
% 0.15/5.52 % Success case prop encoding time : 0.000
% 0.15/5.52 % Success case prop solver time : 0.000
% 0.15/5.52 % Current number of processed clauses : 337
% 0.15/5.52 % Positive orientable unit clauses : 81
% 0.15/5.52 % Positive unorientable unit clauses: 0
% 0.15/5.52 % Negative unit clauses : 27
% 0.15/5.52 % Non-unit-clauses : 229
% 0.15/5.52 % Current number of unprocessed clauses: 423
% 0.15/5.52 % ...number of literals in the above : 2081
% 0.15/5.52 % Current number of archived formulas : 0
% 0.15/5.52 % Current number of archived clauses : 226
% 0.15/5.52 % Clause-clause subsumption calls (NU) : 16050
% 0.15/5.52 % Rec. Clause-clause subsumption calls : 5566
% 0.15/5.52 % Non-unit clause-clause subsumptions : 97
% 0.15/5.52 % Unit Clause-clause subsumption calls : 1766
% 0.15/5.52 % Rewrite failures with RHS unbound : 0
% 0.15/5.52 % BW rewrite match attempts : 4
% 0.15/5.52 % BW rewrite match successes : 4
% 0.15/5.52 % Condensation attempts : 0
% 0.15/5.52 % Condensation successes : 0
% 0.15/5.52 % Termbank termtop insertions : 31512
% 0.15/5.52 % Search garbage collected termcells : 3734
% 0.15/5.52
% 0.15/5.52 % -------------------------------------------------
% 0.15/5.52 % User time : 0.071 s
% 0.15/5.52 % System time : 0.005 s
% 0.15/5.52 % Total time : 0.075 s
% 0.15/5.52 % Maximum resident set size: 4276 pages
% 0.15/5.52
% 0.15/5.52 % -------------------------------------------------
% 0.15/5.52 % User time : 0.299 s
% 0.15/5.52 % System time : 0.030 s
% 0.15/5.52 % Total time : 0.329 s
% 0.15/5.52 % Maximum resident set size: 4608 pages
% 0.15/5.52 % E exiting
%------------------------------------------------------------------------------