%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM549+3 : 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 : n020.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.25s 0.65s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 8 unt; 0 def)
% Number of atoms : 81 ( 26 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 79 ( 29 ~; 24 |; 20 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 13 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2270,hypothesis,
( aElementOf0(xQ,slbdtsldtrb0(xS,xk))
& sbrdtbr0(xQ) = xk
& aSubsetOf0(xQ,xS)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
& aSet0(xQ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2270) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( ~ ? [X2] : aElementOf0(X2,X1)
& aSet0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).
fof(m__2202_02,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2202_02) ).
fof(m__,conjecture,
? [X1] :
( aElementOf0(X1,xQ)
& aElement0(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(mCardEmpty,axiom,
! [X1] :
( aSet0(X1)
=> ( sbrdtbr0(X1) = sz00
<=> X1 = slcrc0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardEmpty) ).
fof(c_0_6,hypothesis,
! [X19] :
( aElementOf0(xQ,slbdtsldtrb0(xS,xk))
& sbrdtbr0(xQ) = xk
& aSubsetOf0(xQ,xS)
& ( aElementOf0(X19,xS)
| ~ aElementOf0(X19,xQ) )
& aSet0(xQ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2270])])])]) ).
fof(c_0_7,plain,
! [X30,X31,X32] :
( ( X32 = slcrc0
| aElementOf0(esk6_1(X32),X32)
| ~ aSet0(X32) )
& ( X30 != slcrc0
| ~ aElementOf0(X31,X30) )
& ( X30 != slcrc0
| aSet0(X30) ) ),
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_8,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
inference(fof_simplification,[status(thm)],[m__2202_02]) ).
fof(c_0_9,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,xQ)
& aElement0(X1) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_10,plain,
! [X68,X69] :
( aElement0(X69)
| ~ aElementOf0(X69,X68)
| ~ aSet0(X68) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
cnf(c_0_11,hypothesis,
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( ~ aSet0(X1)
| X1 = slcrc0
| aElementOf0(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,hypothesis,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_14,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
fof(c_0_15,negated_conjecture,
! [X20] :
( ~ aElementOf0(X20,xQ)
| ~ aElement0(X20) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_16,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,hypothesis,
( aElementOf0(esk6_1(xQ),xS)
| xQ = slcrc0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_18,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( ~ aElementOf0(X1,xQ)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,hypothesis,
( aElement0(esk6_1(xQ))
| xQ = slcrc0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
fof(c_0_21,plain,
! [X26] :
( ( ~ aSet0(X26)
| sbrdtbr0(X26) = sz00
| X26 != slcrc0 )
& ( ~ aSet0(X26)
| X26 = slcrc0
| sbrdtbr0(X26) != sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardEmpty])])])]) ).
cnf(c_0_22,plain,
( X1 != slcrc0
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
( ~ aElementOf0(esk6_1(xQ),xQ)
| xQ = slcrc0 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( ~ aSet0(X1)
| X1 != slcrc0
| sbrdtbr0(X1) = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_26,hypothesis,
sbrdtbr0(xQ) = xk,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,negated_conjecture,
xQ = slcrc0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_12]),c_0_13])]) ).
cnf(c_0_28,plain,
sbrdtbr0(slcrc0) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_24]),c_0_25])]) ).
cnf(c_0_29,hypothesis,
xk != sz00,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM549+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.51 % Computer : n020.cluster.edu
% 0.21/0.51 % Model : x86_64 x86_64
% 0.21/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.51 % Memory : 8046.5625MB
% 0.21/0.51 % OS : Linux 6.8.0-71-generic
% 0.21/0.51 % CPULimit : 300
% 0.21/0.51 % WCLimit : 300
% 0.21/0.51 % DateTime : Mon Sep 21 02:40:02 UTC 2026
% 0.21/0.51 % CPUTime :
% 0.21/0.51 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.59 Running first-order theorem proving
% 0.25/0.59 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.25/0.65 % Version: 3.5.1
% 0.25/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.65 % Starting sh5l with 300s (1) cores
% 0.25/0.65 % new_bool_3 with pid 1817026 completed with status 0
% 0.25/0.65 % Result found by new_bool_3
% 0.25/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.65 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.25/0.65 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.65 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.65 % SubtermCWHack with pid 1817029 completed with status 0
% 0.25/0.65 % Result found by SubtermCWHack
% 0.25/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.65 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.25/0.65 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.65 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.65 % Preprocessing time : 0.004 s
% 0.25/0.65
% 0.25/0.65 % Proof found!
% 0.25/0.65 % SZS status Theorem
% 0.25/0.65 % SZS output start CNFRefutation
% See solution above
% 0.25/0.65 % Parsed axioms : 67
% 0.25/0.65 % Removed by relevancy pruning/SinE : 5
% 0.25/0.65 % Initial clauses : 140
% 0.25/0.65 % Removed in clause preprocessing : 5
% 0.25/0.65 % Initial clauses in saturation : 135
% 0.25/0.65 % Processed clauses : 74
% 0.25/0.65 % ...of these trivial : 2
% 0.25/0.65 % ...subsumed : 4
% 0.25/0.65 % ...remaining for further processing : 68
% 0.25/0.65 % Other redundant clauses eliminated : 5
% 0.25/0.65 % Clauses deleted for lack of memory : 0
% 0.25/0.65 % Backward-subsumed : 0
% 0.25/0.65 % Backward-rewritten : 18
% 0.25/0.65 % Generated clauses : 41
% 0.25/0.65 % ...of the previous two non-redundant : 43
% 0.25/0.65 % ...aggressively subsumed : 0
% 0.25/0.65 % Contextual simplify-reflections : 0
% 0.25/0.65 % Paramodulations : 36
% 0.25/0.65 % Factorizations : 0
% 0.25/0.65 % NegExts : 0
% 0.25/0.65 % Equation resolutions : 5
% 0.25/0.65 % Disequality decompositions : 0
% 0.25/0.65 % Total rewrite steps : 62
% 0.25/0.65 % ...of those cached : 48
% 0.25/0.65 % Propositional unsat checks : 0
% 0.25/0.65 % Propositional check models : 0
% 0.25/0.65 % Propositional check unsatisfiable : 0
% 0.25/0.65 % Propositional clauses : 0
% 0.25/0.65 % Propositional clauses after purity: 0
% 0.25/0.65 % Propositional unsat core size : 0
% 0.25/0.65 % Propositional preprocessing time : 0.000
% 0.25/0.65 % Propositional encoding time : 0.000
% 0.25/0.65 % Propositional solver time : 0.000
% 0.25/0.65 % Success case prop preproc time : 0.000
% 0.25/0.65 % Success case prop encoding time : 0.000
% 0.25/0.65 % Success case prop solver time : 0.000
% 0.25/0.65 % Current number of processed clauses : 46
% 0.25/0.65 % Positive orientable unit clauses : 22
% 0.25/0.65 % Positive unorientable unit clauses: 0
% 0.25/0.65 % Negative unit clauses : 5
% 0.25/0.65 % Non-unit-clauses : 19
% 0.25/0.65 % Current number of unprocessed clauses: 92
% 0.25/0.65 % ...number of literals in the above : 396
% 0.25/0.65 % Current number of archived formulas : 0
% 0.25/0.65 % Current number of archived clauses : 18
% 0.25/0.65 % Clause-clause subsumption calls (NU) : 39
% 0.25/0.65 % Rec. Clause-clause subsumption calls : 35
% 0.25/0.65 % Non-unit clause-clause subsumptions : 1
% 0.25/0.65 % Unit Clause-clause subsumption calls : 41
% 0.25/0.65 % Rewrite failures with RHS unbound : 0
% 0.25/0.65 % BW rewrite match attempts : 1
% 0.25/0.65 % BW rewrite match successes : 1
% 0.25/0.65 % Condensation attempts : 0
% 0.25/0.65 % Condensation successes : 0
% 0.25/0.65 % Termbank termtop insertions : 11084
% 0.25/0.65 % Search garbage collected termcells : 2503
% 0.25/0.65
% 0.25/0.65 % -------------------------------------------------
% 0.25/0.65 % User time : 0.021 s
% 0.25/0.65 % System time : 0.006 s
% 0.25/0.65 % Total time : 0.027 s
% 0.25/0.65 % Maximum resident set size: 3968 pages
% 0.25/0.65
% 0.25/0.65 % -------------------------------------------------
% 0.25/0.65 % User time : 0.029 s
% 0.25/0.65 % System time : 0.011 s
% 0.25/0.65 % Total time : 0.040 s
% 0.25/0.65 % Maximum resident set size: 4864 pages
% 0.25/0.65 % E exiting
%------------------------------------------------------------------------------