0.07/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.14	% Command    : tptp2X_and_run_prover9 %d %s
0.14/0.35	% Computer   : n006.cluster.edu
0.14/0.35	% Model      : x86_64 x86_64
0.14/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory     : 8042.1875MB
0.14/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 180
0.14/0.35	% DateTime   : Thu Aug 29 12:22:09 EDT 2019
0.14/0.35	% CPUTime    : 
0.77/1.08	============================== Prover9 ===============================
0.77/1.08	Prover9 (32) version 2009-11A, November 2009.
0.77/1.08	Process 8719 was started by sandbox2 on n006.cluster.edu,
0.77/1.08	Thu Aug 29 12:22:10 2019
0.77/1.08	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_8566_n006.cluster.edu".
0.77/1.08	============================== end of head ===========================
0.77/1.08	
0.77/1.08	============================== INPUT =================================
0.77/1.08	
0.77/1.08	% Reading from file /tmp/Prover9_8566_n006.cluster.edu
0.77/1.08	
0.77/1.08	set(prolog_style_variables).
0.77/1.08	set(auto2).
0.77/1.08	    % set(auto2) -> set(auto).
0.77/1.08	    % set(auto) -> set(auto_inference).
0.77/1.08	    % set(auto) -> set(auto_setup).
0.77/1.08	    % set(auto_setup) -> set(predicate_elim).
0.77/1.08	    % set(auto_setup) -> assign(eq_defs, unfold).
0.77/1.08	    % set(auto) -> set(auto_limits).
0.77/1.08	    % set(auto_limits) -> assign(max_weight, "100.000").
0.77/1.08	    % set(auto_limits) -> assign(sos_limit, 20000).
0.77/1.08	    % set(auto) -> set(auto_denials).
0.77/1.08	    % set(auto) -> set(auto_process).
0.77/1.08	    % set(auto2) -> assign(new_constants, 1).
0.77/1.08	    % set(auto2) -> assign(fold_denial_max, 3).
0.77/1.08	    % set(auto2) -> assign(max_weight, "200.000").
0.77/1.08	    % set(auto2) -> assign(max_hours, 1).
0.77/1.08	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.77/1.08	    % set(auto2) -> assign(max_seconds, 0).
0.77/1.08	    % set(auto2) -> assign(max_minutes, 5).
0.77/1.08	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.77/1.08	    % set(auto2) -> set(sort_initial_sos).
0.77/1.08	    % set(auto2) -> assign(sos_limit, -1).
0.77/1.08	    % set(auto2) -> assign(lrs_ticks, 3000).
0.77/1.08	    % set(auto2) -> assign(max_megs, 400).
0.77/1.08	    % set(auto2) -> assign(stats, some).
0.77/1.08	    % set(auto2) -> clear(echo_input).
0.77/1.08	    % set(auto2) -> set(quiet).
0.77/1.08	    % set(auto2) -> clear(print_initial_clauses).
0.77/1.08	    % set(auto2) -> clear(print_given).
0.77/1.08	assign(lrs_ticks,-1).
0.77/1.08	assign(sos_limit,10000).
0.77/1.08	assign(order,kbo).
0.77/1.08	set(lex_order_vars).
0.77/1.08	clear(print_given).
0.77/1.08	
0.77/1.08	% formulas(sos).  % not echoed (67 formulas)
0.77/1.08	
0.77/1.08	============================== end of input ==========================
0.77/1.08	
0.77/1.08	% From the command line: assign(max_seconds, 180).
0.77/1.08	
0.77/1.08	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.77/1.08	
0.77/1.08	% Formulas that are not ordinary clauses:
0.77/1.08	1 (all X all Y (Y != X <-> m_NotNorm(Y) != m_NotNorm(X))) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	2 (all X (pidElem(X) <-> (exists Y (m_Halt(Y) = X | m_Down(Y) = X)))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	3 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	4 (all X all Y (m_Down(Y) != m_Down(X) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	5 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	6 (all X all Y all Q snoc(cons(X,Q),Y) = cons(X,snoc(Q,Y))) # label(axiom_44) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	7 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	8 (all X all Y (Y != X <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	9 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	10 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	11 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	13 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	14 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	15 (all Q all X all Y (ordered(Q) -> ordered(snoc(Q,m_Ack(X,Y))))) # label(axiom_55) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	16 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	17 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	18 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	19 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	20 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	21 (all X all Q ((all Y (host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) & pidElem(X) & elem(Y,Q) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q) <-> ordered(snoc(Q,X)))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	22 (all X X = pidMsg(m_Down(X))) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	23 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	24 (all Q (Q = cons(head(Q),tail(Q)) | q_nil = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	25 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	26 (all X all Y all Q (X = Y | elem(X,Q) <-> elem(X,cons(Y,Q)))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	27 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	28 (all P all Q (s(host(P)) = host(Q) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	29 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	30 (all X all Y all Z (leq(X,Y) & leq(Y,Z) -> leq(X,Z))) # label(axiom_62) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	31 (all X all Q Q = tail(cons(X,Q))) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	32 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	33 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	34 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	35 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	36 (all X1 all X2 all Y1 all Y2 (Y1 != Y2 -> m_Ack(X1,Y1) != m_Ack(X2,Y2))) # label(axiom_32) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	37 (all Q (q_nil = Q | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	38 (all Q all X all Y (host(X) = host(Y) & elem(m_Down(Y),Q) & ordered(cons(m_Halt(X),Q)) -> leq(X,Y))) # label(axiom_57) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	39 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	40 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	41 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	42 (all X all Y all Q (X = Y | elem(X,Q) <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	43 (all X all Q (ordered(cons(X,Q)) <-> (all Y (elem(Y,Q) & pidElem(X) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) -> leq(pidMsg(X),pidMsg(Y)))) & ordered(Q))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	44 (all X1 all X2 all Y1 all Y2 (X1 != X2 -> m_Ack(X2,Y2) != m_Ack(X1,Y1))) # label(axiom_31) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	45 (all Pid all Pid2 (elem(m_Ack(Pid,Pid2),queue(host(Pid))) -> setIn(Pid2,pids) & setIn(Pid,pids))) # label(axiom) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	46 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	47 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	48 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	49 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	50 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	51 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	52 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	53 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	54 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	55 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	56 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	57 (all X all Y (m_Halt(Y) != m_Halt(X) <-> X != Y)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.77/1.09	58 -(all V all W all X ((all Y all Z (elem(m_Ldr(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) & (all Y all Z (elem(m_Down(Z),queue(host(Y))) -> host(Y) != host(Z))) & (all Y all Z (setIn(Z,alive) & elem(m_Ack(Z,Y),queue(host(Z))) -> leq(host(Y),index(pendack,host(Z))))) & (all Y ((index(status,host(Y)) = elec_1 | index(status,host(Y)) = elec_2) & setIn(Y,alive) -> Y = index(elid,host(Y)))) & (all Y all Z (setIn(Z,alive) & elec_2 = index(status,host(Y)) & index(status,host(Z)) = elec_2 & setIn(Y,alive) & -leq(host(Y),host(Z)) -> leq(index(pendack,host(Z)),host(Y)))) & (all Y all Z all Pid0 (setIn(Y,alive) & setIn(Pid0,alive) & host(Pid0) = host(Z) & index(status,host(Pid0)) = elec_2 & index(status,host(Y)) = elec_2 -> -elem(m_Ack(Y,Z),queue(host(Y))))) & (all Y all Z (setIn(Z,alive) & elec_2 = index(status,host(Z)) & index(status,host(Y)) = elec_2 & setIn(Y,alive) & -leq(host(Y),host(Z)) -> -leq(index(pendack,host(Y)),index(pendack,host(Z))))) & (all Y all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid0))) & elem(m_Down(Pid20),queue(host(Pid0))) & leq(nbr_proc,s(index(pendack,host(Pid0)))) & index(pendack,host(Pid0)) = host(Z) & host(Pid20) = s(index(pendack,host(Pid0))) & elec_2 = index(status,host(Pid0)) & setIn(Pid0,alive) -> -(setIn(Y,alive) & index(ldr,host(Y)) = host(Y) & norm = index(status,host(Y))))) & queue(host(X)) = cons(m_NormQ(W),V) & (all Y all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid0) = host(Z) & host(Pid0) = nbr_proc & index(status,host(Pid0)) = elec_1 & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) -> -(setIn(Y,alive) & elem(m_Down(Z),queue(host(Y)))))) & (all Y all Z all Pid0 (-leq(index(pendack,host(Pid0)),host(Y)) & index(status,host(Pid0)) = elec_2 & elem(m_Halt(Pid0),queue(host(Z))) & setIn(Pid0,alive) -> -(host(Y) = index(ldr,host(Y)) & index(status,host(Y)) = norm & setIn(Y,alive)))) & (all Y all Z all Pid0 (setIn(Pid0,alive) & elem(m_Down(Z),queue(host(Pid0))) & host(Y) = host(Z) -> -(setIn(Y,alive) & norm = index(status,host(Y)) & host(Y) = index(ldr,host(Y))))) & (all Y all Z (setIn(Z,alive) & index(status,host(Z)) = elec_1 -> -elem(m_Ack(Z,Y),queue(host(Z))))) & (all Y all Z (host(Z) = host(Y) & Y != Z -> -setIn(Y,alive) | -setIn(Z,alive))) & (all Y all Z all Pid0 (elem(m_Ack(Pid0,Y),queue(host(Z))) -> -leq(host(Y),host(Pid0)))) & (all Y all Z (elem(m_Halt(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) -> (setIn(X,alive) -> (norm != index(status,host(X)) -> (all Y all Z all X0 all Y0 (host(W) = host(Y0) -> (host(Y0) = host(X) -> (setIn(Y0,alive) & elem(m_Down(X0),snoc(V,m_NotNorm(W))) & elem(m_Ack(Y0,Z),snoc(V,m_NotNorm(W))) & index(status,host(Y0)) = elec_2 & host(Z) = index(pendack,host(Y0)) & host(X0) = s(index(pendack,host(Y0))) & leq(nbr_proc,s(index(pendack,host(Y0)))) -> -(norm = index(status,host(Y)) & index(ldr,host(Y)) = host(Y) & setIn(Y,alive)))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.77/1.09	
0.77/1.09	============================== end of process non-clausal formulas ===
0.77/1.09	
0.77/1.09	============================== PROCESS INITIAL CLAUSES ===============
0.77/1.09	
0.77/1.09	============================== PREDICATE ELIMINATION =================
0.82/1.21	
0.82/1.21	============================== end predicate elimination =============
0.82/1.21	
0.82/1.21	Auto_denials:  (non-Horn, no changes).
0.82/1.21	
0.82/1.21	Term ordering decisions:
0.82/1.21	Function symbol KB weights:  alive=1. status=1. pendack=1. elec_2=1. q_nil=1. nbr_proc=1. zero=1. elec_1=1. elid=1. ldr=1. norm=1. pids=1. down=1. nil=1. setEmpty=1. wait=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. index=1. snoc=1. cons=1. m_Ack=1. f2=1. f3=1. host=1. pidMsg=1. s=1. m_Down=1. m_Halt=1. queue=1. m_NotNorm=1. m_Ldr=1. m_NormQ=1. head=1. init=1. last=1. tail=1. f1=1. f4=1.
0.82/1.21	
0.82/1.21	============================== end of process initial clauses ========
0.82/1.21	
0.82/1.21	============================== CLAUSES FOR SEARCH ====================
0.82/1.21	
0.82/1.21	============================== end of clauses for search =============
0.82/1.21	
0.82/1.21	============================== SEARCH ================================
0.82/1.21	
0.82/1.21	% Starting search at 0.04 seconds.
0.82/1.21	
0.82/1.21	============================== PROOF =================================
0.82/1.21	% SZS status Theorem
0.82/1.21	% SZS output start Refutation
0.82/1.21	
0.82/1.21	% Proof 1 at 0.13 (+ 0.01) seconds.
0.82/1.21	% Length of proof is 56.
0.82/1.21	% Level of proof is 10.
0.82/1.21	% Maximum clause weight is 66.000.
0.82/1.21	% Given clauses 272.
0.82/1.21	
0.82/1.21	13 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.82/1.21	25 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.82/1.21	26 (all X all Y all Q (X = Y | elem(X,Q) <-> elem(X,cons(Y,Q)))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.82/1.21	35 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.82/1.21	42 (all X all Y all Q (X = Y | elem(X,Q) <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.82/1.21	49 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.82/1.21	52 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.82/1.21	58 -(all V all W all X ((all Y all Z (elem(m_Ldr(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) & (all Y all Z (elem(m_Down(Z),queue(host(Y))) -> host(Y) != host(Z))) & (all Y all Z (setIn(Z,alive) & elem(m_Ack(Z,Y),queue(host(Z))) -> leq(host(Y),index(pendack,host(Z))))) & (all Y ((index(status,host(Y)) = elec_1 | index(status,host(Y)) = elec_2) & setIn(Y,alive) -> Y = index(elid,host(Y)))) & (all Y all Z (setIn(Z,alive) & elec_2 = index(status,host(Y)) & index(status,host(Z)) = elec_2 & setIn(Y,alive) & -leq(host(Y),host(Z)) -> leq(index(pendack,host(Z)),host(Y)))) & (all Y all Z all Pid0 (setIn(Y,alive) & setIn(Pid0,alive) & host(Pid0) = host(Z) & index(status,host(Pid0)) = elec_2 & index(status,host(Y)) = elec_2 -> -elem(m_Ack(Y,Z),queue(host(Y))))) & (all Y all Z (setIn(Z,alive) & elec_2 = index(status,host(Z)) & index(status,host(Y)) = elec_2 & setIn(Y,alive) & -leq(host(Y),host(Z)) -> -leq(index(pendack,host(Y)),index(pendack,host(Z))))) & (all Y all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid0))) & elem(m_Down(Pid20),queue(host(Pid0))) & leq(nbr_proc,s(index(pendack,host(Pid0)))) & index(pendack,host(Pid0)) = host(Z) & host(Pid20) = s(index(pendack,host(Pid0))) & elec_2 = index(status,host(Pid0)) & setIn(Pid0,alive) -> -(setIn(Y,alive) & index(ldr,host(Y)) = host(Y) & norm = index(status,host(Y))))) & queue(host(X)) = cons(m_NormQ(W),V) & (all Y all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid0) = host(Z) & host(Pid0) = nbr_proc & index(status,host(Pid0)) = elec_1 & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) -> -(setIn(Y,alive) & elem(m_Down(Z),queue(host(Y)))))) & (all Y all Z all Pid0 (-leq(index(pendack,host(Pid0)),host(Y)) & index(status,host(Pid0)) = elec_2 & elem(m_Halt(Pid0),queue(host(Z))) & setIn(Pid0,alive) -> -(host(Y) = index(ldr,host(Y)) & index(status,host(Y)) = norm & setIn(Y,alive)))) & (all Y all Z all Pid0 (setIn(Pid0,alive) & elem(m_Down(Z),queue(host(Pid0))) & host(Y) = host(Z) -> -(setIn(Y,alive) & norm = index(status,host(Y)) & host(Y) = index(ldr,host(Y))))) & (all Y all Z (setIn(Z,alive) & index(status,host(Z)) = elec_1 -> -elem(m_Ack(Z,Y),queue(host(Z))))) & (all Y all Z (host(Z) = host(Y) & Y != Z -> -setIn(Y,alive) | -setIn(Z,alive))) & (all Y all Z all Pid0 (elem(m_Ack(Pid0,Y),queue(host(Z))) -> -leq(host(Y),host(Pid0)))) & (all Y all Z (elem(m_Halt(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) -> (setIn(X,alive) -> (norm != index(status,host(X)) -> (all Y all Z all X0 all Y0 (host(W) = host(Y0) -> (host(Y0) = host(X) -> (setIn(Y0,alive) & elem(m_Down(X0),snoc(V,m_NotNorm(W))) & elem(m_Ack(Y0,Z),snoc(V,m_NotNorm(W))) & index(status,host(Y0)) = elec_2 & host(Z) = index(pendack,host(Y0)) & host(X0) = s(index(pendack,host(Y0))) & leq(nbr_proc,s(index(pendack,host(Y0)))) -> -(norm = index(status,host(Y)) & index(ldr,host(Y)) = host(Y) & setIn(Y,alive)))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.82/1.21	78 -leq(A,B) | -leq(B,A) | A = B # label(axiom_61) # label(axiom).  [clausify(13)].
0.82/1.21	100 m_Ack(A,B) != m_NotNorm(C) # label(axiom_13) # label(axiom).  [clausify(25)].
0.82/1.21	102 -elem(A,B) | elem(A,cons(C,B)) # label(axiom_46) # label(axiom).  [clausify(26)].
0.82/1.21	116 m_Down(A) != m_NotNorm(B) # label(axiom_19) # label(axiom).  [clausify(35)].
0.82/1.21	127 A = B | elem(B,C) | -elem(B,snoc(C,A)) # label(axiom_47) # label(axiom).  [clausify(42)].
0.82/1.21	142 leq(A,A) # label(axiom_59) # label(axiom).  [clausify(49)].
0.82/1.21	150 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom).  [clausify(52)].
0.82/1.21	162 index(status,host(A)) != elec_2 | -setIn(A,alive) | index(elid,host(A)) = A # label(conj) # label(negated_conjecture).  [clausify(58)].
0.82/1.21	166 -elem(m_Ack(A,B),queue(host(A))) | -elem(m_Down(C),queue(host(A))) | -leq(nbr_proc,s(index(pendack,host(A)))) | index(pendack,host(A)) != host(B) | s(index(pendack,host(A))) != host(C) | index(status,host(A)) != elec_2 | -setIn(A,alive) | -setIn(D,alive) | index(ldr,host(D)) != host(D) | index(status,host(D)) != norm # label(conj) # label(negated_conjecture).  [clausify(58)].
0.82/1.21	167 queue(host(c3)) = cons(m_NormQ(c2),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.82/1.21	168 cons(m_NormQ(c2),c1) = queue(host(c3)).  [copy(167),flip(a)].
0.82/1.21	180 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.82/1.21	182 host(c7) = host(c2) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.82/1.21	183 host(c7) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.82/1.21	184 host(c3) = host(c2).  [copy(183),rewrite([182(2)]),flip(a)].
0.82/1.21	185 setIn(c7,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.82/1.21	186 elem(m_Down(c6),snoc(c1,m_NotNorm(c2))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.82/1.21	187 elem(m_Ack(c7,c5),snoc(c1,m_NotNorm(c2))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.82/1.21	188 index(status,host(c7)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
0.82/1.21	189 elec_2 = index(status,host(c2)).  [copy(188),rewrite([182(3)]),flip(a)].
0.82/1.21	190 index(pendack,host(c7)) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.82/1.21	191 index(pendack,host(c2)) = host(c5).  [copy(190),rewrite([182(3)])].
0.82/1.21	192 s(index(pendack,host(c7))) = host(c6) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.82/1.21	193 s(host(c5)) = host(c6).  [copy(192),rewrite([182(3),191(4)])].
0.82/1.21	194 leq(nbr_proc,s(index(pendack,host(c7)))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.82/1.21	195 leq(nbr_proc,host(c6)).  [copy(194),rewrite([182(4),191(5),193(4)])].
0.82/1.21	196 index(status,host(c4)) = norm # label(conj) # label(negated_conjecture).  [clausify(58)].
0.82/1.21	197 norm = index(status,host(c4)).  [copy(196),flip(a)].
0.82/1.21	198 index(ldr,host(c4)) = host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.82/1.21	199 setIn(c4,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.82/1.21	208 cons(m_NormQ(c2),c1) = queue(host(c2)).  [back_rewrite(168),rewrite([184(6)])].
0.82/1.21	210 -elem(m_Ack(A,B),queue(host(A))) | -elem(m_Down(C),queue(host(A))) | -leq(nbr_proc,s(index(pendack,host(A)))) | index(pendack,host(A)) != host(B) | s(index(pendack,host(A))) != host(C) | index(status,host(c2)) != index(status,host(A)) | -setIn(A,alive) | -setIn(D,alive) | index(ldr,host(D)) != host(D) | index(status,host(c4)) != index(status,host(D)).  [back_rewrite(166),rewrite([189(29),197(46)]),flip(f),flip(j)].
0.82/1.21	214 index(status,host(c2)) != index(status,host(A)) | -setIn(A,alive) | index(elid,host(A)) = A.  [back_rewrite(162),rewrite([189(4)]),flip(a)].
0.82/1.21	318 elem(m_Down(c6),c1).  [resolve(186,a,127,c),unit_del(a(flip),116)].
0.82/1.21	324 elem(m_Ack(c7,c5),c1).  [resolve(187,a,127,c),flip(a),unit_del(a,100)].
0.82/1.21	338 host(c6) = nbr_proc.  [resolve(195,a,78,b),unit_del(a,150)].
0.82/1.21	348 s(host(c5)) = nbr_proc.  [back_rewrite(193),rewrite([338(5)])].
0.82/1.21	365 -elem(m_Ack(c3,A),queue(host(c2))) | -elem(m_Down(B),queue(host(c2))) | host(c5) != host(A) | host(B) != nbr_proc | -setIn(C,alive) | index(ldr,host(C)) != host(C) | index(status,host(c4)) != index(status,host(C)).  [resolve(210,g,180,a),rewrite([184(4),184(9),184(15),191(16),348(15),184(17),191(18),184(21),191(22),348(21),184(28)]),flip(e),xx(f),unit_del(c,142)].
0.82/1.21	374 index(elid,host(c2)) = c7.  [resolve(214,b,185,a),rewrite([182(7),182(12)]),xx(a)].
0.82/1.21	375 c7 = c3.  [resolve(214,b,180,a),rewrite([184(7),184(12),374(13)]),xx(a)].
0.82/1.21	380 elem(m_Ack(c3,c5),c1).  [back_rewrite(324),rewrite([375(1)])].
0.82/1.21	393 elem(m_Down(c6),cons(A,c1)).  [resolve(318,a,102,a)].
0.82/1.21	447 elem(m_Ack(c3,c5),cons(A,c1)).  [resolve(380,a,102,a)].
0.82/1.21	546 elem(m_Down(c6),queue(host(c2))).  [para(208(a,1),393(a,2))].
0.82/1.21	589 -elem(m_Ack(c3,A),queue(host(c2))) | -elem(m_Down(B),queue(host(c2))) | host(c5) != host(A) | host(B) != nbr_proc.  [resolve(365,e,199,a),rewrite([198(22)]),xx(e),xx(f)].
0.82/1.21	647 -elem(m_Ack(c3,A),queue(host(c2))) | host(c5) != host(A).  [resolve(546,a,589,b),rewrite([338(12)]),xx(c)].
0.82/1.21	789 elem(m_Ack(c3,c5),queue(host(c2))).  [para(208(a,1),447(a,2))].
0.82/1.21	859 $F.  [resolve(789,a,647,a),xx(a)].
0.82/1.21	
0.82/1.21	% SZS output end Refutation
0.82/1.21	============================== end of proof ==========================
0.82/1.21	
0.82/1.21	============================== STATISTICS ============================
0.82/1.21	
0.82/1.21	Given=272. Generated=2313. Kept=787. proofs=1.
0.82/1.21	Usable=260. Sos=457. Demods=26. Limbo=0, Disabled=200. Hints=0.
0.82/1.21	Megabytes=1.76.
0.82/1.21	User_CPU=0.13, System_CPU=0.01, Wall_clock=0.
0.82/1.21	
0.82/1.21	============================== end of statistics =====================
0.82/1.21	
0.82/1.21	============================== end of search =========================
0.82/1.21	
0.82/1.21	THEOREM PROVED
0.82/1.21	% SZS status Theorem
0.82/1.21	
0.82/1.21	Exiting with 1 proof.
0.82/1.21	
0.82/1.21	Process 8719 exit (max_proofs) Thu Aug 29 12:22:10 2019
0.82/1.21	Prover9 interrupted
0.82/1.21	EOF