0.00/0.05	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.06	% 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.34	% Computer   : n145.star.cs.uiowa.edu
0.02/0.34	% Model      : x86_64 x86_64
0.02/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.34	% Memory     : 32218.625MB
0.02/0.34	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.34	% CPULimit   : 300
0.02/0.34	% DateTime   : Sat Jul 14 04:38:55 CDT 2018
0.02/0.34	% CPUTime    : 
0.02/0.34	# Version: 2.2pre001
0.06/0.35	# No SInE strategy applied
0.06/0.35	# Trying AutoSched0 for 151 seconds
0.06/0.47	# AutoSched0-Mode selected heuristic G_E___100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y
0.06/0.47	# and selection function SelectMaxLComplexAvoidPosPred.
0.06/0.47	#
0.06/0.47	# Preprocessing time       : 0.039 s
0.06/0.47	# Presaturation interreduction done
0.06/0.47	
0.06/0.47	# Proof found!
0.06/0.47	# SZS status Theorem
0.06/0.47	# SZS output start CNFRefutation
0.06/0.47	fof('ass(cond(proof(385), 0), 2)', axiom, ![X35, X36, X37]:(((((((vangle(X35,X37,X36)=vangle(X35,X36,X37)&X37!=X36)&X35!=X36)&?[X38]:(X37=X38&rpoint(X38)))&?[X39]:(rpoint(X39)&X39=X35))&?[X40]:(rpoint(X40)&X40=X36))&X37!=X35)=>(vf(X35,X36)!=vf(X35,X37)=>~(rless(vf(X35,X37),vf(X35,X36))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'ass(cond(proof(385), 0), 2)')).
0.06/0.47	fof('ass(cond(proof(385), 0), 0)', axiom, ![X35, X36, X37]:(((rless(vf(X35,X36),vf(X35,X37))|rless(vf(X35,X37),vf(X35,X36)))<=vf(X35,X36)!=vf(X35,X37))<=((((((X35!=X37&X35!=X36)&?[X40]:(X36=X40&rpoint(X40)))&?[X39]:(X35=X39&rpoint(X39)))&?[X38]:(X37=X38&rpoint(X38)))&X37!=X36)&vangle(X35,X36,X37)=vangle(X35,X37,X36))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'ass(cond(proof(385), 0), 0)')).
0.06/0.47	fof('qe(s2(plural(383)))', axiom, ?[X115]:(rpoint(X115)&vd1353=X115), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'qe(s2(plural(383)))')).
0.06/0.47	fof('qe(s1(plural(383)))', axiom, ?[X299]:(X299=vd1352&rpoint(X299)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'qe(s1(plural(383)))')).
0.06/0.47	fof('qe(s3(plural(383)))', axiom, ?[X190]:(rpoint(X190)&vd1354=X190), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'qe(s3(plural(383)))')).
0.06/0.47	fof('holds(384, 1360, 0)', conjecture, vf(vd1352,vd1353)=vf(vd1352,vd1354), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'holds(384, 1360, 0)')).
0.06/0.47	fof('holds(383, 1356, 0)', axiom, vangle(vd1352,vd1353,vd1354)=vangle(vd1352,vd1354,vd1353), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'holds(383, 1356, 0)')).
0.06/0.47	fof('pred(383, 7)', axiom, vd1352!=vd1353, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'pred(383, 7)')).
0.06/0.47	fof('pred(383, 8)', axiom, vd1352!=vd1354, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'pred(383, 8)')).
0.06/0.47	fof('pred(383, 9)', axiom, vd1354!=vd1353, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'pred(383, 9)')).
0.06/0.47	fof(c_0_10, plain, ![X811, X812, X813, X814, X815, X816]:(vangle(X811,X813,X812)!=vangle(X811,X812,X813)|X813=X812|X811=X812|(X813!=X814|~rpoint(X814))|(~rpoint(X815)|X815!=X811)|(~rpoint(X816)|X816!=X812)|X813=X811|(vf(X811,X812)=vf(X811,X813)|~rless(vf(X811,X813),vf(X811,X812)))), 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)],[inference(fof_simplification,[status(thm)],['ass(cond(proof(385), 0), 2)'])])])])])])).
0.06/0.47	fof(c_0_11, plain, ![X1369, X1370, X1371, X1372, X1373, X1374]:(X1369=X1371|X1369=X1370|(X1370!=X1372|~rpoint(X1372))|(X1369!=X1373|~rpoint(X1373))|(X1371!=X1374|~rpoint(X1374))|X1371=X1370|vangle(X1369,X1370,X1371)!=vangle(X1369,X1371,X1370)|(vf(X1369,X1370)=vf(X1369,X1371)|(rless(vf(X1369,X1370),vf(X1369,X1371))|rless(vf(X1369,X1371),vf(X1369,X1370))))), 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)],[inference(fof_simplification,[status(thm)],['ass(cond(proof(385), 0), 0)'])])])])])])).
0.06/0.47	cnf(c_0_12, plain, (X2=X3|X1=X3|X2=X1|vf(X1,X3)=vf(X1,X2)|vangle(X1,X2,X3)!=vangle(X1,X3,X2)|X2!=X4|~rpoint(X4)|~rpoint(X5)|X5!=X1|~rpoint(X6)|X6!=X3|~rless(vf(X1,X2),vf(X1,X3))), inference(split_conjunct,[status(thm)],[c_0_10])).
0.06/0.47	fof(c_0_13, plain, (rpoint(esk3_0)&vd1353=esk3_0), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s2(plural(383)))'])])).
0.06/0.47	fof(c_0_14, plain, (esk17_0=vd1352&rpoint(esk17_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s1(plural(383)))'])])).
0.06/0.47	fof(c_0_15, plain, (rpoint(esk10_0)&vd1354=esk10_0), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s3(plural(383)))'])])).
0.06/0.47	fof(c_0_16, negated_conjecture, ~(vf(vd1352,vd1353)=vf(vd1352,vd1354)), inference(assume_negation,[status(cth)],['holds(384, 1360, 0)'])).
0.06/0.47	cnf(c_0_17, plain, (X1=X2|X1=X3|X2=X3|vf(X1,X3)=vf(X1,X2)|rless(vf(X1,X3),vf(X1,X2))|rless(vf(X1,X2),vf(X1,X3))|X3!=X4|~rpoint(X4)|X1!=X5|~rpoint(X5)|X2!=X6|~rpoint(X6)|vangle(X1,X3,X2)!=vangle(X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.06/0.47	cnf(c_0_18, plain, (vf(X1,X2)=vf(X1,X3)|X2=X3|X1=X3|X1=X2|vangle(X1,X2,X3)!=vangle(X1,X3,X2)|~rless(vf(X1,X2),vf(X1,X3))|~rpoint(X3)|~rpoint(X1)|~rpoint(X2)), inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_12])])])).
0.06/0.47	cnf(c_0_19, plain, (rpoint(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_13])).
0.06/0.47	cnf(c_0_20, plain, (vd1353=esk3_0), inference(split_conjunct,[status(thm)],[c_0_13])).
0.06/0.47	cnf(c_0_21, plain, (rpoint(esk17_0)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.06/0.47	cnf(c_0_22, plain, (esk17_0=vd1352), inference(split_conjunct,[status(thm)],[c_0_14])).
0.06/0.47	cnf(c_0_23, plain, (rpoint(esk10_0)), inference(split_conjunct,[status(thm)],[c_0_15])).
0.06/0.47	cnf(c_0_24, plain, (vd1354=esk10_0), inference(split_conjunct,[status(thm)],[c_0_15])).
0.06/0.47	fof(c_0_25, negated_conjecture, vf(vd1352,vd1353)!=vf(vd1352,vd1354), inference(fof_simplification,[status(thm)],[c_0_16])).
0.06/0.47	cnf(c_0_26, plain, (vf(X1,X2)=vf(X1,X3)|X2=X3|X1=X3|X1=X2|vangle(X1,X2,X3)!=vangle(X1,X3,X2)|~rpoint(X2)|~rpoint(X1)|~rpoint(X3)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_17])])]), c_0_18]), c_0_18])).
0.06/0.47	cnf(c_0_27, plain, (vangle(vd1352,vd1353,vd1354)=vangle(vd1352,vd1354,vd1353)), inference(split_conjunct,[status(thm)],['holds(383, 1356, 0)'])).
0.06/0.47	cnf(c_0_28, plain, (rpoint(vd1353)), inference(rw,[status(thm)],[c_0_19, c_0_20])).
0.06/0.47	cnf(c_0_29, plain, (rpoint(vd1352)), inference(rw,[status(thm)],[c_0_21, c_0_22])).
0.06/0.47	cnf(c_0_30, plain, (rpoint(vd1354)), inference(rw,[status(thm)],[c_0_23, c_0_24])).
0.06/0.47	cnf(c_0_31, negated_conjecture, (vf(vd1352,vd1353)!=vf(vd1352,vd1354)), inference(split_conjunct,[status(thm)],[c_0_25])).
0.06/0.47	cnf(c_0_32, plain, (vd1352!=vd1353), inference(split_conjunct,[status(thm)],['pred(383, 7)'])).
0.06/0.47	cnf(c_0_33, plain, (vd1352!=vd1354), inference(split_conjunct,[status(thm)],['pred(383, 8)'])).
0.06/0.47	cnf(c_0_34, plain, (vd1354!=vd1353), inference(split_conjunct,[status(thm)],['pred(383, 9)'])).
0.06/0.47	cnf(c_0_35, plain, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28]), c_0_29]), c_0_30])]), c_0_31]), c_0_32]), c_0_33]), c_0_34]), ['proof']).
0.06/0.47	# SZS output end CNFRefutation
0.06/0.47	# Proof object total steps             : 36
0.06/0.47	# Proof object clause steps            : 19
0.06/0.47	# Proof object formula steps           : 17
0.06/0.47	# Proof object conjectures             : 4
0.06/0.47	# Proof object clause conjectures      : 1
0.06/0.47	# Proof object formula conjectures     : 3
0.06/0.47	# Proof object initial clauses used    : 13
0.06/0.47	# Proof object initial formulas used   : 10
0.06/0.47	# Proof object generating inferences   : 1
0.06/0.47	# Proof object simplifying inferences  : 19
0.06/0.47	# Training examples: 0 positive, 0 negative
0.06/0.47	# Parsed axioms                        : 126
0.06/0.47	# Removed by relevancy pruning/SinE    : 0
0.06/0.47	# Initial clauses                      : 284
0.06/0.47	# Removed in clause preprocessing      : 2
0.06/0.47	# Initial clauses in saturation        : 282
0.06/0.47	# Processed clauses                    : 686
0.06/0.47	# ...of these trivial                  : 0
0.06/0.47	# ...subsumed                          : 3
0.06/0.47	# ...remaining for further processing  : 683
0.06/0.47	# Other redundant clauses eliminated   : 1203
0.06/0.47	# Clauses deleted for lack of memory   : 0
0.06/0.47	# Backward-subsumed                    : 1
0.06/0.47	# Backward-rewritten                   : 0
0.06/0.47	# Generated clauses                    : 373
0.06/0.47	# ...of the previous two non-trivial   : 364
0.06/0.47	# Contextual simplify-reflections      : 10
0.06/0.47	# Paramodulations                      : 105
0.06/0.47	# Factorizations                       : 0
0.06/0.47	# Equation resolutions                 : 1214
0.06/0.47	# Propositional unsat checks           : 0
0.06/0.47	#    Propositional check models        : 0
0.06/0.47	#    Propositional check unsatisfiable : 0
0.06/0.47	#    Propositional clauses             : 0
0.06/0.47	#    Propositional clauses after purity: 0
0.06/0.47	#    Propositional unsat core size     : 0
0.06/0.47	# Current number of processed clauses  : 147
0.06/0.47	#    Positive orientable unit clauses  : 10
0.06/0.47	#    Positive unorientable unit clauses: 0
0.06/0.47	#    Negative unit clauses             : 4
0.06/0.47	#    Non-unit-clauses                  : 133
0.06/0.47	# Current number of unprocessed clauses: 238
0.06/0.47	# ...number of literals in the above   : 2248
0.06/0.47	# Current number of archived formulas  : 0
0.06/0.47	# Current number of archived clauses   : 279
0.06/0.47	# Clause-clause subsumption calls (NU) : 125998
0.06/0.47	# Rec. Clause-clause subsumption calls : 3006
0.06/0.47	# Non-unit clause-clause subsumptions  : 14
0.06/0.47	# Unit Clause-clause subsumption calls : 4
0.06/0.47	# Rewrite failures with RHS unbound    : 0
0.06/0.47	# BW rewrite match attempts            : 0
0.06/0.47	# BW rewrite match successes           : 0
0.06/0.47	# Condensation attempts                : 0
0.06/0.47	# Condensation successes               : 0
0.06/0.47	# Termbank termtop insertions          : 69243
0.06/0.47	
0.06/0.47	# -------------------------------------------------
0.06/0.47	# User time                : 0.120 s
0.06/0.47	# System time              : 0.007 s
0.06/0.47	# Total time               : 0.127 s
0.06/0.47	# Maximum resident set size: 2544 pages
0.06/0.47	EOF