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.02/0.23	% Computer   : n134.star.cs.uiowa.edu
0.02/0.23	% Model      : x86_64 x86_64
0.02/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.23	% Memory     : 32218.625MB
0.02/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.23	% CPULimit   : 300
0.02/0.23	% DateTime   : Sat Jul 14 04:23:40 CDT 2018
0.02/0.23	% CPUTime    : 
0.02/0.23	# Version: 2.2pre001
0.02/0.23	# No SInE strategy applied
0.02/0.23	# Trying AutoSched0 for 151 seconds
0.02/0.24	# AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
0.02/0.24	# and selection function SelectMaxLComplexAvoidPosPred.
0.02/0.24	#
0.02/0.24	# Preprocessing time       : 0.008 s
0.02/0.24	# Presaturation interreduction done
0.02/0.24	
0.02/0.24	# Proof found!
0.02/0.24	# SZS status Theorem
0.02/0.24	# SZS output start CNFRefutation
0.02/0.24	fof(co1, conjecture, ((![X1]:(sorti2(h(X1))<=sorti1(X1))&![X2]:(sorti2(X2)=>sorti1(j(X2))))=>~((((![X3]:(sorti1(X3)=>![X4]:(op2(h(X3),h(X4))=h(op1(X3,X4))<=sorti1(X4)))&![X5]:(![X6]:(op1(j(X5),j(X6))=j(op2(X5,X6))<=sorti2(X6))<=sorti2(X5)))&![X7]:(X7=h(j(X7))<=sorti2(X7)))&![X8]:(sorti1(X8)=>j(h(X8))=X8)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', co1)).
0.02/0.24	fof(ax2, axiom, ![X1]:(sorti2(X1)=>![X2]:(sorti2(X2)=>sorti2(op2(X1,X2)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax2)).
0.02/0.24	fof(ax4, axiom, ~(?[X1]:(sorti2(X1)&![X2]:(sorti2(X2)=>op2(X2,X2)=X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax4)).
0.02/0.24	fof(ax3, axiom, ?[X1]:(![X2]:(op1(X2,X2)=X1<=sorti1(X2))&sorti1(X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax3)).
0.02/0.24	fof(c_0_4, negated_conjecture, ~(((![X1]:(sorti2(h(X1))<=sorti1(X1))&![X2]:(sorti2(X2)=>sorti1(j(X2))))=>~((((![X3]:(sorti1(X3)=>![X4]:(op2(h(X3),h(X4))=h(op1(X3,X4))<=sorti1(X4)))&![X5]:(![X6]:(op1(j(X5),j(X6))=j(op2(X5,X6))<=sorti2(X6))<=sorti2(X5)))&![X7]:(X7=h(j(X7))<=sorti2(X7)))&![X8]:(sorti1(X8)=>j(h(X8))=X8))))), inference(assume_negation,[status(cth)],[co1])).
0.02/0.24	fof(c_0_5, negated_conjecture, ![X15, X16, X17, X18, X19, X20, X21, X22]:(((~sorti1(X15)|sorti2(h(X15)))&(~sorti2(X16)|sorti1(j(X16))))&((((~sorti1(X17)|(~sorti1(X18)|op2(h(X17),h(X18))=h(op1(X17,X18))))&(~sorti2(X19)|(~sorti2(X20)|op1(j(X19),j(X20))=j(op2(X19,X20)))))&(~sorti2(X21)|X21=h(j(X21))))&(~sorti1(X22)|j(h(X22))=X22))), 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)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])])])).
0.02/0.24	fof(c_0_6, plain, ![X11, X12]:(~sorti2(X11)|(~sorti2(X12)|sorti2(op2(X11,X12)))), 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)],[ax2])])])])])).
0.02/0.24	fof(c_0_7, plain, ![X13]:((sorti2(esk2_1(X13))|~sorti2(X13))&(op2(esk2_1(X13),esk2_1(X13))!=X13|~sorti2(X13))), inference(distribute,[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)],[ax4])])])])])])).
0.02/0.24	cnf(c_0_8, negated_conjecture, (X1=h(j(X1))|~sorti2(X1)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.02/0.24	cnf(c_0_9, negated_conjecture, (op1(j(X1),j(X2))=j(op2(X1,X2))|~sorti2(X1)|~sorti2(X2)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.02/0.24	cnf(c_0_10, plain, (sorti2(op2(X1,X2))|~sorti2(X1)|~sorti2(X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.02/0.24	cnf(c_0_11, plain, (op2(esk2_1(X1),esk2_1(X1))!=X1|~sorti2(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.02/0.24	cnf(c_0_12, negated_conjecture, (op2(X1,X2)=h(op1(j(X1),j(X2)))|~sorti2(X2)|~sorti2(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])).
0.02/0.24	cnf(c_0_13, plain, (sorti2(esk2_1(X1))|~sorti2(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.02/0.24	fof(c_0_14, plain, ![X10]:((~sorti1(X10)|op1(X10,X10)=esk1_0)&sorti1(esk1_0)), 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)],[inference(fof_simplification,[status(thm)],[ax3])])])])])])])).
0.02/0.24	cnf(c_0_15, negated_conjecture, (h(op1(j(esk2_1(X1)),j(esk2_1(X1))))!=X1|~sorti2(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13])).
0.02/0.24	cnf(c_0_16, plain, (op1(X1,X1)=esk1_0|~sorti1(X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.02/0.24	cnf(c_0_17, negated_conjecture, (~sorti2(h(esk1_0))|~sorti1(j(esk2_1(h(esk1_0))))), inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16])])).
0.02/0.24	cnf(c_0_18, negated_conjecture, (sorti1(j(X1))|~sorti2(X1)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.02/0.24	cnf(c_0_19, negated_conjecture, (~sorti2(h(esk1_0))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_13])).
0.02/0.24	cnf(c_0_20, negated_conjecture, (sorti2(h(X1))|~sorti1(X1)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.02/0.24	cnf(c_0_21, plain, (sorti1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.02/0.24	cnf(c_0_22, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21])]), ['proof']).
0.02/0.24	# SZS output end CNFRefutation
0.02/0.24	# Proof object total steps             : 23
0.02/0.24	# Proof object clause steps            : 14
0.02/0.24	# Proof object formula steps           : 9
0.02/0.24	# Proof object conjectures             : 12
0.02/0.24	# Proof object clause conjectures      : 9
0.02/0.24	# Proof object formula conjectures     : 3
0.02/0.24	# Proof object initial clauses used    : 9
0.02/0.24	# Proof object initial formulas used   : 4
0.02/0.24	# Proof object generating inferences   : 5
0.02/0.24	# Proof object simplifying inferences  : 6
0.02/0.24	# Training examples: 0 positive, 0 negative
0.02/0.24	# Parsed axioms                        : 5
0.02/0.24	# Removed by relevancy pruning/SinE    : 0
0.02/0.24	# Initial clauses                      : 12
0.02/0.24	# Removed in clause preprocessing      : 0
0.02/0.24	# Initial clauses in saturation        : 12
0.02/0.24	# Processed clauses                    : 30
0.02/0.24	# ...of these trivial                  : 0
0.02/0.24	# ...subsumed                          : 0
0.02/0.24	# ...remaining for further processing  : 30
0.02/0.24	# Other redundant clauses eliminated   : 1
0.02/0.24	# Clauses deleted for lack of memory   : 0
0.02/0.24	# Backward-subsumed                    : 0
0.02/0.24	# Backward-rewritten                   : 0
0.02/0.24	# Generated clauses                    : 25
0.02/0.24	# ...of the previous two non-trivial   : 18
0.02/0.24	# Contextual simplify-reflections      : 5
0.02/0.24	# Paramodulations                      : 24
0.02/0.24	# Factorizations                       : 0
0.02/0.24	# Equation resolutions                 : 1
0.02/0.24	# Propositional unsat checks           : 0
0.02/0.24	#    Propositional check models        : 0
0.02/0.24	#    Propositional check unsatisfiable : 0
0.02/0.24	#    Propositional clauses             : 0
0.02/0.24	#    Propositional clauses after purity: 0
0.02/0.24	#    Propositional unsat core size     : 0
0.02/0.24	# Current number of processed clauses  : 18
0.02/0.24	#    Positive orientable unit clauses  : 1
0.02/0.24	#    Positive unorientable unit clauses: 0
0.02/0.24	#    Negative unit clauses             : 1
0.02/0.24	#    Non-unit-clauses                  : 16
0.02/0.24	# Current number of unprocessed clauses: 12
0.02/0.24	# ...number of literals in the above   : 52
0.02/0.24	# Current number of archived formulas  : 0
0.02/0.24	# Current number of archived clauses   : 12
0.02/0.24	# Clause-clause subsumption calls (NU) : 33
0.02/0.24	# Rec. Clause-clause subsumption calls : 32
0.02/0.24	# Non-unit clause-clause subsumptions  : 5
0.02/0.24	# Unit Clause-clause subsumption calls : 11
0.02/0.24	# Rewrite failures with RHS unbound    : 0
0.02/0.24	# BW rewrite match attempts            : 0
0.02/0.24	# BW rewrite match successes           : 0
0.02/0.24	# Condensation attempts                : 0
0.02/0.24	# Condensation successes               : 0
0.02/0.24	# Termbank termtop insertions          : 1488
0.02/0.24	
0.02/0.24	# -------------------------------------------------
0.02/0.24	# User time                : 0.009 s
0.02/0.24	# System time              : 0.002 s
0.02/0.24	# Total time               : 0.011 s
0.02/0.24	# Maximum resident set size: 1480 pages
0.02/0.25	EOF