0.00/0.04 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s 0.02/0.24 % Computer : n176.star.cs.uiowa.edu 0.02/0.24 % Model : x86_64 x86_64 0.02/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.24 % Memory : 32218.625MB 0.02/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.24 % CPULimit : 300 0.02/0.24 % DateTime : Sat Jul 14 04:34:41 CDT 2018 0.02/0.24 % CPUTime : 0.02/0.24 # Version: 2.2pre001 0.06/0.31 # No SInE strategy applied 0.06/0.31 # Trying AutoSched0 for 151 seconds 0.85/1.08 # AutoSched0-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y 0.85/1.08 # and selection function SelectMaxLComplexAvoidPosPred. 0.85/1.08 # 0.85/1.08 # Preprocessing time : 0.352 s 0.85/1.08 # Presaturation interreduction done 0.85/1.08 0.85/1.08 # Proof found! 0.85/1.08 # SZS status Theorem 0.85/1.08 # SZS output start CNFRefutation 0.85/1.08 fof(query158, conjecture, ?[X1]:(prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),X1)<=mtvisible(c_englishmt)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', query158)). 0.85/1.08 fof(ax2_3901, axiom, (mtvisible(c_englishmt)=>prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),s_terroriststhathasbeenamemberofagroup)), file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax', ax2_3901)). 0.85/1.08 fof(c_0_2, negated_conjecture, ~(?[X1]:(prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),X1)<=mtvisible(c_englishmt))), inference(assume_negation,[status(cth)],[query158])). 0.85/1.08 fof(c_0_3, plain, (~mtvisible(c_englishmt)|prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),s_terroriststhathasbeenamemberofagroup)), inference(fof_nnf,[status(thm)],[ax2_3901])). 0.85/1.08 fof(c_0_4, negated_conjecture, ![X5993]:(mtvisible(c_englishmt)&~prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),X5993)), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])])])])])). 0.85/1.08 cnf(c_0_5, plain, (prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),s_terroriststhathasbeenamemberofagroup)|~mtvisible(c_englishmt)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.85/1.08 cnf(c_0_6, negated_conjecture, (mtvisible(c_englishmt)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.85/1.08 cnf(c_0_7, plain, (prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),s_terroriststhathasbeenamemberofagroup)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5, c_0_6])])). 0.85/1.08 cnf(c_0_8, negated_conjecture, (~prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),X1)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.85/1.08 cnf(c_0_9, plain, ($false), inference(sr,[status(thm)],[c_0_7, c_0_8]), ['proof']). 0.85/1.08 # SZS output end CNFRefutation 0.85/1.08 # Proof object total steps : 10 0.85/1.08 # Proof object clause steps : 5 0.85/1.08 # Proof object formula steps : 5 0.85/1.08 # Proof object conjectures : 5 0.85/1.08 # Proof object clause conjectures : 2 0.85/1.08 # Proof object formula conjectures : 3 0.85/1.08 # Proof object initial clauses used : 3 0.85/1.08 # Proof object initial formulas used : 2 0.85/1.08 # Proof object generating inferences : 0 0.85/1.08 # Proof object simplifying inferences : 3 0.85/1.08 # Training examples: 0 positive, 0 negative 0.85/1.08 # Parsed axioms : 8006 0.85/1.08 # Removed by relevancy pruning/SinE : 0 0.85/1.08 # Initial clauses : 8007 0.85/1.08 # Removed in clause preprocessing : 0 0.85/1.08 # Initial clauses in saturation : 8007 0.85/1.08 # Processed clauses : 7793 0.85/1.08 # ...of these trivial : 343 0.85/1.08 # ...subsumed : 327 0.85/1.08 # ...remaining for further processing : 7123 0.85/1.08 # Other redundant clauses eliminated : 0 0.85/1.08 # Clauses deleted for lack of memory : 0 0.85/1.08 # Backward-subsumed : 0 0.85/1.08 # Backward-rewritten : 9 0.85/1.08 # Generated clauses : 15 0.85/1.08 # ...of the previous two non-trivial : 0 0.85/1.08 # Contextual simplify-reflections : 20 0.85/1.08 # Paramodulations : 0 0.85/1.08 # Factorizations : 0 0.85/1.08 # Equation resolutions : 0 0.85/1.08 # Propositional unsat checks : 0 0.85/1.08 # Propositional check models : 0 0.85/1.08 # Propositional check unsatisfiable : 0 0.85/1.08 # Propositional clauses : 0 0.85/1.08 # Propositional clauses after purity: 0 0.85/1.08 # Propositional unsat core size : 0 0.85/1.08 # Current number of processed clauses : 7099 0.85/1.08 # Positive orientable unit clauses : 2918 0.85/1.08 # Positive unorientable unit clauses: 0 0.85/1.08 # Negative unit clauses : 33 0.85/1.08 # Non-unit-clauses : 4148 0.85/1.08 # Current number of unprocessed clauses: 214 0.85/1.08 # ...number of literals in the above : 490 0.85/1.08 # Current number of archived formulas : 0 0.85/1.08 # Current number of archived clauses : 24 0.85/1.08 # Clause-clause subsumption calls (NU) : 1856349 0.85/1.08 # Rec. Clause-clause subsumption calls : 1718481 0.85/1.08 # Non-unit clause-clause subsumptions : 347 0.85/1.08 # Unit Clause-clause subsumption calls : 36491 0.85/1.08 # Rewrite failures with RHS unbound : 0 0.85/1.08 # BW rewrite match attempts : 2553 0.85/1.08 # BW rewrite match successes : 9 0.85/1.08 # Condensation attempts : 0 0.85/1.08 # Condensation successes : 0 0.85/1.08 # Termbank termtop insertions : 320739 0.85/1.08 0.85/1.08 # ------------------------------------------------- 0.85/1.08 # User time : 0.805 s 0.85/1.08 # System time : 0.035 s 0.85/1.08 # Total time : 0.840 s 0.85/1.08 # Maximum resident set size: 8688 pages 0.85/1.08 EOF