%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM594+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 : n016.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:42 PM UTC 2026
% Result : Theorem 0.15s 0.74s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 103 ( 26 equ)
% Maximal formula atoms : 39 ( 4 avg)
% Number of connectives : 134 ( 56 ~; 55 |; 16 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-4 aty)
% Number of variables : 39 ( 0 sgn 19 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( sdtlpdtrp0(xd,X1) = xx
& aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
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__4730,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( aElementOf0(X2,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk))
& aSet0(X2) )
=> sdtlpdtrp0(xd,X1) = sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) ) )
& szDzozmdt0(xd) = szNzAzT0
& aFunction0(xd) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4730) ).
fof(m__4781,hypothesis,
aElementOf0(xx,sdtlcdtrc0(xd,szDzozmdt0(xd))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4781) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSubRefl) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet) ).
fof(c_0_6,negated_conjecture,
~ ? [X1] :
( sdtlpdtrp0(xd,X1) = xx
& aElementOf0(X1,szNzAzT0) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,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])])])])])])]) ).
fof(c_0_8,negated_conjecture,
! [X207] :
( sdtlpdtrp0(xd,X207) != xx
| ~ aElementOf0(X207,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_9,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_7]) ).
fof(c_0_10,hypothesis,
! [X205,X206] :
( ( sdtlpdtrp0(xd,X205) = sdtlpdtrp0(sdtlpdtrp0(xC,X205),X206)
| ~ aElementOf0(X206,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X205)),xk))
| ~ aSet0(X206)
| ~ aElementOf0(X205,szNzAzT0) )
& szDzozmdt0(xd) = szNzAzT0
& aFunction0(xd) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4730])])])]) ).
cnf(c_0_11,negated_conjecture,
( sdtlpdtrp0(xd,X1) != xx
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,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_9]) ).
cnf(c_0_13,hypothesis,
aFunction0(xd),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,hypothesis,
szDzozmdt0(xd) = szNzAzT0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,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_7]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xx,sdtlcdtrc0(xd,szDzozmdt0(xd))),
inference(split_conjunct,[status(thm)],[m__4781]) ).
cnf(c_0_17,negated_conjecture,
( ~ aElementOf0(xx,sdtlcdtrc0(xd,X1))
| ~ aElementOf0(esk14_4(xd,X1,sdtlcdtrc0(xd,X1),xx),szNzAzT0)
| ~ aSubsetOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])])]) ).
cnf(c_0_18,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_15]) ).
cnf(c_0_19,hypothesis,
aElementOf0(xx,sdtlcdtrc0(xd,szNzAzT0)),
inference(rw,[status(thm)],[c_0_16,c_0_14]) ).
fof(c_0_20,plain,
! [X26] :
( aSubsetOf0(X26,X26)
| ~ aSet0(X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])])]) ).
cnf(c_0_21,negated_conjecture,
~ aSubsetOf0(szNzAzT0,szNzAzT0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_13]),c_0_14])]) ).
cnf(c_0_22,plain,
( ~ aSet0(X1)
| aSubsetOf0(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM594+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/0.58 % Computer : n016.cluster.edu
% 0.10/0.58 % Model : x86_64 x86_64
% 0.10/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.58 % Memory : 8046.5625MB
% 0.10/0.58 % OS : Linux 6.8.0-71-generic
% 0.10/0.58 % CPULimit : 300
% 0.10/0.58 % WCLimit : 300
% 0.10/0.58 % DateTime : Mon Sep 21 02:47:38 UTC 2026
% 0.10/0.58 % CPUTime :
% 0.10/0.58 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.63 Running first-order theorem proving
% 0.15/0.63 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.15/0.74 % Version: 3.5.1
% 0.15/0.74 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.74 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.74 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.74 % Starting sh5l with 300s (1) cores
% 0.15/0.74 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1391327 completed with status 0
% 0.15/0.74 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.74 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.74 % No SInE strategy applied
% 0.15/0.74 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.15/0.74 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.74 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/0.74 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.74 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.15/0.74 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.15/0.74 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1391334 completed with status 0
% 0.15/0.74 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.74 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.74 % No SInE strategy applied
% 0.15/0.74 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.15/0.74 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.74 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/0.74 % Preprocessing time : 0.005 s
% 0.15/0.74 % Presaturation interreduction done
% 0.15/0.74
% 0.15/0.74 % Proof found!
% 0.15/0.74 % SZS status Theorem
% 0.15/0.74 % SZS output start CNFRefutation
% See solution above
% 0.15/0.74 % Parsed axioms : 95
% 0.15/0.74 % Removed by relevancy pruning/SinE : 0
% 0.15/0.74 % Initial clauses : 192
% 0.15/0.74 % Removed in clause preprocessing : 7
% 0.15/0.74 % Initial clauses in saturation : 185
% 0.15/0.74 % Processed clauses : 631
% 0.15/0.74 % ...of these trivial : 1
% 0.15/0.74 % ...subsumed : 79
% 0.15/0.74 % ...remaining for further processing : 551
% 0.15/0.74 % Other redundant clauses eliminated : 54
% 0.15/0.74 % Clauses deleted for lack of memory : 0
% 0.15/0.74 % Backward-subsumed : 6
% 0.15/0.74 % Backward-rewritten : 2
% 0.15/0.74 % Generated clauses : 1326
% 0.15/0.74 % ...of the previous two non-redundant : 1197
% 0.15/0.74 % ...aggressively subsumed : 0
% 0.15/0.74 % Contextual simplify-reflections : 26
% 0.15/0.74 % Paramodulations : 1274
% 0.15/0.74 % Factorizations : 0
% 0.15/0.74 % NegExts : 0
% 0.15/0.74 % Equation resolutions : 57
% 0.15/0.74 % Disequality decompositions : 0
% 0.15/0.74 % Total rewrite steps : 772
% 0.15/0.74 % ...of those cached : 724
% 0.15/0.74 % Propositional unsat checks : 0
% 0.15/0.74 % Propositional check models : 0
% 0.15/0.74 % Propositional check unsatisfiable : 0
% 0.15/0.74 % Propositional clauses : 0
% 0.15/0.74 % Propositional clauses after purity: 0
% 0.15/0.74 % Propositional unsat core size : 0
% 0.15/0.74 % Propositional preprocessing time : 0.000
% 0.15/0.74 % Propositional encoding time : 0.000
% 0.15/0.74 % Propositional solver time : 0.000
% 0.15/0.74 % Success case prop preproc time : 0.000
% 0.15/0.74 % Success case prop encoding time : 0.000
% 0.15/0.74 % Success case prop solver time : 0.000
% 0.15/0.74 % Current number of processed clauses : 319
% 0.15/0.74 % Positive orientable unit clauses : 58
% 0.15/0.74 % Positive unorientable unit clauses: 0
% 0.15/0.74 % Negative unit clauses : 12
% 0.15/0.74 % Non-unit-clauses : 249
% 0.15/0.74 % Current number of unprocessed clauses: 935
% 0.15/0.74 % ...number of literals in the above : 5234
% 0.15/0.74 % Current number of archived formulas : 0
% 0.15/0.74 % Current number of archived clauses : 192
% 0.15/0.74 % Clause-clause subsumption calls (NU) : 16633
% 0.15/0.74 % Rec. Clause-clause subsumption calls : 4912
% 0.15/0.74 % Non-unit clause-clause subsumptions : 73
% 0.15/0.74 % Unit Clause-clause subsumption calls : 536
% 0.15/0.74 % Rewrite failures with RHS unbound : 0
% 0.15/0.74 % BW rewrite match attempts : 3
% 0.15/0.74 % BW rewrite match successes : 3
% 0.15/0.74 % Condensation attempts : 0
% 0.15/0.74 % Condensation successes : 0
% 0.15/0.74 % Termbank termtop insertions : 43911
% 0.15/0.74 % Search garbage collected termcells : 3715
% 0.15/0.74
% 0.15/0.74 % -------------------------------------------------
% 0.15/0.74 % User time : 0.076 s
% 0.15/0.74 % System time : 0.015 s
% 0.15/0.74 % Total time : 0.091 s
% 0.15/0.74 % Maximum resident set size: 4272 pages
% 0.15/0.74
% 0.15/0.74 % -------------------------------------------------
% 0.15/0.74 % User time : 0.368 s
% 0.15/0.74 % System time : 0.039 s
% 0.15/0.74 % Total time : 0.408 s
% 0.15/0.74 % Maximum resident set size: 4864 pages
% 0.15/0.74 % E exiting
%------------------------------------------------------------------------------