0.00/0.04	% 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.24	% Computer   : n148.star.cs.uiowa.edu
0.02/0.24	% Model      : x86_64 x86_64
0.02/0.24	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.24	% Memory     : 32218.625MB
0.02/0.24	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.24	% CPULimit   : 300
0.02/0.24	% DateTime   : Sat Jul 14 04:34:55 CDT 2018
0.02/0.24	% CPUTime    : 
0.02/0.24	# Version: 2.2pre001
0.02/0.24	# No SInE strategy applied
0.02/0.24	# Trying AutoSched0 for 151 seconds
0.02/0.27	# AutoSched0-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_CO_S4S
0.02/0.27	# and selection function SelectNewComplexAHPNS.
0.02/0.27	#
0.02/0.27	# Preprocessing time       : 0.010 s
0.02/0.27	# Presaturation interreduction done
0.02/0.27	
0.02/0.27	# Proof found!
0.02/0.27	# SZS status Theorem
0.02/0.27	# SZS output start CNFRefutation
0.02/0.27	fof(isa, axiom, ![X1, X2]:(isa(X1,X2)<=>![X3, X4]:(status(X3,X4,X2)<=status(X3,X4,X1))), file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax', isa)).
0.02/0.27	fof(isa_transitive, conjecture, ![X1, X2, X11]:(isa(X1,X11)<=(isa(X2,X11)&isa(X1,X2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', isa_transitive)).
0.02/0.27	fof(c_0_2, plain, ![X31, X32, X33, X34, X31, X32]:((~isa(X31,X32)|(~status(X33,X34,X31)|status(X33,X34,X32)))&((status(esk12_2(X31,X32),esk13_2(X31,X32),X31)|isa(X31,X32))&(~status(esk12_2(X31,X32),esk13_2(X31,X32),X32)|isa(X31,X32)))), inference(distribute,[status(thm)],[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)],[isa])])])])])])])])).
0.02/0.27	fof(c_0_3, negated_conjecture, ~(![X1, X2, X11]:(isa(X1,X11)<=(isa(X2,X11)&isa(X1,X2)))), inference(assume_negation,[status(cth)],[isa_transitive])).
0.02/0.27	cnf(c_0_4, plain, (status(X3,X4,X2)|~isa(X1,X2)|~status(X3,X4,X1)), inference(split_conjunct,[status(thm)],[c_0_2])).
0.02/0.27	cnf(c_0_5, plain, (status(esk12_2(X1,X2),esk13_2(X1,X2),X1)|isa(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_2])).
0.02/0.27	fof(c_0_6, negated_conjecture, ((isa(esk31_0,esk32_0)&isa(esk30_0,esk31_0))&~isa(esk30_0,esk32_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3])])])])).
0.02/0.27	cnf(c_0_7, plain, (isa(X1,X2)|status(esk12_2(X1,X2),esk13_2(X1,X2),X3)|~isa(X1,X3)), inference(spm,[status(thm)],[c_0_4, c_0_5])).
0.02/0.27	cnf(c_0_8, negated_conjecture, (isa(esk30_0,esk31_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.02/0.27	cnf(c_0_9, negated_conjecture, (isa(esk30_0,X1)|status(esk12_2(esk30_0,X1),esk13_2(esk30_0,X1),esk31_0)), inference(spm,[status(thm)],[c_0_7, c_0_8])).
0.02/0.27	cnf(c_0_10, negated_conjecture, (isa(esk30_0,X1)|status(esk12_2(esk30_0,X1),esk13_2(esk30_0,X1),X2)|~isa(esk31_0,X2)), inference(spm,[status(thm)],[c_0_4, c_0_9])).
0.02/0.27	cnf(c_0_11, negated_conjecture, (isa(esk31_0,esk32_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.02/0.27	cnf(c_0_12, plain, (isa(X1,X2)|~status(esk12_2(X1,X2),esk13_2(X1,X2),X2)), inference(split_conjunct,[status(thm)],[c_0_2])).
0.02/0.27	cnf(c_0_13, negated_conjecture, (isa(esk30_0,X1)|status(esk12_2(esk30_0,X1),esk13_2(esk30_0,X1),esk32_0)), inference(spm,[status(thm)],[c_0_10, c_0_11])).
0.02/0.27	cnf(c_0_14, negated_conjecture, (~isa(esk30_0,esk32_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.02/0.27	cnf(c_0_15, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14]), ['proof']).
0.02/0.27	# SZS output end CNFRefutation
0.02/0.27	# Proof object total steps             : 16
0.02/0.27	# Proof object clause steps            : 11
0.02/0.27	# Proof object formula steps           : 5
0.02/0.27	# Proof object conjectures             : 10
0.02/0.27	# Proof object clause conjectures      : 7
0.02/0.27	# Proof object formula conjectures     : 3
0.02/0.27	# Proof object initial clauses used    : 6
0.02/0.27	# Proof object initial formulas used   : 2
0.02/0.27	# Proof object generating inferences   : 5
0.02/0.27	# Proof object simplifying inferences  : 1
0.02/0.27	# Training examples: 0 positive, 0 negative
0.02/0.27	# Parsed axioms                        : 14
0.02/0.27	# Removed by relevancy pruning/SinE    : 0
0.02/0.27	# Initial clauses                      : 38
0.02/0.27	# Removed in clause preprocessing      : 0
0.02/0.27	# Initial clauses in saturation        : 38
0.02/0.27	# Processed clauses                    : 304
0.02/0.27	# ...of these trivial                  : 0
0.02/0.27	# ...subsumed                          : 71
0.02/0.27	# ...remaining for further processing  : 233
0.02/0.27	# Other redundant clauses eliminated   : 0
0.02/0.27	# Clauses deleted for lack of memory   : 0
0.02/0.27	# Backward-subsumed                    : 3
0.02/0.27	# Backward-rewritten                   : 0
0.02/0.27	# Generated clauses                    : 832
0.02/0.27	# ...of the previous two non-trivial   : 817
0.02/0.27	# Contextual simplify-reflections      : 17
0.02/0.27	# Paramodulations                      : 830
0.02/0.27	# Factorizations                       : 2
0.02/0.27	# Equation resolutions                 : 0
0.02/0.27	# Propositional unsat checks           : 0
0.02/0.27	#    Propositional check models        : 0
0.02/0.27	#    Propositional check unsatisfiable : 0
0.02/0.27	#    Propositional clauses             : 0
0.02/0.27	#    Propositional clauses after purity: 0
0.02/0.27	#    Propositional unsat core size     : 0
0.02/0.27	# Current number of processed clauses  : 194
0.02/0.27	#    Positive orientable unit clauses  : 12
0.02/0.27	#    Positive unorientable unit clauses: 0
0.02/0.27	#    Negative unit clauses             : 6
0.02/0.27	#    Non-unit-clauses                  : 176
0.02/0.27	# Current number of unprocessed clauses: 567
0.02/0.27	# ...number of literals in the above   : 2047
0.02/0.27	# Current number of archived formulas  : 0
0.02/0.27	# Current number of archived clauses   : 39
0.02/0.27	# Clause-clause subsumption calls (NU) : 6304
0.02/0.27	# Rec. Clause-clause subsumption calls : 4960
0.02/0.27	# Non-unit clause-clause subsumptions  : 91
0.02/0.27	# Unit Clause-clause subsumption calls : 27
0.02/0.27	# Rewrite failures with RHS unbound    : 0
0.02/0.27	# BW rewrite match attempts            : 5
0.02/0.27	# BW rewrite match successes           : 0
0.02/0.27	# Condensation attempts                : 304
0.02/0.27	# Condensation successes               : 0
0.02/0.27	# Termbank termtop insertions          : 13912
0.02/0.27	
0.02/0.27	# -------------------------------------------------
0.02/0.27	# User time                : 0.023 s
0.02/0.27	# System time              : 0.002 s
0.02/0.27	# Total time               : 0.025 s
0.02/0.27	# Maximum resident set size: 1540 pages
0.02/0.27	EOF