%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM614+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 : 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:46 PM UTC 2026
% Result : Theorem 0.14s 10.50s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 12 unt; 0 def)
% Number of atoms : 75 ( 19 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 98 ( 42 ~; 42 |; 11 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 17 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
aElementOf0(xP,slbdtsldtrb0(xO,xk)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mDefSel,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aSet0(X1) )
=> ! [X3] :
( X3 = slbdtsldtrb0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( sbrdtbr0(X4) = X2
& aSubsetOf0(X4,X1) ) )
& aSet0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSel) ).
fof(m__5217,hypothesis,
sbrdtbr0(xP) = xk,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5217) ).
fof(m__3533,hypothesis,
( szszuzczcdt0(xk) = xK
& aElementOf0(xk,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3533) ).
fof(m__5208,hypothesis,
aSubsetOf0(xP,xO),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5208) ).
fof(m__4891,hypothesis,
( xO = sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aSet0(xO) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4891) ).
fof(c_0_6,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xO,xk)),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,plain,
! [X120,X121,X122,X123,X124,X125] :
( ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| aElementOf0(esk11_3(X120,X121,X125),X125)
| sbrdtbr0(esk11_3(X120,X121,X125)) = X121 )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| aElementOf0(esk11_3(X120,X121,X125),X125)
| aSubsetOf0(esk11_3(X120,X121,X125),X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| sbrdtbr0(esk11_3(X120,X121,X125)) != X121
| ~ aSubsetOf0(esk11_3(X120,X121,X125),X120)
| ~ aElementOf0(esk11_3(X120,X121,X125),X125) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| aElementOf0(X124,X122)
| sbrdtbr0(X124) != X121
| ~ aSubsetOf0(X124,X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| ~ aElementOf0(X123,X122)
| sbrdtbr0(X123) = X121 )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| ~ aElementOf0(X123,X122)
| aSubsetOf0(X123,X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| aSet0(X122) ) ),
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)],[mDefSel])])])])])])]) ).
fof(c_0_8,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xO,xk)),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( ~ aElementOf0(X3,szNzAzT0)
| ~ aSet0(X2)
| X4 != slbdtsldtrb0(X2,X3)
| sbrdtbr0(X1) != X3
| ~ aSubsetOf0(X1,X2)
| aElementOf0(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xO,xk)),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( ~ aSet0(X2)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| ~ aSubsetOf0(X1,X2)
| aElementOf0(X1,slbdtsldtrb0(X2,sbrdtbr0(X1))) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]) ).
cnf(c_0_12,hypothesis,
sbrdtbr0(xP) = xk,
inference(split_conjunct,[status(thm)],[m__5217]) ).
cnf(c_0_13,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_14,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xO,xk)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
( ~ aSet0(X1)
| ~ aSubsetOf0(xP,X1)
| aElementOf0(xP,slbdtsldtrb0(X1,xk)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_16,hypothesis,
aSubsetOf0(xP,xO),
inference(split_conjunct,[status(thm)],[m__5208]) ).
cnf(c_0_17,hypothesis,
aSet0(xO),
inference(split_conjunct,[status(thm)],[m__4891]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM614+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/10.38 % Computer : n020.cluster.edu
% 0.10/10.38 % Model : x86_64 x86_64
% 0.10/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38 % Memory : 8046.5625MB
% 0.10/10.38 % OS : Linux 6.8.0-71-generic
% 0.10/10.38 % CPULimit : 300
% 0.10/10.38 % WCLimit : 300
% 0.10/10.38 % DateTime : Mon Sep 21 02:45:43 UTC 2026
% 0.10/10.38 % CPUTime :
% 0.10/10.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/10.42 Running first-order theorem proving
% 0.14/10.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.14/10.50 % Version: 3.5.1
% 0.14/10.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/10.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/10.50 % Starting new_bool_3 with 300s (1) cores
% 0.14/10.50 % Starting new_bool_1 with 300s (1) cores
% 0.14/10.50 % Starting sh5l with 300s (1) cores
% 0.14/10.50 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1826869 completed with status 0
% 0.14/10.50 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/10.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/10.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/10.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/10.50 % No SInE strategy applied
% 0.14/10.50 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.14/10.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/10.50 % Starting SubtermCWHack with 136s (1) cores
% 0.14/10.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/10.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/10.50 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.14/10.50 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.14/10.50 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1826877 completed with status 0
% 0.14/10.50 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.14/10.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/10.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/10.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/10.50 % No SInE strategy applied
% 0.14/10.50 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.14/10.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/10.50 % Starting SubtermCWHack with 136s (1) cores
% 0.14/10.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/10.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/10.50 % Preprocessing time : 0.003 s
% 0.14/10.50 % Presaturation interreduction done
% 0.14/10.50
% 0.14/10.50 % Proof found!
% 0.14/10.50 % SZS status Theorem
% 0.14/10.50 % SZS output start CNFRefutation
% See solution above
% 0.14/10.50 % Parsed axioms : 110
% 0.14/10.50 % Removed by relevancy pruning/SinE : 0
% 0.14/10.50 % Initial clauses : 214
% 0.14/10.50 % Removed in clause preprocessing : 7
% 0.14/10.50 % Initial clauses in saturation : 207
% 0.14/10.50 % Processed clauses : 860
% 0.14/10.50 % ...of these trivial : 7
% 0.14/10.50 % ...subsumed : 199
% 0.14/10.50 % ...remaining for further processing : 654
% 0.14/10.50 % Other redundant clauses eliminated : 51
% 0.14/10.50 % Clauses deleted for lack of memory : 0
% 0.14/10.50 % Backward-subsumed : 16
% 0.14/10.50 % Backward-rewritten : 18
% 0.14/10.50 % Generated clauses : 1191
% 0.14/10.50 % ...of the previous two non-redundant : 996
% 0.14/10.50 % ...aggressively subsumed : 0
% 0.14/10.50 % Contextual simplify-reflections : 30
% 0.14/10.50 % Paramodulations : 1143
% 0.14/10.50 % Factorizations : 0
% 0.14/10.50 % NegExts : 0
% 0.14/10.50 % Equation resolutions : 53
% 0.14/10.50 % Disequality decompositions : 0
% 0.14/10.50 % Total rewrite steps : 996
% 0.14/10.50 % ...of those cached : 927
% 0.14/10.50 % Propositional unsat checks : 0
% 0.14/10.50 % Propositional check models : 0
% 0.14/10.50 % Propositional check unsatisfiable : 0
% 0.14/10.50 % Propositional clauses : 0
% 0.14/10.50 % Propositional clauses after purity: 0
% 0.14/10.50 % Propositional unsat core size : 0
% 0.14/10.50 % Propositional preprocessing time : 0.000
% 0.14/10.50 % Propositional encoding time : 0.000
% 0.14/10.50 % Propositional solver time : 0.000
% 0.14/10.50 % Success case prop preproc time : 0.000
% 0.14/10.50 % Success case prop encoding time : 0.000
% 0.14/10.50 % Success case prop solver time : 0.000
% 0.14/10.50 % Current number of processed clauses : 375
% 0.14/10.50 % Positive orientable unit clauses : 89
% 0.14/10.50 % Positive unorientable unit clauses: 0
% 0.14/10.50 % Negative unit clauses : 32
% 0.14/10.50 % Non-unit-clauses : 254
% 0.14/10.50 % Current number of unprocessed clauses: 541
% 0.14/10.50 % ...number of literals in the above : 2548
% 0.14/10.50 % Current number of archived formulas : 0
% 0.14/10.50 % Current number of archived clauses : 239
% 0.14/10.50 % Clause-clause subsumption calls (NU) : 16192
% 0.14/10.50 % Rec. Clause-clause subsumption calls : 6613
% 0.14/10.50 % Non-unit clause-clause subsumptions : 126
% 0.14/10.50 % Unit Clause-clause subsumption calls : 1224
% 0.14/10.50 % Rewrite failures with RHS unbound : 0
% 0.14/10.50 % BW rewrite match attempts : 10
% 0.14/10.50 % BW rewrite match successes : 10
% 0.14/10.50 % Condensation attempts : 0
% 0.14/10.50 % Condensation successes : 0
% 0.14/10.50 % Termbank termtop insertions : 34937
% 0.14/10.50 % Search garbage collected termcells : 3737
% 0.14/10.50
% 0.14/10.50 % -------------------------------------------------
% 0.14/10.50 % User time : 0.048 s
% 0.14/10.50 % System time : 0.008 s
% 0.14/10.50 % Total time : 0.056 s
% 0.14/10.50 % Maximum resident set size: 4028 pages
% 0.14/10.50
% 0.14/10.50 % -------------------------------------------------
% 0.14/10.50 % User time : 0.201 s
% 0.14/10.50 % System time : 0.029 s
% 0.14/10.50 % Total time : 0.230 s
% 0.14/10.50 % Maximum resident set size: 4864 pages
% 0.14/10.50 % E exiting
%------------------------------------------------------------------------------