0.00/0.04 % 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.26 % Computer : n021.star.cs.uiowa.edu 0.03/0.26 % Model : x86_64 x86_64 0.03/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.26 % Memory : 32218.625MB 0.03/0.26 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.26 % CPULimit : 300 0.03/0.26 % DateTime : Sat Jul 14 04:24:10 CDT 2018 0.03/0.26 % CPUTime : 0.03/0.26 # Version: 2.2pre001 0.03/0.26 # No SInE strategy applied 0.03/0.26 # Trying AutoSched0 for 151 seconds 0.03/0.27 # AutoSched0-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_CO_S4S 0.03/0.27 # and selection function SelectNewComplexAHPNS. 0.03/0.27 # 0.03/0.27 # Preprocessing time : 0.010 s 0.03/0.27 # Presaturation interreduction done 0.03/0.27 0.03/0.27 # Proof found! 0.03/0.27 # SZS status Theorem 0.03/0.27 # SZS output start CNFRefutation 0.03/0.27 fof(nota_isa_nota, conjecture, ![X1, X2, X11]:(nota(X2,X11)<=(nota(X1,X11)&isa(X1,X2))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', nota_isa_nota)). 0.03/0.27 fof(nota, axiom, ![X1, X2]:(nota(X1,X2)<=>?[X3, X4]:(status(X3,X4,X1)&~(status(X3,X4,X2)))), file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax', nota)). 0.03/0.27 fof(isa, axiom, ![X1, X2]:(isa(X1,X2)<=>![X3, X4]:(status(X3,X4,X2)<=status(X3,X4,X1))), file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax', isa)). 0.03/0.27 fof(c_0_3, negated_conjecture, ~(![X1, X2, X11]:(nota(X2,X11)<=(nota(X1,X11)&isa(X1,X2)))), inference(assume_negation,[status(cth)],[nota_isa_nota])). 0.03/0.27 fof(c_0_4, plain, ![X37, X38, X37, X38, X41, X42]:(((status(esk14_2(X37,X38),esk15_2(X37,X38),X37)|~nota(X37,X38))&(~status(esk14_2(X37,X38),esk15_2(X37,X38),X38)|~nota(X37,X38)))&(~status(X41,X42,X37)|status(X41,X42,X38)|nota(X37,X38))), 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)],[nota])])])])])])])])). 0.03/0.28 fof(c_0_5, negated_conjecture, ((nota(esk30_0,esk32_0)&isa(esk30_0,esk31_0))&~nota(esk31_0,esk32_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.28 fof(c_0_6, plain, ![X31, X32, X33, X34, X31, X32]:((~isa(X31,X32)|(~status(X33,X34,X31)|status(X33,X34,X32)))&((status(esk12_2(X31,X32),esk13_2(X31,X32),X31)|isa(X31,X32))&(~status(esk12_2(X31,X32),esk13_2(X31,X32),X32)|isa(X31,X32)))), 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)],[isa])])])])])])])])). 0.03/0.28 cnf(c_0_7, plain, (status(esk14_2(X1,X2),esk15_2(X1,X2),X1)|~nota(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.03/0.28 cnf(c_0_8, negated_conjecture, (nota(esk30_0,esk32_0)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.03/0.28 cnf(c_0_9, plain, (status(X3,X4,X2)|~isa(X1,X2)|~status(X3,X4,X1)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.03/0.28 cnf(c_0_10, negated_conjecture, (status(esk14_2(esk30_0,esk32_0),esk15_2(esk30_0,esk32_0),esk30_0)), inference(spm,[status(thm)],[c_0_7, c_0_8])). 0.03/0.28 cnf(c_0_11, negated_conjecture, (status(esk14_2(esk30_0,esk32_0),esk15_2(esk30_0,esk32_0),X1)|~isa(esk30_0,X1)), inference(spm,[status(thm)],[c_0_9, c_0_10])). 0.03/0.28 cnf(c_0_12, negated_conjecture, (isa(esk30_0,esk31_0)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.03/0.28 cnf(c_0_13, plain, (status(X1,X2,X4)|nota(X3,X4)|~status(X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.03/0.28 cnf(c_0_14, negated_conjecture, (status(esk14_2(esk30_0,esk32_0),esk15_2(esk30_0,esk32_0),esk31_0)), inference(spm,[status(thm)],[c_0_11, c_0_12])). 0.03/0.28 cnf(c_0_15, plain, (~status(esk14_2(X1,X2),esk15_2(X1,X2),X2)|~nota(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.03/0.28 cnf(c_0_16, negated_conjecture, (nota(esk31_0,X1)|status(esk14_2(esk30_0,esk32_0),esk15_2(esk30_0,esk32_0),X1)), inference(spm,[status(thm)],[c_0_13, c_0_14])). 0.03/0.28 cnf(c_0_17, negated_conjecture, (~nota(esk31_0,esk32_0)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.03/0.28 cnf(c_0_18, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_8])]), c_0_17]), ['proof']). 0.03/0.28 # SZS output end CNFRefutation 0.03/0.28 # Proof object total steps : 19 0.03/0.28 # Proof object clause steps : 12 0.03/0.28 # Proof object formula steps : 7 0.03/0.28 # Proof object conjectures : 11 0.03/0.28 # Proof object clause conjectures : 8 0.03/0.28 # Proof object formula conjectures : 3 0.03/0.28 # Proof object initial clauses used : 7 0.03/0.28 # Proof object initial formulas used : 3 0.03/0.28 # Proof object generating inferences : 5 0.03/0.28 # Proof object simplifying inferences : 3 0.03/0.28 # Training examples: 0 positive, 0 negative 0.03/0.28 # Parsed axioms : 14 0.03/0.28 # Removed by relevancy pruning/SinE : 0 0.03/0.28 # Initial clauses : 38 0.03/0.28 # Removed in clause preprocessing : 0 0.03/0.28 # Initial clauses in saturation : 38 0.03/0.28 # Processed clauses : 222 0.03/0.28 # ...of these trivial : 3 0.03/0.28 # ...subsumed : 41 0.03/0.28 # ...remaining for further processing : 178 0.03/0.28 # Other redundant clauses eliminated : 0 0.03/0.28 # Clauses deleted for lack of memory : 0 0.03/0.28 # Backward-subsumed : 0 0.03/0.28 # Backward-rewritten : 1 0.03/0.28 # Generated clauses : 438 0.03/0.28 # ...of the previous two non-trivial : 414 0.03/0.28 # Contextual simplify-reflections : 6 0.03/0.28 # Paramodulations : 438 0.03/0.28 # Factorizations : 0 0.03/0.28 # Equation resolutions : 0 0.03/0.28 # Propositional unsat checks : 0 0.03/0.28 # Propositional check models : 0 0.03/0.28 # Propositional check unsatisfiable : 0 0.03/0.28 # Propositional clauses : 0 0.03/0.28 # Propositional clauses after purity: 0 0.03/0.28 # Propositional unsat core size : 0 0.03/0.28 # Current number of processed clauses : 141 0.03/0.28 # Positive orientable unit clauses : 22 0.03/0.28 # Positive unorientable unit clauses: 0 0.03/0.28 # Negative unit clauses : 6 0.03/0.28 # Non-unit-clauses : 113 0.03/0.28 # Current number of unprocessed clauses: 260 0.03/0.28 # ...number of literals in the above : 902 0.03/0.28 # Current number of archived formulas : 0 0.03/0.28 # Current number of archived clauses : 37 0.03/0.28 # Clause-clause subsumption calls (NU) : 2490 0.03/0.28 # Rec. Clause-clause subsumption calls : 1889 0.03/0.28 # Non-unit clause-clause subsumptions : 49 0.03/0.28 # Unit Clause-clause subsumption calls : 33 0.03/0.28 # Rewrite failures with RHS unbound : 0 0.03/0.28 # BW rewrite match attempts : 10 0.03/0.28 # BW rewrite match successes : 1 0.03/0.28 # Condensation attempts : 222 0.03/0.28 # Condensation successes : 2 0.03/0.28 # Termbank termtop insertions : 7928 0.03/0.28 0.03/0.28 # ------------------------------------------------- 0.03/0.28 # User time : 0.016 s 0.03/0.28 # System time : 0.002 s 0.03/0.28 # Total time : 0.019 s 0.03/0.28 # Maximum resident set size: 1532 pages 0.09/0.31 EOF