0.02/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.10 % Command : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s 0.10/0.29 % Computer : n012.cluster.edu 0.10/0.29 % Model : x86_64 x86_64 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.29 % Memory : 8042.1875MB 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.29 % CPULimit : 960 0.10/0.29 % WCLimit : 120 0.10/0.29 % DateTime : Thu Jul 2 07:21:51 EDT 2020 0.10/0.30 % CPUTime : 0.10/0.30 # Version: 2.5pre002 0.53/0.73 # No SInE strategy applied 0.53/0.73 # Trying AutoSched0 for 59 seconds 7.48/7.73 # AutoSched0-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y 7.48/7.73 # and selection function SelectMaxLComplexAvoidPosPred. 7.48/7.73 # 7.48/7.73 # Preprocessing time : 6.919 s 7.48/7.73 7.48/7.73 # Proof found! 7.48/7.73 # SZS status Theorem 7.48/7.73 # SZS output start CNFRefutation 7.48/7.73 fof(query201, conjecture, ?[X2]:(marriagelicensedocument(X2)<=mtvisible(c_tptp_member3356_mt)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', query201)). 7.48/7.73 fof(ax3_12494, axiom, (mtvisible(c_tptp_member3356_mt)=>marriagelicensedocument(c_tptpmarriagelicensedocument)), file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax', ax3_12494)). 7.48/7.73 fof(c_0_2, negated_conjecture, ~(?[X2]:(marriagelicensedocument(X2)<=mtvisible(c_tptp_member3356_mt))), inference(assume_negation,[status(cth)],[query201])). 7.48/7.73 fof(c_0_3, plain, (~mtvisible(c_tptp_member3356_mt)|marriagelicensedocument(c_tptpmarriagelicensedocument)), inference(fof_nnf,[status(thm)],[ax3_12494])). 7.48/7.73 fof(c_0_4, negated_conjecture, ![X24067]:(mtvisible(c_tptp_member3356_mt)&~marriagelicensedocument(X24067)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])])])). 7.48/7.73 cnf(c_0_5, plain, (marriagelicensedocument(c_tptpmarriagelicensedocument)|~mtvisible(c_tptp_member3356_mt)), inference(split_conjunct,[status(thm)],[c_0_3])). 7.48/7.73 cnf(c_0_6, negated_conjecture, (mtvisible(c_tptp_member3356_mt)), inference(split_conjunct,[status(thm)],[c_0_4])). 7.48/7.73 cnf(c_0_7, negated_conjecture, (~marriagelicensedocument(X1)), inference(split_conjunct,[status(thm)],[c_0_4])). 7.48/7.73 cnf(c_0_8, plain, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5, c_0_6])]), c_0_7]), ['proof']). 7.48/7.73 # SZS output end CNFRefutation 7.48/7.73 # Proof object total steps : 9 7.48/7.73 # Proof object clause steps : 4 7.48/7.73 # Proof object formula steps : 5 7.48/7.73 # Proof object conjectures : 5 7.48/7.73 # Proof object clause conjectures : 2 7.48/7.73 # Proof object formula conjectures : 3 7.48/7.73 # Proof object initial clauses used : 3 7.48/7.73 # Proof object initial formulas used : 2 7.48/7.73 # Proof object generating inferences : 0 7.48/7.73 # Proof object simplifying inferences : 3 7.48/7.73 # Training examples: 0 positive, 0 negative 7.48/7.73 # Parsed axioms : 44217 7.48/7.73 # Removed by relevancy pruning/SinE : 0 7.48/7.73 # Initial clauses : 44218 7.48/7.73 # Removed in clause preprocessing : 3 7.48/7.73 # Initial clauses in saturation : 44215 7.48/7.73 # Processed clauses : 566 7.48/7.73 # ...of these trivial : 10 7.48/7.73 # ...subsumed : 43 7.48/7.73 # ...remaining for further processing : 512 7.48/7.73 # Other redundant clauses eliminated : 0 7.48/7.73 # Clauses deleted for lack of memory : 0 7.48/7.73 # Backward-subsumed : 0 7.48/7.73 # Backward-rewritten : 0 7.48/7.73 # Generated clauses : 0 7.48/7.73 # ...of the previous two non-trivial : 0 7.48/7.73 # Contextual simplify-reflections : 0 7.48/7.73 # Paramodulations : 0 7.48/7.73 # Factorizations : 0 7.48/7.73 # Equation resolutions : 0 7.48/7.73 # Propositional unsat checks : 0 7.48/7.73 # Propositional check models : 0 7.48/7.73 # Propositional check unsatisfiable : 0 7.48/7.73 # Propositional clauses : 0 7.48/7.73 # Propositional clauses after purity: 0 7.48/7.73 # Propositional unsat core size : 0 7.48/7.73 # Propositional preprocessing time : 0.000 7.48/7.73 # Propositional encoding time : 0.000 7.48/7.73 # Propositional solver time : 0.000 7.48/7.73 # Success case prop preproc time : 0.000 7.48/7.73 # Success case prop encoding time : 0.000 7.48/7.73 # Success case prop solver time : 0.000 7.48/7.73 # Current number of processed clauses : 512 7.48/7.73 # Positive orientable unit clauses : 292 7.48/7.73 # Positive unorientable unit clauses: 0 7.48/7.73 # Negative unit clauses : 99 7.48/7.73 # Non-unit-clauses : 121 7.48/7.73 # Current number of unprocessed clauses: 43649 7.48/7.73 # ...number of literals in the above : 64717 7.48/7.73 # Current number of archived formulas : 0 7.48/7.73 # Current number of archived clauses : 0 7.48/7.73 # Clause-clause subsumption calls (NU) : 2415 7.48/7.73 # Rec. Clause-clause subsumption calls : 2405 7.48/7.73 # Non-unit clause-clause subsumptions : 43 7.48/7.73 # Unit Clause-clause subsumption calls : 10642 7.48/7.73 # Rewrite failures with RHS unbound : 0 7.48/7.73 # BW rewrite match attempts : 2 7.48/7.73 # BW rewrite match successes : 0 7.48/7.73 # Condensation attempts : 0 7.48/7.73 # Condensation successes : 0 7.48/7.73 # Termbank termtop insertions : 1868050 7.48/7.75 7.48/7.75 # ------------------------------------------------- 7.48/7.75 # User time : 7.223 s 7.48/7.75 # System time : 0.200 s 7.48/7.75 # Total time : 7.423 s 7.48/7.75 # Maximum resident set size: 38376 pages 7.54/7.75 EOF