0.00/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.11 % Command : run_E %s %d THM 0.10/0.31 % Computer : n007.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 1200 0.10/0.31 % WCLimit : 120 0.10/0.31 % DateTime : Tue Jul 13 10:55:19 EDT 2021 0.10/0.31 % CPUTime : 0.16/0.46 Running first-order theorem proving 0.16/0.46 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.16/0.46 # Version: 2.6 0.16/0.47 # No SInE strategy applied 0.16/0.47 # Trying AutoSched0 for 59 seconds 0.16/0.58 # AutoSched0-Mode selected heuristic G_E___200_C45_F1_AE_CS_SP_PI_S4S 0.16/0.58 # and selection function SelectNewComplexAHPNS. 0.16/0.58 # 0.16/0.58 # Preprocessing time : 0.075 s 0.16/0.58 0.16/0.58 # Proof found! 0.16/0.58 # SZS status Theorem 0.16/0.58 # SZS output start CNFRefutation 0.16/0.58 fof(query98, conjecture, ?[X5]:(borderson(c_georegion_l4_x45_y9,X5)<=mtvisible(c_tptpgeo_spindlecollectormt)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', query98)). 0.16/0.58 fof(ax1_207, axiom, (mtvisible(c_tptpgeo_member1_mt)=>borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10)), file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax', ax1_207)). 0.16/0.58 fof(ax1_1123, axiom, ![X20, X21]:((mtvisible(X20)&genlmt(X20,X21))=>mtvisible(X21)), file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax', ax1_1123)). 0.16/0.58 fof(ax1_140, axiom, genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member1_mt), file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax', ax1_140)). 0.16/0.58 fof(c_0_4, negated_conjecture, ~(?[X5]:(mtvisible(c_tptpgeo_spindlecollectormt)=>borderson(c_georegion_l4_x45_y9,X5))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query98])])). 0.16/0.58 fof(c_0_5, plain, (~mtvisible(c_tptpgeo_member1_mt)|borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10)), inference(fof_nnf,[status(thm)],[ax1_207])). 0.16/0.58 fof(c_0_6, negated_conjecture, ![X2265]:(mtvisible(c_tptpgeo_spindlecollectormt)&~borderson(c_georegion_l4_x45_y9,X2265)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])). 0.16/0.58 fof(c_0_7, plain, ![X2055, X2056]:(~mtvisible(X2055)|~genlmt(X2055,X2056)|mtvisible(X2056)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1123])])). 0.16/0.58 cnf(c_0_8, plain, (borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10)|~mtvisible(c_tptpgeo_member1_mt)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.16/0.58 cnf(c_0_9, negated_conjecture, (~borderson(c_georegion_l4_x45_y9,X1)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.16/0.58 cnf(c_0_10, plain, (mtvisible(X2)|~mtvisible(X1)|~genlmt(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_7])). 0.16/0.58 cnf(c_0_11, plain, (genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member1_mt)), inference(split_conjunct,[status(thm)],[ax1_140])). 0.16/0.58 cnf(c_0_12, negated_conjecture, (mtvisible(c_tptpgeo_spindlecollectormt)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.16/0.58 cnf(c_0_13, plain, (~mtvisible(c_tptpgeo_member1_mt)), inference(sr,[status(thm)],[c_0_8, c_0_9])). 0.16/0.58 cnf(c_0_14, plain, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12])]), c_0_13]), ['proof']). 0.16/0.58 # SZS output end CNFRefutation 0.16/0.58 # Proof object total steps : 15 0.16/0.58 # Proof object clause steps : 7 0.16/0.58 # Proof object formula steps : 8 0.16/0.58 # Proof object conjectures : 5 0.16/0.58 # Proof object clause conjectures : 2 0.16/0.58 # Proof object formula conjectures : 3 0.16/0.58 # Proof object initial clauses used : 5 0.16/0.58 # Proof object initial formulas used : 4 0.16/0.58 # Proof object generating inferences : 1 0.16/0.58 # Proof object simplifying inferences : 4 0.16/0.58 # Training examples: 0 positive, 0 negative 0.16/0.58 # Parsed axioms : 1132 0.16/0.58 # Removed by relevancy pruning/SinE : 0 0.16/0.58 # Initial clauses : 1133 0.16/0.58 # Removed in clause preprocessing : 0 0.16/0.58 # Initial clauses in saturation : 1133 0.16/0.58 # Processed clauses : 939 0.16/0.58 # ...of these trivial : 1 0.16/0.58 # ...subsumed : 14 0.16/0.58 # ...remaining for further processing : 924 0.16/0.58 # Other redundant clauses eliminated : 0 0.16/0.58 # Clauses deleted for lack of memory : 0 0.16/0.58 # Backward-subsumed : 0 0.16/0.58 # Backward-rewritten : 0 0.16/0.58 # Generated clauses : 338 0.16/0.58 # ...of the previous two non-trivial : 275 0.16/0.58 # Contextual simplify-reflections : 0 0.16/0.58 # Paramodulations : 338 0.16/0.58 # Factorizations : 0 0.16/0.58 # NegExts : 0 0.16/0.58 # Equation resolutions : 0 0.16/0.58 # Propositional unsat checks : 0 0.16/0.58 # Propositional check models : 0 0.16/0.58 # Propositional check unsatisfiable : 0 0.16/0.58 # Propositional clauses : 0 0.16/0.58 # Propositional clauses after purity: 0 0.16/0.58 # Propositional unsat core size : 0 0.16/0.58 # Propositional preprocessing time : 0.000 0.16/0.58 # Propositional encoding time : 0.000 0.16/0.58 # Propositional solver time : 0.000 0.16/0.58 # Success case prop preproc time : 0.000 0.16/0.58 # Success case prop encoding time : 0.000 0.16/0.58 # Success case prop solver time : 0.000 0.16/0.58 # Current number of processed clauses : 924 0.16/0.58 # Positive orientable unit clauses : 285 0.16/0.58 # Positive unorientable unit clauses: 0 0.16/0.58 # Negative unit clauses : 5 0.16/0.58 # Non-unit-clauses : 634 0.16/0.58 # Current number of unprocessed clauses: 458 0.16/0.58 # ...number of literals in the above : 726 0.16/0.58 # Current number of archived formulas : 0 0.16/0.58 # Current number of archived clauses : 0 0.16/0.58 # Clause-clause subsumption calls (NU) : 48060 0.16/0.58 # Rec. Clause-clause subsumption calls : 46185 0.16/0.58 # Non-unit clause-clause subsumptions : 12 0.16/0.58 # Unit Clause-clause subsumption calls : 245 0.16/0.59 # Rewrite failures with RHS unbound : 0 0.16/0.59 # BW rewrite match attempts : 0 0.16/0.59 # BW rewrite match successes : 0 0.16/0.59 # Condensation attempts : 0 0.16/0.59 # Condensation successes : 0 0.16/0.59 # Termbank termtop insertions : 66408 0.16/0.59 0.16/0.59 # ------------------------------------------------- 0.16/0.59 # User time : 0.112 s 0.16/0.59 # System time : 0.016 s 0.16/0.59 # Total time : 0.128 s 0.16/0.59 # Maximum resident set size: 2540 pages 0.16/0.59 EOF