0.11/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/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.13/0.35	% Computer   : n006.cluster.edu
0.13/0.35	% Model      : x86_64 x86_64
0.13/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory     : 8042.1875MB
0.13/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 180
0.13/0.35	% DateTime   : Thu Aug 29 10:22:39 EDT 2019
0.13/0.36	% CPUTime    : 
0.13/0.36	# Version: 2.4_pre003
0.13/0.37	# No SInE strategy applied
0.13/0.37	# Trying AutoSched0 for 90 seconds
0.46/0.69	# AutoSched0-Mode selected heuristic H_____102_C18_F1_PI_AE_CS_SP_PS_S0Y
0.46/0.69	# and selection function SelectMaxLComplexAvoidPosPred.
0.46/0.69	#
0.46/0.69	# Preprocessing time       : 0.075 s
0.46/0.69	# Presaturation interreduction done
0.46/0.69	
0.46/0.69	# Proof found!
0.46/0.69	# SZS status Theorem
0.46/0.69	# SZS output start CNFRefutation
0.46/0.69	fof('qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))', axiom, ![X264, X265, X266, X267, X268]:(X268=X267<=((((((ron(X265,X268)&rcenter(X266,X268))&rcenter(X266,X267))&?[X269]:(X269=X264&rpoint(X269)))&?[X270]:(rpoint(X270)&X270=X265))&ron(X264,X267))&vf(X266,X265)=vf(X266,X264))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))')).
0.46/0.69	fof('qu(theu(the(228), 1), imp(the(228)))', conjecture, ![X41]:(((ron(vd1081,X41)&rcenter(vd1080,X41))&rcircle(X41))=>X41=vd1095), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'qu(theu(the(228), 1), imp(the(228)))')).
0.46/0.69	fof('and(pred(comma_conjunct2(the(228)), 0), and(pred(comma_conjunct1(the(228)), 0), pred(the(228), 0)))', axiom, ((ron(vd1081,vd1095)&rcenter(vd1080,vd1095))&rcircle(vd1095)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'and(pred(comma_conjunct2(the(228)), 0), and(pred(comma_conjunct1(the(228)), 0), pred(the(228), 0)))')).
0.46/0.69	fof('qe(s2(plural(224)))', axiom, ?[X353]:(rpoint(X353)&vd1081=X353), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'qe(s2(plural(224)))')).
0.46/0.69	fof(c_0_4, plain, ![X997, X998, X999, X1000, X1001, X1002, X1003]:(~ron(X998,X1001)|~rcenter(X999,X1001)|~rcenter(X999,X1000)|(X1002!=X997|~rpoint(X1002))|(~rpoint(X1003)|X1003!=X998)|~ron(X997,X1000)|vf(X999,X998)!=vf(X999,X997)|X1001=X1000), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],['qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))'])])])])).
0.46/0.69	fof(c_0_5, negated_conjecture, ~(![X41]:(((ron(vd1081,X41)&rcenter(vd1080,X41))&rcircle(X41))=>X41=vd1095)), inference(assume_negation,[status(cth)],['qu(theu(the(228), 1), imp(the(228)))'])).
0.46/0.69	cnf(c_0_6, plain, (X2=X4|~ron(X1,X2)|~rcenter(X3,X2)|~rcenter(X3,X4)|X5!=X6|~rpoint(X5)|~rpoint(X7)|X7!=X1|~ron(X6,X4)|vf(X3,X1)!=vf(X3,X6)), inference(split_conjunct,[status(thm)],[c_0_4])).
0.46/0.69	fof(c_0_7, negated_conjecture, (((ron(vd1081,esk4_0)&rcenter(vd1080,esk4_0))&rcircle(esk4_0))&esk4_0!=vd1095), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
0.46/0.69	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(X4)|~rpoint(X5)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_6])])).
0.46/0.69	cnf(c_0_9, negated_conjecture, (rcenter(vd1080,esk4_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.46/0.69	cnf(c_0_10, negated_conjecture, (X1=esk4_0|vf(vd1080,X2)!=vf(vd1080,X3)|~rcenter(vd1080,X1)|~ron(X3,esk4_0)|~ron(X2,X1)|~rpoint(X2)|~rpoint(X3)), inference(spm,[status(thm)],[c_0_8, c_0_9])).
0.46/0.69	cnf(c_0_11, plain, (rcenter(vd1080,vd1095)), inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(228)), 0), and(pred(comma_conjunct1(the(228)), 0), pred(the(228), 0)))'])).
0.46/0.69	cnf(c_0_12, negated_conjecture, (esk4_0!=vd1095), inference(split_conjunct,[status(thm)],[c_0_7])).
0.46/0.69	fof(c_0_13, plain, (rpoint(esk21_0)&vd1081=esk21_0), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s2(plural(224)))'])])).
0.46/0.69	cnf(c_0_14, negated_conjecture, (vf(vd1080,X1)!=vf(vd1080,X2)|~ron(X2,esk4_0)|~ron(X1,vd1095)|~rpoint(X1)|~rpoint(X2)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12])).
0.46/0.69	cnf(c_0_15, plain, (rpoint(esk21_0)), inference(split_conjunct,[status(thm)],[c_0_13])).
0.46/0.69	cnf(c_0_16, plain, (vd1081=esk21_0), inference(split_conjunct,[status(thm)],[c_0_13])).
0.46/0.69	cnf(c_0_17, negated_conjecture, (~ron(X1,esk4_0)|~ron(X1,vd1095)|~rpoint(X1)), inference(er,[status(thm)],[c_0_14])).
0.46/0.69	cnf(c_0_18, negated_conjecture, (ron(vd1081,esk4_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.46/0.69	cnf(c_0_19, plain, (ron(vd1081,vd1095)), inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(228)), 0), and(pred(comma_conjunct1(the(228)), 0), pred(the(228), 0)))'])).
0.46/0.69	cnf(c_0_20, plain, (rpoint(vd1081)), inference(rw,[status(thm)],[c_0_15, c_0_16])).
0.46/0.69	cnf(c_0_21, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19]), c_0_20])]), ['proof']).
0.46/0.69	# SZS output end CNFRefutation
0.46/0.69	# Proof object total steps             : 22
0.46/0.69	# Proof object clause steps            : 14
0.46/0.69	# Proof object formula steps           : 8
0.46/0.69	# Proof object conjectures             : 10
0.46/0.69	# Proof object clause conjectures      : 7
0.46/0.69	# Proof object formula conjectures     : 3
0.46/0.69	# Proof object initial clauses used    : 8
0.46/0.69	# Proof object initial formulas used   : 4
0.46/0.69	# Proof object generating inferences   : 4
0.46/0.69	# Proof object simplifying inferences  : 7
0.46/0.69	# Training examples: 0 positive, 0 negative
0.46/0.69	# Parsed axioms                        : 120
0.46/0.69	# Removed by relevancy pruning/SinE    : 0
0.46/0.69	# Initial clauses                      : 275
0.46/0.69	# Removed in clause preprocessing      : 2
0.46/0.69	# Initial clauses in saturation        : 273
0.46/0.69	# Processed clauses                    : 1702
0.46/0.69	# ...of these trivial                  : 5
0.46/0.69	# ...subsumed                          : 653
0.46/0.69	# ...remaining for further processing  : 1044
0.46/0.69	# Other redundant clauses eliminated   : 1094
0.46/0.69	# Clauses deleted for lack of memory   : 0
0.46/0.69	# Backward-subsumed                    : 16
0.46/0.69	# Backward-rewritten                   : 15
0.46/0.69	# Generated clauses                    : 4007
0.46/0.69	# ...of the previous two non-trivial   : 3880
0.46/0.69	# Contextual simplify-reflections      : 54
0.46/0.69	# Paramodulations                      : 3744
0.46/0.69	# Factorizations                       : 0
0.46/0.69	# Equation resolutions                 : 1122
0.46/0.69	# Propositional unsat checks           : 0
0.46/0.69	#    Propositional check models        : 0
0.46/0.69	#    Propositional check unsatisfiable : 0
0.46/0.69	#    Propositional clauses             : 0
0.46/0.69	#    Propositional clauses after purity: 0
0.46/0.69	#    Propositional unsat core size     : 0
0.46/0.69	#    Propositional preprocessing time  : 0.000
0.46/0.69	#    Propositional encoding time       : 0.000
0.46/0.69	#    Propositional solver time         : 0.000
0.46/0.69	#    Success case prop preproc time    : 0.000
0.46/0.69	#    Success case prop encoding time   : 0.000
0.46/0.69	#    Success case prop solver time     : 0.000
0.46/0.69	# Current number of processed clauses  : 507
0.46/0.69	#    Positive orientable unit clauses  : 30
0.46/0.69	#    Positive unorientable unit clauses: 0
0.46/0.69	#    Negative unit clauses             : 11
0.46/0.69	#    Non-unit-clauses                  : 466
0.46/0.69	# Current number of unprocessed clauses: 2543
0.46/0.69	# ...number of literals in the above   : 29933
0.46/0.69	# Current number of archived formulas  : 0
0.46/0.69	# Current number of archived clauses   : 302
0.46/0.69	# Clause-clause subsumption calls (NU) : 243475
0.46/0.69	# Rec. Clause-clause subsumption calls : 15900
0.46/0.69	# Non-unit clause-clause subsumptions  : 621
0.46/0.69	# Unit Clause-clause subsumption calls : 1790
0.46/0.69	# Rewrite failures with RHS unbound    : 0
0.46/0.69	# BW rewrite match attempts            : 4
0.46/0.69	# BW rewrite match successes           : 4
0.46/0.69	# Condensation attempts                : 0
0.46/0.69	# Condensation successes               : 0
0.46/0.69	# Termbank termtop insertions          : 154653
0.46/0.69	
0.46/0.69	# -------------------------------------------------
0.46/0.69	# User time                : 0.325 s
0.46/0.69	# System time              : 0.013 s
0.46/0.69	# Total time               : 0.338 s
0.46/0.69	# Maximum resident set size: 2560 pages
0.46/0.70	EOF