0.02/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.10	% Command    : run_E %s %d THM
0.08/0.29	% Computer   : n025.cluster.edu
0.08/0.29	% Model      : x86_64 x86_64
0.08/0.29	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.08/0.29	% Memory     : 8042.1875MB
0.08/0.29	% OS         : Linux 3.10.0-693.el7.x86_64
0.08/0.29	% CPULimit   : 1200
0.08/0.29	% WCLimit    : 120
0.08/0.29	% DateTime   : Tue Jul 13 11:07:27 EDT 2021
0.08/0.30	% CPUTime    : 
0.14/0.39	Running first-order theorem proving
0.14/0.39	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.14/0.39	# Version: 2.6
0.14/0.39	# No SInE strategy applied
0.14/0.39	# Trying AutoSched0 for 59 seconds
0.14/0.43	# AutoSched0-Mode selected heuristic G_E___107_C00_02_nc_F1_PI_AE_Q4_CS_SP_PS_S00EN
0.14/0.43	# and selection function PSelectSmallestOrientable.
0.14/0.43	#
0.14/0.43	# Preprocessing time       : 0.026 s
0.14/0.43	# Presaturation interreduction done
0.14/0.43	
0.14/0.43	# Proof found!
0.14/0.43	# SZS status Theorem
0.14/0.43	# SZS output start CNFRefutation
0.14/0.43	fof(conjecture_1, conjecture, ![X3, X1, X2]:(((element(X3)&times(X3,X1)=X2)&element(X1))=>element(X2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conjecture_1)).
0.14/0.43	fof(axiom_2, axiom, ![X1]:(?[X2]:(X2=times(X1,X1)&times(X1,X2)=X1)<=>element(X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', axiom_2)).
0.14/0.43	fof(axiom_1, axiom, ![X3, X1, X2]:times(X1,times(X2,X3))=times(times(X3,X1),X2), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', axiom_1)).
0.14/0.43	fof(c_0_3, negated_conjecture, ~(![X3, X1, X2]:(((element(X3)&times(X3,X1)=X2)&element(X1))=>element(X2))), inference(assume_negation,[status(cth)],[conjecture_1])).
0.14/0.43	fof(c_0_4, plain, ![X12, X13, X14]:((X13!=times(X12,X12)|times(X12,X13)!=X12|element(X12))&((esk1_1(X14)=times(X14,X14)|~element(X14))&(times(X14,esk1_1(X14))=X14|~element(X14)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])])])])).
0.14/0.43	fof(c_0_5, negated_conjecture, (((element(esk2_0)&times(esk2_0,esk3_0)=esk4_0)&element(esk3_0))&~element(esk4_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])).
0.14/0.43	fof(c_0_6, plain, ![X19, X20, X21]:times(X20,times(X21,X19))=times(times(X19,X20),X21), inference(variable_rename,[status(thm)],[axiom_1])).
0.14/0.43	cnf(c_0_7, plain, (esk1_1(X1)=times(X1,X1)|~element(X1)), inference(split_conjunct,[status(thm)],[c_0_4])).
0.14/0.43	cnf(c_0_8, negated_conjecture, (element(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.14/0.43	cnf(c_0_9, plain, (times(X1,times(X2,X3))=times(times(X3,X1),X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.14/0.43	cnf(c_0_10, negated_conjecture, (times(esk3_0,esk3_0)=esk1_1(esk3_0)), inference(spm,[status(thm)],[c_0_7, c_0_8])).
0.14/0.43	cnf(c_0_11, negated_conjecture, (times(esk3_0,times(X1,esk3_0))=times(esk1_1(esk3_0),X1)), inference(spm,[status(thm)],[c_0_9, c_0_10])).
0.14/0.43	cnf(c_0_12, negated_conjecture, (times(esk2_0,esk3_0)=esk4_0), inference(split_conjunct,[status(thm)],[c_0_5])).
0.14/0.43	cnf(c_0_13, negated_conjecture, (times(esk1_1(esk3_0),esk2_0)=times(esk3_0,esk4_0)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.14/0.43	cnf(c_0_14, plain, (times(X1,esk1_1(X1))=X1|~element(X1)), inference(split_conjunct,[status(thm)],[c_0_4])).
0.14/0.43	cnf(c_0_15, negated_conjecture, (times(esk3_0,times(X1,esk2_0))=times(esk4_0,X1)), inference(spm,[status(thm)],[c_0_9, c_0_12])).
0.14/0.43	cnf(c_0_16, negated_conjecture, (times(esk4_0,times(X1,esk3_0))=times(esk2_0,times(X1,esk1_1(esk3_0)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_13]), c_0_9])).
0.14/0.43	cnf(c_0_17, negated_conjecture, (times(esk3_0,esk1_1(esk3_0))=esk3_0), inference(spm,[status(thm)],[c_0_14, c_0_8])).
0.14/0.43	cnf(c_0_18, negated_conjecture, (times(esk3_0,times(esk3_0,esk4_0))=times(esk4_0,esk1_1(esk3_0))), inference(spm,[status(thm)],[c_0_15, c_0_13])).
0.14/0.43	cnf(c_0_19, negated_conjecture, (times(esk4_0,esk1_1(esk3_0))=esk4_0), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_10]), c_0_17]), c_0_12])).
0.14/0.43	cnf(c_0_20, negated_conjecture, (element(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.14/0.43	cnf(c_0_21, negated_conjecture, (times(esk2_0,times(esk3_0,times(X1,X2)))=times(X1,times(X2,esk4_0))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_15]), c_0_9]), c_0_9]), c_0_9])).
0.14/0.43	cnf(c_0_22, negated_conjecture, (times(esk3_0,times(esk3_0,esk4_0))=esk4_0), inference(rw,[status(thm)],[c_0_18, c_0_19])).
0.14/0.43	cnf(c_0_23, negated_conjecture, (times(esk2_0,esk2_0)=esk1_1(esk2_0)), inference(spm,[status(thm)],[c_0_7, c_0_20])).
0.14/0.43	cnf(c_0_24, negated_conjecture, (times(esk3_0,times(esk4_0,esk4_0))=times(esk2_0,esk4_0)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.14/0.43	cnf(c_0_25, negated_conjecture, (times(esk4_0,esk2_0)=times(esk3_0,esk1_1(esk2_0))), inference(spm,[status(thm)],[c_0_15, c_0_23])).
0.14/0.43	cnf(c_0_26, negated_conjecture, (times(esk2_0,esk1_1(esk2_0))=esk2_0), inference(spm,[status(thm)],[c_0_14, c_0_20])).
0.14/0.43	cnf(c_0_27, negated_conjecture, (times(esk2_0,times(X1,esk2_0))=times(esk1_1(esk2_0),X1)), inference(spm,[status(thm)],[c_0_9, c_0_23])).
0.14/0.43	cnf(c_0_28, plain, (element(X2)|X1!=times(X2,X2)|times(X2,X1)!=X2), inference(split_conjunct,[status(thm)],[c_0_4])).
0.14/0.43	cnf(c_0_29, negated_conjecture, (times(esk4_0,times(esk4_0,esk4_0))=times(esk2_0,times(esk2_0,esk4_0))), inference(spm,[status(thm)],[c_0_21, c_0_24])).
0.14/0.43	cnf(c_0_30, negated_conjecture, (~element(esk4_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.14/0.43	cnf(c_0_31, negated_conjecture, (times(esk1_1(esk2_0),times(X1,esk3_0))=times(esk2_0,times(X1,esk4_0))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_25]), c_0_9])).
0.14/0.43	cnf(c_0_32, negated_conjecture, (times(esk1_1(esk2_0),times(X1,esk2_0))=times(esk2_0,X1)), inference(spm,[status(thm)],[c_0_9, c_0_26])).
0.14/0.43	cnf(c_0_33, plain, (times(X1,times(X2,times(X3,X4)))=times(X3,times(X4,times(X1,X2)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_9]), c_0_9]), c_0_9]), c_0_9])).
0.14/0.43	cnf(c_0_34, negated_conjecture, (times(esk1_1(esk2_0),esk2_0)=esk2_0), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_23]), c_0_26])).
0.14/0.43	cnf(c_0_35, negated_conjecture, (times(esk1_1(esk3_0),esk3_0)=esk3_0), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_10]), c_0_17])).
0.14/0.43	cnf(c_0_36, negated_conjecture, (times(esk2_0,times(esk2_0,esk4_0))!=esk4_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30])).
0.14/0.43	cnf(c_0_37, negated_conjecture, (times(esk2_0,times(esk2_0,esk4_0))=times(esk1_1(esk2_0),esk4_0)), inference(spm,[status(thm)],[c_0_31, c_0_12])).
0.14/0.43	cnf(c_0_38, negated_conjecture, (times(esk4_0,times(X1,esk2_0))=times(esk2_0,times(X1,esk4_0))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_32]), c_0_21]), c_0_9]), c_0_33]), c_0_34])).
0.14/0.43	cnf(c_0_39, negated_conjecture, (times(esk4_0,esk1_1(esk2_0))=times(esk3_0,esk2_0)), inference(spm,[status(thm)],[c_0_15, c_0_34])).
0.14/0.43	cnf(c_0_40, negated_conjecture, (times(esk1_1(esk3_0),esk1_1(esk3_0))=esk1_1(esk3_0)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_35]), c_0_10])).
0.14/0.43	cnf(c_0_41, negated_conjecture, (times(esk1_1(esk2_0),esk4_0)!=esk4_0), inference(rw,[status(thm)],[c_0_36, c_0_37])).
0.14/0.43	cnf(c_0_42, negated_conjecture, (times(esk1_1(esk2_0),esk4_0)=times(esk3_0,esk2_0)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_23]), c_0_39]), c_0_37])).
0.14/0.43	cnf(c_0_43, negated_conjecture, (times(esk3_0,times(esk3_0,times(X1,X2)))=times(X1,times(X2,esk1_1(esk3_0)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_11]), c_0_9]), c_0_9]), c_0_9])).
0.14/0.43	cnf(c_0_44, negated_conjecture, (times(esk4_0,esk3_0)=times(esk2_0,esk1_1(esk3_0))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_35]), c_0_40])).
0.14/0.43	cnf(c_0_45, negated_conjecture, (times(esk3_0,times(X1,esk1_1(esk3_0)))=times(esk3_0,X1)), inference(spm,[status(thm)],[c_0_9, c_0_35])).
0.14/0.43	cnf(c_0_46, negated_conjecture, (times(esk3_0,esk2_0)!=esk4_0), inference(rw,[status(thm)],[c_0_41, c_0_42])).
0.14/0.43	cnf(c_0_47, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_22]), c_0_18]), c_0_19]), c_0_9]), c_0_35]), c_0_44]), c_0_45]), c_0_46]), ['proof']).
0.14/0.43	# SZS output end CNFRefutation
0.14/0.43	# Proof object total steps             : 48
0.14/0.43	# Proof object clause steps            : 41
0.14/0.43	# Proof object formula steps           : 7
0.14/0.43	# Proof object conjectures             : 39
0.14/0.43	# Proof object clause conjectures      : 36
0.14/0.43	# Proof object formula conjectures     : 3
0.14/0.43	# Proof object initial clauses used    : 8
0.14/0.43	# Proof object initial formulas used   : 3
0.14/0.43	# Proof object generating inferences   : 30
0.14/0.43	# Proof object simplifying inferences  : 34
0.14/0.43	# Training examples: 0 positive, 0 negative
0.14/0.43	# Parsed axioms                        : 3
0.14/0.43	# Removed by relevancy pruning/SinE    : 0
0.14/0.43	# Initial clauses                      : 8
0.14/0.43	# Removed in clause preprocessing      : 0
0.14/0.43	# Initial clauses in saturation        : 8
0.14/0.43	# Processed clauses                    : 144
0.14/0.43	# ...of these trivial                  : 4
0.14/0.43	# ...subsumed                          : 35
0.14/0.43	# ...remaining for further processing  : 105
0.14/0.43	# Other redundant clauses eliminated   : 0
0.14/0.43	# Clauses deleted for lack of memory   : 0
0.14/0.43	# Backward-subsumed                    : 0
0.14/0.43	# Backward-rewritten                   : 23
0.14/0.43	# Generated clauses                    : 1003
0.14/0.43	# ...of the previous two non-trivial   : 860
0.14/0.43	# Contextual simplify-reflections      : 0
0.14/0.43	# Paramodulations                      : 1003
0.14/0.43	# Factorizations                       : 0
0.14/0.43	# NegExts                              : 0
0.14/0.43	# Equation resolutions                 : 0
0.14/0.43	# Propositional unsat checks           : 0
0.14/0.43	#    Propositional check models        : 0
0.14/0.43	#    Propositional check unsatisfiable : 0
0.14/0.43	#    Propositional clauses             : 0
0.14/0.43	#    Propositional clauses after purity: 0
0.14/0.43	#    Propositional unsat core size     : 0
0.14/0.43	#    Propositional preprocessing time  : 0.000
0.14/0.43	#    Propositional encoding time       : 0.000
0.14/0.43	#    Propositional solver time         : 0.000
0.14/0.43	#    Success case prop preproc time    : 0.000
0.14/0.43	#    Success case prop encoding time   : 0.000
0.14/0.43	#    Success case prop solver time     : 0.000
0.14/0.43	# Current number of processed clauses  : 74
0.14/0.43	#    Positive orientable unit clauses  : 50
0.14/0.43	#    Positive unorientable unit clauses: 2
0.14/0.43	#    Negative unit clauses             : 4
0.14/0.43	#    Non-unit-clauses                  : 18
0.14/0.43	# Current number of unprocessed clauses: 708
0.14/0.43	# ...number of literals in the above   : 1181
0.14/0.43	# Current number of archived formulas  : 0
0.14/0.43	# Current number of archived clauses   : 31
0.14/0.43	# Clause-clause subsumption calls (NU) : 246
0.14/0.43	# Rec. Clause-clause subsumption calls : 202
0.14/0.43	# Non-unit clause-clause subsumptions  : 18
0.14/0.43	# Unit Clause-clause subsumption calls : 37
0.14/0.43	# Rewrite failures with RHS unbound    : 0
0.14/0.43	# BW rewrite match attempts            : 16
0.14/0.43	# BW rewrite match successes           : 14
0.14/0.43	# Condensation attempts                : 0
0.14/0.43	# Condensation successes               : 0
0.14/0.43	# Termbank termtop insertions          : 18209
0.14/0.43	
0.14/0.43	# -------------------------------------------------
0.14/0.43	# User time                : 0.037 s
0.14/0.43	# System time              : 0.009 s
0.14/0.43	# Total time               : 0.046 s
0.14/0.43	# Maximum resident set size: 1580 pages
0.14/0.44	EOF
