%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM587+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 : n017.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:40 PM UTC 2026
% Result : Theorem 0.24s 0.53s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 11 unt; 0 def)
% Number of atoms : 44 ( 3 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 44 ( 18 ~; 15 |; 8 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
aElementOf0(xx,xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
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(m__3453,hypothesis,
( aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& aFunction0(xc) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3453) ).
fof(m__3291,hypothesis,
( isFinite0(xT)
& aSet0(xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3291) ).
fof(m__4263,hypothesis,
( aElementOf0(sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),sdtlcdtrc0(xc,szDzozmdt0(xc)))
& xx = sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4263) ).
fof(c_0_5,negated_conjecture,
~ aElementOf0(xx,xT),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X36,X37,X38,X39] :
( ( ~ aSet0(X36)
| aSubsetOf0(X39,X36)
| ~ aSet0(X39)
| ~ aElementOf0(esk3_2(X36,X39),X36) )
& ( ~ aSet0(X36)
| aSubsetOf0(X39,X36)
| ~ aSet0(X39)
| aElementOf0(esk3_2(X36,X39),X39) )
& ( ~ aSet0(X36)
| ~ aSubsetOf0(X37,X36)
| aElementOf0(X38,X36)
| ~ aElementOf0(X38,X37) )
& ( ~ aSet0(X36)
| ~ aSubsetOf0(X37,X36)
| aSet0(X37) ) ),
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_7,negated_conjecture,
~ aElementOf0(xx,xT),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT),
inference(split_conjunct,[status(thm)],[m__3453]) ).
cnf(c_0_10,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[m__3291]) ).
cnf(c_0_11,hypothesis,
aElementOf0(sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),sdtlcdtrc0(xc,szDzozmdt0(xc))),
inference(split_conjunct,[status(thm)],[m__4263]) ).
cnf(c_0_12,hypothesis,
xx = sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),
inference(split_conjunct,[status(thm)],[m__4263]) ).
fof(c_0_13,negated_conjecture,
~ aElementOf0(xx,xT),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
cnf(c_0_14,hypothesis,
( ~ aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))
| aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_15,hypothesis,
aElementOf0(xx,sdtlcdtrc0(xc,szDzozmdt0(xc))),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
~ aElementOf0(xx,xT),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM587+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n017.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 02:37:29 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.24/0.53 % Version: 3.5.1
% 0.24/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.53 % Starting sh5l with 300s (1) cores
% 0.24/0.53 % new_bool_3 with pid 1242787 completed with status 0
% 0.24/0.53 % Result found by new_bool_3
% 0.24/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.53 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.24/0.53 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.53 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.53 % SubtermCWHack with pid 1242790 completed with status 0
% 0.24/0.53 % Result found by SubtermCWHack
% 0.24/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.53 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.24/0.53 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.53 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.53 % Preprocessing time : 0.005 s
% 0.24/0.53
% 0.24/0.53 % Proof found!
% 0.24/0.53 % SZS status Theorem
% 0.24/0.53 % SZS output start CNFRefutation
% See solution above
% 0.24/0.53 % Parsed axioms : 91
% 0.24/0.53 % Removed by relevancy pruning/SinE : 5
% 0.24/0.53 % Initial clauses : 163
% 0.24/0.53 % Removed in clause preprocessing : 7
% 0.24/0.53 % Initial clauses in saturation : 156
% 0.24/0.53 % Processed clauses : 184
% 0.24/0.53 % ...of these trivial : 0
% 0.24/0.53 % ...subsumed : 18
% 0.24/0.53 % ...remaining for further processing : 166
% 0.24/0.53 % Other redundant clauses eliminated : 19
% 0.24/0.53 % Clauses deleted for lack of memory : 0
% 0.24/0.53 % Backward-subsumed : 4
% 0.24/0.53 % Backward-rewritten : 1
% 0.24/0.53 % Generated clauses : 184
% 0.24/0.53 % ...of the previous two non-redundant : 140
% 0.24/0.53 % ...aggressively subsumed : 0
% 0.24/0.53 % Contextual simplify-reflections : 3
% 0.24/0.53 % Paramodulations : 166
% 0.24/0.53 % Factorizations : 0
% 0.24/0.53 % NegExts : 0
% 0.24/0.53 % Equation resolutions : 20
% 0.24/0.53 % Disequality decompositions : 0
% 0.24/0.53 % Total rewrite steps : 130
% 0.24/0.53 % ...of those cached : 106
% 0.24/0.53 % Propositional unsat checks : 0
% 0.24/0.53 % Propositional check models : 0
% 0.24/0.53 % Propositional check unsatisfiable : 0
% 0.24/0.53 % Propositional clauses : 0
% 0.24/0.53 % Propositional clauses after purity: 0
% 0.24/0.53 % Propositional unsat core size : 0
% 0.24/0.53 % Propositional preprocessing time : 0.000
% 0.24/0.53 % Propositional encoding time : 0.000
% 0.24/0.53 % Propositional solver time : 0.000
% 0.24/0.53 % Success case prop preproc time : 0.000
% 0.24/0.53 % Success case prop encoding time : 0.000
% 0.24/0.53 % Success case prop solver time : 0.000
% 0.24/0.53 % Current number of processed clauses : 148
% 0.24/0.53 % Positive orientable unit clauses : 41
% 0.24/0.53 % Positive unorientable unit clauses: 0
% 0.24/0.53 % Negative unit clauses : 10
% 0.24/0.53 % Non-unit-clauses : 97
% 0.24/0.53 % Current number of unprocessed clauses: 111
% 0.24/0.53 % ...number of literals in the above : 557
% 0.24/0.53 % Current number of archived formulas : 0
% 0.24/0.53 % Current number of archived clauses : 5
% 0.24/0.53 % Clause-clause subsumption calls (NU) : 1416
% 0.24/0.53 % Rec. Clause-clause subsumption calls : 991
% 0.24/0.53 % Non-unit clause-clause subsumptions : 16
% 0.24/0.53 % Unit Clause-clause subsumption calls : 205
% 0.24/0.53 % Rewrite failures with RHS unbound : 0
% 0.24/0.53 % BW rewrite match attempts : 1
% 0.24/0.53 % BW rewrite match successes : 1
% 0.24/0.53 % Condensation attempts : 0
% 0.24/0.53 % Condensation successes : 0
% 0.24/0.53 % Termbank termtop insertions : 15978
% 0.24/0.53 % Search garbage collected termcells : 3117
% 0.24/0.53
% 0.24/0.53 % -------------------------------------------------
% 0.24/0.53 % User time : 0.035 s
% 0.24/0.53 % System time : 0.008 s
% 0.24/0.53 % Total time : 0.044 s
% 0.24/0.53 % Maximum resident set size: 4212 pages
% 0.24/0.53
% 0.24/0.53 % -------------------------------------------------
% 0.24/0.53 % User time : 0.042 s
% 0.24/0.53 % System time : 0.014 s
% 0.24/0.53 % Total time : 0.057 s
% 0.24/0.53 % Maximum resident set size: 4864 pages
% 0.24/0.53 % E exiting
%------------------------------------------------------------------------------