0.03/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s
0.12/0.33	% Computer   : n003.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 180
0.12/0.33	% DateTime   : Thu Aug 29 09:10:47 EDT 2019
0.12/0.33	% CPUTime    : 
0.12/0.33	# Version: 2.4_pre003
0.12/0.34	# No SInE strategy applied
0.12/0.34	# Trying AutoSched0 for 90 seconds
0.19/0.39	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
0.19/0.39	# and selection function SelectComplexExceptUniqMaxHorn.
0.19/0.39	#
0.19/0.39	# Preprocessing time       : 0.032 s
0.19/0.39	# Presaturation interreduction done
0.19/0.39	
0.19/0.39	# Proof found!
0.19/0.39	# SZS status Theorem
0.19/0.39	# SZS output start CNFRefutation
0.19/0.39	fof(s1_0_axiom_m4, conjecture, axiom_m4, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', s1_0_axiom_m4)).
0.19/0.39	fof(necessitation, axiom, (necessitation<=>![X1]:(is_a_theorem(necessarily(X1))<=is_a_theorem(X1))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', necessitation)).
0.19/0.39	fof(op_strict_implies, axiom, (![X1, X2]:necessarily(implies(X1,X2))=strict_implies(X1,X2)<=op_strict_implies), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+1.ax', op_strict_implies)).
0.19/0.39	fof(modus_ponens, axiom, (modus_ponens<=>![X1, X2]:((is_a_theorem(X1)&is_a_theorem(implies(X1,X2)))=>is_a_theorem(X2))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', modus_ponens)).
0.19/0.39	fof(implies_2, axiom, (implies_2<=>![X1, X2]:is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', implies_2)).
0.19/0.39	fof(axiom_m4, axiom, (![X1]:is_a_theorem(strict_implies(X1,and(X1,X1)))<=>axiom_m4), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', axiom_m4)).
0.19/0.39	fof(km5_necessitation, axiom, necessitation, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+2.ax', km5_necessitation)).
0.19/0.39	fof(s1_0_op_strict_implies, axiom, op_strict_implies, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', s1_0_op_strict_implies)).
0.19/0.39	fof(hilbert_modus_ponens, axiom, modus_ponens, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax', hilbert_modus_ponens)).
0.19/0.39	fof(hilbert_implies_2, axiom, implies_2, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax', hilbert_implies_2)).
0.19/0.39	fof(and_3, axiom, (![X1, X2]:is_a_theorem(implies(X1,implies(X2,and(X1,X2))))<=>and_3), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', and_3)).
0.19/0.39	fof(hilbert_and_3, axiom, and_3, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax', hilbert_and_3)).
0.19/0.39	fof(c_0_12, negated_conjecture, ~(axiom_m4), inference(assume_negation,[status(cth)],[s1_0_axiom_m4])).
0.19/0.39	fof(c_0_13, plain, ![X159]:((~necessitation|(~is_a_theorem(X159)|is_a_theorem(necessarily(X159))))&((is_a_theorem(esk72_0)|necessitation)&(~is_a_theorem(necessarily(esk72_0))|necessitation))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[necessitation])])])])])])).
0.19/0.39	fof(c_0_14, plain, ![X208, X209]:(~op_strict_implies|necessarily(implies(X208,X209))=strict_implies(X208,X209)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[op_strict_implies])])])])).
0.19/0.39	fof(c_0_15, plain, ![X47, X48]:((~modus_ponens|(~is_a_theorem(X47)|~is_a_theorem(implies(X47,X48))|is_a_theorem(X48)))&(((is_a_theorem(esk21_0)|modus_ponens)&(is_a_theorem(implies(esk21_0,esk22_0))|modus_ponens))&(~is_a_theorem(esk22_0)|modus_ponens))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])])).
0.19/0.39	fof(c_0_16, plain, ![X75, X76]:((~implies_2|is_a_theorem(implies(implies(X75,implies(X75,X76)),implies(X75,X76))))&(~is_a_theorem(implies(implies(esk35_0,implies(esk35_0,esk36_0)),implies(esk35_0,esk36_0)))|implies_2)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[implies_2])])])])).
0.19/0.39	fof(c_0_17, plain, ![X186]:((~is_a_theorem(strict_implies(esk85_0,and(esk85_0,esk85_0)))|axiom_m4)&(~axiom_m4|is_a_theorem(strict_implies(X186,and(X186,X186))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m4])])])])).
0.19/0.39	fof(c_0_18, negated_conjecture, ~axiom_m4, inference(fof_simplification,[status(thm)],[c_0_12])).
0.19/0.39	cnf(c_0_19, plain, (is_a_theorem(necessarily(X1))|~necessitation|~is_a_theorem(X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
0.19/0.39	cnf(c_0_20, plain, (necessitation), inference(split_conjunct,[status(thm)],[km5_necessitation])).
0.19/0.39	cnf(c_0_21, plain, (necessarily(implies(X1,X2))=strict_implies(X1,X2)|~op_strict_implies), inference(split_conjunct,[status(thm)],[c_0_14])).
0.19/0.39	cnf(c_0_22, plain, (op_strict_implies), inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies])).
0.19/0.39	cnf(c_0_23, plain, (is_a_theorem(X2)|~modus_ponens|~is_a_theorem(X1)|~is_a_theorem(implies(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_15])).
0.19/0.39	cnf(c_0_24, plain, (modus_ponens), inference(split_conjunct,[status(thm)],[hilbert_modus_ponens])).
0.19/0.39	cnf(c_0_25, plain, (is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|~implies_2), inference(split_conjunct,[status(thm)],[c_0_16])).
0.19/0.39	cnf(c_0_26, plain, (implies_2), inference(split_conjunct,[status(thm)],[hilbert_implies_2])).
0.19/0.39	fof(c_0_27, plain, ![X9, X10]:((~is_a_theorem(implies(esk1_0,implies(esk2_0,and(esk1_0,esk2_0))))|and_3)&(~and_3|is_a_theorem(implies(X9,implies(X10,and(X9,X10)))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_3])])])])).
0.19/0.39	cnf(c_0_28, plain, (axiom_m4|~is_a_theorem(strict_implies(esk85_0,and(esk85_0,esk85_0)))), inference(split_conjunct,[status(thm)],[c_0_17])).
0.19/0.39	cnf(c_0_29, negated_conjecture, (~axiom_m4), inference(split_conjunct,[status(thm)],[c_0_18])).
0.19/0.39	cnf(c_0_30, plain, (is_a_theorem(necessarily(X1))|~is_a_theorem(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19, c_0_20])])).
0.19/0.39	cnf(c_0_31, plain, (necessarily(implies(X1,X2))=strict_implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_22])])).
0.19/0.39	cnf(c_0_32, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23, c_0_24])])).
0.19/0.39	cnf(c_0_33, plain, (is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25, c_0_26])])).
0.19/0.39	cnf(c_0_34, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|~and_3), inference(split_conjunct,[status(thm)],[c_0_27])).
0.19/0.39	cnf(c_0_35, plain, (and_3), inference(split_conjunct,[status(thm)],[hilbert_and_3])).
0.19/0.39	cnf(c_0_36, plain, (~is_a_theorem(strict_implies(esk85_0,and(esk85_0,esk85_0)))), inference(sr,[status(thm)],[c_0_28, c_0_29])).
0.19/0.39	cnf(c_0_37, plain, (is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(implies(X1,X2))), inference(spm,[status(thm)],[c_0_30, c_0_31])).
0.19/0.39	cnf(c_0_38, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,implies(X1,X2)))), inference(spm,[status(thm)],[c_0_32, c_0_33])).
0.19/0.39	cnf(c_0_39, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34, c_0_35])])).
0.19/0.39	cnf(c_0_40, plain, (~is_a_theorem(implies(esk85_0,and(esk85_0,esk85_0)))), inference(spm,[status(thm)],[c_0_36, c_0_37])).
0.19/0.39	cnf(c_0_41, plain, (is_a_theorem(implies(X1,and(X1,X1)))), inference(spm,[status(thm)],[c_0_38, c_0_39])).
0.19/0.39	cnf(c_0_42, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40, c_0_41])]), ['proof']).
0.19/0.39	# SZS output end CNFRefutation
0.19/0.39	# Proof object total steps             : 43
0.19/0.39	# Proof object clause steps            : 23
0.19/0.39	# Proof object formula steps           : 20
0.19/0.39	# Proof object conjectures             : 4
0.19/0.39	# Proof object clause conjectures      : 1
0.19/0.39	# Proof object formula conjectures     : 3
0.19/0.39	# Proof object initial clauses used    : 12
0.19/0.39	# Proof object initial formulas used   : 12
0.19/0.39	# Proof object generating inferences   : 4
0.19/0.39	# Proof object simplifying inferences  : 13
0.19/0.39	# Training examples: 0 positive, 0 negative
0.19/0.39	# Parsed axioms                        : 88
0.19/0.39	# Removed by relevancy pruning/SinE    : 0
0.19/0.39	# Initial clauses                      : 146
0.19/0.39	# Removed in clause preprocessing      : 0
0.19/0.39	# Initial clauses in saturation        : 146
0.19/0.39	# Processed clauses                    : 386
0.19/0.39	# ...of these trivial                  : 30
0.19/0.39	# ...subsumed                          : 40
0.19/0.39	# ...remaining for further processing  : 316
0.19/0.39	# Other redundant clauses eliminated   : 0
0.19/0.39	# Clauses deleted for lack of memory   : 0
0.19/0.39	# Backward-subsumed                    : 4
0.19/0.39	# Backward-rewritten                   : 9
0.19/0.39	# Generated clauses                    : 400
0.19/0.39	# ...of the previous two non-trivial   : 377
0.19/0.39	# Contextual simplify-reflections      : 0
0.19/0.39	# Paramodulations                      : 400
0.19/0.39	# Factorizations                       : 0
0.19/0.39	# Equation resolutions                 : 0
0.19/0.39	# Propositional unsat checks           : 0
0.19/0.39	#    Propositional check models        : 0
0.19/0.39	#    Propositional check unsatisfiable : 0
0.19/0.39	#    Propositional clauses             : 0
0.19/0.39	#    Propositional clauses after purity: 0
0.19/0.39	#    Propositional unsat core size     : 0
0.19/0.39	#    Propositional preprocessing time  : 0.000
0.19/0.39	#    Propositional encoding time       : 0.000
0.19/0.39	#    Propositional solver time         : 0.000
0.19/0.39	#    Success case prop preproc time    : 0.000
0.19/0.39	#    Success case prop encoding time   : 0.000
0.19/0.39	#    Success case prop solver time     : 0.000
0.19/0.39	# Current number of processed clauses  : 188
0.19/0.39	#    Positive orientable unit clauses  : 65
0.19/0.39	#    Positive unorientable unit clauses: 0
0.19/0.39	#    Negative unit clauses             : 4
0.19/0.39	#    Non-unit-clauses                  : 119
0.19/0.39	# Current number of unprocessed clauses: 249
0.19/0.39	# ...number of literals in the above   : 562
0.19/0.39	# Current number of archived formulas  : 0
0.19/0.39	# Current number of archived clauses   : 128
0.19/0.39	# Clause-clause subsumption calls (NU) : 2104
0.19/0.39	# Rec. Clause-clause subsumption calls : 1678
0.19/0.39	# Non-unit clause-clause subsumptions  : 42
0.19/0.39	# Unit Clause-clause subsumption calls : 258
0.19/0.39	# Rewrite failures with RHS unbound    : 0
0.19/0.39	# BW rewrite match attempts            : 109
0.19/0.39	# BW rewrite match successes           : 10
0.19/0.39	# Condensation attempts                : 0
0.19/0.39	# Condensation successes               : 0
0.19/0.39	# Termbank termtop insertions          : 14123
0.19/0.39	
0.19/0.39	# -------------------------------------------------
0.19/0.39	# User time                : 0.054 s
0.19/0.39	# System time              : 0.006 s
0.19/0.39	# Total time               : 0.060 s
0.19/0.39	# Maximum resident set size: 1688 pages
0.19/0.39	EOF