%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM630+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 : n010.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:50 PM UTC 2026
% Result : Theorem 1.25s 0.73s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 18 ( 12 unt; 0 def)
% Number of atoms : 42 ( 17 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 38 ( 14 ~; 10 |; 12 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 12 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
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(m__5585,hypothesis,
xD = sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5585) ).
fof(m__5309,hypothesis,
( sdtlpdtrp0(xe,xn) = xp
& aElementOf0(xn,szNzAzT0)
& aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5309) ).
fof(m__5599,hypothesis,
aElementOf0(xP,slbdtsldtrb0(xD,xk)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5599) ).
fof(m__5164,hypothesis,
( xP = sdtmndt0(xQ,szmzizndt0(xQ))
& aSet0(xP) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5164) ).
fof(c_0_6,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,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_9,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))),xk))
| ~ aSet0(X1)
| sdtlpdtrp0(sdtlpdtrp0(xC,X2),X1) = sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,hypothesis,
xD = sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))),
inference(split_conjunct,[status(thm)],[m__5585]) ).
cnf(c_0_12,hypothesis,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5309]) ).
cnf(c_0_13,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,hypothesis,
( ~ aSet0(X1)
| ~ aElementOf0(X1,slbdtsldtrb0(xD,xk))
| sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_15,hypothesis,
aElementOf0(xP,slbdtsldtrb0(xD,xk)),
inference(split_conjunct,[status(thm)],[m__5599]) ).
cnf(c_0_16,hypothesis,
aSet0(xP),
inference(split_conjunct,[status(thm)],[m__5164]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM630+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.17/0.44 % Computer : n010.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 02:45:55 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.50 Running first-order theorem proving
% 0.25/0.50 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
% 1.25/0.73 % Version: 3.5.1
% 1.25/0.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.25/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.25/0.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.25/0.73 % Starting new_bool_3 with 300s (1) cores
% 1.25/0.73 % Starting new_bool_1 with 300s (1) cores
% 1.25/0.73 % Starting sh5l with 300s (1) cores
% 1.25/0.73 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4070262 completed with status 0
% 1.25/0.73 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.25/0.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.25/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.25/0.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.25/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.25/0.73 % No SInE strategy applied
% 1.25/0.73 % Search class: FGHSF-FSLM31-MFFFFFNN
% 1.25/0.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.25/0.73 % Starting SubtermCWHack with 136s (1) cores
% 1.25/0.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.25/0.73 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 1.25/0.73 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 1.25/0.73 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 1.25/0.73 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 4070268 completed with status 0
% 1.25/0.73 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 1.25/0.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.25/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.25/0.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.25/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.25/0.73 % No SInE strategy applied
% 1.25/0.73 % Search class: FGHSF-FSLM31-MFFFFFNN
% 1.25/0.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.25/0.73 % Starting SubtermCWHack with 136s (1) cores
% 1.25/0.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.25/0.73 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 1.25/0.73 % Preprocessing time : 0.007 s
% 1.25/0.73 % Presaturation interreduction done
% 1.25/0.73
% 1.25/0.73 % Proof found!
% 1.25/0.73 % SZS status Theorem
% 1.25/0.73 % SZS output start CNFRefutation
% See solution above
% 1.25/0.73 % Parsed axioms : 116
% 1.25/0.73 % Removed by relevancy pruning/SinE : 0
% 1.25/0.73 % Initial clauses : 222
% 1.25/0.73 % Removed in clause preprocessing : 7
% 1.25/0.73 % Initial clauses in saturation : 215
% 1.25/0.73 % Processed clauses : 1270
% 1.25/0.73 % ...of these trivial : 13
% 1.25/0.73 % ...subsumed : 361
% 1.25/0.73 % ...remaining for further processing : 896
% 1.25/0.73 % Other redundant clauses eliminated : 54
% 1.25/0.73 % Clauses deleted for lack of memory : 0
% 1.25/0.73 % Backward-subsumed : 45
% 1.25/0.73 % Backward-rewritten : 21
% 1.25/0.73 % Generated clauses : 2362
% 1.25/0.73 % ...of the previous two non-redundant : 2080
% 1.25/0.73 % ...aggressively subsumed : 0
% 1.25/0.73 % Contextual simplify-reflections : 41
% 1.25/0.73 % Paramodulations : 2309
% 1.25/0.73 % Factorizations : 0
% 1.25/0.73 % NegExts : 0
% 1.25/0.73 % Equation resolutions : 58
% 1.25/0.73 % Disequality decompositions : 0
% 1.25/0.73 % Total rewrite steps : 1859
% 1.25/0.73 % ...of those cached : 1761
% 1.25/0.73 % Propositional unsat checks : 0
% 1.25/0.73 % Propositional check models : 0
% 1.25/0.73 % Propositional check unsatisfiable : 0
% 1.25/0.73 % Propositional clauses : 0
% 1.25/0.73 % Propositional clauses after purity: 0
% 1.25/0.73 % Propositional unsat core size : 0
% 1.25/0.73 % Propositional preprocessing time : 0.000
% 1.25/0.73 % Propositional encoding time : 0.000
% 1.25/0.73 % Propositional solver time : 0.000
% 1.25/0.73 % Success case prop preproc time : 0.000
% 1.25/0.73 % Success case prop encoding time : 0.000
% 1.25/0.73 % Success case prop solver time : 0.000
% 1.25/0.73 % Current number of processed clauses : 577
% 1.25/0.73 % Positive orientable unit clauses : 116
% 1.25/0.73 % Positive unorientable unit clauses: 0
% 1.25/0.73 % Negative unit clauses : 39
% 1.25/0.73 % Non-unit-clauses : 422
% 1.25/0.73 % Current number of unprocessed clauses: 1206
% 1.25/0.73 % ...number of literals in the above : 6342
% 1.25/0.73 % Current number of archived formulas : 0
% 1.25/0.73 % Current number of archived clauses : 279
% 1.25/0.73 % Clause-clause subsumption calls (NU) : 22529
% 1.25/0.73 % Rec. Clause-clause subsumption calls : 8211
% 1.25/0.73 % Non-unit clause-clause subsumptions : 211
% 1.25/0.73 % Unit Clause-clause subsumption calls : 1739
% 1.25/0.73 % Rewrite failures with RHS unbound : 0
% 1.25/0.73 % BW rewrite match attempts : 18
% 1.25/0.73 % BW rewrite match successes : 18
% 1.25/0.73 % Condensation attempts : 0
% 1.25/0.73 % Condensation successes : 0
% 1.25/0.73 % Termbank termtop insertions : 57338
% 1.25/0.73 % Search garbage collected termcells : 3742
% 1.25/0.73
% 1.25/0.73 % -------------------------------------------------
% 1.25/0.73 % User time : 0.170 s
% 1.25/0.73 % System time : 0.019 s
% 1.25/0.73 % Total time : 0.189 s
% 1.25/0.73 % Maximum resident set size: 4288 pages
% 1.25/0.73
% 1.25/0.73 % -------------------------------------------------
% 1.25/0.73 % User time : 0.805 s
% 1.25/0.73 % System time : 0.058 s
% 1.25/0.73 % Total time : 0.863 s
% 1.25/0.73 % Maximum resident set size: 4864 pages
% 1.25/0.73 % E exiting
%------------------------------------------------------------------------------