%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM597+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:43 PM UTC 2026
% Result : Theorem 3.53s 1.37s
% Output : CNFRefutation 3.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 91 ( 21 equ)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 105 ( 39 ~; 35 |; 24 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 13 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
aElementOf0(szDzizrdt0(xd),xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__4868,hypothesis,
~ ( ( ! [X1] :
( aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
<=> ( sdtlpdtrp0(xd,X1) = szDzizrdt0(xd)
& aElementOf0(X1,szDzozmdt0(xd)) ) )
& aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd))) )
=> ~ ? [X1] : aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4868) ).
fof(m__4758,hypothesis,
( aSubsetOf0(sdtlcdtrc0(xd,szDzozmdt0(xd)),xT)
& ! [X1] :
( aElementOf0(X1,sdtlcdtrc0(xd,szDzozmdt0(xd)))
=> aElementOf0(X1,xT) )
& ! [X1] :
( aElementOf0(X1,sdtlcdtrc0(xd,szDzozmdt0(xd)))
<=> ? [X2] :
( sdtlpdtrp0(xd,X2) = X1
& aElementOf0(X2,szDzozmdt0(xd)) ) )
& aSet0(sdtlcdtrc0(xd,szDzozmdt0(xd))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4758) ).
fof(m__4730,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( ( aElementOf0(X2,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk))
| ( sbrdtbr0(X2) = xk
& ( aSubsetOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1)))
| ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ) )
& aSet0(X2) )
=> sdtlpdtrp0(xd,X1) = sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) ) )
& szDzozmdt0(xd) = szNzAzT0
& aFunction0(xd) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4730) ).
fof(c_0_4,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,hypothesis,
! [X245] :
( aElementOf0(esk38_0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& ( aElementOf0(X245,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xd,X245) != szDzizrdt0(xd)
| ~ aElementOf0(X245,szDzozmdt0(xd)) )
& ( ~ aElementOf0(X245,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xd,X245) = szDzizrdt0(xd) )
& ( ~ aElementOf0(X245,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| aElementOf0(X245,szDzozmdt0(xd)) )
& aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
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__4868])])])])])]) ).
fof(c_0_7,hypothesis,
! [X240,X242,X243,X244] :
( aSubsetOf0(sdtlcdtrc0(xd,szDzozmdt0(xd)),xT)
& ( aElementOf0(X244,xT)
| ~ aElementOf0(X244,sdtlcdtrc0(xd,szDzozmdt0(xd))) )
& ( aElementOf0(X242,sdtlcdtrc0(xd,szDzozmdt0(xd)))
| sdtlpdtrp0(xd,X243) != X242
| ~ aElementOf0(X243,szDzozmdt0(xd)) )
& ( ~ aElementOf0(X240,sdtlcdtrc0(xd,szDzozmdt0(xd)))
| sdtlpdtrp0(xd,esk37_1(X240)) = X240 )
& ( ~ aElementOf0(X240,sdtlcdtrc0(xd,szDzozmdt0(xd)))
| aElementOf0(esk37_1(X240),szDzozmdt0(xd)) )
& aSet0(sdtlcdtrc0(xd,szDzozmdt0(xd))) ),
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)],[m__4758])])])])])])]) ).
fof(c_0_8,hypothesis,
! [X237,X238] :
( ( ~ aElementOf0(X237,szNzAzT0)
| sdtlpdtrp0(xd,X237) = sdtlpdtrp0(sdtlpdtrp0(xC,X237),X238)
| ~ aSet0(X238)
| ~ aElementOf0(X238,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X237)),xk)) )
& ( ~ aElementOf0(X237,szNzAzT0)
| sdtlpdtrp0(xd,X237) = sdtlpdtrp0(sdtlpdtrp0(xC,X237),X238)
| ~ aSet0(X238)
| sbrdtbr0(X238) != xk
| ~ aSubsetOf0(X238,sdtlpdtrp0(xN,szszuzczcdt0(X237))) )
& ( ~ aElementOf0(X237,szNzAzT0)
| sdtlpdtrp0(xd,X237) = sdtlpdtrp0(sdtlpdtrp0(xC,X237),X238)
| ~ aSet0(X238)
| sbrdtbr0(X238) != xk
| ~ aElementOf0(esk36_2(X237,X238),sdtlpdtrp0(xN,szszuzczcdt0(X237))) )
& ( ~ aElementOf0(X237,szNzAzT0)
| sdtlpdtrp0(xd,X237) = sdtlpdtrp0(sdtlpdtrp0(xC,X237),X238)
| ~ aSet0(X238)
| sbrdtbr0(X238) != xk
| aElementOf0(esk36_2(X237,X238),X238) )
& szDzozmdt0(xd) = szNzAzT0
& aFunction0(xd) ),
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__4730])])])])])]) ).
fof(c_0_9,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
cnf(c_0_10,hypothesis,
( ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xd,X1) = szDzizrdt0(xd) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
aElementOf0(esk38_0,sdtlbdtrb0(xd,szDzizrdt0(xd))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,hypothesis,
( ~ aElementOf0(X1,sdtlcdtrc0(xd,szDzozmdt0(xd)))
| aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,hypothesis,
szDzozmdt0(xd) = szNzAzT0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,hypothesis,
( sdtlpdtrp0(xd,X1) != X2
| ~ aElementOf0(X1,szDzozmdt0(xd))
| aElementOf0(X2,sdtlcdtrc0(xd,szDzozmdt0(xd))) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,hypothesis,
( ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| aElementOf0(X1,szDzozmdt0(xd)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,hypothesis,
szDzizrdt0(xd) = sdtlpdtrp0(xd,esk38_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,hypothesis,
( ~ aElementOf0(X1,sdtlcdtrc0(xd,szNzAzT0))
| aElementOf0(X1,xT) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xd,X1),sdtlcdtrc0(xd,szNzAzT0)) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_13]),c_0_13])]) ).
cnf(c_0_20,hypothesis,
( ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| aElementOf0(X1,szNzAzT0) ),
inference(rw,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
~ aElementOf0(sdtlpdtrp0(xd,esk38_0),xT),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xd,X1),xT) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,hypothesis,
aElementOf0(esk38_0,szNzAzT0),
inference(spm,[status(thm)],[c_0_20,c_0_11]) ).
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 : NUM597+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.42 % Computer : n015.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Mon Sep 21 02:46:51 UTC 2026
% 0.17/0.42 % CPUTime :
% 0.17/0.42 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.51 Running first-order theorem proving
% 0.17/0.51 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 3.53/1.37 % Version: 3.5.1
% 3.53/1.37 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.53/1.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.53/1.37 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.53/1.37 % Starting new_bool_3 with 300s (1) cores
% 3.53/1.37 % Starting new_bool_1 with 300s (1) cores
% 3.53/1.37 % Starting sh5l with 300s (1) cores
% 3.53/1.37 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 388747 completed with status 0
% 3.53/1.37 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.53/1.37 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.53/1.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.53/1.37 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.53/1.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.53/1.37 % No SInE strategy applied
% 3.53/1.37 % Search class: FGHSF-SMLM32-MFFFFFNN
% 3.53/1.37 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.53/1.37 % Starting SubtermCWHack with 136s (1) cores
% 3.53/1.37 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.53/1.37 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 3.53/1.37 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 3.53/1.37 % Starting new_bool_3 with 136s (1) cores
% 3.53/1.37 % SubtermCWHack with pid 388751 completed with status 0
% 3.53/1.37 % Result found by SubtermCWHack
% 3.53/1.37 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.53/1.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.53/1.37 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.53/1.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.53/1.37 % No SInE strategy applied
% 3.53/1.37 % Search class: FGHSF-SMLM32-MFFFFFNN
% 3.53/1.37 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.53/1.37 % Starting SubtermCWHack with 136s (1) cores
% 3.53/1.37 % Preprocessing time : 0.168 s
% 3.53/1.37
% 3.53/1.37 % Proof found!
% 3.53/1.37 % SZS status Theorem
% 3.53/1.37 % SZS output start CNFRefutation
% See solution above
% 3.53/1.37 % Parsed axioms : 95
% 3.53/1.37 % Removed by relevancy pruning/SinE : 0
% 3.53/1.37 % Initial clauses : 4856
% 3.53/1.37 % Removed in clause preprocessing : 7
% 3.53/1.37 % Initial clauses in saturation : 4849
% 3.53/1.37 % Processed clauses : 598
% 3.53/1.37 % ...of these trivial : 2
% 3.53/1.37 % ...subsumed : 151
% 3.53/1.37 % ...remaining for further processing : 445
% 3.53/1.37 % Other redundant clauses eliminated : 39
% 3.53/1.37 % Clauses deleted for lack of memory : 0
% 3.53/1.37 % Backward-subsumed : 18
% 3.53/1.37 % Backward-rewritten : 17
% 3.53/1.37 % Generated clauses : 1135
% 3.53/1.37 % ...of the previous two non-redundant : 942
% 3.53/1.37 % ...aggressively subsumed : 0
% 3.53/1.37 % Contextual simplify-reflections : 14
% 3.53/1.37 % Paramodulations : 1095
% 3.53/1.37 % Factorizations : 0
% 3.53/1.37 % NegExts : 0
% 3.53/1.37 % Equation resolutions : 40
% 3.53/1.37 % Disequality decompositions : 0
% 3.53/1.37 % Total rewrite steps : 669
% 3.53/1.37 % ...of those cached : 601
% 3.53/1.37 % Propositional unsat checks : 0
% 3.53/1.37 % Propositional check models : 0
% 3.53/1.37 % Propositional check unsatisfiable : 0
% 3.53/1.37 % Propositional clauses : 0
% 3.53/1.37 % Propositional clauses after purity: 0
% 3.53/1.37 % Propositional unsat core size : 0
% 3.53/1.37 % Propositional preprocessing time : 0.000
% 3.53/1.37 % Propositional encoding time : 0.000
% 3.53/1.37 % Propositional solver time : 0.000
% 3.53/1.37 % Success case prop preproc time : 0.000
% 3.53/1.37 % Success case prop encoding time : 0.000
% 3.53/1.37 % Success case prop solver time : 0.000
% 3.53/1.37 % Current number of processed clauses : 375
% 3.53/1.37 % Positive orientable unit clauses : 73
% 3.53/1.37 % Positive unorientable unit clauses: 0
% 3.53/1.37 % Negative unit clauses : 20
% 3.53/1.37 % Non-unit-clauses : 282
% 3.53/1.37 % Current number of unprocessed clauses: 5112
% 3.53/1.37 % ...number of literals in the above : 57373
% 3.53/1.37 % Current number of archived formulas : 0
% 3.53/1.37 % Current number of archived clauses : 37
% 3.53/1.37 % Clause-clause subsumption calls (NU) : 13785
% 3.53/1.37 % Rec. Clause-clause subsumption calls : 9274
% 3.53/1.37 % Non-unit clause-clause subsumptions : 110
% 3.53/1.37 % Unit Clause-clause subsumption calls : 1556
% 3.53/1.37 % Rewrite failures with RHS unbound : 0
% 3.53/1.37 % BW rewrite match attempts : 13
% 3.53/1.37 % BW rewrite match successes : 11
% 3.53/1.37 % Condensation attempts : 0
% 3.53/1.37 % Condensation successes : 0
% 3.53/1.37 % Termbank termtop insertions : 396526
% 3.53/1.37 % Search garbage collected termcells : 31702
% 3.53/1.37
% 3.53/1.37 % -------------------------------------------------
% 3.53/1.37 % User time : 0.483 s
% 3.53/1.37 % System time : 0.052 s
% 3.53/1.37 % Total time : 0.535 s
% 3.53/1.37 % Maximum resident set size: 15836 pages
% 3.53/1.37
% 3.53/1.37 % -------------------------------------------------
% 3.53/1.37 % User time : 1.850 s
% 3.53/1.37 % System time : 0.155 s
% 3.53/1.37 % Total time : 2.005 s
% 3.53/1.37 % Maximum resident set size: 4864 pages
% 3.53/1.37 % E exiting
%------------------------------------------------------------------------------