%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM618+3 : 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 : n009.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:47 PM UTC 2026
% Result : Theorem 2.98s 1.32s
% Output : CNFRefutation 2.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 4 unt; 0 def)
% Number of atoms : 63 ( 19 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 70 ( 25 ~; 19 |; 24 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn 6 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__5348,hypothesis,
( aElementOf0(xx,xP)
& xx != szmzizndt0(xQ)
& aElementOf0(xx,xQ)
& aElement0(xx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5348) ).
fof(m__,conjecture,
? [X1] :
( xx = sdtlpdtrp0(xe,X1)
& aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__5208,hypothesis,
( aSubsetOf0(xP,xO)
& ! [X1] :
( aElementOf0(X1,xP)
=> aElementOf0(X1,xO) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5208) ).
fof(m__4982,hypothesis,
! [X1] :
( ( aElementOf0(X1,xO)
| ? [X2] :
( sdtlpdtrp0(xe,X2) = X1
& aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd))) ) )
=> ? [X2] :
( sdtlpdtrp0(xe,X2) = X1
& aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xd,X2) = szDzizrdt0(xd)
& aElementOf0(X2,szNzAzT0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4982) ).
fof(c_0_4,hypothesis,
( aElementOf0(xx,xP)
& xx != szmzizndt0(xQ)
& aElementOf0(xx,xQ)
& aElement0(xx) ),
inference(fof_simplification,[status(thm)],[m__5348]) ).
fof(c_0_5,negated_conjecture,
~ ? [X1] :
( xx = sdtlpdtrp0(xe,X1)
& aElementOf0(X1,szNzAzT0) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,hypothesis,
! [X266] :
( aSubsetOf0(xP,xO)
& ( aElementOf0(X266,xO)
| ~ aElementOf0(X266,xP) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5208])])])]) ).
fof(c_0_7,hypothesis,
( aElementOf0(xx,xP)
& xx != szmzizndt0(xQ)
& aElementOf0(xx,xQ)
& aElement0(xx) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
! [X268] :
( xx != sdtlpdtrp0(xe,X268)
| ~ aElementOf0(X268,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,hypothesis,
! [X251,X252] :
( ( ~ aElementOf0(X251,xO)
| sdtlpdtrp0(xe,esk39_1(X251)) = X251 )
& ( ~ aElementOf0(X251,xO)
| aElementOf0(esk39_1(X251),sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& ( ~ aElementOf0(X251,xO)
| sdtlpdtrp0(xd,esk39_1(X251)) = szDzizrdt0(xd) )
& ( ~ aElementOf0(X251,xO)
| aElementOf0(esk39_1(X251),szNzAzT0) )
& ( sdtlpdtrp0(xe,X252) != X251
| ~ aElementOf0(X252,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xe,esk39_1(X251)) = X251 )
& ( sdtlpdtrp0(xe,X252) != X251
| ~ aElementOf0(X252,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| aElementOf0(esk39_1(X251),sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& ( sdtlpdtrp0(xe,X252) != X251
| ~ aElementOf0(X252,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xd,esk39_1(X251)) = szDzizrdt0(xd) )
& ( sdtlpdtrp0(xe,X252) != X251
| ~ aElementOf0(X252,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| aElementOf0(esk39_1(X251),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4982])])])])])]) ).
cnf(c_0_10,hypothesis,
( ~ aElementOf0(X1,xP)
| aElementOf0(X1,xO) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
aElementOf0(xx,xP),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( xx != sdtlpdtrp0(xe,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
( ~ aElementOf0(X1,xO)
| sdtlpdtrp0(xe,esk39_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,hypothesis,
aElementOf0(xx,xO),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
~ aElementOf0(esk39_1(xx),szNzAzT0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13])]),c_0_14])]) ).
cnf(c_0_16,hypothesis,
( ~ aElementOf0(X1,xO)
| aElementOf0(esk39_1(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM618+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 02:44:43 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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
% 2.98/1.32 % Version: 3.5.1
% 2.98/1.32 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.98/1.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.98/1.32 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.98/1.32 % Starting new_bool_3 with 300s (1) cores
% 2.98/1.32 % Starting new_bool_1 with 300s (1) cores
% 2.98/1.32 % Starting sh5l with 300s (1) cores
% 2.98/1.32 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 674451 completed with status 0
% 2.98/1.32 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.98/1.32 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.98/1.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.98/1.32 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.98/1.32 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.98/1.32 % No SInE strategy applied
% 2.98/1.32 % Search class: FGHSF-SMLM32-MFFFFFNN
% 2.98/1.32 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.98/1.32 % Starting SubtermCWHack with 136s (1) cores
% 2.98/1.32 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.98/1.32 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 2.98/1.32 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 2.98/1.32 % Starting new_bool_3 with 136s (1) cores
% 2.98/1.32 % SubtermCWHack with pid 674457 completed with status 0
% 2.98/1.32 % Result found by SubtermCWHack
% 2.98/1.32 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.98/1.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.98/1.32 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.98/1.32 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.98/1.32 % No SInE strategy applied
% 2.98/1.32 % Search class: FGHSF-SMLM32-MFFFFFNN
% 2.98/1.32 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.98/1.32 % Starting SubtermCWHack with 136s (1) cores
% 2.98/1.32 % Preprocessing time : 0.172 s
% 2.98/1.32
% 2.98/1.32 % Proof found!
% 2.98/1.32 % SZS status Theorem
% 2.98/1.32 % SZS output start CNFRefutation
% See solution above
% 2.98/1.32 % Parsed axioms : 115
% 2.98/1.32 % Removed by relevancy pruning/SinE : 0
% 2.98/1.32 % Initial clauses : 4924
% 2.98/1.32 % Removed in clause preprocessing : 7
% 2.98/1.32 % Initial clauses in saturation : 4917
% 2.98/1.32 % Processed clauses : 210
% 2.98/1.32 % ...of these trivial : 13
% 2.98/1.32 % ...subsumed : 18
% 2.98/1.32 % ...remaining for further processing : 179
% 2.98/1.32 % Other redundant clauses eliminated : 9
% 2.98/1.32 % Clauses deleted for lack of memory : 0
% 2.98/1.32 % Backward-subsumed : 1
% 2.98/1.32 % Backward-rewritten : 1
% 2.98/1.32 % Generated clauses : 151
% 2.98/1.32 % ...of the previous two non-redundant : 100
% 2.98/1.32 % ...aggressively subsumed : 0
% 2.98/1.32 % Contextual simplify-reflections : 0
% 2.98/1.32 % Paramodulations : 142
% 2.98/1.32 % Factorizations : 0
% 2.98/1.32 % NegExts : 0
% 2.98/1.32 % Equation resolutions : 9
% 2.98/1.32 % Disequality decompositions : 0
% 2.98/1.32 % Total rewrite steps : 158
% 2.98/1.32 % ...of those cached : 113
% 2.98/1.32 % Propositional unsat checks : 0
% 2.98/1.32 % Propositional check models : 0
% 2.98/1.32 % Propositional check unsatisfiable : 0
% 2.98/1.32 % Propositional clauses : 0
% 2.98/1.32 % Propositional clauses after purity: 0
% 2.98/1.32 % Propositional unsat core size : 0
% 2.98/1.32 % Propositional preprocessing time : 0.000
% 2.98/1.32 % Propositional encoding time : 0.000
% 2.98/1.32 % Propositional solver time : 0.000
% 2.98/1.32 % Success case prop preproc time : 0.000
% 2.98/1.32 % Success case prop encoding time : 0.000
% 2.98/1.32 % Success case prop solver time : 0.000
% 2.98/1.32 % Current number of processed clauses : 171
% 2.98/1.32 % Positive orientable unit clauses : 89
% 2.98/1.32 % Positive unorientable unit clauses: 0
% 2.98/1.32 % Negative unit clauses : 15
% 2.98/1.32 % Non-unit-clauses : 67
% 2.98/1.32 % Current number of unprocessed clauses: 4804
% 2.98/1.32 % ...number of literals in the above : 55891
% 2.98/1.32 % Current number of archived formulas : 0
% 2.98/1.32 % Current number of archived clauses : 2
% 2.98/1.32 % Clause-clause subsumption calls (NU) : 581
% 2.98/1.32 % Rec. Clause-clause subsumption calls : 539
% 2.98/1.32 % Non-unit clause-clause subsumptions : 12
% 2.98/1.32 % Unit Clause-clause subsumption calls : 280
% 2.98/1.32 % Rewrite failures with RHS unbound : 0
% 2.98/1.32 % BW rewrite match attempts : 1
% 2.98/1.32 % BW rewrite match successes : 1
% 2.98/1.32 % Condensation attempts : 0
% 2.98/1.32 % Condensation successes : 0
% 2.98/1.32 % Termbank termtop insertions : 384718
% 2.98/1.32 % Search garbage collected termcells : 32048
% 2.98/1.32
% 2.98/1.32 % -------------------------------------------------
% 2.98/1.32 % User time : 0.665 s
% 2.98/1.32 % System time : 0.042 s
% 2.98/1.32 % Total time : 0.707 s
% 2.98/1.32 % Maximum resident set size: 15860 pages
% 2.98/1.32
% 2.98/1.32 % -------------------------------------------------
% 2.98/1.32 % User time : 1.202 s
% 2.98/1.32 % System time : 0.102 s
% 2.98/1.32 % Total time : 1.304 s
% 2.98/1.32 % Maximum resident set size: 5120 pages
% 2.98/1.32 % E exiting
%------------------------------------------------------------------------------