%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM600+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 : n007.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 1.46s 0.85s
% Output : CNFRefutation 1.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 83 ( 30 equ)
% Maximal formula atoms : 21 ( 4 avg)
% Number of connectives : 98 ( 32 ~; 32 |; 28 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 10 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 10 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__4854,hypothesis,
( ! [X1] :
( aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
<=> ( sdtlpdtrp0(xd,X1) = szDzizrdt0(xd)
& aElementOf0(X1,szDzozmdt0(xd)) ) )
& aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(szDzizrdt0(xd),xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4854) ).
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(m__,conjecture,
! [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/sandbox/benchmark/theBenchmark.p',m__) ).
fof(c_0_3,hypothesis,
! [X75] :
( ( aElementOf0(X75,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xd,X75) != szDzizrdt0(xd)
| ~ aElementOf0(X75,szDzozmdt0(xd)) )
& ( ~ aElementOf0(X75,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xd,X75) = szDzizrdt0(xd) )
& ( ~ aElementOf0(X75,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| aElementOf0(X75,szDzozmdt0(xd)) )
& aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(szDzizrdt0(xd),xT) ),
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__4854])])])])]) ).
fof(c_0_4,hypothesis,
! [X67,X68] :
( ( ~ aElementOf0(X67,szNzAzT0)
| sdtlpdtrp0(xd,X67) = sdtlpdtrp0(sdtlpdtrp0(xC,X67),X68)
| ~ aSet0(X68)
| ~ aElementOf0(X68,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X67)),xk)) )
& ( ~ aElementOf0(X67,szNzAzT0)
| sdtlpdtrp0(xd,X67) = sdtlpdtrp0(sdtlpdtrp0(xC,X67),X68)
| ~ aSet0(X68)
| sbrdtbr0(X68) != xk
| ~ aSubsetOf0(X68,sdtlpdtrp0(xN,szszuzczcdt0(X67))) )
& ( ~ aElementOf0(X67,szNzAzT0)
| sdtlpdtrp0(xd,X67) = sdtlpdtrp0(sdtlpdtrp0(xC,X67),X68)
| ~ aSet0(X68)
| sbrdtbr0(X68) != xk
| ~ aElementOf0(esk17_2(X67,X68),sdtlpdtrp0(xN,szszuzczcdt0(X67))) )
& ( ~ aElementOf0(X67,szNzAzT0)
| sdtlpdtrp0(xd,X67) = sdtlpdtrp0(sdtlpdtrp0(xC,X67),X68)
| ~ aSet0(X68)
| sbrdtbr0(X68) != xk
| aElementOf0(esk17_2(X67,X68),X68) )
& 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_5,negated_conjecture,
~ ! [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) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_6,hypothesis,
( ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| aElementOf0(X1,szDzozmdt0(xd)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,hypothesis,
szDzozmdt0(xd) = szNzAzT0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
! [X83] :
( ( sdtlpdtrp0(xe,X83) != esk20_0
| ~ aElementOf0(X83,szNzAzT0)
| ~ aElementOf0(X83,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& ( sdtlpdtrp0(xe,X83) != esk20_0
| ~ aElementOf0(X83,szNzAzT0)
| sdtlpdtrp0(xd,X83) != szDzizrdt0(xd) )
& aElementOf0(esk20_0,xO)
& sdtlpdtrp0(xe,esk21_0) = esk20_0
& aElementOf0(esk21_0,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)],[c_0_5])])])])])]) ).
cnf(c_0_9,hypothesis,
( ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| aElementOf0(X1,szNzAzT0) ),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
aElementOf0(esk21_0,sdtlbdtrb0(xd,szDzizrdt0(xd))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( sdtlpdtrp0(xe,X1) != esk20_0
| ~ aElementOf0(X1,szNzAzT0)
| sdtlpdtrp0(xd,X1) != szDzizrdt0(xd) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
sdtlpdtrp0(xe,esk21_0) = esk20_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
aElementOf0(esk21_0,szNzAzT0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,hypothesis,
( ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xd,X1) = szDzizrdt0(xd) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_15,negated_conjecture,
szDzizrdt0(xd) != sdtlpdtrp0(xd,esk21_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_10]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM600+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n007.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.03/0.37 % CPULimit : 300
% 0.03/0.37 % WCLimit : 300
% 0.03/0.37 % DateTime : Mon Sep 21 02:41:21 UTC 2026
% 0.03/0.37 % CPUTime :
% 0.03/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.42 Running first-order theorem proving
% 0.03/0.42 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
% 1.46/0.85 % Version: 3.5.1
% 1.46/0.85 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.46/0.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/0.85 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.46/0.85 % Starting new_bool_3 with 300s (1) cores
% 1.46/0.85 % Starting new_bool_1 with 300s (1) cores
% 1.46/0.85 % Starting sh5l with 300s (1) cores
% 1.46/0.85 % new_bool_3 with pid 4190076 completed with status 0
% 1.46/0.85 % Result found by new_bool_3
% 1.46/0.85 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.46/0.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/0.85 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.46/0.85 % Starting new_bool_3 with 300s (1) cores
% 1.46/0.85 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.46/0.85 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.46/0.85 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.46/0.85 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.46/0.85 % Starting SubtermCWHack with 31s (1) cores
% 1.46/0.85 % SubtermCWHack with pid 4190079 completed with status 0
% 1.46/0.85 % Result found by SubtermCWHack
% 1.46/0.85 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.46/0.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/0.85 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.46/0.85 % Starting new_bool_3 with 300s (1) cores
% 1.46/0.85 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.46/0.85 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.46/0.85 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.46/0.85 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.46/0.85 % Starting SubtermCWHack with 31s (1) cores
% 1.46/0.85 % Preprocessing time : 0.094 s
% 1.46/0.85
% 1.46/0.85 % Proof found!
% 1.46/0.85 % SZS status Theorem
% 1.46/0.85 % SZS output start CNFRefutation
% See solution above
% 1.46/0.85 % Parsed axioms : 97
% 1.46/0.85 % Removed by relevancy pruning/SinE : 2
% 1.46/0.85 % Initial clauses : 4862
% 1.46/0.85 % Removed in clause preprocessing : 7
% 1.46/0.85 % Initial clauses in saturation : 4855
% 1.46/0.85 % Processed clauses : 382
% 1.46/0.85 % ...of these trivial : 4
% 1.46/0.85 % ...subsumed : 64
% 1.46/0.85 % ...remaining for further processing : 314
% 1.46/0.85 % Other redundant clauses eliminated : 24
% 1.46/0.85 % Clauses deleted for lack of memory : 0
% 1.46/0.85 % Backward-subsumed : 12
% 1.46/0.85 % Backward-rewritten : 9
% 1.46/0.85 % Generated clauses : 473
% 1.46/0.85 % ...of the previous two non-redundant : 390
% 1.46/0.85 % ...aggressively subsumed : 0
% 1.46/0.85 % Contextual simplify-reflections : 6
% 1.46/0.85 % Paramodulations : 449
% 1.46/0.85 % Factorizations : 0
% 1.46/0.85 % NegExts : 0
% 1.46/0.85 % Equation resolutions : 25
% 1.46/0.85 % Disequality decompositions : 0
% 1.46/0.85 % Total rewrite steps : 325
% 1.46/0.85 % ...of those cached : 280
% 1.46/0.85 % Propositional unsat checks : 0
% 1.46/0.85 % Propositional check models : 0
% 1.46/0.85 % Propositional check unsatisfiable : 0
% 1.46/0.85 % Propositional clauses : 0
% 1.46/0.85 % Propositional clauses after purity: 0
% 1.46/0.85 % Propositional unsat core size : 0
% 1.46/0.85 % Propositional preprocessing time : 0.000
% 1.46/0.85 % Propositional encoding time : 0.000
% 1.46/0.85 % Propositional solver time : 0.000
% 1.46/0.85 % Success case prop preproc time : 0.000
% 1.46/0.85 % Success case prop encoding time : 0.000
% 1.46/0.85 % Success case prop solver time : 0.000
% 1.46/0.85 % Current number of processed clauses : 275
% 1.46/0.85 % Positive orientable unit clauses : 67
% 1.46/0.85 % Positive unorientable unit clauses: 0
% 1.46/0.85 % Negative unit clauses : 20
% 1.46/0.85 % Non-unit-clauses : 188
% 1.46/0.85 % Current number of unprocessed clauses: 4856
% 1.46/0.85 % ...number of literals in the above : 56169
% 1.46/0.85 % Current number of archived formulas : 0
% 1.46/0.85 % Current number of archived clauses : 22
% 1.46/0.85 % Clause-clause subsumption calls (NU) : 6944
% 1.46/0.85 % Rec. Clause-clause subsumption calls : 5144
% 1.46/0.85 % Non-unit clause-clause subsumptions : 43
% 1.46/0.85 % Unit Clause-clause subsumption calls : 643
% 1.46/0.85 % Rewrite failures with RHS unbound : 0
% 1.46/0.85 % BW rewrite match attempts : 8
% 1.46/0.85 % BW rewrite match successes : 6
% 1.46/0.85 % Condensation attempts : 0
% 1.46/0.85 % Condensation successes : 0
% 1.46/0.85 % Termbank termtop insertions : 387244
% 1.46/0.85 % Search garbage collected termcells : 31583
% 1.46/0.85
% 1.46/0.85 % -------------------------------------------------
% 1.46/0.85 % User time : 0.354 s
% 1.46/0.85 % System time : 0.035 s
% 1.46/0.85 % Total time : 0.389 s
% 1.46/0.85 % Maximum resident set size: 15840 pages
% 1.46/0.85
% 1.46/0.85 % -------------------------------------------------
% 1.46/0.85 % User time : 0.366 s
% 1.46/0.85 % System time : 0.043 s
% 1.46/0.85 % Total time : 0.410 s
% 1.46/0.85 % Maximum resident set size: 5120 pages
% 1.46/0.85 % E exiting
%------------------------------------------------------------------------------