0.10/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.13	% Command    : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s
0.13/0.34	% Computer   : n024.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 180
0.13/0.34	% DateTime   : Thu Aug 29 09:11:35 EDT 2019
0.13/0.34	% CPUTime    : 
0.13/0.34	# Version: 2.4_pre003
0.13/0.35	# No SInE strategy applied
0.13/0.35	# Trying AutoSched0 for 90 seconds
0.47/0.65	# AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YA
0.47/0.65	# and selection function SelectMaxLComplexAvoidPosPred.
0.47/0.65	#
0.47/0.65	# Preprocessing time       : 0.033 s
0.47/0.65	# Presaturation interreduction done
0.47/0.65	
0.47/0.65	# Proof found!
0.47/0.65	# SZS status Theorem
0.47/0.65	# SZS output start CNFRefutation
0.47/0.65	fof(nota_uns_thm, conjecture, nota(uns,thm), file('/export/starexec/sandbox/benchmark/theBenchmark.p', nota_uns_thm)).
0.47/0.65	fof(nota, axiom, ![X7, X8]:(?[X1, X2]:(~(status(X1,X2,X8))&status(X1,X2,X7))<=>nota(X7,X8)), file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax', nota)).
0.47/0.65	fof(uns, axiom, ![X1, X2]:((![X3]:model(X3,not(X2))&![X4]:model(X4,X1))<=>status(X1,X2,uns)), file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax', uns)).
0.47/0.65	fof(thm, axiom, ![X1, X2]:(![X4]:(model(X4,X1)=>model(X4,X2))<=>status(X1,X2,thm)), file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax', thm)).
0.47/0.65	fof(not, axiom, ![X9, X10]:(model(X9,X10)<=>~(model(X9,not(X10)))), file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax', not)).
0.47/0.65	fof(tautology, axiom, ?[X10]:![X9]:model(X9,X10), file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax', tautology)).
0.47/0.65	fof(contradiction, axiom, ?[X10]:![X9]:~(model(X9,X10)), file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax', contradiction)).
0.47/0.65	fof(c_0_7, negated_conjecture, ~(nota(uns,thm)), inference(assume_negation,[status(cth)],[nota_uns_thm])).
0.47/0.65	fof(c_0_8, negated_conjecture, ~nota(uns,thm), inference(fof_simplification,[status(thm)],[c_0_7])).
0.47/0.65	fof(c_0_9, plain, ![X222, X223, X224, X225, X226, X227]:((status(X224,X225,X223)|~status(X224,X225,X222)|nota(X222,X223))&((~status(esk66_2(X226,X227),esk67_2(X226,X227),X227)|~nota(X226,X227))&(status(esk66_2(X226,X227),esk67_2(X226,X227),X226)|~nota(X226,X227)))), 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)],[nota])])])])])])])).
0.47/0.65	cnf(c_0_10, negated_conjecture, (~nota(uns,thm)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.47/0.65	cnf(c_0_11, plain, (status(X1,X2,X3)|nota(X4,X3)|~status(X1,X2,X4)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.47/0.65	fof(c_0_12, plain, ![X49, X50, X53, X54, X55, X56]:((~model(esk12_2(X49,X50),not(X50))|~model(esk13_2(X49,X50),X49)|status(X49,X50,uns))&((model(X55,not(X54))|~status(X53,X54,uns))&(model(X56,X53)|~status(X53,X54,uns)))), 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)],[uns])])])])])])).
0.47/0.65	fof(c_0_13, 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.47/0.65	cnf(c_0_14, negated_conjecture, (status(X1,X2,thm)|~status(X1,X2,uns)), inference(spm,[status(thm)],[c_0_10, c_0_11])).
0.47/0.65	cnf(c_0_15, plain, (status(X1,X2,uns)|~model(esk12_2(X1,X2),not(X2))|~model(esk13_2(X1,X2),X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
0.47/0.65	cnf(c_0_16, plain, (model(X1,X2)|~status(X2,X3,uns)), inference(split_conjunct,[status(thm)],[c_0_12])).
0.47/0.65	cnf(c_0_17, plain, (model(X3,X2)|~status(X1,X2,thm)|~model(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
0.47/0.65	cnf(c_0_18, negated_conjecture, (status(X1,X2,thm)|~model(esk12_2(X1,X2),not(X2))|~model(esk13_2(X1,X2),X1)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
0.47/0.65	cnf(c_0_19, plain, (model(X1,X2)|~model(esk12_2(X2,X3),not(X3))|~model(esk13_2(X2,X3),X2)), inference(spm,[status(thm)],[c_0_16, c_0_15])).
0.47/0.65	fof(c_0_20, plain, ![X195, X196]:((~model(X195,X196)|~model(X195,not(X196)))&(model(X195,not(X196))|model(X195,X196))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[not])])])).
0.47/0.65	cnf(c_0_21, negated_conjecture, (model(X1,X2)|~model(esk12_2(X3,X2),not(X2))|~model(esk13_2(X3,X2),X3)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19])).
0.47/0.65	cnf(c_0_22, plain, (model(X1,not(X2))|model(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_20])).
0.47/0.65	fof(c_0_23, plain, ![X198]:model(X198,esk51_0), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[tautology])])).
0.47/0.65	fof(c_0_24, plain, ![X239]:~model(X239,esk70_0), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[contradiction])])])).
0.47/0.65	cnf(c_0_25, negated_conjecture, (model(esk12_2(X1,X2),X2)|model(X3,X2)|~model(esk13_2(X1,X2),X1)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.47/0.65	cnf(c_0_26, plain, (model(X1,esk51_0)), inference(split_conjunct,[status(thm)],[c_0_23])).
0.47/0.65	cnf(c_0_27, plain, (~model(X1,esk70_0)), inference(split_conjunct,[status(thm)],[c_0_24])).
0.47/0.65	cnf(c_0_28, negated_conjecture, (model(esk12_2(esk51_0,X1),X1)|model(X2,X1)), inference(spm,[status(thm)],[c_0_25, c_0_26])).
0.47/0.65	cnf(c_0_29, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_27]), ['proof']).
0.47/0.65	# SZS output end CNFRefutation
0.47/0.65	# Proof object total steps             : 30
0.47/0.65	# Proof object clause steps            : 15
0.47/0.65	# Proof object formula steps           : 15
0.47/0.65	# Proof object conjectures             : 10
0.47/0.65	# Proof object clause conjectures      : 7
0.47/0.65	# Proof object formula conjectures     : 3
0.47/0.65	# Proof object initial clauses used    : 8
0.47/0.65	# Proof object initial formulas used   : 7
0.47/0.65	# Proof object generating inferences   : 7
0.47/0.65	# Proof object simplifying inferences  : 2
0.47/0.65	# Training examples: 0 positive, 0 negative
0.47/0.65	# Parsed axioms                        : 33
0.47/0.65	# Removed by relevancy pruning/SinE    : 0
0.47/0.65	# Initial clauses                      : 109
0.47/0.65	# Removed in clause preprocessing      : 0
0.47/0.65	# Initial clauses in saturation        : 109
0.47/0.65	# Processed clauses                    : 3306
0.47/0.65	# ...of these trivial                  : 1583
0.47/0.65	# ...subsumed                          : 959
0.47/0.65	# ...remaining for further processing  : 764
0.47/0.65	# Other redundant clauses eliminated   : 0
0.47/0.65	# Clauses deleted for lack of memory   : 0
0.47/0.65	# Backward-subsumed                    : 0
0.47/0.65	# Backward-rewritten                   : 0
0.47/0.65	# Generated clauses                    : 35511
0.47/0.65	# ...of the previous two non-trivial   : 32244
0.47/0.65	# Contextual simplify-reflections      : 1
0.47/0.65	# Paramodulations                      : 35475
0.47/0.65	# Factorizations                       : 36
0.47/0.65	# Equation resolutions                 : 0
0.47/0.65	# Propositional unsat checks           : 0
0.47/0.65	#    Propositional check models        : 0
0.47/0.65	#    Propositional check unsatisfiable : 0
0.47/0.65	#    Propositional clauses             : 0
0.47/0.65	#    Propositional clauses after purity: 0
0.47/0.65	#    Propositional unsat core size     : 0
0.47/0.65	#    Propositional preprocessing time  : 0.000
0.47/0.65	#    Propositional encoding time       : 0.000
0.47/0.65	#    Propositional solver time         : 0.000
0.47/0.65	#    Success case prop preproc time    : 0.000
0.47/0.65	#    Success case prop encoding time   : 0.000
0.47/0.65	#    Success case prop solver time     : 0.000
0.47/0.65	# Current number of processed clauses  : 657
0.47/0.65	#    Positive orientable unit clauses  : 197
0.47/0.65	#    Positive unorientable unit clauses: 0
0.47/0.65	#    Negative unit clauses             : 6
0.47/0.65	#    Non-unit-clauses                  : 454
0.47/0.65	# Current number of unprocessed clauses: 29111
0.47/0.65	# ...number of literals in the above   : 98593
0.47/0.65	# Current number of archived formulas  : 0
0.47/0.65	# Current number of archived clauses   : 107
0.47/0.65	# Clause-clause subsumption calls (NU) : 49311
0.47/0.65	# Rec. Clause-clause subsumption calls : 21922
0.47/0.65	# Non-unit clause-clause subsumptions  : 956
0.47/0.65	# Unit Clause-clause subsumption calls : 8524
0.47/0.65	# Rewrite failures with RHS unbound    : 0
0.47/0.65	# BW rewrite match attempts            : 0
0.47/0.65	# BW rewrite match successes           : 0
0.47/0.65	# Condensation attempts                : 0
0.47/0.65	# Condensation successes               : 0
0.47/0.65	# Termbank termtop insertions          : 496066
0.47/0.65	
0.47/0.65	# -------------------------------------------------
0.47/0.65	# User time                : 0.289 s
0.47/0.65	# System time              : 0.021 s
0.47/0.65	# Total time               : 0.310 s
0.47/0.65	# Maximum resident set size: 1636 pages
0.47/0.65	EOF