0.02/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.11	% Command    : run_E %s %d THM
0.11/0.32	% Computer   : n013.cluster.edu
0.11/0.32	% Model      : x86_64 x86_64
0.11/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory     : 8042.1875MB
0.11/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 1200
0.11/0.32	% WCLimit    : 120
0.11/0.32	% DateTime   : Tue Jul 13 16:21:18 EDT 2021
0.11/0.32	% CPUTime    : 
0.17/0.47	Running first-order theorem proving
0.17/0.47	Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
0.17/0.47	# Version: 2.6
0.17/0.48	# No SInE strategy applied
0.17/0.48	# Trying AutoSched0 for 59 seconds
0.17/0.54	# AutoSched0-Mode selected heuristic G_E___208_C18_SOS_F1_SE_CS_SP_PS_S4c
0.17/0.54	# and selection function SelectCQPrecWNTNp.
0.17/0.54	#
0.17/0.54	# Preprocessing time       : 0.039 s
0.17/0.54	# Presaturation interreduction done
0.17/0.54	
0.17/0.54	# Proof found!
0.17/0.54	# SZS status Theorem
0.17/0.54	# SZS output start CNFRefutation
0.17/0.54	fof(less_entry_point_neg_pos, axiom, ![X1, X2, X3, X4]:(less(X1,X2)<=(rdn_translate(X2,rdn_pos(X4))&rdn_translate(X1,rdn_neg(X3)))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax', less_entry_point_neg_pos)).
0.17/0.54	fof(something_less_n0, conjecture, ?[X1]:less(X1,n0), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', something_less_n0)).
0.17/0.54	fof(rdnn3, axiom, rdn_translate(nn3,rdn_neg(rdnn(n3))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax', rdnn3)).
0.17/0.54	fof(rdn0, axiom, rdn_translate(n0,rdn_pos(rdnn(n0))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax', rdn0)).
0.17/0.54	fof(c_0_4, plain, ![X1, X2, X3, X4]:((rdn_translate(X2,rdn_pos(X4))&rdn_translate(X1,rdn_neg(X3)))=>less(X1,X2)), inference(fof_simplification,[status(thm)],[less_entry_point_neg_pos])).
0.17/0.54	fof(c_0_5, plain, ![X156, X157, X158, X159]:(~rdn_translate(X157,rdn_pos(X159))|~rdn_translate(X156,rdn_neg(X158))|less(X156,X157)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])).
0.17/0.54	fof(c_0_6, negated_conjecture, ~(?[X1]:less(X1,n0)), inference(assume_negation,[status(cth)],[something_less_n0])).
0.17/0.54	cnf(c_0_7, plain, (less(X3,X1)|~rdn_translate(X1,rdn_pos(X2))|~rdn_translate(X3,rdn_neg(X4))), inference(split_conjunct,[status(thm)],[c_0_5])).
0.17/0.54	cnf(c_0_8, plain, (rdn_translate(nn3,rdn_neg(rdnn(n3)))), inference(split_conjunct,[status(thm)],[rdnn3])).
0.17/0.54	fof(c_0_9, negated_conjecture, ![X276]:~less(X276,n0), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])).
0.17/0.54	cnf(c_0_10, plain, (less(nn3,X1)|~rdn_translate(X1,rdn_pos(X2))), inference(spm,[status(thm)],[c_0_7, c_0_8])).
0.17/0.54	cnf(c_0_11, plain, (rdn_translate(n0,rdn_pos(rdnn(n0)))), inference(split_conjunct,[status(thm)],[rdn0])).
0.17/0.54	cnf(c_0_12, negated_conjecture, (~less(X1,n0)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.17/0.54	cnf(c_0_13, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12]), ['proof']).
0.17/0.54	# SZS output end CNFRefutation
0.17/0.54	# Proof object total steps             : 14
0.17/0.54	# Proof object clause steps            : 6
0.17/0.54	# Proof object formula steps           : 8
0.17/0.54	# Proof object conjectures             : 4
0.17/0.54	# Proof object clause conjectures      : 1
0.17/0.54	# Proof object formula conjectures     : 3
0.17/0.54	# Proof object initial clauses used    : 4
0.17/0.54	# Proof object initial formulas used   : 4
0.17/0.54	# Proof object generating inferences   : 2
0.17/0.54	# Proof object simplifying inferences  : 1
0.17/0.54	# Training examples: 0 positive, 0 negative
0.17/0.54	# Parsed axioms                        : 402
0.17/0.54	# Removed by relevancy pruning/SinE    : 0
0.17/0.54	# Initial clauses                      : 407
0.17/0.54	# Removed in clause preprocessing      : 0
0.17/0.54	# Initial clauses in saturation        : 407
0.17/0.54	# Processed clauses                    : 486
0.17/0.54	# ...of these trivial                  : 0
0.17/0.54	# ...subsumed                          : 3
0.17/0.54	# ...remaining for further processing  : 483
0.17/0.54	# Other redundant clauses eliminated   : 2
0.17/0.54	# Clauses deleted for lack of memory   : 0
0.17/0.54	# Backward-subsumed                    : 0
0.17/0.54	# Backward-rewritten                   : 0
0.17/0.54	# Generated clauses                    : 86
0.17/0.54	# ...of the previous two non-trivial   : 77
0.17/0.54	# Contextual simplify-reflections      : 0
0.17/0.54	# Paramodulations                      : 82
0.17/0.54	# Factorizations                       : 2
0.17/0.54	# NegExts                              : 0
0.17/0.54	# Equation resolutions                 : 2
0.17/0.54	# Propositional unsat checks           : 0
0.17/0.54	#    Propositional check models        : 0
0.17/0.54	#    Propositional check unsatisfiable : 0
0.17/0.54	#    Propositional clauses             : 0
0.17/0.54	#    Propositional clauses after purity: 0
0.17/0.54	#    Propositional unsat core size     : 0
0.17/0.54	#    Propositional preprocessing time  : 0.000
0.17/0.54	#    Propositional encoding time       : 0.000
0.17/0.54	#    Propositional solver time         : 0.000
0.17/0.54	#    Success case prop preproc time    : 0.000
0.17/0.54	#    Success case prop encoding time   : 0.000
0.17/0.54	#    Success case prop solver time     : 0.000
0.17/0.54	# Current number of processed clauses  : 74
0.17/0.54	#    Positive orientable unit clauses  : 51
0.17/0.54	#    Positive unorientable unit clauses: 0
0.17/0.54	#    Negative unit clauses             : 2
0.17/0.54	#    Non-unit-clauses                  : 21
0.17/0.54	# Current number of unprocessed clauses: 398
0.17/0.54	# ...number of literals in the above   : 527
0.17/0.54	# Current number of archived formulas  : 0
0.17/0.54	# Current number of archived clauses   : 407
0.17/0.54	# Clause-clause subsumption calls (NU) : 749
0.17/0.54	# Rec. Clause-clause subsumption calls : 352
0.17/0.54	# Non-unit clause-clause subsumptions  : 2
0.17/0.54	# Unit Clause-clause subsumption calls : 11
0.17/0.54	# Rewrite failures with RHS unbound    : 0
0.17/0.54	# BW rewrite match attempts            : 0
0.17/0.54	# BW rewrite match successes           : 0
0.17/0.54	# Condensation attempts                : 0
0.17/0.54	# Condensation successes               : 0
0.17/0.54	# Termbank termtop insertions          : 28337
0.17/0.54	
0.17/0.54	# -------------------------------------------------
0.17/0.54	# User time                : 0.062 s
0.17/0.54	# System time              : 0.010 s
0.17/0.54	# Total time               : 0.072 s
0.17/0.54	# Maximum resident set size: 1952 pages
0.17/0.54	EOF
