%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM594+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 : n013.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:42 PM UTC 2026
% Result : Theorem 3.18s 1.17s
% Output : CNFRefutation 3.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 50 ( 19 equ)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 56 ( 19 ~; 19 |; 15 &)
% ( 0 <=>; 3 =>; 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 : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 6 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( sdtlpdtrp0(xd,X1) = xx
& aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__4781,hypothesis,
( aElementOf0(xx,sdtlcdtrc0(xd,szDzozmdt0(xd)))
& ? [X1] :
( sdtlpdtrp0(xd,X1) = xx
& aElementOf0(X1,szDzozmdt0(xd)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4781) ).
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_3,negated_conjecture,
~ ? [X1] :
( sdtlpdtrp0(xd,X1) = xx
& aElementOf0(X1,szNzAzT0) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,hypothesis,
( aElementOf0(xx,sdtlcdtrc0(xd,szDzozmdt0(xd)))
& sdtlpdtrp0(xd,esk19_0) = xx
& aElementOf0(esk19_0,szDzozmdt0(xd)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__4781])]) ).
fof(c_0_5,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_6,negated_conjecture,
! [X75] :
( sdtlpdtrp0(xd,X75) != xx
| ~ aElementOf0(X75,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_7,hypothesis,
aElementOf0(esk19_0,szDzozmdt0(xd)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
szDzozmdt0(xd) = szNzAzT0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( sdtlpdtrp0(xd,X1) != xx
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
sdtlpdtrp0(xd,esk19_0) = xx,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,hypothesis,
aElementOf0(esk19_0,szNzAzT0),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM594+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n013.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Mon Sep 21 02:42:37 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 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.18/1.17 % Version: 3.5.1
% 3.18/1.17 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.18/1.17 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.18/1.17 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.18/1.17 % Starting new_bool_3 with 300s (1) cores
% 3.18/1.17 % Starting new_bool_1 with 300s (1) cores
% 3.18/1.17 % Starting sh5l with 300s (1) cores
% 3.18/1.17 % new_bool_1 with pid 3972667 completed with status 0
% 3.18/1.17 % Result found by new_bool_1
% 3.18/1.17 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.18/1.17 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.18/1.17 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.18/1.17 % Starting new_bool_3 with 300s (1) cores
% 3.18/1.17 % Starting new_bool_1 with 300s (1) cores
% 3.18/1.17 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.18/1.17 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.18/1.17 % Search class: FGHSF-SMLM32-MFFFFFNN
% 3.18/1.17 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 3.18/1.17 % Starting SubtermCWHack with 28s (1) cores
% 3.18/1.17 % SubtermCWHack with pid 3972669 completed with status 0
% 3.18/1.17 % Result found by SubtermCWHack
% 3.18/1.17 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.18/1.17 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.18/1.17 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.18/1.17 % Starting new_bool_3 with 300s (1) cores
% 3.18/1.17 % Starting new_bool_1 with 300s (1) cores
% 3.18/1.17 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.18/1.17 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.18/1.17 % Search class: FGHSF-SMLM32-MFFFFFNN
% 3.18/1.17 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 3.18/1.17 % Starting SubtermCWHack with 28s (1) cores
% 3.18/1.17 % Preprocessing time : 0.108 s
% 3.18/1.17
% 3.18/1.17 % Proof found!
% 3.18/1.17 % SZS status Theorem
% 3.18/1.17 % SZS output start CNFRefutation
% See solution above
% 3.18/1.17 % Parsed axioms : 95
% 3.18/1.17 % Removed by relevancy pruning/SinE : 5
% 3.18/1.17 % Initial clauses : 4833
% 3.18/1.17 % Removed in clause preprocessing : 7
% 3.18/1.17 % Initial clauses in saturation : 4826
% 3.18/1.17 % Processed clauses : 98
% 3.18/1.17 % ...of these trivial : 0
% 3.18/1.17 % ...subsumed : 4
% 3.18/1.17 % ...remaining for further processing : 94
% 3.18/1.17 % Other redundant clauses eliminated : 5
% 3.18/1.17 % Clauses deleted for lack of memory : 0
% 3.18/1.17 % Backward-subsumed : 0
% 3.18/1.17 % Backward-rewritten : 0
% 3.18/1.17 % Generated clauses : 56
% 3.18/1.17 % ...of the previous two non-redundant : 35
% 3.18/1.17 % ...aggressively subsumed : 0
% 3.18/1.17 % Contextual simplify-reflections : 0
% 3.18/1.17 % Paramodulations : 51
% 3.18/1.17 % Factorizations : 0
% 3.18/1.17 % NegExts : 0
% 3.18/1.17 % Equation resolutions : 5
% 3.18/1.17 % Disequality decompositions : 0
% 3.18/1.17 % Total rewrite steps : 63
% 3.18/1.17 % ...of those cached : 42
% 3.18/1.17 % Propositional unsat checks : 0
% 3.18/1.17 % Propositional check models : 0
% 3.18/1.17 % Propositional check unsatisfiable : 0
% 3.18/1.17 % Propositional clauses : 0
% 3.18/1.17 % Propositional clauses after purity: 0
% 3.18/1.17 % Propositional unsat core size : 0
% 3.18/1.17 % Propositional preprocessing time : 0.000
% 3.18/1.17 % Propositional encoding time : 0.000
% 3.18/1.17 % Propositional solver time : 0.000
% 3.18/1.17 % Success case prop preproc time : 0.000
% 3.18/1.17 % Success case prop encoding time : 0.000
% 3.18/1.17 % Success case prop solver time : 0.000
% 3.18/1.17 % Current number of processed clauses : 90
% 3.18/1.17 % Positive orientable unit clauses : 42
% 3.18/1.17 % Positive unorientable unit clauses: 0
% 3.18/1.17 % Negative unit clauses : 7
% 3.18/1.17 % Non-unit-clauses : 41
% 3.18/1.17 % Current number of unprocessed clauses: 4763
% 3.18/1.17 % ...number of literals in the above : 55730
% 3.18/1.17 % Current number of archived formulas : 0
% 3.18/1.17 % Current number of archived clauses : 0
% 3.18/1.17 % Clause-clause subsumption calls (NU) : 214
% 3.18/1.17 % Rec. Clause-clause subsumption calls : 178
% 3.18/1.17 % Non-unit clause-clause subsumptions : 1
% 3.18/1.17 % Unit Clause-clause subsumption calls : 170
% 3.18/1.17 % Rewrite failures with RHS unbound : 0
% 3.18/1.17 % BW rewrite match attempts : 0
% 3.18/1.17 % BW rewrite match successes : 0
% 3.18/1.17 % Condensation attempts : 0
% 3.18/1.17 % Condensation successes : 0
% 3.18/1.17 % Termbank termtop insertions : 379292
% 3.18/1.17 % Search garbage collected termcells : 31192
% 3.18/1.17
% 3.18/1.17 % -------------------------------------------------
% 3.18/1.17 % User time : 0.569 s
% 3.18/1.17 % System time : 0.033 s
% 3.18/1.17 % Total time : 0.602 s
% 3.18/1.17 % Maximum resident set size: 15832 pages
% 3.18/1.17
% 3.18/1.17 % -------------------------------------------------
% 3.18/1.17 % User time : 0.577 s
% 3.18/1.17 % System time : 0.042 s
% 3.18/1.17 % Total time : 0.619 s
% 3.18/1.17 % Maximum resident set size: 5120 pages
% 3.18/1.17 % E exiting
%------------------------------------------------------------------------------