0.04/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n006.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1200 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Jul 13 16:52:55 EDT 2021 0.13/0.35 % CPUTime : 0.20/0.48 Running first-order theorem proving 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers --proof-object --auto-schedule --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.20/0.48 # Version: 2.6 0.20/0.48 # No SInE strategy applied 0.20/0.48 # Trying AutoSched0 for 59 seconds 0.20/0.53 # AutoSched0-Mode selected heuristic G_E___107_C37_SOS_F1_PI_AE_Q4_CS_SP_PS_S0Y 0.20/0.53 # and selection function SelectMaxLComplexAvoidPosPred. 0.20/0.53 # 0.20/0.53 # Preprocessing time : 0.036 s 0.20/0.53 # Presaturation interreduction done 0.20/0.53 0.20/0.53 # Proof found! 0.20/0.53 # SZS status Theorem 0.20/0.53 # SZS output start CNFRefutation 0.20/0.53 fof(member_when_not_a_singleton, conjecture, ![X1, X4]:((X1=X4&~(?[X2]:(member(X2,universal_class)&X1=singleton(X2))))=>member_of(X1)=X4), file('/export/starexec/sandbox/benchmark/theBenchmark.p', member_when_not_a_singleton)). 0.20/0.53 fof(singleton_set_defn, axiom, ![X1]:unordered_pair(X1,X1)=singleton(X1), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax', singleton_set_defn)). 0.20/0.53 fof(member_universal_self, axiom, ![X1]:(X1=member_of(X1)|member(member_of(X1),universal_class)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', member_universal_self)). 0.20/0.53 fof(singleton_self, axiom, ![X1]:(singleton(member_of(X1))=X1|X1=member_of(X1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', singleton_self)). 0.20/0.53 fof(c_0_4, negated_conjecture, ~(![X1, X4]:((X1=X4&~(?[X2]:(member(X2,universal_class)&X1=singleton(X2))))=>member_of(X1)=X4)), inference(assume_negation,[status(cth)],[member_when_not_a_singleton])). 0.20/0.53 fof(c_0_5, negated_conjecture, ![X206]:((esk8_0=esk9_0&(~member(X206,universal_class)|esk8_0!=singleton(X206)))&member_of(esk8_0)!=esk9_0), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])). 0.20/0.53 fof(c_0_6, plain, ![X113]:unordered_pair(X113,X113)=singleton(X113), inference(variable_rename,[status(thm)],[singleton_set_defn])). 0.20/0.53 cnf(c_0_7, negated_conjecture, (~member(X1,universal_class)|esk8_0!=singleton(X1)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.20/0.53 cnf(c_0_8, plain, (unordered_pair(X1,X1)=singleton(X1)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.20/0.53 fof(c_0_9, plain, ![X200]:(X200=member_of(X200)|member(member_of(X200),universal_class)), inference(variable_rename,[status(thm)],[member_universal_self])). 0.20/0.53 fof(c_0_10, plain, ![X202]:(singleton(member_of(X202))=X202|X202=member_of(X202)), inference(variable_rename,[status(thm)],[singleton_self])). 0.20/0.53 cnf(c_0_11, negated_conjecture, (esk8_0!=unordered_pair(X1,X1)|~member(X1,universal_class)), inference(rw,[status(thm)],[c_0_7, c_0_8])). 0.20/0.53 cnf(c_0_12, plain, (X1=member_of(X1)|member(member_of(X1),universal_class)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.20/0.53 cnf(c_0_13, plain, (singleton(member_of(X1))=X1|X1=member_of(X1)), inference(split_conjunct,[status(thm)],[c_0_10])). 0.20/0.53 cnf(c_0_14, negated_conjecture, (member_of(esk8_0)!=esk9_0), inference(split_conjunct,[status(thm)],[c_0_5])). 0.20/0.53 cnf(c_0_15, negated_conjecture, (esk8_0=esk9_0), inference(split_conjunct,[status(thm)],[c_0_5])). 0.20/0.53 cnf(c_0_16, negated_conjecture, (member_of(X1)=X1|unordered_pair(member_of(X1),member_of(X1))!=esk8_0), inference(spm,[status(thm)],[c_0_11, c_0_12])). 0.20/0.53 cnf(c_0_17, plain, (X1=member_of(X1)|unordered_pair(member_of(X1),member_of(X1))=X1), inference(rw,[status(thm)],[c_0_13, c_0_8])). 0.20/0.53 cnf(c_0_18, negated_conjecture, (member_of(esk8_0)!=esk8_0), inference(rw,[status(thm)],[c_0_14, c_0_15])). 0.20/0.53 cnf(c_0_19, negated_conjecture, (member_of(X1)=X1|X1!=esk8_0), inference(spm,[status(thm)],[c_0_16, c_0_17])). 0.20/0.53 cnf(c_0_20, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_18, c_0_19]), ['proof']). 0.20/0.53 # SZS output end CNFRefutation 0.20/0.53 # Proof object total steps : 21 0.20/0.53 # Proof object clause steps : 12 0.20/0.53 # Proof object formula steps : 9 0.20/0.53 # Proof object conjectures : 11 0.20/0.53 # Proof object clause conjectures : 8 0.20/0.53 # Proof object formula conjectures : 3 0.20/0.53 # Proof object initial clauses used : 6 0.20/0.53 # Proof object initial formulas used : 4 0.20/0.53 # Proof object generating inferences : 3 0.20/0.53 # Proof object simplifying inferences : 3 0.20/0.53 # Training examples: 0 positive, 0 negative 0.20/0.53 # Parsed axioms : 48 0.20/0.53 # Removed by relevancy pruning/SinE : 0 0.20/0.53 # Initial clauses : 96 0.20/0.53 # Removed in clause preprocessing : 8 0.20/0.53 # Initial clauses in saturation : 88 0.20/0.53 # Processed clauses : 190 0.20/0.53 # ...of these trivial : 1 0.20/0.53 # ...subsumed : 3 0.20/0.53 # ...remaining for further processing : 186 0.20/0.53 # Other redundant clauses eliminated : 5 0.20/0.53 # Clauses deleted for lack of memory : 0 0.20/0.53 # Backward-subsumed : 4 0.20/0.53 # Backward-rewritten : 0 0.20/0.53 # Generated clauses : 444 0.20/0.53 # ...of the previous two non-trivial : 404 0.20/0.53 # Contextual simplify-reflections : 0 0.20/0.53 # Paramodulations : 438 0.20/0.53 # Factorizations : 0 0.20/0.53 # NegExts : 0 0.20/0.53 # Equation resolutions : 6 0.20/0.53 # Propositional unsat checks : 0 0.20/0.53 # Propositional check models : 0 0.20/0.53 # Propositional check unsatisfiable : 0 0.20/0.53 # Propositional clauses : 0 0.20/0.53 # Propositional clauses after purity: 0 0.20/0.53 # Propositional unsat core size : 0 0.20/0.53 # Propositional preprocessing time : 0.000 0.20/0.53 # Propositional encoding time : 0.000 0.20/0.53 # Propositional solver time : 0.000 0.20/0.53 # Success case prop preproc time : 0.000 0.20/0.53 # Success case prop encoding time : 0.000 0.20/0.53 # Success case prop solver time : 0.000 0.20/0.53 # Current number of processed clauses : 91 0.20/0.53 # Positive orientable unit clauses : 13 0.20/0.53 # Positive unorientable unit clauses: 0 0.20/0.53 # Negative unit clauses : 4 0.20/0.53 # Non-unit-clauses : 74 0.20/0.53 # Current number of unprocessed clauses: 389 0.20/0.53 # ...number of literals in the above : 1152 0.20/0.53 # Current number of archived formulas : 0 0.20/0.53 # Current number of archived clauses : 99 0.20/0.53 # Clause-clause subsumption calls (NU) : 2333 0.20/0.53 # Rec. Clause-clause subsumption calls : 2114 0.20/0.53 # Non-unit clause-clause subsumptions : 7 0.20/0.53 # Unit Clause-clause subsumption calls : 175 0.20/0.53 # Rewrite failures with RHS unbound : 0 0.20/0.53 # BW rewrite match attempts : 15 0.20/0.53 # BW rewrite match successes : 0 0.20/0.53 # Condensation attempts : 0 0.20/0.53 # Condensation successes : 0 0.20/0.53 # Termbank termtop insertions : 18236 0.20/0.54 0.20/0.54 # ------------------------------------------------- 0.20/0.54 # User time : 0.054 s 0.20/0.54 # System time : 0.006 s 0.20/0.54 # Total time : 0.060 s 0.20/0.54 # Maximum resident set size: 1652 pages 0.20/0.54 EOF