0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n003.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 180
0.13/0.34	% DateTime   : Thu Aug 29 12:40:47 EDT 2019
0.13/0.34	% CPUTime    : 
0.81/1.09	============================== Prover9 ===============================
0.81/1.09	Prover9 (32) version 2009-11A, November 2009.
0.81/1.09	Process 21978 was started by sandbox2 on n003.cluster.edu,
0.81/1.09	Thu Aug 29 12:40:48 2019
0.81/1.09	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_21825_n003.cluster.edu".
0.81/1.09	============================== end of head ===========================
0.81/1.09	
0.81/1.09	============================== INPUT =================================
0.81/1.09	
0.81/1.09	% Reading from file /tmp/Prover9_21825_n003.cluster.edu
0.81/1.09	
0.81/1.09	set(prolog_style_variables).
0.81/1.09	set(auto2).
0.81/1.09	    % set(auto2) -> set(auto).
0.81/1.09	    % set(auto) -> set(auto_inference).
0.81/1.09	    % set(auto) -> set(auto_setup).
0.81/1.09	    % set(auto_setup) -> set(predicate_elim).
0.81/1.09	    % set(auto_setup) -> assign(eq_defs, unfold).
0.81/1.09	    % set(auto) -> set(auto_limits).
0.81/1.09	    % set(auto_limits) -> assign(max_weight, "100.000").
0.81/1.09	    % set(auto_limits) -> assign(sos_limit, 20000).
0.81/1.09	    % set(auto) -> set(auto_denials).
0.81/1.09	    % set(auto) -> set(auto_process).
0.81/1.09	    % set(auto2) -> assign(new_constants, 1).
0.81/1.09	    % set(auto2) -> assign(fold_denial_max, 3).
0.81/1.09	    % set(auto2) -> assign(max_weight, "200.000").
0.81/1.09	    % set(auto2) -> assign(max_hours, 1).
0.81/1.09	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.81/1.09	    % set(auto2) -> assign(max_seconds, 0).
0.81/1.09	    % set(auto2) -> assign(max_minutes, 5).
0.81/1.09	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.81/1.09	    % set(auto2) -> set(sort_initial_sos).
0.81/1.09	    % set(auto2) -> assign(sos_limit, -1).
0.81/1.09	    % set(auto2) -> assign(lrs_ticks, 3000).
0.81/1.09	    % set(auto2) -> assign(max_megs, 400).
0.81/1.09	    % set(auto2) -> assign(stats, some).
0.81/1.09	    % set(auto2) -> clear(echo_input).
0.81/1.09	    % set(auto2) -> set(quiet).
0.81/1.09	    % set(auto2) -> clear(print_initial_clauses).
0.81/1.09	    % set(auto2) -> clear(print_given).
0.81/1.09	assign(lrs_ticks,-1).
0.81/1.09	assign(sos_limit,10000).
0.81/1.09	assign(order,kbo).
0.81/1.09	set(lex_order_vars).
0.81/1.09	clear(print_given).
0.81/1.09	
0.81/1.09	% formulas(sos).  % not echoed (67 formulas)
0.81/1.09	
0.81/1.09	============================== end of input ==========================
0.81/1.09	
0.81/1.09	% From the command line: assign(max_seconds, 180).
0.81/1.09	
0.81/1.09	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.81/1.09	
0.81/1.09	% Formulas that are not ordinary clauses:
0.81/1.09	1 (all X all Y (Y != X <-> m_NotNorm(Y) != m_NotNorm(X))) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	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.81/1.09	3 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	4 (all X all Y (m_Down(Y) != m_Down(X) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	5 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	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.81/1.09	7 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	8 (all X all Y (Y != X <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	9 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	10 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	11 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	13 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	14 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	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.81/1.09	16 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	17 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	18 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.81/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.81/1.09	20 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.81/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.81/1.09	22 (all X X = pidMsg(m_Down(X))) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	23 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	24 (all Q (Q = cons(head(Q),tail(Q)) | q_nil = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.81/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.81/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.81/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.81/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.81/1.09	29 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.81/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.81/1.09	31 (all X all Q Q = tail(cons(X,Q))) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	32 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.81/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.81/1.09	34 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	35 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.81/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.81/1.09	37 (all Q (q_nil = Q | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.81/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.81/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.81/1.09	40 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.81/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.81/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.81/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.81/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.81/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.81/1.09	46 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	47 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	48 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	49 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	50 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	51 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	52 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	53 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.81/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.81/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.81/1.09	56 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.81/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.81/1.09	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 (setIn(Z,alive) & (elec_1 = index(status,host(Z)) | elec_2 = index(status,host(Z))) -> Z = index(elid,host(Z)))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) = host(Pid0) & host(Z) = host(Pid30) & setIn(Pid20,alive) & setIn(Z,alive) & host(Z) != host(Pid20) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid20,alive) & host(Z) = host(Pid30) & host(Pid0) = host(Pid20) & host(Z) != host(Pid20) -> -(setIn(host(Pid30),index(down,host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & queue(host(X)) = cons(m_Down(Y),V) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | V0 = host(Pid20))) & setIn(Pid0,alive) & leq(nbr_proc,s(host(Pid0))) & elem(m_Down(Pid20),queue(host(Pid0))) & index(status,host(Pid0)) = elec_1 & host(Pid30) = s(host(Pid0)) & elem(m_Down(Pid30),queue(host(Pid0))) -> -(index(status,host(Z)) = norm & host(Z) = index(ldr,host(Z)) & setIn(Z,alive)))) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> V0 = host(Pid20) | setIn(V0,index(down,host(Pid0))))) & setIn(Z,alive) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid30) = host(Pid0) & elec_2 = index(status,host(Z)) & elec_1 = index(status,host(Pid0)) & leq(host(Z),host(Pid0)) -> -elem(m_Ack(Z,Pid30),queue(host(Z))))) & (all Z all Pid20 all Pid0 (host(Z) = host(Pid20) & host(index(elid,host(Pid0))) = host(Pid20) & index(status,host(Pid0)) = wait & elem(m_Down(Z),queue(host(Pid0))) & setIn(Pid0,alive) & host(Pid20) != host(Pid0) -> -(setIn(Pid20,alive) & index(ldr,host(Pid20)) = host(Pid20) & index(status,host(Pid20)) = norm))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid20) & host(Pid20) = host(Z) & elem(m_Down(Z),queue(host(Pid0))) & setIn(Pid0,alive) -> -(setIn(Pid20,alive) & host(Pid20) = index(ldr,host(Pid20)) & norm = index(status,host(Pid20))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Pid20) = host(Z) & elem(m_Down(Pid20),queue(host(Pid0))) & -leq(host(Pid20),host(Pid0)) -> -(index(ldr,host(Z)) = host(Z) & index(status,host(Z)) = norm & setIn(Z,alive)))) & (all Z all Pid0 (setIn(Z,alive) & host(Pid0) = index(ldr,host(Pid0)) & norm = index(status,host(Pid0)) & index(status,host(Z)) = norm & index(ldr,host(Z)) = host(Z) & setIn(Pid0,alive) -> Z = Pid0)) & (all Z all Pid20 all Pid0 (host(Pid20) = host(Pid0) & norm = index(status,host(Pid0)) & index(ldr,host(Pid0)) = host(Pid0) & setIn(Pid0,alive) -> -(setIn(Z,alive) & elem(m_Down(Pid20),queue(host(Z)))))) & (all Z all Pid20 all Pid0 (setIn(Z,alive) & elem(m_Down(Pid20),queue(host(Z))) & index(status,host(Pid0)) = elec_2 & host(Pid0) = host(Pid20) & setIn(Pid0,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = norm & host(Pid0) = index(ldr,host(Pid0)) -> -(setIn(host(Pid0),index(down,host(Z))) & setIn(Z,alive)))) & (all Z all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 & setIn(host(Pid0),index(down,host(Z))) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (host(Pid0) = host(Z) & Pid0 != Z -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) -> (setIn(X,alive) -> (leq(host(X),host(Y)) -> (index(status,host(X)) = elec_2 & index(pendack,host(X)) = host(Y) -> (leq(nbr_proc,index(pendack,host(X))) -> (all Z (setIn(host(Z),index(acks,host(X))) -> (all V0 (host(V0) = host(X) -> (all W0 all X0 all Y0 (host(Z) = host(Y0) -> (host(Y0) != host(X) -> (leq(nbr_proc,s(host(Y0))) & elem(m_Down(W0),snoc(queue(host(Y0)),m_Ldr(X))) & elem(m_Down(X0),snoc(queue(host(Y0)),m_Ldr(X))) & s(host(Y0)) = host(W0) & index(status,host(Y0)) = elec_1 & setIn(Y0,alive) & (all V1 (-leq(host(Y0),V1) & leq(s(zero),V1) -> host(X0) = V1 | setIn(V1,index(down,host(Y0))))) -> -(setIn(V0,alive) & host(V0) = host(X)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
49.43/49.72	
49.43/49.72	============================== end of process non-clausal formulas ===
49.43/49.72	
49.43/49.72	============================== PROCESS INITIAL CLAUSES ===============
49.43/49.72	
49.43/49.72	============================== PREDICATE ELIMINATION =================
49.43/49.72	
49.43/49.72	============================== end predicate elimination =============
49.43/49.72	
49.43/49.72	Auto_denials:  (non-Horn, no changes).
49.43/49.72	
49.43/49.72	Term ordering decisions:
49.43/49.72	Function symbol KB weights:  alive=1. status=1. ldr=1. norm=1. q_nil=1. elec_2=1. nbr_proc=1. zero=1. elec_1=1. pendack=1. down=1. elid=1. pids=1. acks=1. wait=1. nil=1. setEmpty=1. c1=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. index=1. snoc=1. cons=1. m_Ack=1. f2=1. f3=1. host=1. m_Down=1. pidMsg=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. f5=1.
49.43/49.72	
49.43/49.72	============================== end of process initial clauses ========
49.43/49.72	
49.43/49.72	============================== CLAUSES FOR SEARCH ====================
49.43/49.72	
49.43/49.72	============================== end of clauses for search =============
49.43/49.72	
49.43/49.72	============================== SEARCH ================================
49.43/49.72	
49.43/49.72	% Starting search at 0.05 seconds.
49.43/49.72	
49.43/49.72	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 67 (0.00 of 0.35 sec).
49.43/49.72	
49.43/49.72	Low Water (keep): wt=27.000, iters=3354
49.43/49.72	
49.43/49.72	Low Water (keep): wt=26.000, iters=3372
49.43/49.72	
49.43/49.72	Low Water (keep): wt=20.000, iters=3479
49.43/49.72	
49.43/49.72	Low Water (keep): wt=19.000, iters=3382
49.43/49.72	
49.43/49.72	Low Water (keep): wt=17.000, iters=3444
49.43/49.72	
49.43/49.72	Low Water (keep): wt=16.000, iters=3406
49.43/49.72	
49.43/49.72	Low Water (keep): wt=15.000, iters=4349
49.43/49.72	
49.43/49.72	Low Water (keep): wt=14.000, iters=3333
49.43/49.72	
49.43/49.72	Low Water (displace): id=6589, wt=103.000
49.43/49.72	
49.43/49.72	Low Water (displace): id=6713, wt=101.000
49.43/49.72	
49.43/49.72	Low Water (displace): id=6710, wt=97.000
49.43/49.72	
49.43/49.72	============================== PROOF =================================
49.43/49.72	% SZS status Theorem
49.43/49.72	% SZS output start Refutation
49.43/49.72	
49.43/49.72	% Proof 1 at 46.78 (+ 1.87) seconds.
49.43/49.72	% Length of proof is 77.
49.43/49.72	% Level of proof is 13.
49.43/49.72	% Maximum clause weight is 33.000.
49.43/49.72	% Given clauses 11247.
49.43/49.72	
49.43/49.72	12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
49.43/49.72	13 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
49.43/49.72	22 (all X X = pidMsg(m_Down(X))) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
49.43/49.72	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].
49.43/49.72	27 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
49.43/49.72	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].
49.43/49.72	47 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
49.43/49.72	48 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
49.43/49.72	52 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
49.43/49.72	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 (setIn(Z,alive) & (elec_1 = index(status,host(Z)) | elec_2 = index(status,host(Z))) -> Z = index(elid,host(Z)))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) = host(Pid0) & host(Z) = host(Pid30) & setIn(Pid20,alive) & setIn(Z,alive) & host(Z) != host(Pid20) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid20,alive) & host(Z) = host(Pid30) & host(Pid0) = host(Pid20) & host(Z) != host(Pid20) -> -(setIn(host(Pid30),index(down,host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & queue(host(X)) = cons(m_Down(Y),V) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | V0 = host(Pid20))) & setIn(Pid0,alive) & leq(nbr_proc,s(host(Pid0))) & elem(m_Down(Pid20),queue(host(Pid0))) & index(status,host(Pid0)) = elec_1 & host(Pid30) = s(host(Pid0)) & elem(m_Down(Pid30),queue(host(Pid0))) -> -(index(status,host(Z)) = norm & host(Z) = index(ldr,host(Z)) & setIn(Z,alive)))) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> V0 = host(Pid20) | setIn(V0,index(down,host(Pid0))))) & setIn(Z,alive) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid30) = host(Pid0) & elec_2 = index(status,host(Z)) & elec_1 = index(status,host(Pid0)) & leq(host(Z),host(Pid0)) -> -elem(m_Ack(Z,Pid30),queue(host(Z))))) & (all Z all Pid20 all Pid0 (host(Z) = host(Pid20) & host(index(elid,host(Pid0))) = host(Pid20) & index(status,host(Pid0)) = wait & elem(m_Down(Z),queue(host(Pid0))) & setIn(Pid0,alive) & host(Pid20) != host(Pid0) -> -(setIn(Pid20,alive) & index(ldr,host(Pid20)) = host(Pid20) & index(status,host(Pid20)) = norm))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid20) & host(Pid20) = host(Z) & elem(m_Down(Z),queue(host(Pid0))) & setIn(Pid0,alive) -> -(setIn(Pid20,alive) & host(Pid20) = index(ldr,host(Pid20)) & norm = index(status,host(Pid20))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Pid20) = host(Z) & elem(m_Down(Pid20),queue(host(Pid0))) & -leq(host(Pid20),host(Pid0)) -> -(index(ldr,host(Z)) = host(Z) & index(status,host(Z)) = norm & setIn(Z,alive)))) & (all Z all Pid0 (setIn(Z,alive) & host(Pid0) = index(ldr,host(Pid0)) & norm = index(status,host(Pid0)) & index(status,host(Z)) = norm & index(ldr,host(Z)) = host(Z) & setIn(Pid0,alive) -> Z = Pid0)) & (all Z all Pid20 all Pid0 (host(Pid20) = host(Pid0) & norm = index(status,host(Pid0)) & index(ldr,host(Pid0)) = host(Pid0) & setIn(Pid0,alive) -> -(setIn(Z,alive) & elem(m_Down(Pid20),queue(host(Z)))))) & (all Z all Pid20 all Pid0 (setIn(Z,alive) & elem(m_Down(Pid20),queue(host(Z))) & index(status,host(Pid0)) = elec_2 & host(Pid0) = host(Pid20) & setIn(Pid0,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = norm & host(Pid0) = index(ldr,host(Pid0)) -> -(setIn(host(Pid0),index(down,host(Z))) & setIn(Z,alive)))) & (all Z all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 & setIn(host(Pid0),index(down,host(Z))) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (host(Pid0) = host(Z) & Pid0 != Z -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) -> (setIn(X,alive) -> (leq(host(X),host(Y)) -> (index(status,host(X)) = elec_2 & index(pendack,host(X)) = host(Y) -> (leq(nbr_proc,index(pendack,host(X))) -> (all Z (setIn(host(Z),index(acks,host(X))) -> (all V0 (host(V0) = host(X) -> (all W0 all X0 all Y0 (host(Z) = host(Y0) -> (host(Y0) != host(X) -> (leq(nbr_proc,s(host(Y0))) & elem(m_Down(W0),snoc(queue(host(Y0)),m_Ldr(X))) & elem(m_Down(X0),snoc(queue(host(Y0)),m_Ldr(X))) & s(host(Y0)) = host(W0) & index(status,host(Y0)) = elec_1 & setIn(Y0,alive) & (all V1 (-leq(host(Y0),V1) & leq(s(zero),V1) -> host(X0) = V1 | setIn(V1,index(down,host(Y0))))) -> -(setIn(V0,alive) & host(V0) = host(X)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
49.43/49.72	77 m_Ldr(A) != m_Down(B) # label(axiom_18) # label(axiom).  [clausify(12)].
49.43/49.72	78 -leq(A,B) | -leq(B,A) | A = B # label(axiom_61) # label(axiom).  [clausify(13)].
49.43/49.72	98 pidMsg(m_Down(A)) = A # label(axiom_50) # label(axiom).  [clausify(22)].
49.43/49.72	102 A != B | elem(B,cons(A,C)) # label(axiom_46) # label(axiom).  [clausify(26)].
49.43/49.72	106 s(A) = B | leq(B,A) | -leq(B,s(A)) # label(axiom_64) # label(axiom).  [clausify(27)].
49.43/49.72	128 A = B | elem(B,C) | -elem(B,snoc(C,A)) # label(axiom_47) # label(axiom).  [clausify(42)].
49.43/49.72	141 -leq(s(A),A) # label(axiom_58) # label(axiom).  [clausify(47)].
49.43/49.72	142 leq(s(zero),host(A)) # label(axiom_02) # label(axiom).  [clausify(48)].
49.43/49.72	152 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom).  [clausify(52)].
49.43/49.72	165 queue(host(c3)) = cons(m_Down(c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
49.43/49.72	166 cons(m_Down(c4),c1) = queue(host(c3)).  [copy(165),flip(a)].
49.43/49.72	182 -setIn(A,alive) | -elem(m_Down(B),queue(host(A))) | index(status,host(C)) != elec_2 | host(B) != host(C) | -setIn(C,alive) | leq(index(pendack,host(C)),host(A)) # label(conj) # label(negated_conjecture).  [clausify(58)].
49.43/49.72	184 -setIn(A,alive) | index(status,host(A)) != elec_2 | -setIn(host(A),index(down,host(B))) | -setIn(B,alive) | leq(index(pendack,host(A)),host(B)) # label(conj) # label(negated_conjecture).  [clausify(58)].
49.43/49.72	186 -elem(m_Down(A),queue(host(B))) | host(A) != host(B) # label(conj) # label(negated_conjecture).  [clausify(58)].
49.43/49.72	187 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
49.43/49.72	189 index(status,host(c3)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
49.43/49.72	190 elec_2 = index(status,host(c3)).  [copy(189),flip(a)].
49.43/49.72	191 index(pendack,host(c3)) = host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
49.43/49.72	192 leq(nbr_proc,index(pendack,host(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
49.43/49.72	193 leq(nbr_proc,host(c4)).  [copy(192),rewrite([191(5)])].
49.43/49.72	195 host(c6) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
49.43/49.72	196 host(c9) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
49.43/49.72	197 host(c9) != host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
49.43/49.72	198 host(c5) != host(c3).  [copy(197),rewrite([196(2)])].
49.43/49.72	199 leq(nbr_proc,s(host(c9))) # label(conj) # label(negated_conjecture).  [clausify(58)].
49.43/49.72	200 leq(nbr_proc,s(host(c5))).  [copy(199),rewrite([196(3)])].
49.43/49.72	203 elem(m_Down(c8),snoc(queue(host(c9)),m_Ldr(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
49.43/49.72	204 elem(m_Down(c8),snoc(queue(host(c5)),m_Ldr(c3))).  [copy(203),rewrite([196(4)])].
49.43/49.72	205 s(host(c9)) = host(c7) # label(conj) # label(negated_conjecture).  [clausify(58)].
49.43/49.72	206 s(host(c5)) = host(c7).  [copy(205),rewrite([196(2)])].
49.43/49.72	209 setIn(c9,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
49.43/49.72	210 leq(host(c9),A) | -leq(s(zero),A) | host(c8) = A | setIn(A,index(down,host(c9))) # label(conj) # label(negated_conjecture).  [clausify(58)].
49.43/49.72	211 leq(host(c5),A) | -leq(s(zero),A) | host(c8) = A | setIn(A,index(down,host(c5))).  [copy(210),rewrite([196(2),196(12)])].
49.43/49.72	212 setIn(c6,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
49.43/49.72	224 -setIn(A,alive) | index(status,host(c3)) != index(status,host(A)) | -setIn(host(A),index(down,host(B))) | -setIn(B,alive) | leq(index(pendack,host(A)),host(B)).  [back_rewrite(184),rewrite([190(6)]),flip(b)].
49.43/49.72	225 -setIn(A,alive) | -elem(m_Down(B),queue(host(A))) | index(status,host(c3)) != index(status,host(C)) | host(B) != host(C) | -setIn(C,alive) | leq(index(pendack,host(C)),host(A)).  [back_rewrite(182),rewrite([190(10)]),flip(c)].
49.43/49.72	234 host(c5) = c_0.  [new_symbol(198)].
49.43/49.72	235 leq(nbr_proc,s(c_0)).  [back_rewrite(200),rewrite([234(3)])].
49.43/49.72	260 leq(c_0,A) | -leq(s(zero),A) | host(c8) = A | setIn(A,index(down,c_0)).  [back_rewrite(211),rewrite([234(2),234(11)])].
49.43/49.72	262 s(c_0) = host(c7).  [back_rewrite(206),rewrite([234(2)])].
49.43/49.72	263 elem(m_Down(c8),snoc(queue(c_0),m_Ldr(c3))).  [back_rewrite(204),rewrite([234(4)])].
49.43/49.72	265 host(c3) != c_0.  [back_rewrite(198),rewrite([234(2)]),flip(a)].
49.43/49.72	266 host(c9) = c_0.  [back_rewrite(196),rewrite([234(4)])].
49.43/49.72	268 leq(nbr_proc,host(c7)).  [back_rewrite(235),rewrite([262(3)])].
49.43/49.72	284 elem(A,cons(A,B)).  [resolve(102,a,98,a),rewrite([98(2)])].
49.43/49.72	365 host(c4) = nbr_proc.  [resolve(193,a,78,b),unit_del(a,152)].
49.43/49.72	366 index(pendack,host(c3)) = nbr_proc.  [back_rewrite(191),rewrite([365(6)])].
49.43/49.72	375 -elem(m_Down(A),queue(host(c3))) | host(c3) != host(A).  [para(195(a,1),186(a,2,1)),rewrite([195(8)]),flip(b)].
49.43/49.72	379 -setIn(host(c3),index(down,host(A))) | -setIn(A,alive) | leq(nbr_proc,host(A)).  [para(195(a,1),224(c,1)),rewrite([195(10),195(23),366(24)]),xx(b),unit_del(a,212)].
49.43/49.72	414 leq(c_0,host(A)) | host(c8) = host(A) | setIn(host(A),index(down,c_0)).  [resolve(260,b,142,a)].
49.43/49.72	416 host(c7) = A | leq(A,c_0) | -leq(A,host(c7)).  [para(262(a,1),106(c,2)),rewrite([262(2)])].
49.43/49.72	419 -leq(host(c7),c_0).  [para(262(a,1),141(a,1))].
49.43/49.72	421 elem(m_Down(c8),queue(c_0)).  [resolve(263,a,128,c),unit_del(a,77)].
49.43/49.72	440 -elem(m_Down(A),queue(c_0)) | index(status,host(c3)) != index(status,host(B)) | host(A) != host(B) | -setIn(B,alive) | leq(index(pendack,host(B)),c_0).  [para(266(a,1),225(b,2,1)),rewrite([266(25)]),unit_del(a,209)].
49.43/49.72	457 host(c7) = nbr_proc.  [resolve(268,a,78,b),unit_del(a,152)].
49.43/49.72	469 -leq(nbr_proc,c_0).  [back_rewrite(419),rewrite([457(2)])].
49.43/49.72	472 nbr_proc = A | leq(A,c_0) | -leq(A,nbr_proc).  [back_rewrite(416),rewrite([457(2),457(6)])].
49.43/49.72	593 elem(m_Down(c4),queue(host(c3))).  [para(166(a,1),284(a,2))].
49.43/49.72	903 host(c3) != nbr_proc.  [resolve(593,a,375,a),rewrite([365(4)])].
49.43/49.72	2397 host(A) = nbr_proc | leq(host(A),c_0).  [resolve(472,c,152,a),flip(a)].
49.43/49.72	2896 -setIn(host(c3),index(down,c_0)).  [para(266(a,1),379(a,2,2)),rewrite([266(12)]),unit_del(b,209),unit_del(c,469)].
49.43/49.72	3028 leq(c_0,host(c3)) | host(c8) = host(c3).  [resolve(414,c,2896,a)].
49.43/49.72	3226 index(status,host(c3)) != index(status,host(A)) | host(c8) != host(A) | -setIn(A,alive) | leq(index(pendack,host(A)),c_0).  [resolve(440,a,421,a)].
49.43/49.72	3263 host(c8) = host(c3) | -leq(host(c3),c_0).  [resolve(3028,a,78,b),unit_del(c,265)].
49.43/49.72	3270 host(c8) = host(c3).  [resolve(3263,b,2397,b),unit_del(b,903)].
49.43/49.72	3271 index(status,host(c3)) != index(status,host(A)) | host(c3) != host(A) | -setIn(A,alive) | leq(index(pendack,host(A)),c_0).  [back_rewrite(3226),rewrite([3270(10)])].
49.43/49.72	22487 $F.  [resolve(3271,c,187,a),rewrite([366(18)]),xx(a),xx(b),unit_del(a,469)].
49.43/49.72	
49.43/49.72	% SZS output end Refutation
49.43/49.72	============================== end of proof ==========================
49.43/49.72	
49.43/49.72	============================== STATISTICS ============================
49.43/49.72	
49.43/49.72	Given=11247. Generated=3645524. Kept=22409. proofs=1.
49.43/49.72	Usable=8180. Sos=9868. Demods=36. Limbo=0, Disabled=4498. Hints=0.
49.43/49.72	Megabytes=42.19.
49.43/49.72	User_CPU=46.78, System_CPU=1.87, Wall_clock=48.
49.43/49.72	
49.43/49.72	============================== end of statistics =====================
49.43/49.72	
49.43/49.72	============================== end of search =========================
49.43/49.72	
49.43/49.72	THEOREM PROVED
49.43/49.72	% SZS status Theorem
49.43/49.72	
49.43/49.72	Exiting with 1 proof.
49.43/49.72	
49.43/49.72	Process 21978 exit (max_proofs) Thu Aug 29 12:41:36 2019
49.43/49.72	Prover9 interrupted
49.43/49.72	EOF