0.00/0.04 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/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.24 % Computer : n062.star.cs.uiowa.edu 0.03/0.24 % Model : x86_64 x86_64 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.24 % Memory : 32218.625MB 0.03/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.24 % CPULimit : 300 0.03/0.24 % DateTime : Sat Jul 14 04:16:40 CDT 2018 0.03/0.24 % CPUTime : 0.03/0.25 # Version: 2.2pre001 0.03/0.25 # No SInE strategy applied 0.03/0.25 # Trying AutoSched0 for 151 seconds 0.07/0.26 # AutoSched0-Mode selected heuristic SAT001_MinMin_t00X000_rr 0.07/0.26 # and selection function SelectMaxLComplexAvoidPosPred. 0.07/0.26 # 0.07/0.26 # Preprocessing time : 0.010 s 0.07/0.26 # Presaturation interreduction done 0.07/0.26 0.07/0.26 # Proof found! 0.07/0.26 # SZS status Theorem 0.07/0.26 # SZS output start CNFRefutation 0.07/0.26 fof(isa_exclusive, conjecture, ![X1, X2]:?[X3, X4]:(status(X3,X4,X1)=>~(((xora(X1,X2)|nevera(X1,X2)|nota(X1,X2))&isa(X1,X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', isa_exclusive)). 0.07/0.26 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.07/0.26 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.07/0.26 fof(nevera, axiom, ![X1, X2]:(nevera(X1,X2)<=>![X3, X4]:(~(status(X3,X4,X2))<=status(X3,X4,X1))), file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax', nevera)). 0.07/0.26 fof(xora, axiom, ![X1, X2]:(![X3, X4]:(status(X3,X4,X2)<~>status(X3,X4,X1))<=>xora(X1,X2)), file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax', xora)). 0.07/0.26 fof(c_0_5, negated_conjecture, ~(![X1, X2]:?[X3, X4]:(status(X3,X4,X1)=>~(((xora(X1,X2)|nevera(X1,X2)|nota(X1,X2))&isa(X1,X2))))), inference(assume_negation,[status(cth)],[isa_exclusive])). 0.07/0.26 fof(c_0_6, plain, ![X30, X31, X32, X33, X30, X31]:((~isa(X30,X31)|(~status(X32,X33,X30)|status(X32,X33,X31)))&((status(esk12_2(X30,X31),esk13_2(X30,X31),X30)|isa(X30,X31))&(~status(esk12_2(X30,X31),esk13_2(X30,X31),X31)|isa(X30,X31)))), 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.07/0.26 fof(c_0_7, negated_conjecture, ![X68, X69]:(status(X68,X69,esk30_0)&((xora(esk30_0,esk31_0)|nevera(esk30_0,esk31_0)|nota(esk30_0,esk31_0))&isa(esk30_0,esk31_0))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])). 0.07/0.26 cnf(c_0_8, plain, (status(X3,X4,X2)|~isa(X1,X2)|~status(X3,X4,X1)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.07/0.26 cnf(c_0_9, negated_conjecture, (status(X1,X2,esk30_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 0.07/0.26 fof(c_0_10, plain, ![X36, X37, X36, X37, X40, X41]:(((status(esk14_2(X36,X37),esk15_2(X36,X37),X36)|~nota(X36,X37))&(~status(esk14_2(X36,X37),esk15_2(X36,X37),X37)|~nota(X36,X37)))&(~status(X40,X41,X36)|status(X40,X41,X37)|nota(X36,X37))), 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.07/0.26 cnf(c_0_11, negated_conjecture, (status(X1,X2,X3)|~isa(esk30_0,X3)), inference(spm,[status(thm)],[c_0_8, c_0_9])). 0.07/0.26 cnf(c_0_12, negated_conjecture, (isa(esk30_0,esk31_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 0.07/0.26 fof(c_0_13, plain, ![X21, X22, X23, X24, X21, X22]:((~nevera(X21,X22)|(~status(X23,X24,X21)|~status(X23,X24,X22)))&((status(esk7_2(X21,X22),esk8_2(X21,X22),X21)|nevera(X21,X22))&(status(esk7_2(X21,X22),esk8_2(X21,X22),X22)|nevera(X21,X22)))), 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)],[nevera])])])])])])])])). 0.07/0.26 cnf(c_0_14, plain, (~status(esk14_2(X1,X2),esk15_2(X1,X2),X2)|~nota(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_10])). 0.07/0.26 cnf(c_0_15, negated_conjecture, (status(X1,X2,esk31_0)), inference(spm,[status(thm)],[c_0_11, c_0_12])). 0.07/0.26 fof(c_0_16, plain, ![X11, X12, X11, X12, X15, X16, X15, X16]:(((~status(esk1_2(X11,X12),esk2_2(X11,X12),X12)|status(esk1_2(X11,X12),esk2_2(X11,X12),X11)|xora(X11,X12))&(~status(esk1_2(X11,X12),esk2_2(X11,X12),X11)|status(esk1_2(X11,X12),esk2_2(X11,X12),X12)|xora(X11,X12)))&((~status(X15,X16,X12)|~status(X15,X16,X11)|~xora(X11,X12))&(status(X15,X16,X12)|status(X15,X16,X11)|~xora(X11,X12)))), 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)],[xora])])])])])])])])). 0.07/0.26 cnf(c_0_17, plain, (~nevera(X1,X2)|~status(X3,X4,X1)|~status(X3,X4,X2)), inference(split_conjunct,[status(thm)],[c_0_13])). 0.07/0.26 cnf(c_0_18, negated_conjecture, (xora(esk30_0,esk31_0)|nevera(esk30_0,esk31_0)|nota(esk30_0,esk31_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 0.07/0.26 cnf(c_0_19, negated_conjecture, (~nota(X1,esk31_0)), inference(spm,[status(thm)],[c_0_14, c_0_15])). 0.07/0.26 cnf(c_0_20, plain, (~status(X1,X2,X3)|~status(X1,X2,X4)|~xora(X4,X3)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.07/0.26 cnf(c_0_21, negated_conjecture, (~nevera(X1,esk31_0)|~status(X2,X3,X1)), inference(spm,[status(thm)],[c_0_17, c_0_15])). 0.07/0.26 cnf(c_0_22, negated_conjecture, (nevera(esk30_0,esk31_0)|xora(esk30_0,esk31_0)), inference(sr,[status(thm)],[c_0_18, c_0_19])). 0.07/0.26 cnf(c_0_23, negated_conjecture, (~xora(esk30_0,X1)|~status(X2,X3,X1)), inference(spm,[status(thm)],[c_0_20, c_0_9])). 0.07/0.26 cnf(c_0_24, negated_conjecture, (xora(esk30_0,esk31_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_9])])). 0.07/0.26 cnf(c_0_25, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_15])]), ['proof']). 0.07/0.26 # SZS output end CNFRefutation 0.07/0.26 # Proof object total steps : 26 0.07/0.26 # Proof object clause steps : 15 0.07/0.26 # Proof object formula steps : 11 0.07/0.26 # Proof object conjectures : 14 0.07/0.26 # Proof object clause conjectures : 11 0.07/0.26 # Proof object formula conjectures : 3 0.07/0.26 # Proof object initial clauses used : 7 0.07/0.26 # Proof object initial formulas used : 5 0.07/0.26 # Proof object generating inferences : 7 0.07/0.26 # Proof object simplifying inferences : 5 0.07/0.26 # Training examples: 0 positive, 0 negative 0.07/0.26 # Parsed axioms : 14 0.07/0.26 # Removed by relevancy pruning/SinE : 0 0.07/0.26 # Initial clauses : 38 0.07/0.26 # Removed in clause preprocessing : 0 0.07/0.26 # Initial clauses in saturation : 38 0.07/0.26 # Processed clauses : 78 0.07/0.26 # ...of these trivial : 0 0.07/0.26 # ...subsumed : 2 0.07/0.26 # ...remaining for further processing : 76 0.07/0.26 # Other redundant clauses eliminated : 0 0.07/0.26 # Clauses deleted for lack of memory : 0 0.07/0.26 # Backward-subsumed : 0 0.07/0.26 # Backward-rewritten : 2 0.07/0.26 # Generated clauses : 24 0.07/0.26 # ...of the previous two non-trivial : 20 0.07/0.26 # Contextual simplify-reflections : 0 0.07/0.26 # Paramodulations : 23 0.07/0.26 # Factorizations : 0 0.07/0.26 # Equation resolutions : 0 0.07/0.26 # Propositional unsat checks : 0 0.07/0.26 # Propositional check models : 0 0.07/0.26 # Propositional check unsatisfiable : 0 0.07/0.26 # Propositional clauses : 0 0.07/0.26 # Propositional clauses after purity: 0 0.07/0.26 # Propositional unsat core size : 0 0.07/0.26 # Current number of processed clauses : 37 0.07/0.26 # Positive orientable unit clauses : 14 0.07/0.26 # Positive unorientable unit clauses: 0 0.07/0.26 # Negative unit clauses : 7 0.07/0.26 # Non-unit-clauses : 16 0.07/0.26 # Current number of unprocessed clauses: 16 0.07/0.26 # ...number of literals in the above : 43 0.07/0.26 # Current number of archived formulas : 0 0.07/0.26 # Current number of archived clauses : 39 0.07/0.26 # Clause-clause subsumption calls (NU) : 61 0.07/0.26 # Rec. Clause-clause subsumption calls : 42 0.07/0.26 # Non-unit clause-clause subsumptions : 2 0.07/0.26 # Unit Clause-clause subsumption calls : 19 0.07/0.26 # Rewrite failures with RHS unbound : 0 0.07/0.26 # BW rewrite match attempts : 11 0.07/0.26 # BW rewrite match successes : 2 0.07/0.26 # Condensation attempts : 0 0.07/0.26 # Condensation successes : 0 0.07/0.26 # Termbank termtop insertions : 2569 0.07/0.26 0.07/0.26 # ------------------------------------------------- 0.07/0.26 # User time : 0.009 s 0.07/0.26 # System time : 0.004 s 0.07/0.26 # Total time : 0.013 s 0.07/0.26 # Maximum resident set size: 1536 pages 0.08/0.27 EOF