0.12/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.13 % Command : run_E %s %d THM 0.12/0.35 % Computer : n008.cluster.edu 0.12/0.35 % Model : x86_64 x86_64 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.35 % Memory : 8042.1875MB 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.35 % CPULimit : 1200 0.12/0.35 % WCLimit : 120 0.12/0.35 % DateTime : Tue Jul 13 12:18:14 EDT 2021 0.12/0.35 % CPUTime : 0.98/1.16 Running first-order theorem proving 0.98/1.16 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 0.98/1.16 # Version: 2.6 1.00/1.27 # No SInE strategy applied 1.00/1.27 # Trying AutoSched0 for 59 seconds 1.84/2.04 # AutoSched0-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y 1.84/2.04 # and selection function SelectMaxLComplexAvoidPosPred. 1.84/2.04 # 1.84/2.04 # Preprocessing time : 0.573 s 1.84/2.04 1.84/2.04 # Proof found! 1.84/2.04 # SZS status Theorem 1.84/2.04 # SZS output start CNFRefutation 1.84/2.04 fof(query132, conjecture, ?[X23]:(mtvisible(c_reasoningaboutpossibleantecedentsmt)=>isa(f_citynamedfn(s_agen,c_france),X23)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', query132)). 1.84/2.04 fof(ax2_7971, axiom, ![X1]:(individual(X1)=>isa(X1,c_individual)), file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax', ax2_7971)). 1.84/2.04 fof(ax2_496, axiom, individual(f_citynamedfn(s_agen,c_france)), file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax', ax2_496)). 1.84/2.04 fof(c_0_3, negated_conjecture, ~(?[X23]:(mtvisible(c_reasoningaboutpossibleantecedentsmt)=>isa(f_citynamedfn(s_agen,c_france),X23))), inference(assume_negation,[status(cth)],[query132])). 1.84/2.04 fof(c_0_4, plain, ![X11276]:(~individual(X11276)|isa(X11276,c_individual)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7971])])). 1.84/2.04 fof(c_0_5, negated_conjecture, ![X11965]:(mtvisible(c_reasoningaboutpossibleantecedentsmt)&~isa(f_citynamedfn(s_agen,c_france),X11965)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])). 1.84/2.04 cnf(c_0_6, plain, (isa(X1,c_individual)|~individual(X1)), inference(split_conjunct,[status(thm)],[c_0_4])). 1.84/2.04 cnf(c_0_7, plain, (individual(f_citynamedfn(s_agen,c_france))), inference(split_conjunct,[status(thm)],[ax2_496])). 1.84/2.04 cnf(c_0_8, negated_conjecture, (~isa(f_citynamedfn(s_agen,c_france),X1)), inference(split_conjunct,[status(thm)],[c_0_5])). 1.84/2.04 cnf(c_0_9, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6, c_0_7]), c_0_8]), ['proof']). 1.84/2.04 # SZS output end CNFRefutation 1.84/2.04 # Proof object total steps : 10 1.84/2.04 # Proof object clause steps : 4 1.84/2.04 # Proof object formula steps : 6 1.84/2.04 # Proof object conjectures : 4 1.84/2.04 # Proof object clause conjectures : 1 1.84/2.04 # Proof object formula conjectures : 3 1.84/2.04 # Proof object initial clauses used : 3 1.84/2.04 # Proof object initial formulas used : 3 1.84/2.04 # Proof object generating inferences : 1 1.84/2.04 # Proof object simplifying inferences : 1 1.84/2.04 # Training examples: 0 positive, 0 negative 1.84/2.04 # Parsed axioms : 8006 1.84/2.04 # Removed by relevancy pruning/SinE : 0 1.84/2.04 # Initial clauses : 8007 1.84/2.04 # Removed in clause preprocessing : 0 1.84/2.04 # Initial clauses in saturation : 8007 1.84/2.04 # Processed clauses : 4558 1.84/2.04 # ...of these trivial : 279 1.84/2.04 # ...subsumed : 201 1.84/2.04 # ...remaining for further processing : 4078 1.84/2.04 # Other redundant clauses eliminated : 0 1.84/2.04 # Clauses deleted for lack of memory : 0 1.84/2.04 # Backward-subsumed : 0 1.84/2.04 # Backward-rewritten : 19 1.84/2.04 # Generated clauses : 5556 1.84/2.04 # ...of the previous two non-trivial : 5260 1.84/2.04 # Contextual simplify-reflections : 0 1.84/2.04 # Paramodulations : 5556 1.84/2.04 # Factorizations : 0 1.84/2.04 # NegExts : 0 1.84/2.04 # Equation resolutions : 0 1.84/2.04 # Propositional unsat checks : 0 1.84/2.04 # Propositional check models : 0 1.84/2.04 # Propositional check unsatisfiable : 0 1.84/2.04 # Propositional clauses : 0 1.84/2.04 # Propositional clauses after purity: 0 1.84/2.04 # Propositional unsat core size : 0 1.84/2.04 # Propositional preprocessing time : 0.000 1.84/2.04 # Propositional encoding time : 0.000 1.84/2.04 # Propositional solver time : 0.000 1.84/2.04 # Success case prop preproc time : 0.000 1.84/2.04 # Success case prop encoding time : 0.000 1.84/2.04 # Success case prop solver time : 0.000 1.84/2.04 # Current number of processed clauses : 4059 1.84/2.04 # Positive orientable unit clauses : 2098 1.84/2.04 # Positive unorientable unit clauses: 0 1.84/2.04 # Negative unit clauses : 33 1.84/2.04 # Non-unit-clauses : 1928 1.84/2.04 # Current number of unprocessed clauses: 8709 1.84/2.04 # ...number of literals in the above : 13349 1.84/2.04 # Current number of archived formulas : 0 1.84/2.04 # Current number of archived clauses : 19 1.84/2.04 # Clause-clause subsumption calls (NU) : 566193 1.84/2.04 # Rec. Clause-clause subsumption calls : 516051 1.84/2.04 # Non-unit clause-clause subsumptions : 201 1.84/2.04 # Unit Clause-clause subsumption calls : 14248 1.84/2.04 # Rewrite failures with RHS unbound : 0 1.84/2.04 # BW rewrite match attempts : 20 1.84/2.04 # BW rewrite match successes : 19 1.84/2.04 # Condensation attempts : 0 1.84/2.04 # Condensation successes : 0 1.84/2.04 # Termbank termtop insertions : 451364 1.85/2.05 1.85/2.05 # ------------------------------------------------- 1.85/2.05 # User time : 0.819 s 1.85/2.05 # System time : 0.049 s 1.85/2.05 # Total time : 0.867 s 1.85/2.05 # Maximum resident set size: 7856 pages 1.85/2.05 EOF