0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.13 % Command : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s 0.13/0.34 % Computer : n005.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 : 960 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Thu Jul 2 06:36:36 EDT 2020 0.13/0.34 % CPUTime : 0.13/0.34 # Version: 2.5pre002 0.13/0.35 # No SInE strategy applied 0.13/0.35 # Trying AutoSched0 for 59 seconds 0.40/0.61 # AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y 0.40/0.61 # and selection function SelectMaxLComplexAvoidPosPred. 0.40/0.61 # 0.40/0.61 # Preprocessing time : 0.077 s 0.40/0.61 0.40/0.61 # Proof found! 0.40/0.61 # SZS status Theorem 0.40/0.61 # SZS output start CNFRefutation 0.40/0.61 fof(l29_wellord1, conjecture, ![X1, X2]:(subset(relation_dom(relation_rng_restriction(X1,X2)),relation_dom(X2))<=relation(X2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', l29_wellord1)). 0.40/0.61 fof(t25_relat_1, lemma, ![X1]:(relation(X1)=>![X2]:((subset(X1,X2)=>(subset(relation_dom(X1),relation_dom(X2))&subset(relation_rng(X1),relation_rng(X2))))<=relation(X2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', t25_relat_1)). 0.40/0.61 fof(t117_relat_1, lemma, ![X1, X2]:(subset(relation_rng_restriction(X1,X2),X2)<=relation(X2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', t117_relat_1)). 0.40/0.61 fof(dt_k8_relat_1, axiom, ![X1, X2]:(relation(relation_rng_restriction(X1,X2))<=relation(X2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dt_k8_relat_1)). 0.40/0.61 fof(c_0_4, negated_conjecture, ~(![X1, X2]:(subset(relation_dom(relation_rng_restriction(X1,X2)),relation_dom(X2))<=relation(X2))), inference(assume_negation,[status(cth)],[l29_wellord1])). 0.40/0.61 fof(c_0_5, negated_conjecture, (relation(esk86_0)&~subset(relation_dom(relation_rng_restriction(esk85_0,esk86_0)),relation_dom(esk86_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])). 0.40/0.61 fof(c_0_6, lemma, ![X62, X63]:((subset(relation_dom(X62),relation_dom(X63))|~subset(X62,X63)|~relation(X63)|~relation(X62))&(subset(relation_rng(X62),relation_rng(X63))|~subset(X62,X63)|~relation(X63)|~relation(X62))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t25_relat_1])])])])])). 0.40/0.61 cnf(c_0_7, negated_conjecture, (~subset(relation_dom(relation_rng_restriction(esk85_0,esk86_0)),relation_dom(esk86_0))), inference(split_conjunct,[status(thm)],[c_0_5])). 0.40/0.61 cnf(c_0_8, lemma, (subset(relation_dom(X1),relation_dom(X2))|~subset(X1,X2)|~relation(X2)|~relation(X1)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.40/0.61 cnf(c_0_9, negated_conjecture, (relation(esk86_0)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.40/0.61 fof(c_0_10, lemma, ![X789, X790]:(~relation(X790)|subset(relation_rng_restriction(X789,X790),X790)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t117_relat_1])])])). 0.40/0.61 cnf(c_0_11, negated_conjecture, (~relation(relation_rng_restriction(esk85_0,esk86_0))|~subset(relation_rng_restriction(esk85_0,esk86_0),esk86_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8]), c_0_9])])). 0.40/0.61 cnf(c_0_12, lemma, (subset(relation_rng_restriction(X2,X1),X1)|~relation(X1)), inference(split_conjunct,[status(thm)],[c_0_10])). 0.40/0.61 fof(c_0_13, plain, ![X332, X333]:(~relation(X333)|relation(relation_rng_restriction(X332,X333))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[dt_k8_relat_1])])])). 0.40/0.61 cnf(c_0_14, lemma, (~relation(relation_rng_restriction(esk85_0,esk86_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_9])])). 0.40/0.61 cnf(c_0_15, plain, (relation(relation_rng_restriction(X2,X1))|~relation(X1)), inference(split_conjunct,[status(thm)],[c_0_13])). 0.40/0.61 cnf(c_0_16, lemma, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_9])]), ['proof']). 0.40/0.61 # SZS output end CNFRefutation 0.40/0.61 # Proof object total steps : 17 0.40/0.61 # Proof object clause steps : 8 0.40/0.61 # Proof object formula steps : 9 0.40/0.61 # Proof object conjectures : 6 0.40/0.61 # Proof object clause conjectures : 3 0.40/0.61 # Proof object formula conjectures : 3 0.40/0.61 # Proof object initial clauses used : 5 0.40/0.61 # Proof object initial formulas used : 4 0.40/0.61 # Proof object generating inferences : 3 0.40/0.61 # Proof object simplifying inferences : 6 0.40/0.61 # Training examples: 0 positive, 0 negative 0.40/0.61 # Parsed axioms : 306 0.40/0.61 # Removed by relevancy pruning/SinE : 0 0.40/0.61 # Initial clauses : 656 0.40/0.61 # Removed in clause preprocessing : 30 0.40/0.61 # Initial clauses in saturation : 626 0.40/0.61 # Processed clauses : 632 0.40/0.61 # ...of these trivial : 9 0.40/0.61 # ...subsumed : 36 0.40/0.61 # ...remaining for further processing : 587 0.40/0.61 # Other redundant clauses eliminated : 82 0.40/0.61 # Clauses deleted for lack of memory : 0 0.40/0.61 # Backward-subsumed : 0 0.40/0.61 # Backward-rewritten : 10 0.40/0.61 # Generated clauses : 8181 0.40/0.61 # ...of the previous two non-trivial : 7829 0.40/0.61 # Contextual simplify-reflections : 10 0.40/0.61 # Paramodulations : 8052 0.40/0.61 # Factorizations : 14 0.40/0.61 # Equation resolutions : 115 0.40/0.61 # Propositional unsat checks : 0 0.40/0.61 # Propositional check models : 0 0.40/0.62 # Propositional check unsatisfiable : 0 0.40/0.62 # Propositional clauses : 0 0.40/0.62 # Propositional clauses after purity: 0 0.40/0.62 # Propositional unsat core size : 0 0.40/0.62 # Propositional preprocessing time : 0.000 0.40/0.62 # Propositional encoding time : 0.000 0.40/0.62 # Propositional solver time : 0.000 0.40/0.62 # Success case prop preproc time : 0.000 0.40/0.62 # Success case prop encoding time : 0.000 0.40/0.62 # Success case prop solver time : 0.000 0.40/0.62 # Current number of processed clauses : 567 0.40/0.62 # Positive orientable unit clauses : 57 0.40/0.62 # Positive unorientable unit clauses: 3 0.40/0.62 # Negative unit clauses : 11 0.40/0.62 # Non-unit-clauses : 496 0.40/0.62 # Current number of unprocessed clauses: 7823 0.40/0.62 # ...number of literals in the above : 39928 0.40/0.62 # Current number of archived formulas : 0 0.40/0.62 # Current number of archived clauses : 15 0.40/0.62 # Clause-clause subsumption calls (NU) : 101686 0.40/0.62 # Rec. Clause-clause subsumption calls : 31800 0.40/0.62 # Non-unit clause-clause subsumptions : 42 0.40/0.62 # Unit Clause-clause subsumption calls : 2301 0.40/0.62 # Rewrite failures with RHS unbound : 0 0.40/0.62 # BW rewrite match attempts : 64 0.40/0.62 # BW rewrite match successes : 54 0.40/0.62 # Condensation attempts : 0 0.40/0.62 # Condensation successes : 0 0.40/0.62 # Termbank termtop insertions : 186851 0.40/0.62 0.40/0.62 # ------------------------------------------------- 0.40/0.62 # User time : 0.267 s 0.40/0.62 # System time : 0.011 s 0.40/0.62 # Total time : 0.278 s 0.40/0.62 # Maximum resident set size: 1960 pages 0.40/0.62 EOF