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 : n022.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:55:39 CDT 2018 0.02/0.24 % CPUTime : 0.02/0.24 # Version: 2.2pre001 0.07/0.24 # No SInE strategy applied 0.07/0.24 # Trying AutoSched0 for 151 seconds 0.07/0.28 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y 0.07/0.28 # and selection function SelectMaxLComplexAvoidPosPred. 0.07/0.28 # 0.07/0.28 # Preprocessing time : 0.018 s 0.07/0.28 # Presaturation interreduction done 0.07/0.28 0.07/0.28 # Proof found! 0.07/0.28 # SZS status Theorem 0.07/0.28 # SZS output start CNFRefutation 0.07/0.28 fof(aSatz10_7, conjecture, ![X12, X15, X13, X16]:(X12=X15|X13=X16|reflect(X12,X15,X13)!=reflect(X12,X15,X16)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', aSatz10_7)). 0.07/0.28 fof(aSatz10_5, axiom, ![X12, X15, X13]:(reflect(X12,X15,reflect(X12,X15,X13))=X13|X15=X12), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', aSatz10_5)). 0.07/0.28 fof(c_0_2, negated_conjecture, ~(![X12, X15, X13, X16]:(X12=X15|X13=X16|reflect(X12,X15,X13)!=reflect(X12,X15,X16))), inference(assume_negation,[status(cth)],[aSatz10_7])). 0.07/0.28 fof(c_0_3, plain, ![X720, X721, X722]:(reflect(X720,X721,reflect(X720,X721,X722))=X722|X721=X720), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[aSatz10_5])])])). 0.07/0.28 fof(c_0_4, negated_conjecture, ((esk1_0!=esk2_0&esk3_0!=esk4_0)&reflect(esk1_0,esk2_0,esk3_0)=reflect(esk1_0,esk2_0,esk4_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])). 0.07/0.28 cnf(c_0_5, plain, (reflect(X1,X2,reflect(X1,X2,X3))=X3|X2=X1), inference(split_conjunct,[status(thm)],[c_0_3])). 0.07/0.28 cnf(c_0_6, negated_conjecture, (reflect(esk1_0,esk2_0,esk3_0)=reflect(esk1_0,esk2_0,esk4_0)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.07/0.28 cnf(c_0_7, negated_conjecture, (esk1_0!=esk2_0), inference(split_conjunct,[status(thm)],[c_0_4])). 0.07/0.28 cnf(c_0_8, negated_conjecture, (reflect(esk1_0,esk2_0,reflect(esk1_0,esk2_0,esk4_0))=esk3_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_7])). 0.07/0.28 cnf(c_0_9, negated_conjecture, (esk3_0!=esk4_0), inference(split_conjunct,[status(thm)],[c_0_4])). 0.07/0.28 cnf(c_0_10, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_8]), c_0_9]), c_0_7]), ['proof']). 0.07/0.28 # SZS output end CNFRefutation 0.07/0.28 # Proof object total steps : 11 0.07/0.28 # Proof object clause steps : 6 0.07/0.28 # Proof object formula steps : 5 0.07/0.28 # Proof object conjectures : 8 0.07/0.28 # Proof object clause conjectures : 5 0.07/0.28 # Proof object formula conjectures : 3 0.07/0.28 # Proof object initial clauses used : 4 0.07/0.28 # Proof object initial formulas used : 2 0.07/0.28 # Proof object generating inferences : 2 0.07/0.28 # Proof object simplifying inferences : 3 0.07/0.28 # Training examples: 0 positive, 0 negative 0.07/0.28 # Parsed axioms : 204 0.07/0.28 # Removed by relevancy pruning/SinE : 0 0.07/0.28 # Initial clauses : 297 0.07/0.28 # Removed in clause preprocessing : 1 0.07/0.28 # Initial clauses in saturation : 296 0.07/0.28 # Processed clauses : 387 0.07/0.28 # ...of these trivial : 2 0.07/0.28 # ...subsumed : 32 0.07/0.28 # ...remaining for further processing : 353 0.07/0.28 # Other redundant clauses eliminated : 22 0.07/0.28 # Clauses deleted for lack of memory : 0 0.07/0.28 # Backward-subsumed : 1 0.07/0.28 # Backward-rewritten : 1 0.07/0.28 # Generated clauses : 58 0.07/0.28 # ...of the previous two non-trivial : 37 0.07/0.28 # Contextual simplify-reflections : 23 0.07/0.28 # Paramodulations : 34 0.07/0.28 # Factorizations : 0 0.07/0.28 # Equation resolutions : 24 0.07/0.28 # Propositional unsat checks : 0 0.07/0.28 # Propositional check models : 0 0.07/0.28 # Propositional check unsatisfiable : 0 0.07/0.28 # Propositional clauses : 0 0.07/0.28 # Propositional clauses after purity: 0 0.07/0.28 # Propositional unsat core size : 0 0.07/0.28 # Current number of processed clauses : 64 0.07/0.28 # Positive orientable unit clauses : 18 0.07/0.28 # Positive unorientable unit clauses: 0 0.07/0.28 # Negative unit clauses : 14 0.07/0.28 # Non-unit-clauses : 32 0.07/0.28 # Current number of unprocessed clauses: 214 0.07/0.28 # ...number of literals in the above : 736 0.07/0.28 # Current number of archived formulas : 0 0.07/0.28 # Current number of archived clauses : 271 0.07/0.28 # Clause-clause subsumption calls (NU) : 26221 0.07/0.28 # Rec. Clause-clause subsumption calls : 6663 0.07/0.28 # Non-unit clause-clause subsumptions : 52 0.07/0.28 # Unit Clause-clause subsumption calls : 121 0.07/0.28 # Rewrite failures with RHS unbound : 0 0.07/0.28 # BW rewrite match attempts : 75 0.07/0.28 # BW rewrite match successes : 1 0.07/0.28 # Condensation attempts : 0 0.07/0.28 # Condensation successes : 0 0.07/0.28 # Termbank termtop insertions : 26775 0.07/0.28 0.07/0.28 # ------------------------------------------------- 0.07/0.28 # User time : 0.032 s 0.07/0.28 # System time : 0.007 s 0.07/0.28 # Total time : 0.039 s 0.07/0.28 # Maximum resident set size: 2000 pages 0.07/0.28 EOF