%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM552+3 : 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 : n019.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:32 PM UTC 2026
% Result : Theorem 0.23s 0.65s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 4 unt; 0 def)
% Number of atoms : 142 ( 22 equ)
% Maximal formula atoms : 67 ( 9 avg)
% Number of connectives : 177 ( 50 ~; 51 |; 59 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn 22 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2227,hypothesis,
( ~ ( ! [X1] :
( ( ( sbrdtbr0(X1) = xk
& ( aSubsetOf0(X1,xS)
| ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSet0(X1) ) ) )
=> aElementOf0(X1,slbdtsldtrb0(xS,xk)) )
& ( aElementOf0(X1,slbdtsldtrb0(xS,xk))
=> ( sbrdtbr0(X1) = xk
& aSubsetOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSet0(X1) ) ) )
=> ( slbdtsldtrb0(xS,xk) = slcrc0
| ~ ? [X1] : aElementOf0(X1,slbdtsldtrb0(xS,xk)) ) )
& aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))
& ! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xS,xk))
=> aElementOf0(X1,slbdtsldtrb0(xT,xk)) )
& ! [X1] :
( ( ( sbrdtbr0(X1) = xk
& ( aSubsetOf0(X1,xT)
| ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xT) )
& aSet0(X1) ) ) )
=> aElementOf0(X1,slbdtsldtrb0(xT,xk)) )
& ( aElementOf0(X1,slbdtsldtrb0(xT,xk))
=> ( sbrdtbr0(X1) = xk
& aSubsetOf0(X1,xT)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xT) )
& aSet0(X1) ) ) )
& aSet0(slbdtsldtrb0(xT,xk))
& ! [X1] :
( ( ( sbrdtbr0(X1) = xk
& ( aSubsetOf0(X1,xS)
| ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSet0(X1) ) ) )
=> aElementOf0(X1,slbdtsldtrb0(xS,xk)) )
& ( aElementOf0(X1,slbdtsldtrb0(xS,xk))
=> ( sbrdtbr0(X1) = xk
& aSubsetOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSet0(X1) ) ) )
& aSet0(slbdtsldtrb0(xS,xk)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2227) ).
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/sandbox/benchmark/theBenchmark.p',m__2270) ).
fof(m__,conjecture,
( aElementOf0(xx,xQ)
=> aElementOf0(xx,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(c_0_3,hypothesis,
! [X5,X6,X7,X9,X10,X11,X13,X14,X15,X16] :
( slbdtsldtrb0(xS,xk) != slcrc0
& aElementOf0(esk4_0,slbdtsldtrb0(xS,xk))
& ( aElementOf0(X16,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X16) != xk
| ~ aSubsetOf0(X16,xS) )
& ( aElementOf0(X16,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X16) != xk
| ~ aSet0(X16)
| ~ aElementOf0(esk3_1(X16),xS) )
& ( aElementOf0(X16,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X16) != xk
| ~ aSet0(X16)
| aElementOf0(esk3_1(X16),X16) )
& ( ~ aElementOf0(X14,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X14) = xk )
& ( ~ aElementOf0(X14,slbdtsldtrb0(xS,xk))
| aSubsetOf0(X14,xS) )
& ( ~ aElementOf0(X14,slbdtsldtrb0(xS,xk))
| aElementOf0(X15,xS)
| ~ aElementOf0(X15,X14) )
& ( ~ aElementOf0(X14,slbdtsldtrb0(xS,xk))
| aSet0(X14) )
& aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))
& ( aElementOf0(X13,slbdtsldtrb0(xT,xk))
| ~ aElementOf0(X13,slbdtsldtrb0(xS,xk)) )
& ( aElementOf0(X11,slbdtsldtrb0(xT,xk))
| sbrdtbr0(X11) != xk
| ~ aSubsetOf0(X11,xT) )
& ( aElementOf0(X11,slbdtsldtrb0(xT,xk))
| sbrdtbr0(X11) != xk
| ~ aSet0(X11)
| ~ aElementOf0(esk2_1(X11),xT) )
& ( aElementOf0(X11,slbdtsldtrb0(xT,xk))
| sbrdtbr0(X11) != xk
| ~ aSet0(X11)
| aElementOf0(esk2_1(X11),X11) )
& ( ~ aElementOf0(X9,slbdtsldtrb0(xT,xk))
| sbrdtbr0(X9) = xk )
& ( ~ aElementOf0(X9,slbdtsldtrb0(xT,xk))
| aSubsetOf0(X9,xT) )
& ( ~ aElementOf0(X9,slbdtsldtrb0(xT,xk))
| aElementOf0(X10,xT)
| ~ aElementOf0(X10,X9) )
& ( ~ aElementOf0(X9,slbdtsldtrb0(xT,xk))
| aSet0(X9) )
& aSet0(slbdtsldtrb0(xT,xk))
& ( aElementOf0(X7,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X7) != xk
| ~ aSubsetOf0(X7,xS) )
& ( aElementOf0(X7,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X7) != xk
| ~ aSet0(X7)
| ~ aElementOf0(esk1_1(X7),xS) )
& ( aElementOf0(X7,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X7) != xk
| ~ aSet0(X7)
| aElementOf0(esk1_1(X7),X7) )
& ( ~ aElementOf0(X5,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X5) = xk )
& ( ~ aElementOf0(X5,slbdtsldtrb0(xS,xk))
| aSubsetOf0(X5,xS) )
& ( ~ aElementOf0(X5,slbdtsldtrb0(xS,xk))
| aElementOf0(X6,xS)
| ~ aElementOf0(X6,X5) )
& ( ~ aElementOf0(X5,slbdtsldtrb0(xS,xk))
| aSet0(X5) )
& aSet0(slbdtsldtrb0(xS,xk)) ),
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)],[m__2227])])])])])])]) ).
cnf(c_0_4,hypothesis,
( ~ aElementOf0(X2,slbdtsldtrb0(xT,xk))
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,hypothesis,
( ~ aElementOf0(X1,slbdtsldtrb0(xS,xk))
| aElementOf0(X1,slbdtsldtrb0(xT,xk)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
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,negated_conjecture,
~ ( aElementOf0(xx,xQ)
=> aElementOf0(xx,xT) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_8,hypothesis,
( ~ aElementOf0(X1,X2)
| ~ aElementOf0(X2,slbdtsldtrb0(xS,xk))
| aElementOf0(X1,xT) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_9,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xS,xk)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,negated_conjecture,
( ~ aElementOf0(xx,xT)
& aElementOf0(xx,xQ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
cnf(c_0_11,hypothesis,
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,xT) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
aElementOf0(xx,xQ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
~ aElementOf0(xx,xT),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM552+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n019.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 02:39:50 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.55 Running first-order theorem proving
% 0.23/0.55 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.23/0.65 % Version: 3.5.1
% 0.23/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.65 % Starting sh5l with 300s (1) cores
% 0.23/0.65 % new_bool_1 with pid 1512924 completed with status 0
% 0.23/0.65 % Result found by new_bool_1
% 0.23/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.65 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.23/0.65 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.65 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.65 % SubtermCWHack with pid 1512932 completed with status 0
% 0.23/0.65 % Result found by SubtermCWHack
% 0.23/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.65 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.23/0.65 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.65 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.65 % Preprocessing time : 0.002 s
% 0.23/0.65
% 0.23/0.65 % Proof found!
% 0.23/0.65 % SZS status Theorem
% 0.23/0.65 % SZS output start CNFRefutation
% See solution above
% 0.23/0.65 % Parsed axioms : 68
% 0.23/0.65 % Removed by relevancy pruning/SinE : 5
% 0.23/0.65 % Initial clauses : 143
% 0.23/0.65 % Removed in clause preprocessing : 5
% 0.23/0.65 % Initial clauses in saturation : 138
% 0.23/0.65 % Processed clauses : 145
% 0.23/0.65 % ...of these trivial : 3
% 0.23/0.65 % ...subsumed : 17
% 0.23/0.65 % ...remaining for further processing : 125
% 0.23/0.65 % Other redundant clauses eliminated : 11
% 0.23/0.65 % Clauses deleted for lack of memory : 0
% 0.23/0.65 % Backward-subsumed : 1
% 0.23/0.65 % Backward-rewritten : 0
% 0.23/0.65 % Generated clauses : 131
% 0.23/0.65 % ...of the previous two non-redundant : 95
% 0.23/0.65 % ...aggressively subsumed : 0
% 0.23/0.65 % Contextual simplify-reflections : 1
% 0.23/0.65 % Paramodulations : 119
% 0.23/0.65 % Factorizations : 0
% 0.23/0.65 % NegExts : 0
% 0.23/0.65 % Equation resolutions : 12
% 0.23/0.65 % Disequality decompositions : 0
% 0.23/0.65 % Total rewrite steps : 101
% 0.23/0.65 % ...of those cached : 78
% 0.23/0.65 % Propositional unsat checks : 0
% 0.23/0.65 % Propositional check models : 0
% 0.23/0.65 % Propositional check unsatisfiable : 0
% 0.23/0.65 % Propositional clauses : 0
% 0.23/0.65 % Propositional clauses after purity: 0
% 0.23/0.65 % Propositional unsat core size : 0
% 0.23/0.65 % Propositional preprocessing time : 0.000
% 0.23/0.65 % Propositional encoding time : 0.000
% 0.23/0.65 % Propositional solver time : 0.000
% 0.23/0.65 % Success case prop preproc time : 0.000
% 0.23/0.65 % Success case prop encoding time : 0.000
% 0.23/0.65 % Success case prop solver time : 0.000
% 0.23/0.65 % Current number of processed clauses : 116
% 0.23/0.65 % Positive orientable unit clauses : 34
% 0.23/0.65 % Positive unorientable unit clauses: 0
% 0.23/0.65 % Negative unit clauses : 7
% 0.23/0.65 % Non-unit-clauses : 75
% 0.23/0.65 % Current number of unprocessed clauses: 86
% 0.23/0.65 % ...number of literals in the above : 396
% 0.23/0.65 % Current number of archived formulas : 0
% 0.23/0.65 % Current number of archived clauses : 1
% 0.23/0.65 % Clause-clause subsumption calls (NU) : 419
% 0.23/0.65 % Rec. Clause-clause subsumption calls : 337
% 0.23/0.65 % Non-unit clause-clause subsumptions : 16
% 0.23/0.65 % Unit Clause-clause subsumption calls : 24
% 0.23/0.65 % Rewrite failures with RHS unbound : 0
% 0.23/0.65 % BW rewrite match attempts : 0
% 0.23/0.65 % BW rewrite match successes : 0
% 0.23/0.65 % Condensation attempts : 0
% 0.23/0.65 % Condensation successes : 0
% 0.23/0.65 % Termbank termtop insertions : 12417
% 0.23/0.65 % Search garbage collected termcells : 2499
% 0.23/0.65
% 0.23/0.65 % -------------------------------------------------
% 0.23/0.65 % User time : 0.017 s
% 0.23/0.65 % System time : 0.005 s
% 0.23/0.65 % Total time : 0.021 s
% 0.23/0.65 % Maximum resident set size: 3716 pages
% 0.23/0.65
% 0.23/0.65 % -------------------------------------------------
% 0.23/0.65 % User time : 0.023 s
% 0.23/0.65 % System time : 0.009 s
% 0.23/0.65 % Total time : 0.032 s
% 0.23/0.65 % Maximum resident set size: 4608 pages
% 0.23/0.65 % E exiting
%------------------------------------------------------------------------------