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