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 : n158.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:18:10 CDT 2018 0.03/0.24 % CPUTime : 0.03/0.24 # Version: 2.2pre001 0.06/0.31 # No SInE strategy applied 0.06/0.31 # Trying AutoSched0 for 151 seconds 1.59/1.79 # AutoSched0-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y 1.59/1.79 # and selection function SelectMaxLComplexAvoidPosPred. 1.59/1.79 # 1.59/1.79 # Preprocessing time : 0.351 s 1.59/1.79 # Presaturation interreduction done 1.59/1.79 1.59/1.79 # Proof found! 1.59/1.79 # SZS status Theorem 1.59/1.79 # SZS output start CNFRefutation 1.59/1.79 fof(query155, conjecture, ~(disjointwith(c_xskijump_thegame,c_tptpcol_16_35301)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', query155)). 1.59/1.79 fof(ax2_7583, axiom, ![X3, X4]:(collection(X3)<=disjointwith(X3,X4)), file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax', ax2_7583)). 1.59/1.79 fof(ax2_3089, axiom, ![X7]:~((individual(X7)&collection(X7))), file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax', ax2_3089)). 1.59/1.79 fof(ax2_185, axiom, individual(c_xskijump_thegame), file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax', ax2_185)). 1.59/1.79 fof(c_0_4, negated_conjecture, ~(~(disjointwith(c_xskijump_thegame,c_tptpcol_16_35301))), inference(assume_negation,[status(cth)],[query155])). 1.59/1.79 fof(c_0_5, plain, ![X2949, X2950]:(~disjointwith(X2949,X2950)|collection(X2949)), 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)],[ax2_7583])])])])])). 1.59/1.79 fof(c_0_6, negated_conjecture, disjointwith(c_xskijump_thegame,c_tptpcol_16_35301), inference(fof_simplification,[status(thm)],[c_0_4])). 1.59/1.79 fof(c_0_7, plain, ![X2843]:(~individual(X2843)|~collection(X2843)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_3089])])). 1.59/1.79 cnf(c_0_8, plain, (collection(X1)|~disjointwith(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_5])). 1.59/1.79 cnf(c_0_9, negated_conjecture, (disjointwith(c_xskijump_thegame,c_tptpcol_16_35301)), inference(split_conjunct,[status(thm)],[c_0_6])). 1.59/1.79 cnf(c_0_10, plain, (~individual(X1)|~collection(X1)), inference(split_conjunct,[status(thm)],[c_0_7])). 1.59/1.79 cnf(c_0_11, negated_conjecture, (collection(c_xskijump_thegame)), inference(spm,[status(thm)],[c_0_8, c_0_9])). 1.59/1.79 cnf(c_0_12, plain, (individual(c_xskijump_thegame)), inference(split_conjunct,[status(thm)],[ax2_185])). 1.59/1.79 cnf(c_0_13, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12])]), ['proof']). 1.59/1.79 # SZS output end CNFRefutation 1.59/1.79 # Proof object total steps : 14 1.59/1.79 # Proof object clause steps : 6 1.59/1.79 # Proof object formula steps : 8 1.59/1.79 # Proof object conjectures : 6 1.59/1.79 # Proof object clause conjectures : 3 1.59/1.79 # Proof object formula conjectures : 3 1.59/1.79 # Proof object initial clauses used : 4 1.59/1.79 # Proof object initial formulas used : 4 1.59/1.79 # Proof object generating inferences : 2 1.59/1.79 # Proof object simplifying inferences : 2 1.59/1.79 # Training examples: 0 positive, 0 negative 1.59/1.79 # Parsed axioms : 8006 1.59/1.79 # Removed by relevancy pruning/SinE : 0 1.59/1.79 # Initial clauses : 8006 1.59/1.79 # Removed in clause preprocessing : 0 1.59/1.79 # Initial clauses in saturation : 8006 1.59/1.79 # Processed clauses : 15352 1.59/1.79 # ...of these trivial : 338 1.59/1.79 # ...subsumed : 338 1.59/1.79 # ...remaining for further processing : 14676 1.59/1.79 # Other redundant clauses eliminated : 0 1.59/1.79 # Clauses deleted for lack of memory : 0 1.59/1.79 # Backward-subsumed : 0 1.59/1.79 # Backward-rewritten : 14 1.59/1.79 # Generated clauses : 22983 1.59/1.79 # ...of the previous two non-trivial : 20858 1.59/1.79 # Contextual simplify-reflections : 20 1.59/1.79 # Paramodulations : 22983 1.59/1.79 # Factorizations : 0 1.59/1.79 # Equation resolutions : 0 1.59/1.79 # Propositional unsat checks : 0 1.59/1.79 # Propositional check models : 0 1.59/1.79 # Propositional check unsatisfiable : 0 1.59/1.79 # Propositional clauses : 0 1.59/1.79 # Propositional clauses after purity: 0 1.59/1.79 # Propositional unsat core size : 0 1.59/1.79 # Current number of processed clauses : 7344 1.59/1.79 # Positive orientable unit clauses : 2923 1.59/1.79 # Positive unorientable unit clauses: 0 1.59/1.79 # Negative unit clauses : 42 1.59/1.79 # Non-unit-clauses : 4379 1.59/1.79 # Current number of unprocessed clauses: 20830 1.59/1.79 # ...number of literals in the above : 38866 1.59/1.79 # Current number of archived formulas : 0 1.59/1.79 # Current number of archived clauses : 7332 1.59/1.79 # Clause-clause subsumption calls (NU) : 4296004 1.59/1.79 # Rec. Clause-clause subsumption calls : 4011305 1.59/1.79 # Non-unit clause-clause subsumptions : 358 1.59/1.79 # Unit Clause-clause subsumption calls : 92363 1.59/1.79 # Rewrite failures with RHS unbound : 0 1.59/1.79 # BW rewrite match attempts : 5102 1.59/1.79 # BW rewrite match successes : 14 1.59/1.79 # Condensation attempts : 0 1.59/1.79 # Condensation successes : 0 1.59/1.79 # Termbank termtop insertions : 525343 1.59/1.80 1.59/1.80 # ------------------------------------------------- 1.59/1.80 # User time : 1.504 s 1.59/1.80 # System time : 0.055 s 1.59/1.80 # Total time : 1.559 s 1.59/1.80 # Maximum resident set size: 8688 pages 1.59/1.80 EOF