0.05/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.05/0.10	% Command    : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s
0.10/0.30	% Computer   : n020.cluster.edu
0.10/0.30	% Model      : x86_64 x86_64
0.10/0.30	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.30	% Memory     : 8042.1875MB
0.10/0.30	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.30	% CPULimit   : 960
0.10/0.30	% WCLimit    : 120
0.10/0.30	% DateTime   : Thu Jul  2 06:36:47 EDT 2020
0.10/0.30	% CPUTime    : 
0.10/0.30	# Version: 2.5pre002
0.10/0.31	# No SInE strategy applied
0.10/0.31	# Trying AutoSched0 for 59 seconds
0.16/0.35	# AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YA
0.16/0.35	# and selection function SelectMaxLComplexAvoidPosPred.
0.16/0.35	#
0.16/0.35	# Preprocessing time       : 0.033 s
0.16/0.35	# Presaturation interreduction done
0.16/0.35	
0.16/0.35	# Proof found!
0.16/0.35	# SZS status Theorem
0.16/0.35	# SZS output start CNFRefutation
0.16/0.35	fof(mighta_sca_thm, conjecture, mighta(sca,thm), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mighta_sca_thm)).
0.16/0.35	fof(mighta, axiom, ![X9, X10]:(?[X1, X2]:(status(X1,X2,X9)&status(X1,X2,X10))<=>mighta(X9,X10)), file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax', mighta)).
0.16/0.35	fof(sca, axiom, ![X1, X2]:(status(X1,X2,sca)<=>(?[X5]:model(X5,X2)&~(?[X4]:model(X4,X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax', sca)).
0.16/0.35	fof(thm, axiom, ![X1, X2]:(status(X1,X2,thm)<=>![X4]:(model(X4,X2)<=model(X4,X1))), file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax', thm)).
0.16/0.35	fof(sat_non_taut_pair, axiom, ?[X1, X2]:(?[X5]:(~(model(X5,X2))|~(model(X5,X1)))&?[X4]:(model(X4,X2)&model(X4,X1))), file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax', sat_non_taut_pair)).
0.16/0.35	fof(contradiction, axiom, ?[X7]:![X8]:~(model(X8,X7)), file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax', contradiction)).
0.16/0.35	fof(c_0_6, negated_conjecture, ~(mighta(sca,thm)), inference(assume_negation,[status(cth)],[mighta_sca_thm])).
0.16/0.35	fof(c_0_7, negated_conjecture, ~mighta(sca,thm), inference(fof_simplification,[status(thm)],[c_0_6])).
0.16/0.35	fof(c_0_8, plain, ![X198, X199, X200, X201, X202, X203]:((~status(X200,X201,X198)|~status(X200,X201,X199)|mighta(X198,X199))&((status(esk55_2(X202,X203),esk56_2(X202,X203),X202)|~mighta(X202,X203))&(status(esk55_2(X202,X203),esk56_2(X202,X203),X203)|~mighta(X202,X203)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mighta])])])])])])).
0.16/0.35	cnf(c_0_9, negated_conjecture, (~mighta(sca,thm)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.16/0.35	cnf(c_0_10, plain, (mighta(X3,X4)|~status(X1,X2,X3)|~status(X1,X2,X4)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.16/0.35	fof(c_0_11, plain, ![X39, X40, X42, X43, X44, X45]:(((model(esk9_2(X39,X40),X40)|~status(X39,X40,sca))&(~model(X42,X39)|~status(X39,X40,sca)))&(~model(X45,X44)|model(esk10_2(X43,X44),X43)|status(X43,X44,sca))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sca])])])])])])).
0.16/0.35	cnf(c_0_12, negated_conjecture, (~status(X1,X2,thm)|~status(X1,X2,sca)), inference(spm,[status(thm)],[c_0_9, c_0_10])).
0.16/0.35	cnf(c_0_13, plain, (model(esk10_2(X3,X2),X3)|status(X3,X2,sca)|~model(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.16/0.35	fof(c_0_14, plain, ![X56, X57, X58, X59, X60]:((~status(X56,X57,thm)|(~model(X58,X56)|model(X58,X57)))&((model(esk13_2(X59,X60),X59)|status(X59,X60,thm))&(~model(esk13_2(X59,X60),X60)|status(X59,X60,thm)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[thm])])])])])])])).
0.16/0.35	cnf(c_0_15, plain, (~model(X1,X2)|~status(X2,X3,sca)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.16/0.35	cnf(c_0_16, negated_conjecture, (model(esk10_2(X1,X2),X1)|~status(X1,X2,thm)|~model(X3,X2)), inference(spm,[status(thm)],[c_0_12, c_0_13])).
0.16/0.35	cnf(c_0_17, plain, (model(esk13_2(X1,X2),X1)|status(X1,X2,thm)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.16/0.35	cnf(c_0_18, plain, (model(esk10_2(X1,X2),X1)|~model(X3,X1)|~model(X4,X2)), inference(spm,[status(thm)],[c_0_15, c_0_13])).
0.16/0.35	fof(c_0_19, plain, ((~model(esk69_0,esk68_0)|~model(esk69_0,esk67_0))&(model(esk70_0,esk68_0)&model(esk70_0,esk67_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[sat_non_taut_pair])])])).
0.16/0.35	fof(c_0_20, plain, ![X174]:~model(X174,esk43_0), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[contradiction])])])).
0.16/0.35	cnf(c_0_21, negated_conjecture, (model(esk10_2(X1,X2),X1)|~model(X3,X2)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18])).
0.16/0.35	cnf(c_0_22, plain, (model(esk70_0,esk68_0)), inference(split_conjunct,[status(thm)],[c_0_19])).
0.16/0.35	cnf(c_0_23, plain, (~model(X1,esk43_0)), inference(split_conjunct,[status(thm)],[c_0_20])).
0.16/0.35	cnf(c_0_24, negated_conjecture, (model(esk10_2(X1,esk68_0),X1)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.16/0.35	cnf(c_0_25, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_23, c_0_24]), ['proof']).
0.16/0.35	# SZS output end CNFRefutation
0.16/0.35	# Proof object total steps             : 26
0.16/0.35	# Proof object clause steps            : 13
0.16/0.35	# Proof object formula steps           : 13
0.16/0.35	# Proof object conjectures             : 9
0.16/0.35	# Proof object clause conjectures      : 6
0.16/0.35	# Proof object formula conjectures     : 3
0.16/0.35	# Proof object initial clauses used    : 7
0.16/0.35	# Proof object initial formulas used   : 6
0.16/0.35	# Proof object generating inferences   : 6
0.16/0.35	# Proof object simplifying inferences  : 1
0.16/0.35	# Training examples: 0 positive, 0 negative
0.16/0.35	# Parsed axioms                        : 33
0.16/0.35	# Removed by relevancy pruning/SinE    : 0
0.16/0.35	# Initial clauses                      : 109
0.16/0.35	# Removed in clause preprocessing      : 0
0.16/0.35	# Initial clauses in saturation        : 109
0.16/0.35	# Processed clauses                    : 293
0.16/0.35	# ...of these trivial                  : 8
0.16/0.35	# ...subsumed                          : 26
0.16/0.35	# ...remaining for further processing  : 259
0.16/0.35	# Other redundant clauses eliminated   : 0
0.16/0.35	# Clauses deleted for lack of memory   : 0
0.16/0.35	# Backward-subsumed                    : 11
0.16/0.35	# Backward-rewritten                   : 2
0.16/0.35	# Generated clauses                    : 607
0.16/0.35	# ...of the previous two non-trivial   : 550
0.16/0.35	# Contextual simplify-reflections      : 1
0.16/0.35	# Paramodulations                      : 607
0.16/0.35	# Factorizations                       : 0
0.16/0.35	# Equation resolutions                 : 0
0.16/0.35	# Propositional unsat checks           : 0
0.16/0.35	#    Propositional check models        : 0
0.16/0.35	#    Propositional check unsatisfiable : 0
0.16/0.35	#    Propositional clauses             : 0
0.16/0.35	#    Propositional clauses after purity: 0
0.16/0.35	#    Propositional unsat core size     : 0
0.16/0.35	#    Propositional preprocessing time  : 0.000
0.16/0.35	#    Propositional encoding time       : 0.000
0.16/0.35	#    Propositional solver time         : 0.000
0.16/0.35	#    Success case prop preproc time    : 0.000
0.16/0.35	#    Success case prop encoding time   : 0.000
0.16/0.35	#    Success case prop solver time     : 0.000
0.16/0.35	# Current number of processed clauses  : 139
0.16/0.35	#    Positive orientable unit clauses  : 31
0.16/0.35	#    Positive unorientable unit clauses: 0
0.16/0.35	#    Negative unit clauses             : 6
0.16/0.35	#    Non-unit-clauses                  : 102
0.16/0.35	# Current number of unprocessed clauses: 291
0.16/0.35	# ...number of literals in the above   : 930
0.16/0.35	# Current number of archived formulas  : 0
0.16/0.35	# Current number of archived clauses   : 120
0.16/0.35	# Clause-clause subsumption calls (NU) : 3488
0.16/0.35	# Rec. Clause-clause subsumption calls : 2186
0.16/0.35	# Non-unit clause-clause subsumptions  : 38
0.16/0.35	# Unit Clause-clause subsumption calls : 102
0.16/0.35	# Rewrite failures with RHS unbound    : 0
0.16/0.35	# BW rewrite match attempts            : 2
0.16/0.35	# BW rewrite match successes           : 2
0.16/0.35	# Condensation attempts                : 0
0.16/0.35	# Condensation successes               : 0
0.16/0.35	# Termbank termtop insertions          : 14707
0.16/0.35	
0.16/0.35	# -------------------------------------------------
0.16/0.35	# User time                : 0.048 s
0.16/0.35	# System time              : 0.003 s
0.16/0.35	# Total time               : 0.050 s
0.16/0.35	# Maximum resident set size: 1628 pages
0.16/0.35	EOF