%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM613+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 : n014.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:55:42 PM UTC 2026
% Result : Theorem 1.24s 0.83s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 12 unt; 0 def)
% Number of atoms : 44 ( 22 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 37 ( 13 ~; 9 |; 12 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sbrdtbr0(xP) = xk,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mSuccEquSucc,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( szszuzczcdt0(X1) = szszuzczcdt0(X2)
=> X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSuccEquSucc) ).
fof(m__5078,hypothesis,
( aElementOf0(xQ,slbdtsldtrb0(xO,xK))
& sbrdtbr0(xQ) = xK
& aSubsetOf0(xQ,xO)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xO) )
& aSet0(xQ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5078) ).
fof(m__3533,hypothesis,
( szszuzczcdt0(xk) = xK
& aElementOf0(xk,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3533) ).
fof(m__5255,hypothesis,
( aElementOf0(sbrdtbr0(xP),szNzAzT0)
& szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ)
& sbrdtbr0(xQ) = szszuzczcdt0(xk) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5255) ).
fof(c_0_5,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X174,X175] :
( X174 = X175
| szszuzczcdt0(X174) != szszuzczcdt0(X175)
| ~ aElementOf0(X175,szNzAzT0)
| ~ aElementOf0(X174,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccEquSucc])])]) ).
fof(c_0_7,hypothesis,
! [X85] :
( aElementOf0(xQ,slbdtsldtrb0(xO,xK))
& sbrdtbr0(xQ) = xK
& aSubsetOf0(xQ,xO)
& ( aElementOf0(X85,xO)
| ~ aElementOf0(X85,xQ) )
& aSet0(xQ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5078])])])]) ).
fof(c_0_8,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(fof_simplification,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( szszuzczcdt0(X1) != szszuzczcdt0(X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
szszuzczcdt0(xk) = xK,
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_11,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_12,hypothesis,
szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
inference(split_conjunct,[status(thm)],[m__5255]) ).
cnf(c_0_13,hypothesis,
sbrdtbr0(xQ) = xK,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_14,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(fof_nnf,[status(thm)],[c_0_8]) ).
cnf(c_0_15,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| szszuzczcdt0(X1) != xK
| X1 = xk ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_16,hypothesis,
szszuzczcdt0(sbrdtbr0(xP)) = xK,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,hypothesis,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5255]) ).
cnf(c_0_18,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM613+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.35 % Computer : n014.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Mon Sep 21 02:44:35 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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
% 1.24/0.83 % Version: 3.5.1
% 1.24/0.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.24/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.24/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.24/0.83 % Starting new_bool_3 with 300s (1) cores
% 1.24/0.83 % Starting new_bool_1 with 300s (1) cores
% 1.24/0.83 % Starting sh5l with 300s (1) cores
% 1.24/0.83 % new_bool_1 with pid 2979409 completed with status 0
% 1.24/0.83 % Result found by new_bool_1
% 1.24/0.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.24/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.24/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.24/0.83 % Starting new_bool_3 with 300s (1) cores
% 1.24/0.83 % Starting new_bool_1 with 300s (1) cores
% 1.24/0.83 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.24/0.83 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.24/0.83 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.24/0.83 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.24/0.83 % Starting SubtermCWHack with 28s (1) cores
% 1.24/0.83 % SubtermCWHack with pid 2979487 completed with status 0
% 1.24/0.83 % Result found by SubtermCWHack
% 1.24/0.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.24/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.24/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.24/0.83 % Starting new_bool_3 with 300s (1) cores
% 1.24/0.83 % Starting new_bool_1 with 300s (1) cores
% 1.24/0.83 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.24/0.83 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.24/0.83 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.24/0.83 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.24/0.83 % Starting SubtermCWHack with 28s (1) cores
% 1.24/0.83 % Preprocessing time : 0.104 s
% 1.24/0.83
% 1.24/0.83 % Proof found!
% 1.24/0.83 % SZS status Theorem
% 1.24/0.83 % SZS output start CNFRefutation
% See solution above
% 1.24/0.83 % Parsed axioms : 110
% 1.24/0.83 % Removed by relevancy pruning/SinE : 9
% 1.24/0.83 % Initial clauses : 4886
% 1.24/0.83 % Removed in clause preprocessing : 7
% 1.24/0.83 % Initial clauses in saturation : 4879
% 1.24/0.83 % Processed clauses : 362
% 1.24/0.83 % ...of these trivial : 11
% 1.24/0.83 % ...subsumed : 64
% 1.24/0.83 % ...remaining for further processing : 287
% 1.24/0.83 % Other redundant clauses eliminated : 13
% 1.24/0.83 % Clauses deleted for lack of memory : 0
% 1.24/0.83 % Backward-subsumed : 3
% 1.24/0.83 % Backward-rewritten : 5
% 1.24/0.83 % Generated clauses : 356
% 1.24/0.83 % ...of the previous two non-redundant : 282
% 1.24/0.83 % ...aggressively subsumed : 0
% 1.24/0.83 % Contextual simplify-reflections : 4
% 1.24/0.83 % Paramodulations : 341
% 1.24/0.83 % Factorizations : 0
% 1.24/0.83 % NegExts : 0
% 1.24/0.83 % Equation resolutions : 14
% 1.24/0.83 % Disequality decompositions : 0
% 1.24/0.83 % Total rewrite steps : 316
% 1.24/0.83 % ...of those cached : 262
% 1.24/0.83 % Propositional unsat checks : 0
% 1.24/0.83 % Propositional check models : 0
% 1.24/0.83 % Propositional check unsatisfiable : 0
% 1.24/0.83 % Propositional clauses : 0
% 1.24/0.83 % Propositional clauses after purity: 0
% 1.24/0.83 % Propositional unsat core size : 0
% 1.24/0.83 % Propositional preprocessing time : 0.000
% 1.24/0.83 % Propositional encoding time : 0.000
% 1.24/0.83 % Propositional solver time : 0.000
% 1.24/0.83 % Success case prop preproc time : 0.000
% 1.24/0.83 % Success case prop encoding time : 0.000
% 1.24/0.83 % Success case prop solver time : 0.000
% 1.24/0.83 % Current number of processed clauses : 268
% 1.24/0.83 % Positive orientable unit clauses : 90
% 1.24/0.83 % Positive unorientable unit clauses: 0
% 1.24/0.83 % Negative unit clauses : 26
% 1.24/0.83 % Non-unit-clauses : 152
% 1.24/0.83 % Current number of unprocessed clauses: 4794
% 1.24/0.83 % ...number of literals in the above : 55854
% 1.24/0.83 % Current number of archived formulas : 0
% 1.24/0.83 % Current number of archived clauses : 9
% 1.24/0.83 % Clause-clause subsumption calls (NU) : 3289
% 1.24/0.83 % Rec. Clause-clause subsumption calls : 2805
% 1.24/0.83 % Non-unit clause-clause subsumptions : 31
% 1.24/0.83 % Unit Clause-clause subsumption calls : 624
% 1.24/0.83 % Rewrite failures with RHS unbound : 0
% 1.24/0.83 % BW rewrite match attempts : 5
% 1.24/0.83 % BW rewrite match successes : 3
% 1.24/0.83 % Condensation attempts : 0
% 1.24/0.83 % Condensation successes : 0
% 1.24/0.83 % Termbank termtop insertions : 385382
% 1.24/0.83 % Search garbage collected termcells : 31509
% 1.24/0.83
% 1.24/0.83 % -------------------------------------------------
% 1.24/0.83 % User time : 0.376 s
% 1.24/0.83 % System time : 0.027 s
% 1.24/0.83 % Total time : 0.403 s
% 1.24/0.83 % Maximum resident set size: 16108 pages
% 1.24/0.83
% 1.24/0.83 % -------------------------------------------------
% 1.24/0.83 % User time : 0.380 s
% 1.24/0.83 % System time : 0.031 s
% 1.24/0.83 % Total time : 0.411 s
% 1.24/0.83 % Maximum resident set size: 4864 pages
% 1.24/0.83 % E exiting
%------------------------------------------------------------------------------