TSTP Solution File: SWV476+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV476+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Wed Jul 20 18:21:19 EDT 2022
% Result : Theorem 0.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV476+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.34 % Computer : n014.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 14 16:06:36 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.38 # No SInE strategy applied
% 0.14/0.38 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 0.14/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.38 #
% 0.14/0.38 # Presaturation interreduction done
% 0.14/0.38 # Number of axioms: 133 Number of unprocessed: 125
% 0.14/0.38 # Tableaux proof search.
% 0.14/0.38 # APR header successfully linked.
% 0.14/0.38 # Hello from C++
% 0.14/0.38 # The folding up rule is enabled...
% 0.14/0.38 # Local unification is enabled...
% 0.14/0.38 # Any saturation attempts will use folding labels...
% 0.14/0.38 # 125 beginning clauses after preprocessing and clausification
% 0.14/0.38 # Creating start rules for all 18 conjectures.
% 0.14/0.38 # There are 18 start rule candidates:
% 0.14/0.38 # Found 61 unit axioms.
% 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.38 # 18 start rule tableaux created.
% 0.14/0.38 # 64 extension rule candidate clauses
% 0.14/0.38 # 61 unit axiom clauses
% 0.14/0.38
% 0.14/0.38 # Requested 8, 32 cores available to the main process.
% 0.20/0.55 # There were 1 total branch saturation attempts.
% 0.20/0.55 # There were 0 of these attempts blocked.
% 0.20/0.55 # There were 0 deferred branch saturation attempts.
% 0.20/0.55 # There were 0 free duplicated saturations.
% 0.20/0.55 # There were 1 total successful branch saturations.
% 0.20/0.55 # There were 0 successful branch saturations in interreduction.
% 0.20/0.55 # There were 0 successful branch saturations on the branch.
% 0.20/0.55 # There were 1 successful branch saturations after the branch.
% 0.20/0.55 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.55 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.55 # Begin clausification derivation
% 0.20/0.55
% 0.20/0.55 # End clausification derivation
% 0.20/0.55 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.55 cnf(i_0_97, negated_conjecture, (host(esk10_0)=host(esk7_0))).
% 0.20/0.55 cnf(i_0_114, negated_conjecture, (setIn(esk7_0,alive))).
% 0.20/0.55 cnf(i_0_98, negated_conjecture, (setIn(esk10_0,alive))).
% 0.20/0.55 cnf(i_0_104, negated_conjecture, (setIn(esk13_0,alive))).
% 0.20/0.55 cnf(i_0_100, negated_conjecture, (s(host(esk13_0))=host(esk11_0))).
% 0.20/0.55 cnf(i_0_112, negated_conjecture, (index(status,host(esk7_0))=elec_2)).
% 0.20/0.55 cnf(i_0_99, negated_conjecture, (index(status,host(esk13_0))=elec_1)).
% 0.20/0.55 cnf(i_0_64, plain, (ordered(q_nil))).
% 0.20/0.55 cnf(i_0_113, negated_conjecture, (index(elid,host(esk7_0))=esk6_0)).
% 0.20/0.55 cnf(i_0_5, plain, (leq(s(zero),nbr_proc))).
% 0.20/0.55 cnf(i_0_111, negated_conjecture, (index(pendack,host(esk7_0))=host(esk8_0))).
% 0.20/0.55 cnf(i_0_103, negated_conjecture, (leq(nbr_proc,host(esk11_0)))).
% 0.20/0.55 cnf(i_0_115, negated_conjecture, (epred1_4(esk5_0,esk6_0,esk7_0,esk8_0))).
% 0.20/0.55 cnf(i_0_102, negated_conjecture, (elem(m_Down(esk11_0),queue(host(esk13_0))))).
% 0.20/0.55 cnf(i_0_62, plain, (pidMsg(m_Halt(X1))=X1)).
% 0.20/0.55 cnf(i_0_85, plain, (leq(X1,X1))).
% 0.20/0.55 cnf(i_0_6, plain, (leq(host(X1),nbr_proc))).
% 0.20/0.55 cnf(i_0_101, negated_conjecture, (elem(m_Down(esk12_0),queue(host(esk13_0))))).
% 0.20/0.55 cnf(i_0_110, negated_conjecture, (leq(nbr_proc,host(esk8_0)))).
% 0.20/0.55 cnf(i_0_4, plain, (leq(s(zero),host(X1)))).
% 0.20/0.55 cnf(i_0_63, plain, (pidMsg(m_Down(X1))=X1)).
% 0.20/0.55 cnf(i_0_66, plain, (ordered(cons(X1,q_nil)))).
% 0.20/0.55 cnf(i_0_50, plain, (snoc(q_nil,X1)=cons(X1,q_nil))).
% 0.20/0.55 cnf(i_0_42, plain, (head(cons(X1,X2))=X1)).
% 0.20/0.55 cnf(i_0_43, plain, (tail(cons(X1,X2))=X2)).
% 0.20/0.55 cnf(i_0_44, plain, (last(snoc(X1,X2))=X2)).
% 0.20/0.55 cnf(i_0_45, plain, (init(snoc(X1,X2))=X1)).
% 0.20/0.55 cnf(i_0_51, plain, (snoc(cons(X1,X2),X3)=cons(X1,snoc(X2,X3)))).
% 0.20/0.55 cnf(i_0_59, plain, (pidElem(m_Down(X1)))).
% 0.20/0.55 cnf(i_0_60, plain, (pidElem(m_Halt(X1)))).
% 0.20/0.55 cnf(i_0_54, plain, (elem(X1,cons(X1,X2)))).
% 0.20/0.55 cnf(i_0_57, plain, (elem(X1,snoc(X2,X1)))).
% 0.20/0.55 cnf(i_0_7, plain, (elec_2!=elec_1)).
% 0.20/0.55 cnf(i_0_106, negated_conjecture, (host(esk13_0)!=host(esk7_0))).
% 0.20/0.55 cnf(i_0_107, negated_conjecture, (host(esk9_0)!=host(esk13_0))).
% 0.20/0.55 cnf(i_0_8, plain, (wait!=elec_1)).
% 0.20/0.55 cnf(i_0_10, plain, (wait!=elec_2)).
% 0.20/0.55 cnf(i_0_9, plain, (elec_1!=norm)).
% 0.20/0.55 cnf(i_0_11, plain, (elec_2!=norm)).
% 0.20/0.55 cnf(i_0_12, plain, (wait!=norm)).
% 0.20/0.55 cnf(i_0_41, plain, (~setIn(nil,alive))).
% 0.20/0.55 cnf(i_0_52, plain, (~elem(X1,q_nil))).
% 0.20/0.55 cnf(i_0_96, plain, (~setIn(X1,setEmpty))).
% 0.20/0.55 cnf(i_0_48, plain, (cons(X1,X2)!=q_nil)).
% 0.20/0.55 cnf(i_0_49, plain, (snoc(X1,X2)!=q_nil)).
% 0.20/0.55 cnf(i_0_84, plain, (~leq(s(X1),X1))).
% 0.20/0.55 cnf(i_0_19, plain, (m_Down(X1)!=m_Halt(X2))).
% 0.20/0.55 cnf(i_0_21, plain, (m_NotNorm(X1)!=m_Down(X2))).
% 0.20/0.55 cnf(i_0_18, plain, (m_NotNorm(X1)!=m_Halt(X2))).
% 0.20/0.55 cnf(i_0_20, plain, (m_Ldr(X1)!=m_Down(X2))).
% 0.20/0.55 cnf(i_0_24, plain, (m_Ldr(X1)!=m_Halt(X2))).
% 0.20/0.55 cnf(i_0_26, plain, (m_Ldr(X1)!=m_NotNorm(X2))).
% 0.20/0.55 cnf(i_0_22, plain, (m_NormQ(X1)!=m_Down(X2))).
% 0.20/0.55 cnf(i_0_25, plain, (m_NormQ(X1)!=m_Ldr(X2))).
% 0.20/0.55 cnf(i_0_23, plain, (m_NormQ(X1)!=m_Halt(X2))).
% 0.20/0.55 cnf(i_0_27, plain, (m_NormQ(X1)!=m_NotNorm(X2))).
% 0.20/0.55 cnf(i_0_13, plain, (m_Ack(X1,X2)!=m_Halt(X3))).
% 0.20/0.55 cnf(i_0_14, plain, (m_Ack(X1,X2)!=m_Down(X3))).
% 0.20/0.55 cnf(i_0_15, plain, (m_Ack(X1,X2)!=m_NotNorm(X3))).
% 0.20/0.55 cnf(i_0_16, plain, (m_Ack(X1,X2)!=m_Ldr(X3))).
% 0.20/0.55 cnf(i_0_17, plain, (m_Ack(X1,X2)!=m_NormQ(X3))).
% 0.20/0.55 cnf(i_0_109, negated_conjecture, (host(esk9_0)=host(esk8_0)|setIn(host(esk9_0),index(acks,host(esk7_0))))).
% 0.20/0.55 cnf(i_0_3, plain, (s(host(X1))!=host(X2)|host(X1)!=host(X2))).
% 0.20/0.55 cnf(i_0_37, plain, (X1=X2|m_Down(X1)!=m_Down(X2))).
% 0.20/0.55 cnf(i_0_91, plain, (leq(X1,X2)|~leq(s(X1),s(X2)))).
% 0.20/0.55 cnf(i_0_93, plain, (leq(X1,s(X2))|~leq(X1,X2))).
% 0.20/0.55 cnf(i_0_92, plain, (leq(s(X1),s(X2))|~leq(X1,X2))).
% 0.20/0.55 cnf(i_0_73, plain, (ordered(X1)|~ordered(cons(X2,X1)))).
% 0.20/0.55 cnf(i_0_80, plain, (ordered(X1)|~ordered(snoc(X1,X2)))).
% 0.20/0.55 cnf(i_0_29, plain, (X1=X2|m_Halt(X1)!=m_Halt(X2))).
% 0.20/0.55 cnf(i_0_105, negated_conjecture, (X1=host(esk12_0)|leq(host(esk13_0),X1)|setIn(X1,index(down,host(esk13_0)))|~leq(s(zero),X1))).
% 0.20/0.55 cnf(i_0_33, plain, (X1=X2|m_NotNorm(X1)!=m_NotNorm(X2))).
% 0.20/0.55 cnf(i_0_35, plain, (X1=X2|m_Ldr(X1)!=m_Ldr(X2))).
% 0.20/0.55 cnf(i_0_31, plain, (X1=X2|m_NormQ(X1)!=m_NormQ(X2))).
% 0.20/0.55 cnf(i_0_89, plain, (X1=X2|~leq(X2,X1)|~leq(X1,X2))).
% 0.20/0.55 cnf(i_0_39, plain, (X1=X2|m_Ack(X3,X1)!=m_Ack(X4,X2))).
% 0.20/0.55 cnf(i_0_38, plain, (X1=X2|m_Ack(X1,X3)!=m_Ack(X2,X4))).
% 0.20/0.55 cnf(i_0_86, plain, (leq(X1,X2)|leq(X2,X1))).
% 0.20/0.55 cnf(i_0_95, plain, (X1=s(X2)|leq(X1,X2)|~leq(X1,s(X2)))).
% 0.20/0.55 cnf(i_0_1, plain, (setIn(X1,pids)|~elem(m_Ack(X2,X1),queue(host(X2))))).
% 0.20/0.55 cnf(i_0_2, plain, (setIn(X1,pids)|~elem(m_Ack(X1,X2),queue(host(X1))))).
% 0.20/0.55 cnf(i_0_46, plain, (cons(head(X1),tail(X1))=X1|X1=q_nil)).
% 0.20/0.55 cnf(i_0_82, plain, (ordered(snoc(X1,m_Ldr(X2)))|~ordered(X1))).
% 0.20/0.55 cnf(i_0_70, plain, (ordered(cons(X1,X2))|pidElem(X1)|~ordered(X2))).
% 0.20/0.55 cnf(i_0_53, plain, (elem(X1,cons(X2,X3))|~elem(X1,X3))).
% 0.20/0.55 cnf(i_0_90, plain, (leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3))).
% 0.20/0.55 cnf(i_0_56, plain, (elem(X1,snoc(X2,X3))|~elem(X1,X2))).
% 0.20/0.55 cnf(i_0_138, plain, (host(X1)!=host(X2)|~epred1_4(X3,X4,X5,X6)|~elem(m_Down(X1),queue(host(X2))))).
% 0.20/0.55 cnf(i_0_136, plain, (index(elid,host(X1))=X1|index(status,host(X1))!=elec_1|~epred1_4(X2,X3,X4,X5)|~setIn(X1,alive))).
% 0.20/0.55 cnf(i_0_47, plain, (snoc(init(X1),last(X1))=X1|X1=q_nil)).
% 0.20/0.55 cnf(i_0_61, plain, (m_Down(esk2_1(X1))=X1|m_Halt(esk1_1(X1))=X1|~pidElem(X1))).
% 0.20/0.55 cnf(i_0_77, plain, (ordered(snoc(X1,X2))|pidElem(X2)|~ordered(X1))).
% 0.20/0.55 cnf(i_0_58, plain, (X1=X2|elem(X1,X3)|~elem(X1,snoc(X3,X2)))).
% 0.20/0.55 cnf(i_0_55, plain, (X1=X2|elem(X1,X3)|~elem(X1,cons(X2,X3)))).
% 0.20/0.55 cnf(i_0_81, plain, (ordered(snoc(X1,m_Ack(X2,X3)))|~ordered(X1))).
% 0.20/0.55 cnf(i_0_135, plain, (index(elid,host(X1))=X1|index(status,host(X1))!=elec_2|~epred1_4(X2,X3,X4,X5)|~setIn(X1,alive))).
% 0.20/0.55 cnf(i_0_139, plain, (~epred1_4(X1,X2,X3,X4)|~leq(host(X5),host(X6))|~elem(m_Ldr(X6),queue(host(X5))))).
% 0.20/0.55 cnf(i_0_137, plain, (X1=X2|host(X1)!=host(X2)|~epred1_4(X3,X4,X5,X6)|~setIn(X2,alive)|~setIn(X1,alive))).
% 0.20/0.55 cnf(i_0_69, plain, (ordered(cons(X1,X2))|pidElem(esk3_2(X1,X2))|~ordered(X2))).
% 0.20/0.55 cnf(i_0_76, plain, (ordered(snoc(X1,X2))|pidElem(esk4_2(X2,X1))|~ordered(X1))).
% 0.20/0.55 cnf(i_0_71, plain, (ordered(cons(X1,X2))|elem(esk3_2(X1,X2),X2)|~ordered(X2))).
% 0.20/0.55 cnf(i_0_67, plain, (ordered(cons(X1,X2))|~ordered(X2)|~leq(pidMsg(X1),pidMsg(esk3_2(X1,X2))))).
% 0.20/0.55 cnf(i_0_74, plain, (ordered(snoc(X1,X2))|~ordered(X1)|~leq(pidMsg(esk4_2(X2,X1)),pidMsg(X2)))).
% 0.20/0.55 cnf(i_0_78, plain, (ordered(snoc(X1,X2))|elem(esk4_2(X2,X1),X1)|~ordered(X1))).
% 0.20/0.55 cnf(i_0_83, plain, (leq(X1,X2)|host(X1)!=host(X2)|~ordered(cons(m_Halt(X1),X3))|~elem(m_Down(X2),X3))).
% 0.20/0.55 cnf(i_0_68, plain, (host(pidMsg(esk3_2(X1,X2)))=host(pidMsg(X1))|ordered(cons(X1,X2))|~ordered(X2))).
% 0.20/0.55 cnf(i_0_133, plain, (index(ldr,host(X1))!=host(X1)|index(status,host(X1))!=norm|~epred1_4(X2,X3,X4,X5)|~setIn(host(X1),index(down,host(X6)))|~setIn(X6,alive)|~setIn(X1,alive))).
% 0.20/0.55 cnf(i_0_134, plain, (leq(index(pendack,host(X1)),host(X2))|index(status,host(X1))!=elec_2|~epred1_4(X3,X4,X5,X6)|~setIn(host(X1),index(down,host(X2)))|~setIn(X1,alive)|~setIn(X2,alive))).
% 0.20/0.55 cnf(i_0_116, plain, (queue(host(X1))=cons(m_Ack(X2,X3),X4)|~epred1_4(X4,X2,X1,X3))).
% 0.20/0.55 cnf(i_0_75, plain, (host(pidMsg(esk4_2(X1,X2)))=host(pidMsg(X1))|ordered(snoc(X2,X1))|~ordered(X2))).
% 0.20/0.55 cnf(i_0_72, plain, (leq(pidMsg(X1),pidMsg(X2))|host(pidMsg(X2))!=host(pidMsg(X1))|~ordered(cons(X1,X3))|~pidElem(X1)|~pidElem(X2)|~elem(X2,X3))).
% 0.20/0.55 cnf(i_0_79, plain, (leq(pidMsg(X1),pidMsg(X2))|host(pidMsg(X1))!=host(pidMsg(X2))|~ordered(snoc(X3,X2))|~pidElem(X2)|~pidElem(X1)|~elem(X1,X3))).
% 0.20/0.55 cnf(i_0_131, plain, (index(ldr,host(X1))!=host(X1)|index(status,host(X1))!=norm|host(X1)!=host(X2)|~epred1_4(X3,X4,X5,X6)|~setIn(X7,alive)|~setIn(X1,alive)|~elem(m_Down(X2),queue(host(X7))))).
% 0.20/0.55 cnf(i_0_130, plain, (X1=X2|index(ldr,host(X2))!=host(X2)|index(ldr,host(X1))!=host(X1)|index(status,host(X2))!=norm|index(status,host(X1))!=norm|~epred1_4(X3,X4,X5,X6)|~setIn(X2,alive)|~setIn(X1,alive))).
% 0.20/0.55 cnf(i_0_132, plain, (leq(index(pendack,host(X1)),host(X2))|index(status,host(X1))!=elec_2|host(X1)!=host(X3)|~epred1_4(X4,X5,X6,X7)|~setIn(X1,alive)|~setIn(X2,alive)|~elem(m_Down(X3),queue(host(X2))))).
% 0.20/0.55 cnf(i_0_128, plain, (host(X1)=host(X2)|host(X2)!=host(X3)|host(X1)!=host(X4)|~epred1_4(X5,X6,X7,X8)|~setIn(X2,alive)|~setIn(X1,alive)|~elem(m_Down(X4),queue(host(X2)))|~elem(m_Down(X3),queue(host(X1))))).
% 0.20/0.55 cnf(i_0_127, plain, (host(X1)=host(X2)|host(X2)!=host(X3)|host(X1)!=host(X4)|~epred1_4(X5,X6,X7,X8)|~setIn(host(X3),index(down,host(X1)))|~setIn(X2,alive)|~setIn(X1,alive)|~elem(m_Down(X4),queue(host(X2))))).
% 0.20/0.55 cnf(i_0_117, plain, (esk15_8(X1,X2,X3,X4,X5,X6,X7,X8)!=host(X7)|index(ldr,host(X5))!=host(X5)|index(status,host(X8))!=elec_1|index(status,host(X5))!=norm|host(X6)!=s(host(X8))|~epred1_4(X4,X3,X2,X1)|~leq(nbr_proc,s(host(X8)))|~setIn(X8,alive)|~setIn(X5,alive)|~elem(m_Down(X7),queue(host(X8)))|~elem(m_Down(X6),queue(host(X8))))).
% 0.20/0.55 cnf(i_0_121, plain, (esk14_8(X1,X2,X3,X4,X5,X6,X7,X8)!=host(X7)|index(status,host(X8))!=elec_1|index(status,host(X5))!=elec_2|host(X6)!=host(X8)|~epred1_4(X4,X3,X2,X1)|~leq(host(X5),host(X8))|~setIn(X5,alive)|~elem(m_Ack(X5,X6),queue(host(X5)))|~elem(m_Down(X7),queue(host(X8))))).
% 0.20/0.55 cnf(i_0_123, plain, (leq(s(zero),esk14_8(X1,X2,X3,X4,X5,X6,X7,X8))|index(status,host(X8))!=elec_1|index(status,host(X5))!=elec_2|host(X6)!=host(X8)|~epred1_4(X4,X3,X2,X1)|~leq(host(X5),host(X8))|~setIn(X5,alive)|~elem(m_Ack(X5,X6),queue(host(X5)))|~elem(m_Down(X7),queue(host(X8))))).
% 0.20/0.55 cnf(i_0_124, plain, (index(status,host(X1))!=elec_2|index(status,host(X2))!=elec_1|host(X2)!=host(X3)|~epred1_4(X4,X5,X6,X7)|~leq(host(X2),esk14_8(X7,X6,X5,X4,X1,X3,X8,X2))|~leq(host(X1),host(X2))|~setIn(X1,alive)|~elem(m_Ack(X1,X3),queue(host(X1)))|~elem(m_Down(X8),queue(host(X2))))).
% 0.20/0.55 cnf(i_0_122, plain, (index(status,host(X1))!=elec_1|index(status,host(X2))!=elec_2|host(X3)!=host(X1)|~epred1_4(X4,X5,X6,X7)|~leq(host(X2),host(X1))|~setIn(esk14_8(X7,X6,X5,X4,X2,X3,X8,X1),index(down,host(X1)))|~setIn(X2,alive)|~elem(m_Ack(X2,X3),queue(host(X2)))|~elem(m_Down(X8),queue(host(X1))))).
% 0.20/0.55 cnf(i_0_120, plain, (index(ldr,host(X1))!=host(X1)|index(status,host(X1))!=norm|index(status,host(X2))!=elec_1|host(X3)!=s(host(X2))|~epred1_4(X4,X5,X6,X7)|~leq(host(X2),esk15_8(X7,X6,X5,X4,X1,X3,X8,X2))|~leq(nbr_proc,s(host(X2)))|~setIn(X1,alive)|~setIn(X2,alive)|~elem(m_Down(X8),queue(host(X2)))|~elem(m_Down(X3),queue(host(X2))))).
% 0.20/0.55 cnf(i_0_118, plain, (index(ldr,host(X1))!=host(X1)|index(status,host(X2))!=elec_1|index(status,host(X1))!=norm|host(X3)!=s(host(X2))|~epred1_4(X4,X5,X6,X7)|~leq(nbr_proc,s(host(X2)))|~setIn(esk15_8(X7,X6,X5,X4,X1,X3,X8,X2),index(down,host(X2)))|~setIn(X2,alive)|~setIn(X1,alive)|~elem(m_Down(X8),queue(host(X2)))|~elem(m_Down(X3),queue(host(X2))))).
% 0.20/0.55 cnf(i_0_119, plain, (leq(s(zero),esk15_8(X1,X2,X3,X4,X5,X6,X7,X8))|index(ldr,host(X5))!=host(X5)|index(status,host(X8))!=elec_1|index(status,host(X5))!=norm|host(X6)!=s(host(X8))|~epred1_4(X4,X3,X2,X1)|~leq(nbr_proc,s(host(X8)))|~setIn(X8,alive)|~setIn(X5,alive)|~elem(m_Down(X7),queue(host(X8)))|~elem(m_Down(X6),queue(host(X8))))).
% 0.20/0.55 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.55 # Begin printing tableau
% 0.20/0.55 # Found 4 steps
% 0.20/0.55 cnf(i_0_102, negated_conjecture, (elem(m_Down(esk11_0),queue(host(esk13_0)))), inference(start_rule)).
% 0.20/0.55 cnf(i_0_157, plain, (elem(m_Down(esk11_0),queue(host(esk13_0)))), inference(extension_rule, [i_0_53])).
% 0.20/0.55 cnf(i_0_214, plain, (elem(m_Down(esk11_0),cons(X8,queue(host(esk13_0))))), inference(extension_rule, [i_0_56])).
% 0.20/0.55 cnf(i_0_264, plain, (elem(m_Down(esk11_0),snoc(cons(X8,queue(host(esk13_0))),X7))), inference(etableau_closure_rule, [i_0_264, ...])).
% 0.20/0.55 # End printing tableau
% 0.20/0.55 # SZS output end
% 0.20/0.55 # Branches closed with saturation will be marked with an "s"
% 0.20/0.55 # Child (30203) has found a proof.
% 0.20/0.55
% 0.20/0.55 # Proof search is over...
% 0.20/0.55 # Freeing feature tree
%------------------------------------------------------------------------------