0.04/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.14	% Command    : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s
0.14/0.36	% Computer   : n008.cluster.edu
0.14/0.36	% Model      : x86_64 x86_64
0.14/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.36	% Memory     : 8042.1875MB
0.14/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.36	% CPULimit   : 180
0.14/0.36	% DateTime   : Thu Aug 29 09:22:23 EDT 2019
0.14/0.36	% CPUTime    : 
0.14/0.36	# Version: 2.4_pre003
0.14/0.36	# No SInE strategy applied
0.14/0.36	# Trying AutoSched0 for 90 seconds
0.21/0.48	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S059I
0.21/0.48	# and selection function SelectComplexExceptUniqMaxPosHorn.
0.21/0.48	#
0.21/0.48	# Preprocessing time       : 0.052 s
0.21/0.48	# Presaturation interreduction done
0.21/0.48	
0.21/0.48	# Proof found!
0.21/0.48	# SZS status Theorem
0.21/0.48	# SZS output start CNFRefutation
0.21/0.48	fof(cl5_nebula_norm_0012, conjecture, ((((n1=sum(n0,n4,a_select3(q,pv10,tptp_sum_index))&![X9]:((leq(n0,X9)&leq(X9,pred(pv10)))=>sum(n0,n4,a_select3(q,X9,tptp_sum_index))=n1))&leq(pv10,n135299))&leq(n0,pv10))=>![X13]:(n1=sum(n0,n4,a_select3(q,X13,tptp_sum_index))<=(leq(n0,X13)&leq(X13,pv10)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cl5_nebula_norm_0012)).
0.21/0.48	fof(leq_gt_pred, axiom, ![X1, X2]:(leq(X1,pred(X2))<=>gt(X2,X1)), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', leq_gt_pred)).
0.21/0.48	fof(pred_minus_1, axiom, ![X1]:pred(X1)=minus(X1,n1), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', pred_minus_1)).
0.21/0.48	fof(leq_gt2, axiom, ![X1, X2]:(gt(X2,X1)<=(leq(X1,X2)&X1!=X2)), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', leq_gt2)).
0.21/0.48	fof(c_0_4, negated_conjecture, ~(((((n1=sum(n0,n4,a_select3(q,pv10,tptp_sum_index))&![X9]:((leq(n0,X9)&leq(X9,pred(pv10)))=>sum(n0,n4,a_select3(q,X9,tptp_sum_index))=n1))&leq(pv10,n135299))&leq(n0,pv10))=>![X13]:(n1=sum(n0,n4,a_select3(q,X13,tptp_sum_index))<=(leq(n0,X13)&leq(X13,pv10))))), inference(assume_negation,[status(cth)],[cl5_nebula_norm_0012])).
0.21/0.48	fof(c_0_5, plain, ![X156, X157]:((~leq(X156,pred(X157))|gt(X157,X156))&(~gt(X157,X156)|leq(X156,pred(X157)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])])).
0.21/0.48	fof(c_0_6, plain, ![X119]:pred(X119)=minus(X119,n1), inference(variable_rename,[status(thm)],[pred_minus_1])).
0.21/0.48	fof(c_0_7, plain, ![X153, X154]:(~leq(X153,X154)|X153=X154|gt(X154,X153)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[leq_gt2])])])).
0.21/0.48	fof(c_0_8, negated_conjecture, ![X192]:((((n1=sum(n0,n4,a_select3(q,pv10,tptp_sum_index))&(~leq(n0,X192)|~leq(X192,pred(pv10))|sum(n0,n4,a_select3(q,X192,tptp_sum_index))=n1))&leq(pv10,n135299))&leq(n0,pv10))&((leq(n0,esk28_0)&leq(esk28_0,pv10))&n1!=sum(n0,n4,a_select3(q,esk28_0,tptp_sum_index)))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])])).
0.21/0.48	cnf(c_0_9, plain, (leq(X2,pred(X1))|~gt(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.21/0.48	cnf(c_0_10, plain, (pred(X1)=minus(X1,n1)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.21/0.48	cnf(c_0_11, plain, (X1=X2|gt(X2,X1)|~leq(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.21/0.48	cnf(c_0_12, negated_conjecture, (leq(esk28_0,pv10)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.21/0.48	cnf(c_0_13, negated_conjecture, (sum(n0,n4,a_select3(q,X1,tptp_sum_index))=n1|~leq(n0,X1)|~leq(X1,pred(pv10))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.21/0.48	cnf(c_0_14, plain, (leq(X2,minus(X1,n1))|~gt(X1,X2)), inference(rw,[status(thm)],[c_0_9, c_0_10])).
0.21/0.48	cnf(c_0_15, negated_conjecture, (esk28_0=pv10|gt(pv10,esk28_0)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.21/0.48	cnf(c_0_16, negated_conjecture, (sum(n0,n4,a_select3(q,X1,tptp_sum_index))=n1|~leq(n0,X1)|~leq(X1,minus(pv10,n1))), inference(rw,[status(thm)],[c_0_13, c_0_10])).
0.21/0.48	cnf(c_0_17, negated_conjecture, (esk28_0=pv10|leq(esk28_0,minus(pv10,n1))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
0.21/0.48	cnf(c_0_18, negated_conjecture, (leq(n0,esk28_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.21/0.48	cnf(c_0_19, negated_conjecture, (n1!=sum(n0,n4,a_select3(q,esk28_0,tptp_sum_index))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.21/0.48	cnf(c_0_20, negated_conjecture, (esk28_0=pv10), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18])]), c_0_19])).
0.21/0.48	cnf(c_0_21, negated_conjecture, (n1=sum(n0,n4,a_select3(q,pv10,tptp_sum_index))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.21/0.48	cnf(c_0_22, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19, c_0_20]), c_0_21])]), ['proof']).
0.21/0.48	# SZS output end CNFRefutation
0.21/0.48	# Proof object total steps             : 23
0.21/0.48	# Proof object clause steps            : 14
0.21/0.48	# Proof object formula steps           : 9
0.21/0.48	# Proof object conjectures             : 13
0.21/0.48	# Proof object clause conjectures      : 10
0.21/0.48	# Proof object formula conjectures     : 3
0.21/0.48	# Proof object initial clauses used    : 8
0.21/0.48	# Proof object initial formulas used   : 4
0.21/0.48	# Proof object generating inferences   : 3
0.21/0.48	# Proof object simplifying inferences  : 8
0.21/0.48	# Training examples: 0 positive, 0 negative
0.21/0.48	# Parsed axioms                        : 92
0.21/0.48	# Removed by relevancy pruning/SinE    : 0
0.21/0.48	# Initial clauses                      : 301
0.21/0.48	# Removed in clause preprocessing      : 2
0.21/0.48	# Initial clauses in saturation        : 299
0.21/0.48	# Processed clauses                    : 553
0.21/0.48	# ...of these trivial                  : 8
0.21/0.48	# ...subsumed                          : 85
0.21/0.48	# ...remaining for further processing  : 460
0.21/0.48	# Other redundant clauses eliminated   : 3
0.21/0.48	# Clauses deleted for lack of memory   : 0
0.21/0.48	# Backward-subsumed                    : 0
0.21/0.48	# Backward-rewritten                   : 15
0.21/0.48	# Generated clauses                    : 391
0.21/0.48	# ...of the previous two non-trivial   : 294
0.21/0.48	# Contextual simplify-reflections      : 0
0.21/0.48	# Paramodulations                      : 387
0.21/0.48	# Factorizations                       : 2
0.21/0.48	# Equation resolutions                 : 3
0.21/0.48	# Propositional unsat checks           : 0
0.21/0.48	#    Propositional check models        : 0
0.21/0.48	#    Propositional check unsatisfiable : 0
0.21/0.48	#    Propositional clauses             : 0
0.21/0.48	#    Propositional clauses after purity: 0
0.21/0.48	#    Propositional unsat core size     : 0
0.21/0.48	#    Propositional preprocessing time  : 0.000
0.21/0.48	#    Propositional encoding time       : 0.000
0.21/0.48	#    Propositional solver time         : 0.000
0.21/0.48	#    Success case prop preproc time    : 0.000
0.21/0.48	#    Success case prop encoding time   : 0.000
0.21/0.48	#    Success case prop solver time     : 0.000
0.21/0.48	# Current number of processed clauses  : 144
0.21/0.48	#    Positive orientable unit clauses  : 96
0.21/0.48	#    Positive unorientable unit clauses: 5
0.21/0.48	#    Negative unit clauses             : 23
0.21/0.48	#    Non-unit-clauses                  : 20
0.21/0.48	# Current number of unprocessed clauses: 337
0.21/0.48	# ...number of literals in the above   : 1777
0.21/0.48	# Current number of archived formulas  : 0
0.21/0.48	# Current number of archived clauses   : 316
0.21/0.48	# Clause-clause subsumption calls (NU) : 35332
0.21/0.48	# Rec. Clause-clause subsumption calls : 1898
0.21/0.48	# Non-unit clause-clause subsumptions  : 1
0.21/0.48	# Unit Clause-clause subsumption calls : 142
0.21/0.48	# Rewrite failures with RHS unbound    : 0
0.21/0.48	# BW rewrite match attempts            : 54
0.21/0.48	# BW rewrite match successes           : 46
0.21/0.48	# Condensation attempts                : 0
0.21/0.48	# Condensation successes               : 0
0.21/0.48	# Termbank termtop insertions          : 41625
0.21/0.48	
0.21/0.48	# -------------------------------------------------
0.21/0.48	# User time                : 0.109 s
0.21/0.48	# System time              : 0.008 s
0.21/0.48	# Total time               : 0.117 s
0.21/0.48	# Maximum resident set size: 1724 pages
0.33/0.48	EOF