0.03/0.14 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.15 % Command : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s 0.15/0.34 % Computer : n008.cluster.edu 0.15/0.34 % Model : x86_64 x86_64 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.15/0.34 % Memory : 8042.1875MB 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.15/0.34 % CPULimit : 960 0.15/0.34 % WCLimit : 120 0.15/0.34 % DateTime : Thu Jul 2 06:52:14 EDT 2020 0.15/0.34 % CPUTime : 0.15/0.34 # Version: 2.5pre002 0.15/0.34 # No SInE strategy applied 0.15/0.34 # Trying AutoSched0 for 59 seconds 0.39/0.62 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_S0e 0.39/0.62 # and selection function SelectLargestNegLit. 0.39/0.62 # 0.39/0.62 # Preprocessing time : 0.054 s 0.39/0.62 0.39/0.62 # Proof found! 0.39/0.62 # SZS status Theorem 0.39/0.62 # SZS output start CNFRefutation 0.39/0.62 fof(quaternion_ds1_symm_0401, conjecture, (![X12]:(![X11]:(((X12!=pv57&~((pv57=X11&X12=X11)))=>a_select3(id_ds1_filter,X12,X11)=a_select3(id_ds1_filter,X11,X12))<=(leq(X11,n5)&leq(n0,X11)))<=(leq(X12,pred(pv57))&leq(n0,X12)))<=(((((((((((leq(pv5,n998)&leq(pv58,n5))&![X28, X29]:(((pv57=X28>(pv58,X29))=>a_select3(id_ds1_filter,X28,X29)=a_select3(id_ds1_filter,X29,X28))<=(((leq(n0,X28)&leq(X28,n5))&leq(X29,n5))&leq(n0,X29))))&![X4, X13]:((a_select3(id_ds1_filter,X13,X4)=a_select3(id_ds1_filter,X4,X13)<=gt(pv57,X4))<=(((leq(X4,n5)&leq(X13,n5))&leq(n0,X13))&leq(n0,X4))))&![X16]:((leq(X16,pred(pv57))&leq(n0,X16))=>![X5]:(a_select3(id_ds1_filter,X5,X16)=a_select3(id_ds1_filter,X16,X5)<=(leq(X5,n5)&leq(n0,X5)))))&![X19, X20]:(a_select3(pminus_ds1_filter,X19,X20)=a_select3(pminus_ds1_filter,X20,X19)<=(((leq(X19,n5)&leq(X20,n5))&leq(n0,X20))&leq(n0,X19))))&![X17, X18]:((((leq(X17,n2)&leq(X18,n2))&leq(n0,X18))&leq(n0,X17))=>a_select3(r_ds1_filter,X17,X18)=a_select3(r_ds1_filter,X18,X17)))&![X9, X10]:(a_select3(q_ds1_filter,X10,X9)=a_select3(q_ds1_filter,X9,X10)<=(((leq(n0,X10)&leq(X10,n5))&leq(X9,n5))&leq(n0,X9))))>(pv58,pv57))&leq(pv57,n5))&leq(n0,pv57))&leq(n0,pv5))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', quaternion_ds1_symm_0401)). 0.39/0.62 fof(pred_minus_1, axiom, ![X1]:minus(X1,n1)=pred(X1), file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax', pred_minus_1)). 0.39/0.62 fof(c_0_2, negated_conjecture, ~((![X12]:(![X11]:(((X12!=pv57&~((pv57=X11&X12=X11)))=>a_select3(id_ds1_filter,X12,X11)=a_select3(id_ds1_filter,X11,X12))<=(leq(X11,n5)&leq(n0,X11)))<=(leq(X12,pred(pv57))&leq(n0,X12)))<=(((((((((((leq(pv5,n998)&leq(pv58,n5))&![X28, X29]:(((pv57=X28>(pv58,X29))=>a_select3(id_ds1_filter,X28,X29)=a_select3(id_ds1_filter,X29,X28))<=(((leq(n0,X28)&leq(X28,n5))&leq(X29,n5))&leq(n0,X29))))&![X4, X13]:((a_select3(id_ds1_filter,X13,X4)=a_select3(id_ds1_filter,X4,X13)<=gt(pv57,X4))<=(((leq(X4,n5)&leq(X13,n5))&leq(n0,X13))&leq(n0,X4))))&![X16]:((leq(X16,pred(pv57))&leq(n0,X16))=>![X5]:(a_select3(id_ds1_filter,X5,X16)=a_select3(id_ds1_filter,X16,X5)<=(leq(X5,n5)&leq(n0,X5)))))&![X19, X20]:(a_select3(pminus_ds1_filter,X19,X20)=a_select3(pminus_ds1_filter,X20,X19)<=(((leq(X19,n5)&leq(X20,n5))&leq(n0,X20))&leq(n0,X19))))&![X17, X18]:((((leq(X17,n2)&leq(X18,n2))&leq(n0,X18))&leq(n0,X17))=>a_select3(r_ds1_filter,X17,X18)=a_select3(r_ds1_filter,X18,X17)))&![X9, X10]:(a_select3(q_ds1_filter,X10,X9)=a_select3(q_ds1_filter,X9,X10)<=(((leq(n0,X10)&leq(X10,n5))&leq(X9,n5))&leq(n0,X9))))>(pv58,pv57))&leq(pv57,n5))&leq(n0,pv57))&leq(n0,pv5)))), inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0401])). 0.39/0.62 fof(c_0_3, negated_conjecture, ![X195, X196, X197, X198, X199, X200, X201, X202, X203, X204, X205, X206]:((((((((((((leq(pv5,n998)&leq(pv58,n5))&(~leq(n0,X195)|~leq(X195,n5)|~leq(X196,n5)|~leq(n0,X196)|(pv57!=X195|~gt(pv58,X196)|a_select3(id_ds1_filter,X195,X196)=a_select3(id_ds1_filter,X196,X195))))&(~leq(X197,n5)|~leq(X198,n5)|~leq(n0,X198)|~leq(n0,X197)|(~gt(pv57,X197)|a_select3(id_ds1_filter,X198,X197)=a_select3(id_ds1_filter,X197,X198))))&(~leq(X199,pred(pv57))|~leq(n0,X199)|(~leq(X200,n5)|~leq(n0,X200)|a_select3(id_ds1_filter,X200,X199)=a_select3(id_ds1_filter,X199,X200))))&(~leq(X201,n5)|~leq(X202,n5)|~leq(n0,X202)|~leq(n0,X201)|a_select3(pminus_ds1_filter,X201,X202)=a_select3(pminus_ds1_filter,X202,X201)))&(~leq(X203,n2)|~leq(X204,n2)|~leq(n0,X204)|~leq(n0,X203)|a_select3(r_ds1_filter,X203,X204)=a_select3(r_ds1_filter,X204,X203)))&(~leq(n0,X206)|~leq(X206,n5)|~leq(X205,n5)|~leq(n0,X205)|a_select3(q_ds1_filter,X206,X205)=a_select3(q_ds1_filter,X205,X206)))>(pv58,pv57))&leq(pv57,n5))&leq(n0,pv57))&leq(n0,pv5))&((leq(esk28_0,pred(pv57))&leq(n0,esk28_0))&((leq(esk29_0,n5)&leq(n0,esk29_0))&((esk28_0!=pv57&(pv57!=esk29_0|esk28_0!=esk29_0))&a_select3(id_ds1_filter,esk28_0,esk29_0)!=a_select3(id_ds1_filter,esk29_0,esk28_0))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])])])])])). 0.39/0.62 fof(c_0_4, plain, ![X42]:minus(X42,n1)=pred(X42), inference(variable_rename,[status(thm)],[pred_minus_1])). 0.39/0.62 cnf(c_0_5, negated_conjecture, (a_select3(id_ds1_filter,X2,X1)=a_select3(id_ds1_filter,X1,X2)|~leq(X1,pred(pv57))|~leq(n0,X1)|~leq(X2,n5)|~leq(n0,X2)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.39/0.62 cnf(c_0_6, plain, (minus(X1,n1)=pred(X1)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.39/0.62 cnf(c_0_7, negated_conjecture, (leq(esk28_0,pred(pv57))), inference(split_conjunct,[status(thm)],[c_0_3])). 0.39/0.62 cnf(c_0_8, negated_conjecture, (a_select3(id_ds1_filter,X1,X2)=a_select3(id_ds1_filter,X2,X1)|~leq(X2,n5)|~leq(n0,X2)|~leq(n0,X1)|~leq(X1,minus(pv57,n1))), inference(rw,[status(thm)],[c_0_5, c_0_6])). 0.39/0.62 cnf(c_0_9, negated_conjecture, (leq(esk28_0,minus(pv57,n1))), inference(rw,[status(thm)],[c_0_7, c_0_6])). 0.39/0.62 cnf(c_0_10, negated_conjecture, (leq(n0,esk28_0)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.39/0.62 cnf(c_0_11, negated_conjecture, (a_select3(id_ds1_filter,esk28_0,X1)=a_select3(id_ds1_filter,X1,esk28_0)|~leq(X1,n5)|~leq(n0,X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])])). 0.39/0.62 cnf(c_0_12, negated_conjecture, (leq(esk29_0,n5)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.39/0.62 cnf(c_0_13, negated_conjecture, (leq(n0,esk29_0)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.39/0.62 cnf(c_0_14, negated_conjecture, (a_select3(id_ds1_filter,esk28_0,esk29_0)!=a_select3(id_ds1_filter,esk29_0,esk28_0)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.39/0.62 cnf(c_0_15, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13])]), c_0_14]), ['proof']). 0.39/0.62 # SZS output end CNFRefutation 0.39/0.62 # Proof object total steps : 16 0.39/0.62 # Proof object clause steps : 11 0.39/0.62 # Proof object formula steps : 5 0.39/0.62 # Proof object conjectures : 13 0.39/0.62 # Proof object clause conjectures : 10 0.39/0.62 # Proof object formula conjectures : 3 0.39/0.62 # Proof object initial clauses used : 7 0.39/0.62 # Proof object initial formulas used : 2 0.39/0.62 # Proof object generating inferences : 2 0.39/0.62 # Proof object simplifying inferences : 7 0.39/0.62 # Training examples: 0 positive, 0 negative 0.39/0.62 # Parsed axioms : 92 0.39/0.62 # Removed by relevancy pruning/SinE : 0 0.39/0.62 # Initial clauses : 313 0.39/0.62 # Removed in clause preprocessing : 2 0.39/0.62 # Initial clauses in saturation : 311 0.39/0.62 # Processed clauses : 1700 0.39/0.62 # ...of these trivial : 107 0.39/0.62 # ...subsumed : 446 0.39/0.62 # ...remaining for further processing : 1147 0.39/0.62 # Other redundant clauses eliminated : 3 0.39/0.62 # Clauses deleted for lack of memory : 0 0.39/0.62 # Backward-subsumed : 72 0.39/0.62 # Backward-rewritten : 8 0.39/0.62 # Generated clauses : 11316 0.39/0.62 # ...of the previous two non-trivial : 9748 0.39/0.62 # Contextual simplify-reflections : 0 0.39/0.62 # Paramodulations : 11309 0.39/0.62 # Factorizations : 2 0.39/0.62 # Equation resolutions : 5 0.39/0.62 # Propositional unsat checks : 0 0.39/0.62 # Propositional check models : 0 0.39/0.62 # Propositional check unsatisfiable : 0 0.39/0.62 # Propositional clauses : 0 0.39/0.62 # Propositional clauses after purity: 0 0.39/0.62 # Propositional unsat core size : 0 0.39/0.62 # Propositional preprocessing time : 0.000 0.39/0.62 # Propositional encoding time : 0.000 0.39/0.62 # Propositional solver time : 0.000 0.39/0.62 # Success case prop preproc time : 0.000 0.39/0.62 # Success case prop encoding time : 0.000 0.39/0.62 # Success case prop solver time : 0.000 0.39/0.62 # Current number of processed clauses : 1066 0.39/0.62 # Positive orientable unit clauses : 441 0.39/0.62 # Positive unorientable unit clauses: 5 0.39/0.62 # Negative unit clauses : 4 0.39/0.62 # Non-unit-clauses : 616 0.39/0.62 # Current number of unprocessed clauses: 8305 0.39/0.62 # ...number of literals in the above : 40430 0.39/0.62 # Current number of archived formulas : 0 0.39/0.62 # Current number of archived clauses : 82 0.39/0.62 # Clause-clause subsumption calls (NU) : 97921 0.39/0.62 # Rec. Clause-clause subsumption calls : 23268 0.39/0.62 # Non-unit clause-clause subsumptions : 468 0.39/0.62 # Unit Clause-clause subsumption calls : 20220 0.39/0.62 # Rewrite failures with RHS unbound : 0 0.39/0.62 # BW rewrite match attempts : 224 0.39/0.62 # BW rewrite match successes : 42 0.39/0.62 # Condensation attempts : 0 0.39/0.62 # Condensation successes : 0 0.39/0.62 # Termbank termtop insertions : 294940 0.39/0.62 0.39/0.62 # ------------------------------------------------- 0.39/0.62 # User time : 0.268 s 0.39/0.62 # System time : 0.013 s 0.39/0.62 # Total time : 0.282 s 0.39/0.62 # Maximum resident set size: 1740 pages 0.39/0.62 EOF