%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM549+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 : n008.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:31 PM UTC 2026
% Result : Theorem 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 7 unt; 0 def)
% Number of atoms : 69 ( 24 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 71 ( 29 ~; 23 |; 14 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 22 ( 0 sgn 11 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aElementOf0(X1,xQ)
& aElement0(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( ~ ? [X2] : aElementOf0(X2,X1)
& aSet0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmp) ).
fof(mCardEmpty,axiom,
! [X1] :
( aSet0(X1)
=> ( sbrdtbr0(X1) = sz00
<=> X1 = slcrc0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardEmpty) ).
fof(m__2202_02,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2202_02) ).
fof(m__2291,hypothesis,
( sbrdtbr0(xQ) = xk
& isFinite0(xQ)
& aSet0(xQ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2291) ).
fof(c_0_6,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,xQ)
& aElement0(X1) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,plain,
! [X54,X55] :
( aElement0(X55)
| ~ aElementOf0(X55,X54)
| ~ aSet0(X54) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_8,plain,
! [X15,X16,X17] :
( ( X17 = slcrc0
| aElementOf0(esk2_1(X17),X17)
| ~ aSet0(X17) )
& ( X15 != slcrc0
| ~ aElementOf0(X16,X15) )
& ( X15 != slcrc0
| aSet0(X15) ) ),
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)],[mDefEmp])])])])])])]) ).
fof(c_0_9,negated_conjecture,
! [X5] :
( ~ aElementOf0(X5,xQ)
| ~ aElement0(X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_10,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ aSet0(X1)
| X1 = slcrc0
| aElementOf0(esk2_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( ~ aElementOf0(X1,xQ)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ aSet0(X1)
| aElement0(esk2_1(X1))
| X1 = slcrc0 ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_14,plain,
! [X11] :
( ( ~ aSet0(X11)
| sbrdtbr0(X11) = sz00
| X11 != slcrc0 )
& ( ~ aSet0(X11)
| X11 = slcrc0
| sbrdtbr0(X11) != sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardEmpty])])])]) ).
cnf(c_0_15,plain,
( X1 != slcrc0
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_16,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
inference(fof_simplification,[status(thm)],[m__2202_02]) ).
cnf(c_0_17,negated_conjecture,
( ~ aSet0(X1)
| ~ aElementOf0(esk2_1(X1),xQ)
| X1 = slcrc0 ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[m__2291]) ).
cnf(c_0_19,plain,
( ~ aSet0(X1)
| X1 != slcrc0
| sbrdtbr0(X1) = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_15]) ).
fof(c_0_21,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
inference(fof_nnf,[status(thm)],[c_0_16]) ).
cnf(c_0_22,hypothesis,
sbrdtbr0(xQ) = xk,
inference(split_conjunct,[status(thm)],[m__2291]) ).
cnf(c_0_23,negated_conjecture,
xQ = slcrc0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_11]),c_0_18])]) ).
cnf(c_0_24,plain,
sbrdtbr0(slcrc0) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_19]),c_0_20])]) ).
cnf(c_0_25,hypothesis,
xk != sz00,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM549+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.36 % Computer : n008.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 02:39:54 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/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.14/0.44 % Version: 3.5.1
% 0.14/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % Starting sh5l with 300s (1) cores
% 0.14/0.44 % new_bool_1 with pid 4163254 completed with status 0
% 0.14/0.44 % Result found by new_bool_1
% 0.14/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % SubtermCWHack with pid 4163256 completed with status 0
% 0.14/0.44 % Result found by SubtermCWHack
% 0.14/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % Preprocessing time : 0.003 s
% 0.14/0.44
% 0.14/0.44 % Proof found!
% 0.14/0.44 % SZS status Theorem
% 0.14/0.44 % SZS output start CNFRefutation
% See solution above
% 0.14/0.44 % Parsed axioms : 67
% 0.14/0.44 % Removed by relevancy pruning/SinE : 5
% 0.14/0.44 % Initial clauses : 111
% 0.14/0.44 % Removed in clause preprocessing : 5
% 0.14/0.44 % Initial clauses in saturation : 106
% 0.14/0.44 % Processed clauses : 74
% 0.14/0.44 % ...of these trivial : 0
% 0.14/0.44 % ...subsumed : 6
% 0.14/0.44 % ...remaining for further processing : 68
% 0.14/0.44 % Other redundant clauses eliminated : 6
% 0.14/0.44 % Clauses deleted for lack of memory : 0
% 0.14/0.44 % Backward-subsumed : 1
% 0.14/0.44 % Backward-rewritten : 14
% 0.14/0.44 % Generated clauses : 56
% 0.14/0.44 % ...of the previous two non-redundant : 48
% 0.14/0.44 % ...aggressively subsumed : 0
% 0.14/0.44 % Contextual simplify-reflections : 0
% 0.14/0.44 % Paramodulations : 50
% 0.14/0.44 % Factorizations : 0
% 0.14/0.44 % NegExts : 0
% 0.14/0.44 % Equation resolutions : 6
% 0.14/0.44 % Disequality decompositions : 0
% 0.14/0.44 % Total rewrite steps : 61
% 0.14/0.44 % ...of those cached : 48
% 0.14/0.44 % Propositional unsat checks : 0
% 0.14/0.44 % Propositional check models : 0
% 0.14/0.44 % Propositional check unsatisfiable : 0
% 0.14/0.44 % Propositional clauses : 0
% 0.14/0.44 % Propositional clauses after purity: 0
% 0.14/0.44 % Propositional unsat core size : 0
% 0.14/0.44 % Propositional preprocessing time : 0.000
% 0.14/0.44 % Propositional encoding time : 0.000
% 0.14/0.44 % Propositional solver time : 0.000
% 0.14/0.44 % Success case prop preproc time : 0.000
% 0.14/0.44 % Success case prop encoding time : 0.000
% 0.14/0.44 % Success case prop solver time : 0.000
% 0.14/0.44 % Current number of processed clauses : 48
% 0.14/0.44 % Positive orientable unit clauses : 16
% 0.14/0.44 % Positive unorientable unit clauses: 0
% 0.14/0.44 % Negative unit clauses : 5
% 0.14/0.44 % Non-unit-clauses : 27
% 0.14/0.44 % Current number of unprocessed clauses: 70
% 0.14/0.44 % ...number of literals in the above : 336
% 0.14/0.44 % Current number of archived formulas : 0
% 0.14/0.44 % Current number of archived clauses : 15
% 0.14/0.44 % Clause-clause subsumption calls (NU) : 120
% 0.14/0.44 % Rec. Clause-clause subsumption calls : 91
% 0.14/0.44 % Non-unit clause-clause subsumptions : 4
% 0.14/0.44 % Unit Clause-clause subsumption calls : 49
% 0.14/0.44 % Rewrite failures with RHS unbound : 0
% 0.14/0.44 % BW rewrite match attempts : 1
% 0.14/0.44 % BW rewrite match successes : 1
% 0.14/0.44 % Condensation attempts : 0
% 0.14/0.44 % Condensation successes : 0
% 0.14/0.44 % Termbank termtop insertions : 9358
% 0.14/0.44 % Search garbage collected termcells : 2071
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.009 s
% 0.14/0.44 % System time : 0.004 s
% 0.14/0.44 % Total time : 0.013 s
% 0.14/0.44 % Maximum resident set size: 3964 pages
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.011 s
% 0.14/0.44 % System time : 0.009 s
% 0.14/0.44 % Total time : 0.020 s
% 0.14/0.44 % Maximum resident set size: 4864 pages
% 0.14/0.44 % E exiting
%------------------------------------------------------------------------------