0.00/0.04	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s
0.02/0.23	% Computer   : n148.star.cs.uiowa.edu
0.02/0.23	% Model      : x86_64 x86_64
0.02/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.23	% Memory     : 32218.625MB
0.02/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.23	% CPULimit   : 300
0.02/0.23	% DateTime   : Sat Jul 14 04:34:11 CDT 2018
0.02/0.23	% CPUTime    : 
0.02/0.23	# Version: 2.2pre001
0.02/0.24	# No SInE strategy applied
0.02/0.24	# Trying AutoSched0 for 151 seconds
30.82/31.04	# AutoSched0-Mode selected heuristic G_E___100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y
30.82/31.04	# and selection function SelectMaxLComplexAvoidPosPred.
30.82/31.04	#
30.82/31.04	# Preprocessing time       : 0.036 s
30.82/31.04	# Presaturation interreduction done
30.82/31.04	
30.82/31.04	# Proof found!
30.82/31.04	# SZS status Theorem
30.82/31.04	# SZS output start CNFRefutation
30.82/31.04	fof('qu(cond(axiom(184), 0), imp(cond(axiom(184), 0)))', axiom, ![X477, X478, X479, X480, X481, X482]:((vf(X479,X477)=vf(X479,X481)<=>ron(X477,X480))<=(((((X482=X481&rpoint(X482))&rpoint(X478))&X477=X478)&rcenter(X479,X480))&ron(X481,X480))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'qu(cond(axiom(184), 0), imp(cond(axiom(184), 0)))')).
30.82/31.04	fof('qu(theu(the(231), 1), imp(the(231)))', conjecture, ![X346]:(((rcircle(X346)&rcenter(vd1089,X346))&ron(vd1096,X346))=>X346=vd1102), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'qu(theu(the(231), 1), imp(the(231)))')).
30.82/31.04	fof('qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))', axiom, ![X218, X219, X220, X221, X222]:(((((((vf(X220,X218)=vf(X220,X219)&ron(X219,X222))&ron(X218,X221))&?[X223]:(X223=X218&rpoint(X223)))&?[X224]:(X224=X219&rpoint(X224)))&rcenter(X220,X221))&rcenter(X220,X222))=>X222=X221), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))')).
30.82/31.04	fof('and(pred(comma_conjunct2(the(231)), 0), and(pred(comma_conjunct1(the(231)), 0), pred(the(231), 0)))', axiom, ((rcircle(vd1102)&rcenter(vd1089,vd1102))&ron(vd1096,vd1102)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'and(pred(comma_conjunct2(the(231)), 0), and(pred(comma_conjunct1(the(231)), 0), pred(the(231), 0)))')).
30.82/31.04	fof('pred(229, 0)', axiom, rpoint(vd1096), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'pred(229, 0)')).
30.82/31.04	fof(c_0_5, plain, ![X1216, X1217, X1218, X1219, X1220, X1221]:((vf(X1218,X1216)!=vf(X1218,X1220)|ron(X1216,X1219)|(X1221!=X1220|~rpoint(X1221)|~rpoint(X1217)|X1216!=X1217|~rcenter(X1218,X1219)|~ron(X1220,X1219)))&(~ron(X1216,X1219)|vf(X1218,X1216)=vf(X1218,X1220)|(X1221!=X1220|~rpoint(X1221)|~rpoint(X1217)|X1216!=X1217|~rcenter(X1218,X1219)|~ron(X1220,X1219)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],['qu(cond(axiom(184), 0), imp(cond(axiom(184), 0)))'])])])])])])).
30.82/31.04	fof(c_0_6, negated_conjecture, ~(![X346]:(((rcircle(X346)&rcenter(vd1089,X346))&ron(vd1096,X346))=>X346=vd1102)), inference(assume_negation,[status(cth)],['qu(theu(the(231), 1), imp(the(231)))'])).
30.82/31.04	cnf(c_0_7, plain, (ron(X2,X4)|vf(X1,X2)!=vf(X1,X3)|X5!=X3|~rpoint(X5)|~rpoint(X6)|X2!=X6|~rcenter(X1,X4)|~ron(X3,X4)), inference(split_conjunct,[status(thm)],[c_0_5])).
30.82/31.04	fof(c_0_8, negated_conjecture, (((rcircle(esk30_0)&rcenter(vd1089,esk30_0))&ron(vd1096,esk30_0))&esk30_0!=vd1102), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
30.82/31.04	cnf(c_0_9, plain, (vf(X3,X1)=vf(X3,X4)|~ron(X1,X2)|X5!=X4|~rpoint(X5)|~rpoint(X6)|X1!=X6|~rcenter(X3,X2)|~ron(X4,X2)), inference(split_conjunct,[status(thm)],[c_0_5])).
30.82/31.04	fof(c_0_10, plain, ![X951, X952, X953, X954, X955, X956, X957]:(vf(X953,X951)!=vf(X953,X952)|~ron(X952,X955)|~ron(X951,X954)|(X956!=X951|~rpoint(X956))|(X957!=X952|~rpoint(X957))|~rcenter(X953,X954)|~rcenter(X953,X955)|X955=X954), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[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)))'])])])])])).
30.82/31.04	cnf(c_0_11, plain, (ron(X1,X2)|vf(X3,X1)!=vf(X3,X4)|~rcenter(X3,X2)|~ron(X4,X2)|~rpoint(X1)|~rpoint(X4)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_7])])).
30.82/31.04	cnf(c_0_12, negated_conjecture, (rcenter(vd1089,esk30_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
30.82/31.04	cnf(c_0_13, plain, (vf(X1,X2)=vf(X1,X3)|~rcenter(X1,X4)|~ron(X3,X4)|~ron(X2,X4)|~rpoint(X2)|~rpoint(X3)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])])).
30.82/31.05	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)))'])).
30.82/31.05	cnf(c_0_15, plain, (X4=X5|vf(X1,X2)!=vf(X1,X3)|~ron(X3,X4)|~ron(X2,X5)|X6!=X2|~rpoint(X6)|X7!=X3|~rpoint(X7)|~rcenter(X1,X5)|~rcenter(X1,X4)), inference(split_conjunct,[status(thm)],[c_0_10])).
30.82/31.05	cnf(c_0_16, negated_conjecture, (ron(X1,esk30_0)|vf(vd1089,X1)!=vf(vd1089,X2)|~ron(X2,esk30_0)|~rpoint(X1)|~rpoint(X2)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
30.82/31.05	cnf(c_0_17, plain, (vf(vd1089,X1)=vf(vd1089,X2)|~ron(X2,vd1102)|~ron(X1,vd1102)|~rpoint(X1)|~rpoint(X2)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
30.82/31.05	cnf(c_0_18, plain, (X1=X2|vf(X3,X4)!=vf(X3,X5)|~rcenter(X3,X2)|~rcenter(X3,X1)|~ron(X5,X1)|~ron(X4,X2)|~rpoint(X5)|~rpoint(X4)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_15])])).
30.82/31.05	cnf(c_0_19, negated_conjecture, (ron(X1,esk30_0)|vf(vd1089,X2)!=vf(vd1089,X3)|~ron(X3,esk30_0)|~ron(X1,vd1102)|~ron(X2,vd1102)|~rpoint(X1)|~rpoint(X3)|~rpoint(X2)), inference(spm,[status(thm)],[c_0_16, c_0_17])).
30.82/31.05	cnf(c_0_20, negated_conjecture, (X1=esk30_0|vf(vd1089,X2)!=vf(vd1089,X3)|~rcenter(vd1089,X1)|~ron(X2,esk30_0)|~ron(X3,X1)|~rpoint(X3)|~rpoint(X2)), inference(spm,[status(thm)],[c_0_18, c_0_12])).
30.82/31.05	cnf(c_0_21, negated_conjecture, (esk30_0!=vd1102), inference(split_conjunct,[status(thm)],[c_0_8])).
30.82/31.05	cnf(c_0_22, negated_conjecture, (ron(X1,esk30_0)|~ron(X2,esk30_0)|~ron(X1,vd1102)|~ron(X2,vd1102)|~rpoint(X1)|~rpoint(X2)), inference(er,[status(thm)],[c_0_19])).
30.82/31.05	cnf(c_0_23, negated_conjecture, (ron(vd1096,esk30_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
30.82/31.05	cnf(c_0_24, 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)))'])).
30.82/31.05	cnf(c_0_25, plain, (rpoint(vd1096)), inference(split_conjunct,[status(thm)],['pred(229, 0)'])).
30.82/31.05	cnf(c_0_26, negated_conjecture, (vf(vd1089,X1)!=vf(vd1089,X2)|~ron(X1,esk30_0)|~ron(X2,vd1102)|~rpoint(X2)|~rpoint(X1)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_14]), c_0_21])).
30.82/31.05	cnf(c_0_27, negated_conjecture, (ron(X1,esk30_0)|~ron(X1,vd1102)|~rpoint(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24]), c_0_25])])).
30.82/31.05	cnf(c_0_28, negated_conjecture, (~ron(X1,vd1102)|~rpoint(X1)), inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_26]), c_0_27])).
30.82/31.05	cnf(c_0_29, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_24]), c_0_25])]), ['proof']).
30.82/31.05	# SZS output end CNFRefutation
30.82/31.05	# Proof object total steps             : 30
30.82/31.05	# Proof object clause steps            : 21
30.82/31.05	# Proof object formula steps           : 9
30.82/31.05	# Proof object conjectures             : 14
30.82/31.05	# Proof object clause conjectures      : 11
30.82/31.05	# Proof object formula conjectures     : 3
30.82/31.05	# Proof object initial clauses used    : 9
30.82/31.05	# Proof object initial formulas used   : 5
30.82/31.05	# Proof object generating inferences   : 9
30.82/31.05	# Proof object simplifying inferences  : 13
30.82/31.05	# Training examples: 0 positive, 0 negative
30.82/31.05	# Parsed axioms                        : 130
30.82/31.05	# Removed by relevancy pruning/SinE    : 0
30.82/31.05	# Initial clauses                      : 289
30.82/31.05	# Removed in clause preprocessing      : 2
30.82/31.05	# Initial clauses in saturation        : 287
30.82/31.05	# Processed clauses                    : 60436
30.82/31.05	# ...of these trivial                  : 52
30.82/31.05	# ...subsumed                          : 50890
30.82/31.05	# ...remaining for further processing  : 9494
30.82/31.05	# Other redundant clauses eliminated   : 1094
30.82/31.05	# Clauses deleted for lack of memory   : 0
30.82/31.05	# Backward-subsumed                    : 1855
30.82/31.05	# Backward-rewritten                   : 217
30.82/31.05	# Generated clauses                    : 547066
30.82/31.05	# ...of the previous two non-trivial   : 534230
30.82/31.05	# Contextual simplify-reflections      : 71898
30.82/31.05	# Paramodulations                      : 546581
30.82/31.05	# Factorizations                       : 22
30.82/31.05	# Equation resolutions                 : 1286
30.82/31.05	# Propositional unsat checks           : 0
30.82/31.05	#    Propositional check models        : 0
30.82/31.05	#    Propositional check unsatisfiable : 0
30.82/31.05	#    Propositional clauses             : 0
30.82/31.05	#    Propositional clauses after purity: 0
30.82/31.05	#    Propositional unsat core size     : 0
30.82/31.05	# Current number of processed clauses  : 6885
30.82/31.05	#    Positive orientable unit clauses  : 65
30.82/31.05	#    Positive unorientable unit clauses: 0
30.82/31.05	#    Negative unit clauses             : 70
30.82/31.05	#    Non-unit-clauses                  : 6750
30.82/31.05	# Current number of unprocessed clauses: 360657
30.82/31.05	# ...number of literals in the above   : 5166309
30.82/31.05	# Current number of archived formulas  : 0
30.82/31.05	# Current number of archived clauses   : 2357
30.82/31.05	# Clause-clause subsumption calls (NU) : 59849344
30.82/31.05	# Rec. Clause-clause subsumption calls : 1722071
30.82/31.05	# Non-unit clause-clause subsumptions  : 110578
30.82/31.05	# Unit Clause-clause subsumption calls : 85638
30.82/31.05	# Rewrite failures with RHS unbound    : 0
30.82/31.05	# BW rewrite match attempts            : 22
30.82/31.05	# BW rewrite match successes           : 22
30.82/31.05	# Condensation attempts                : 0
30.82/31.05	# Condensation successes               : 0
30.82/31.05	# Termbank termtop insertions          : 22374094
30.82/31.09	
30.82/31.09	# -------------------------------------------------
30.82/31.09	# User time                : 30.458 s
30.82/31.09	# System time              : 0.397 s
30.82/31.09	# Total time               : 30.855 s
30.82/31.09	# Maximum resident set size: 2476 pages
30.82/31.09	EOF