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.23 % Computer : n167.star.cs.uiowa.edu 0.02/0.23 % Model : x86_64 x86_64 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.23 % Memory : 32218.625MB 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.23 % CPULimit : 300 0.02/0.23 % DateTime : Sat Jul 14 04:31:27 CDT 2018 0.02/0.23 % CPUTime : 0.02/0.23 # Version: 2.2pre001 0.02/0.23 # No SInE strategy applied 0.02/0.23 # Trying AutoSched0 for 151 seconds 150.99/151.23 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S0Y 150.99/151.23 # and selection function SelectMaxLComplexAvoidPosPred. 150.99/151.23 # 150.99/151.23 # Preprocessing time : 0.012 s 150.99/151.23 # Presaturation interreduction done 151.13/151.35 # No success with AutoSched0 151.13/151.35 # Trying AutoSched1 for 73 seconds 151.89/152.10 # AutoSched1-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S2f 151.89/152.10 # and selection function SelectCQIAr. 151.89/152.10 # 151.89/152.10 # Preprocessing time : 0.013 s 151.89/152.10 # Presaturation interreduction done 151.89/152.10 151.89/152.10 # Proof found! 151.89/152.10 # SZS status Theorem 151.89/152.10 # SZS output start CNFRefutation 151.89/152.10 fof(conj, conjecture, ![X12, X13]:((((((((((((((((![X1, X2]:(elem(m_Down(X2),queue(host(X1)))=>host(X1)!=host(X2))&![X1, X2, X4]:(elem(m_Ack(X4,X1),queue(host(X2)))=>~(leq(host(X1),host(X4)))))&![X1, X2]:((host(X2)=host(X1)&X1!=X2)=>(~(setIn(X1,alive))|~(setIn(X2,alive)))))&![X1, X2]:((setIn(X2,alive)&index(status,host(X2))=elec_1)=>~(elem(m_Ack(X2,X1),queue(host(X2))))))&![X1]:(index(elid,host(X1))=X1<=((index(status,host(X1))=elec_1|index(status,host(X1))=elec_2)&setIn(X1,alive))))&![X1, X2, X4]:(~(((host(X1)=index(ldr,host(X1))&norm=index(status,host(X1)))&setIn(X1,alive)))<=((setIn(X4,alive)&host(X2)=host(X1))&elem(m_Down(X2),queue(host(X4))))))&![X1, X2]:(leq(index(pendack,host(X2)),host(X1))<=((((~(leq(host(X1),host(X2)))&setIn(X1,alive))&index(status,host(X1))=elec_2)&index(status,host(X2))=elec_2)&setIn(X2,alive))))&![X1, X2, X4, X14]:(~((elem(m_Down(X2),queue(host(X1)))&setIn(X1,alive)))<=((((![X15]:((setIn(X15,index(down,host(X14)))|host(X4)=X15)<=(~(leq(host(X14),X15))&leq(s(zero),X15)))&elem(m_Down(X4),queue(host(X14))))&host(X2)=host(X14))&index(status,host(X14))=elec_1)&host(X14)=nbr_proc)))&![X1, X2, X4, X14]:(((((((elem(m_Down(X4),queue(host(X14)))&leq(nbr_proc,s(index(pendack,host(X14)))))&index(status,host(X14))=elec_2)&s(index(pendack,host(X14)))=host(X4))&index(pendack,host(X14))=host(X2))&elem(m_Ack(X14,X2),queue(host(X14))))&setIn(X14,alive))=>~(((index(status,host(X1))=norm&index(ldr,host(X1))=host(X1))&setIn(X1,alive)))))&![X1, X2, X4]:((((setIn(X4,alive)&elem(m_Halt(X4),queue(host(X2))))&elec_2=index(status,host(X4)))&~(leq(index(pendack,host(X4)),host(X1))))=>~(((host(X1)=index(ldr,host(X1))&norm=index(status,host(X1)))&setIn(X1,alive)))))&![X1, X2]:(~(leq(index(pendack,host(X1)),index(pendack,host(X2))))<=((((~(leq(host(X1),host(X2)))&setIn(X2,alive))&elec_2=index(status,host(X2)))&index(status,host(X1))=elec_2)&setIn(X1,alive))))&![X1, X2, X4]:(((((setIn(X4,alive)&host(X4)=host(X2))&index(status,host(X4))=elec_2)&index(status,host(X1))=elec_2)&setIn(X1,alive))=>~(elem(m_Ack(X1,X2),queue(host(X1))))))&![X1, X2]:((setIn(X2,alive)&elem(m_Ack(X2,X1),queue(host(X2))))=>leq(host(X1),index(pendack,host(X2)))))&![X1, X2]:(elem(m_Halt(X2),queue(host(X1)))=>~(leq(host(X1),host(X2)))))&![X1, X2]:(~(leq(host(X1),host(X2)))<=elem(m_Ldr(X2),queue(host(X1)))))&![X1]:(host(X1)=host(X13)=>~(setIn(X1,alive))))=>((((host(X12)=host(X13)&~(setIn(X12,pids)))&![X1]:(leq(X1,X12)<=host(X13)=host(X1)))=>(s(zero)=host(X12)=>(~(leq(nbr_proc,host(X12)))=>![X1]:(![X2, X4, X16]:(s(host(X12))=host(X16)=>(host(X12)!=host(X16)=>((((((((setIn(X16,alive)|X16=X12)&index(pendack,host(X16))=host(X2))&s(index(pendack,host(X16)))=host(X4))&index(status,host(X16))=elec_2)&elem(m_Ack(X16,X2),snoc(queue(host(X16)),m_Halt(X12))))&elem(m_Down(X4),snoc(queue(host(X16)),m_Halt(X12))))&leq(nbr_proc,s(index(pendack,host(X16)))))=>~(((norm=index(status,host(X1))&host(X1)=index(ldr,host(X1)))&(X12=X1|setIn(X1,alive)))))))<=host(X1)!=host(X12)))))<=queue(host(X13))=q_nil)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj)). 151.89/152.10 fof(axiom_47, axiom, ![X1, X2, X3]:(elem(X1,snoc(X3,X2))<=>(elem(X1,X3)|X2=X1)), file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax', axiom_47)). 151.89/152.10 fof(axiom_17, axiom, ![X1, X2]:m_Down(X1)!=m_Halt(X2), file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax', axiom_17)). 151.89/152.10 fof(axiom_61, axiom, ![X1, X2]:((leq(X2,X1)&leq(X1,X2))<=>X2=X1), file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax', axiom_61)). 151.89/152.10 fof(axiom_04, axiom, ![X11]:leq(host(X11),nbr_proc), file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax', axiom_04)). 151.89/152.10 fof(axiom_59, axiom, ![X1]:leq(X1,X1), file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax', axiom_59)). 151.89/152.10 fof(axiom_11, axiom, ![X1, X2, X4]:m_Ack(X1,X2)!=m_Halt(X4), file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax', axiom_11)). 151.89/152.10 fof(axiom_45, axiom, ![X1]:~(elem(X1,q_nil)), file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax', axiom_45)). 151.89/152.10 fof(c_0_8, negated_conjecture, ~(![X12, X13]:((((((((((((((((![X1, X2]:(elem(m_Down(X2),queue(host(X1)))=>host(X1)!=host(X2))&![X1, X2, X4]:(elem(m_Ack(X4,X1),queue(host(X2)))=>~(leq(host(X1),host(X4)))))&![X1, X2]:((host(X2)=host(X1)&X1!=X2)=>(~(setIn(X1,alive))|~(setIn(X2,alive)))))&![X1, X2]:((setIn(X2,alive)&index(status,host(X2))=elec_1)=>~(elem(m_Ack(X2,X1),queue(host(X2))))))&![X1]:(index(elid,host(X1))=X1<=((index(status,host(X1))=elec_1|index(status,host(X1))=elec_2)&setIn(X1,alive))))&![X1, X2, X4]:(~(((host(X1)=index(ldr,host(X1))&norm=index(status,host(X1)))&setIn(X1,alive)))<=((setIn(X4,alive)&host(X2)=host(X1))&elem(m_Down(X2),queue(host(X4))))))&![X1, X2]:(leq(index(pendack,host(X2)),host(X1))<=((((~(leq(host(X1),host(X2)))&setIn(X1,alive))&index(status,host(X1))=elec_2)&index(status,host(X2))=elec_2)&setIn(X2,alive))))&![X1, X2, X4, X14]:(~((elem(m_Down(X2),queue(host(X1)))&setIn(X1,alive)))<=((((![X15]:((setIn(X15,index(down,host(X14)))|host(X4)=X15)<=(~(leq(host(X14),X15))&leq(s(zero),X15)))&elem(m_Down(X4),queue(host(X14))))&host(X2)=host(X14))&index(status,host(X14))=elec_1)&host(X14)=nbr_proc)))&![X1, X2, X4, X14]:(((((((elem(m_Down(X4),queue(host(X14)))&leq(nbr_proc,s(index(pendack,host(X14)))))&index(status,host(X14))=elec_2)&s(index(pendack,host(X14)))=host(X4))&index(pendack,host(X14))=host(X2))&elem(m_Ack(X14,X2),queue(host(X14))))&setIn(X14,alive))=>~(((index(status,host(X1))=norm&index(ldr,host(X1))=host(X1))&setIn(X1,alive)))))&![X1, X2, X4]:((((setIn(X4,alive)&elem(m_Halt(X4),queue(host(X2))))&elec_2=index(status,host(X4)))&~(leq(index(pendack,host(X4)),host(X1))))=>~(((host(X1)=index(ldr,host(X1))&norm=index(status,host(X1)))&setIn(X1,alive)))))&![X1, X2]:(~(leq(index(pendack,host(X1)),index(pendack,host(X2))))<=((((~(leq(host(X1),host(X2)))&setIn(X2,alive))&elec_2=index(status,host(X2)))&index(status,host(X1))=elec_2)&setIn(X1,alive))))&![X1, X2, X4]:(((((setIn(X4,alive)&host(X4)=host(X2))&index(status,host(X4))=elec_2)&index(status,host(X1))=elec_2)&setIn(X1,alive))=>~(elem(m_Ack(X1,X2),queue(host(X1))))))&![X1, X2]:((setIn(X2,alive)&elem(m_Ack(X2,X1),queue(host(X2))))=>leq(host(X1),index(pendack,host(X2)))))&![X1, X2]:(elem(m_Halt(X2),queue(host(X1)))=>~(leq(host(X1),host(X2)))))&![X1, X2]:(~(leq(host(X1),host(X2)))<=elem(m_Ldr(X2),queue(host(X1)))))&![X1]:(host(X1)=host(X13)=>~(setIn(X1,alive))))=>((((host(X12)=host(X13)&~(setIn(X12,pids)))&![X1]:(leq(X1,X12)<=host(X13)=host(X1)))=>(s(zero)=host(X12)=>(~(leq(nbr_proc,host(X12)))=>![X1]:(![X2, X4, X16]:(s(host(X12))=host(X16)=>(host(X12)!=host(X16)=>((((((((setIn(X16,alive)|X16=X12)&index(pendack,host(X16))=host(X2))&s(index(pendack,host(X16)))=host(X4))&index(status,host(X16))=elec_2)&elem(m_Ack(X16,X2),snoc(queue(host(X16)),m_Halt(X12))))&elem(m_Down(X4),snoc(queue(host(X16)),m_Halt(X12))))&leq(nbr_proc,s(index(pendack,host(X16)))))=>~(((norm=index(status,host(X1))&host(X1)=index(ldr,host(X1)))&(X12=X1|setIn(X1,alive)))))))<=host(X1)!=host(X12)))))<=queue(host(X13))=q_nil))), inference(assume_negation,[status(cth)],[conj])). 151.89/152.10 fof(c_0_9, negated_conjecture, ![X141, X142, X143, X144, X145, X146, X147, X148, X149, X150, X151, X152, X153, X154, X155, X156, X157, X158, X159, X162, X163, X164, X161, X165, X166, X167, X168, X169, X170, X171, X172, X173, X174, X175, X176, X177, X178, X179, X180]:(((((((((((((((((~elem(m_Down(X142),queue(host(X141)))|host(X141)!=host(X142))&(~elem(m_Ack(X145,X143),queue(host(X144)))|~leq(host(X143),host(X145))))&(host(X147)!=host(X146)|X146=X147|(~setIn(X146,alive)|~setIn(X147,alive))))&(~setIn(X149,alive)|index(status,host(X149))!=elec_1|~elem(m_Ack(X149,X148),queue(host(X149)))))&((index(status,host(X150))!=elec_1|~setIn(X150,alive)|index(elid,host(X150))=X150)&(index(status,host(X150))!=elec_2|~setIn(X150,alive)|index(elid,host(X150))=X150)))&(~setIn(X153,alive)|host(X152)!=host(X151)|~elem(m_Down(X152),queue(host(X153)))|(host(X151)!=index(ldr,host(X151))|norm!=index(status,host(X151))|~setIn(X151,alive))))&(leq(host(X154),host(X155))|~setIn(X154,alive)|index(status,host(X154))!=elec_2|index(status,host(X155))!=elec_2|~setIn(X155,alive)|leq(index(pendack,host(X155)),host(X154))))&(((~leq(host(X159),esk7_4(X156,X157,X158,X159))|~elem(m_Down(X158),queue(host(X159)))|host(X157)!=host(X159)|index(status,host(X159))!=elec_1|host(X159)!=nbr_proc|(~elem(m_Down(X157),queue(host(X156)))|~setIn(X156,alive)))&(leq(s(zero),esk7_4(X156,X157,X158,X159))|~elem(m_Down(X158),queue(host(X159)))|host(X157)!=host(X159)|index(status,host(X159))!=elec_1|host(X159)!=nbr_proc|(~elem(m_Down(X157),queue(host(X156)))|~setIn(X156,alive))))&((~setIn(esk7_4(X156,X157,X158,X159),index(down,host(X159)))|~elem(m_Down(X158),queue(host(X159)))|host(X157)!=host(X159)|index(status,host(X159))!=elec_1|host(X159)!=nbr_proc|(~elem(m_Down(X157),queue(host(X156)))|~setIn(X156,alive)))&(host(X158)!=esk7_4(X156,X157,X158,X159)|~elem(m_Down(X158),queue(host(X159)))|host(X157)!=host(X159)|index(status,host(X159))!=elec_1|host(X159)!=nbr_proc|(~elem(m_Down(X157),queue(host(X156)))|~setIn(X156,alive))))))&(~elem(m_Down(X163),queue(host(X164)))|~leq(nbr_proc,s(index(pendack,host(X164))))|index(status,host(X164))!=elec_2|s(index(pendack,host(X164)))!=host(X163)|index(pendack,host(X164))!=host(X162)|~elem(m_Ack(X164,X162),queue(host(X164)))|~setIn(X164,alive)|(index(status,host(X161))!=norm|index(ldr,host(X161))!=host(X161)|~setIn(X161,alive))))&(~setIn(X167,alive)|~elem(m_Halt(X167),queue(host(X166)))|elec_2!=index(status,host(X167))|leq(index(pendack,host(X167)),host(X165))|(host(X165)!=index(ldr,host(X165))|norm!=index(status,host(X165))|~setIn(X165,alive))))&(leq(host(X168),host(X169))|~setIn(X169,alive)|elec_2!=index(status,host(X169))|index(status,host(X168))!=elec_2|~setIn(X168,alive)|~leq(index(pendack,host(X168)),index(pendack,host(X169)))))&(~setIn(X172,alive)|host(X172)!=host(X171)|index(status,host(X172))!=elec_2|index(status,host(X170))!=elec_2|~setIn(X170,alive)|~elem(m_Ack(X170,X171),queue(host(X170)))))&(~setIn(X174,alive)|~elem(m_Ack(X174,X173),queue(host(X174)))|leq(host(X173),index(pendack,host(X174)))))&(~elem(m_Halt(X176),queue(host(X175)))|~leq(host(X175),host(X176))))&(~elem(m_Ldr(X178),queue(host(X177)))|~leq(host(X177),host(X178))))&(host(X179)!=host(esk6_0)|~setIn(X179,alive)))&(queue(host(esk6_0))=q_nil&(((host(esk5_0)=host(esk6_0)&~setIn(esk5_0,pids))&(host(esk6_0)!=host(X180)|leq(X180,esk5_0)))&(s(zero)=host(esk5_0)&(~leq(nbr_proc,host(esk5_0))&(host(esk8_0)!=host(esk5_0)&(s(host(esk5_0))=host(esk11_0)&(host(esk5_0)!=host(esk11_0)&((((((((setIn(esk11_0,alive)|esk11_0=esk5_0)&index(pendack,host(esk11_0))=host(esk9_0))&s(index(pendack,host(esk11_0)))=host(esk10_0))&index(status,host(esk11_0))=elec_2)&elem(m_Ack(esk11_0,esk9_0),snoc(queue(host(esk11_0)),m_Halt(esk5_0))))&elem(m_Down(esk10_0),snoc(queue(host(esk11_0)),m_Halt(esk5_0))))&leq(nbr_proc,s(index(pendack,host(esk11_0)))))&((norm=index(status,host(esk8_0))&host(esk8_0)=index(ldr,host(esk8_0)))&(esk5_0=esk8_0|setIn(esk8_0,alive)))))))))))), 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_8])])])])])])])])). 151.89/152.10 cnf(c_0_10, negated_conjecture, (s(index(pendack,host(esk11_0)))=host(esk10_0)), inference(split_conjunct,[status(thm)],[c_0_9])). 151.89/152.10 cnf(c_0_11, negated_conjecture, (index(pendack,host(esk11_0))=host(esk9_0)), inference(split_conjunct,[status(thm)],[c_0_9])). 151.89/152.10 fof(c_0_12, plain, ![X32, X33, X34, X32, X33, X34]:((~elem(X32,snoc(X34,X33))|(elem(X32,X34)|X33=X32))&((~elem(X32,X34)|elem(X32,snoc(X34,X33)))&(X33!=X32|elem(X32,snoc(X34,X33))))), 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_47])])])])])). 151.89/152.10 fof(c_0_13, plain, ![X63, X64]:m_Down(X63)!=m_Halt(X64), inference(variable_rename,[status(thm)],[axiom_17])). 151.89/152.10 fof(c_0_14, plain, ![X88, X89, X88, X89]:((~leq(X89,X88)|~leq(X88,X89)|X89=X88)&((leq(X89,X88)|X89!=X88)&(leq(X88,X89)|X89!=X88))), 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_61])])])])])). 151.89/152.10 cnf(c_0_15, negated_conjecture, (leq(nbr_proc,s(index(pendack,host(esk11_0))))), inference(split_conjunct,[status(thm)],[c_0_9])). 151.89/152.10 cnf(c_0_16, negated_conjecture, (s(host(esk9_0))=host(esk10_0)), inference(rw,[status(thm)],[c_0_10, c_0_11])). 151.89/152.10 fof(c_0_17, plain, ![X107]:leq(host(X107),nbr_proc), inference(variable_rename,[status(thm)],[axiom_04])). 151.89/152.10 cnf(c_0_18, plain, (elem(X1,X2)|X3=X1|~elem(X1,snoc(X2,X3))), inference(split_conjunct,[status(thm)],[c_0_12])). 151.89/152.10 cnf(c_0_19, negated_conjecture, (elem(m_Down(esk10_0),snoc(queue(host(esk11_0)),m_Halt(esk5_0)))), inference(split_conjunct,[status(thm)],[c_0_9])). 151.89/152.10 cnf(c_0_20, plain, (m_Down(X1)!=m_Halt(X2)), inference(split_conjunct,[status(thm)],[c_0_13])). 151.89/152.10 cnf(c_0_21, plain, (X1=X2|~leq(X1,X2)|~leq(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_14])). 151.89/152.10 cnf(c_0_22, negated_conjecture, (leq(nbr_proc,host(esk10_0))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_11]), c_0_16])). 151.89/152.10 cnf(c_0_23, plain, (leq(host(X1),nbr_proc)), inference(split_conjunct,[status(thm)],[c_0_17])). 151.89/152.10 fof(c_0_24, plain, ![X99]:leq(X99,X99), inference(variable_rename,[status(thm)],[axiom_59])). 151.89/152.10 fof(c_0_25, plain, ![X48, X49, X50]:m_Ack(X48,X49)!=m_Halt(X50), inference(variable_rename,[status(thm)],[axiom_11])). 151.89/152.10 cnf(c_0_26, negated_conjecture, (~elem(m_Down(X1),queue(host(X2)))|~leq(nbr_proc,s(index(pendack,host(X2))))|index(status,host(X2))!=elec_2|s(index(pendack,host(X2)))!=host(X1)|index(pendack,host(X2))!=host(X3)|~elem(m_Ack(X2,X3),queue(host(X2)))|~setIn(X2,alive)|index(status,host(X4))!=norm|index(ldr,host(X4))!=host(X4)|~setIn(X4,alive)), inference(split_conjunct,[status(thm)],[c_0_9])). 151.89/152.10 cnf(c_0_27, negated_conjecture, (elem(m_Down(esk10_0),queue(host(esk11_0)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20])). 151.89/152.10 cnf(c_0_28, negated_conjecture, (host(esk10_0)=nbr_proc), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23])])). 151.89/152.10 cnf(c_0_29, negated_conjecture, (index(status,host(esk11_0))=elec_2), inference(split_conjunct,[status(thm)],[c_0_9])). 151.89/152.10 cnf(c_0_30, plain, (leq(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_24])). 151.89/152.10 cnf(c_0_31, negated_conjecture, (elem(m_Ack(esk11_0,esk9_0),snoc(queue(host(esk11_0)),m_Halt(esk5_0)))), inference(split_conjunct,[status(thm)],[c_0_9])). 151.89/152.10 cnf(c_0_32, plain, (m_Ack(X1,X2)!=m_Halt(X3)), inference(split_conjunct,[status(thm)],[c_0_25])). 151.89/152.10 cnf(c_0_33, negated_conjecture, (index(ldr,host(X1))!=host(X1)|index(status,host(X1))!=norm|host(esk9_0)!=host(X2)|~setIn(esk11_0,alive)|~setIn(X1,alive)|~elem(m_Ack(esk11_0,X2),queue(host(esk11_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_11]), c_0_16]), c_0_28]), c_0_28]), c_0_11]), c_0_29]), c_0_11]), c_0_16]), c_0_28]), c_0_30])])). 151.89/152.10 cnf(c_0_34, negated_conjecture, (elem(m_Ack(esk11_0,esk9_0),queue(host(esk11_0)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_31]), c_0_32])). 151.89/152.10 cnf(c_0_35, negated_conjecture, (index(ldr,host(X1))!=host(X1)|index(status,host(X1))!=norm|~setIn(esk11_0,alive)|~setIn(X1,alive)), inference(spm,[status(thm)],[c_0_33, c_0_34])). 151.89/152.10 cnf(c_0_36, negated_conjecture, (host(esk8_0)=index(ldr,host(esk8_0))), inference(split_conjunct,[status(thm)],[c_0_9])). 151.89/152.10 cnf(c_0_37, negated_conjecture, (norm=index(status,host(esk8_0))), inference(split_conjunct,[status(thm)],[c_0_9])). 151.89/152.10 cnf(c_0_38, negated_conjecture, (~setIn(esk11_0,alive)|~setIn(esk8_0,alive)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_37])])). 151.89/152.10 cnf(c_0_39, negated_conjecture, (setIn(esk11_0,alive)|esk11_0=esk5_0), inference(split_conjunct,[status(thm)],[c_0_9])). 151.89/152.10 cnf(c_0_40, negated_conjecture, (esk11_0=esk5_0|~setIn(esk8_0,alive)), inference(spm,[status(thm)],[c_0_38, c_0_39])). 151.89/152.10 cnf(c_0_41, negated_conjecture, (esk5_0=esk8_0|setIn(esk8_0,alive)), inference(split_conjunct,[status(thm)],[c_0_9])). 151.89/152.10 cnf(c_0_42, negated_conjecture, (host(esk8_0)!=host(esk5_0)), inference(split_conjunct,[status(thm)],[c_0_9])). 151.89/152.10 cnf(c_0_43, negated_conjecture, (esk8_0=esk5_0|esk11_0=esk5_0), inference(spm,[status(thm)],[c_0_40, c_0_41])). 151.89/152.10 cnf(c_0_44, negated_conjecture, (queue(host(esk6_0))=q_nil), inference(split_conjunct,[status(thm)],[c_0_9])). 151.89/152.10 cnf(c_0_45, negated_conjecture, (host(esk5_0)=host(esk6_0)), inference(split_conjunct,[status(thm)],[c_0_9])). 151.89/152.10 fof(c_0_46, plain, ![X119]:~elem(X119,q_nil), inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_45])])). 151.89/152.10 cnf(c_0_47, negated_conjecture, (esk11_0=esk5_0), inference(spm,[status(thm)],[c_0_42, c_0_43])). 151.89/152.10 cnf(c_0_48, negated_conjecture, (queue(host(esk5_0))=q_nil), inference(rw,[status(thm)],[c_0_44, c_0_45])). 151.89/152.10 cnf(c_0_49, plain, (~elem(X1,q_nil)), inference(split_conjunct,[status(thm)],[c_0_46])). 151.89/152.10 cnf(c_0_50, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34, c_0_47]), c_0_47]), c_0_48]), c_0_49]), ['proof']). 151.89/152.10 # SZS output end CNFRefutation 151.89/152.10 # Proof object total steps : 51 151.89/152.10 # Proof object clause steps : 34 151.89/152.10 # Proof object formula steps : 17 151.89/152.10 # Proof object conjectures : 30 151.89/152.10 # Proof object clause conjectures : 27 151.89/152.10 # Proof object formula conjectures : 3 151.89/152.10 # Proof object initial clauses used : 21 151.89/152.10 # Proof object initial formulas used : 8 151.89/152.10 # Proof object generating inferences : 9 151.89/152.10 # Proof object simplifying inferences : 25 151.89/152.10 # Training examples: 0 positive, 0 negative 151.89/152.10 # Parsed axioms : 67 151.89/152.10 # Removed by relevancy pruning/SinE : 0 151.89/152.10 # Initial clauses : 135 151.89/152.10 # Removed in clause preprocessing : 6 151.89/152.10 # Initial clauses in saturation : 129 151.89/152.10 # Processed clauses : 4808 151.89/152.10 # ...of these trivial : 92 151.89/152.10 # ...subsumed : 3154 151.89/152.10 # ...remaining for further processing : 1562 151.89/152.10 # Other redundant clauses eliminated : 7 151.89/152.10 # Clauses deleted for lack of memory : 0 151.89/152.10 # Backward-subsumed : 171 151.89/152.10 # Backward-rewritten : 283 151.89/152.10 # Generated clauses : 90297 151.89/152.10 # ...of the previous two non-trivial : 51150 151.89/152.10 # Contextual simplify-reflections : 802 151.89/152.10 # Paramodulations : 90226 151.89/152.10 # Factorizations : 50 151.89/152.10 # Equation resolutions : 21 151.89/152.10 # Propositional unsat checks : 0 151.89/152.10 # Propositional check models : 0 151.89/152.10 # Propositional check unsatisfiable : 0 151.89/152.10 # Propositional clauses : 0 151.89/152.10 # Propositional clauses after purity: 0 151.89/152.10 # Propositional unsat core size : 0 151.89/152.10 # Current number of processed clauses : 977 151.89/152.10 # Positive orientable unit clauses : 97 151.89/152.10 # Positive unorientable unit clauses: 0 151.89/152.10 # Negative unit clauses : 37 151.89/152.10 # Non-unit-clauses : 843 151.89/152.10 # Current number of unprocessed clauses: 31201 151.89/152.10 # ...number of literals in the above : 110557 151.89/152.10 # Current number of archived formulas : 0 151.89/152.10 # Current number of archived clauses : 578 151.89/152.10 # Clause-clause subsumption calls (NU) : 516155 151.89/152.10 # Rec. Clause-clause subsumption calls : 404773 151.89/152.10 # Non-unit clause-clause subsumptions : 4017 151.89/152.10 # Unit Clause-clause subsumption calls : 1941 151.89/152.10 # Rewrite failures with RHS unbound : 0 151.89/152.10 # BW rewrite match attempts : 569 151.89/152.10 # BW rewrite match successes : 36 151.89/152.10 # Condensation attempts : 0 151.89/152.10 # Condensation successes : 0 151.89/152.10 # Termbank termtop insertions : 1218765 151.89/152.10 151.89/152.10 # ------------------------------------------------- 151.89/152.10 # User time : 150.334 s 151.89/152.10 # System time : 1.537 s 151.89/152.10 # Total time : 151.871 s 151.89/152.10 # Maximum resident set size: 1648 pages 151.89/152.11 EOF