0.00/0.03 % 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.03/0.23 % Computer : n066.star.cs.uiowa.edu 0.03/0.23 % Model : x86_64 x86_64 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.23 % Memory : 32218.625MB 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.23 % CPULimit : 300 0.03/0.23 % DateTime : Sat Jul 14 04:24:26 CDT 2018 0.03/0.23 % CPUTime : 0.03/0.23 # Version: 2.2pre001 0.03/0.24 # No SInE strategy applied 0.03/0.24 # Trying AutoSched0 for 151 seconds 0.07/0.28 # AutoSched0-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y 0.07/0.28 # and selection function SelectMaxLComplexAvoidPosPred. 0.07/0.28 # 0.07/0.28 # Preprocessing time : 0.011 s 0.07/0.28 # Presaturation interreduction done 0.07/0.28 0.07/0.28 # Proof found! 0.07/0.28 # SZS status Theorem 0.07/0.28 # SZS output start CNFRefutation 0.07/0.28 fof(maximal_path_length, conjecture, (complete=>![X3, X1, X2]:(less_or_equal(minus(length_of(X3),n1),number_of_in(triangles,graph))<=shortest_path(X1,X2,X3))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', maximal_path_length)). 0.07/0.28 fof(shortest_path_defn, axiom, ![X1, X2, X10]:(((path(X1,X2,X10)&X2!=X1)&![X3]:(path(X1,X2,X3)=>less_or_equal(length_of(X10),length_of(X3))))<=>shortest_path(X1,X2,X10)), file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax', shortest_path_defn)). 0.07/0.28 fof(length_defn, axiom, ![X1, X2, X3]:(path(X1,X2,X3)=>number_of_in(edges,X3)=length_of(X3)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', length_defn)). 0.07/0.28 fof(path_length_sequential_pairs, axiom, ![X1, X2, X3]:(minus(length_of(X3),n1)=number_of_in(sequential_pairs,X3)<=path(X1,X2,X3)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', path_length_sequential_pairs)). 0.07/0.28 fof(sequential_is_triangle, lemma, (complete=>![X1, X2, X6, X7, X3]:(((sequential(X6,X7)&precedes(X6,X7,X3))&shortest_path(X1,X2,X3))=>?[X8]:triangle(X6,X7,X8))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', sequential_is_triangle)). 0.07/0.28 fof(sequential_pairs_and_triangles, axiom, ![X3, X1, X2]:(number_of_in(triangles,X3)=number_of_in(sequential_pairs,X3)<=(![X6, X7]:(?[X8]:triangle(X6,X7,X8)<=((on_path(X6,X3)&sequential(X6,X7))&on_path(X7,X3)))&path(X1,X2,X3))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', sequential_pairs_and_triangles)). 0.07/0.28 fof(precedes_defn, axiom, ![X3, X1, X2]:(path(X1,X2,X3)=>![X6, X7]:(((on_path(X7,X3)&(sequential(X6,X7)|?[X8]:(sequential(X6,X8)&precedes(X8,X7,X3))))&on_path(X6,X3))=>precedes(X6,X7,X3))), file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax', precedes_defn)). 0.07/0.28 fof(graph_has_them_all, axiom, ![X11, X12]:less_or_equal(number_of_in(X11,X12),number_of_in(X11,graph)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', graph_has_them_all)). 0.07/0.28 fof(c_0_8, negated_conjecture, ~((complete=>![X3, X1, X2]:(less_or_equal(minus(length_of(X3),n1),number_of_in(triangles,graph))<=shortest_path(X1,X2,X3)))), inference(assume_negation,[status(cth)],[maximal_path_length])). 0.07/0.28 fof(c_0_9, plain, ![X39, X40, X41, X39, X40, X41, X43]:(((path(X39,X40,esk5_3(X39,X40,X41))|(~path(X39,X40,X41)|X40=X39)|shortest_path(X39,X40,X41))&(~less_or_equal(length_of(X41),length_of(esk5_3(X39,X40,X41)))|(~path(X39,X40,X41)|X40=X39)|shortest_path(X39,X40,X41)))&(((path(X39,X40,X41)|~shortest_path(X39,X40,X41))&(X40!=X39|~shortest_path(X39,X40,X41)))&(~path(X39,X40,X43)|less_or_equal(length_of(X41),length_of(X43))|~shortest_path(X39,X40,X41)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[shortest_path_defn])])])])])])])). 0.07/0.28 fof(c_0_10, negated_conjecture, (complete&(shortest_path(esk8_0,esk9_0,esk7_0)&~less_or_equal(minus(length_of(esk7_0),n1),number_of_in(triangles,graph)))), inference(skolemize,[status(esa)],[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)],[c_0_8])])])])])])). 0.07/0.28 fof(c_0_11, plain, ![X70, X71, X72]:(~path(X70,X71,X72)|number_of_in(edges,X72)=length_of(X72)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[length_defn])])). 0.07/0.28 cnf(c_0_12, plain, (path(X1,X2,X3)|~shortest_path(X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.07/0.28 cnf(c_0_13, negated_conjecture, (shortest_path(esk8_0,esk9_0,esk7_0)), inference(split_conjunct,[status(thm)],[c_0_10])). 0.07/0.28 cnf(c_0_14, plain, (number_of_in(edges,X3)=length_of(X3)|~path(X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_11])). 0.07/0.28 cnf(c_0_15, negated_conjecture, (path(esk8_0,esk9_0,esk7_0)), inference(spm,[status(thm)],[c_0_12, c_0_13])). 0.07/0.28 fof(c_0_16, plain, ![X85, X86, X87]:(~path(X85,X86,X87)|minus(length_of(X87),n1)=number_of_in(sequential_pairs,X87)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[path_length_sequential_pairs])])])). 0.07/0.28 fof(c_0_17, lemma, ![X79, X80, X81, X82, X83]:(~complete|(~sequential(X81,X82)|~precedes(X81,X82,X83)|~shortest_path(X79,X80,X83)|triangle(X81,X82,esk12_4(X79,X80,X81,X82)))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sequential_is_triangle])])])])])])). 0.07/0.28 fof(c_0_18, plain, ![X73, X78, X74, X75]:((((on_path(esk10_1(X73),X73)|~path(X74,X75,X73)|number_of_in(triangles,X73)=number_of_in(sequential_pairs,X73))&(sequential(esk10_1(X73),esk11_1(X73))|~path(X74,X75,X73)|number_of_in(triangles,X73)=number_of_in(sequential_pairs,X73)))&(on_path(esk11_1(X73),X73)|~path(X74,X75,X73)|number_of_in(triangles,X73)=number_of_in(sequential_pairs,X73)))&(~triangle(esk10_1(X73),esk11_1(X73),X78)|~path(X74,X75,X73)|number_of_in(triangles,X73)=number_of_in(sequential_pairs,X73))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[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)],[sequential_pairs_and_triangles])])])])])])])])). 0.07/0.28 cnf(c_0_19, negated_conjecture, (~less_or_equal(minus(length_of(esk7_0),n1),number_of_in(triangles,graph))), inference(split_conjunct,[status(thm)],[c_0_10])). 0.07/0.28 cnf(c_0_20, negated_conjecture, (length_of(esk7_0)=number_of_in(edges,esk7_0)), inference(spm,[status(thm)],[c_0_14, c_0_15])). 0.07/0.28 cnf(c_0_21, plain, (minus(length_of(X3),n1)=number_of_in(sequential_pairs,X3)|~path(X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.07/0.28 cnf(c_0_22, lemma, (triangle(X1,X2,esk12_4(X4,X5,X1,X2))|~complete|~sequential(X1,X2)|~precedes(X1,X2,X3)|~shortest_path(X4,X5,X3)), inference(split_conjunct,[status(thm)],[c_0_17])). 0.07/0.28 cnf(c_0_23, negated_conjecture, (complete), inference(split_conjunct,[status(thm)],[c_0_10])). 0.07/0.28 fof(c_0_24, plain, ![X18, X19, X20, X21, X22, X23]:((~sequential(X21,X22)|~on_path(X22,X18)|~on_path(X21,X18)|precedes(X21,X22,X18)|~path(X19,X20,X18))&(~sequential(X21,X23)|~precedes(X23,X22,X18)|~on_path(X22,X18)|~on_path(X21,X18)|precedes(X21,X22,X18)|~path(X19,X20,X18))), inference(distribute,[status(thm)],[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)],[precedes_defn])])])])])])). 0.07/0.28 fof(c_0_25, plain, ![X88, X89]:less_or_equal(number_of_in(X88,X89),number_of_in(X88,graph)), inference(variable_rename,[status(thm)],[graph_has_them_all])). 0.07/0.28 cnf(c_0_26, plain, (on_path(esk11_1(X1),X1)|number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|~path(X2,X3,X1)), inference(split_conjunct,[status(thm)],[c_0_18])). 0.07/0.28 cnf(c_0_27, negated_conjecture, (~less_or_equal(minus(number_of_in(edges,esk7_0),n1),number_of_in(triangles,graph))), inference(rw,[status(thm)],[c_0_19, c_0_20])). 0.07/0.28 cnf(c_0_28, negated_conjecture, (minus(number_of_in(edges,esk7_0),n1)=number_of_in(sequential_pairs,esk7_0)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_15]), c_0_20])). 0.07/0.28 cnf(c_0_29, lemma, (triangle(X1,X2,esk12_4(X3,X4,X1,X2))|~shortest_path(X3,X4,X5)|~precedes(X1,X2,X5)|~sequential(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22, c_0_23])])). 0.07/0.28 cnf(c_0_30, plain, (precedes(X1,X2,X3)|~sequential(X1,X2)|~on_path(X2,X3)|~on_path(X1,X3)|~path(X4,X5,X3)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.07/0.28 cnf(c_0_31, plain, (less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph))), inference(split_conjunct,[status(thm)],[c_0_25])). 0.07/0.28 cnf(c_0_32, negated_conjecture, (number_of_in(triangles,esk7_0)=number_of_in(sequential_pairs,esk7_0)|on_path(esk11_1(esk7_0),esk7_0)), inference(spm,[status(thm)],[c_0_26, c_0_15])). 0.07/0.28 cnf(c_0_33, negated_conjecture, (~less_or_equal(number_of_in(sequential_pairs,esk7_0),number_of_in(triangles,graph))), inference(rw,[status(thm)],[c_0_27, c_0_28])). 0.07/0.28 cnf(c_0_34, plain, (sequential(esk10_1(X1),esk11_1(X1))|number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|~path(X2,X3,X1)), inference(split_conjunct,[status(thm)],[c_0_18])). 0.07/0.28 cnf(c_0_35, plain, (on_path(esk10_1(X1),X1)|number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|~path(X2,X3,X1)), inference(split_conjunct,[status(thm)],[c_0_18])). 0.07/0.28 cnf(c_0_36, plain, (number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|~triangle(esk10_1(X1),esk11_1(X1),X2)|~path(X3,X4,X1)), inference(split_conjunct,[status(thm)],[c_0_18])). 0.07/0.28 cnf(c_0_37, negated_conjecture, (triangle(X1,X2,esk12_4(esk8_0,esk9_0,X1,X2))|~precedes(X1,X2,esk7_0)|~sequential(X1,X2)), inference(spm,[status(thm)],[c_0_29, c_0_13])). 0.07/0.28 cnf(c_0_38, negated_conjecture, (precedes(X1,X2,esk7_0)|~sequential(X1,X2)|~on_path(X2,esk7_0)|~on_path(X1,esk7_0)), inference(spm,[status(thm)],[c_0_30, c_0_15])). 0.07/0.28 cnf(c_0_39, negated_conjecture, (on_path(esk11_1(esk7_0),esk7_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_33])). 0.07/0.28 cnf(c_0_40, negated_conjecture, (number_of_in(triangles,esk7_0)=number_of_in(sequential_pairs,esk7_0)|sequential(esk10_1(esk7_0),esk11_1(esk7_0))), inference(spm,[status(thm)],[c_0_34, c_0_15])). 0.07/0.28 cnf(c_0_41, negated_conjecture, (number_of_in(triangles,esk7_0)=number_of_in(sequential_pairs,esk7_0)|on_path(esk10_1(esk7_0),esk7_0)), inference(spm,[status(thm)],[c_0_35, c_0_15])). 0.07/0.28 cnf(c_0_42, negated_conjecture, (number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|~precedes(esk10_1(X1),esk11_1(X1),esk7_0)|~path(X2,X3,X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_34])). 0.07/0.28 cnf(c_0_43, negated_conjecture, (precedes(X1,esk11_1(esk7_0),esk7_0)|~sequential(X1,esk11_1(esk7_0))|~on_path(X1,esk7_0)), inference(spm,[status(thm)],[c_0_38, c_0_39])). 0.07/0.28 cnf(c_0_44, negated_conjecture, (sequential(esk10_1(esk7_0),esk11_1(esk7_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_40]), c_0_33])). 0.07/0.28 cnf(c_0_45, negated_conjecture, (on_path(esk10_1(esk7_0),esk7_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_41]), c_0_33])). 0.07/0.28 cnf(c_0_46, negated_conjecture, (number_of_in(triangles,esk7_0)=number_of_in(sequential_pairs,esk7_0)|~path(X1,X2,esk7_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_43]), c_0_44]), c_0_45])])). 0.07/0.28 cnf(c_0_47, negated_conjecture, (number_of_in(triangles,esk7_0)=number_of_in(sequential_pairs,esk7_0)), inference(spm,[status(thm)],[c_0_46, c_0_15])). 0.07/0.28 cnf(c_0_48, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_47]), c_0_33]), ['proof']). 0.07/0.28 # SZS output end CNFRefutation 0.07/0.28 # Proof object total steps : 49 0.07/0.28 # Proof object clause steps : 32 0.07/0.28 # Proof object formula steps : 17 0.07/0.28 # Proof object conjectures : 24 0.07/0.28 # Proof object clause conjectures : 21 0.07/0.28 # Proof object formula conjectures : 3 0.07/0.28 # Proof object initial clauses used : 13 0.07/0.28 # Proof object initial formulas used : 8 0.07/0.28 # Proof object generating inferences : 16 0.07/0.28 # Proof object simplifying inferences : 13 0.07/0.28 # Training examples: 0 positive, 0 negative 0.07/0.28 # Parsed axioms : 19 0.07/0.28 # Removed by relevancy pruning/SinE : 0 0.07/0.28 # Initial clauses : 63 0.07/0.28 # Removed in clause preprocessing : 1 0.07/0.28 # Initial clauses in saturation : 62 0.07/0.28 # Processed clauses : 460 0.07/0.28 # ...of these trivial : 11 0.07/0.28 # ...subsumed : 89 0.07/0.28 # ...remaining for further processing : 360 0.07/0.28 # Other redundant clauses eliminated : 15 0.07/0.28 # Clauses deleted for lack of memory : 0 0.07/0.28 # Backward-subsumed : 5 0.07/0.28 # Backward-rewritten : 9 0.07/0.28 # Generated clauses : 1462 0.07/0.28 # ...of the previous two non-trivial : 1279 0.07/0.28 # Contextual simplify-reflections : 111 0.07/0.28 # Paramodulations : 1404 0.07/0.28 # Factorizations : 30 0.07/0.28 # Equation resolutions : 28 0.07/0.28 # Propositional unsat checks : 0 0.07/0.28 # Propositional check models : 0 0.07/0.28 # Propositional check unsatisfiable : 0 0.07/0.28 # Propositional clauses : 0 0.07/0.28 # Propositional clauses after purity: 0 0.07/0.28 # Propositional unsat core size : 0 0.07/0.28 # Current number of processed clauses : 282 0.07/0.28 # Positive orientable unit clauses : 20 0.07/0.28 # Positive unorientable unit clauses: 0 0.07/0.28 # Negative unit clauses : 7 0.07/0.28 # Non-unit-clauses : 255 0.07/0.28 # Current number of unprocessed clauses: 839 0.07/0.28 # ...number of literals in the above : 5049 0.07/0.28 # Current number of archived formulas : 0 0.07/0.28 # Current number of archived clauses : 76 0.07/0.28 # Clause-clause subsumption calls (NU) : 9546 0.07/0.28 # Rec. Clause-clause subsumption calls : 3449 0.07/0.28 # Non-unit clause-clause subsumptions : 193 0.07/0.28 # Unit Clause-clause subsumption calls : 525 0.07/0.28 # Rewrite failures with RHS unbound : 0 0.07/0.28 # BW rewrite match attempts : 7 0.07/0.28 # BW rewrite match successes : 7 0.07/0.28 # Condensation attempts : 0 0.07/0.28 # Condensation successes : 0 0.07/0.28 # Termbank termtop insertions : 38419 0.07/0.28 0.07/0.28 # ------------------------------------------------- 0.07/0.28 # User time : 0.040 s 0.07/0.28 # System time : 0.004 s 0.07/0.28 # Total time : 0.043 s 0.07/0.28 # Maximum resident set size: 1560 pages 0.07/0.28 EOF