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.03/0.36 % Computer : n136.star.cs.uiowa.edu 0.03/0.36 % Model : x86_64 x86_64 0.03/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.36 % Memory : 32218.625MB 0.03/0.36 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.36 % CPULimit : 300 0.03/0.36 % DateTime : Fri Jul 13 14:53:28 CDT 2018 0.03/0.36 % CPUTime : 0.03/0.36 # Version: 2.2pre001 0.06/0.46 # SinE strategy is gf600_h_gu_R05_F100_L20000 0.06/0.46 # Trying AutoSched0 for 151 seconds 0.19/0.56 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y 0.19/0.56 # and selection function SelectMaxLComplexAvoidPosPred. 0.19/0.56 # 0.19/0.56 # Preprocessing time : 0.039 s 0.19/0.56 # Presaturation interreduction done 0.19/0.56 0.19/0.56 # Proof found! 0.19/0.56 # SZS status Theorem 0.19/0.56 # SZS output start CNFRefutation 0.19/0.56 fof(synth_qa07_007_mira_news_1087, conjecture, ?[X1, X2]:obj(X2,X1), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', synth_qa07_007_mira_news_1087)). 0.19/0.56 fof(sub__bezeichnen_1_1_als, axiom, ![X1, X2, X3]:(((arg1(X1,X2)&arg2(X1,X3))&subr(X1,sub_0))=>?[X4, X5, X6]:(((((((arg1(X5,X2)&arg2(X5,X6))&hsit(X1,X4))&obj(X4,X2))&subr(X5,rprs_0))&subs(X4,bezeichnen_1_1))&sub(X6,X3))&mcont(X4,X5))), file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax', sub__bezeichnen_1_1_als)). 0.19/0.56 fof(sub__sub_0_expansion, axiom, ![X1, X2]:(sub(X1,X2)=>?[X3]:((arg1(X3,X1)&subr(X3,sub_0))&arg2(X3,X2))), file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax', sub__sub_0_expansion)). 0.19/0.56 fof(fact_9798, axiom, sub(singlepreis_1_1,preis_1_1), file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax', fact_9798)). 0.19/0.56 fof(c_0_4, negated_conjecture, ~(?[X1, X2]:obj(X2,X1)), inference(assume_negation,[status(cth)],[synth_qa07_007_mira_news_1087])). 0.19/0.56 fof(c_0_5, plain, ![X361, X362, X363]:((((((((arg1(esk48_3(X361,X362,X363),X362)|(~arg1(X361,X362)|~arg2(X361,X363)|~subr(X361,sub_0)))&(arg2(esk48_3(X361,X362,X363),esk49_3(X361,X362,X363))|(~arg1(X361,X362)|~arg2(X361,X363)|~subr(X361,sub_0))))&(hsit(X361,esk47_3(X361,X362,X363))|(~arg1(X361,X362)|~arg2(X361,X363)|~subr(X361,sub_0))))&(obj(esk47_3(X361,X362,X363),X362)|(~arg1(X361,X362)|~arg2(X361,X363)|~subr(X361,sub_0))))&(subr(esk48_3(X361,X362,X363),rprs_0)|(~arg1(X361,X362)|~arg2(X361,X363)|~subr(X361,sub_0))))&(subs(esk47_3(X361,X362,X363),bezeichnen_1_1)|(~arg1(X361,X362)|~arg2(X361,X363)|~subr(X361,sub_0))))&(sub(esk49_3(X361,X362,X363),X363)|(~arg1(X361,X362)|~arg2(X361,X363)|~subr(X361,sub_0))))&(mcont(esk47_3(X361,X362,X363),esk48_3(X361,X362,X363))|(~arg1(X361,X362)|~arg2(X361,X363)|~subr(X361,sub_0)))), inference(distribute,[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)],[sub__bezeichnen_1_1_als])])])])])])). 0.19/0.56 fof(c_0_6, negated_conjecture, ![X8, X9]:~obj(X9,X8), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])). 0.19/0.56 cnf(c_0_7, plain, (obj(esk47_3(X1,X2,X3),X2)|~arg1(X1,X2)|~arg2(X1,X3)|~subr(X1,sub_0)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.19/0.56 cnf(c_0_8, negated_conjecture, (~obj(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.19/0.56 fof(c_0_9, plain, ![X378, X379]:(((arg1(esk53_2(X378,X379),X378)|~sub(X378,X379))&(subr(esk53_2(X378,X379),sub_0)|~sub(X378,X379)))&(arg2(esk53_2(X378,X379),X379)|~sub(X378,X379))), inference(distribute,[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)],[sub__sub_0_expansion])])])])])])). 0.19/0.56 cnf(c_0_10, plain, (~subr(X1,sub_0)|~arg2(X1,X2)|~arg1(X1,X3)), inference(sr,[status(thm)],[c_0_7, c_0_8])). 0.19/0.56 cnf(c_0_11, plain, (subr(esk53_2(X1,X2),sub_0)|~sub(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.19/0.56 cnf(c_0_12, plain, (~arg2(esk53_2(X1,X2),X3)|~arg1(esk53_2(X1,X2),X4)|~sub(X1,X2)), inference(spm,[status(thm)],[c_0_10, c_0_11])). 0.19/0.56 cnf(c_0_13, plain, (arg2(esk53_2(X1,X2),X2)|~sub(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.19/0.56 cnf(c_0_14, plain, (~arg1(esk53_2(X1,X2),X3)|~sub(X1,X2)), inference(spm,[status(thm)],[c_0_12, c_0_13])). 0.19/0.56 cnf(c_0_15, plain, (arg1(esk53_2(X1,X2),X1)|~sub(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.19/0.56 cnf(c_0_16, plain, (sub(singlepreis_1_1,preis_1_1)), inference(split_conjunct,[status(thm)],[fact_9798])). 0.19/0.56 cnf(c_0_17, plain, (~sub(X1,X2)), inference(spm,[status(thm)],[c_0_14, c_0_15])). 0.19/0.56 cnf(c_0_18, plain, ($false), inference(sr,[status(thm)],[c_0_16, c_0_17]), ['proof']). 0.19/0.56 # SZS output end CNFRefutation 0.19/0.56 # Proof object total steps : 19 0.19/0.56 # Proof object clause steps : 11 0.19/0.56 # Proof object formula steps : 8 0.19/0.56 # Proof object conjectures : 4 0.19/0.56 # Proof object clause conjectures : 1 0.19/0.56 # Proof object formula conjectures : 3 0.19/0.56 # Proof object initial clauses used : 6 0.19/0.56 # Proof object initial formulas used : 4 0.19/0.56 # Proof object generating inferences : 3 0.19/0.56 # Proof object simplifying inferences : 2 0.19/0.56 # Training examples: 0 positive, 0 negative 0.19/0.56 # Parsed axioms : 10189 0.19/0.56 # Removed by relevancy pruning/SinE : 9935 0.19/0.56 # Initial clauses : 457 0.19/0.56 # Removed in clause preprocessing : 0 0.19/0.56 # Initial clauses in saturation : 457 0.19/0.56 # Processed clauses : 746 0.19/0.56 # ...of these trivial : 0 0.19/0.56 # ...subsumed : 79 0.19/0.56 # ...remaining for further processing : 667 0.19/0.56 # Other redundant clauses eliminated : 0 0.19/0.56 # Clauses deleted for lack of memory : 0 0.19/0.56 # Backward-subsumed : 8 0.19/0.56 # Backward-rewritten : 0 0.19/0.56 # Generated clauses : 393 0.19/0.56 # ...of the previous two non-trivial : 368 0.19/0.56 # Contextual simplify-reflections : 44 0.19/0.56 # Paramodulations : 373 0.19/0.56 # Factorizations : 0 0.19/0.56 # Equation resolutions : 0 0.19/0.56 # Propositional unsat checks : 0 0.19/0.56 # Propositional check models : 0 0.19/0.56 # Propositional check unsatisfiable : 0 0.19/0.56 # Propositional clauses : 0 0.19/0.56 # Propositional clauses after purity: 0 0.19/0.56 # Propositional unsat core size : 0 0.19/0.56 # Current number of processed clauses : 268 0.19/0.56 # Positive orientable unit clauses : 186 0.19/0.56 # Positive unorientable unit clauses: 0 0.19/0.56 # Negative unit clauses : 7 0.19/0.56 # Non-unit-clauses : 75 0.19/0.56 # Current number of unprocessed clauses: 420 0.19/0.56 # ...number of literals in the above : 1099 0.19/0.56 # Current number of archived formulas : 0 0.19/0.56 # Current number of archived clauses : 399 0.19/0.56 # Clause-clause subsumption calls (NU) : 25760 0.19/0.56 # Rec. Clause-clause subsumption calls : 12195 0.19/0.56 # Non-unit clause-clause subsumptions : 92 0.19/0.56 # Unit Clause-clause subsumption calls : 159 0.19/0.56 # Rewrite failures with RHS unbound : 0 0.19/0.56 # BW rewrite match attempts : 0 0.19/0.56 # BW rewrite match successes : 0 0.19/0.56 # Condensation attempts : 0 0.19/0.56 # Condensation successes : 0 0.19/0.56 # Termbank termtop insertions : 67031 0.19/0.56 0.19/0.56 # ------------------------------------------------- 0.19/0.56 # User time : 0.139 s 0.19/0.56 # System time : 0.057 s 0.19/0.56 # Total time : 0.196 s 0.19/0.56 # Maximum resident set size: 47920 pages 0.26/0.75 EOF