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.14/0.35	% Computer   : n007.cluster.edu
0.14/0.35	% Model      : x86_64 x86_64
0.14/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory     : 8042.1875MB
0.14/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 1200
0.14/0.35	% WCLimit    : 120
0.14/0.35	% DateTime   : Tue Jul 13 16:41:49 EDT 2021
0.14/0.35	% CPUTime    : 
0.21/0.49	Running first-order theorem proving
0.21/0.49	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.21/0.49	# Version: 2.6
0.21/0.49	# No SInE strategy applied
0.21/0.49	# Trying AutoSched0 for 59 seconds
0.63/0.84	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
0.63/0.84	# and selection function SelectCQIPrecW.
0.63/0.84	#
0.63/0.84	# Preprocessing time       : 0.032 s
0.63/0.84	# Presaturation interreduction done
0.63/0.84	
0.63/0.84	# Proof found!
0.63/0.84	# SZS status Theorem
0.63/0.84	# SZS output start CNFRefutation
0.63/0.84	fof('ass(cond(318, 0), 0)', axiom, ![X82, X83, X84, X85]:(greater(vmul(X82,X84),vmul(X83,X85))<=((greater(X84,X85)&geq(X82,X83))|(greater(X82,X83)&geq(X84,X85)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'ass(cond(318, 0), 0)')).
0.63/0.84	fof('def(cond(conseq(axiom(3)), 16), 1)', axiom, ![X105, X106]:(geq(X106,X105)<=>(X105=X106|greater(X106,X105))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'def(cond(conseq(axiom(3)), 16), 1)')).
0.63/0.84	fof('holds(conjunct2(antec(323)), 531, 0)', axiom, geq(vd529,vd530), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'holds(conjunct2(antec(323)), 531, 0)')).
0.63/0.84	fof('holds(conjunct1(antec(323)), 528, 0)', axiom, geq(vd526,vd527), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'holds(conjunct1(antec(323)), 528, 0)')).
0.63/0.84	fof('ass(cond(270, 0), 0)', axiom, ![X50, X51]:vmul(X50,X51)=vmul(X51,X50), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'ass(cond(270, 0), 0)')).
0.63/0.84	fof('ass(cond(189, 0), 0)', axiom, ![X5, X6]:greater(vplus(X5,X6),X5), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'ass(cond(189, 0), 0)')).
0.63/0.84	fof('ass(cond(140, 0), 0)', axiom, ![X68, X69]:(greater(X68,X69)=>less(X69,X68)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'ass(cond(140, 0), 0)')).
0.63/0.84	fof('holds(conseq(323), 532, 0)', conjecture, geq(vmul(vd526,vd529),vmul(vd527,vd530)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'holds(conseq(323), 532, 0)')).
0.63/0.84	fof('ass(cond(281, 0), 0)', axiom, ![X112, X113, X114]:vmul(X112,vplus(X113,X114))=vplus(vmul(X112,X113),vmul(X112,X114)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'ass(cond(281, 0), 0)')).
0.63/0.84	fof('def(cond(conseq(axiom(3)), 12), 1)', axiom, ![X100, X101]:(?[X102]:vplus(X101,X102)=X100<=>less(X101,X100)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'def(cond(conseq(axiom(3)), 12), 1)')).
0.63/0.84	fof(c_0_10, plain, ![X82, X83, X84, X85]:(((greater(X84,X85)&geq(X82,X83))|(greater(X82,X83)&geq(X84,X85)))=>greater(vmul(X82,X84),vmul(X83,X85))), inference(fof_simplification,[status(thm)],['ass(cond(318, 0), 0)'])).
0.63/0.84	fof(c_0_11, plain, ![X374, X375, X376, X377]:((~greater(X376,X377)|~geq(X374,X375)|greater(vmul(X374,X376),vmul(X375,X377)))&(~greater(X374,X375)|~geq(X376,X377)|greater(vmul(X374,X376),vmul(X375,X377)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])).
0.63/0.84	fof(c_0_12, plain, ![X405, X406]:((~geq(X406,X405)|(X405=X406|greater(X406,X405)))&((X405!=X406|geq(X406,X405))&(~greater(X406,X405)|geq(X406,X405)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 16), 1)'])])])).
0.63/0.84	cnf(c_0_13, plain, (greater(vmul(X3,X1),vmul(X4,X2))|~greater(X1,X2)|~geq(X3,X4)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.63/0.84	cnf(c_0_14, plain, (geq(vd529,vd530)), inference(split_conjunct,[status(thm)],['holds(conjunct2(antec(323)), 531, 0)'])).
0.63/0.84	cnf(c_0_15, plain, (X2=X1|greater(X1,X2)|~geq(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_12])).
0.63/0.84	cnf(c_0_16, plain, (geq(vd526,vd527)), inference(split_conjunct,[status(thm)],['holds(conjunct1(antec(323)), 528, 0)'])).
0.63/0.84	fof(c_0_17, plain, ![X323, X324]:vmul(X323,X324)=vmul(X324,X323), inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)'])).
0.63/0.84	fof(c_0_18, plain, ![X269, X270]:greater(vplus(X269,X270),X269), inference(variable_rename,[status(thm)],['ass(cond(189, 0), 0)'])).
0.63/0.84	fof(c_0_19, plain, ![X352, X353]:(~greater(X352,X353)|less(X353,X352)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(140, 0), 0)'])])).
0.63/0.84	cnf(c_0_20, plain, (greater(vmul(vd529,X1),vmul(vd530,X2))|~greater(X1,X2)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
0.63/0.84	cnf(c_0_21, plain, (vd527=vd526|greater(vd526,vd527)), inference(spm,[status(thm)],[c_0_15, c_0_16])).
0.63/0.84	cnf(c_0_22, plain, (vmul(X1,X2)=vmul(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.63/0.84	fof(c_0_23, negated_conjecture, ~geq(vmul(vd526,vd529),vmul(vd527,vd530)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(conseq(323), 532, 0)'])])).
0.63/0.84	cnf(c_0_24, plain, (geq(X1,X2)|~greater(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_12])).
0.63/0.84	cnf(c_0_25, plain, (greater(vplus(X1,X2),X1)), inference(split_conjunct,[status(thm)],[c_0_18])).
0.63/0.84	fof(c_0_26, plain, ![X412, X413, X414]:vmul(X412,vplus(X413,X414))=vplus(vmul(X412,X413),vmul(X412,X414)), inference(variable_rename,[status(thm)],['ass(cond(281, 0), 0)'])).
0.63/0.84	fof(c_0_27, plain, ![X395, X396, X397, X398, X399]:((vplus(X396,X397)!=X395|less(X396,X395))&(~less(X399,X398)|vplus(X399,esk4_2(X398,X399))=X398)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 12), 1)'])])])])])).
0.63/0.84	cnf(c_0_28, plain, (less(X2,X1)|~greater(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_19])).
0.63/0.84	cnf(c_0_29, plain, (vd530=vd529|greater(vd529,vd530)), inference(spm,[status(thm)],[c_0_15, c_0_14])).
0.63/0.84	cnf(c_0_30, plain, (vd527=vd526|greater(vmul(vd526,vd529),vmul(vd527,vd530))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22]), c_0_22])).
0.63/0.84	cnf(c_0_31, negated_conjecture, (~geq(vmul(vd526,vd529),vmul(vd527,vd530))), inference(split_conjunct,[status(thm)],[c_0_23])).
0.63/0.84	cnf(c_0_32, plain, (geq(vplus(X1,X2),X1)), inference(spm,[status(thm)],[c_0_24, c_0_25])).
0.63/0.84	cnf(c_0_33, plain, (vmul(X1,vplus(X2,X3))=vplus(vmul(X1,X2),vmul(X1,X3))), inference(split_conjunct,[status(thm)],[c_0_26])).
0.63/0.84	cnf(c_0_34, plain, (vplus(X1,esk4_2(X2,X1))=X2|~less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_27])).
0.63/0.84	cnf(c_0_35, plain, (vd530=vd529|less(vd530,vd529)), inference(spm,[status(thm)],[c_0_28, c_0_29])).
0.63/0.84	cnf(c_0_36, plain, (vd527=vd526), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_30]), c_0_31])).
0.63/0.84	cnf(c_0_37, plain, (geq(vmul(X1,vplus(X2,X3)),vmul(X1,X2))), inference(spm,[status(thm)],[c_0_32, c_0_33])).
0.63/0.84	cnf(c_0_38, plain, (vplus(vd530,esk4_2(vd529,vd530))=vd529|vd530=vd529), inference(spm,[status(thm)],[c_0_34, c_0_35])).
0.63/0.84	cnf(c_0_39, negated_conjecture, (~geq(vmul(vd526,vd529),vmul(vd526,vd530))), inference(rw,[status(thm)],[c_0_31, c_0_36])).
0.63/0.84	cnf(c_0_40, plain, (vd530=vd529|geq(vmul(X1,vd529),vmul(X1,vd530))), inference(spm,[status(thm)],[c_0_37, c_0_38])).
0.63/0.84	cnf(c_0_41, plain, (geq(X2,X1)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_12])).
0.63/0.84	cnf(c_0_42, negated_conjecture, (vd530=vd529), inference(spm,[status(thm)],[c_0_39, c_0_40])).
0.63/0.84	cnf(c_0_43, plain, (geq(X1,X1)), inference(er,[status(thm)],[c_0_41])).
0.63/0.84	cnf(c_0_44, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39, c_0_42]), c_0_43])]), ['proof']).
0.63/0.84	# SZS output end CNFRefutation
0.63/0.84	# Proof object total steps             : 45
0.63/0.84	# Proof object clause steps            : 26
0.63/0.84	# Proof object formula steps           : 19
0.63/0.84	# Proof object conjectures             : 6
0.63/0.84	# Proof object clause conjectures      : 4
0.63/0.84	# Proof object formula conjectures     : 2
0.63/0.84	# Proof object initial clauses used    : 12
0.63/0.84	# Proof object initial formulas used   : 10
0.63/0.84	# Proof object generating inferences   : 11
0.63/0.84	# Proof object simplifying inferences  : 8
0.63/0.84	# Training examples: 0 positive, 0 negative
0.63/0.84	# Parsed axioms                        : 61
0.63/0.84	# Removed by relevancy pruning/SinE    : 0
0.63/0.84	# Initial clauses                      : 72
0.63/0.84	# Removed in clause preprocessing      : 3
0.63/0.84	# Initial clauses in saturation        : 69
0.63/0.84	# Processed clauses                    : 4568
0.63/0.84	# ...of these trivial                  : 38
0.63/0.84	# ...subsumed                          : 3494
0.63/0.84	# ...remaining for further processing  : 1036
0.63/0.84	# Other redundant clauses eliminated   : 191
0.63/0.84	# Clauses deleted for lack of memory   : 0
0.63/0.84	# Backward-subsumed                    : 23
0.63/0.84	# Backward-rewritten                   : 525
0.63/0.84	# Generated clauses                    : 31422
0.63/0.84	# ...of the previous two non-trivial   : 30591
0.63/0.84	# Contextual simplify-reflections      : 0
0.63/0.84	# Paramodulations                      : 31223
0.63/0.84	# Factorizations                       : 2
0.63/0.84	# NegExts                              : 0
0.63/0.84	# Equation resolutions                 : 197
0.63/0.84	# Propositional unsat checks           : 0
0.63/0.84	#    Propositional check models        : 0
0.63/0.84	#    Propositional check unsatisfiable : 0
0.63/0.84	#    Propositional clauses             : 0
0.63/0.84	#    Propositional clauses after purity: 0
0.63/0.84	#    Propositional unsat core size     : 0
0.63/0.84	#    Propositional preprocessing time  : 0.000
0.63/0.84	#    Propositional encoding time       : 0.000
0.63/0.84	#    Propositional solver time         : 0.000
0.63/0.84	#    Success case prop preproc time    : 0.000
0.63/0.84	#    Success case prop encoding time   : 0.000
0.63/0.84	#    Success case prop solver time     : 0.000
0.63/0.84	# Current number of processed clauses  : 418
0.63/0.84	#    Positive orientable unit clauses  : 59
0.63/0.84	#    Positive unorientable unit clauses: 23
0.63/0.84	#    Negative unit clauses             : 171
0.63/0.84	#    Non-unit-clauses                  : 165
0.63/0.84	# Current number of unprocessed clauses: 26124
0.63/0.84	# ...number of literals in the above   : 43810
0.63/0.84	# Current number of archived formulas  : 0
0.63/0.84	# Current number of archived clauses   : 610
0.63/0.84	# Clause-clause subsumption calls (NU) : 145475
0.63/0.84	# Rec. Clause-clause subsumption calls : 112974
0.63/0.84	# Non-unit clause-clause subsumptions  : 1958
0.63/0.84	# Unit Clause-clause subsumption calls : 3507
0.63/0.84	# Rewrite failures with RHS unbound    : 0
0.63/0.84	# BW rewrite match attempts            : 561
0.63/0.84	# BW rewrite match successes           : 170
0.63/0.84	# Condensation attempts                : 0
0.63/0.84	# Condensation successes               : 0
0.63/0.84	# Termbank termtop insertions          : 288428
0.63/0.84	
0.63/0.84	# -------------------------------------------------
0.63/0.84	# User time                : 0.337 s
0.63/0.84	# System time              : 0.017 s
0.63/0.84	# Total time               : 0.355 s
0.63/0.84	# Maximum resident set size: 1712 pages
0.63/0.84	EOF