%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM595+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 : 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:55:38 PM UTC 2026
% Result : Theorem 4.50s 6.83s
% Output : CNFRefutation 4.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 130 ( 37 equ)
% Maximal formula atoms : 23 ( 5 avg)
% Number of connectives : 163 ( 58 ~; 60 |; 35 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 10 con; 0-2 aty)
% Number of variables : 27 ( 1 sgn 16 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/theBenchmark.p',m__4730) ).
fof(m__4826,hypothesis,
( ~ ~ ? [X1] : aElementOf0(X1,xX)
& xX = slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(xi)),xk)
& ! [X1] :
( ( ( sbrdtbr0(X1) = xk
& ( aSubsetOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xi)))
| ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(xi))) )
& aSet0(X1) ) ) )
=> aElementOf0(X1,xX) )
& ( aElementOf0(X1,xX)
=> ( sbrdtbr0(X1) = xk
& aSubsetOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xi)))
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(xi))) )
& aSet0(X1) ) ) )
& aSet0(xX) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4826) ).
fof(m__4618,hypothesis,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ? [X2] :
( ! [X3] :
( ( ( aElementOf0(X3,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk))
| ( sbrdtbr0(X3) = xk
& ( aSubsetOf0(X3,sdtlpdtrp0(xN,szszuzczcdt0(X1)))
| ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ) )
& aSet0(X3) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,X1),X3) = X2 )
& aElementOf0(X2,xT) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4618) ).
fof(m__4806,hypothesis,
( sdtlpdtrp0(xd,xi) = xx
& aElementOf0(xi,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4806) ).
fof(m__,conjecture,
aElementOf0(xx,xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(c_0_5,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_6,hypothesis,
! [X245,X246,X247] :
( aElementOf0(esk40_0,xX)
& xX = slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(xi)),xk)
& ( aElementOf0(X247,xX)
| sbrdtbr0(X247) != xk
| ~ aSubsetOf0(X247,sdtlpdtrp0(xN,szszuzczcdt0(xi))) )
& ( aElementOf0(X247,xX)
| sbrdtbr0(X247) != xk
| ~ aSet0(X247)
| ~ aElementOf0(esk39_1(X247),sdtlpdtrp0(xN,szszuzczcdt0(xi))) )
& ( aElementOf0(X247,xX)
| sbrdtbr0(X247) != xk
| ~ aSet0(X247)
| aElementOf0(esk39_1(X247),X247) )
& ( ~ aElementOf0(X245,xX)
| sbrdtbr0(X245) = xk )
& ( ~ aElementOf0(X245,xX)
| aSubsetOf0(X245,sdtlpdtrp0(xN,szszuzczcdt0(xi))) )
& ( ~ aElementOf0(X245,xX)
| aElementOf0(X246,sdtlpdtrp0(xN,szszuzczcdt0(xi)))
| ~ aElementOf0(X246,X245) )
& ( ~ aElementOf0(X245,xX)
| aSet0(X245) )
& aSet0(xX) ),
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__4826])])])])])])]) ).
fof(c_0_7,hypothesis,
! [X231,X233] :
( ( ~ aElementOf0(X231,szNzAzT0)
| sdtlpdtrp0(sdtlpdtrp0(xC,X231),X233) = esk34_1(X231)
| ~ aSet0(X233)
| ~ aElementOf0(X233,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X231)),xk)) )
& ( ~ aElementOf0(X231,szNzAzT0)
| sdtlpdtrp0(sdtlpdtrp0(xC,X231),X233) = esk34_1(X231)
| ~ aSet0(X233)
| sbrdtbr0(X233) != xk
| ~ aSubsetOf0(X233,sdtlpdtrp0(xN,szszuzczcdt0(X231))) )
& ( ~ aElementOf0(X231,szNzAzT0)
| sdtlpdtrp0(sdtlpdtrp0(xC,X231),X233) = esk34_1(X231)
| ~ aSet0(X233)
| sbrdtbr0(X233) != xk
| ~ aElementOf0(esk35_2(X231,X233),sdtlpdtrp0(xN,szszuzczcdt0(X231))) )
& ( ~ aElementOf0(X231,szNzAzT0)
| sdtlpdtrp0(sdtlpdtrp0(xC,X231),X233) = esk34_1(X231)
| ~ aSet0(X233)
| sbrdtbr0(X233) != xk
| aElementOf0(esk35_2(X231,X233),X233) )
& ( ~ aElementOf0(X231,szNzAzT0)
| aElementOf0(esk34_1(X231),xT) ) ),
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__4618])])])])])]) ).
cnf(c_0_8,hypothesis,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X1)
| ~ aElementOf0(X1,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),xk))
| sdtlpdtrp0(xd,X2) = sdtlpdtrp0(sdtlpdtrp0(xC,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
xX = slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(xi)),xk),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
sdtlpdtrp0(xd,xi) = xx,
inference(split_conjunct,[status(thm)],[m__4806]) ).
cnf(c_0_11,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__4806]) ).
cnf(c_0_12,hypothesis,
( ~ aElementOf0(X1,xX)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,hypothesis,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X1)
| ~ aElementOf0(X1,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),xk))
| sdtlpdtrp0(sdtlpdtrp0(xC,X2),X1) = esk34_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_14,negated_conjecture,
~ aElementOf0(xx,xT),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_15,hypothesis,
( ~ aElementOf0(X1,xX)
| sdtlpdtrp0(sdtlpdtrp0(xC,xi),X1) = xx ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]),c_0_12]) ).
cnf(c_0_16,hypothesis,
( ~ aElementOf0(X1,xX)
| sdtlpdtrp0(sdtlpdtrp0(xC,xi),X1) = esk34_1(xi) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_9]),c_0_11])]),c_0_12]) ).
fof(c_0_17,negated_conjecture,
~ aElementOf0(xx,xT),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
cnf(c_0_18,hypothesis,
( ~ aElementOf0(X1,xX)
| esk34_1(xi) = xx ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,hypothesis,
aElementOf0(esk40_0,xX),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_20,negated_conjecture,
~ aElementOf0(xx,xT),
inference(fof_nnf,[status(thm)],[c_0_17]) ).
cnf(c_0_21,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(esk34_1(X1),xT) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,hypothesis,
esk34_1(xi) = xx,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
~ aElementOf0(xx,xT),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_11])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM595+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/5.64 % Computer : n010.cluster.edu
% 0.17/5.64 % Model : x86_64 x86_64
% 0.17/5.64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.64 % Memory : 8046.5625MB
% 0.17/5.64 % OS : Linux 6.8.0-71-generic
% 0.17/5.64 % CPULimit : 300
% 0.17/5.64 % WCLimit : 300
% 0.17/5.64 % DateTime : Mon Sep 21 02:43:46 UTC 2026
% 0.17/5.64 % CPUTime :
% 0.17/5.64 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/5.71 Running first-order theorem proving
% 0.21/5.71 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
% 4.50/6.83 % Version: 3.5.1
% 4.50/6.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.50/6.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.50/6.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.50/6.83 % Starting new_bool_3 with 300s (1) cores
% 4.50/6.83 % Starting new_bool_1 with 300s (1) cores
% 4.50/6.83 % Starting sh5l with 300s (1) cores
% 4.50/6.83 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4065420 completed with status 0
% 4.50/6.83 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.50/6.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.50/6.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.50/6.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.50/6.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.50/6.83 % No SInE strategy applied
% 4.50/6.83 % Search class: FGHSF-SMLM32-MFFFFFNN
% 4.50/6.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.50/6.83 % Starting SubtermCWHack with 136s (1) cores
% 4.50/6.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.50/6.83 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 4.50/6.83 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 4.50/6.83 % Starting new_bool_3 with 136s (1) cores
% 4.50/6.83 % SubtermCWHack with pid 4065424 completed with status 0
% 4.50/6.83 % Result found by SubtermCWHack
% 4.50/6.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.50/6.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.50/6.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.50/6.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.50/6.83 % No SInE strategy applied
% 4.50/6.83 % Search class: FGHSF-SMLM32-MFFFFFNN
% 4.50/6.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.50/6.83 % Starting SubtermCWHack with 136s (1) cores
% 4.50/6.83 % Preprocessing time : 0.166 s
% 4.50/6.83
% 4.50/6.83 % Proof found!
% 4.50/6.83 % SZS status Theorem
% 4.50/6.83 % SZS output start CNFRefutation
% See solution above
% 4.50/6.83 % Parsed axioms : 97
% 4.50/6.83 % Removed by relevancy pruning/SinE : 0
% 4.50/6.83 % Initial clauses : 4864
% 4.50/6.83 % Removed in clause preprocessing : 7
% 4.50/6.83 % Initial clauses in saturation : 4857
% 4.50/6.83 % Processed clauses : 1922
% 4.50/6.83 % ...of these trivial : 20
% 4.50/6.83 % ...subsumed : 897
% 4.50/6.83 % ...remaining for further processing : 1005
% 4.50/6.83 % Other redundant clauses eliminated : 64
% 4.50/6.83 % Clauses deleted for lack of memory : 0
% 4.50/6.83 % Backward-subsumed : 52
% 4.50/6.83 % Backward-rewritten : 19
% 4.50/6.83 % Generated clauses : 6205
% 4.50/6.83 % ...of the previous two non-redundant : 5319
% 4.50/6.83 % ...aggressively subsumed : 0
% 4.50/6.83 % Contextual simplify-reflections : 37
% 4.50/6.83 % Paramodulations : 6142
% 4.50/6.83 % Factorizations : 0
% 4.50/6.83 % NegExts : 0
% 4.50/6.83 % Equation resolutions : 66
% 4.50/6.83 % Disequality decompositions : 0
% 4.50/6.83 % Total rewrite steps : 4046
% 4.50/6.83 % ...of those cached : 3938
% 4.50/6.83 % Propositional unsat checks : 0
% 4.50/6.83 % Propositional check models : 0
% 4.50/6.83 % Propositional check unsatisfiable : 0
% 4.50/6.83 % Propositional clauses : 0
% 4.50/6.83 % Propositional clauses after purity: 0
% 4.50/6.83 % Propositional unsat core size : 0
% 4.50/6.83 % Propositional preprocessing time : 0.000
% 4.50/6.83 % Propositional encoding time : 0.000
% 4.50/6.83 % Propositional solver time : 0.000
% 4.50/6.83 % Success case prop preproc time : 0.000
% 4.50/6.83 % Success case prop encoding time : 0.000
% 4.50/6.83 % Success case prop solver time : 0.000
% 4.50/6.83 % Current number of processed clauses : 891
% 4.50/6.83 % Positive orientable unit clauses : 109
% 4.50/6.83 % Positive unorientable unit clauses: 0
% 4.50/6.83 % Negative unit clauses : 31
% 4.50/6.83 % Non-unit-clauses : 751
% 4.50/6.83 % Current number of unprocessed clauses: 8150
% 4.50/6.83 % ...number of literals in the above : 73690
% 4.50/6.83 % Current number of archived formulas : 0
% 4.50/6.83 % Current number of archived clauses : 73
% 4.50/6.83 % Clause-clause subsumption calls (NU) : 91702
% 4.50/6.83 % Rec. Clause-clause subsumption calls : 47135
% 4.50/6.83 % Non-unit clause-clause subsumptions : 707
% 4.50/6.83 % Unit Clause-clause subsumption calls : 2950
% 4.50/6.83 % Rewrite failures with RHS unbound : 0
% 4.50/6.83 % BW rewrite match attempts : 31
% 4.50/6.83 % BW rewrite match successes : 16
% 4.50/6.83 % Condensation attempts : 0
% 4.50/6.83 % Condensation successes : 0
% 4.50/6.83 % Termbank termtop insertions : 485470
% 4.50/6.83 % Search garbage collected termcells : 31739
% 4.50/6.83
% 4.50/6.83 % -------------------------------------------------
% 4.50/6.83 % User time : 0.932 s
% 4.50/6.83 % System time : 0.053 s
% 4.50/6.83 % Total time : 0.985 s
% 4.50/6.83 % Maximum resident set size: 16044 pages
% 4.50/6.83
% 4.50/6.83 % -------------------------------------------------
% 4.50/6.83 % User time : 2.644 s
% 4.50/6.83 % System time : 0.156 s
% 4.50/6.83 % Total time : 2.800 s
% 4.50/6.83 % Maximum resident set size: 5120 pages
% 4.50/6.83 % E exiting
%------------------------------------------------------------------------------