0.12/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/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 : n024.cluster.edu 0.14/0.34 Model : x86_64 x86_64 0.14/0.34 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.34 RAMPerCPU : 8042.1875MB 0.14/0.34 OS : Linux 3.10.0-693.el7.x86_64 0.14/0.34 % CPULimit : 960 0.14/0.34 % WCLimit : 120 0.14/0.34 % DateTime : Tue Aug 9 05:50:52 EDT 2022 0.14/0.35 % CPUTime : 0.14/0.39 # No SInE strategy applied 0.14/0.39 # Auto-Mode selected heuristic G_E___107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y 0.14/0.39 # and selection function SelectMaxLComplexAvoidPosPred. 0.14/0.39 # 0.14/0.39 # Presaturation interreduction done 0.14/0.39 # Number of axioms: 122 Number of unprocessed: 117 0.14/0.39 # Tableaux proof search. 0.14/0.39 # APR header successfully linked. 0.14/0.39 # Hello from C++ 0.14/0.39 # The folding up rule is enabled... 0.14/0.39 # Local unification is enabled... 0.14/0.39 # Any saturation attempts will use folding labels... 0.14/0.39 # 117 beginning clauses after preprocessing and clausification 0.14/0.39 # Creating start rules for all 30 conjectures. 0.14/0.39 # There are 30 start rule candidates: 0.14/0.39 # Found 58 unit axioms. 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.14/0.39 # 30 start rule tableaux created. 0.14/0.39 # 59 extension rule candidate clauses 0.14/0.39 # 58 unit axiom clauses 0.14/0.39 0.14/0.39 # Requested 8, 32 cores available to the main process. 1.55/0.58 # There were 6 total branch saturation attempts. 1.55/0.58 # There were 0 of these attempts blocked. 1.55/0.58 # There were 0 deferred branch saturation attempts. 1.55/0.58 # There were 0 free duplicated saturations. 1.55/0.58 # There were 6 total successful branch saturations. 1.55/0.58 # There were 5 successful branch saturations in interreduction. 1.55/0.58 # There were 0 successful branch saturations on the branch. 1.55/0.58 # There were 1 successful branch saturations after the branch. 1.55/0.58 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 1.55/0.58 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 1.55/0.58 # Begin clausification derivation 1.55/0.58 1.55/0.58 # End clausification derivation 1.55/0.58 # Begin listing active clauses obtained from FOF to CNF conversion 1.55/0.58 cnf(i_0_113, negated_conjecture, (setIn(esk7_0,alive))). 1.55/0.58 cnf(i_0_98, negated_conjecture, (setIn(esk11_0,alive))). 1.55/0.58 cnf(i_0_101, negated_conjecture, (host(esk14_0)=nbr_proc)). 1.55/0.58 cnf(i_0_20, plain, (ordered(q_nil))). 1.55/0.58 cnf(i_0_104, negated_conjecture, (host(esk7_0)=nbr_proc)). 1.55/0.58 cnf(i_0_102, negated_conjecture, (host(esk12_0)=nbr_proc)). 1.55/0.58 cnf(i_0_13, plain, (leq(s(zero),nbr_proc))). 1.55/0.58 cnf(i_0_99, negated_conjecture, (elem(m_Down(esk13_0),esk5_0))). 1.55/0.58 cnf(i_0_45, plain, (leq(X1,X1))). 1.55/0.58 cnf(i_0_3, plain, (pidMsg(m_Halt(X1))=X1)). 1.55/0.58 cnf(i_0_100, negated_conjecture, (index(status,nbr_proc)=elec_1)). 1.55/0.58 cnf(i_0_7, plain, (leq(host(X1),nbr_proc))). 1.55/0.58 cnf(i_0_21, plain, (leq(s(zero),host(X1)))). 1.55/0.58 cnf(i_0_97, negated_conjecture, (elem(m_Down(esk12_0),queue(host(esk11_0))))). 1.55/0.58 cnf(i_0_47, plain, (pidMsg(m_Down(X1))=X1)). 1.55/0.58 cnf(i_0_125, negated_conjecture, (cons(m_Down(esk8_0),esk5_0)=queue(nbr_proc))). 1.55/0.58 cnf(i_0_108, negated_conjecture, (leq(s(zero),esk10_0))). 1.55/0.58 cnf(i_0_84, plain, (ordered(snoc(q_nil,X1)))). 1.55/0.58 cnf(i_0_77, plain, (head(cons(X1,X2))=X1)). 1.55/0.58 cnf(i_0_29, plain, (tail(cons(X1,X2))=X2)). 1.55/0.58 cnf(i_0_42, plain, (cons(X1,q_nil)=snoc(q_nil,X1))). 1.55/0.58 cnf(i_0_79, plain, (last(snoc(X1,X2))=X2)). 1.55/0.58 cnf(i_0_93, plain, (init(snoc(X1,X2))=X1)). 1.55/0.58 cnf(i_0_12, plain, (cons(X1,snoc(X2,X3))=snoc(cons(X1,X2),X3))). 1.55/0.58 cnf(i_0_10, plain, (elem(X1,cons(X1,X2)))). 1.55/0.58 cnf(i_0_34, plain, (elem(X1,snoc(X2,X1)))). 1.55/0.58 cnf(i_0_2, plain, (elec_2!=elec_1)). 1.55/0.58 cnf(i_0_82, plain, (wait!=elec_1)). 1.55/0.58 cnf(i_0_14, plain, (elec_2!=wait)). 1.55/0.58 cnf(i_0_26, plain, (norm!=elec_1)). 1.55/0.58 cnf(i_0_31, plain, (elec_2!=norm)). 1.55/0.58 cnf(i_0_55, plain, (wait!=norm)). 1.55/0.58 cnf(i_0_105, negated_conjecture, (host(esk11_0)!=nbr_proc)). 1.55/0.58 cnf(i_0_6, plain, (~setIn(nil,alive))). 1.55/0.58 cnf(i_0_94, plain, (m_NotNorm(X1)!=m_Down(X2))). 1.55/0.58 cnf(i_0_87, plain, (m_Ldr(X1)!=m_NotNorm(X2))). 1.55/0.58 cnf(i_0_50, plain, (m_Ldr(X1)!=m_Down(X2))). 1.55/0.58 cnf(i_0_46, plain, (~setIn(X1,setEmpty))). 1.55/0.58 cnf(i_0_4, plain, (~leq(s(X1),X1))). 1.55/0.58 cnf(i_0_74, plain, (cons(X1,X2)!=q_nil)). 1.55/0.58 cnf(i_0_63, plain, (~elem(X1,q_nil))). 1.55/0.58 cnf(i_0_112, negated_conjecture, (~leq(nbr_proc,host(esk8_0)))). 1.55/0.58 cnf(i_0_91, plain, (m_Down(X1)!=m_Halt(X2))). 1.55/0.58 cnf(i_0_39, plain, (m_NotNorm(X1)!=m_Halt(X2))). 1.55/0.58 cnf(i_0_27, plain, (m_NormQ(X1)!=m_NotNorm(X2))). 1.55/0.58 cnf(i_0_54, plain, (m_NormQ(X1)!=m_Down(X2))). 1.55/0.58 cnf(i_0_75, plain, (m_Ldr(X1)!=m_Halt(X2))). 1.55/0.58 cnf(i_0_86, plain, (m_Ldr(X1)!=m_NormQ(X2))). 1.55/0.58 cnf(i_0_71, plain, (m_NormQ(X1)!=m_Halt(X2))). 1.55/0.58 cnf(i_0_107, negated_conjecture, (host(esk8_0)!=esk10_0)). 1.55/0.58 cnf(i_0_8, plain, (snoc(X1,X2)!=q_nil)). 1.55/0.58 cnf(i_0_44, plain, (m_Down(X1)!=m_Ack(X2,X3))). 1.55/0.58 cnf(i_0_28, plain, (m_NotNorm(X1)!=m_Ack(X2,X3))). 1.55/0.58 cnf(i_0_43, plain, (m_Ack(X1,X2)!=m_Ldr(X3))). 1.55/0.58 cnf(i_0_109, negated_conjecture, (~leq(nbr_proc,esk10_0))). 1.55/0.58 cnf(i_0_48, plain, (m_Ack(X1,X2)!=m_Halt(X3))). 1.55/0.58 cnf(i_0_49, plain, (m_Ack(X1,X2)!=m_NormQ(X3))). 1.55/0.58 cnf(i_0_106, negated_conjecture, (~setIn(esk10_0,index(down,nbr_proc)))). 1.55/0.58 cnf(i_0_24, plain, (pidElem(X1)|m_Halt(X2)!=X1)). 1.55/0.58 cnf(i_0_17, plain, (leq(X1,s(X2))|~leq(X1,X2))). 1.55/0.58 cnf(i_0_1, plain, (leq(X1,X2)|leq(X2,X1))). 1.55/0.58 cnf(i_0_18, plain, (leq(X1,s(X2))|s(X2)!=X1)). 1.55/0.58 cnf(i_0_23, plain, (pidElem(X1)|m_Down(X2)!=X1)). 1.55/0.58 cnf(i_0_90, plain, (X1=X2|m_Down(X1)!=m_Down(X2))). 1.55/0.58 cnf(i_0_80, plain, (X1=X2|m_NotNorm(X1)!=m_NotNorm(X2))). 1.55/0.58 cnf(i_0_95, plain, (X1=X2|m_Ldr(X1)!=m_Ldr(X2))). 1.55/0.58 cnf(i_0_38, plain, (leq(s(X1),s(X2))|~leq(X1,X2))). 1.55/0.58 cnf(i_0_41, plain, (X1=X2|m_Halt(X1)!=m_Halt(X2))). 1.55/0.58 cnf(i_0_37, plain, (leq(X1,X2)|~leq(s(X1),s(X2)))). 1.55/0.58 cnf(i_0_11, plain, (elem(X1,cons(X2,X3))|~elem(X1,X3))). 1.55/0.58 cnf(i_0_73, plain, (X1=X2|m_NormQ(X1)!=m_NormQ(X2))). 1.55/0.58 cnf(i_0_53, plain, (X1=X2|~leq(X2,X1)|~leq(X1,X2))). 1.55/0.58 cnf(i_0_19, plain, (s(X1)=X2|leq(X2,X1)|~leq(X2,s(X1)))). 1.55/0.58 cnf(i_0_32, plain, (host(X1)!=s(host(X2))|host(X1)!=host(X2))). 1.55/0.58 cnf(i_0_115, negated_conjecture, (host(X1)!=nbr_proc|~elem(m_NotNorm(X2),queue(host(X1))))). 1.55/0.58 cnf(i_0_25, plain, (leq(X1,X2)|~leq(X1,X3)|~leq(X3,X2))). 1.55/0.58 cnf(i_0_117, negated_conjecture, (index(elid,host(X1))=X1|index(status,host(X1))!=elec_2|~setIn(X1,alive))). 1.55/0.58 cnf(i_0_116, negated_conjecture, (index(elid,host(X1))=X1|index(status,host(X1))!=elec_1|~setIn(X1,alive))). 1.55/0.58 cnf(i_0_78, plain, (snoc(init(X1),last(X1))=X1|X1=q_nil)). 1.55/0.58 cnf(i_0_61, plain, (ordered(X1)|~ordered(cons(X2,X1)))). 1.55/0.58 cnf(i_0_128, negated_conjecture, (host(X1)!=host(X2)|~elem(m_Down(X1),queue(host(X2))))). 1.55/0.58 cnf(i_0_9, plain, (X1=X2|elem(X1,X3)|~elem(X1,cons(X2,X3)))). 1.55/0.58 cnf(i_0_35, plain, (elem(X1,snoc(X2,X3))|~elem(X1,X2))). 1.55/0.58 cnf(i_0_16, plain, (setIn(X1,pids)|~elem(m_Ack(X2,X1),queue(host(X2))))). 1.55/0.58 cnf(i_0_69, plain, (ordered(X1)|~ordered(snoc(X1,X2)))). 1.55/0.58 cnf(i_0_76, plain, (cons(head(X1),tail(X1))=X1|X1=q_nil)). 1.55/0.58 cnf(i_0_114, negated_conjecture, (~elem(m_Ldr(X1),queue(host(X2)))|~leq(host(X2),host(X1)))). 1.55/0.58 cnf(i_0_5, plain, (X1=X2|m_Ack(X3,X1)!=m_Ack(X4,X2))). 1.55/0.58 cnf(i_0_85, plain, (X1=X2|m_Ack(X1,X3)!=m_Ack(X2,X4))). 1.55/0.58 cnf(i_0_92, plain, (ordered(snoc(X1,m_Ldr(X2)))|~ordered(X1))). 1.55/0.58 cnf(i_0_15, plain, (setIn(X1,pids)|~elem(m_Ack(X1,X2),queue(host(X1))))). 1.55/0.58 cnf(i_0_127, negated_conjecture, (X1=X2|host(X1)!=host(X2)|~setIn(X2,alive)|~setIn(X1,alive))). 1.55/0.58 cnf(i_0_33, plain, (X1=X2|elem(X1,X3)|~elem(X1,snoc(X3,X2)))). 1.55/0.58 cnf(i_0_65, plain, (pidElem(X1)|ordered(snoc(X2,X1))|~ordered(X2))). 1.55/0.58 cnf(i_0_22, plain, (m_Down(esk2_1(X1))=X1|m_Halt(esk1_1(X1))=X1|~pidElem(X1))). 1.55/0.58 cnf(i_0_60, plain, (pidElem(X1)|ordered(cons(X1,X2))|~ordered(X2))). 1.55/0.58 cnf(i_0_88, plain, (ordered(snoc(X1,m_Ack(X2,X3)))|~ordered(X1))). 1.55/0.58 cnf(i_0_57, plain, (ordered(cons(X1,X2))|elem(esk3_2(X1,X2),X2)|~ordered(X2))). 1.55/0.58 cnf(i_0_103, negated_conjecture, (host(esk13_0)=X1|host(esk8_0)=X1|setIn(X1,index(down,nbr_proc))|leq(nbr_proc,X1)|~leq(s(zero),X1))). 1.55/0.58 cnf(i_0_59, plain, (pidElem(esk3_2(X1,X2))|ordered(cons(X1,X2))|~ordered(X2))). 1.55/0.58 cnf(i_0_68, plain, (ordered(snoc(X1,X2))|elem(esk4_2(X2,X1),X1)|~ordered(X1))). 1.55/0.58 cnf(i_0_67, plain, (pidElem(esk4_2(X1,X2))|ordered(snoc(X2,X1))|~ordered(X2))). 1.55/0.58 cnf(i_0_66, plain, (host(pidMsg(esk4_2(X1,X2)))=host(pidMsg(X1))|ordered(snoc(X2,X1))|~ordered(X2))). 1.55/0.58 cnf(i_0_58, plain, (host(pidMsg(esk3_2(X1,X2)))=host(pidMsg(X1))|ordered(cons(X1,X2))|~ordered(X2))). 1.55/0.58 cnf(i_0_56, plain, (ordered(cons(X1,X2))|~ordered(X2)|~leq(pidMsg(X1),pidMsg(esk3_2(X1,X2))))). 1.55/0.58 cnf(i_0_36, plain, (leq(X1,X2)|host(X1)!=host(X2)|~ordered(cons(m_Halt(X1),X3))|~elem(m_Down(X2),X3))). 1.55/0.58 cnf(i_0_64, plain, (ordered(snoc(X1,X2))|~ordered(X1)|~leq(pidMsg(esk4_2(X2,X1)),pidMsg(X2)))). 1.55/0.58 cnf(i_0_126, negated_conjecture, (host(X1)=host(X2)|host(X1)!=index(ldr,host(X2))|index(status,host(X2))!=norm|host(X2)!=host(X3)|~elem(m_Down(X3),queue(host(X1)))|~setIn(X2,alive))). 1.55/0.58 cnf(i_0_118, negated_conjecture, (host(X1)=host(X2)|host(index(elid,host(X1)))!=host(X2)|index(status,host(X1))!=wait|host(X1)!=host(X3)|~elem(m_Down(X3),queue(host(X2)))|~setIn(X1,alive))). 1.55/0.58 cnf(i_0_123, negated_conjecture, (leq(s(zero),esk9_4(X1,X2,X3,X4))|index(status,host(X4))!=elec_1|host(X2)!=host(X4)|host(X4)!=nbr_proc|~elem(m_Down(X3),queue(host(X4)))|~elem(m_Down(X2),queue(host(X1)))|~setIn(X1,alive))). 1.55/0.58 cnf(i_0_70, plain, (leq(pidMsg(X1),pidMsg(X2))|host(pidMsg(X1))!=host(pidMsg(X2))|~pidElem(X2)|~pidElem(X1)|~ordered(snoc(X3,X2))|~elem(X1,X3))). 1.55/0.58 cnf(i_0_62, plain, (leq(pidMsg(X1),pidMsg(X2))|host(pidMsg(X1))!=host(pidMsg(X2))|~pidElem(X2)|~pidElem(X1)|~ordered(cons(X1,X3))|~elem(X2,X3))). 1.55/0.58 cnf(i_0_124, negated_conjecture, (index(status,host(X1))!=elec_1|host(X1)!=host(X2)|host(X1)!=nbr_proc|~elem(m_Down(X3),queue(host(X1)))|~elem(m_Down(X2),queue(host(X4)))|~setIn(X4,alive)|~leq(host(X1),esk9_4(X4,X2,X3,X1)))). 1.55/0.58 cnf(i_0_122, negated_conjecture, (index(status,host(X1))!=elec_1|host(X2)!=host(X1)|host(X1)!=nbr_proc|~elem(m_Down(X3),queue(host(X1)))|~elem(m_Down(X2),queue(host(X4)))|~setIn(esk9_4(X4,X2,X3,X1),index(down,host(X1)))|~setIn(X4,alive))). 1.55/0.58 cnf(i_0_121, negated_conjecture, (esk9_4(X1,X2,X3,X4)!=host(X3)|index(status,host(X4))!=elec_1|host(X2)!=host(X4)|host(X4)!=nbr_proc|~elem(m_Down(X3),queue(host(X4)))|~elem(m_Down(X2),queue(host(X1)))|~setIn(X1,alive))). 1.55/0.58 cnf(i_0_119, negated_conjecture, (host(X1)=host(X2)|host(X2)!=host(X3)|host(X1)!=host(X4)|~elem(m_Down(X3),queue(host(X1)))|~elem(m_Down(X4),queue(host(X2)))|~setIn(X2,alive)|~setIn(X1,alive))). 1.55/0.58 cnf(i_0_120, negated_conjecture, (host(X1)=host(X2)|host(X3)!=host(X2)|host(X1)!=host(X4)|~elem(m_Down(X3),queue(host(X1)))|~setIn(host(X4),index(down,host(X2)))|~setIn(X2,alive)|~setIn(X1,alive))). 1.55/0.58 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 1.55/0.58 # Begin printing tableau 1.55/0.58 # Found 14 steps 1.55/0.58 cnf(i_0_113, negated_conjecture, (setIn(esk7_0,alive)), inference(start_rule)). 1.55/0.58 cnf(i_0_222, plain, (setIn(esk7_0,alive)), inference(extension_rule, [i_0_120])). 1.55/0.58 cnf(i_0_40277, plain, (~elem(m_Down(esk12_0),queue(host(esk11_0)))), inference(closure_rule, [i_0_97])). 1.55/0.58 cnf(i_0_40280, plain, (~setIn(esk11_0,alive)), inference(closure_rule, [i_0_98])). 1.55/0.58 cnf(i_0_40274, plain, (host(esk11_0)=host(esk7_0)), inference(extension_rule, [i_0_32])). 1.55/0.58 cnf(i_0_40275, plain, (host(esk12_0)!=host(esk7_0)), inference(etableau_closure_rule, [i_0_40275, ...])). 1.55/0.58 cnf(i_0_40296, plain, (s(host(esk7_0))!=host(esk11_0)), inference(etableau_closure_rule, [i_0_40296, ...])). 1.55/0.58 cnf(i_0_40276, plain, ($false), inference(extension_rule, [i_0_126])). 1.55/0.58 cnf(i_0_40428, plain, (~elem(m_Down(esk12_0),queue(host(esk11_0)))), inference(closure_rule, [i_0_97])). 1.55/0.58 cnf(i_0_40429, plain, (~setIn(esk11_0,alive)), inference(closure_rule, [i_0_98])). 1.55/0.58 cnf(i_0_40278, plain, (~setIn(host(esk11_0),index(down,host(esk7_0)))), inference(etableau_closure_rule, [i_0_40278, ...])). 1.55/0.58 cnf(i_0_40425, plain, (index(ldr,host(esk11_0))!=host(esk11_0)), inference(etableau_closure_rule, [i_0_40425, ...])). 1.55/0.58 cnf(i_0_40426, plain, (index(status,host(esk11_0))!=norm), inference(etableau_closure_rule, [i_0_40426, ...])). 1.55/0.58 cnf(i_0_40427, plain, (host(esk11_0)!=host(esk12_0)), inference(etableau_closure_rule, [i_0_40427, ...])). 1.55/0.58 # End printing tableau 1.55/0.58 # SZS output end 1.55/0.58 # Branches closed with saturation will be marked with an "s" 1.69/0.58 # Child (19783) has found a proof. 1.69/0.58 1.69/0.58 # Proof search is over... 1.69/0.58 # Freeing feature tree 1.69/0.58 EOF