0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer   : n029.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1200
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Wed Jul 14 14:03:25 EDT 2021
0.13/0.35	% CPUTime    : 
0.20/0.48	Running first-order theorem proving
0.20/0.48	Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers --proof-object --auto-schedule --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.20/0.48	# Version: 2.6
0.20/0.48	# No SInE strategy applied
0.20/0.48	# Trying AutoSched0 for 59 seconds
0.56/0.79	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S059I
0.56/0.79	# and selection function SelectComplexExceptUniqMaxPosHorn.
0.56/0.79	#
0.56/0.79	# Preprocessing time       : 0.042 s
0.56/0.79	# Presaturation interreduction done
0.56/0.79	
0.56/0.79	# Proof found!
0.56/0.79	# SZS status Theorem
0.56/0.79	# SZS output start CNFRefutation
0.56/0.79	fof(cl5_nebula_init_0046, conjecture, (![X16, X17]:((((leq(n0,X16)&leq(X17,n4))&leq(X16,n135299))&leq(n0,X17))=>(gt(pv10,X16)=>a_select3(q_init,X16,X17)=init))<=(((leq(pv10,n135299)&![X6]:((leq(n0,X6)&leq(X6,pred(pv10)))=>![X7]:(a_select3(q_init,X6,X7)=init<=(leq(n0,X7)&leq(X7,n4)))))&![X14]:((leq(X14,n4)&leq(n0,X14))=>init=a_select3(center_init,X14,n0)))&leq(n0,pv10))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cl5_nebula_init_0046)).
0.56/0.79	fof(leq_gt_pred, axiom, ![X1, X2]:(gt(X2,X1)<=>leq(X1,pred(X2))), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', leq_gt_pred)).
0.56/0.79	fof(pred_minus_1, axiom, ![X1]:minus(X1,n1)=pred(X1), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', pred_minus_1)).
0.56/0.79	fof(transitivity_leq, axiom, ![X1, X2, X3]:((leq(X2,X3)&leq(X1,X2))=>leq(X1,X3)), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', transitivity_leq)).
0.56/0.79	fof(reflexivity_leq, axiom, ![X1]:leq(X1,X1), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', reflexivity_leq)).
0.56/0.79	fof(c_0_5, negated_conjecture, ~(((((leq(pv10,n135299)&![X6]:((leq(n0,X6)&leq(X6,pred(pv10)))=>![X7]:((leq(n0,X7)&leq(X7,n4))=>a_select3(q_init,X6,X7)=init)))&![X14]:((leq(X14,n4)&leq(n0,X14))=>init=a_select3(center_init,X14,n0)))&leq(n0,pv10))=>![X16, X17]:((((leq(n0,X16)&leq(X17,n4))&leq(X16,n135299))&leq(n0,X17))=>(gt(pv10,X16)=>a_select3(q_init,X16,X17)=init)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cl5_nebula_init_0046])])).
0.56/0.79	fof(c_0_6, plain, ![X260, X261]:((~gt(X261,X260)|leq(X260,pred(X261)))&(~leq(X260,pred(X261))|gt(X261,X260))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])])).
0.56/0.79	fof(c_0_7, plain, ![X250]:minus(X250,n1)=pred(X250), inference(variable_rename,[status(thm)],[pred_minus_1])).
0.56/0.79	fof(c_0_8, negated_conjecture, ![X365, X366, X367]:((((leq(pv10,n135299)&(~leq(n0,X365)|~leq(X365,pred(pv10))|(~leq(n0,X366)|~leq(X366,n4)|a_select3(q_init,X365,X366)=init)))&(~leq(X367,n4)|~leq(n0,X367)|init=a_select3(center_init,X367,n0)))&leq(n0,pv10))&((((leq(n0,esk24_0)&leq(esk25_0,n4))&leq(esk24_0,n135299))&leq(n0,esk25_0))&(gt(pv10,esk24_0)&a_select3(q_init,esk24_0,esk25_0)!=init))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])).
0.56/0.79	cnf(c_0_9, plain, (leq(X2,pred(X1))|~gt(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.56/0.79	cnf(c_0_10, plain, (minus(X1,n1)=pred(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.56/0.79	cnf(c_0_11, negated_conjecture, (a_select3(q_init,X1,X2)=init|~leq(n0,X1)|~leq(X1,pred(pv10))|~leq(n0,X2)|~leq(X2,n4)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.56/0.79	cnf(c_0_12, plain, (leq(X2,minus(X1,n1))|~gt(X1,X2)), inference(rw,[status(thm)],[c_0_9, c_0_10])).
0.56/0.79	cnf(c_0_13, negated_conjecture, (gt(pv10,esk24_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.56/0.79	fof(c_0_14, plain, ![X201, X202, X203]:(~leq(X202,X203)|~leq(X201,X202)|leq(X201,X203)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_leq])])).
0.56/0.79	cnf(c_0_15, negated_conjecture, (a_select3(q_init,X1,X2)=init|~leq(X2,n4)|~leq(n0,X2)|~leq(n0,X1)|~leq(X1,minus(pv10,n1))), inference(rw,[status(thm)],[c_0_11, c_0_10])).
0.56/0.79	cnf(c_0_16, negated_conjecture, (leq(esk24_0,minus(pv10,n1))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
0.56/0.79	cnf(c_0_17, negated_conjecture, (leq(n0,esk24_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.56/0.79	cnf(c_0_18, plain, (leq(X3,X2)|~leq(X1,X2)|~leq(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.56/0.79	cnf(c_0_19, negated_conjecture, (leq(esk25_0,n4)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.56/0.79	fof(c_0_20, plain, ![X271]:leq(X271,X271), inference(variable_rename,[status(thm)],[reflexivity_leq])).
0.56/0.79	cnf(c_0_21, negated_conjecture, (a_select3(q_init,esk24_0,X1)=init|~leq(X1,n4)|~leq(n0,X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])])).
0.56/0.79	cnf(c_0_22, negated_conjecture, (leq(esk25_0,X1)|~leq(n4,X1)), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.56/0.79	cnf(c_0_23, negated_conjecture, (leq(n0,esk25_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.56/0.79	cnf(c_0_24, plain, (leq(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_20])).
0.56/0.79	cnf(c_0_25, negated_conjecture, (a_select3(q_init,esk24_0,esk25_0)!=init), inference(split_conjunct,[status(thm)],[c_0_8])).
0.56/0.79	cnf(c_0_26, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23]), c_0_24])]), c_0_25]), ['proof']).
0.56/0.79	# SZS output end CNFRefutation
0.56/0.79	# Proof object total steps             : 27
0.56/0.79	# Proof object clause steps            : 16
0.56/0.79	# Proof object formula steps           : 11
0.56/0.79	# Proof object conjectures             : 14
0.56/0.79	# Proof object clause conjectures      : 11
0.56/0.79	# Proof object formula conjectures     : 3
0.56/0.79	# Proof object initial clauses used    : 10
0.56/0.79	# Proof object initial formulas used   : 5
0.56/0.79	# Proof object generating inferences   : 4
0.56/0.79	# Proof object simplifying inferences  : 8
0.56/0.79	# Training examples: 0 positive, 0 negative
0.56/0.79	# Parsed axioms                        : 92
0.56/0.79	# Removed by relevancy pruning/SinE    : 0
0.56/0.79	# Initial clauses                      : 209
0.56/0.79	# Removed in clause preprocessing      : 2
0.56/0.79	# Initial clauses in saturation        : 207
0.56/0.79	# Processed clauses                    : 3460
0.56/0.79	# ...of these trivial                  : 33
0.56/0.79	# ...subsumed                          : 2054
0.56/0.79	# ...remaining for further processing  : 1373
0.56/0.79	# Other redundant clauses eliminated   : 3
0.56/0.79	# Clauses deleted for lack of memory   : 0
0.56/0.79	# Backward-subsumed                    : 29
0.56/0.79	# Backward-rewritten                   : 51
0.56/0.79	# Generated clauses                    : 13940
0.56/0.79	# ...of the previous two non-trivial   : 12526
0.56/0.79	# Contextual simplify-reflections      : 1
0.56/0.79	# Paramodulations                      : 13932
0.56/0.79	# Factorizations                       : 6
0.56/0.79	# NegExts                              : 0
0.56/0.79	# Equation resolutions                 : 3
0.56/0.79	# Propositional unsat checks           : 0
0.56/0.79	#    Propositional check models        : 0
0.56/0.79	#    Propositional check unsatisfiable : 0
0.56/0.79	#    Propositional clauses             : 0
0.56/0.79	#    Propositional clauses after purity: 0
0.56/0.79	#    Propositional unsat core size     : 0
0.56/0.79	#    Propositional preprocessing time  : 0.000
0.56/0.79	#    Propositional encoding time       : 0.000
0.56/0.79	#    Propositional solver time         : 0.000
0.56/0.79	#    Success case prop preproc time    : 0.000
0.56/0.79	#    Success case prop encoding time   : 0.000
0.56/0.79	#    Success case prop solver time     : 0.000
0.56/0.79	# Current number of processed clauses  : 1084
0.56/0.79	#    Positive orientable unit clauses  : 158
0.56/0.79	#    Positive unorientable unit clauses: 5
0.56/0.79	#    Negative unit clauses             : 201
0.56/0.79	#    Non-unit-clauses                  : 720
0.56/0.79	# Current number of unprocessed clauses: 9446
0.56/0.79	# ...number of literals in the above   : 55238
0.56/0.79	# Current number of archived formulas  : 0
0.56/0.79	# Current number of archived clauses   : 289
0.56/0.79	# Clause-clause subsumption calls (NU) : 92708
0.56/0.79	# Rec. Clause-clause subsumption calls : 19092
0.56/0.79	# Non-unit clause-clause subsumptions  : 514
0.56/0.79	# Unit Clause-clause subsumption calls : 31126
0.56/0.79	# Rewrite failures with RHS unbound    : 0
0.56/0.79	# BW rewrite match attempts            : 110
0.56/0.79	# BW rewrite match successes           : 59
0.56/0.79	# Condensation attempts                : 0
0.56/0.79	# Condensation successes               : 0
0.56/0.79	# Termbank termtop insertions          : 311922
0.56/0.79	
0.56/0.79	# -------------------------------------------------
0.56/0.79	# User time                : 0.300 s
0.56/0.79	# System time              : 0.015 s
0.56/0.79	# Total time               : 0.315 s
0.56/0.79	# Maximum resident set size: 1716 pages
0.56/0.79	EOF