0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer   : n011.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 1200
0.13/0.35	% WCLimit    : 120
0.13/0.35	% DateTime   : Tue Jul 13 12:42:10 EDT 2021
0.13/0.35	% CPUTime    : 
0.20/0.47	Running first-order theorem proving
0.20/0.47	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.20/0.47	# Version: 2.6
0.20/0.48	# No SInE strategy applied
0.20/0.48	# Trying AutoSched0 for 59 seconds
0.20/0.51	# AutoSched0-Mode selected heuristic H_____102_C18_F1_PI_AE_Q4_CS_SP_S1S
0.20/0.51	# and selection function SelectComplexAHP.
0.20/0.51	#
0.20/0.51	# Preprocessing time       : 0.031 s
0.20/0.51	
0.20/0.51	# Proof found!
0.20/0.51	# SZS status Theorem
0.20/0.51	# SZS output start CNFRefutation
0.20/0.51	fof(xplustwoidy, conjecture, ?[X27, X9, X10]:(id(X10,X9)&?[X60]:(?[X61]:(r2(X61,X60)&?[X12]:(r1(X12)&r2(X12,X61)))&r3(X27,X60,X10))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', xplustwoidy)).
0.20/0.51	fof(axiom_6, axiom, ![X44, X45]:(id(X45,X44)|~(id(X44,X45))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_6)).
0.20/0.51	fof(axiom_1a, axiom, ![X58, X59]:?[X60]:(?[X61]:(?[X62]:(r2(X59,X62)&r3(X58,X62,X61))&id(X61,X60))&?[X63]:(r2(X63,X60)&r3(X58,X59,X63))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_1a)).
0.20/0.51	fof(axiom_4a, axiom, ![X14]:?[X15]:(?[X16]:(r1(X16)&r3(X14,X16,X15))&id(X15,X14)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_4a)).
0.20/0.51	fof(axiom_2, axiom, ![X17]:?[X18]:![X19]:((id(X19,X18)&r2(X17,X19))|(~(r2(X17,X19))&~(id(X19,X18)))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_2)).
0.20/0.51	fof(axiom_5, axiom, ![X13]:id(X13,X13), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_5)).
0.20/0.51	fof(c_0_6, negated_conjecture, ~(?[X27, X9, X10]:(id(X10,X9)&?[X60]:(?[X61]:(r2(X61,X60)&?[X12]:(r1(X12)&r2(X12,X61)))&r3(X27,X60,X10)))), inference(assume_negation,[status(cth)],[xplustwoidy])).
0.20/0.51	fof(c_0_7, plain, ![X44, X45]:(id(X45,X44)|~id(X44,X45)), inference(fof_simplification,[status(thm)],[axiom_6])).
0.20/0.51	fof(c_0_8, negated_conjecture, ![X208, X209, X210, X211, X212, X213]:(~id(X210,X209)|(~r2(X212,X211)|(~r1(X213)|~r2(X213,X212))|~r3(X208,X211,X210))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
0.20/0.51	fof(c_0_9, plain, ![X198, X199]:(((r2(X199,esk19_2(X198,X199))&r3(X198,esk19_2(X198,X199),esk18_2(X198,X199)))&id(esk18_2(X198,X199),esk17_2(X198,X199)))&(r2(esk20_2(X198,X199),esk17_2(X198,X199))&r3(X198,X199,esk20_2(X198,X199)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_1a])])).
0.20/0.51	fof(c_0_10, plain, ![X184, X185]:(id(X185,X184)|~id(X184,X185)), inference(variable_rename,[status(thm)],[c_0_7])).
0.20/0.51	fof(c_0_11, plain, ![X154]:((r1(esk6_1(X154))&r3(X154,esk6_1(X154),esk5_1(X154)))&id(esk5_1(X154),X154)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])])).
0.20/0.51	fof(c_0_12, plain, ![X17]:?[X18]:![X19]:((id(X19,X18)&r2(X17,X19))|(~r2(X17,X19)&~id(X19,X18))), inference(fof_simplification,[status(thm)],[axiom_2])).
0.20/0.51	cnf(c_0_13, negated_conjecture, (~id(X1,X2)|~r2(X3,X4)|~r1(X5)|~r2(X5,X3)|~r3(X6,X4,X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.51	cnf(c_0_14, plain, (r3(X1,X2,esk20_2(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.20/0.51	cnf(c_0_15, plain, (id(X1,X2)|~id(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.20/0.51	cnf(c_0_16, plain, (id(esk5_1(X1),X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.51	fof(c_0_17, plain, ![X157, X159]:(((~r2(X157,X159)|id(X159,esk7_1(X157)))&(~id(X159,esk7_1(X157))|id(X159,esk7_1(X157))))&((~r2(X157,X159)|r2(X157,X159))&(~id(X159,esk7_1(X157))|r2(X157,X159)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_12])])])).
0.20/0.51	fof(c_0_18, plain, ![X153]:id(X153,X153), inference(variable_rename,[status(thm)],[axiom_5])).
0.20/0.51	cnf(c_0_19, negated_conjecture, (~r1(X1)|~r2(X1,X2)|~r2(X2,X3)|~id(esk20_2(X4,X3),X5)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
0.20/0.51	cnf(c_0_20, plain, (id(X1,esk5_1(X1))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
0.20/0.51	cnf(c_0_21, plain, (r2(X2,X1)|~id(X1,esk7_1(X2))), inference(split_conjunct,[status(thm)],[c_0_17])).
0.20/0.51	cnf(c_0_22, plain, (id(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_18])).
0.20/0.51	cnf(c_0_23, negated_conjecture, (~r1(X1)|~r2(X1,X2)|~r2(X2,X3)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
0.20/0.51	cnf(c_0_24, plain, (r2(X1,esk7_1(X1))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.20/0.51	cnf(c_0_25, negated_conjecture, (~r1(X1)|~r2(esk7_1(X1),X2)), inference(spm,[status(thm)],[c_0_23, c_0_24])).
0.20/0.51	cnf(c_0_26, plain, (r2(X1,esk19_2(X2,X1))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.20/0.51	cnf(c_0_27, plain, (r1(esk6_1(X1))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.51	cnf(c_0_28, negated_conjecture, (~r1(X1)), inference(spm,[status(thm)],[c_0_25, c_0_26])).
0.20/0.51	cnf(c_0_29, plain, ($false), inference(sr,[status(thm)],[c_0_27, c_0_28]), ['proof']).
0.20/0.51	# SZS output end CNFRefutation
0.20/0.51	# Proof object total steps             : 30
0.20/0.51	# Proof object clause steps            : 15
0.20/0.51	# Proof object formula steps           : 15
0.20/0.51	# Proof object conjectures             : 8
0.20/0.51	# Proof object clause conjectures      : 5
0.20/0.51	# Proof object formula conjectures     : 3
0.20/0.51	# Proof object initial clauses used    : 8
0.20/0.51	# Proof object initial formulas used   : 6
0.20/0.51	# Proof object generating inferences   : 6
0.20/0.51	# Proof object simplifying inferences  : 1
0.20/0.51	# Training examples: 0 positive, 0 negative
0.20/0.51	# Parsed axioms                        : 19
0.20/0.51	# Removed by relevancy pruning/SinE    : 0
0.20/0.51	# Initial clauses                      : 59
0.20/0.51	# Removed in clause preprocessing      : 16
0.20/0.51	# Initial clauses in saturation        : 43
0.20/0.51	# Processed clauses                    : 85
0.20/0.51	# ...of these trivial                  : 0
0.20/0.51	# ...subsumed                          : 2
0.20/0.51	# ...remaining for further processing  : 83
0.20/0.51	# Other redundant clauses eliminated   : 0
0.20/0.51	# Clauses deleted for lack of memory   : 0
0.20/0.51	# Backward-subsumed                    : 3
0.20/0.51	# Backward-rewritten                   : 0
0.20/0.51	# Generated clauses                    : 231
0.20/0.51	# ...of the previous two non-trivial   : 198
0.20/0.51	# Contextual simplify-reflections      : 0
0.20/0.51	# Paramodulations                      : 223
0.20/0.51	# Factorizations                       : 0
0.20/0.51	# NegExts                              : 0
0.20/0.51	# Equation resolutions                 : 0
0.20/0.51	# Propositional unsat checks           : 0
0.20/0.51	#    Propositional check models        : 0
0.20/0.51	#    Propositional check unsatisfiable : 0
0.20/0.51	#    Propositional clauses             : 0
0.20/0.51	#    Propositional clauses after purity: 0
0.20/0.51	#    Propositional unsat core size     : 0
0.20/0.51	#    Propositional preprocessing time  : 0.000
0.20/0.51	#    Propositional encoding time       : 0.000
0.20/0.51	#    Propositional solver time         : 0.000
0.20/0.51	#    Success case prop preproc time    : 0.000
0.20/0.51	#    Success case prop encoding time   : 0.000
0.20/0.51	#    Success case prop solver time     : 0.000
0.20/0.51	# Current number of processed clauses  : 72
0.20/0.51	#    Positive orientable unit clauses  : 21
0.20/0.51	#    Positive unorientable unit clauses: 0
0.20/0.51	#    Negative unit clauses             : 11
0.20/0.51	#    Non-unit-clauses                  : 40
0.20/0.51	# Current number of unprocessed clauses: 154
0.20/0.51	# ...number of literals in the above   : 337
0.20/0.51	# Current number of archived formulas  : 0
0.20/0.51	# Current number of archived clauses   : 11
0.20/0.51	# Clause-clause subsumption calls (NU) : 306
0.20/0.51	# Rec. Clause-clause subsumption calls : 165
0.20/0.51	# Non-unit clause-clause subsumptions  : 3
0.20/0.51	# Unit Clause-clause subsumption calls : 163
0.20/0.51	# Rewrite failures with RHS unbound    : 0
0.20/0.51	# BW rewrite match attempts            : 5
0.20/0.51	# BW rewrite match successes           : 0
0.20/0.51	# Condensation attempts                : 0
0.20/0.51	# Condensation successes               : 0
0.20/0.51	# Termbank termtop insertions          : 5372
0.20/0.51	
0.20/0.51	# -------------------------------------------------
0.20/0.51	# User time                : 0.035 s
0.20/0.51	# System time              : 0.004 s
0.20/0.51	# Total time               : 0.039 s
0.20/0.51	# Maximum resident set size: 1672 pages
0.20/0.51	EOF