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.04/0.23 % Computer : n124.star.cs.uiowa.edu 0.04/0.23 % Model : x86_64 x86_64 0.04/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.04/0.23 % Memory : 32218.625MB 0.04/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.04/0.23 % CPULimit : 300 0.04/0.23 % DateTime : Sat Jul 14 05:57:24 CDT 2018 0.04/0.23 % CPUTime : 0.04/0.24 # Version: 2.2pre001 0.04/0.24 # No SInE strategy applied 0.04/0.24 # Trying AutoSched0 for 151 seconds 0.41/0.60 # AutoSched0-Mode selected heuristic G_E___042_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y 0.41/0.60 # and selection function SelectMaxLComplexAvoidPosPred. 0.41/0.60 # 0.41/0.60 # Preprocessing time : 0.011 s 0.41/0.60 # Presaturation interreduction done 0.41/0.60 0.41/0.60 # Proof found! 0.41/0.60 # SZS status Theorem 0.41/0.60 # SZS output start CNFRefutation 0.41/0.60 fof(corollary_1_to_number_of_elements_in_class, conjecture, ![X1]:(X1=null_class|?[X5]:(?[X6]:(member(X6,X1)&member(X6,intersection(complement(singleton(X5)),X1)))&member(X5,X1))|?[X2]:singleton(X2)=X1), file('/export/starexec/sandbox/benchmark/theBenchmark.p', corollary_1_to_number_of_elements_in_class)). 0.41/0.60 fof(singleton_set_defn, axiom, ![X1]:singleton(X1)=unordered_pair(X1,X1), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax', singleton_set_defn)). 0.41/0.60 fof(intersection, axiom, ![X1, X2, X3]:((member(X3,X1)&member(X3,X2))<=>member(X3,intersection(X1,X2))), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax', intersection)). 0.41/0.60 fof(subclass_defn, axiom, ![X1, X2]:(subclass(X1,X2)<=>![X4]:(member(X4,X1)=>member(X4,X2))), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax', subclass_defn)). 0.41/0.60 fof(class_elements_are_sets, axiom, ![X1]:subclass(X1,universal_class), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax', class_elements_are_sets)). 0.41/0.60 fof(complement, axiom, ![X1, X3]:(member(X3,complement(X1))<=>(member(X3,universal_class)&~(member(X3,X1)))), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax', complement)). 0.41/0.60 fof(unordered_pair_defn, axiom, ![X4, X1, X2]:((member(X4,universal_class)&(X1=X4|X4=X2))<=>member(X4,unordered_pair(X1,X2))), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax', unordered_pair_defn)). 0.41/0.60 fof(regularity, axiom, ![X1]:(X1!=null_class=>?[X4]:((disjoint(X4,X1)&member(X4,X1))&member(X4,universal_class))), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax', regularity)). 0.41/0.60 fof(disjoint_defn, axiom, ![X1, X2]:(![X4]:~((member(X4,X2)&member(X4,X1)))<=>disjoint(X1,X2)), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax', disjoint_defn)). 0.41/0.60 fof(extensionality, axiom, ![X1, X2]:((subclass(X1,X2)&subclass(X2,X1))<=>X1=X2), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax', extensionality)). 0.41/0.60 fof(c_0_10, negated_conjecture, ~(![X1]:(X1=null_class|?[X5]:(?[X6]:(member(X6,X1)&member(X6,intersection(complement(singleton(X5)),X1)))&member(X5,X1))|?[X2]:singleton(X2)=X1)), inference(assume_negation,[status(cth)],[corollary_1_to_number_of_elements_in_class])). 0.41/0.60 fof(c_0_11, negated_conjecture, ![X101, X102, X103]:((esk8_0!=null_class&(~member(X102,esk8_0)|~member(X102,intersection(complement(singleton(X101)),esk8_0))|~member(X101,esk8_0)))&singleton(X103)!=esk8_0), 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)],[c_0_10])])])])])])). 0.41/0.60 fof(c_0_12, plain, ![X36]:singleton(X36)=unordered_pair(X36,X36), inference(variable_rename,[status(thm)],[singleton_set_defn])). 0.41/0.60 cnf(c_0_13, negated_conjecture, (~member(X1,esk8_0)|~member(X1,intersection(complement(singleton(X2)),esk8_0))|~member(X2,esk8_0)), inference(split_conjunct,[status(thm)],[c_0_11])). 0.41/0.60 cnf(c_0_14, plain, (singleton(X1)=unordered_pair(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.41/0.60 fof(c_0_15, plain, ![X80, X81, X82, X80, X81, X82]:((~member(X82,X80)|~member(X82,X81)|member(X82,intersection(X80,X81)))&((member(X82,X80)|~member(X82,intersection(X80,X81)))&(member(X82,X81)|~member(X82,intersection(X80,X81))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])])])])). 0.41/0.60 fof(c_0_16, plain, ![X37, X38, X39, X37, X38]:((~subclass(X37,X38)|(~member(X39,X37)|member(X39,X38)))&((member(esk2_2(X37,X38),X37)|subclass(X37,X38))&(~member(esk2_2(X37,X38),X38)|subclass(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)],[subclass_defn])])])])])])])). 0.41/0.60 fof(c_0_17, plain, ![X23]:subclass(X23,universal_class), inference(variable_rename,[status(thm)],[class_elements_are_sets])). 0.41/0.60 cnf(c_0_18, negated_conjecture, (~member(X2,esk8_0)|~member(X1,esk8_0)|~member(X1,intersection(complement(unordered_pair(X2,X2)),esk8_0))), inference(rw,[status(thm)],[c_0_13, c_0_14])). 0.41/0.60 cnf(c_0_19, plain, (member(X1,intersection(X2,X3))|~member(X1,X2)|~member(X1,X3)), inference(split_conjunct,[status(thm)],[c_0_15])). 0.41/0.60 fof(c_0_20, plain, ![X61, X62, X61, X62]:(((member(X62,universal_class)|~member(X62,complement(X61)))&(~member(X62,X61)|~member(X62,complement(X61))))&(~member(X62,universal_class)|member(X62,X61)|member(X62,complement(X61)))), inference(distribute,[status(thm)],[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)],[complement])])])])])])). 0.41/0.60 cnf(c_0_21, plain, (member(X3,X2)|~subclass(X1,X2)|~member(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.41/0.60 cnf(c_0_22, plain, (subclass(X1,universal_class)), inference(split_conjunct,[status(thm)],[c_0_17])). 0.41/0.60 fof(c_0_23, plain, ![X15, X16, X17, X15, X16, X17]:(((X16!=X15|~member(X15,universal_class)|member(X15,unordered_pair(X16,X17)))&(X15!=X17|~member(X15,universal_class)|member(X15,unordered_pair(X16,X17))))&((member(X15,universal_class)|~member(X15,unordered_pair(X16,X17)))&(X16=X15|X15=X17|~member(X15,unordered_pair(X16,X17))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])])])])). 0.41/0.60 cnf(c_0_24, negated_conjecture, (~member(X1,complement(unordered_pair(X2,X2)))|~member(X2,esk8_0)|~member(X1,esk8_0)), inference(spm,[status(thm)],[c_0_18, c_0_19])). 0.41/0.60 cnf(c_0_25, plain, (member(X1,X2)|member(X1,complement(X2))|~member(X1,universal_class)), inference(split_conjunct,[status(thm)],[c_0_20])). 0.41/0.60 cnf(c_0_26, plain, (member(X1,universal_class)|~member(X1,X2)), inference(spm,[status(thm)],[c_0_21, c_0_22])). 0.41/0.60 cnf(c_0_27, plain, (X1=X2|X2=X3|~member(X2,unordered_pair(X1,X3))), inference(split_conjunct,[status(thm)],[c_0_23])). 0.41/0.60 cnf(c_0_28, negated_conjecture, (member(X1,unordered_pair(X2,X2))|~member(X2,esk8_0)|~member(X1,esk8_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_26])). 0.41/0.60 fof(c_0_29, plain, ![X86]:(((disjoint(esk6_1(X86),X86)|X86=null_class)&(member(esk6_1(X86),X86)|X86=null_class))&(member(esk6_1(X86),universal_class)|X86=null_class)), 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)],[regularity])])])])])])). 0.41/0.60 cnf(c_0_30, negated_conjecture, (X1=X2|~member(X2,esk8_0)|~member(X1,esk8_0)), inference(spm,[status(thm)],[c_0_27, c_0_28])). 0.41/0.60 cnf(c_0_31, plain, (member(esk6_1(X1),X1)|X1=null_class), inference(split_conjunct,[status(thm)],[c_0_29])). 0.41/0.60 cnf(c_0_32, negated_conjecture, (esk8_0!=null_class), inference(split_conjunct,[status(thm)],[c_0_11])). 0.41/0.60 fof(c_0_33, plain, ![X92, X93, X92, X93, X95]:(((member(esk7_2(X92,X93),X93)|disjoint(X92,X93))&(member(esk7_2(X92,X93),X92)|disjoint(X92,X93)))&(~disjoint(X92,X93)|(~member(X95,X93)|~member(X95,X92)))), 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)],[disjoint_defn])])])])])])])). 0.41/0.60 cnf(c_0_34, negated_conjecture, (X1=esk6_1(esk8_0)|~member(X1,esk8_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_32])). 0.41/0.60 cnf(c_0_35, plain, (member(esk7_2(X1,X2),X1)|disjoint(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_33])). 0.41/0.60 cnf(c_0_36, negated_conjecture, (esk7_2(esk8_0,X1)=esk6_1(esk8_0)|disjoint(esk8_0,X1)), inference(spm,[status(thm)],[c_0_34, c_0_35])). 0.41/0.60 cnf(c_0_37, plain, (~disjoint(X1,X2)|~member(X3,X2)|~member(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_33])). 0.41/0.60 cnf(c_0_38, negated_conjecture, (disjoint(esk8_0,X1)|member(esk6_1(esk8_0),esk8_0)), inference(spm,[status(thm)],[c_0_35, c_0_36])). 0.41/0.60 cnf(c_0_39, plain, (member(esk2_2(X1,X2),X1)|subclass(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.41/0.60 cnf(c_0_40, negated_conjecture, (member(esk6_1(esk8_0),esk8_0)|~member(X1,esk8_0)|~member(X1,X2)), inference(spm,[status(thm)],[c_0_37, c_0_38])). 0.41/0.60 cnf(c_0_41, plain, (subclass(X1,X2)|~member(esk2_2(X1,X2),X2)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.41/0.60 cnf(c_0_42, negated_conjecture, (esk2_2(esk8_0,X1)=esk6_1(esk8_0)|subclass(esk8_0,X1)), inference(spm,[status(thm)],[c_0_34, c_0_39])). 0.41/0.60 cnf(c_0_43, negated_conjecture, (member(esk6_1(esk8_0),esk8_0)|~member(esk6_1(esk8_0),X1)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_31]), c_0_32])). 0.41/0.60 cnf(c_0_44, plain, (member(esk6_1(X1),universal_class)|X1=null_class), inference(split_conjunct,[status(thm)],[c_0_29])). 0.41/0.60 cnf(c_0_45, plain, (esk2_2(unordered_pair(X1,X2),X3)=X1|esk2_2(unordered_pair(X1,X2),X3)=X2|subclass(unordered_pair(X1,X2),X3)), inference(spm,[status(thm)],[c_0_27, c_0_39])). 0.41/0.60 fof(c_0_46, plain, ![X96, X97, X96, X97]:((~subclass(X96,X97)|~subclass(X97,X96)|X96=X97)&((subclass(X96,X97)|X96!=X97)&(subclass(X97,X96)|X96!=X97))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[extensionality])])])])])). 0.41/0.60 cnf(c_0_47, negated_conjecture, (subclass(esk8_0,X1)|~member(esk6_1(esk8_0),X1)), inference(spm,[status(thm)],[c_0_41, c_0_42])). 0.41/0.60 cnf(c_0_48, negated_conjecture, (member(esk6_1(esk8_0),esk8_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_44]), c_0_32])). 0.41/0.60 cnf(c_0_49, negated_conjecture, (singleton(X1)!=esk8_0), inference(split_conjunct,[status(thm)],[c_0_11])). 0.41/0.60 cnf(c_0_50, plain, (esk2_2(unordered_pair(X1,X1),X2)=X1|subclass(unordered_pair(X1,X1),X2)), inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_45])])). 0.41/0.60 cnf(c_0_51, plain, (X1=X2|~subclass(X1,X2)|~subclass(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_46])). 0.41/0.60 cnf(c_0_52, negated_conjecture, (subclass(esk8_0,unordered_pair(X1,X1))|~member(X1,esk8_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47, c_0_28]), c_0_48])])). 0.41/0.60 cnf(c_0_53, negated_conjecture, (unordered_pair(X1,X1)!=esk8_0), inference(rw,[status(thm)],[c_0_49, c_0_14])). 0.41/0.60 cnf(c_0_54, plain, (subclass(unordered_pair(X1,X1),X2)|~member(X1,X2)), inference(spm,[status(thm)],[c_0_41, c_0_50])). 0.41/0.60 cnf(c_0_55, negated_conjecture, (~member(X1,esk8_0)), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51, c_0_52]), c_0_53]), c_0_54])). 0.41/0.60 cnf(c_0_56, negated_conjecture, ($false), inference(sr,[status(thm)],[c_0_48, c_0_55]), ['proof']). 0.41/0.60 # SZS output end CNFRefutation 0.41/0.60 # Proof object total steps : 57 0.41/0.60 # Proof object clause steps : 36 0.41/0.60 # Proof object formula steps : 21 0.41/0.60 # Proof object conjectures : 22 0.41/0.60 # Proof object clause conjectures : 19 0.41/0.60 # Proof object formula conjectures : 3 0.41/0.60 # Proof object initial clauses used : 16 0.41/0.60 # Proof object initial formulas used : 10 0.41/0.60 # Proof object generating inferences : 17 0.41/0.60 # Proof object simplifying inferences : 12 0.41/0.60 # Training examples: 0 positive, 0 negative 0.41/0.60 # Parsed axioms : 44 0.41/0.60 # Removed by relevancy pruning/SinE : 0 0.41/0.60 # Initial clauses : 92 0.41/0.60 # Removed in clause preprocessing : 8 0.41/0.60 # Initial clauses in saturation : 84 0.41/0.60 # Processed clauses : 4662 0.41/0.60 # ...of these trivial : 3 0.41/0.60 # ...subsumed : 3601 0.41/0.60 # ...remaining for further processing : 1058 0.41/0.60 # Other redundant clauses eliminated : 19 0.41/0.60 # Clauses deleted for lack of memory : 0 0.41/0.60 # Backward-subsumed : 63 0.41/0.60 # Backward-rewritten : 84 0.41/0.60 # Generated clauses : 27985 0.41/0.60 # ...of the previous two non-trivial : 23212 0.41/0.60 # Contextual simplify-reflections : 993 0.41/0.60 # Paramodulations : 27936 0.41/0.60 # Factorizations : 27 0.41/0.60 # Equation resolutions : 21 0.41/0.60 # Propositional unsat checks : 0 0.41/0.60 # Propositional check models : 0 0.41/0.60 # Propositional check unsatisfiable : 0 0.41/0.60 # Propositional clauses : 0 0.41/0.60 # Propositional clauses after purity: 0 0.41/0.60 # Propositional unsat core size : 0 0.41/0.60 # Current number of processed clauses : 823 0.41/0.60 # Positive orientable unit clauses : 54 0.41/0.60 # Positive unorientable unit clauses: 0 0.41/0.60 # Negative unit clauses : 11 0.41/0.60 # Non-unit-clauses : 758 0.41/0.60 # Current number of unprocessed clauses: 15112 0.41/0.60 # ...number of literals in the above : 49120 0.41/0.60 # Current number of archived formulas : 0 0.41/0.60 # Current number of archived clauses : 239 0.41/0.60 # Clause-clause subsumption calls (NU) : 404347 0.41/0.60 # Rec. Clause-clause subsumption calls : 287295 0.41/0.60 # Non-unit clause-clause subsumptions : 2603 0.41/0.60 # Unit Clause-clause subsumption calls : 6311 0.41/0.60 # Rewrite failures with RHS unbound : 0 0.41/0.60 # BW rewrite match attempts : 61 0.41/0.60 # BW rewrite match successes : 17 0.41/0.60 # Condensation attempts : 0 0.41/0.60 # Condensation successes : 0 0.41/0.60 # Termbank termtop insertions : 628749 0.41/0.61 0.41/0.61 # ------------------------------------------------- 0.41/0.61 # User time : 0.357 s 0.41/0.61 # System time : 0.014 s 0.41/0.61 # Total time : 0.371 s 0.41/0.61 # Maximum resident set size: 1584 pages 0.41/0.61 EOF