0.03/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.14	% Command    : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s
0.14/0.35	% Computer   : n022.cluster.edu
0.14/0.35	% Model      : x86_64 x86_64
0.14/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory     : 8042.1875MB
0.14/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 180
0.14/0.35	% DateTime   : Thu Aug 29 09:17:28 EDT 2019
0.14/0.35	% CPUTime    : 
0.14/0.35	# Version: 2.4_pre003
0.14/0.35	# No SInE strategy applied
0.14/0.35	# Trying AutoSched0 for 90 seconds
0.21/0.41	# AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YA
0.21/0.41	# and selection function SelectMaxLComplexAvoidPosPred.
0.21/0.41	#
0.21/0.41	# Preprocessing time       : 0.033 s
0.21/0.41	# Presaturation interreduction done
0.21/0.41	
0.21/0.41	# Proof found!
0.21/0.41	# SZS status Theorem
0.21/0.41	# SZS output start CNFRefutation
0.21/0.41	fof(isa_eqv_thm, conjecture, isa(eqv,thm), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', isa_eqv_thm)).
0.21/0.41	fof(isa, axiom, ![X7, X8]:(![X1, X2]:(status(X1,X2,X7)=>status(X1,X2,X8))<=>isa(X7,X8)), file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax', isa)).
0.21/0.41	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.21/0.41	fof(eqv, axiom, ![X1, X2]:(status(X1,X2,eqv)<=>(?[X4]:model(X4,X1)&![X3]:(model(X3,X1)<=>model(X3,X2)))), file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax', eqv)).
0.21/0.41	fof(c_0_4, negated_conjecture, ~(isa(eqv,thm)), inference(assume_negation,[status(cth)],[isa_eqv_thm])).
0.21/0.41	fof(c_0_5, negated_conjecture, ~isa(eqv,thm), inference(fof_simplification,[status(thm)],[c_0_4])).
0.21/0.41	fof(c_0_6, plain, ![X230, X231, X234, X235, X236, X237]:(((status(esk68_2(X230,X231),esk69_2(X230,X231),X230)|isa(X230,X231))&(~status(esk68_2(X230,X231),esk69_2(X230,X231),X231)|isa(X230,X231)))&(~isa(X234,X235)|(~status(X236,X237,X234)|status(X236,X237,X235)))), 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)],[isa])])])])])])).
0.21/0.41	cnf(c_0_7, negated_conjecture, (~isa(eqv,thm)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.21/0.41	cnf(c_0_8, plain, (isa(X1,X2)|~status(esk68_2(X1,X2),esk69_2(X1,X2),X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.21/0.41	fof(c_0_9, plain, ![X112, X113, X115, X116, X117]:(((model(esk29_2(X112,X113),X112)|status(X112,X113,thm))&(~model(esk29_2(X112,X113),X113)|status(X112,X113,thm)))&(~status(X115,X116,thm)|(~model(X117,X115)|model(X117,X116)))), 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)],[thm])])])])])])).
0.21/0.41	fof(c_0_10, plain, ![X164, X165, X167, X168, X169, X170, X171]:(((model(esk41_2(X164,X165),X164)|~status(X164,X165,eqv))&((~model(X167,X164)|model(X167,X165)|~status(X164,X165,eqv))&(~model(X168,X165)|model(X168,X164)|~status(X164,X165,eqv))))&((~model(esk42_2(X169,X170),X169)|~model(esk42_2(X169,X170),X170)|~model(X171,X169)|status(X169,X170,eqv))&(model(esk42_2(X169,X170),X169)|model(esk42_2(X169,X170),X170)|~model(X171,X169)|status(X169,X170,eqv)))), 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)],[eqv])])])])])])).
0.21/0.41	cnf(c_0_11, plain, (status(esk68_2(X1,X2),esk69_2(X1,X2),X1)|isa(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.21/0.41	cnf(c_0_12, negated_conjecture, (~status(esk68_2(eqv,thm),esk69_2(eqv,thm),thm)), inference(spm,[status(thm)],[c_0_7, c_0_8])).
0.21/0.41	cnf(c_0_13, plain, (status(X1,X2,thm)|~model(esk29_2(X1,X2),X2)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.21/0.41	cnf(c_0_14, plain, (model(X1,X3)|~model(X1,X2)|~status(X2,X3,eqv)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.21/0.41	cnf(c_0_15, negated_conjecture, (status(esk68_2(eqv,thm),esk69_2(eqv,thm),eqv)), inference(spm,[status(thm)],[c_0_7, c_0_11])).
0.21/0.41	cnf(c_0_16, plain, (model(esk29_2(X1,X2),X1)|status(X1,X2,thm)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.21/0.41	cnf(c_0_17, negated_conjecture, (~model(esk29_2(esk68_2(eqv,thm),esk69_2(eqv,thm)),esk69_2(eqv,thm))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
0.21/0.41	cnf(c_0_18, negated_conjecture, (model(X1,esk69_2(eqv,thm))|~model(X1,esk68_2(eqv,thm))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
0.21/0.41	cnf(c_0_19, negated_conjecture, (model(esk29_2(esk68_2(eqv,thm),esk69_2(eqv,thm)),esk68_2(eqv,thm))), inference(spm,[status(thm)],[c_0_12, c_0_16])).
0.21/0.41	cnf(c_0_20, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19])]), ['proof']).
0.21/0.41	# SZS output end CNFRefutation
0.21/0.41	# Proof object total steps             : 21
0.21/0.41	# Proof object clause steps            : 12
0.21/0.41	# Proof object formula steps           : 9
0.21/0.41	# Proof object conjectures             : 10
0.21/0.41	# Proof object clause conjectures      : 7
0.21/0.41	# Proof object formula conjectures     : 3
0.21/0.41	# Proof object initial clauses used    : 6
0.21/0.41	# Proof object initial formulas used   : 4
0.21/0.41	# Proof object generating inferences   : 6
0.21/0.41	# Proof object simplifying inferences  : 2
0.21/0.41	# Training examples: 0 positive, 0 negative
0.21/0.41	# Parsed axioms                        : 33
0.21/0.41	# Removed by relevancy pruning/SinE    : 0
0.21/0.41	# Initial clauses                      : 109
0.21/0.41	# Removed in clause preprocessing      : 0
0.21/0.41	# Initial clauses in saturation        : 109
0.21/0.41	# Processed clauses                    : 328
0.21/0.41	# ...of these trivial                  : 20
0.21/0.41	# ...subsumed                          : 34
0.21/0.41	# ...remaining for further processing  : 274
0.21/0.41	# Other redundant clauses eliminated   : 0
0.21/0.41	# Clauses deleted for lack of memory   : 0
0.21/0.41	# Backward-subsumed                    : 0
0.21/0.41	# Backward-rewritten                   : 0
0.21/0.41	# Generated clauses                    : 845
0.21/0.41	# ...of the previous two non-trivial   : 769
0.21/0.41	# Contextual simplify-reflections      : 0
0.21/0.41	# Paramodulations                      : 845
0.21/0.41	# Factorizations                       : 0
0.21/0.41	# Equation resolutions                 : 0
0.21/0.41	# Propositional unsat checks           : 0
0.21/0.41	#    Propositional check models        : 0
0.21/0.41	#    Propositional check unsatisfiable : 0
0.21/0.41	#    Propositional clauses             : 0
0.21/0.41	#    Propositional clauses after purity: 0
0.21/0.41	#    Propositional unsat core size     : 0
0.21/0.41	#    Propositional preprocessing time  : 0.000
0.21/0.41	#    Propositional encoding time       : 0.000
0.21/0.41	#    Propositional solver time         : 0.000
0.21/0.41	#    Success case prop preproc time    : 0.000
0.21/0.41	#    Success case prop encoding time   : 0.000
0.21/0.41	#    Success case prop solver time     : 0.000
0.21/0.41	# Current number of processed clauses  : 167
0.21/0.41	#    Positive orientable unit clauses  : 42
0.21/0.41	#    Positive unorientable unit clauses: 0
0.21/0.41	#    Negative unit clauses             : 8
0.21/0.41	#    Non-unit-clauses                  : 117
0.21/0.41	# Current number of unprocessed clauses: 657
0.21/0.41	# ...number of literals in the above   : 1570
0.21/0.41	# Current number of archived formulas  : 0
0.21/0.41	# Current number of archived clauses   : 107
0.21/0.41	# Clause-clause subsumption calls (NU) : 3551
0.21/0.41	# Rec. Clause-clause subsumption calls : 2234
0.21/0.41	# Non-unit clause-clause subsumptions  : 34
0.21/0.41	# Unit Clause-clause subsumption calls : 374
0.21/0.41	# Rewrite failures with RHS unbound    : 0
0.21/0.41	# BW rewrite match attempts            : 0
0.21/0.41	# BW rewrite match successes           : 0
0.21/0.41	# Condensation attempts                : 0
0.21/0.41	# Condensation successes               : 0
0.21/0.41	# Termbank termtop insertions          : 17755
0.21/0.41	
0.21/0.41	# -------------------------------------------------
0.21/0.41	# User time                : 0.047 s
0.21/0.41	# System time              : 0.009 s
0.21/0.41	# Total time               : 0.056 s
0.21/0.41	# Maximum resident set size: 1636 pages
0.21/0.41	EOF