0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/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   : n011.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:09:12 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.38/0.61	# AutoSched0-Mode selected heuristic H_____102_C18_F1_PI_AE_CS_SP_PS_S0Y
0.38/0.61	# and selection function SelectMaxLComplexAvoidPosPred.
0.38/0.61	#
0.38/0.61	# Preprocessing time       : 0.069 s
0.38/0.61	# Presaturation interreduction done
0.38/0.61	
0.38/0.61	# Proof found!
0.38/0.61	# SZS status Theorem
0.38/0.61	# SZS output start CNFRefutation
0.38/0.61	fof('qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))', axiom, ![X1, X2, X3, X4, X5]:(((((((ron(X2,X5)&rcenter(X3,X5))&rcenter(X3,X4))&?[X6]:(X2=X6&rpoint(X6)))&?[X7]:(rpoint(X7)&X7=X1))&ron(X1,X4))&vf(X3,X2)=vf(X3,X1))=>X5=X4), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))')).
0.38/0.61	fof('qu(theu(the(211), 1), imp(the(211)))', conjecture, ![X612]:(((ron(vd1057,X612)&rcenter(vd1055,X612))&rcircle(X612))=>X612=vd1061), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'qu(theu(the(211), 1), imp(the(211)))')).
0.38/0.61	fof('and(pred(comma_conjunct2(the(211)), 0), and(pred(comma_conjunct1(the(211)), 0), pred(the(211), 0)))', axiom, ((ron(vd1057,vd1061)&rcircle(vd1061))&rcenter(vd1055,vd1061)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'and(pred(comma_conjunct2(the(211)), 0), and(pred(comma_conjunct1(the(211)), 0), pred(the(211), 0)))')).
0.38/0.61	fof('and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))', axiom, ((((rpoint(vd1058)&vd1055=vd1056)&rpoint(vd1056))&vd1057!=vd1055)&vd1057=vd1058), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))')).
0.38/0.61	fof(c_0_4, plain, ![X728, X729, X730, X731, X732, X733, X734]:(~ron(X729,X732)|~rcenter(X730,X732)|~rcenter(X730,X731)|(X729!=X733|~rpoint(X733))|(~rpoint(X734)|X734!=X728)|~ron(X728,X731)|vf(X730,X729)!=vf(X730,X728)|X732=X731), 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.38/0.61	fof(c_0_5, negated_conjecture, ~(![X612]:(((ron(vd1057,X612)&rcenter(vd1055,X612))&rcircle(X612))=>X612=vd1061)), inference(assume_negation,[status(cth)],['qu(theu(the(211), 1), imp(the(211)))'])).
0.38/0.61	cnf(c_0_6, plain, (X2=X4|~ron(X1,X2)|~rcenter(X3,X2)|~rcenter(X3,X4)|X1!=X5|~rpoint(X5)|~rpoint(X6)|X6!=X7|~ron(X7,X4)|vf(X3,X1)!=vf(X3,X7)), inference(split_conjunct,[status(thm)],[c_0_4])).
0.38/0.61	fof(c_0_7, negated_conjecture, (((ron(vd1057,esk43_0)&rcenter(vd1055,esk43_0))&rcircle(esk43_0))&esk43_0!=vd1061), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
0.38/0.61	cnf(c_0_8, plain, (X1=X2|vf(X3,X4)!=vf(X3,X5)|~rcenter(X3,X2)|~rcenter(X3,X1)|~ron(X5,X2)|~ron(X4,X1)|~rpoint(X5)|~rpoint(X4)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_6])])).
0.38/0.61	cnf(c_0_9, negated_conjecture, (rcenter(vd1055,esk43_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.38/0.61	cnf(c_0_10, negated_conjecture, (X1=esk43_0|vf(vd1055,X2)!=vf(vd1055,X3)|~rcenter(vd1055,X1)|~ron(X3,esk43_0)|~ron(X2,X1)|~rpoint(X3)|~rpoint(X2)), inference(spm,[status(thm)],[c_0_8, c_0_9])).
0.38/0.61	cnf(c_0_11, plain, (rcenter(vd1055,vd1061)), inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(211)), 0), and(pred(comma_conjunct1(the(211)), 0), pred(the(211), 0)))'])).
0.38/0.61	cnf(c_0_12, negated_conjecture, (esk43_0!=vd1061), inference(split_conjunct,[status(thm)],[c_0_7])).
0.38/0.61	cnf(c_0_13, negated_conjecture, (vf(vd1055,X1)!=vf(vd1055,X2)|~ron(X2,esk43_0)|~ron(X1,vd1061)|~rpoint(X2)|~rpoint(X1)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12])).
0.38/0.61	cnf(c_0_14, plain, (rpoint(vd1058)), inference(split_conjunct,[status(thm)],['and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))'])).
0.38/0.61	cnf(c_0_15, plain, (vd1057=vd1058), inference(split_conjunct,[status(thm)],['and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))'])).
0.38/0.61	cnf(c_0_16, negated_conjecture, (~ron(X1,esk43_0)|~ron(X1,vd1061)|~rpoint(X1)), inference(er,[status(thm)],[c_0_13])).
0.38/0.61	cnf(c_0_17, negated_conjecture, (ron(vd1057,esk43_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.38/0.61	cnf(c_0_18, plain, (ron(vd1057,vd1061)), inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(211)), 0), and(pred(comma_conjunct1(the(211)), 0), pred(the(211), 0)))'])).
0.38/0.61	cnf(c_0_19, plain, (rpoint(vd1057)), inference(rw,[status(thm)],[c_0_14, c_0_15])).
0.38/0.61	cnf(c_0_20, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18]), c_0_19])]), ['proof']).
0.38/0.61	# SZS output end CNFRefutation
0.38/0.61	# Proof object total steps             : 21
0.38/0.61	# Proof object clause steps            : 14
0.38/0.61	# Proof object formula steps           : 7
0.38/0.61	# Proof object conjectures             : 10
0.38/0.61	# Proof object clause conjectures      : 7
0.38/0.61	# Proof object formula conjectures     : 3
0.38/0.61	# Proof object initial clauses used    : 8
0.38/0.61	# Proof object initial formulas used   : 4
0.38/0.61	# Proof object generating inferences   : 4
0.38/0.61	# Proof object simplifying inferences  : 7
0.38/0.61	# Training examples: 0 positive, 0 negative
0.38/0.61	# Parsed axioms                        : 105
0.38/0.61	# Removed by relevancy pruning/SinE    : 0
0.38/0.61	# Initial clauses                      : 260
0.38/0.61	# Removed in clause preprocessing      : 2
0.38/0.61	# Initial clauses in saturation        : 258
0.38/0.61	# Processed clauses                    : 1554
0.38/0.61	# ...of these trivial                  : 0
0.38/0.61	# ...subsumed                          : 583
0.38/0.61	# ...remaining for further processing  : 971
0.38/0.61	# Other redundant clauses eliminated   : 1088
0.38/0.61	# Clauses deleted for lack of memory   : 0
0.38/0.61	# Backward-subsumed                    : 19
0.38/0.61	# Backward-rewritten                   : 8
0.38/0.61	# Generated clauses                    : 3286
0.38/0.61	# ...of the previous two non-trivial   : 3191
0.38/0.61	# Contextual simplify-reflections      : 59
0.38/0.61	# Paramodulations                      : 3030
0.38/0.61	# Factorizations                       : 0
0.38/0.61	# Equation resolutions                 : 1112
0.38/0.61	# Propositional unsat checks           : 0
0.38/0.61	#    Propositional check models        : 0
0.38/0.61	#    Propositional check unsatisfiable : 0
0.38/0.61	#    Propositional clauses             : 0
0.38/0.61	#    Propositional clauses after purity: 0
0.38/0.61	#    Propositional unsat core size     : 0
0.38/0.61	#    Propositional preprocessing time  : 0.000
0.38/0.61	#    Propositional encoding time       : 0.000
0.38/0.61	#    Propositional solver time         : 0.000
0.38/0.61	#    Success case prop preproc time    : 0.000
0.38/0.61	#    Success case prop encoding time   : 0.000
0.38/0.61	#    Success case prop solver time     : 0.000
0.38/0.61	# Current number of processed clauses  : 456
0.38/0.61	#    Positive orientable unit clauses  : 17
0.38/0.61	#    Positive unorientable unit clauses: 0
0.38/0.61	#    Negative unit clauses             : 8
0.38/0.61	#    Non-unit-clauses                  : 431
0.38/0.61	# Current number of unprocessed clauses: 2001
0.38/0.61	# ...number of literals in the above   : 27045
0.38/0.61	# Current number of archived formulas  : 0
0.38/0.61	# Current number of archived clauses   : 283
0.38/0.61	# Clause-clause subsumption calls (NU) : 219530
0.38/0.61	# Rec. Clause-clause subsumption calls : 10486
0.38/0.61	# Non-unit clause-clause subsumptions  : 575
0.38/0.61	# Unit Clause-clause subsumption calls : 1778
0.38/0.61	# Rewrite failures with RHS unbound    : 0
0.38/0.61	# BW rewrite match attempts            : 2
0.38/0.61	# BW rewrite match successes           : 2
0.38/0.61	# Condensation attempts                : 0
0.38/0.61	# Condensation successes               : 0
0.38/0.61	# Termbank termtop insertions          : 139309
0.38/0.61	
0.38/0.61	# -------------------------------------------------
0.38/0.61	# User time                : 0.268 s
0.38/0.61	# System time              : 0.008 s
0.38/0.61	# Total time               : 0.276 s
0.38/0.61	# Maximum resident set size: 2540 pages
0.38/0.61	EOF