0.09/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.09/0.10 % Command : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s 0.10/0.31 % Computer : n018.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 960 0.10/0.31 % WCLimit : 120 0.10/0.31 % DateTime : Thu Jul 2 06:43:52 EDT 2020 0.10/0.31 % CPUTime : 0.10/0.31 # Version: 2.5pre002 0.10/0.31 # No SInE strategy applied 0.10/0.31 # Trying AutoSched0 for 59 seconds 0.16/0.34 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S076A 0.16/0.34 # and selection function SelectCQIAr. 0.16/0.34 # 0.16/0.34 # Preprocessing time : 0.026 s 0.16/0.34 # Presaturation interreduction done 0.16/0.34 0.16/0.34 # Proof found! 0.16/0.34 # SZS status Theorem 0.16/0.34 # SZS output start CNFRefutation 0.16/0.34 fof(goal_to_be_proved, conjecture, goal, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', goal_to_be_proved)). 0.16/0.34 fof(goal_ax, axiom, ![X1]:((reflexive_rewrite(c,X1)&reflexive_rewrite(b,X1))=>goal), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', goal_ax)). 0.16/0.34 fof(equal_in_reflexive_rewrite, axiom, ![X1, X2]:(X1=X2=>reflexive_rewrite(X1,X2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', equal_in_reflexive_rewrite)). 0.16/0.34 fof(equal_or_rewrite, axiom, ![X1, X2]:(reflexive_rewrite(X1,X2)=>(rewrite(X1,X2)|X2=X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', equal_or_rewrite)). 0.16/0.34 fof(assumption, axiom, (reflexive_rewrite(a,b)&reflexive_rewrite(a,c)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', assumption)). 0.16/0.34 fof(rewrite_diamond, axiom, ![X1, X2, X3]:(?[X4]:(rewrite(X3,X4)&rewrite(X2,X4))<=(rewrite(X1,X2)&rewrite(X1,X3))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', rewrite_diamond)). 0.16/0.34 fof(rewrite_in_reflexive_rewrite, axiom, ![X1, X2]:(rewrite(X1,X2)=>reflexive_rewrite(X1,X2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', rewrite_in_reflexive_rewrite)). 0.16/0.34 fof(c_0_7, negated_conjecture, ~(goal), inference(assume_negation,[status(cth)],[goal_to_be_proved])). 0.16/0.34 fof(c_0_8, plain, ![X11]:(~reflexive_rewrite(c,X11)|~reflexive_rewrite(b,X11)|goal), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[goal_ax])])). 0.16/0.34 fof(c_0_9, negated_conjecture, ~goal, inference(fof_simplification,[status(thm)],[c_0_7])). 0.16/0.34 fof(c_0_10, plain, ![X5, X6]:(X5!=X6|reflexive_rewrite(X5,X6)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_in_reflexive_rewrite])])). 0.16/0.34 cnf(c_0_11, plain, (goal|~reflexive_rewrite(c,X1)|~reflexive_rewrite(b,X1)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.16/0.34 cnf(c_0_12, negated_conjecture, (~goal), inference(split_conjunct,[status(thm)],[c_0_9])). 0.16/0.34 cnf(c_0_13, plain, (reflexive_rewrite(X1,X2)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_10])). 0.16/0.34 fof(c_0_14, plain, ![X14, X15]:(~reflexive_rewrite(X14,X15)|(rewrite(X14,X15)|X15=X14)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_or_rewrite])])). 0.16/0.34 cnf(c_0_15, plain, (~reflexive_rewrite(c,X1)|~reflexive_rewrite(b,X1)), inference(sr,[status(thm)],[c_0_11, c_0_12])). 0.16/0.34 cnf(c_0_16, plain, (reflexive_rewrite(X1,X1)), inference(er,[status(thm)],[c_0_13])). 0.16/0.34 cnf(c_0_17, plain, (rewrite(X1,X2)|X2=X1|~reflexive_rewrite(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_14])). 0.16/0.34 cnf(c_0_18, plain, (reflexive_rewrite(a,b)), inference(split_conjunct,[status(thm)],[assumption])). 0.16/0.34 cnf(c_0_19, plain, (reflexive_rewrite(a,c)), inference(split_conjunct,[status(thm)],[assumption])). 0.16/0.34 fof(c_0_20, plain, ![X7, X8, X9]:((rewrite(X9,esk1_3(X7,X8,X9))|(~rewrite(X7,X8)|~rewrite(X7,X9)))&(rewrite(X8,esk1_3(X7,X8,X9))|(~rewrite(X7,X8)|~rewrite(X7,X9)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[rewrite_diamond])])])])])). 0.16/0.34 cnf(c_0_21, plain, (~reflexive_rewrite(b,c)), inference(spm,[status(thm)],[c_0_15, c_0_16])). 0.16/0.34 cnf(c_0_22, plain, (b=a|rewrite(a,b)), inference(spm,[status(thm)],[c_0_17, c_0_18])). 0.16/0.34 cnf(c_0_23, plain, (a=c|rewrite(a,c)), inference(spm,[status(thm)],[c_0_17, c_0_19])). 0.16/0.34 cnf(c_0_24, plain, (rewrite(X1,esk1_3(X2,X1,X3))|~rewrite(X2,X1)|~rewrite(X2,X3)), inference(split_conjunct,[status(thm)],[c_0_20])). 0.16/0.34 cnf(c_0_25, plain, (rewrite(a,b)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_19])])). 0.16/0.34 cnf(c_0_26, plain, (rewrite(a,c)|reflexive_rewrite(c,b)), inference(spm,[status(thm)],[c_0_18, c_0_23])). 0.16/0.34 fof(c_0_27, plain, ![X12, X13]:(~rewrite(X12,X13)|reflexive_rewrite(X12,X13)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rewrite_in_reflexive_rewrite])])). 0.16/0.34 cnf(c_0_28, plain, (rewrite(X1,esk1_3(a,X1,b))|~rewrite(a,X1)), inference(spm,[status(thm)],[c_0_24, c_0_25])). 0.16/0.34 cnf(c_0_29, plain, (rewrite(a,c)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_26]), c_0_16])])). 0.16/0.34 cnf(c_0_30, plain, (rewrite(X1,esk1_3(X2,X3,X1))|~rewrite(X2,X3)|~rewrite(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_20])). 0.16/0.34 cnf(c_0_31, plain, (reflexive_rewrite(X1,X2)|~rewrite(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_27])). 0.16/0.34 cnf(c_0_32, plain, (rewrite(c,esk1_3(a,c,b))), inference(spm,[status(thm)],[c_0_28, c_0_29])). 0.16/0.34 cnf(c_0_33, plain, (rewrite(X1,esk1_3(a,c,X1))|~rewrite(a,X1)), inference(spm,[status(thm)],[c_0_30, c_0_29])). 0.16/0.34 cnf(c_0_34, plain, (reflexive_rewrite(c,esk1_3(a,c,b))), inference(spm,[status(thm)],[c_0_31, c_0_32])). 0.16/0.34 cnf(c_0_35, plain, (rewrite(b,esk1_3(a,c,b))), inference(spm,[status(thm)],[c_0_33, c_0_25])). 0.16/0.34 cnf(c_0_36, plain, (~reflexive_rewrite(b,esk1_3(a,c,b))), inference(spm,[status(thm)],[c_0_15, c_0_34])). 0.16/0.34 cnf(c_0_37, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_35]), c_0_36]), ['proof']). 0.16/0.34 # SZS output end CNFRefutation 0.16/0.34 # Proof object total steps : 38 0.16/0.34 # Proof object clause steps : 24 0.16/0.34 # Proof object formula steps : 14 0.16/0.34 # Proof object conjectures : 4 0.16/0.34 # Proof object clause conjectures : 1 0.16/0.34 # Proof object formula conjectures : 3 0.16/0.34 # Proof object initial clauses used : 9 0.16/0.34 # Proof object initial formulas used : 7 0.16/0.34 # Proof object generating inferences : 13 0.16/0.34 # Proof object simplifying inferences : 7 0.16/0.34 # Training examples: 0 positive, 0 negative 0.16/0.34 # Parsed axioms : 7 0.16/0.34 # Removed by relevancy pruning/SinE : 0 0.16/0.34 # Initial clauses : 9 0.16/0.34 # Removed in clause preprocessing : 0 0.16/0.34 # Initial clauses in saturation : 9 0.16/0.34 # Processed clauses : 38 0.16/0.34 # ...of these trivial : 0 0.16/0.34 # ...subsumed : 0 0.16/0.34 # ...remaining for further processing : 38 0.16/0.34 # Other redundant clauses eliminated : 1 0.16/0.34 # Clauses deleted for lack of memory : 0 0.16/0.34 # Backward-subsumed : 0 0.16/0.34 # Backward-rewritten : 3 0.16/0.34 # Generated clauses : 47 0.16/0.34 # ...of the previous two non-trivial : 37 0.16/0.34 # Contextual simplify-reflections : 0 0.16/0.34 # Paramodulations : 46 0.16/0.34 # Factorizations : 0 0.16/0.34 # Equation resolutions : 1 0.16/0.34 # Propositional unsat checks : 0 0.16/0.34 # Propositional check models : 0 0.16/0.34 # Propositional check unsatisfiable : 0 0.16/0.34 # Propositional clauses : 0 0.16/0.34 # Propositional clauses after purity: 0 0.16/0.34 # Propositional unsat core size : 0 0.16/0.34 # Propositional preprocessing time : 0.000 0.16/0.34 # Propositional encoding time : 0.000 0.16/0.34 # Propositional solver time : 0.000 0.16/0.34 # Success case prop preproc time : 0.000 0.16/0.34 # Success case prop encoding time : 0.000 0.16/0.34 # Success case prop solver time : 0.000 0.16/0.34 # Current number of processed clauses : 25 0.16/0.34 # Positive orientable unit clauses : 13 0.16/0.34 # Positive unorientable unit clauses: 0 0.16/0.34 # Negative unit clauses : 3 0.16/0.34 # Non-unit-clauses : 9 0.16/0.34 # Current number of unprocessed clauses: 15 0.16/0.34 # ...number of literals in the above : 27 0.16/0.34 # Current number of archived formulas : 0 0.16/0.34 # Current number of archived clauses : 12 0.16/0.34 # Clause-clause subsumption calls (NU) : 9 0.16/0.34 # Rec. Clause-clause subsumption calls : 9 0.16/0.34 # Non-unit clause-clause subsumptions : 0 0.16/0.34 # Unit Clause-clause subsumption calls : 1 0.16/0.34 # Rewrite failures with RHS unbound : 0 0.16/0.34 # BW rewrite match attempts : 10 0.16/0.34 # BW rewrite match successes : 2 0.16/0.34 # Condensation attempts : 0 0.16/0.34 # Condensation successes : 0 0.16/0.34 # Termbank termtop insertions : 1013 0.16/0.34 0.16/0.34 # ------------------------------------------------- 0.16/0.34 # User time : 0.029 s 0.16/0.34 # System time : 0.001 s 0.16/0.34 # Total time : 0.030 s 0.16/0.34 # Maximum resident set size: 1564 pages 0.16/0.34 EOF