0.07/0.14	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.15	% Command    : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s
0.15/0.36	% Computer   : n014.cluster.edu
0.15/0.36	% Model      : x86_64 x86_64
0.15/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.36	% Memory     : 8042.1875MB
0.15/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.37	% CPULimit   : 180
0.15/0.37	% DateTime   : Thu Aug 29 11:02:39 EDT 2019
0.15/0.37	% CPUTime    : 
0.15/0.37	# Version: 2.4_pre003
0.15/0.38	# No SInE strategy applied
0.15/0.38	# Trying AutoSched0 for 90 seconds
0.47/0.64	# AutoSched0-Mode selected heuristic H_____102_C18_F1_PI_AE_CS_SP_PS_S0Y
0.47/0.64	# and selection function SelectMaxLComplexAvoidPosPred.
0.47/0.64	#
0.47/0.64	# Preprocessing time       : 0.078 s
0.47/0.64	# Presaturation interreduction done
0.47/0.64	
0.47/0.64	# Proof found!
0.47/0.64	# SZS status Theorem
0.47/0.64	# SZS output start CNFRefutation
0.47/0.64	fof('qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))', axiom, ![X203, X204, X205, X206, X207]:(((((((vf(X205,X203)=vf(X205,X204)&rcenter(X205,X206))&?[X208]:(X208=X203&rpoint(X208)))&?[X209]:(rpoint(X209)&X204=X209))&rcenter(X205,X207))&ron(X203,X206))&ron(X204,X207))=>X207=X206), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))')).
0.47/0.64	fof('qu(theu(the(231), 1), imp(the(231)))', conjecture, ![X174]:(((rcircle(X174)&rcenter(vd1089,X174))&ron(vd1096,X174))=>X174=vd1102), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'qu(theu(the(231), 1), imp(the(231)))')).
0.47/0.64	fof('pred(229, 0)', axiom, rpoint(vd1096), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'pred(229, 0)')).
0.47/0.64	fof('and(pred(comma_conjunct2(the(231)), 0), and(pred(comma_conjunct1(the(231)), 0), pred(the(231), 0)))', axiom, ((rcenter(vd1089,vd1102)&rcircle(vd1102))&ron(vd1096,vd1102)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'and(pred(comma_conjunct2(the(231)), 0), and(pred(comma_conjunct1(the(231)), 0), pred(the(231), 0)))')).
0.47/0.64	fof(c_0_4, plain, ![X936, X937, X938, X939, X940, X941, X942]:(vf(X938,X936)!=vf(X938,X937)|~rcenter(X938,X939)|(X941!=X936|~rpoint(X941))|(~rpoint(X942)|X937!=X942)|~rcenter(X938,X940)|~ron(X936,X939)|~ron(X937,X940)|X940=X939), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))'])])])).
0.47/0.64	fof(c_0_5, negated_conjecture, ~(![X174]:(((rcircle(X174)&rcenter(vd1089,X174))&ron(vd1096,X174))=>X174=vd1102)), inference(assume_negation,[status(cth)],['qu(theu(the(231), 1), imp(the(231)))'])).
0.47/0.64	cnf(c_0_6, plain, (X7=X4|vf(X1,X2)!=vf(X1,X3)|~rcenter(X1,X4)|X5!=X2|~rpoint(X5)|~rpoint(X6)|X3!=X6|~rcenter(X1,X7)|~ron(X2,X4)|~ron(X3,X7)), inference(split_conjunct,[status(thm)],[c_0_4])).
0.47/0.64	fof(c_0_7, negated_conjecture, (((rcircle(esk47_0)&rcenter(vd1089,esk47_0))&ron(vd1096,esk47_0))&esk47_0!=vd1102), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
0.47/0.64	cnf(c_0_8, plain, (X1=X2|vf(X3,X4)!=vf(X3,X5)|~rpoint(X5)|~rpoint(X4)|~ron(X5,X2)|~ron(X4,X1)|~rcenter(X3,X2)|~rcenter(X3,X1)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_6])])).
0.47/0.64	cnf(c_0_9, negated_conjecture, (ron(vd1096,esk47_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.47/0.64	cnf(c_0_10, plain, (rpoint(vd1096)), inference(split_conjunct,[status(thm)],['pred(229, 0)'])).
0.47/0.64	cnf(c_0_11, negated_conjecture, (X1=esk47_0|vf(X2,X3)!=vf(X2,vd1096)|~rpoint(X3)|~ron(X3,X1)|~rcenter(X2,esk47_0)|~rcenter(X2,X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])])).
0.47/0.64	cnf(c_0_12, negated_conjecture, (rcenter(vd1089,esk47_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.47/0.64	cnf(c_0_13, negated_conjecture, (X1=esk47_0|vf(vd1089,X2)!=vf(vd1089,vd1096)|~rpoint(X2)|~ron(X2,X1)|~rcenter(vd1089,X1)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.47/0.64	cnf(c_0_14, plain, (rcenter(vd1089,vd1102)), inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(231)), 0), and(pred(comma_conjunct1(the(231)), 0), pred(the(231), 0)))'])).
0.47/0.64	cnf(c_0_15, negated_conjecture, (esk47_0!=vd1102), inference(split_conjunct,[status(thm)],[c_0_7])).
0.47/0.64	cnf(c_0_16, negated_conjecture, (vf(vd1089,X1)!=vf(vd1089,vd1096)|~rpoint(X1)|~ron(X1,vd1102)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15])).
0.47/0.64	cnf(c_0_17, plain, (ron(vd1096,vd1102)), inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(231)), 0), and(pred(comma_conjunct1(the(231)), 0), pred(the(231), 0)))'])).
0.47/0.64	cnf(c_0_18, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_16]), c_0_10]), c_0_17])]), ['proof']).
0.47/0.64	# SZS output end CNFRefutation
0.47/0.64	# Proof object total steps             : 19
0.47/0.64	# Proof object clause steps            : 12
0.47/0.64	# Proof object formula steps           : 7
0.47/0.64	# Proof object conjectures             : 10
0.47/0.64	# Proof object clause conjectures      : 7
0.47/0.64	# Proof object formula conjectures     : 3
0.47/0.64	# Proof object initial clauses used    : 7
0.47/0.64	# Proof object initial formulas used   : 4
0.47/0.64	# Proof object generating inferences   : 4
0.47/0.64	# Proof object simplifying inferences  : 8
0.47/0.64	# Training examples: 0 positive, 0 negative
0.47/0.64	# Parsed axioms                        : 130
0.47/0.64	# Removed by relevancy pruning/SinE    : 0
0.47/0.64	# Initial clauses                      : 289
0.47/0.64	# Removed in clause preprocessing      : 2
0.47/0.64	# Initial clauses in saturation        : 287
0.47/0.64	# Processed clauses                    : 1260
0.47/0.64	# ...of these trivial                  : 6
0.47/0.64	# ...subsumed                          : 225
0.47/0.64	# ...remaining for further processing  : 1029
0.47/0.64	# Other redundant clauses eliminated   : 1094
0.47/0.64	# Clauses deleted for lack of memory   : 0
0.47/0.64	# Backward-subsumed                    : 1
0.47/0.64	# Backward-rewritten                   : 13
0.47/0.64	# Generated clauses                    : 2417
0.47/0.64	# ...of the previous two non-trivial   : 2352
0.47/0.64	# Contextual simplify-reflections      : 24
0.47/0.64	# Paramodulations                      : 2166
0.47/0.64	# Factorizations                       : 0
0.47/0.64	# Equation resolutions                 : 1110
0.47/0.64	# Propositional unsat checks           : 0
0.47/0.64	#    Propositional check models        : 0
0.47/0.64	#    Propositional check unsatisfiable : 0
0.47/0.64	#    Propositional clauses             : 0
0.47/0.64	#    Propositional clauses after purity: 0
0.47/0.64	#    Propositional unsat core size     : 0
0.47/0.64	#    Propositional preprocessing time  : 0.000
0.47/0.64	#    Propositional encoding time       : 0.000
0.47/0.64	#    Propositional solver time         : 0.000
0.47/0.64	#    Success case prop preproc time    : 0.000
0.47/0.64	#    Success case prop encoding time   : 0.000
0.47/0.64	#    Success case prop solver time     : 0.000
0.47/0.64	# Current number of processed clauses  : 495
0.47/0.64	#    Positive orientable unit clauses  : 46
0.47/0.64	#    Positive unorientable unit clauses: 0
0.47/0.64	#    Negative unit clauses             : 20
0.47/0.64	#    Non-unit-clauses                  : 429
0.47/0.64	# Current number of unprocessed clauses: 1560
0.47/0.64	# ...number of literals in the above   : 20847
0.47/0.64	# Current number of archived formulas  : 0
0.47/0.64	# Current number of archived clauses   : 299
0.47/0.64	# Clause-clause subsumption calls (NU) : 266023
0.47/0.64	# Rec. Clause-clause subsumption calls : 9310
0.47/0.64	# Non-unit clause-clause subsumptions  : 179
0.47/0.64	# Unit Clause-clause subsumption calls : 2301
0.47/0.64	# Rewrite failures with RHS unbound    : 0
0.47/0.64	# BW rewrite match attempts            : 4
0.47/0.64	# BW rewrite match successes           : 4
0.47/0.64	# Condensation attempts                : 0
0.47/0.64	# Condensation successes               : 0
0.47/0.64	# Termbank termtop insertions          : 120932
0.47/0.64	
0.47/0.64	# -------------------------------------------------
0.47/0.64	# User time                : 0.261 s
0.47/0.64	# System time              : 0.011 s
0.47/0.64	# Total time               : 0.272 s
0.47/0.64	# Maximum resident set size: 2568 pages
0.47/0.64	EOF