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 : n063.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:24:40 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 2.04/2.26 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_AE_CS_SP_PI_S0Y 2.04/2.26 # and selection function SelectMaxLComplexAvoidPosPred. 2.04/2.26 # 2.04/2.26 # Preprocessing time : 0.011 s 2.04/2.26 2.04/2.26 # Proof found! 2.04/2.26 # SZS status Theorem 2.04/2.26 # SZS output start CNFRefutation 2.04/2.26 fof(conj, conjecture, ![X12, X13, X1, X2]:(((((((((![X4, X14]:(elem(m_Down(X14),queue(host(X4)))=>~(setIn(X14,alive)))&![X4, X15, X14]:(~(leq(host(X4),host(X14)))<=elem(m_Ack(X14,X4),queue(host(X15)))))&![X4, X14]:(((~(setIn(X4,alive))&host(X14)=host(X4))&leq(X14,X4))=>~(setIn(X14,alive))))&![X4, X16, X15, X14]:(((((host(X15)!=host(X4)&setIn(X4,alive))&setIn(X15,alive))&host(X14)=host(X15))&host(X4)=host(X16))=>~((elem(m_Down(X16),queue(host(X15)))&elem(m_Down(X14),queue(host(X4)))))))&cons(m_Down(X2),X12)=queue(host(X1)))&![X4, X14]:((host(X4)=host(X14)&X4!=X14)=>(~(setIn(X4,alive))|~(setIn(X14,alive)))))&![X4, X14]:(elem(m_Halt(X14),queue(host(X4)))=>~(leq(host(X4),host(X14)))))&![X4, X14]:(host(X4)!=host(X14)<=elem(m_Down(X14),queue(host(X4)))))&![X4, X14]:(~(elem(m_Down(X14),queue(host(X4))))<=setIn(X14,alive)))=>((~(leq(host(X1),host(X2)))=>((![X4]:(![X17, X18]:(host(X1)=host(X18)=>![X19]:(((((host(X18)!=host(X4)&setIn(X4,alive))&host(X4)=host(X17))&host(X18)=host(X19))&setIn(X18,alive))=>~((elem(m_Down(X17),X12)&elem(m_Down(X19),queue(host(X4)))))))<=host(X1)!=host(X4))<=~((![X4]:((X4=host(X2)|setIn(X4,index(down,host(X1))))<=(~(leq(host(X1),X4))&leq(s(zero),X4)))&elec_1=index(status,host(X1)))))<=~(((index(ldr,host(X1))=host(X2)&norm=index(status,host(X1)))|(host(index(elid,host(X1)))=host(X2)&index(status,host(X1))=wait)))))<=setIn(X1,alive))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj)). 2.04/2.26 fof(axiom_46, axiom, ![X1, X2, X3]:(elem(X1,cons(X2,X3))<=>(elem(X1,X3)|X1=X2)), file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax', axiom_46)). 2.04/2.26 fof(c_0_2, negated_conjecture, ~(![X12, X13, X1, X2]:(((((((((![X4, X14]:(elem(m_Down(X14),queue(host(X4)))=>~(setIn(X14,alive)))&![X4, X15, X14]:(~(leq(host(X4),host(X14)))<=elem(m_Ack(X14,X4),queue(host(X15)))))&![X4, X14]:(((~(setIn(X4,alive))&host(X14)=host(X4))&leq(X14,X4))=>~(setIn(X14,alive))))&![X4, X16, X15, X14]:(((((host(X15)!=host(X4)&setIn(X4,alive))&setIn(X15,alive))&host(X14)=host(X15))&host(X4)=host(X16))=>~((elem(m_Down(X16),queue(host(X15)))&elem(m_Down(X14),queue(host(X4)))))))&cons(m_Down(X2),X12)=queue(host(X1)))&![X4, X14]:((host(X4)=host(X14)&X4!=X14)=>(~(setIn(X4,alive))|~(setIn(X14,alive)))))&![X4, X14]:(elem(m_Halt(X14),queue(host(X4)))=>~(leq(host(X4),host(X14)))))&![X4, X14]:(host(X4)!=host(X14)<=elem(m_Down(X14),queue(host(X4)))))&![X4, X14]:(~(elem(m_Down(X14),queue(host(X4))))<=setIn(X14,alive)))=>((~(leq(host(X1),host(X2)))=>((![X4]:(![X17, X18]:(host(X1)=host(X18)=>![X19]:(((((host(X18)!=host(X4)&setIn(X4,alive))&host(X4)=host(X17))&host(X18)=host(X19))&setIn(X18,alive))=>~((elem(m_Down(X17),X12)&elem(m_Down(X19),queue(host(X4)))))))<=host(X1)!=host(X4))<=~((![X4]:((X4=host(X2)|setIn(X4,index(down,host(X1))))<=(~(leq(host(X1),X4))&leq(s(zero),X4)))&elec_1=index(status,host(X1)))))<=~(((index(ldr,host(X1))=host(X2)&norm=index(status,host(X1)))|(host(index(elid,host(X1)))=host(X2)&index(status,host(X1))=wait)))))<=setIn(X1,alive)))), inference(assume_negation,[status(cth)],[conj])). 2.04/2.26 fof(c_0_3, negated_conjecture, ![X146, X147, X148, X149, X150, X151, X152, X153, X154, X155, X156, X157, X158, X159, X160, X161, X162, X163, X164]:((((((((((~elem(m_Down(X147),queue(host(X146)))|~setIn(X147,alive))&(~elem(m_Ack(X150,X148),queue(host(X149)))|~leq(host(X148),host(X150))))&(setIn(X151,alive)|host(X152)!=host(X151)|~leq(X152,X151)|~setIn(X152,alive)))&(host(X155)=host(X153)|~setIn(X153,alive)|~setIn(X155,alive)|host(X156)!=host(X155)|host(X153)!=host(X154)|(~elem(m_Down(X154),queue(host(X155)))|~elem(m_Down(X156),queue(host(X153))))))&cons(m_Down(esk7_0),esk5_0)=queue(host(esk6_0)))&(host(X157)!=host(X158)|X157=X158|(~setIn(X157,alive)|~setIn(X158,alive))))&(~elem(m_Halt(X160),queue(host(X159)))|~leq(host(X159),host(X160))))&(~elem(m_Down(X162),queue(host(X161)))|host(X161)!=host(X162)))&(~setIn(X164,alive)|~elem(m_Down(X164),queue(host(X163)))))&(setIn(esk6_0,alive)&(~leq(host(esk6_0),host(esk7_0))&(((index(ldr,host(esk6_0))!=host(esk7_0)|norm!=index(status,host(esk6_0)))&(host(index(elid,host(esk6_0)))!=host(esk7_0)|index(status,host(esk6_0))!=wait))&((((~leq(host(esk6_0),esk8_0)|elec_1!=index(status,host(esk6_0)))&(leq(s(zero),esk8_0)|elec_1!=index(status,host(esk6_0))))&((esk8_0!=host(esk7_0)|elec_1!=index(status,host(esk6_0)))&(~setIn(esk8_0,index(down,host(esk6_0)))|elec_1!=index(status,host(esk6_0)))))&(host(esk6_0)!=host(esk9_0)&(host(esk6_0)=host(esk11_0)&(((((host(esk11_0)!=host(esk9_0)&setIn(esk9_0,alive))&host(esk9_0)=host(esk10_0))&host(esk11_0)=host(esk12_0))&setIn(esk11_0,alive))&(elem(m_Down(esk10_0),esk5_0)&elem(m_Down(esk12_0),queue(host(esk9_0)))))))))))), inference(distribute,[status(thm)],[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_2])])])])])])])])). 2.04/2.26 cnf(c_0_4, negated_conjecture, (host(X1)=host(X2)|~setIn(X2,alive)|~setIn(X1,alive)|host(X3)!=host(X1)|host(X2)!=host(X4)|~elem(m_Down(X4),queue(host(X1)))|~elem(m_Down(X3),queue(host(X2)))), inference(split_conjunct,[status(thm)],[c_0_3])). 2.04/2.26 cnf(c_0_5, negated_conjecture, (host(esk9_0)=host(esk10_0)), inference(split_conjunct,[status(thm)],[c_0_3])). 2.04/2.26 cnf(c_0_6, negated_conjecture, (setIn(esk9_0,alive)), inference(split_conjunct,[status(thm)],[c_0_3])). 2.04/2.26 cnf(c_0_7, negated_conjecture, (elem(m_Down(esk12_0),queue(host(esk9_0)))), inference(split_conjunct,[status(thm)],[c_0_3])). 2.04/2.26 fof(c_0_8, plain, ![X117, X118, X119, X117, X118, X119]:((~elem(X117,cons(X118,X119))|(elem(X117,X119)|X117=X118))&((~elem(X117,X119)|elem(X117,cons(X118,X119)))&(X117!=X118|elem(X117,cons(X118,X119))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])])])])). 2.04/2.26 cnf(c_0_9, negated_conjecture, (cons(m_Down(esk7_0),esk5_0)=queue(host(esk6_0))), inference(split_conjunct,[status(thm)],[c_0_3])). 2.04/2.26 cnf(c_0_10, negated_conjecture, (host(esk6_0)=host(esk11_0)), inference(split_conjunct,[status(thm)],[c_0_3])). 2.04/2.26 cnf(c_0_11, negated_conjecture, (host(esk10_0)=host(X1)|host(esk10_0)!=host(X2)|host(X1)!=host(X3)|~setIn(X1,alive)|~elem(m_Down(X3),queue(host(esk10_0)))|~elem(m_Down(X2),queue(host(X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4, c_0_5]), c_0_6])])). 2.04/2.26 cnf(c_0_12, negated_conjecture, (elem(m_Down(esk12_0),queue(host(esk10_0)))), inference(rw,[status(thm)],[c_0_7, c_0_5])). 2.04/2.26 cnf(c_0_13, negated_conjecture, (host(esk11_0)=host(esk12_0)), inference(split_conjunct,[status(thm)],[c_0_3])). 2.04/2.26 cnf(c_0_14, plain, (elem(X1,cons(X3,X2))|~elem(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_8])). 2.04/2.26 cnf(c_0_15, negated_conjecture, (cons(m_Down(esk7_0),esk5_0)=queue(host(esk11_0))), inference(rw,[status(thm)],[c_0_9, c_0_10])). 2.04/2.26 cnf(c_0_16, negated_conjecture, (host(esk11_0)!=host(esk9_0)), inference(split_conjunct,[status(thm)],[c_0_3])). 2.04/2.26 cnf(c_0_17, negated_conjecture, (host(esk10_0)=host(X1)|host(esk10_0)!=host(X2)|host(X1)!=host(esk11_0)|~setIn(X1,alive)|~elem(m_Down(X2),queue(host(X1)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13])). 2.04/2.26 cnf(c_0_18, negated_conjecture, (elem(X1,queue(host(esk11_0)))|~elem(X1,esk5_0)), inference(spm,[status(thm)],[c_0_14, c_0_15])). 2.04/2.26 cnf(c_0_19, negated_conjecture, (setIn(esk11_0,alive)), inference(split_conjunct,[status(thm)],[c_0_3])). 2.04/2.26 cnf(c_0_20, negated_conjecture, (host(esk11_0)!=host(esk10_0)), inference(rw,[status(thm)],[c_0_16, c_0_5])). 2.04/2.26 cnf(c_0_21, negated_conjecture, (host(esk10_0)!=host(X1)|~elem(m_Down(X1),esk5_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19])]), c_0_20])). 2.04/2.26 cnf(c_0_22, negated_conjecture, (elem(m_Down(esk10_0),esk5_0)), inference(split_conjunct,[status(thm)],[c_0_3])). 2.04/2.26 cnf(c_0_23, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_21, c_0_22]), ['proof']). 2.04/2.26 # SZS output end CNFRefutation 2.04/2.26 # Proof object total steps : 24 2.04/2.26 # Proof object clause steps : 19 2.04/2.26 # Proof object formula steps : 5 2.04/2.26 # Proof object conjectures : 21 2.04/2.26 # Proof object clause conjectures : 18 2.04/2.26 # Proof object formula conjectures : 3 2.04/2.26 # Proof object initial clauses used : 11 2.04/2.26 # Proof object initial formulas used : 2 2.04/2.26 # Proof object generating inferences : 5 2.04/2.26 # Proof object simplifying inferences : 9 2.04/2.26 # Training examples: 0 positive, 0 negative 2.04/2.26 # Parsed axioms : 67 2.04/2.26 # Removed by relevancy pruning/SinE : 0 2.04/2.26 # Initial clauses : 122 2.04/2.26 # Removed in clause preprocessing : 6 2.04/2.26 # Initial clauses in saturation : 116 2.04/2.26 # Processed clauses : 15640 2.04/2.26 # ...of these trivial : 129 2.04/2.26 # ...subsumed : 12099 2.04/2.26 # ...remaining for further processing : 3412 2.04/2.26 # Other redundant clauses eliminated : 8 2.04/2.26 # Clauses deleted for lack of memory : 0 2.04/2.26 # Backward-subsumed : 448 2.04/2.26 # Backward-rewritten : 13 2.04/2.26 # Generated clauses : 148587 2.04/2.26 # ...of the previous two non-trivial : 107836 2.04/2.26 # Contextual simplify-reflections : 6092 2.04/2.26 # Paramodulations : 148422 2.04/2.26 # Factorizations : 24 2.04/2.26 # Equation resolutions : 141 2.04/2.26 # Propositional unsat checks : 0 2.04/2.26 # Propositional check models : 0 2.04/2.26 # Propositional check unsatisfiable : 0 2.04/2.26 # Propositional clauses : 0 2.04/2.26 # Propositional clauses after purity: 0 2.04/2.26 # Propositional unsat core size : 0 2.04/2.26 # Current number of processed clauses : 2947 2.04/2.26 # Positive orientable unit clauses : 113 2.04/2.26 # Positive unorientable unit clauses: 0 2.04/2.26 # Negative unit clauses : 195 2.04/2.26 # Non-unit-clauses : 2639 2.04/2.26 # Current number of unprocessed clauses: 84628 2.04/2.26 # ...number of literals in the above : 288609 2.04/2.26 # Current number of archived formulas : 0 2.04/2.26 # Current number of archived clauses : 461 2.04/2.26 # Clause-clause subsumption calls (NU) : 4670172 2.04/2.26 # Rec. Clause-clause subsumption calls : 3091477 2.04/2.26 # Non-unit clause-clause subsumptions : 15979 2.04/2.26 # Unit Clause-clause subsumption calls : 45928 2.04/2.26 # Rewrite failures with RHS unbound : 0 2.04/2.26 # BW rewrite match attempts : 772 2.04/2.26 # BW rewrite match successes : 10 2.04/2.26 # Condensation attempts : 0 2.04/2.26 # Condensation successes : 0 2.04/2.26 # Termbank termtop insertions : 1935972 2.04/2.27 2.04/2.27 # ------------------------------------------------- 2.04/2.27 # User time : 1.978 s 2.04/2.27 # System time : 0.049 s 2.04/2.27 # Total time : 2.027 s 2.04/2.27 # Maximum resident set size: 1624 pages 2.04/2.27 EOF