0.00/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : tptp2X_and_run_prover9 %d %s
0.02/0.24	% Computer   : n181.star.cs.uiowa.edu
0.02/0.24	% Model      : x86_64 x86_64
0.02/0.24	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.24	% Memory     : 32218.625MB
0.02/0.24	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.24	% CPULimit   : 300
0.02/0.24	% DateTime   : Sat Jul 14 05:24:54 CDT 2018
0.02/0.24	% CPUTime    : 
0.07/0.50	============================== Prover9 ===============================
0.07/0.50	Prover9 (32) version 2009-11A, November 2009.
0.07/0.50	Process 25527 was started by sandbox2 on n181.star.cs.uiowa.edu,
0.07/0.50	Sat Jul 14 05:24:55 2018
0.07/0.50	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_25495_n181.star.cs.uiowa.edu".
0.07/0.50	============================== end of head ===========================
0.07/0.50	
0.07/0.50	============================== INPUT =================================
0.07/0.50	
0.07/0.50	% Reading from file /tmp/Prover9_25495_n181.star.cs.uiowa.edu
0.07/0.50	
0.07/0.50	set(prolog_style_variables).
0.07/0.50	set(auto2).
0.07/0.50	    % set(auto2) -> set(auto).
0.07/0.50	    % set(auto) -> set(auto_inference).
0.07/0.50	    % set(auto) -> set(auto_setup).
0.07/0.50	    % set(auto_setup) -> set(predicate_elim).
0.07/0.50	    % set(auto_setup) -> assign(eq_defs, unfold).
0.07/0.50	    % set(auto) -> set(auto_limits).
0.07/0.50	    % set(auto_limits) -> assign(max_weight, "100.000").
0.07/0.50	    % set(auto_limits) -> assign(sos_limit, 20000).
0.07/0.50	    % set(auto) -> set(auto_denials).
0.07/0.50	    % set(auto) -> set(auto_process).
0.07/0.50	    % set(auto2) -> assign(new_constants, 1).
0.07/0.50	    % set(auto2) -> assign(fold_denial_max, 3).
0.07/0.50	    % set(auto2) -> assign(max_weight, "200.000").
0.07/0.50	    % set(auto2) -> assign(max_hours, 1).
0.07/0.50	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.07/0.50	    % set(auto2) -> assign(max_seconds, 0).
0.07/0.50	    % set(auto2) -> assign(max_minutes, 5).
0.07/0.50	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.07/0.50	    % set(auto2) -> set(sort_initial_sos).
0.07/0.50	    % set(auto2) -> assign(sos_limit, -1).
0.07/0.50	    % set(auto2) -> assign(lrs_ticks, 3000).
0.07/0.50	    % set(auto2) -> assign(max_megs, 400).
0.07/0.50	    % set(auto2) -> assign(stats, some).
0.07/0.50	    % set(auto2) -> clear(echo_input).
0.07/0.50	    % set(auto2) -> set(quiet).
0.07/0.50	    % set(auto2) -> clear(print_initial_clauses).
0.07/0.50	    % set(auto2) -> clear(print_given).
0.07/0.50	assign(lrs_ticks,-1).
0.07/0.50	assign(sos_limit,10000).
0.07/0.50	assign(order,kbo).
0.07/0.50	set(lex_order_vars).
0.07/0.50	clear(print_given).
0.07/0.50	
0.07/0.50	% formulas(sos).  % not echoed (67 formulas)
0.07/0.50	
0.07/0.50	============================== end of input ==========================
0.07/0.50	
0.07/0.50	% From the command line: assign(max_seconds, 300).
0.07/0.50	
0.07/0.50	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.07/0.50	
0.07/0.50	% Formulas that are not ordinary clauses:
0.07/0.50	1 (all X all Y (s(Y) = X | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	2 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	3 (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.07/0.50	4 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	5 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	6 (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.07/0.50	7 (all X all Y all Q (elem(X,snoc(Q,Y)) <-> elem(X,Q) | Y = X)) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	8 (all X ((exists Y (m_Down(Y) = X | X = m_Halt(Y))) <-> pidElem(X))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	9 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	10 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	11 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	12 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	13 (all Pid all Pid2 (elem(m_Ack(Pid,Pid2),queue(host(Pid))) -> setIn(Pid,pids) & setIn(Pid2,pids))) # label(axiom) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	14 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	15 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	16 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	17 (all X all Q (ordered(snoc(Q,X)) <-> (all Y (elem(Y,Q) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) & pidElem(X) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	18 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	19 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	20 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	21 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	22 (all X1 all X2 all Y1 all Y2 (X1 != X2 -> m_Ack(X1,Y1) != m_Ack(X2,Y2))) # label(axiom_31) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	23 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	24 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	25 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	26 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	27 (all X1 all X2 all Y1 all Y2 (Y1 != Y2 -> m_Ack(X2,Y2) != m_Ack(X1,Y1))) # label(axiom_32) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	28 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	29 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	30 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	31 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	32 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	33 (all Q (q_nil = Q | Q = cons(head(Q),tail(Q)))) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	34 (all Q (snoc(init(Q),last(Q)) = Q | q_nil = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	35 (all X all Y all Z (leq(Y,Z) & leq(X,Y) -> leq(X,Z))) # label(axiom_62) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	36 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	37 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	38 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	39 (all X all Q (ordered(cons(X,Q)) <-> (all Y (elem(Y,Q) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(X) -> leq(pidMsg(X),pidMsg(Y)))) & ordered(Q))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	40 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	41 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	42 (all P all Q (host(Q) = s(host(P)) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	43 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	44 (all X all Y (X != Y <-> m_Down(X) != m_Down(Y))) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	45 (all X all Y all Q (elem(X,cons(Y,Q)) <-> elem(X,Q) | X = Y)) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	46 (all X all Y (m_Halt(X) != m_Halt(Y) <-> X != Y)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	47 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	48 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	49 (all X X = pidMsg(m_Down(X))) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	51 (all X all Y (m_NotNorm(Y) != m_NotNorm(X) <-> Y != X)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	52 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	53 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	54 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	55 (all X all Y all Q cons(X,snoc(Q,Y)) = snoc(cons(X,Q),Y)) # label(axiom_44) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	56 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	57 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	58 -(all V all W all X ((all Y all Z (elem(m_Down(Z),queue(host(Y))) -> host(Y) != host(Z))) & (all Y all Z (Z != Y & host(Z) = host(Y) -> -setIn(Z,alive) | -setIn(Y,alive))) & (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 (-leq(host(Y),host(Z)) & index(status,host(Z)) = elec_2 & elec_2 = index(status,host(Y)) & setIn(Z,alive) & setIn(Y,alive) -> leq(index(pendack,host(Z)),host(Y)))) & (all Y all Z all Pid0 (setIn(Y,alive) & host(Pid0) = host(Z) & index(status,host(Pid0)) = elec_2 & index(status,host(Y)) = elec_2 & setIn(Pid0,alive) -> -elem(m_Ack(Y,Z),queue(host(Y))))) & (all Y all Z (setIn(Y,alive) & elec_2 = index(status,host(Z)) & elec_2 = index(status,host(Y)) & setIn(Z,alive) & -leq(host(Y),host(Z)) -> -leq(index(pendack,host(Y)),index(pendack,host(Z))))) & (all Y all Z all Pid20 all Pid0 (host(Pid0) = host(Z) & host(Pid0) = nbr_proc & elec_1 = index(status,host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | V0 = host(Pid20))) -> -(setIn(Y,alive) & elem(m_Down(Z),queue(host(Y)))))) & (all Y all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Ack(Pid0,Z),queue(host(Pid0))) & leq(nbr_proc,s(index(pendack,host(Pid0)))) & index(status,host(Pid0)) = elec_2 & host(Pid20) = s(index(pendack,host(Pid0))) & index(pendack,host(Pid0)) = host(Z) & elem(m_Down(Pid20),queue(host(Pid0))) -> -(setIn(Y,alive) & index(status,host(Y)) = norm & host(Y) = index(ldr,host(Y))))) & queue(host(X)) = cons(m_NormQ(W),V) & (all Y all Z all Pid0 (setIn(Pid0,alive) & elem(m_Halt(Pid0),queue(host(Z))) & index(status,host(Pid0)) = elec_2 & -leq(index(pendack,host(Pid0)),host(Y)) -> -(norm = index(status,host(Y)) & index(ldr,host(Y)) = host(Y) & setIn(Y,alive)))) & (all Y all Z all Pid0 (elem(m_Down(Z),queue(host(Pid0))) & host(Y) = host(Z) & setIn(Pid0,alive) -> -(index(status,host(Y)) = norm & index(ldr,host(Y)) = host(Y) & setIn(Y,alive)))) & (all Y all Z (setIn(Z,alive) & elec_1 = index(status,host(Z)) -> -elem(m_Ack(Z,Y),queue(host(Z))))) & (all Y all Z (elem(m_Ack(Z,Y),queue(host(Z))) & setIn(Z,alive) -> leq(host(Y),index(pendack,host(Z))))) & (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)))) & (all Y all Z (elem(m_Ldr(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) -> (setIn(X,alive) -> (index(status,host(X)) != norm -> (all Y all Z all X0 all Y0 (host(W) = host(Y0) -> (host(X) = host(Y0) -> (elem(m_Down(X0),snoc(V,m_NotNorm(W))) & index(pendack,host(Y0)) = host(Z) & s(index(pendack,host(Y0))) = host(X0) & index(status,host(Y0)) = elec_2 & leq(nbr_proc,s(index(pendack,host(Y0)))) & elem(m_Ack(Y0,Z),snoc(V,m_NotNorm(W))) & setIn(Y0,alive) -> -(setIn(Y,alive) & index(ldr,host(Y)) = host(Y) & norm = index(status,host(Y))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.07/0.50	
0.07/0.50	============================== end of process non-clausal formulas ===
0.07/0.50	
0.07/0.50	============================== PROCESS INITIAL CLAUSES ===============
0.07/0.50	
0.07/0.50	============================== PREDICATE ELIMINATION =================
0.07/0.56	
0.07/0.56	============================== end predicate elimination =============
0.07/0.56	
0.07/0.56	Auto_denials:  (non-Horn, no changes).
0.07/0.56	
0.07/0.56	Term ordering decisions:
0.07/0.56	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.07/0.56	
0.07/0.56	============================== end of process initial clauses ========
0.07/0.56	
0.07/0.56	============================== CLAUSES FOR SEARCH ====================
0.07/0.56	
0.07/0.56	============================== end of clauses for search =============
0.07/0.56	
0.07/0.56	============================== SEARCH ================================
0.07/0.56	
0.07/0.56	% Starting search at 0.02 seconds.
0.07/0.56	
0.07/0.56	============================== PROOF =================================
0.07/0.56	% SZS status Theorem
0.07/0.56	% SZS output start Refutation
0.07/0.56	
0.07/0.56	% Proof 1 at 0.07 (+ 0.00) seconds.
0.07/0.56	% Length of proof is 56.
0.07/0.56	% Level of proof is 10.
0.07/0.56	% Maximum clause weight is 66.000.
0.07/0.56	% Given clauses 271.
0.07/0.56	
0.07/0.56	7 (all X all Y all Q (elem(X,snoc(Q,Y)) <-> elem(X,Q) | Y = X)) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.07/0.56	9 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.07/0.56	19 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.07/0.56	32 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.07/0.56	38 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.07/0.56	41 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.07/0.56	45 (all X all Y all Q (elem(X,cons(Y,Q)) <-> elem(X,Q) | X = Y)) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.07/0.56	58 -(all V all W all X ((all Y all Z (elem(m_Down(Z),queue(host(Y))) -> host(Y) != host(Z))) & (all Y all Z (Z != Y & host(Z) = host(Y) -> -setIn(Z,alive) | -setIn(Y,alive))) & (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 (-leq(host(Y),host(Z)) & index(status,host(Z)) = elec_2 & elec_2 = index(status,host(Y)) & setIn(Z,alive) & setIn(Y,alive) -> leq(index(pendack,host(Z)),host(Y)))) & (all Y all Z all Pid0 (setIn(Y,alive) & host(Pid0) = host(Z) & index(status,host(Pid0)) = elec_2 & index(status,host(Y)) = elec_2 & setIn(Pid0,alive) -> -elem(m_Ack(Y,Z),queue(host(Y))))) & (all Y all Z (setIn(Y,alive) & elec_2 = index(status,host(Z)) & elec_2 = index(status,host(Y)) & setIn(Z,alive) & -leq(host(Y),host(Z)) -> -leq(index(pendack,host(Y)),index(pendack,host(Z))))) & (all Y all Z all Pid20 all Pid0 (host(Pid0) = host(Z) & host(Pid0) = nbr_proc & elec_1 = index(status,host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | V0 = host(Pid20))) -> -(setIn(Y,alive) & elem(m_Down(Z),queue(host(Y)))))) & (all Y all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Ack(Pid0,Z),queue(host(Pid0))) & leq(nbr_proc,s(index(pendack,host(Pid0)))) & index(status,host(Pid0)) = elec_2 & host(Pid20) = s(index(pendack,host(Pid0))) & index(pendack,host(Pid0)) = host(Z) & elem(m_Down(Pid20),queue(host(Pid0))) -> -(setIn(Y,alive) & index(status,host(Y)) = norm & host(Y) = index(ldr,host(Y))))) & queue(host(X)) = cons(m_NormQ(W),V) & (all Y all Z all Pid0 (setIn(Pid0,alive) & elem(m_Halt(Pid0),queue(host(Z))) & index(status,host(Pid0)) = elec_2 & -leq(index(pendack,host(Pid0)),host(Y)) -> -(norm = index(status,host(Y)) & index(ldr,host(Y)) = host(Y) & setIn(Y,alive)))) & (all Y all Z all Pid0 (elem(m_Down(Z),queue(host(Pid0))) & host(Y) = host(Z) & setIn(Pid0,alive) -> -(index(status,host(Y)) = norm & index(ldr,host(Y)) = host(Y) & setIn(Y,alive)))) & (all Y all Z (setIn(Z,alive) & elec_1 = index(status,host(Z)) -> -elem(m_Ack(Z,Y),queue(host(Z))))) & (all Y all Z (elem(m_Ack(Z,Y),queue(host(Z))) & setIn(Z,alive) -> leq(host(Y),index(pendack,host(Z))))) & (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)))) & (all Y all Z (elem(m_Ldr(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) -> (setIn(X,alive) -> (index(status,host(X)) != norm -> (all Y all Z all X0 all Y0 (host(W) = host(Y0) -> (host(X) = host(Y0) -> (elem(m_Down(X0),snoc(V,m_NotNorm(W))) & index(pendack,host(Y0)) = host(Z) & s(index(pendack,host(Y0))) = host(X0) & index(status,host(Y0)) = elec_2 & leq(nbr_proc,s(index(pendack,host(Y0)))) & elem(m_Ack(Y0,Z),snoc(V,m_NotNorm(W))) & setIn(Y0,alive) -> -(setIn(Y,alive) & index(ldr,host(Y)) = host(Y) & norm = index(status,host(Y))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.07/0.56	69 -elem(A,snoc(B,C)) | elem(A,B) | C = A # label(axiom_47) # label(axiom).  [clausify(7)].
0.07/0.56	75 m_NotNorm(A) != m_Down(B) # label(axiom_19) # label(axiom).  [clausify(9)].
0.07/0.56	96 m_NotNorm(A) != m_Ack(B,C) # label(axiom_13) # label(axiom).  [clausify(19)].
0.07/0.56	110 -leq(A,B) | -leq(B,A) | A = B # label(axiom_61) # label(axiom).  [clausify(32)].
0.07/0.56	122 leq(A,A) # label(axiom_59) # label(axiom).  [clausify(38)].
0.07/0.56	134 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom).  [clausify(41)].
0.07/0.56	140 elem(A,cons(B,C)) | -elem(A,C) # label(axiom_46) # label(axiom).  [clausify(45)].
0.07/0.56	162 index(status,host(A)) != elec_2 | -setIn(A,alive) | index(elid,host(A)) = A # label(conj) # label(negated_conjecture).  [clausify(58)].
0.07/0.56	171 -setIn(A,alive) | -elem(m_Ack(A,B),queue(host(A))) | -leq(nbr_proc,s(index(pendack,host(A)))) | index(status,host(A)) != elec_2 | host(C) != s(index(pendack,host(A))) | index(pendack,host(A)) != host(B) | -elem(m_Down(C),queue(host(A))) | -setIn(D,alive) | index(status,host(D)) != norm | index(ldr,host(D)) != host(D) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.07/0.56	172 queue(host(c3)) = cons(m_NormQ(c2),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.07/0.56	173 cons(m_NormQ(c2),c1) = queue(host(c3)).  [copy(172),flip(a)].
0.07/0.56	181 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.07/0.56	183 host(c7) = host(c2) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.07/0.56	184 host(c7) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.07/0.56	185 host(c3) = host(c2).  [copy(184),rewrite([183(2)]),flip(a)].
0.07/0.56	186 elem(m_Down(c6),snoc(c1,m_NotNorm(c2))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.07/0.56	187 index(pendack,host(c7)) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.07/0.56	188 index(pendack,host(c2)) = host(c5).  [copy(187),rewrite([183(3)])].
0.07/0.56	189 host(c6) = s(index(pendack,host(c7))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.07/0.56	190 s(host(c5)) = host(c6).  [copy(189),rewrite([183(5),188(6)]),flip(a)].
0.07/0.56	191 index(status,host(c7)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
0.07/0.56	192 elec_2 = index(status,host(c2)).  [copy(191),rewrite([183(3)]),flip(a)].
0.07/0.56	193 leq(nbr_proc,s(index(pendack,host(c7)))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.07/0.56	194 leq(nbr_proc,host(c6)).  [copy(193),rewrite([183(4),188(5),190(4)])].
0.07/0.56	195 elem(m_Ack(c7,c5),snoc(c1,m_NotNorm(c2))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.07/0.56	196 setIn(c7,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.07/0.56	197 setIn(c4,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.07/0.56	198 index(ldr,host(c4)) = host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.07/0.56	199 index(status,host(c4)) = norm # label(conj) # label(negated_conjecture).  [clausify(58)].
0.07/0.56	200 norm = index(status,host(c4)).  [copy(199),flip(a)].
0.07/0.56	209 cons(m_NormQ(c2),c1) = queue(host(c2)).  [back_rewrite(173),rewrite([185(6)])].
0.07/0.56	211 -setIn(A,alive) | -elem(m_Ack(A,B),queue(host(A))) | -leq(nbr_proc,s(index(pendack,host(A)))) | index(status,host(c2)) != index(status,host(A)) | host(C) != s(index(pendack,host(A))) | index(pendack,host(A)) != host(B) | -elem(m_Down(C),queue(host(A))) | -setIn(D,alive) | index(status,host(c4)) != index(status,host(D)) | index(ldr,host(D)) != host(D).  [back_rewrite(171),rewrite([192(16),200(41)]),flip(d),flip(i)].
0.07/0.56	215 index(status,host(c2)) != index(status,host(A)) | -setIn(A,alive) | index(elid,host(A)) = A.  [back_rewrite(162),rewrite([192(4)]),flip(a)].
0.07/0.56	317 elem(m_Down(c6),c1).  [resolve(186,a,69,a),unit_del(b,75)].
0.07/0.56	328 host(c6) = nbr_proc.  [resolve(194,a,110,b),unit_del(a,134)].
0.07/0.56	338 s(host(c5)) = nbr_proc.  [back_rewrite(190),rewrite([328(5)])].
0.07/0.56	343 elem(m_Ack(c7,c5),c1).  [resolve(195,a,69,a),flip(b),unit_del(b(flip),96)].
0.07/0.56	365 -elem(m_Ack(c3,A),queue(host(c2))) | host(B) != nbr_proc | host(c5) != host(A) | -elem(m_Down(B),queue(host(c2))) | -setIn(C,alive) | index(status,host(c4)) != index(status,host(C)) | index(ldr,host(C)) != host(C).  [resolve(211,a,181,a),rewrite([185(4),185(10),188(11),338(10),185(16),185(22),188(23),338(22),185(24),188(25),185(28)]),xx(c),unit_del(b,122)].
0.07/0.56	374 index(elid,host(c2)) = c7.  [resolve(215,b,196,a),rewrite([183(7),183(12)]),xx(a)].
0.07/0.56	375 c7 = c3.  [resolve(215,b,181,a),rewrite([185(7),185(12),374(13)]),xx(a)].
0.07/0.56	377 elem(m_Ack(c3,c5),c1).  [back_rewrite(343),rewrite([375(1)])].
0.07/0.56	397 elem(m_Down(c6),cons(A,c1)).  [resolve(317,a,140,b)].
0.07/0.56	441 elem(m_Ack(c3,c5),cons(A,c1)).  [resolve(377,a,140,b)].
0.07/0.56	512 elem(m_Down(c6),queue(host(c2))).  [para(209(a,1),397(a,2))].
0.07/0.56	543 -elem(m_Ack(c3,A),queue(host(c2))) | host(B) != nbr_proc | host(c5) != host(A) | -elem(m_Down(B),queue(host(c2))).  [resolve(365,e,197,a),rewrite([198(31)]),xx(e),xx(f)].
0.07/0.56	565 -elem(m_Ack(c3,A),queue(host(c2))) | host(c5) != host(A).  [resolve(512,a,543,d),rewrite([328(8)]),xx(b)].
0.07/0.56	687 elem(m_Ack(c3,c5),queue(host(c2))).  [para(209(a,1),441(a,2))].
0.07/0.56	760 $F.  [resolve(687,a,565,a),xx(a)].
0.07/0.56	
0.07/0.56	% SZS output end Refutation
0.07/0.56	============================== end of proof ==========================
0.07/0.56	
0.07/0.56	============================== STATISTICS ============================
0.07/0.56	
0.07/0.56	Given=271. Generated=2042. Kept=689. proofs=1.
0.07/0.56	Usable=258. Sos=360. Demods=26. Limbo=0, Disabled=201. Hints=0.
0.07/0.56	Megabytes=1.50.
0.07/0.56	User_CPU=0.07, System_CPU=0.00, Wall_clock=0.
0.07/0.56	
0.07/0.56	============================== end of statistics =====================
0.07/0.56	
0.07/0.56	============================== end of search =========================
0.07/0.56	
0.07/0.56	THEOREM PROVED
0.07/0.56	% SZS status Theorem
0.07/0.56	
0.07/0.56	Exiting with 1 proof.
0.07/0.56	
0.07/0.56	Process 25527 exit (max_proofs) Sat Jul 14 05:24:55 2018
0.07/0.56	Prover9 interrupted
0.07/0.57	EOF