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.03/0.23	% Computer   : n123.star.cs.uiowa.edu
0.03/0.23	% Model      : x86_64 x86_64
0.03/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.23	% Memory     : 32218.625MB
0.03/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.23	% CPULimit   : 300
0.03/0.23	% DateTime   : Sat Jul 14 04:23:24 CDT 2018
0.03/0.23	% CPUTime    : 
0.03/0.23	# Version: 2.2pre001
0.03/0.23	# No SInE strategy applied
0.03/0.23	# Trying AutoSched0 for 151 seconds
0.91/1.16	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0U
0.91/1.16	# and selection function SelectComplexExceptRRHorn.
0.91/1.16	#
0.91/1.16	# Preprocessing time       : 0.010 s
0.91/1.16	# Presaturation interreduction done
0.91/1.16	
0.91/1.16	# Proof found!
0.91/1.16	# SZS status Theorem
0.91/1.16	# SZS output start CNFRefutation
0.91/1.16	fof('ass(cond(goal(88), 0), 1)', axiom, ![X43, X44]:(~(?[X46]:X44=vplus(X43,X46))|X43!=X44), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'ass(cond(goal(88), 0), 1)')).
0.91/1.16	fof('ass(cond(281, 0), 0)', axiom, ![X91, X92, X93]:vmul(X91,vplus(X92,X93))=vplus(vmul(X91,X92),vmul(X91,X93)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'ass(cond(281, 0), 0)')).
0.91/1.16	fof('ass(cond(goal(130), 0), 2)', axiom, ![X49, X50]:(~(greater(X49,X50))|~(less(X49,X50))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'ass(cond(goal(130), 0), 2)')).
0.91/1.16	fof('ass(cond(189, 0), 0)', axiom, ![X30, X31]:greater(vplus(X30,X31),X30), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'ass(cond(189, 0), 0)')).
0.91/1.16	fof('def(cond(conseq(axiom(3)), 11), 1)', axiom, ![X94, X95]:(greater(X95,X94)<=>?[X96]:vplus(X94,X96)=X95), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'def(cond(conseq(axiom(3)), 11), 1)')).
0.91/1.16	fof('ass(cond(140, 0), 0)', axiom, ![X12, X13]:(less(X13,X12)<=greater(X12,X13)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'ass(cond(140, 0), 0)')).
0.91/1.16	fof('ass(cond(goal(88), 0), 0)', axiom, ![X43, X44]:(?[X45]:X43=vplus(X44,X45)|?[X46]:X44=vplus(X43,X46)|X43=X44), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'ass(cond(goal(88), 0), 0)')).
0.91/1.16	fof('holds(conjunct1(314), 510, 0)', axiom, greater(vd508,vd509), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'holds(conjunct1(314), 510, 0)')).
0.91/1.16	fof('ass(cond(253, 0), 0)', axiom, ![X51]:X51=vmul(v1,X51), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'ass(cond(253, 0), 0)')).
0.91/1.16	fof('holds(conjunct1(315), 514, 0)', conjecture, greater(vmul(vd508,vd511),vmul(vd509,vd511)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'holds(conjunct1(315), 514, 0)')).
0.91/1.16	fof('ass(cond(270, 0), 0)', axiom, ![X40, X41]:vmul(X41,X40)=vmul(X40,X41), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'ass(cond(270, 0), 0)')).
0.91/1.16	fof(c_0_11, plain, ![X195, X196, X197]:(X196!=vplus(X195,X197)|X195!=X196), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(88), 0), 1)'])])])])])).
0.91/1.16	cnf(c_0_12, plain, (X1!=vplus(X2,X3)|X2!=X1), inference(split_conjunct,[status(thm)],[c_0_11])).
0.91/1.16	fof(c_0_13, plain, ![X229, X230, X231]:vmul(X229,vplus(X230,X231))=vplus(vmul(X229,X230),vmul(X229,X231)), inference(variable_rename,[status(thm)],['ass(cond(281, 0), 0)'])).
0.91/1.16	fof(c_0_14, plain, ![X214, X215]:(~greater(X214,X215)|~less(X214,X215)), inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 2)'])])).
0.91/1.16	fof(c_0_15, plain, ![X139, X140]:greater(vplus(X139,X140),X139), inference(variable_rename,[status(thm)],['ass(cond(189, 0), 0)'])).
0.91/1.16	cnf(c_0_16, plain, (vplus(X1,X2)!=X1), inference(er,[status(thm)],[c_0_12])).
0.91/1.16	cnf(c_0_17, plain, (vmul(X1,vplus(X2,X3))=vplus(vmul(X1,X2),vmul(X1,X3))), inference(split_conjunct,[status(thm)],[c_0_13])).
0.91/1.16	fof(c_0_18, plain, ![X232, X233, X232, X233, X235]:((~greater(X233,X232)|vplus(X232,esk4_2(X232,X233))=X233)&(vplus(X232,X235)!=X233|greater(X233,X232))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 11), 1)'])])])])])])).
0.91/1.16	cnf(c_0_19, plain, (~greater(X1,X2)|~less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.91/1.16	cnf(c_0_20, plain, (greater(vplus(X1,X2),X1)), inference(split_conjunct,[status(thm)],[c_0_15])).
0.91/1.16	fof(c_0_21, plain, ![X121, X122]:(~greater(X121,X122)|less(X122,X121)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],['ass(cond(140, 0), 0)'])])])).
0.91/1.16	cnf(c_0_22, plain, (vmul(X1,vplus(X2,X3))!=vmul(X1,X2)), inference(spm,[status(thm)],[c_0_16, c_0_17])).
0.91/1.16	cnf(c_0_23, plain, (vplus(X2,esk4_2(X2,X1))=X1|~greater(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_18])).
0.91/1.16	cnf(c_0_24, plain, (~less(vplus(X1,X2),X1)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
0.91/1.16	cnf(c_0_25, plain, (less(X2,X1)|~greater(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_21])).
0.91/1.16	fof(c_0_26, plain, ![X216, X217]:(X216=vplus(X217,esk2_2(X216,X217))|X217=vplus(X216,esk3_2(X216,X217))|X216=X217), inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],['ass(cond(goal(88), 0), 0)'])])])])).
0.91/1.16	cnf(c_0_27, plain, (vmul(X1,X2)!=vmul(X1,X3)|~greater(X2,X3)), inference(spm,[status(thm)],[c_0_22, c_0_23])).
0.91/1.16	cnf(c_0_28, plain, (greater(vd508,vd509)), inference(split_conjunct,[status(thm)],['holds(conjunct1(314), 510, 0)'])).
0.91/1.16	fof(c_0_29, plain, ![X160]:X160=vmul(v1,X160), inference(variable_rename,[status(thm)],['ass(cond(253, 0), 0)'])).
0.91/1.16	fof(c_0_30, negated_conjecture, ~(greater(vmul(vd508,vd511),vmul(vd509,vd511))), inference(assume_negation,[status(cth)],['holds(conjunct1(315), 514, 0)'])).
0.91/1.16	cnf(c_0_31, plain, (~greater(X1,vplus(X1,X2))), inference(spm,[status(thm)],[c_0_24, c_0_25])).
0.91/1.16	cnf(c_0_32, plain, (X1=vplus(X2,esk2_2(X1,X2))|X2=vplus(X1,esk3_2(X1,X2))|X1=X2), inference(split_conjunct,[status(thm)],[c_0_26])).
0.91/1.16	cnf(c_0_33, plain, (vmul(X1,vd509)!=vmul(X1,vd508)), inference(spm,[status(thm)],[c_0_27, c_0_28])).
0.91/1.16	cnf(c_0_34, plain, (X1=vmul(v1,X1)), inference(split_conjunct,[status(thm)],[c_0_29])).
0.91/1.16	fof(c_0_35, negated_conjecture, ~greater(vmul(vd508,vd511),vmul(vd509,vd511)), inference(fof_simplification,[status(thm)],[c_0_30])).
0.91/1.16	fof(c_0_36, plain, ![X149, X150]:vmul(X150,X149)=vmul(X149,X150), inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)'])).
0.91/1.16	cnf(c_0_37, plain, (vplus(X1,esk3_2(X1,X2))=X2|X1=X2|~greater(X2,X1)), inference(spm,[status(thm)],[c_0_31, c_0_32])).
0.91/1.16	cnf(c_0_38, plain, (vd509!=vd508), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_34])).
0.91/1.16	cnf(c_0_39, negated_conjecture, (~greater(vmul(vd508,vd511),vmul(vd509,vd511))), inference(split_conjunct,[status(thm)],[c_0_35])).
0.91/1.16	cnf(c_0_40, plain, (vmul(X1,X2)=vmul(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_36])).
0.91/1.16	cnf(c_0_41, plain, (greater(vmul(X1,vplus(X2,X3)),vmul(X1,X2))), inference(spm,[status(thm)],[c_0_20, c_0_17])).
0.91/1.16	cnf(c_0_42, plain, (vplus(vd509,esk3_2(vd509,vd508))=vd508), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_28]), c_0_38])).
0.91/1.16	cnf(c_0_43, negated_conjecture, (~greater(vmul(vd511,vd508),vmul(vd511,vd509))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39, c_0_40]), c_0_40])).
0.91/1.16	cnf(c_0_44, plain, (greater(vmul(X1,vd508),vmul(X1,vd509))), inference(spm,[status(thm)],[c_0_41, c_0_42])).
0.91/1.16	cnf(c_0_45, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43, c_0_44])]), ['proof']).
0.91/1.16	# SZS output end CNFRefutation
0.91/1.16	# Proof object total steps             : 46
0.91/1.16	# Proof object clause steps            : 24
0.91/1.16	# Proof object formula steps           : 22
0.91/1.16	# Proof object conjectures             : 6
0.91/1.16	# Proof object clause conjectures      : 3
0.91/1.16	# Proof object formula conjectures     : 3
0.91/1.16	# Proof object initial clauses used    : 11
0.91/1.16	# Proof object initial formulas used   : 11
0.91/1.16	# Proof object generating inferences   : 10
0.91/1.16	# Proof object simplifying inferences  : 7
0.91/1.16	# Training examples: 0 positive, 0 negative
0.91/1.16	# Parsed axioms                        : 59
0.91/1.16	# Removed by relevancy pruning/SinE    : 0
0.91/1.16	# Initial clauses                      : 69
0.91/1.16	# Removed in clause preprocessing      : 3
0.91/1.16	# Initial clauses in saturation        : 66
0.91/1.16	# Processed clauses                    : 10930
0.91/1.16	# ...of these trivial                  : 144
0.91/1.16	# ...subsumed                          : 8679
0.91/1.16	# ...remaining for further processing  : 2107
0.91/1.16	# Other redundant clauses eliminated   : 779
0.91/1.16	# Clauses deleted for lack of memory   : 0
0.91/1.16	# Backward-subsumed                    : 99
0.91/1.16	# Backward-rewritten                   : 70
0.91/1.16	# Generated clauses                    : 104832
0.91/1.16	# ...of the previous two non-trivial   : 100188
0.91/1.16	# Contextual simplify-reflections      : 171
0.91/1.16	# Paramodulations                      : 104024
0.91/1.16	# Factorizations                       : 2
0.91/1.16	# Equation resolutions                 : 797
0.91/1.16	# Propositional unsat checks           : 0
0.91/1.16	#    Propositional check models        : 0
0.91/1.16	#    Propositional check unsatisfiable : 0
0.91/1.16	#    Propositional clauses             : 0
0.91/1.16	#    Propositional clauses after purity: 0
0.91/1.16	#    Propositional unsat core size     : 0
0.91/1.16	# Current number of processed clauses  : 1863
0.91/1.16	#    Positive orientable unit clauses  : 174
0.91/1.16	#    Positive unorientable unit clauses: 29
0.91/1.16	#    Negative unit clauses             : 730
0.91/1.16	#    Non-unit-clauses                  : 930
0.91/1.16	# Current number of unprocessed clauses: 86819
0.91/1.16	# ...number of literals in the above   : 191642
0.91/1.16	# Current number of archived formulas  : 0
0.91/1.16	# Current number of archived clauses   : 236
0.91/1.16	# Clause-clause subsumption calls (NU) : 114068
0.91/1.16	# Rec. Clause-clause subsumption calls : 85097
0.91/1.16	# Non-unit clause-clause subsumptions  : 2219
0.91/1.16	# Unit Clause-clause subsumption calls : 72489
0.91/1.16	# Rewrite failures with RHS unbound    : 0
0.91/1.16	# BW rewrite match attempts            : 799
0.91/1.16	# BW rewrite match successes           : 440
0.91/1.16	# Condensation attempts                : 0
0.91/1.16	# Condensation successes               : 0
0.91/1.16	# Termbank termtop insertions          : 1033095
0.91/1.17	
0.91/1.17	# -------------------------------------------------
0.91/1.17	# User time                : 0.905 s
0.91/1.17	# System time              : 0.035 s
0.91/1.17	# Total time               : 0.940 s
0.91/1.17	# Maximum resident set size: 1600 pages
0.91/1.17	EOF