0.00/0.03 % 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 : n151.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:20:55 CDT 2018 0.02/0.24 % CPUTime : 0.02/0.24 # Version: 2.2pre001 0.02/0.24 # No SInE strategy applied 0.02/0.24 # Trying AutoSched0 for 151 seconds 1.42/1.68 # AutoSched0-Mode selected heuristic SAT001_MinMin_t00X000_rr 1.42/1.68 # and selection function SelectMaxLComplexAvoidPosPred. 1.42/1.68 # 1.42/1.68 # Preprocessing time : 0.022 s 1.42/1.68 # Presaturation interreduction done 1.42/1.68 1.42/1.68 # Proof found! 1.42/1.68 # SZS status Theorem 1.42/1.68 # SZS output start CNFRefutation 1.42/1.68 fof(leq_succ_gt_equiv, axiom, ![X5, X9]:(gt(succ(X9),X5)<=>leq(X5,X9)), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', leq_succ_gt_equiv)). 1.42/1.68 fof(succ_plus_1_l, axiom, ![X5]:succ(X5)=plus(n1,X5), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', succ_plus_1_l)). 1.42/1.68 fof(irreflexivity_gt, axiom, ![X5]:~(gt(X5,X5)), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', irreflexivity_gt)). 1.42/1.68 fof(succ_pred, axiom, ![X5]:succ(pred(X5))=X5, file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', succ_pred)). 1.42/1.68 fof(pred_minus_1, axiom, ![X5]:minus(X5,n1)=pred(X5), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', pred_minus_1)). 1.42/1.68 fof(cl5_nebula_init_0011, conjecture, (![X4]:((leq(X4,pv40)&leq(n0,X4))=>init=a_select2(mu_init,X4))<=(((((((((((leq(n0,pv40)&![X25]:((leq(n0,X25)&leq(X25,pred(pv40)))=>init=a_select2(mu_init,X25)))&![X26]:(init=a_select2(sigma_init,X26)<=(leq(n0,X26)&leq(X26,pred(pv40)))))&(![X28]:(init=a_select2(muold_init,X28)<=(leq(n0,X28)&leq(X28,n4)))<=gt(loopcounter,n1)))&(![X3]:(init=a_select2(sigmaold_init,X3)<=(leq(n0,X3)&leq(X3,n4)))<=gt(loopcounter,n1)))&(![X29]:((leq(X29,n4)&leq(n0,X29))=>a_select2(rhoold_init,X29)=init)<=gt(loopcounter,n1)))&![X27]:(init=a_select3(center_init,X27,n0)<=(leq(X27,n4)&leq(n0,X27))))&![X11]:(init=a_select2(rho_init,X11)<=(leq(n0,X11)&leq(X11,n4))))&![X1]:(![X21]:(a_select3(q_init,X1,X21)=init<=(leq(X21,n4)&leq(n0,X21)))<=(leq(n0,X1)&leq(X1,n135299))))&leq(pv40,n4))&a_select2(sigma_init,pv40)=init)&init=a_select2(mu_init,pv40))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cl5_nebula_init_0011)). 1.42/1.68 fof(transitivity_leq, axiom, ![X5, X9, X10]:(leq(X5,X10)<=(leq(X9,X10)&leq(X5,X9))), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', transitivity_leq)). 1.42/1.68 fof(leq_gt_pred, axiom, ![X5, X9]:(gt(X9,X5)<=>leq(X5,pred(X9))), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', leq_gt_pred)). 1.42/1.68 fof(totality, axiom, ![X5, X9]:(X5=X9|gt(X9,X5)|gt(X5,X9)), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', totality)). 1.42/1.68 fof(c_0_9, plain, ![X128, X129, X128, X129]:((~gt(succ(X129),X128)|leq(X128,X129))&(~leq(X128,X129)|gt(succ(X129),X128))), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt_equiv])])])])). 1.42/1.68 fof(c_0_10, plain, ![X37]:succ(X37)=plus(n1,X37), inference(variable_rename,[status(thm)],[succ_plus_1_l])). 1.42/1.68 fof(c_0_11, plain, ![X127]:~gt(X127,X127), inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[irreflexivity_gt])])). 1.42/1.68 cnf(c_0_12, plain, (gt(succ(X2),X1)|~leq(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_9])). 1.42/1.68 cnf(c_0_13, plain, (succ(X1)=plus(n1,X1)), inference(split_conjunct,[status(thm)],[c_0_10])). 1.42/1.68 fof(c_0_14, plain, ![X67]:succ(pred(X67))=X67, inference(variable_rename,[status(thm)],[succ_pred])). 1.42/1.68 fof(c_0_15, plain, ![X126]:minus(X126,n1)=pred(X126), inference(variable_rename,[status(thm)],[pred_minus_1])). 1.42/1.68 fof(c_0_16, negated_conjecture, ~((![X4]:((leq(X4,pv40)&leq(n0,X4))=>init=a_select2(mu_init,X4))<=(((((((((((leq(n0,pv40)&![X25]:((leq(n0,X25)&leq(X25,pred(pv40)))=>init=a_select2(mu_init,X25)))&![X26]:(init=a_select2(sigma_init,X26)<=(leq(n0,X26)&leq(X26,pred(pv40)))))&(![X28]:(init=a_select2(muold_init,X28)<=(leq(n0,X28)&leq(X28,n4)))<=gt(loopcounter,n1)))&(![X3]:(init=a_select2(sigmaold_init,X3)<=(leq(n0,X3)&leq(X3,n4)))<=gt(loopcounter,n1)))&(![X29]:((leq(X29,n4)&leq(n0,X29))=>a_select2(rhoold_init,X29)=init)<=gt(loopcounter,n1)))&![X27]:(init=a_select3(center_init,X27,n0)<=(leq(X27,n4)&leq(n0,X27))))&![X11]:(init=a_select2(rho_init,X11)<=(leq(n0,X11)&leq(X11,n4))))&![X1]:(![X21]:(a_select3(q_init,X1,X21)=init<=(leq(X21,n4)&leq(n0,X21)))<=(leq(n0,X1)&leq(X1,n135299))))&leq(pv40,n4))&a_select2(sigma_init,pv40)=init)&init=a_select2(mu_init,pv40)))), inference(assume_negation,[status(cth)],[cl5_nebula_init_0011])). 1.42/1.68 cnf(c_0_17, plain, (~gt(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_11])). 1.42/1.68 cnf(c_0_18, plain, (gt(plus(n1,X2),X1)|~leq(X1,X2)), inference(rw,[status(thm)],[c_0_12, c_0_13])). 1.42/1.68 cnf(c_0_19, plain, (succ(pred(X1))=X1), inference(split_conjunct,[status(thm)],[c_0_14])). 1.42/1.68 cnf(c_0_20, plain, (minus(X1,n1)=pred(X1)), inference(split_conjunct,[status(thm)],[c_0_15])). 1.42/1.68 fof(c_0_21, plain, ![X123, X124, X125]:(~leq(X124,X125)|~leq(X123,X124)|leq(X123,X125)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[transitivity_leq])])])). 1.42/1.68 fof(c_0_22, negated_conjecture, ![X192, X193, X194, X195, X196, X197, X198, X199, X200]:((((((((((((leq(n0,pv40)&(~leq(n0,X192)|~leq(X192,pred(pv40))|init=a_select2(mu_init,X192)))&(~leq(n0,X193)|~leq(X193,pred(pv40))|init=a_select2(sigma_init,X193)))&(~gt(loopcounter,n1)|(~leq(n0,X194)|~leq(X194,n4)|init=a_select2(muold_init,X194))))&(~gt(loopcounter,n1)|(~leq(n0,X195)|~leq(X195,n4)|init=a_select2(sigmaold_init,X195))))&(~gt(loopcounter,n1)|(~leq(X196,n4)|~leq(n0,X196)|a_select2(rhoold_init,X196)=init)))&(~leq(X197,n4)|~leq(n0,X197)|init=a_select3(center_init,X197,n0)))&(~leq(n0,X198)|~leq(X198,n4)|init=a_select2(rho_init,X198)))&(~leq(n0,X199)|~leq(X199,n135299)|(~leq(X200,n4)|~leq(n0,X200)|a_select3(q_init,X199,X200)=init)))&leq(pv40,n4))&a_select2(sigma_init,pv40)=init)&init=a_select2(mu_init,pv40))&((leq(esk28_0,pv40)&leq(n0,esk28_0))&init!=a_select2(mu_init,esk28_0))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[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_16])])])])])])])). 1.42/1.68 cnf(c_0_23, plain, (~leq(plus(n1,X1),X1)), inference(spm,[status(thm)],[c_0_17, c_0_18])). 1.42/1.68 cnf(c_0_24, plain, (plus(n1,minus(X1,n1))=X1), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19, c_0_13]), c_0_20])). 1.42/1.68 cnf(c_0_25, plain, (leq(X3,X2)|~leq(X1,X2)|~leq(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_21])). 1.42/1.68 cnf(c_0_26, negated_conjecture, (leq(esk28_0,pv40)), inference(split_conjunct,[status(thm)],[c_0_22])). 1.42/1.68 fof(c_0_27, plain, ![X161, X162, X161, X162]:((~gt(X162,X161)|leq(X161,pred(X162)))&(~leq(X161,pred(X162))|gt(X162,X161))), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])])])])). 1.42/1.68 cnf(c_0_28, plain, (~leq(X1,minus(X1,n1))), inference(spm,[status(thm)],[c_0_23, c_0_24])). 1.42/1.68 cnf(c_0_29, negated_conjecture, (leq(esk28_0,X1)|~leq(pv40,X1)), inference(spm,[status(thm)],[c_0_25, c_0_26])). 1.42/1.68 cnf(c_0_30, plain, (leq(X2,pred(X1))|~gt(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_27])). 1.42/1.68 cnf(c_0_31, negated_conjecture, (init=a_select2(mu_init,X1)|~leq(n0,X1)|~leq(X1,pred(pv40))), inference(split_conjunct,[status(thm)],[c_0_22])). 1.42/1.68 cnf(c_0_32, negated_conjecture, (~leq(pv40,minus(esk28_0,n1))), inference(spm,[status(thm)],[c_0_28, c_0_29])). 1.42/1.68 cnf(c_0_33, plain, (leq(X2,minus(X1,n1))|~gt(X1,X2)), inference(rw,[status(thm)],[c_0_30, c_0_20])). 1.42/1.68 fof(c_0_34, plain, ![X90, X91]:(X90=X91|gt(X91,X90)|gt(X90,X91)), inference(variable_rename,[status(thm)],[totality])). 1.42/1.68 cnf(c_0_35, negated_conjecture, (init=a_select2(mu_init,X1)|~leq(n0,X1)|~leq(X1,minus(pv40,n1))), inference(rw,[status(thm)],[c_0_31, c_0_20])). 1.42/1.68 cnf(c_0_36, negated_conjecture, (~gt(esk28_0,pv40)), inference(spm,[status(thm)],[c_0_32, c_0_33])). 1.42/1.68 cnf(c_0_37, plain, (X1=X2|gt(X2,X1)|gt(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_34])). 1.42/1.68 cnf(c_0_38, negated_conjecture, (init!=a_select2(mu_init,esk28_0)), inference(split_conjunct,[status(thm)],[c_0_22])). 1.42/1.68 cnf(c_0_39, negated_conjecture, (a_select2(mu_init,X1)=init|~gt(pv40,X1)|~leq(n0,X1)), inference(spm,[status(thm)],[c_0_35, c_0_33])). 1.42/1.68 cnf(c_0_40, negated_conjecture, (leq(n0,esk28_0)), inference(split_conjunct,[status(thm)],[c_0_22])). 1.42/1.68 cnf(c_0_41, negated_conjecture, (esk28_0=pv40|gt(pv40,esk28_0)), inference(spm,[status(thm)],[c_0_36, c_0_37])). 1.42/1.68 cnf(c_0_42, negated_conjecture, (~gt(pv40,esk28_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_40])])). 1.42/1.68 cnf(c_0_43, negated_conjecture, (esk28_0=pv40), inference(sr,[status(thm)],[c_0_41, c_0_42])). 1.42/1.68 cnf(c_0_44, negated_conjecture, (init=a_select2(mu_init,pv40)), inference(split_conjunct,[status(thm)],[c_0_22])). 1.42/1.68 cnf(c_0_45, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38, c_0_43]), c_0_44])]), ['proof']). 1.42/1.68 # SZS output end CNFRefutation 1.42/1.68 # Proof object total steps : 46 1.42/1.68 # Proof object clause steps : 27 1.42/1.68 # Proof object formula steps : 19 1.42/1.68 # Proof object conjectures : 17 1.42/1.68 # Proof object clause conjectures : 14 1.42/1.68 # Proof object formula conjectures : 3 1.42/1.68 # Proof object initial clauses used : 13 1.42/1.68 # Proof object initial formulas used : 9 1.42/1.68 # Proof object generating inferences : 8 1.42/1.68 # Proof object simplifying inferences : 11 1.42/1.68 # Training examples: 0 positive, 0 negative 1.42/1.68 # Parsed axioms : 92 1.42/1.68 # Removed by relevancy pruning/SinE : 0 1.42/1.68 # Initial clauses : 309 1.42/1.68 # Removed in clause preprocessing : 2 1.42/1.68 # Initial clauses in saturation : 307 1.42/1.68 # Processed clauses : 5842 1.42/1.68 # ...of these trivial : 38 1.42/1.68 # ...subsumed : 3702 1.42/1.68 # ...remaining for further processing : 2102 1.42/1.68 # Other redundant clauses eliminated : 12 1.42/1.68 # Clauses deleted for lack of memory : 0 1.42/1.68 # Backward-subsumed : 279 1.42/1.68 # Backward-rewritten : 493 1.42/1.68 # Generated clauses : 101541 1.42/1.68 # ...of the previous two non-trivial : 86853 1.42/1.68 # Contextual simplify-reflections : 771 1.42/1.68 # Paramodulations : 101379 1.42/1.68 # Factorizations : 150 1.42/1.68 # Equation resolutions : 12 1.42/1.68 # Propositional unsat checks : 0 1.42/1.68 # Propositional check models : 0 1.42/1.68 # Propositional check unsatisfiable : 0 1.42/1.68 # Propositional clauses : 0 1.42/1.68 # Propositional clauses after purity: 0 1.42/1.68 # Propositional unsat core size : 0 1.42/1.68 # Current number of processed clauses : 1020 1.42/1.68 # Positive orientable unit clauses : 163 1.42/1.68 # Positive unorientable unit clauses: 5 1.42/1.68 # Negative unit clauses : 233 1.42/1.68 # Non-unit-clauses : 619 1.42/1.68 # Current number of unprocessed clauses: 29686 1.42/1.68 # ...number of literals in the above : 181080 1.42/1.68 # Current number of archived formulas : 0 1.42/1.68 # Current number of archived clauses : 1082 1.42/1.68 # Clause-clause subsumption calls (NU) : 253330 1.42/1.68 # Rec. Clause-clause subsumption calls : 68272 1.42/1.68 # Non-unit clause-clause subsumptions : 1900 1.42/1.68 # Unit Clause-clause subsumption calls : 35590 1.42/1.68 # Rewrite failures with RHS unbound : 0 1.42/1.68 # BW rewrite match attempts : 86 1.42/1.68 # BW rewrite match successes : 66 1.42/1.68 # Condensation attempts : 0 1.42/1.68 # Condensation successes : 0 1.42/1.68 # Termbank termtop insertions : 2673741 1.42/1.68 1.42/1.68 # ------------------------------------------------- 1.42/1.68 # User time : 1.392 s 1.42/1.68 # System time : 0.050 s 1.42/1.68 # Total time : 1.443 s 1.42/1.68 # Maximum resident set size: 1676 pages 1.42/1.68 EOF