0.00/0.05	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.05	% Command    : tptp2X_and_run_prover9 %d %s
0.03/0.30	% Computer   : n132.star.cs.uiowa.edu
0.03/0.30	% Model      : x86_64 x86_64
0.03/0.30	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.30	% Memory     : 32218.625MB
0.03/0.30	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.30	% CPULimit   : 300
0.03/0.30	% DateTime   : Sat Jul 14 04:52:55 CDT 2018
0.03/0.30	% CPUTime    : 
0.32/0.58	============================== Prover9 ===============================
0.32/0.58	Prover9 (32) version 2009-11A, November 2009.
0.32/0.58	Process 8004 was started by sandbox on n132.star.cs.uiowa.edu,
0.32/0.58	Sat Jul 14 04:52:55 2018
0.32/0.58	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7865_n132.star.cs.uiowa.edu".
0.32/0.58	============================== end of head ===========================
0.32/0.58	
0.32/0.58	============================== INPUT =================================
0.32/0.58	
0.32/0.58	% Reading from file /tmp/Prover9_7865_n132.star.cs.uiowa.edu
0.32/0.58	
0.32/0.58	set(prolog_style_variables).
0.32/0.58	set(auto2).
0.32/0.58	    % set(auto2) -> set(auto).
0.32/0.58	    % set(auto) -> set(auto_inference).
0.32/0.58	    % set(auto) -> set(auto_setup).
0.32/0.58	    % set(auto_setup) -> set(predicate_elim).
0.32/0.58	    % set(auto_setup) -> assign(eq_defs, unfold).
0.32/0.58	    % set(auto) -> set(auto_limits).
0.32/0.58	    % set(auto_limits) -> assign(max_weight, "100.000").
0.32/0.58	    % set(auto_limits) -> assign(sos_limit, 20000).
0.32/0.58	    % set(auto) -> set(auto_denials).
0.32/0.58	    % set(auto) -> set(auto_process).
0.32/0.58	    % set(auto2) -> assign(new_constants, 1).
0.32/0.58	    % set(auto2) -> assign(fold_denial_max, 3).
0.32/0.58	    % set(auto2) -> assign(max_weight, "200.000").
0.32/0.58	    % set(auto2) -> assign(max_hours, 1).
0.32/0.58	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.32/0.58	    % set(auto2) -> assign(max_seconds, 0).
0.32/0.58	    % set(auto2) -> assign(max_minutes, 5).
0.32/0.58	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.32/0.58	    % set(auto2) -> set(sort_initial_sos).
0.32/0.58	    % set(auto2) -> assign(sos_limit, -1).
0.32/0.58	    % set(auto2) -> assign(lrs_ticks, 3000).
0.32/0.58	    % set(auto2) -> assign(max_megs, 400).
0.32/0.58	    % set(auto2) -> assign(stats, some).
0.32/0.58	    % set(auto2) -> clear(echo_input).
0.32/0.58	    % set(auto2) -> set(quiet).
0.32/0.58	    % set(auto2) -> clear(print_initial_clauses).
0.32/0.58	    % set(auto2) -> clear(print_given).
0.32/0.58	assign(lrs_ticks,-1).
0.32/0.58	assign(sos_limit,10000).
0.32/0.58	assign(order,kbo).
0.32/0.58	set(lex_order_vars).
0.32/0.58	clear(print_given).
0.32/0.58	
0.32/0.58	% formulas(sos).  % not echoed (67 formulas)
0.32/0.58	
0.32/0.58	============================== end of input ==========================
0.32/0.58	
0.32/0.58	% From the command line: assign(max_seconds, 300).
0.32/0.58	
0.32/0.58	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.32/0.58	
0.32/0.58	% Formulas that are not ordinary clauses:
0.32/0.58	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.32/0.58	2 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.32/0.58	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.32/0.58	4 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.32/0.58	5 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.32/0.58	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.32/0.58	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.32/0.58	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.32/0.58	9 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.32/0.58	10 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.32/0.58	11 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.32/0.58	12 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.32/0.58	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.32/0.58	14 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.32/0.58	15 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.32/0.58	16 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	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.33/0.58	18 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	19 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	20 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	21 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	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.33/0.58	23 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	24 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	25 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	26 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	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.33/0.58	28 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	29 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	30 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	31 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	32 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	33 (all Q (q_nil = Q | Q = cons(head(Q),tail(Q)))) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	34 (all Q (snoc(init(Q),last(Q)) = Q | q_nil = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	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.33/0.58	36 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	37 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	38 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	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.33/0.58	40 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	41 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	42 (all P all Q (host(Q) = s(host(P)) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	43 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	44 (all X all Y (X != Y <-> m_Down(X) != m_Down(Y))) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	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.33/0.58	46 (all X all Y (m_Halt(X) != m_Halt(Y) <-> X != Y)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	47 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	48 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	49 (all X X = pidMsg(m_Down(X))) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	51 (all X all Y (m_NotNorm(Y) != m_NotNorm(X) <-> Y != X)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	52 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	53 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	54 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	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.33/0.58	56 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	57 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.33/0.58	58 -(all V all W all X all Y ((all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (host(Pid0) = host(Z) & Pid0 != Z -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (index(status,host(Pid0)) = elec_2 & setIn(host(Pid0),index(down,host(Z))) & setIn(Pid0,alive) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (host(Pid20) = host(Pid0) & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & setIn(Z,alive) & -leq(host(Pid0),host(Z)) -> -elem(m_Down(Pid20),queue(host(Z))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 & elec_2 = index(status,host(Z)) & host(Pid20) = host(Pid0) & setIn(Z,alive) -> -elem(m_Ack(Z,Pid20),queue(host(Z))))) & (all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Z))) & host(Pid0) = host(Pid20) & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (index(ldr,host(Pid0)) = host(Pid0) & norm = index(status,host(Pid0)) & host(Pid0) = host(Pid20) & setIn(Pid0,alive) -> -(elem(m_Down(Pid20),queue(host(Z))) & setIn(Z,alive)))) & (all Z all Pid0 (index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & -leq(index(pendack,host(Pid0)),host(Z)) -> -(host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm & setIn(Z,alive)))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Z,alive) & elec_2 = index(status,host(Z)) & elec_2 = index(status,host(Pid0)) & setIn(Pid0,alive) -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & (all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid20) = host(Z) & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) -> -(setIn(Z,alive) & host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) & -leq(host(Pid0),host(Z)) & elem(m_Down(Pid20),queue(host(Pid0))) & elec_1 = index(status,host(Pid0)) -> -(norm = index(status,host(Z)) & host(Z) = index(ldr,host(Z)) & setIn(Z,alive)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Ack(Pid0,Pid20),queue(host(Pid0))) & host(Pid20) = host(Z) -> -(setIn(Z,alive) & host(Z) = index(ldr,host(Z)) & norm = index(status,host(Z))))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Pid0,alive) & elec_2 = index(status,host(Z)) & index(status,host(Pid0)) = elec_2 & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid0) & setIn(Pid0,alive) -> -(setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z)))))) & (all Z (setIn(Z,alive) & (elec_1 = index(status,host(Z)) | elec_2 = index(status,host(Z))) -> Z = index(elid,host(Z)))) & (all Z all Pid0 (setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) -> -elem(m_Ack(Z,Pid0),queue(host(Z))))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(wait = index(status,host(X)) & host(index(elid,host(X))) = host(Y) | norm = index(status,host(X)) & index(ldr,host(X)) = host(Y)) -> ((all Z (leq(s(zero),Z) & -leq(host(X),Z) -> setIn(Z,index(down,host(X))) | host(Y) = Z)) & index(status,host(X)) = elec_1 -> (leq(nbr_proc,host(X)) -> (all Z (-setIn(host(Z),setEmpty) -> (all V0 (host(V0) = host(X) -> (all W0 (host(W0) != host(X) -> (elec_2 = index(status,host(W0)) & setIn(W0,alive) & -leq(index(pendack,host(W0)),host(V0)) -> -(setIn(V0,alive) & host(V0) = host(X)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
41.74/42.01	
41.74/42.01	============================== end of process non-clausal formulas ===
41.74/42.01	
41.74/42.01	============================== PROCESS INITIAL CLAUSES ===============
41.74/42.01	
41.74/42.01	============================== PREDICATE ELIMINATION =================
41.74/42.01	
41.74/42.01	============================== end predicate elimination =============
41.74/42.01	
41.74/42.01	Auto_denials:  (non-Horn, no changes).
41.74/42.01	
41.74/42.01	Term ordering decisions:
41.74/42.01	Function symbol KB weights:  alive=1. status=1. elec_2=1. q_nil=1. elec_1=1. pendack=1. ldr=1. norm=1. zero=1. down=1. nbr_proc=1. elid=1. pids=1. nil=1. setEmpty=1. wait=1. c1=1. c3=1. c4=1. c5=1. c6=1. c7=1. index=1. cons=1. snoc=1. m_Ack=1. f2=1. f3=1. host=1. pidMsg=1. m_Down=1. s=1. queue=1. m_Halt=1. m_Ldr=1. m_NormQ=1. m_NotNorm=1. head=1. init=1. last=1. tail=1. f1=1. f4=1.
41.74/42.01	
41.74/42.01	============================== end of process initial clauses ========
41.74/42.01	
41.74/42.01	============================== CLAUSES FOR SEARCH ====================
41.74/42.01	
41.74/42.01	============================== end of clauses for search =============
41.74/42.01	
41.74/42.01	============================== SEARCH ================================
41.74/42.01	
41.74/42.01	% Starting search at 0.02 seconds.
41.74/42.01	
41.74/42.01	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 167 (0.00 of 0.34 sec).
41.74/42.01	
41.74/42.01	Low Water (keep): wt=55.000, iters=3376
41.74/42.01	
41.74/42.01	Low Water (keep): wt=34.000, iters=3352
41.74/42.01	
41.74/42.01	Low Water (keep): wt=28.000, iters=3333
41.74/42.01	
41.74/42.01	Low Water (keep): wt=27.000, iters=3378
41.74/42.01	
41.74/42.01	Low Water (keep): wt=26.000, iters=3376
41.74/42.01	
41.74/42.01	Low Water (keep): wt=24.000, iters=3353
41.74/42.01	
41.74/42.01	Low Water (keep): wt=23.000, iters=3333
41.74/42.01	
41.74/42.01	Low Water (keep): wt=15.000, iters=3342
41.74/42.01	
41.74/42.01	Low Water (displace): id=3802, wt=75.000
41.74/42.01	
41.74/42.01	Low Water (displace): id=4428, wt=72.000
41.74/42.01	
41.74/42.01	Low Water (displace): id=6276, wt=68.000
41.74/42.01	
41.74/42.01	Low Water (displace): id=2199, wt=63.000
41.74/42.01	
41.74/42.01	Low Water (displace): id=3526, wt=61.000
41.74/42.01	
41.74/42.01	Low Water (displace): id=4524, wt=60.000
41.74/42.01	
41.74/42.01	Low Water (displace): id=3803, wt=57.000
41.74/42.01	
41.74/42.01	Low Water (displace): id=14563, wt=14.000
41.74/42.01	
41.74/42.01	============================== PROOF =================================
41.74/42.01	% SZS status Theorem
41.74/42.01	% SZS output start Refutation
41.74/42.01	
41.74/42.01	% Proof 1 at 40.20 (+ 1.24) seconds.
41.74/42.01	% Length of proof is 43.
41.74/42.01	% Level of proof is 8.
41.74/42.01	% Maximum clause weight is 33.000.
41.74/42.01	% Given clauses 7233.
41.74/42.01	
41.74/42.01	26 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
41.74/42.01	32 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
41.74/42.01	41 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
41.74/42.01	43 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
41.74/42.01	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].
41.74/42.01	58 -(all V all W all X all Y ((all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (host(Pid0) = host(Z) & Pid0 != Z -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (index(status,host(Pid0)) = elec_2 & setIn(host(Pid0),index(down,host(Z))) & setIn(Pid0,alive) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (host(Pid20) = host(Pid0) & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & setIn(Z,alive) & -leq(host(Pid0),host(Z)) -> -elem(m_Down(Pid20),queue(host(Z))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 & elec_2 = index(status,host(Z)) & host(Pid20) = host(Pid0) & setIn(Z,alive) -> -elem(m_Ack(Z,Pid20),queue(host(Z))))) & (all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Z))) & host(Pid0) = host(Pid20) & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (index(ldr,host(Pid0)) = host(Pid0) & norm = index(status,host(Pid0)) & host(Pid0) = host(Pid20) & setIn(Pid0,alive) -> -(elem(m_Down(Pid20),queue(host(Z))) & setIn(Z,alive)))) & (all Z all Pid0 (index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & -leq(index(pendack,host(Pid0)),host(Z)) -> -(host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm & setIn(Z,alive)))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Z,alive) & elec_2 = index(status,host(Z)) & elec_2 = index(status,host(Pid0)) & setIn(Pid0,alive) -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & (all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid20) = host(Z) & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) -> -(setIn(Z,alive) & host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) & -leq(host(Pid0),host(Z)) & elem(m_Down(Pid20),queue(host(Pid0))) & elec_1 = index(status,host(Pid0)) -> -(norm = index(status,host(Z)) & host(Z) = index(ldr,host(Z)) & setIn(Z,alive)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Ack(Pid0,Pid20),queue(host(Pid0))) & host(Pid20) = host(Z) -> -(setIn(Z,alive) & host(Z) = index(ldr,host(Z)) & norm = index(status,host(Z))))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Pid0,alive) & elec_2 = index(status,host(Z)) & index(status,host(Pid0)) = elec_2 & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid0) & setIn(Pid0,alive) -> -(setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z)))))) & (all Z (setIn(Z,alive) & (elec_1 = index(status,host(Z)) | elec_2 = index(status,host(Z))) -> Z = index(elid,host(Z)))) & (all Z all Pid0 (setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) -> -elem(m_Ack(Z,Pid0),queue(host(Z))))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(wait = index(status,host(X)) & host(index(elid,host(X))) = host(Y) | norm = index(status,host(X)) & index(ldr,host(X)) = host(Y)) -> ((all Z (leq(s(zero),Z) & -leq(host(X),Z) -> setIn(Z,index(down,host(X))) | host(Y) = Z)) & index(status,host(X)) = elec_1 -> (leq(nbr_proc,host(X)) -> (all Z (-setIn(host(Z),setEmpty) -> (all V0 (host(V0) = host(X) -> (all W0 (host(W0) != host(X) -> (elec_2 = index(status,host(W0)) & setIn(W0,alive) & -leq(index(pendack,host(W0)),host(V0)) -> -(setIn(V0,alive) & host(V0) = host(X)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
41.74/42.01	104 leq(s(zero),host(A)) # label(axiom_02) # label(axiom).  [clausify(26)].
41.74/42.01	110 -leq(A,B) | -leq(B,A) | A = B # label(axiom_61) # label(axiom).  [clausify(32)].
41.74/42.01	134 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom).  [clausify(41)].
41.74/42.01	136 init(snoc(A,B)) = A # label(axiom_38) # label(axiom).  [clausify(43)].
41.74/42.01	141 elem(A,cons(B,C)) | B != A # label(axiom_46) # label(axiom).  [clausify(45)].
41.74/42.01	163 index(status,host(A)) != elec_2 | -setIn(host(A),index(down,host(B))) | -setIn(A,alive) | -setIn(B,alive) | leq(index(pendack,host(A)),host(B)) # label(conj) # label(negated_conjecture).  [clausify(58)].
41.74/42.01	166 -elem(m_Down(A),queue(host(B))) | host(A) != host(C) | index(status,host(C)) != elec_2 | -setIn(C,alive) | -setIn(B,alive) | leq(index(pendack,host(C)),host(B)) # label(conj) # label(negated_conjecture).  [clausify(58)].
41.74/42.01	170 queue(host(c3)) = cons(m_Down(c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
41.74/42.01	171 cons(m_Down(c4),c1) = queue(host(c3)).  [copy(170),flip(a)].
41.74/42.01	183 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
41.74/42.01	187 -leq(s(zero),A) | leq(host(c3),A) | setIn(A,index(down,host(c3))) | host(c4) = A # label(conj) # label(negated_conjecture).  [clausify(58)].
41.74/42.01	190 leq(nbr_proc,host(c3)) # label(conj) # label(negated_conjecture).  [clausify(58)].
41.74/42.01	191 host(c6) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
41.74/42.01	192 host(c7) != host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
41.74/42.01	193 index(status,host(c7)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
41.74/42.01	194 elec_2 = index(status,host(c7)).  [copy(193),flip(a)].
41.74/42.01	195 setIn(c7,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
41.74/42.01	196 -leq(index(pendack,host(c7)),host(c6)) # label(conj) # label(negated_conjecture).  [clausify(58)].
41.74/42.01	197 -leq(index(pendack,host(c7)),host(c3)).  [copy(196),rewrite([191(6)])].
41.74/42.01	219 -elem(m_Down(A),queue(host(B))) | host(A) != host(C) | index(status,host(c7)) != index(status,host(C)) | -setIn(C,alive) | -setIn(B,alive) | leq(index(pendack,host(C)),host(B)).  [back_rewrite(166),rewrite([194(11)]),flip(c)].
41.74/42.01	222 index(status,host(c7)) != index(status,host(A)) | -setIn(host(A),index(down,host(B))) | -setIn(A,alive) | -setIn(B,alive) | leq(index(pendack,host(A)),host(B)).  [back_rewrite(163),rewrite([194(4)]),flip(a)].
41.74/42.01	271 -leq(nbr_proc,host(A)) | host(A) = nbr_proc.  [resolve(134,a,110,b),flip(b)].
41.74/42.01	276 elem(A,cons(A,B)).  [resolve(141,b,136,a),rewrite([136(2)])].
41.74/42.01	315 leq(host(c3),host(A)) | setIn(host(A),index(down,host(c3))) | host(c4) = host(A).  [resolve(187,a,104,a)].
41.74/42.01	320 host(c3) = nbr_proc.  [resolve(190,a,110,b),unit_del(a,134)].
41.74/42.01	322 leq(nbr_proc,host(A)) | setIn(host(A),index(down,nbr_proc)) | host(c4) = host(A).  [back_rewrite(315),rewrite([320(2),320(7)])].
41.74/42.01	339 -leq(index(pendack,host(c7)),nbr_proc).  [back_rewrite(197),rewrite([320(6)])].
41.74/42.01	340 host(c7) != nbr_proc.  [back_rewrite(192),rewrite([320(4)])].
41.74/42.01	345 cons(m_Down(c4),c1) = queue(nbr_proc).  [back_rewrite(171),rewrite([320(6)])].
41.74/42.01	373 -elem(m_Down(A),queue(nbr_proc)) | host(A) != host(B) | index(status,host(c7)) != index(status,host(B)) | -setIn(B,alive) | leq(index(pendack,host(B)),nbr_proc).  [para(320(a,1),219(a,2,1)),rewrite([320(25)]),unit_del(e,183)].
41.74/42.01	374 index(status,host(c7)) != index(status,host(A)) | -setIn(host(A),index(down,nbr_proc)) | -setIn(A,alive) | leq(index(pendack,host(A)),nbr_proc).  [para(320(a,1),222(b,2,2)),rewrite([320(23)]),unit_del(d,183)].
41.74/42.01	552 elem(m_Down(c4),queue(nbr_proc)).  [para(345(a,1),276(a,2))].
41.74/42.01	2703 host(c4) != host(A) | index(status,host(c7)) != index(status,host(A)) | -setIn(A,alive) | leq(index(pendack,host(A)),nbr_proc).  [resolve(373,a,552,a)].
41.74/42.01	2778 index(status,host(c7)) != index(status,host(A)) | -setIn(A,alive) | leq(index(pendack,host(A)),nbr_proc) | leq(nbr_proc,host(A)) | host(c4) = host(A).  [resolve(374,b,322,b)].
41.74/42.01	23844 host(c7) != host(c4).  [resolve(2703,c,195,a),flip(a),xx(b),unit_del(b,339)].
41.74/42.01	24576 leq(nbr_proc,host(c7)).  [resolve(2778,b,195,a),flip(d),xx(a),unit_del(a,339),unit_del(c,23844)].
41.74/42.01	24688 $F.  [resolve(24576,a,271,a),unit_del(a,340)].
41.74/42.01	
41.74/42.01	% SZS output end Refutation
41.74/42.01	============================== end of proof ==========================
41.74/42.01	
41.74/42.01	============================== STATISTICS ============================
41.74/42.01	
41.74/42.01	Given=7233. Generated=2114211. Kept=24618. proofs=1.
41.74/42.01	Usable=6563. Sos=9999. Demods=61. Limbo=55, Disabled=8132. Hints=0.
41.74/42.01	Megabytes=39.64.
41.74/42.01	User_CPU=40.20, System_CPU=1.24, Wall_clock=41.
41.74/42.01	
41.74/42.01	============================== end of statistics =====================
41.74/42.01	
41.74/42.01	============================== end of search =========================
41.74/42.01	
41.74/42.01	THEOREM PROVED
41.74/42.01	% SZS status Theorem
41.74/42.01	
41.74/42.01	Exiting with 1 proof.
41.74/42.01	
41.74/42.01	Process 8004 exit (max_proofs) Sat Jul 14 04:53:36 2018
41.74/42.01	Prover9 interrupted
41.74/42.02	EOF