0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.13	% Command    : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s
0.13/0.34	% Computer   : n016.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.34	% CPULimit   : 180
0.13/0.34	% DateTime   : Thu Aug 29 09:11:53 EDT 2019
0.13/0.34	% CPUTime    : 
0.13/0.35	# Version: 2.4_pre003
0.13/0.35	# No SInE strategy applied
0.13/0.35	# Trying AutoSched0 for 90 seconds
0.19/0.41	# AutoSched0-Mode selected heuristic G_E___107_C12_11_nc_F1_PI_AE_Q4_CS_SP_PS_S065A
0.19/0.41	# and selection function SelectComplexAHP.
0.19/0.41	#
0.19/0.41	# Preprocessing time       : 0.028 s
0.19/0.41	# Presaturation interreduction done
0.19/0.41	
0.19/0.41	# Proof found!
0.19/0.41	# SZS status Theorem
0.19/0.41	# SZS output start CNFRefutation
0.19/0.41	fof(axiom_7a, axiom, ![X48, X49]:(~(r2(X48,X49))|![X50]:(~(r1(X50))|~(id(X50,X49)))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_7a)).
0.19/0.41	fof(axiom_6a, axiom, ![X64]:(?[X65, X66]:(r2(X65,X66)&id(X64,X66))|?[X67]:(r1(X67)&id(X64,X67))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_6a)).
0.19/0.41	fof(axiom_1, axiom, ?[X36]:![X37]:((r1(X37)&id(X37,X36))|(~(id(X37,X36))&~(r1(X37)))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_1)).
0.19/0.41	fof(axiom_5, axiom, ![X57]:id(X57,X57), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_5)).
0.19/0.41	fof(xplusyidthree, conjecture, ?[X65, X32, X34]:(?[X16]:(?[X18]:(?[X33]:(r2(X33,X18)&?[X17]:(r1(X17)&r2(X17,X33)))&r2(X18,X16))&id(X34,X16))&r3(X65,X32,X34)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', xplusyidthree)).
0.19/0.41	fof(axiom_7, axiom, ![X27, X28, X29]:(~(id(X28,X29))|id(X27,X29)|~(id(X27,X28))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_7)).
0.19/0.41	fof(axiom_4a, axiom, ![X5]:?[X6]:(id(X6,X5)&?[X7]:(r1(X7)&r3(X5,X7,X6))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_4a)).
0.19/0.41	fof(axiom_9, axiom, ![X38, X39, X40, X41]:(~(id(X38,X40))|~(id(X39,X41))|(r2(X40,X41)&r2(X38,X39))|(~(r2(X38,X39))&~(r2(X40,X41)))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_9)).
0.19/0.41	fof(axiom_2, axiom, ![X24]:?[X25]:![X26]:((r2(X24,X26)&id(X26,X25))|(~(id(X26,X25))&~(r2(X24,X26)))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_2)).
0.19/0.41	fof(axiom_8, axiom, ![X12, X13]:(~(id(X12,X13))|(~(r1(X12))&~(r1(X13)))|(r1(X13)&r1(X12))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_8)).
0.19/0.41	fof(axiom_2a, axiom, ![X30, X31]:?[X32]:(?[X33]:(r4(X30,X31,X33)&r3(X33,X30,X32))&?[X34]:(?[X35]:(r2(X31,X35)&r4(X30,X35,X34))&id(X34,X32))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax', axiom_2a)).
0.19/0.41	fof(c_0_11, plain, ![X115, X116, X117]:(~r2(X115,X116)|(~r1(X117)|~id(X117,X116))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_7a])])])).
0.19/0.41	fof(c_0_12, plain, ![X131]:(((r1(esk20_1(X131))|r2(esk18_1(X131),esk19_1(X131)))&(id(X131,esk20_1(X131))|r2(esk18_1(X131),esk19_1(X131))))&((r1(esk20_1(X131))|id(X131,esk19_1(X131)))&(id(X131,esk20_1(X131))|id(X131,esk19_1(X131))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_6a])])])).
0.19/0.41	cnf(c_0_13, plain, (~r2(X1,X2)|~r1(X3)|~id(X3,X2)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.19/0.41	cnf(c_0_14, plain, (id(X1,esk20_1(X1))|id(X1,esk19_1(X1))), inference(split_conjunct,[status(thm)],[c_0_12])).
0.19/0.41	fof(c_0_15, plain, ![X104]:(((~id(X104,esk14_0)|r1(X104))&(~r1(X104)|r1(X104)))&((~id(X104,esk14_0)|id(X104,esk14_0))&(~r1(X104)|id(X104,esk14_0)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_1])])])])).
0.19/0.41	fof(c_0_16, plain, ![X124]:id(X124,X124), inference(variable_rename,[status(thm)],[axiom_5])).
0.19/0.41	fof(c_0_17, negated_conjecture, ~(?[X65, X32, X34]:(?[X16]:(?[X18]:(?[X33]:(r2(X33,X18)&?[X17]:(r1(X17)&r2(X17,X33)))&r2(X18,X16))&id(X34,X16))&r3(X65,X32,X34))), inference(assume_negation,[status(cth)],[xplusyidthree])).
0.19/0.41	fof(c_0_18, plain, ![X94, X95, X96]:(~id(X95,X96)|id(X94,X96)|~id(X94,X95)), inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_7])])).
0.19/0.41	fof(c_0_19, plain, ![X72]:(id(esk1_1(X72),X72)&(r1(esk2_1(X72))&r3(X72,esk2_1(X72),esk1_1(X72)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])])).
0.19/0.41	fof(c_0_20, plain, ![X105, X106, X107, X108]:(((~r2(X105,X106)|(r2(X107,X108)|(~id(X105,X107)|~id(X106,X108))))&(~r2(X107,X108)|(r2(X107,X108)|(~id(X105,X107)|~id(X106,X108)))))&((~r2(X105,X106)|(r2(X105,X106)|(~id(X105,X107)|~id(X106,X108))))&(~r2(X107,X108)|(r2(X105,X106)|(~id(X105,X107)|~id(X106,X108)))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_9])])])).
0.19/0.41	cnf(c_0_21, plain, (id(X1,esk20_1(X1))|~r1(X1)|~r2(X2,esk19_1(X1))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
0.19/0.41	cnf(c_0_22, plain, (id(X1,esk20_1(X1))|r2(esk18_1(X1),esk19_1(X1))), inference(split_conjunct,[status(thm)],[c_0_12])).
0.19/0.41	cnf(c_0_23, plain, (r1(X1)|~id(X1,esk14_0)), inference(split_conjunct,[status(thm)],[c_0_15])).
0.19/0.41	cnf(c_0_24, plain, (id(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_16])).
0.19/0.41	fof(c_0_25, negated_conjecture, ![X135, X136, X137, X138, X139, X140, X141]:(~r2(X140,X139)|(~r1(X141)|~r2(X141,X140))|~r2(X139,X138)|~id(X137,X138)|~r3(X135,X136,X137)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])).
0.19/0.41	cnf(c_0_26, plain, (id(X3,X2)|~id(X1,X2)|~id(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_18])).
0.19/0.41	cnf(c_0_27, plain, (id(esk1_1(X1),X1)), inference(split_conjunct,[status(thm)],[c_0_19])).
0.19/0.41	cnf(c_0_28, plain, (r2(X3,X4)|~r2(X1,X2)|~id(X1,X3)|~id(X2,X4)), inference(split_conjunct,[status(thm)],[c_0_20])).
0.19/0.41	cnf(c_0_29, plain, (id(X1,esk20_1(X1))|~r1(X1)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.19/0.41	cnf(c_0_30, plain, (r1(esk14_0)), inference(spm,[status(thm)],[c_0_23, c_0_24])).
0.19/0.41	fof(c_0_31, plain, ![X91, X93]:(((~id(X93,esk9_1(X91))|r2(X91,X93))&(~r2(X91,X93)|r2(X91,X93)))&((~id(X93,esk9_1(X91))|id(X93,esk9_1(X91)))&(~r2(X91,X93)|id(X93,esk9_1(X91))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_2])])])])).
0.19/0.41	cnf(c_0_32, negated_conjecture, (~r2(X1,X2)|~r1(X3)|~r2(X3,X1)|~r2(X2,X4)|~id(X5,X4)|~r3(X6,X7,X5)), inference(split_conjunct,[status(thm)],[c_0_25])).
0.19/0.41	cnf(c_0_33, plain, (r3(X1,esk2_1(X1),esk1_1(X1))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.19/0.41	cnf(c_0_34, plain, (id(esk1_1(X1),X2)|~id(X1,X2)), inference(spm,[status(thm)],[c_0_26, c_0_27])).
0.19/0.41	cnf(c_0_35, plain, (r2(X1,X2)|~id(X3,X1)|~r2(X3,X2)), inference(spm,[status(thm)],[c_0_28, c_0_24])).
0.19/0.41	cnf(c_0_36, plain, (id(esk14_0,esk20_1(esk14_0))), inference(spm,[status(thm)],[c_0_29, c_0_30])).
0.19/0.41	cnf(c_0_37, plain, (r2(X2,X1)|~id(X1,esk9_1(X2))), inference(split_conjunct,[status(thm)],[c_0_31])).
0.19/0.41	fof(c_0_38, plain, ![X79, X80]:(((r1(X80)|(~r1(X79)|~id(X79,X80)))&(r1(X79)|(~r1(X79)|~id(X79,X80))))&((r1(X80)|(~r1(X80)|~id(X79,X80)))&(r1(X79)|(~r1(X80)|~id(X79,X80))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_8])])])).
0.19/0.41	cnf(c_0_39, negated_conjecture, (~r1(X1)|~id(esk1_1(X2),X3)|~r2(X1,X4)|~r2(X5,X3)|~r2(X4,X5)), inference(spm,[status(thm)],[c_0_32, c_0_33])).
0.19/0.41	cnf(c_0_40, plain, (id(esk1_1(esk1_1(X1)),X1)), inference(spm,[status(thm)],[c_0_34, c_0_27])).
0.19/0.41	cnf(c_0_41, plain, (r2(esk20_1(esk14_0),X1)|~r2(esk14_0,X1)), inference(spm,[status(thm)],[c_0_35, c_0_36])).
0.19/0.41	cnf(c_0_42, plain, (r2(X1,esk9_1(X1))), inference(spm,[status(thm)],[c_0_37, c_0_24])).
0.19/0.41	cnf(c_0_43, plain, (r1(X1)|~r1(X2)|~id(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_38])).
0.19/0.41	cnf(c_0_44, negated_conjecture, (~r1(X1)|~r2(X1,X2)|~r2(X3,X4)|~r2(X2,X3)), inference(spm,[status(thm)],[c_0_39, c_0_40])).
0.19/0.41	cnf(c_0_45, plain, (r2(esk20_1(esk14_0),esk9_1(esk14_0))), inference(spm,[status(thm)],[c_0_41, c_0_42])).
0.19/0.41	cnf(c_0_46, plain, (r1(esk20_1(esk14_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_36]), c_0_30])])).
0.19/0.41	cnf(c_0_47, negated_conjecture, (~r2(esk9_1(esk14_0),X1)|~r2(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44, c_0_45]), c_0_46])])).
0.19/0.41	fof(c_0_48, plain, ![X97, X98]:((r4(X97,X98,esk11_2(X97,X98))&r3(esk11_2(X97,X98),X97,esk10_2(X97,X98)))&((r2(X98,esk13_2(X97,X98))&r4(X97,esk13_2(X97,X98),esk12_2(X97,X98)))&id(esk12_2(X97,X98),esk10_2(X97,X98)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_2a])])).
0.19/0.41	cnf(c_0_49, negated_conjecture, (~r2(esk9_1(esk9_1(esk14_0)),X1)), inference(spm,[status(thm)],[c_0_47, c_0_42])).
0.19/0.41	cnf(c_0_50, plain, (r2(X1,esk13_2(X2,X1))), inference(split_conjunct,[status(thm)],[c_0_48])).
0.19/0.41	cnf(c_0_51, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_49, c_0_50]), ['proof']).
0.19/0.41	# SZS output end CNFRefutation
0.19/0.41	# Proof object total steps             : 52
0.19/0.41	# Proof object clause steps            : 29
0.19/0.41	# Proof object formula steps           : 23
0.19/0.41	# Proof object conjectures             : 9
0.19/0.41	# Proof object clause conjectures      : 6
0.19/0.41	# Proof object formula conjectures     : 3
0.19/0.41	# Proof object initial clauses used    : 13
0.19/0.41	# Proof object initial formulas used   : 11
0.19/0.41	# Proof object generating inferences   : 16
0.19/0.41	# Proof object simplifying inferences  : 4
0.19/0.41	# Training examples: 0 positive, 0 negative
0.19/0.41	# Parsed axioms                        : 19
0.19/0.41	# Removed by relevancy pruning/SinE    : 0
0.19/0.41	# Initial clauses                      : 59
0.19/0.41	# Removed in clause preprocessing      : 16
0.19/0.41	# Initial clauses in saturation        : 43
0.19/0.41	# Processed clauses                    : 652
0.19/0.41	# ...of these trivial                  : 58
0.19/0.41	# ...subsumed                          : 224
0.19/0.41	# ...remaining for further processing  : 370
0.19/0.41	# Other redundant clauses eliminated   : 0
0.19/0.41	# Clauses deleted for lack of memory   : 0
0.19/0.41	# Backward-subsumed                    : 6
0.19/0.41	# Backward-rewritten                   : 2
0.19/0.41	# Generated clauses                    : 2687
0.19/0.41	# ...of the previous two non-trivial   : 2291
0.19/0.41	# Contextual simplify-reflections      : 1
0.19/0.41	# Paramodulations                      : 2687
0.19/0.41	# Factorizations                       : 0
0.19/0.41	# Equation resolutions                 : 0
0.19/0.41	# Propositional unsat checks           : 0
0.19/0.41	#    Propositional check models        : 0
0.19/0.41	#    Propositional check unsatisfiable : 0
0.19/0.41	#    Propositional clauses             : 0
0.19/0.41	#    Propositional clauses after purity: 0
0.19/0.41	#    Propositional unsat core size     : 0
0.19/0.41	#    Propositional preprocessing time  : 0.000
0.19/0.41	#    Propositional encoding time       : 0.000
0.19/0.41	#    Propositional solver time         : 0.000
0.19/0.41	#    Success case prop preproc time    : 0.000
0.19/0.41	#    Success case prop encoding time   : 0.000
0.19/0.41	#    Success case prop solver time     : 0.000
0.19/0.41	# Current number of processed clauses  : 319
0.19/0.41	#    Positive orientable unit clauses  : 154
0.19/0.41	#    Positive unorientable unit clauses: 0
0.19/0.41	#    Negative unit clauses             : 28
0.19/0.41	#    Non-unit-clauses                  : 137
0.19/0.41	# Current number of unprocessed clauses: 1723
0.19/0.41	# ...number of literals in the above   : 2944
0.19/0.41	# Current number of archived formulas  : 0
0.19/0.41	# Current number of archived clauses   : 51
0.19/0.41	# Clause-clause subsumption calls (NU) : 2284
0.19/0.41	# Rec. Clause-clause subsumption calls : 1475
0.19/0.41	# Non-unit clause-clause subsumptions  : 39
0.19/0.41	# Unit Clause-clause subsumption calls : 929
0.19/0.41	# Rewrite failures with RHS unbound    : 0
0.19/0.41	# BW rewrite match attempts            : 79
0.19/0.41	# BW rewrite match successes           : 2
0.19/0.41	# Condensation attempts                : 0
0.19/0.41	# Condensation successes               : 0
0.19/0.41	# Termbank termtop insertions          : 28954
0.19/0.41	
0.19/0.41	# -------------------------------------------------
0.19/0.41	# User time                : 0.060 s
0.19/0.41	# System time              : 0.008 s
0.19/0.41	# Total time               : 0.068 s
0.19/0.41	# Maximum resident set size: 1664 pages
0.19/0.41	EOF