%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM586+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:40 PM UTC 2026
% Result : Theorem 6.51s 1.62s
% Output : CNFRefutation 6.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 29 ( 6 unt; 0 def)
% Number of atoms : 120 ( 30 equ)
% Maximal formula atoms : 39 ( 4 avg)
% Number of connectives : 158 ( 67 ~; 64 |; 19 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-4 aty)
% Number of variables : 46 ( 0 sgn 21 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( sdtlpdtrp0(sdtlpdtrp0(xC,xi),X1) = xx
& aElementOf0(X1,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__4151,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ! [X2] :
( ( aElementOf0(X2,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk))
& aSet0(X2) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) = sdtlpdtrp0(xc,sdtpldt0(X2,szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& szDzozmdt0(sdtlpdtrp0(xC,X1)) = slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)
& aFunction0(sdtlpdtrp0(xC,X1)) ) )
& szDzozmdt0(xC) = szNzAzT0
& aFunction0(xC) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4151) ).
fof(mDefSImg,axiom,
! [X1] :
( aFunction0(X1)
=> ! [X2] :
( aSubsetOf0(X2,szDzozmdt0(X1))
=> ! [X3] :
( X3 = sdtlcdtrc0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ? [X5] :
( sdtlpdtrp0(X1,X5) = X4
& aElementOf0(X5,X2) ) )
& aSet0(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSImg) ).
fof(m__4200,hypothesis,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4200) ).
fof(m__4200_02,hypothesis,
aElementOf0(xx,sdtlcdtrc0(sdtlpdtrp0(xC,xi),szDzozmdt0(sdtlpdtrp0(xC,xi)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4200_02) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSubRefl) ).
fof(mDomSet,axiom,
! [X1] :
( aFunction0(X1)
=> aSet0(szDzozmdt0(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDomSet) ).
fof(c_0_7,negated_conjecture,
~ ? [X1] :
( sdtlpdtrp0(sdtlpdtrp0(xC,xi),X1) = xx
& aElementOf0(X1,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,negated_conjecture,
! [X193] :
( sdtlpdtrp0(sdtlpdtrp0(xC,xi),X193) != xx
| ~ aElementOf0(X193,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_9,hypothesis,
! [X191,X192] :
( ( ~ aElementOf0(X191,szNzAzT0)
| sdtlpdtrp0(sdtlpdtrp0(xC,X191),X192) = sdtlpdtrp0(xc,sdtpldt0(X192,szmzizndt0(sdtlpdtrp0(xN,X191))))
| ~ aElementOf0(X192,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X191),szmzizndt0(sdtlpdtrp0(xN,X191))),xk))
| ~ aSet0(X192) )
& ( ~ aElementOf0(X191,szNzAzT0)
| szDzozmdt0(sdtlpdtrp0(xC,X191)) = slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X191),szmzizndt0(sdtlpdtrp0(xN,X191))),xk) )
& ( ~ aElementOf0(X191,szNzAzT0)
| aFunction0(sdtlpdtrp0(xC,X191)) )
& szDzozmdt0(xC) = szNzAzT0
& aFunction0(xC) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4151])])])])]) ).
fof(c_0_10,plain,
! [X153,X154,X155,X156,X158,X159,X160,X162] :
( ( ~ aFunction0(X153)
| ~ aSubsetOf0(X154,szDzozmdt0(X153))
| X160 = sdtlcdtrc0(X153,X154)
| ~ aSet0(X160)
| aElementOf0(esk15_3(X153,X154,X160),X160)
| sdtlpdtrp0(X153,esk16_3(X153,X154,X160)) = esk15_3(X153,X154,X160) )
& ( ~ aFunction0(X153)
| ~ aSubsetOf0(X154,szDzozmdt0(X153))
| X160 = sdtlcdtrc0(X153,X154)
| ~ aSet0(X160)
| aElementOf0(esk15_3(X153,X154,X160),X160)
| aElementOf0(esk16_3(X153,X154,X160),X154) )
& ( ~ aFunction0(X153)
| ~ aSubsetOf0(X154,szDzozmdt0(X153))
| X160 = sdtlcdtrc0(X153,X154)
| ~ aSet0(X160)
| sdtlpdtrp0(X153,X162) != esk15_3(X153,X154,X160)
| ~ aElementOf0(X162,X154)
| ~ aElementOf0(esk15_3(X153,X154,X160),X160) )
& ( ~ aFunction0(X153)
| ~ aSubsetOf0(X154,szDzozmdt0(X153))
| X155 != sdtlcdtrc0(X153,X154)
| aElementOf0(X158,X155)
| sdtlpdtrp0(X153,X159) != X158
| ~ aElementOf0(X159,X154) )
& ( ~ aFunction0(X153)
| ~ aSubsetOf0(X154,szDzozmdt0(X153))
| X155 != sdtlcdtrc0(X153,X154)
| ~ aElementOf0(X156,X155)
| sdtlpdtrp0(X153,esk14_4(X153,X154,X155,X156)) = X156 )
& ( ~ aFunction0(X153)
| ~ aSubsetOf0(X154,szDzozmdt0(X153))
| X155 != sdtlcdtrc0(X153,X154)
| ~ aElementOf0(X156,X155)
| aElementOf0(esk14_4(X153,X154,X155,X156),X154) )
& ( ~ aFunction0(X153)
| ~ aSubsetOf0(X154,szDzozmdt0(X153))
| X155 != sdtlcdtrc0(X153,X154)
| aSet0(X155) ) ),
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)],[mDefSImg])])])])])])]) ).
cnf(c_0_11,negated_conjecture,
( sdtlpdtrp0(sdtlpdtrp0(xC,xi),X1) != xx
| ~ aElementOf0(X1,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| szDzozmdt0(sdtlpdtrp0(xC,X1)) = slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__4200]) ).
cnf(c_0_14,plain,
( ~ aFunction0(X1)
| ~ aSubsetOf0(X2,szDzozmdt0(X1))
| X3 != sdtlcdtrc0(X1,X2)
| ~ aElementOf0(X4,X3)
| aElementOf0(esk14_4(X1,X2,X3,X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( ~ aElementOf0(X1,szDzozmdt0(sdtlpdtrp0(xC,xi)))
| sdtlpdtrp0(sdtlpdtrp0(xC,xi),X1) != xx ),
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,plain,
( ~ aElementOf0(X3,sdtlcdtrc0(X1,X2))
| ~ aSubsetOf0(X2,szDzozmdt0(X1))
| ~ aFunction0(X1)
| aElementOf0(esk14_4(X1,X2,sdtlcdtrc0(X1,X2),X3),X2) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
( ~ aFunction0(X1)
| ~ aSubsetOf0(X2,szDzozmdt0(X1))
| X3 != sdtlcdtrc0(X1,X2)
| ~ aElementOf0(X4,X3)
| sdtlpdtrp0(X1,esk14_4(X1,X2,X3,X4)) = X4 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
( ~ aElementOf0(X2,sdtlcdtrc0(X1,szDzozmdt0(sdtlpdtrp0(xC,xi))))
| ~ aSubsetOf0(szDzozmdt0(sdtlpdtrp0(xC,xi)),szDzozmdt0(X1))
| ~ aFunction0(X1)
| sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk14_4(X1,szDzozmdt0(sdtlpdtrp0(xC,xi)),sdtlcdtrc0(X1,szDzozmdt0(sdtlpdtrp0(xC,xi))),X2)) != xx ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( ~ aElementOf0(X3,sdtlcdtrc0(X1,X2))
| ~ aSubsetOf0(X2,szDzozmdt0(X1))
| ~ aFunction0(X1)
| sdtlpdtrp0(X1,esk14_4(X1,X2,sdtlcdtrc0(X1,X2),X3)) = X3 ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_20,hypothesis,
aElementOf0(xx,sdtlcdtrc0(sdtlpdtrp0(xC,xi),szDzozmdt0(sdtlpdtrp0(xC,xi)))),
inference(split_conjunct,[status(thm)],[m__4200_02]) ).
fof(c_0_21,plain,
! [X26] :
( aSubsetOf0(X26,X26)
| ~ aSet0(X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])])]) ).
fof(c_0_22,plain,
! [X141] :
( aSet0(szDzozmdt0(X141))
| ~ aFunction0(X141) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDomSet])])]) ).
cnf(c_0_23,negated_conjecture,
( ~ aSubsetOf0(szDzozmdt0(sdtlpdtrp0(xC,xi)),szDzozmdt0(sdtlpdtrp0(xC,xi)))
| ~ aFunction0(sdtlpdtrp0(xC,xi)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19])]),c_0_20])]) ).
cnf(c_0_24,plain,
( ~ aSet0(X1)
| aSubsetOf0(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
( ~ aFunction0(X1)
| aSet0(szDzozmdt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
~ aFunction0(sdtlpdtrp0(xC,xi)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_27,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aFunction0(sdtlpdtrp0(xC,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM586+1 : 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.46 % Computer : n020.cluster.edu
% 0.21/0.46 % Model : x86_64 x86_64
% 0.21/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46 % Memory : 8046.5625MB
% 0.21/0.46 % OS : Linux 6.8.0-71-generic
% 0.21/0.46 % CPULimit : 300
% 0.21/0.46 % WCLimit : 300
% 0.21/0.46 % DateTime : Mon Sep 21 02:43:18 UTC 2026
% 0.21/0.47 % CPUTime :
% 0.21/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.54 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
% 6.51/1.62 % Version: 3.5.1
% 6.51/1.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 6.51/1.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.51/1.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 6.51/1.62 % Starting new_bool_3 with 300s (1) cores
% 6.51/1.62 % Starting new_bool_1 with 300s (1) cores
% 6.51/1.62 % Starting sh5l with 300s (1) cores
% 6.51/1.62 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1822674 completed with status 0
% 6.51/1.62 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 6.51/1.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 6.51/1.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.51/1.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 6.51/1.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.51/1.62 % No SInE strategy applied
% 6.51/1.62 % Search class: FGHSF-FSLM32-MFFFFFNN
% 6.51/1.62 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 6.51/1.62 % Starting SubtermCWHack with 151s (1) cores
% 6.51/1.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 6.51/1.62 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 6.51/1.62 % Starting G-E--_302_C18_F1_URBAN_S0Y with 151s (1) cores
% 6.51/1.62 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 146s (1) cores
% 6.51/1.62 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1822680 completed with status 0
% 6.51/1.62 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 6.51/1.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 6.51/1.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.51/1.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 6.51/1.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.51/1.62 % No SInE strategy applied
% 6.51/1.62 % Search class: FGHSF-FSLM32-MFFFFFNN
% 6.51/1.62 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 6.51/1.62 % Starting SubtermCWHack with 151s (1) cores
% 6.51/1.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 6.51/1.62 % Preprocessing time : 0.007 s
% 6.51/1.62 % Presaturation interreduction done
% 6.51/1.62
% 6.51/1.62 % Proof found!
% 6.51/1.62 % SZS status Theorem
% 6.51/1.62 % SZS output start CNFRefutation
% See solution above
% 6.51/1.62 % Parsed axioms : 89
% 6.51/1.62 % Removed by relevancy pruning/SinE : 0
% 6.51/1.62 % Initial clauses : 178
% 6.51/1.62 % Removed in clause preprocessing : 7
% 6.51/1.62 % Initial clauses in saturation : 171
% 6.51/1.62 % Processed clauses : 3797
% 6.51/1.62 % ...of these trivial : 15
% 6.51/1.62 % ...subsumed : 2109
% 6.51/1.62 % ...remaining for further processing : 1673
% 6.51/1.62 % Other redundant clauses eliminated : 90
% 6.51/1.62 % Clauses deleted for lack of memory : 0
% 6.51/1.62 % Backward-subsumed : 193
% 6.51/1.62 % Backward-rewritten : 99
% 6.51/1.62 % Generated clauses : 14965
% 6.51/1.62 % ...of the previous two non-redundant : 13755
% 6.51/1.62 % ...aggressively subsumed : 0
% 6.51/1.62 % Contextual simplify-reflections : 238
% 6.51/1.62 % Paramodulations : 14877
% 6.51/1.62 % Factorizations : 0
% 6.51/1.62 % NegExts : 0
% 6.51/1.62 % Equation resolutions : 93
% 6.51/1.62 % Disequality decompositions : 0
% 6.51/1.62 % Total rewrite steps : 8085
% 6.51/1.62 % ...of those cached : 8014
% 6.51/1.62 % Propositional unsat checks : 0
% 6.51/1.62 % Propositional check models : 0
% 6.51/1.62 % Propositional check unsatisfiable : 0
% 6.51/1.62 % Propositional clauses : 0
% 6.51/1.62 % Propositional clauses after purity: 0
% 6.51/1.62 % Propositional unsat core size : 0
% 6.51/1.62 % Propositional preprocessing time : 0.000
% 6.51/1.62 % Propositional encoding time : 0.000
% 6.51/1.62 % Propositional solver time : 0.000
% 6.51/1.62 % Success case prop preproc time : 0.000
% 6.51/1.62 % Success case prop encoding time : 0.000
% 6.51/1.62 % Success case prop solver time : 0.000
% 6.51/1.62 % Current number of processed clauses : 1171
% 6.51/1.62 % Positive orientable unit clauses : 78
% 6.51/1.62 % Positive unorientable unit clauses: 0
% 6.51/1.62 % Negative unit clauses : 24
% 6.51/1.62 % Non-unit-clauses : 1069
% 6.51/1.62 % Current number of unprocessed clauses: 9962
% 6.51/1.62 % ...number of literals in the above : 65168
% 6.51/1.62 % Current number of archived formulas : 0
% 6.51/1.62 % Current number of archived clauses : 462
% 6.51/1.62 % Clause-clause subsumption calls (NU) : 207647
% 6.51/1.62 % Rec. Clause-clause subsumption calls : 55188
% 6.51/1.62 % Non-unit clause-clause subsumptions : 1966
% 6.51/1.62 % Unit Clause-clause subsumption calls : 3297
% 6.51/1.62 % Rewrite failures with RHS unbound : 0
% 6.51/1.62 % BW rewrite match attempts : 12
% 6.51/1.62 % BW rewrite match successes : 12
% 6.51/1.62 % Condensation attempts : 0
% 6.51/1.62 % Condensation successes : 0
% 6.51/1.62 % Termbank termtop insertions : 306561
% 6.51/1.62 % Search garbage collected termcells : 3543
% 6.51/1.62
% 6.51/1.62 % -------------------------------------------------
% 6.51/1.62 % User time : 0.960 s
% 6.51/1.62 % System time : 0.030 s
% 6.51/1.62 % Total time : 0.990 s
% 6.51/1.62 % Maximum resident set size: 4260 pages
% 6.51/1.62
% 6.51/1.62 % -------------------------------------------------
% 6.51/1.62 % User time : 4.101 s
% 6.51/1.62 % System time : 0.136 s
% 6.51/1.62 % Total time : 4.237 s
% 6.51/1.62 % Maximum resident set size: 4608 pages
% 6.51/1.62 % E exiting
%------------------------------------------------------------------------------