0.00/0.04 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.05 % 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.28 % Computer : n129.star.cs.uiowa.edu 0.03/0.28 % Model : x86_64 x86_64 0.03/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.28 % Memory : 32218.625MB 0.03/0.28 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.28 % CPULimit : 300 0.03/0.28 % DateTime : Fri Jul 13 14:53:02 CDT 2018 0.03/0.28 % CPUTime : 0.03/0.28 # Version: 2.2pre001 0.03/0.28 # No SInE strategy applied 0.03/0.28 # Trying AutoSched0 for 151 seconds 0.03/0.29 # AutoSched0-Mode selected heuristic G_E___200_C45_F1_SE_CS_SP_PI_CO_S0V 0.03/0.29 # and selection function PSelectComplexExceptRRHorn. 0.03/0.29 # 0.03/0.29 # Preprocessing time : 0.010 s 0.03/0.29 0.03/0.29 # Proof found! 0.03/0.29 # SZS status Theorem 0.03/0.29 # SZS output start CNFRefutation 0.03/0.29 fof(l33_co, conjecture, ![X1, X2, X3, X4]:(contains_slb(X2,X4)<=ok(remove_cpq(triple(X1,X2,X3),X4))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', l33_co)). 0.03/0.29 fof(ax43, axiom, ![X1, X2, X3, X4]:(~(contains_slb(X2,X4))=>triple(X1,X2,bad)=remove_cpq(triple(X1,X2,X3),X4)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax', ax43)). 0.03/0.29 fof(ax40, axiom, ![X1, X2]:(ok(triple(X1,X2,bad))<=>~$true), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax', ax40)). 0.03/0.29 fof(c_0_3, negated_conjecture, ~(![X1, X2, X3, X4]:(contains_slb(X2,X4)<=ok(remove_cpq(triple(X1,X2,X3),X4)))), inference(assume_negation,[status(cth)],[l33_co])). 0.03/0.29 fof(c_0_4, negated_conjecture, (ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))&~contains_slb(esk2_0,esk4_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3])])])])). 0.03/0.29 fof(c_0_5, plain, ![X53, X54, X55, X56]:(contains_slb(X54,X56)|triple(X53,X54,bad)=remove_cpq(triple(X53,X54,X55),X56)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax43])])])). 0.03/0.29 fof(c_0_6, plain, ![X106, X107]:~ok(triple(X106,X107,bad)), inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[ax40])])). 0.03/0.29 cnf(c_0_7, negated_conjecture, (ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))), inference(split_conjunct,[status(thm)],[c_0_4])). 0.03/0.29 cnf(c_0_8, plain, (contains_slb(X1,X2)|triple(X3,X1,bad)=remove_cpq(triple(X3,X1,X4),X2)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.03/0.29 cnf(c_0_9, plain, (~ok(triple(X1,X2,bad))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.03/0.29 cnf(c_0_10, negated_conjecture, (~contains_slb(esk2_0,esk4_0)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.03/0.29 cnf(c_0_11, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8]), c_0_9]), c_0_10]), ['proof']). 0.03/0.29 # SZS output end CNFRefutation 0.03/0.29 # Proof object total steps : 12 0.03/0.29 # Proof object clause steps : 5 0.03/0.29 # Proof object formula steps : 7 0.03/0.29 # Proof object conjectures : 6 0.03/0.29 # Proof object clause conjectures : 3 0.03/0.29 # Proof object formula conjectures : 3 0.03/0.29 # Proof object initial clauses used : 4 0.03/0.29 # Proof object initial formulas used : 3 0.03/0.29 # Proof object generating inferences : 1 0.03/0.29 # Proof object simplifying inferences : 2 0.03/0.29 # Training examples: 0 positive, 0 negative 0.03/0.29 # Parsed axioms : 42 0.03/0.29 # Removed by relevancy pruning/SinE : 0 0.03/0.29 # Initial clauses : 52 0.03/0.29 # Removed in clause preprocessing : 2 0.03/0.29 # Initial clauses in saturation : 50 0.03/0.29 # Processed clauses : 37 0.03/0.29 # ...of these trivial : 0 0.03/0.29 # ...subsumed : 0 0.03/0.29 # ...remaining for further processing : 37 0.03/0.29 # Other redundant clauses eliminated : 1 0.03/0.29 # Clauses deleted for lack of memory : 0 0.03/0.29 # Backward-subsumed : 0 0.03/0.29 # Backward-rewritten : 0 0.03/0.29 # Generated clauses : 17 0.03/0.29 # ...of the previous two non-trivial : 10 0.03/0.29 # Contextual simplify-reflections : 1 0.03/0.29 # Paramodulations : 14 0.03/0.29 # Factorizations : 2 0.03/0.29 # Equation resolutions : 1 0.03/0.29 # Propositional unsat checks : 0 0.03/0.29 # Propositional check models : 0 0.03/0.29 # Propositional check unsatisfiable : 0 0.03/0.29 # Propositional clauses : 0 0.03/0.29 # Propositional clauses after purity: 0 0.03/0.29 # Propositional unsat core size : 0 0.03/0.29 # Current number of processed clauses : 36 0.03/0.29 # Positive orientable unit clauses : 11 0.03/0.29 # Positive unorientable unit clauses: 0 0.03/0.29 # Negative unit clauses : 5 0.03/0.29 # Non-unit-clauses : 20 0.03/0.29 # Current number of unprocessed clauses: 22 0.03/0.29 # ...number of literals in the above : 56 0.03/0.29 # Current number of archived formulas : 0 0.03/0.29 # Current number of archived clauses : 2 0.03/0.29 # Clause-clause subsumption calls (NU) : 39 0.03/0.29 # Rec. Clause-clause subsumption calls : 28 0.03/0.29 # Non-unit clause-clause subsumptions : 1 0.03/0.29 # Unit Clause-clause subsumption calls : 10 0.03/0.29 # Rewrite failures with RHS unbound : 0 0.03/0.29 # BW rewrite match attempts : 1 0.03/0.29 # BW rewrite match successes : 0 0.03/0.29 # Condensation attempts : 37 0.03/0.29 # Condensation successes : 0 0.03/0.29 # Termbank termtop insertions : 3506 0.03/0.29 0.03/0.29 # ------------------------------------------------- 0.03/0.29 # User time : 0.012 s 0.03/0.29 # System time : 0.001 s 0.03/0.29 # Total time : 0.013 s 0.03/0.29 # Maximum resident set size: 1580 pages 0.09/0.35 EOF