0.00/0.04	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.05	% Command    : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s
0.03/0.30	% Computer   : n019.star.cs.uiowa.edu
0.03/0.30	% Model      : x86_64 x86_64
0.03/0.30	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.30	% Memory     : 32218.625MB
0.03/0.30	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.30	% CPULimit   : 300
0.03/0.30	% DateTime   : Fri Jul 13 14:54:11 CDT 2018
0.03/0.30	% CPUTime    : 
0.03/0.30	# Version: 2.2pre001
0.03/0.30	# No SInE strategy applied
0.03/0.30	# Trying AutoSched0 for 151 seconds
0.06/0.32	# AutoSched0-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_CO_S4S
0.06/0.32	# and selection function SelectNewComplexAHPNS.
0.06/0.32	#
0.06/0.32	# Preprocessing time       : 0.012 s
0.06/0.32	# Presaturation interreduction done
0.06/0.32	
0.06/0.32	# Proof found!
0.06/0.32	# SZS status Theorem
0.06/0.32	# SZS output start CNFRefutation
0.06/0.32	fof(contradiction, axiom, ?[X9]:![X10]:~(model(X10,X9)), file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax', contradiction)).
0.06/0.32	fof(thm, axiom, ![X1, X2]:(![X4]:(model(X4,X1)=>model(X4,X2))<=>status(X1,X2,thm)), file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax', thm)).
0.06/0.32	fof(mighta, axiom, ![X7, X8]:(?[X1, X2]:(status(X1,X2,X7)&status(X1,X2,X8))<=>mighta(X7,X8)), file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax', mighta)).
0.06/0.32	fof(mighta_cax_thm, conjecture, mighta(cax,thm), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mighta_cax_thm)).
0.06/0.32	fof(cax, axiom, ![X1, X2]:(status(X1,X2,cax)<=>~(?[X4]:model(X4,X1))), file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax', cax)).
0.06/0.32	fof(c_0_5, plain, ![X179]:~model(X179,esk70_0), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[contradiction])])])).
0.06/0.32	fof(c_0_6, plain, ![X41, X42, X41, X42, X44]:(((model(esk12_2(X41,X42),X41)|status(X41,X42,thm))&(~model(esk12_2(X41,X42),X42)|status(X41,X42,thm)))&(~status(X41,X42,thm)|(~model(X44,X41)|model(X44,X42)))), 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)],[thm])])])])])])])).
0.06/0.32	fof(c_0_7, plain, ![X172, X173, X174, X175, X172, X173]:((~status(X174,X175,X172)|~status(X174,X175,X173)|mighta(X172,X173))&((status(esk68_2(X172,X173),esk69_2(X172,X173),X172)|~mighta(X172,X173))&(status(esk68_2(X172,X173),esk69_2(X172,X173),X173)|~mighta(X172,X173)))), 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)],[mighta])])])])])])])).
0.06/0.32	cnf(c_0_8, plain, (~model(X1,esk70_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.06/0.32	cnf(c_0_9, plain, (model(esk12_2(X1,X2),X1)|status(X1,X2,thm)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.06/0.32	fof(c_0_10, negated_conjecture, ~(mighta(cax,thm)), inference(assume_negation,[status(cth)],[mighta_cax_thm])).
0.06/0.32	cnf(c_0_11, plain, (mighta(X3,X4)|~status(X1,X2,X3)|~status(X1,X2,X4)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.06/0.32	cnf(c_0_12, plain, (status(esk70_0,X1,thm)), inference(spm,[status(thm)],[c_0_8, c_0_9])).
0.06/0.32	fof(c_0_13, plain, ![X85, X86, X87, X85, X86]:((~status(X85,X86,cax)|~model(X87,X85))&(model(esk27_1(X85),X85)|status(X85,X86,cax))), 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)],[cax])])])])])])).
0.06/0.32	fof(c_0_14, negated_conjecture, ~mighta(cax,thm), inference(fof_simplification,[status(thm)],[c_0_10])).
0.06/0.32	cnf(c_0_15, plain, (mighta(X1,thm)|~status(esk70_0,X2,X1)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.06/0.32	cnf(c_0_16, plain, (model(esk27_1(X1),X1)|status(X1,X2,cax)), inference(split_conjunct,[status(thm)],[c_0_13])).
0.06/0.32	cnf(c_0_17, negated_conjecture, (~mighta(cax,thm)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.06/0.32	cnf(c_0_18, plain, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17]), c_0_8]), ['proof']).
0.06/0.32	# SZS output end CNFRefutation
0.06/0.32	# Proof object total steps             : 19
0.06/0.32	# Proof object clause steps            : 8
0.06/0.32	# Proof object formula steps           : 11
0.06/0.32	# Proof object conjectures             : 4
0.06/0.32	# Proof object clause conjectures      : 1
0.06/0.32	# Proof object formula conjectures     : 3
0.06/0.32	# Proof object initial clauses used    : 5
0.06/0.32	# Proof object initial formulas used   : 5
0.06/0.32	# Proof object generating inferences   : 3
0.06/0.32	# Proof object simplifying inferences  : 2
0.06/0.32	# Training examples: 0 positive, 0 negative
0.06/0.32	# Parsed axioms                        : 33
0.06/0.32	# Removed by relevancy pruning/SinE    : 0
0.06/0.32	# Initial clauses                      : 109
0.06/0.32	# Removed in clause preprocessing      : 0
0.06/0.32	# Initial clauses in saturation        : 109
0.06/0.32	# Processed clauses                    : 226
0.06/0.32	# ...of these trivial                  : 0
0.06/0.32	# ...subsumed                          : 3
0.06/0.32	# ...remaining for further processing  : 223
0.06/0.32	# Other redundant clauses eliminated   : 0
0.06/0.32	# Clauses deleted for lack of memory   : 0
0.06/0.32	# Backward-subsumed                    : 0
0.06/0.32	# Backward-rewritten                   : 0
0.06/0.32	# Generated clauses                    : 425
0.06/0.32	# ...of the previous two non-trivial   : 414
0.06/0.32	# Contextual simplify-reflections      : 0
0.06/0.32	# Paramodulations                      : 425
0.06/0.32	# Factorizations                       : 0
0.06/0.32	# Equation resolutions                 : 0
0.06/0.32	# Propositional unsat checks           : 0
0.06/0.32	#    Propositional check models        : 0
0.06/0.32	#    Propositional check unsatisfiable : 0
0.06/0.32	#    Propositional clauses             : 0
0.06/0.32	#    Propositional clauses after purity: 0
0.06/0.32	#    Propositional unsat core size     : 0
0.06/0.32	# Current number of processed clauses  : 116
0.06/0.32	#    Positive orientable unit clauses  : 15
0.06/0.32	#    Positive unorientable unit clauses: 0
0.06/0.32	#    Negative unit clauses             : 6
0.06/0.32	#    Non-unit-clauses                  : 95
0.06/0.32	# Current number of unprocessed clauses: 401
0.06/0.32	# ...number of literals in the above   : 1082
0.06/0.32	# Current number of archived formulas  : 0
0.06/0.32	# Current number of archived clauses   : 107
0.06/0.32	# Clause-clause subsumption calls (NU) : 4708
0.06/0.32	# Rec. Clause-clause subsumption calls : 2515
0.06/0.32	# Non-unit clause-clause subsumptions  : 5
0.06/0.32	# Unit Clause-clause subsumption calls : 232
0.06/0.32	# Rewrite failures with RHS unbound    : 0
0.06/0.32	# BW rewrite match attempts            : 3
0.06/0.32	# BW rewrite match successes           : 0
0.06/0.32	# Condensation attempts                : 226
0.06/0.32	# Condensation successes               : 3
0.06/0.32	# Termbank termtop insertions          : 14058
0.06/0.32	
0.06/0.32	# -------------------------------------------------
0.06/0.32	# User time                : 0.018 s
0.06/0.32	# System time              : 0.006 s
0.06/0.32	# Total time               : 0.023 s
0.06/0.32	# Maximum resident set size: 1572 pages
0.06/0.35	EOF