0.12/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : run_E %s %d THM
0.14/0.35	% Computer   : n027.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:36:55 EDT 2021
0.14/0.35	% CPUTime    : 
0.22/0.48	Running first-order theorem proving
0.22/0.48	Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
0.22/0.48	# Version: 2.6
0.22/0.48	# No SInE strategy applied
0.22/0.48	# Trying AutoSched0 for 59 seconds
0.22/0.54	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
0.22/0.54	# and selection function SelectCQIPrecW.
0.22/0.54	#
0.22/0.54	# Preprocessing time       : 0.033 s
0.22/0.54	# Presaturation interreduction done
0.22/0.54	
0.22/0.54	# Proof found!
0.22/0.54	# SZS status Theorem
0.22/0.54	# SZS output start CNFRefutation
0.22/0.54	fof(nonzerosnononesexist, conjecture, ?[X35]:(![X22]:(X35!=X22|~(r1(X22)))&![X30]:(![X32]:(~(r2(X32,X30))|~(r1(X32)))|X30!=X35)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', nonzerosnononesexist)).
0.22/0.54	fof(axiom_1, axiom, ?[X26]:![X27]:((r1(X27)&X26=X27)|(X27!=X26&~(r1(X27)))), file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax', axiom_1)).
0.22/0.54	fof(axiom_3a, axiom, ![X1, X2]:(![X3]:(![X4]:(~(r2(X1,X4))|X4!=X3)|~(r2(X2,X3)))|X2=X1), file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax', axiom_3a)).
0.22/0.54	fof(axiom_2, axiom, ![X41]:?[X42]:![X43]:((X42!=X43&~(r2(X41,X43)))|(r2(X41,X43)&X43=X42)), file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax', axiom_2)).
0.22/0.54	fof(axiom_7a, axiom, ![X38, X39]:(~(r2(X38,X39))|![X40]:(~(r1(X40))|X39!=X40)), file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax', axiom_7a)).
0.22/0.54	fof(axiom_1a, axiom, ![X20, X21]:?[X22]:(?[X23]:(r3(X20,X21,X23)&r2(X23,X22))&?[X24]:(X22=X24&?[X25]:(r3(X20,X25,X24)&r2(X21,X25)))), file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax', axiom_1a)).
0.22/0.54	fof(c_0_6, negated_conjecture, ~(?[X35]:(![X22]:(X35!=X22|~r1(X22))&![X30]:(![X32]:(~r2(X32,X30)|~r1(X32))|X30!=X35))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[nonzerosnononesexist])])).
0.22/0.54	fof(c_0_7, plain, ?[X26]:![X27]:((r1(X27)&X26=X27)|(X27!=X26&~r1(X27))), inference(fof_simplification,[status(thm)],[axiom_1])).
0.22/0.54	fof(c_0_8, plain, ![X1, X2]:(![X3]:(![X4]:(~r2(X1,X4)|X4!=X3)|~r2(X2,X3))|X2=X1), inference(fof_simplification,[status(thm)],[axiom_3a])).
0.22/0.54	fof(c_0_9, plain, ![X41]:?[X42]:![X43]:((X42!=X43&~r2(X41,X43))|(r2(X41,X43)&X43=X42)), inference(fof_simplification,[status(thm)],[axiom_2])).
0.22/0.54	fof(c_0_10, negated_conjecture, ![X134]:((((r2(esk23_1(X134),esk22_1(X134))|X134=esk21_1(X134))&(r1(esk23_1(X134))|X134=esk21_1(X134)))&(esk22_1(X134)=X134|X134=esk21_1(X134)))&(((r2(esk23_1(X134),esk22_1(X134))|r1(esk21_1(X134)))&(r1(esk23_1(X134))|r1(esk21_1(X134))))&(esk22_1(X134)=X134|r1(esk21_1(X134))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])).
0.22/0.54	fof(c_0_11, plain, ![X117]:(((X117!=esk12_0|r1(X117))&(~r1(X117)|r1(X117)))&((X117!=esk12_0|esk12_0=X117)&(~r1(X117)|esk12_0=X117))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_7])])])).
0.22/0.54	fof(c_0_12, plain, ![X38, X39]:(~r2(X38,X39)|![X40]:(~r1(X40)|X39!=X40)), inference(fof_simplification,[status(thm)],[axiom_7a])).
0.22/0.54	fof(c_0_13, plain, ![X91, X92, X93, X94]:(~r2(X91,X94)|X94!=X93|~r2(X92,X93)|X92=X91), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_8])])).
0.22/0.54	fof(c_0_14, plain, ![X131, X133]:(((r2(X131,X133)|esk20_1(X131)!=X133)&(X133=esk20_1(X131)|esk20_1(X131)!=X133))&((r2(X131,X133)|~r2(X131,X133))&(X133=esk20_1(X131)|~r2(X131,X133)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_9])])])).
0.22/0.54	cnf(c_0_15, negated_conjecture, (r2(esk23_1(X1),esk22_1(X1))|r1(esk21_1(X1))), inference(split_conjunct,[status(thm)],[c_0_10])).
0.22/0.54	cnf(c_0_16, negated_conjecture, (esk22_1(X1)=X1|r1(esk21_1(X1))), inference(split_conjunct,[status(thm)],[c_0_10])).
0.22/0.54	cnf(c_0_17, plain, (esk12_0=X1|~r1(X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.22/0.54	cnf(c_0_18, negated_conjecture, (r1(esk23_1(X1))|r1(esk21_1(X1))), inference(split_conjunct,[status(thm)],[c_0_10])).
0.22/0.54	cnf(c_0_19, negated_conjecture, (r2(esk23_1(X1),esk22_1(X1))|X1=esk21_1(X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.22/0.54	cnf(c_0_20, negated_conjecture, (esk22_1(X1)=X1|X1=esk21_1(X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.22/0.54	cnf(c_0_21, negated_conjecture, (r1(esk23_1(X1))|X1=esk21_1(X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.22/0.54	fof(c_0_22, plain, ![X128, X129, X130]:(~r2(X128,X129)|(~r1(X130)|X129!=X130)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_12])])).
0.22/0.54	cnf(c_0_23, plain, (X4=X1|~r2(X1,X2)|X2!=X3|~r2(X4,X3)), inference(split_conjunct,[status(thm)],[c_0_13])).
0.22/0.54	cnf(c_0_24, plain, (r2(X1,X2)|esk20_1(X1)!=X2), inference(split_conjunct,[status(thm)],[c_0_14])).
0.22/0.54	cnf(c_0_25, negated_conjecture, (r1(esk21_1(X1))|r2(esk23_1(X1),X1)), inference(spm,[status(thm)],[c_0_15, c_0_16])).
0.22/0.54	cnf(c_0_26, negated_conjecture, (esk23_1(X1)=esk12_0|r1(esk21_1(X1))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
0.22/0.54	cnf(c_0_27, negated_conjecture, (esk21_1(X1)=X1|r2(esk23_1(X1),X1)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
0.22/0.54	cnf(c_0_28, negated_conjecture, (esk23_1(X1)=esk12_0|esk21_1(X1)=X1), inference(spm,[status(thm)],[c_0_17, c_0_21])).
0.22/0.54	cnf(c_0_29, plain, (~r2(X1,X2)|~r1(X3)|X2!=X3), inference(split_conjunct,[status(thm)],[c_0_22])).
0.22/0.54	fof(c_0_30, plain, ![X110, X111]:((r3(X110,X111,esk9_2(X110,X111))&r2(esk9_2(X110,X111),esk8_2(X110,X111)))&(esk8_2(X110,X111)=esk10_2(X110,X111)&(r3(X110,esk11_2(X110,X111),esk10_2(X110,X111))&r2(X111,esk11_2(X110,X111))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_1a])])).
0.22/0.54	cnf(c_0_31, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3)), inference(er,[status(thm)],[c_0_23])).
0.22/0.54	cnf(c_0_32, plain, (r2(X1,esk20_1(X1))), inference(er,[status(thm)],[c_0_24])).
0.22/0.54	cnf(c_0_33, negated_conjecture, (r1(esk21_1(X1))|r2(esk12_0,X1)), inference(spm,[status(thm)],[c_0_25, c_0_26])).
0.22/0.54	cnf(c_0_34, negated_conjecture, (esk21_1(X1)=X1|r2(esk12_0,X1)), inference(spm,[status(thm)],[c_0_27, c_0_28])).
0.22/0.54	cnf(c_0_35, plain, (~r1(X1)|~r2(X2,X1)), inference(er,[status(thm)],[c_0_29])).
0.22/0.54	cnf(c_0_36, plain, (r2(esk9_2(X1,X2),esk8_2(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_30])).
0.22/0.54	cnf(c_0_37, plain, (X1=X2|~r2(X1,esk20_1(X2))), inference(spm,[status(thm)],[c_0_31, c_0_32])).
0.22/0.54	cnf(c_0_38, negated_conjecture, (r1(X1)|r2(esk12_0,X1)), inference(spm,[status(thm)],[c_0_33, c_0_34])).
0.22/0.54	cnf(c_0_39, plain, (~r1(esk20_1(X1))), inference(spm,[status(thm)],[c_0_35, c_0_32])).
0.22/0.54	cnf(c_0_40, plain, (r1(X1)|X1!=esk12_0), inference(split_conjunct,[status(thm)],[c_0_11])).
0.22/0.54	cnf(c_0_41, plain, (~r1(esk8_2(X1,X2))), inference(spm,[status(thm)],[c_0_35, c_0_36])).
0.22/0.54	cnf(c_0_42, negated_conjecture, (esk12_0=X1), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_39])).
0.22/0.54	cnf(c_0_43, plain, (r1(esk12_0)), inference(er,[status(thm)],[c_0_40])).
0.22/0.54	cnf(c_0_44, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41, c_0_42]), c_0_43])]), ['proof']).
0.22/0.54	# SZS output end CNFRefutation
0.22/0.54	# Proof object total steps             : 45
0.22/0.54	# Proof object clause steps            : 28
0.22/0.54	# Proof object formula steps           : 17
0.22/0.54	# Proof object conjectures             : 17
0.22/0.54	# Proof object clause conjectures      : 14
0.22/0.54	# Proof object formula conjectures     : 3
0.22/0.54	# Proof object initial clauses used    : 12
0.22/0.54	# Proof object initial formulas used   : 6
0.22/0.54	# Proof object generating inferences   : 11
0.22/0.54	# Proof object simplifying inferences  : 8
0.22/0.54	# Training examples: 0 positive, 0 negative
0.22/0.54	# Parsed axioms                        : 12
0.22/0.54	# Removed by relevancy pruning/SinE    : 0
0.22/0.54	# Initial clauses                      : 45
0.22/0.54	# Removed in clause preprocessing      : 12
0.22/0.54	# Initial clauses in saturation        : 33
0.22/0.54	# Processed clauses                    : 235
0.22/0.54	# ...of these trivial                  : 0
0.22/0.54	# ...subsumed                          : 76
0.22/0.54	# ...remaining for further processing  : 159
0.22/0.54	# Other redundant clauses eliminated   : 6
0.22/0.54	# Clauses deleted for lack of memory   : 0
0.22/0.54	# Backward-subsumed                    : 3
0.22/0.54	# Backward-rewritten                   : 110
0.22/0.54	# Generated clauses                    : 1192
0.22/0.54	# ...of the previous two non-trivial   : 560
0.22/0.54	# Contextual simplify-reflections      : 0
0.22/0.54	# Paramodulations                      : 1186
0.22/0.54	# Factorizations                       : 0
0.22/0.54	# NegExts                              : 0
0.22/0.54	# Equation resolutions                 : 6
0.22/0.54	# Propositional unsat checks           : 0
0.22/0.54	#    Propositional check models        : 0
0.22/0.54	#    Propositional check unsatisfiable : 0
0.22/0.54	#    Propositional clauses             : 0
0.22/0.54	#    Propositional clauses after purity: 0
0.22/0.54	#    Propositional unsat core size     : 0
0.22/0.54	#    Propositional preprocessing time  : 0.000
0.22/0.54	#    Propositional encoding time       : 0.000
0.22/0.54	#    Propositional solver time         : 0.000
0.22/0.54	#    Success case prop preproc time    : 0.000
0.22/0.54	#    Success case prop encoding time   : 0.000
0.22/0.54	#    Success case prop solver time     : 0.000
0.22/0.54	# Current number of processed clauses  : 7
0.22/0.54	#    Positive orientable unit clauses  : 3
0.22/0.54	#    Positive unorientable unit clauses: 1
0.22/0.54	#    Negative unit clauses             : 0
0.22/0.54	#    Non-unit-clauses                  : 3
0.22/0.54	# Current number of unprocessed clauses: 384
0.22/0.54	# ...number of literals in the above   : 1107
0.22/0.54	# Current number of archived formulas  : 0
0.22/0.54	# Current number of archived clauses   : 150
0.22/0.54	# Clause-clause subsumption calls (NU) : 1600
0.22/0.54	# Rec. Clause-clause subsumption calls : 1515
0.22/0.54	# Non-unit clause-clause subsumptions  : 75
0.22/0.54	# Unit Clause-clause subsumption calls : 134
0.22/0.54	# Rewrite failures with RHS unbound    : 5
0.22/0.54	# BW rewrite match attempts            : 61
0.22/0.54	# BW rewrite match successes           : 48
0.22/0.54	# Condensation attempts                : 0
0.22/0.54	# Condensation successes               : 0
0.22/0.54	# Termbank termtop insertions          : 16079
0.22/0.54	
0.22/0.54	# -------------------------------------------------
0.22/0.54	# User time                : 0.053 s
0.22/0.54	# System time              : 0.008 s
0.22/0.54	# Total time               : 0.061 s
0.22/0.54	# Maximum resident set size: 1640 pages
0.22/0.54	EOF