0.00/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s
0.02/0.25	% Computer   : n152.star.cs.uiowa.edu
0.02/0.25	% Model      : x86_64 x86_64
0.02/0.25	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.25	% Memory     : 32218.625MB
0.02/0.25	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.25	% CPULimit   : 300
0.02/0.25	% DateTime   : Sat Jul 14 04:36:10 CDT 2018
0.02/0.25	% CPUTime    : 
0.02/0.25	# Version: 2.2pre001
0.02/0.25	# No SInE strategy applied
0.02/0.25	# Trying AutoSched0 for 151 seconds
44.52/44.77	# AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_SE_Q4_CS_SP_S4S
44.52/44.77	# and selection function SelectNewComplexAHPNS.
44.52/44.77	#
44.52/44.77	# Preprocessing time       : 0.012 s
44.52/44.77	
44.52/44.77	# Proof found!
44.52/44.77	# SZS status Theorem
44.52/44.77	# SZS output start CNFRefutation
44.52/44.77	fof(rdn_positive_less_transitivity, axiom, ![X1, X2, X7]:(rdn_positive_less(rdnn(X1),rdnn(X7))<=(rdn_positive_less(rdnn(X1),rdnn(X2))&rdn_positive_less(rdnn(X2),rdnn(X7)))), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax', rdn_positive_less_transitivity)).
44.52/44.77	fof(less_entry_point_neg_neg, axiom, ![X1, X2, X3, X4]:(((rdn_translate(X1,rdn_neg(X3))&rdn_positive_less(X4,X3))&rdn_translate(X2,rdn_neg(X4)))=>less(X1,X2)), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax', less_entry_point_neg_neg)).
44.52/44.77	fof(rdn_positive_less34, axiom, rdn_positive_less(rdnn(n3),rdnn(n4)), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax', rdn_positive_less34)).
44.52/44.77	fof(nn2_not_less_nn4, conjecture, ~(less(nn2,nn4)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', nn2_not_less_nn4)).
44.52/44.77	fof(rdnn2, axiom, rdn_translate(nn2,rdn_neg(rdnn(n2))), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax', rdnn2)).
44.52/44.77	fof(rdn_positive_less23, axiom, rdn_positive_less(rdnn(n2),rdnn(n3)), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax', rdn_positive_less23)).
44.52/44.77	fof(less_property, axiom, ![X1, X2]:(less(X1,X2)<=>(X1!=X2&~(less(X2,X1)))), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax', less_property)).
44.52/44.77	fof(rdnn4, axiom, rdn_translate(nn4,rdn_neg(rdnn(n4))), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax', rdnn4)).
44.52/44.77	fof(c_0_8, plain, ![X39, X40, X41]:(~rdn_positive_less(rdnn(X39),rdnn(X40))|~rdn_positive_less(rdnn(X40),rdnn(X41))|rdn_positive_less(rdnn(X39),rdnn(X41))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[rdn_positive_less_transitivity])])])).
44.52/44.77	fof(c_0_9, plain, ![X42, X43, X44, X45]:(~rdn_translate(X42,rdn_neg(X44))|~rdn_positive_less(X45,X44)|~rdn_translate(X43,rdn_neg(X45))|less(X42,X43)), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_neg_neg])])])])).
44.52/44.77	cnf(c_0_10, plain, (rdn_positive_less(rdnn(X1),rdnn(X3))|~rdn_positive_less(rdnn(X1),rdnn(X2))|~rdn_positive_less(rdnn(X2),rdnn(X3))), inference(split_conjunct,[status(thm)],[c_0_8])).
44.52/44.77	cnf(c_0_11, plain, (rdn_positive_less(rdnn(n3),rdnn(n4))), inference(split_conjunct,[status(thm)],[rdn_positive_less34])).
44.52/44.77	fof(c_0_12, negated_conjecture, ~(~(less(nn2,nn4))), inference(assume_negation,[status(cth)],[nn2_not_less_nn4])).
44.52/44.77	cnf(c_0_13, plain, (less(X1,X4)|~rdn_translate(X1,rdn_neg(X2))|~rdn_positive_less(X3,X2)|~rdn_translate(X4,rdn_neg(X3))), inference(split_conjunct,[status(thm)],[c_0_9])).
44.52/44.77	cnf(c_0_14, plain, (rdn_translate(nn2,rdn_neg(rdnn(n2)))), inference(split_conjunct,[status(thm)],[rdnn2])).
44.52/44.77	cnf(c_0_15, plain, (rdn_positive_less(rdnn(X1),rdnn(n4))|~rdn_positive_less(rdnn(X1),rdnn(n3))), inference(spm,[status(thm)],[c_0_10, c_0_11])).
44.52/44.77	cnf(c_0_16, plain, (rdn_positive_less(rdnn(n2),rdnn(n3))), inference(split_conjunct,[status(thm)],[rdn_positive_less23])).
44.52/44.77	fof(c_0_17, plain, ![X53, X54, X53, X54]:(((X53!=X54|~less(X53,X54))&(~less(X54,X53)|~less(X53,X54)))&(X53=X54|less(X54,X53)|less(X53,X54))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[less_property])])])])])])).
44.52/44.77	fof(c_0_18, negated_conjecture, less(nn2,nn4), inference(fof_simplification,[status(thm)],[c_0_12])).
44.52/44.77	cnf(c_0_19, plain, (less(X1,nn2)|~rdn_positive_less(rdnn(n2),X2)|~rdn_translate(X1,rdn_neg(X2))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
44.52/44.77	cnf(c_0_20, plain, (rdn_positive_less(rdnn(n2),rdnn(n4))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
44.52/44.77	cnf(c_0_21, plain, (~less(X1,X2)|~less(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_17])).
44.52/44.77	cnf(c_0_22, negated_conjecture, (less(nn2,nn4)), inference(split_conjunct,[status(thm)],[c_0_18])).
44.52/44.78	cnf(c_0_23, plain, (less(X1,nn2)|~rdn_translate(X1,rdn_neg(rdnn(n4)))), inference(spm,[status(thm)],[c_0_19, c_0_20])).
44.52/44.78	cnf(c_0_24, plain, (rdn_translate(nn4,rdn_neg(rdnn(n4)))), inference(split_conjunct,[status(thm)],[rdnn4])).
44.52/44.78	cnf(c_0_25, negated_conjecture, (~less(nn4,nn2)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
44.52/44.78	cnf(c_0_26, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25]), ['proof']).
44.52/44.78	# SZS output end CNFRefutation
44.52/44.78	# Proof object total steps             : 27
44.52/44.78	# Proof object clause steps            : 14
44.52/44.78	# Proof object formula steps           : 13
44.52/44.78	# Proof object conjectures             : 5
44.52/44.78	# Proof object clause conjectures      : 2
44.52/44.78	# Proof object formula conjectures     : 3
44.52/44.78	# Proof object initial clauses used    : 8
44.52/44.78	# Proof object initial formulas used   : 8
44.52/44.78	# Proof object generating inferences   : 6
44.52/44.78	# Proof object simplifying inferences  : 1
44.52/44.78	# Training examples: 0 positive, 0 negative
44.52/44.78	# Parsed axioms                        : 402
44.52/44.78	# Removed by relevancy pruning/SinE    : 0
44.52/44.78	# Initial clauses                      : 407
44.52/44.78	# Removed in clause preprocessing      : 0
44.52/44.78	# Initial clauses in saturation        : 407
44.52/44.78	# Processed clauses                    : 56570
44.52/44.78	# ...of these trivial                  : 0
44.52/44.78	# ...subsumed                          : 2
44.52/44.78	# ...remaining for further processing  : 56568
44.52/44.78	# Other redundant clauses eliminated   : 2
44.52/44.78	# Clauses deleted for lack of memory   : 0
44.52/44.78	# Backward-subsumed                    : 0
44.52/44.78	# Backward-rewritten                   : 603
44.52/44.78	# Generated clauses                    : 198156
44.52/44.78	# ...of the previous two non-trivial   : 164688
44.52/44.78	# Contextual simplify-reflections      : 0
44.52/44.78	# Paramodulations                      : 198152
44.52/44.78	# Factorizations                       : 2
44.52/44.78	# Equation resolutions                 : 2
44.52/44.78	# Propositional unsat checks           : 0
44.52/44.78	#    Propositional check models        : 0
44.52/44.78	#    Propositional check unsatisfiable : 0
44.52/44.78	#    Propositional clauses             : 0
44.52/44.78	#    Propositional clauses after purity: 0
44.52/44.78	#    Propositional unsat core size     : 0
44.52/44.78	# Current number of processed clauses  : 55963
44.52/44.78	#    Positive orientable unit clauses  : 35044
44.52/44.78	#    Positive unorientable unit clauses: 0
44.52/44.78	#    Negative unit clauses             : 17235
44.52/44.78	#    Non-unit-clauses                  : 3684
44.52/44.78	# Current number of unprocessed clauses: 108525
44.52/44.78	# ...number of literals in the above   : 311573
44.52/44.78	# Current number of archived formulas  : 0
44.52/44.78	# Current number of archived clauses   : 603
44.52/44.78	# Clause-clause subsumption calls (NU) : 1277251
44.52/44.78	# Rec. Clause-clause subsumption calls : 820378
44.52/44.78	# Non-unit clause-clause subsumptions  : 2
44.52/44.78	# Unit Clause-clause subsumption calls : 88259190
44.52/44.78	# Rewrite failures with RHS unbound    : 0
44.52/44.78	# BW rewrite match attempts            : 643
44.52/44.78	# BW rewrite match successes           : 603
44.52/44.78	# Condensation attempts                : 0
44.52/44.78	# Condensation successes               : 0
44.52/44.78	# Termbank termtop insertions          : 3184928
44.52/44.80	
44.52/44.80	# -------------------------------------------------
44.52/44.80	# User time                : 44.230 s
44.52/44.80	# System time              : 0.317 s
44.52/44.80	# Total time               : 44.547 s
44.52/44.80	# Maximum resident set size: 1928 pages
44.52/44.80	EOF