0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.33	% Computer   : n024.cluster.edu
0.13/0.33	% Model      : x86_64 x86_64
0.13/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory     : 8042.1875MB
0.13/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.33	% CPULimit   : 180
0.13/0.33	% DateTime   : Thu Aug 29 12:58:20 EDT 2019
0.13/0.34	% CPUTime    : 
0.44/1.15	============================== Prover9 ===============================
0.44/1.15	Prover9 (32) version 2009-11A, November 2009.
0.44/1.15	Process 16154 was started by sandbox on n024.cluster.edu,
0.44/1.15	Thu Aug 29 12:58:21 2019
0.44/1.15	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_16000_n024.cluster.edu".
0.44/1.15	============================== end of head ===========================
0.44/1.15	
0.44/1.15	============================== INPUT =================================
0.44/1.15	
0.44/1.15	% Reading from file /tmp/Prover9_16000_n024.cluster.edu
0.44/1.15	
0.44/1.15	set(prolog_style_variables).
0.44/1.15	set(auto2).
0.44/1.15	    % set(auto2) -> set(auto).
0.44/1.15	    % set(auto) -> set(auto_inference).
0.44/1.15	    % set(auto) -> set(auto_setup).
0.44/1.15	    % set(auto_setup) -> set(predicate_elim).
0.44/1.15	    % set(auto_setup) -> assign(eq_defs, unfold).
0.44/1.15	    % set(auto) -> set(auto_limits).
0.44/1.15	    % set(auto_limits) -> assign(max_weight, "100.000").
0.44/1.15	    % set(auto_limits) -> assign(sos_limit, 20000).
0.44/1.15	    % set(auto) -> set(auto_denials).
0.44/1.15	    % set(auto) -> set(auto_process).
0.44/1.15	    % set(auto2) -> assign(new_constants, 1).
0.44/1.15	    % set(auto2) -> assign(fold_denial_max, 3).
0.44/1.15	    % set(auto2) -> assign(max_weight, "200.000").
0.44/1.15	    % set(auto2) -> assign(max_hours, 1).
0.44/1.15	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.44/1.15	    % set(auto2) -> assign(max_seconds, 0).
0.44/1.15	    % set(auto2) -> assign(max_minutes, 5).
0.44/1.15	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.44/1.15	    % set(auto2) -> set(sort_initial_sos).
0.44/1.15	    % set(auto2) -> assign(sos_limit, -1).
0.44/1.15	    % set(auto2) -> assign(lrs_ticks, 3000).
0.44/1.15	    % set(auto2) -> assign(max_megs, 400).
0.44/1.15	    % set(auto2) -> assign(stats, some).
0.44/1.15	    % set(auto2) -> clear(echo_input).
0.44/1.15	    % set(auto2) -> set(quiet).
0.44/1.15	    % set(auto2) -> clear(print_initial_clauses).
0.44/1.15	    % set(auto2) -> clear(print_given).
0.44/1.15	assign(lrs_ticks,-1).
0.44/1.15	assign(sos_limit,10000).
0.44/1.15	assign(order,kbo).
0.44/1.15	set(lex_order_vars).
0.44/1.15	clear(print_given).
0.44/1.15	
0.44/1.15	% formulas(sos).  % not echoed (67 formulas)
0.44/1.15	
0.44/1.15	============================== end of input ==========================
0.44/1.15	
0.44/1.15	% From the command line: assign(max_seconds, 180).
0.44/1.15	
0.44/1.15	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.44/1.15	
0.44/1.15	% Formulas that are not ordinary clauses:
0.44/1.15	1 (all X all Y (Y != X <-> m_NotNorm(Y) != m_NotNorm(X))) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.44/1.15	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.44/1.15	3 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.44/1.15	4 (all X all Y (m_Down(Y) != m_Down(X) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.44/1.15	5 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.44/1.15	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.44/1.15	7 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.44/1.15	8 (all X all Y (Y != X <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.44/1.15	9 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.44/1.15	10 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.44/1.15	11 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.44/1.15	12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.44/1.15	13 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.44/1.15	14 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.44/1.15	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.44/1.15	16 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.44/1.15	17 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	18 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	19 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	20 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	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.44/1.16	22 (all X X = pidMsg(m_Down(X))) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	23 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	24 (all Q (Q = cons(head(Q),tail(Q)) | q_nil = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	25 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	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.44/1.16	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.44/1.16	28 (all P all Q (s(host(P)) = host(Q) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	29 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	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.44/1.16	31 (all X all Q Q = tail(cons(X,Q))) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	32 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	33 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	34 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	35 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	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.44/1.16	37 (all Q (q_nil = Q | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	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.44/1.16	39 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	40 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	41 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	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.44/1.16	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.44/1.16	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.44/1.16	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.44/1.16	46 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	47 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	48 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	49 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	50 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	51 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	52 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	53 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	54 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	55 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	56 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	57 (all X all Y (m_Halt(Y) != m_Halt(X) <-> X != Y)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.44/1.16	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_Halt(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) & (all Y all Z (elec_1 = index(status,host(Z)) & setIn(Z,alive) -> -elem(m_Ack(Z,Y),queue(host(Z))))) & (all Y all Z (setIn(Z,alive) & index(status,host(Z)) = elec_2 & elec_2 = index(status,host(Y)) & setIn(Y,alive) & -leq(host(Y),host(Z)) -> leq(index(pendack,host(Z)),host(Y)))) & (all Y all Z all Pid0 (-leq(index(pendack,host(Pid0)),host(Y)) & setIn(Pid0,alive) & elem(m_Halt(Pid0),queue(host(Z))) & elec_2 = index(status,host(Pid0)) -> -(setIn(Y,alive) & norm = index(status,host(Y)) & index(ldr,host(Y)) = host(Y)))) & (all Y all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid0))) & leq(nbr_proc,s(index(pendack,host(Pid0)))) & s(index(pendack,host(Pid0))) = host(Pid20) & host(Z) = index(pendack,host(Pid0)) & elec_2 = index(status,host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) & setIn(Pid0,alive) -> -(setIn(Y,alive) & norm = index(status,host(Y)) & index(ldr,host(Y)) = host(Y)))) & cons(m_Halt(X),V) = queue(host(W)) & (all Y all Z all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> V0 = host(Pid20) | setIn(V0,index(down,host(Pid0))))) & elec_1 = index(status,host(Pid0)) & nbr_proc = host(Pid0) & host(Pid0) = host(Z) & elem(m_Down(Pid20),queue(host(Pid0))) -> -(elem(m_Down(Z),queue(host(Y))) & setIn(Y,alive)))) & (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 Pid0 (setIn(Pid0,alive) & host(Z) = host(Pid0) & elec_2 = index(status,host(Y)) & elec_2 = index(status,host(Pid0)) & setIn(Y,alive) -> -elem(m_Ack(Y,Z),queue(host(Y))))) & (all Y all Z all Pid0 (setIn(Pid0,alive) & elem(m_Down(Z),queue(host(Pid0))) & host(Y) = host(Z) -> -(setIn(Y,alive) & index(ldr,host(Y)) = host(Y) & norm = index(status,host(Y))))) & (all Y (setIn(Y,alive) & (index(status,host(Y)) = elec_1 | elec_2 = index(status,host(Y))) -> index(elid,host(Y)) = Y)) & (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 (Y != Z & host(Y) = host(Z) -> -setIn(Z,alive) | -setIn(Y,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_Down(Z),queue(host(Y))) -> host(Y) != host(Z))) -> (setIn(W,alive) -> (all Y (host(W) != host(Y) -> (all Z all X0 all Y0 (host(X) = host(Y0) -> (host(W) != host(Y0) -> (leq(nbr_proc,s(index(pendack,host(Y0)))) & elem(m_Down(X0),snoc(queue(host(Y0)),m_Ack(X,W))) & elem(m_Ack(Y0,Z),snoc(queue(host(Y0)),m_Ack(X,W))) & elec_2 = index(status,host(Y0)) & host(X0) = s(index(pendack,host(Y0))) & index(pendack,host(Y0)) = host(Z) & setIn(Y0,alive) -> -(norm = index(status,host(Y)) & index(ldr,host(Y)) = host(Y) & setIn(Y,alive))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.44/1.16	
0.44/1.16	============================== end of process non-clausal formulas ===
0.44/1.16	
0.44/1.16	============================== PROCESS INITIAL CLAUSES ===============
0.44/1.16	
0.44/1.16	============================== PREDICATE ELIMINATION =================
1.88/2.20	
1.88/2.20	============================== end predicate elimination =============
1.88/2.20	
1.88/2.20	Auto_denials:  (non-Horn, no changes).
1.88/2.20	
1.88/2.20	Term ordering decisions:
1.88/2.20	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_Ldr=1. m_NormQ=1. m_NotNorm=1. head=1. init=1. last=1. tail=1. f1=1. f4=1.
1.88/2.20	
1.88/2.20	============================== end of process initial clauses ========
1.88/2.20	
1.88/2.20	============================== CLAUSES FOR SEARCH ====================
1.88/2.20	
1.88/2.20	============================== end of clauses for search =============
1.88/2.20	
1.88/2.20	============================== SEARCH ================================
1.88/2.20	
1.88/2.20	% Starting search at 0.03 seconds.
1.88/2.20	
1.88/2.20	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 75 (0.00 of 0.27 sec).
1.88/2.20	
1.88/2.20	Low Water (keep): wt=18.000, iters=3769
1.88/2.20	
1.88/2.20	Low Water (keep): wt=17.000, iters=3512
1.88/2.20	
1.88/2.20	Low Water (keep): wt=16.000, iters=3334
1.88/2.20	
1.88/2.20	============================== PROOF =================================
1.88/2.20	% SZS status Theorem
1.88/2.20	% SZS output start Refutation
1.88/2.20	
1.88/2.20	% Proof 1 at 1.03 (+ 0.03) seconds.
1.88/2.20	% Length of proof is 80.
1.88/2.20	% Level of proof is 15.
1.88/2.20	% Maximum clause weight is 65.000.
1.88/2.20	% Given clauses 1029.
1.88/2.20	
1.88/2.20	13 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
1.88/2.20	22 (all X X = pidMsg(m_Down(X))) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
1.88/2.20	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].
1.88/2.20	27 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
1.88/2.20	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].
1.88/2.20	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].
1.88/2.20	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].
1.88/2.20	52 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
1.88/2.20	54 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
1.88/2.20	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_Halt(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) & (all Y all Z (elec_1 = index(status,host(Z)) & setIn(Z,alive) -> -elem(m_Ack(Z,Y),queue(host(Z))))) & (all Y all Z (setIn(Z,alive) & index(status,host(Z)) = elec_2 & elec_2 = index(status,host(Y)) & setIn(Y,alive) & -leq(host(Y),host(Z)) -> leq(index(pendack,host(Z)),host(Y)))) & (all Y all Z all Pid0 (-leq(index(pendack,host(Pid0)),host(Y)) & setIn(Pid0,alive) & elem(m_Halt(Pid0),queue(host(Z))) & elec_2 = index(status,host(Pid0)) -> -(setIn(Y,alive) & norm = index(status,host(Y)) & index(ldr,host(Y)) = host(Y)))) & (all Y all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid0))) & leq(nbr_proc,s(index(pendack,host(Pid0)))) & s(index(pendack,host(Pid0))) = host(Pid20) & host(Z) = index(pendack,host(Pid0)) & elec_2 = index(status,host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) & setIn(Pid0,alive) -> -(setIn(Y,alive) & norm = index(status,host(Y)) & index(ldr,host(Y)) = host(Y)))) & cons(m_Halt(X),V) = queue(host(W)) & (all Y all Z all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> V0 = host(Pid20) | setIn(V0,index(down,host(Pid0))))) & elec_1 = index(status,host(Pid0)) & nbr_proc = host(Pid0) & host(Pid0) = host(Z) & elem(m_Down(Pid20),queue(host(Pid0))) -> -(elem(m_Down(Z),queue(host(Y))) & setIn(Y,alive)))) & (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 Pid0 (setIn(Pid0,alive) & host(Z) = host(Pid0) & elec_2 = index(status,host(Y)) & elec_2 = index(status,host(Pid0)) & setIn(Y,alive) -> -elem(m_Ack(Y,Z),queue(host(Y))))) & (all Y all Z all Pid0 (setIn(Pid0,alive) & elem(m_Down(Z),queue(host(Pid0))) & host(Y) = host(Z) -> -(setIn(Y,alive) & index(ldr,host(Y)) = host(Y) & norm = index(status,host(Y))))) & (all Y (setIn(Y,alive) & (index(status,host(Y)) = elec_1 | elec_2 = index(status,host(Y))) -> index(elid,host(Y)) = Y)) & (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 (Y != Z & host(Y) = host(Z) -> -setIn(Z,alive) | -setIn(Y,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_Down(Z),queue(host(Y))) -> host(Y) != host(Z))) -> (setIn(W,alive) -> (all Y (host(W) != host(Y) -> (all Z all X0 all Y0 (host(X) = host(Y0) -> (host(W) != host(Y0) -> (leq(nbr_proc,s(index(pendack,host(Y0)))) & elem(m_Down(X0),snoc(queue(host(Y0)),m_Ack(X,W))) & elem(m_Ack(Y0,Z),snoc(queue(host(Y0)),m_Ack(X,W))) & elec_2 = index(status,host(Y0)) & host(X0) = s(index(pendack,host(Y0))) & index(pendack,host(Y0)) = host(Z) & setIn(Y0,alive) -> -(norm = index(status,host(Y)) & index(ldr,host(Y)) = host(Y) & setIn(Y,alive))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
1.88/2.20	78 -leq(A,B) | -leq(B,A) | A = B # label(axiom_61) # label(axiom).  [clausify(13)].
1.88/2.20	97 pidMsg(m_Down(A)) = A # label(axiom_50) # label(axiom).  [clausify(22)].
1.88/2.20	101 A != B | elem(B,cons(A,C)) # label(axiom_46) # label(axiom).  [clausify(26)].
1.88/2.20	105 s(A) = B | leq(B,A) | -leq(B,s(A)) # label(axiom_64) # label(axiom).  [clausify(27)].
1.88/2.20	117 A = B | m_Ack(C,A) != m_Ack(D,B) # label(axiom_32) # label(axiom).  [clausify(36)].
1.88/2.20	127 A = B | elem(B,C) | -elem(B,snoc(C,A)) # label(axiom_47) # label(axiom).  [clausify(42)].
1.88/2.20	135 A = B | m_Ack(A,C) != m_Ack(B,D) # label(axiom_31) # label(axiom).  [clausify(44)].
1.88/2.20	150 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom).  [clausify(52)].
1.88/2.20	152 m_Ack(A,B) != m_Down(C) # label(axiom_12) # label(axiom).  [clausify(54)].
1.88/2.20	162 leq(index(pendack,host(A)),host(B)) | -setIn(A,alive) | -elem(m_Halt(A),queue(host(C))) | index(status,host(A)) != elec_2 | -setIn(B,alive) | index(status,host(B)) != norm | index(ldr,host(B)) != host(B) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.88/2.20	163 -elem(m_Ack(A,B),queue(host(A))) | -leq(nbr_proc,s(index(pendack,host(A)))) | s(index(pendack,host(A))) != host(C) | index(pendack,host(A)) != host(B) | index(status,host(A)) != elec_2 | -elem(m_Down(C),queue(host(A))) | -setIn(A,alive) | -setIn(D,alive) | index(status,host(D)) != norm | index(ldr,host(D)) != host(D) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.88/2.20	164 queue(host(c2)) = cons(m_Halt(c3),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.88/2.20	165 cons(m_Halt(c3),c1) = queue(host(c2)).  [copy(164),flip(a)].
1.88/2.20	173 -setIn(A,alive) | -elem(m_Down(B),queue(host(A))) | host(B) != host(C) | -setIn(C,alive) | index(ldr,host(C)) != host(C) | index(status,host(C)) != norm # label(conj) # label(negated_conjecture).  [clausify(58)].
1.88/2.20	181 host(c2) != host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.88/2.20	182 host(c4) != host(c2).  [copy(181),flip(a)].
1.88/2.20	183 host(c7) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.88/2.20	186 leq(nbr_proc,s(index(pendack,host(c7)))) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.88/2.20	187 leq(nbr_proc,s(index(pendack,host(c3)))).  [copy(186),rewrite([183(4)])].
1.88/2.20	188 elem(m_Down(c6),snoc(queue(host(c7)),m_Ack(c3,c2))) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.88/2.20	189 elem(m_Down(c6),snoc(queue(host(c3)),m_Ack(c3,c2))).  [copy(188),rewrite([183(4)])].
1.88/2.20	190 elem(m_Ack(c7,c5),snoc(queue(host(c7)),m_Ack(c3,c2))) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.88/2.20	191 elem(m_Ack(c7,c5),snoc(queue(host(c3)),m_Ack(c3,c2))).  [copy(190),rewrite([183(5)])].
1.88/2.20	192 index(status,host(c7)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
1.88/2.20	193 elec_2 = index(status,host(c3)).  [copy(192),rewrite([183(3)]),flip(a)].
1.88/2.20	194 s(index(pendack,host(c7))) = host(c6) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.88/2.20	195 s(index(pendack,host(c3))) = host(c6).  [copy(194),rewrite([183(3)])].
1.88/2.20	196 index(pendack,host(c7)) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.88/2.20	197 index(pendack,host(c3)) = host(c5).  [copy(196),rewrite([183(3)])].
1.88/2.20	198 setIn(c7,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.88/2.20	199 index(status,host(c4)) = norm # label(conj) # label(negated_conjecture).  [clausify(58)].
1.88/2.20	200 norm = index(status,host(c4)).  [copy(199),flip(a)].
1.88/2.20	201 index(ldr,host(c4)) = host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.88/2.20	202 setIn(c4,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.88/2.20	210 host(c4) = c_0.  [new_symbol(182)].
1.88/2.20	214 -elem(m_Ack(A,B),queue(host(A))) | -leq(nbr_proc,s(index(pendack,host(A)))) | s(index(pendack,host(A))) != host(C) | index(pendack,host(A)) != host(B) | index(status,host(c3)) != index(status,host(A)) | -elem(m_Down(C),queue(host(A))) | -setIn(A,alive) | -setIn(D,alive) | index(status,host(D)) != index(status,c_0) | index(ldr,host(D)) != host(D).  [back_rewrite(163),rewrite([193(25),200(41),210(43)]),flip(e)].
1.88/2.20	215 leq(index(pendack,host(A)),host(B)) | -setIn(A,alive) | -elem(m_Halt(A),queue(host(C))) | index(status,host(c3)) != index(status,host(A)) | -setIn(B,alive) | index(status,host(B)) != index(status,c_0) | index(ldr,host(B)) != host(B).  [back_rewrite(162),rewrite([193(15),200(25),210(27)]),flip(d)].
1.88/2.20	220 leq(nbr_proc,s(host(c5))).  [back_rewrite(187),rewrite([197(5)])].
1.88/2.20	221 s(host(c5)) = host(c6).  [back_rewrite(195),rewrite([197(4)])].
1.88/2.20	222 -setIn(A,alive) | -elem(m_Down(B),queue(host(A))) | host(B) != host(C) | -setIn(C,alive) | index(ldr,host(C)) != host(C) | index(status,host(C)) != index(status,c_0).  [back_rewrite(173),rewrite([200(20),210(22)])].
1.88/2.20	227 index(ldr,c_0) = c_0.  [back_rewrite(201),rewrite([210(3),210(5)])].
1.88/2.20	229 host(c2) != c_0.  [back_rewrite(182),rewrite([210(2)]),flip(a)].
1.88/2.20	230 leq(nbr_proc,host(c6)).  [back_rewrite(220),rewrite([221(4)])].
1.88/2.20	246 elem(A,cons(A,B)).  [resolve(101,a,97,a),rewrite([97(2)])].
1.88/2.20	332 elem(m_Down(c6),queue(host(c3))).  [resolve(189,a,127,c),unit_del(a,152)].
1.88/2.20	338 m_Ack(c7,c5) = m_Ack(c3,c2) | elem(m_Ack(c7,c5),queue(host(c3))).  [resolve(191,a,127,c),flip(a)].
1.88/2.20	359 leq(c_0,nbr_proc).  [para(210(a,1),150(a,1))].
1.88/2.20	374 -elem(m_Ack(c7,A),queue(host(c3))) | host(c6) != host(B) | host(c5) != host(A) | -elem(m_Down(B),queue(host(c3))) | -setIn(C,alive) | index(status,host(C)) != index(status,c_0) | index(ldr,host(C)) != host(C).  [resolve(214,g,198,a),rewrite([183(4),183(10),197(11),221(10),183(13),197(14),221(13),183(17),197(18),183(25),183(30)]),xx(e),unit_del(b,230)].
1.88/2.20	379 leq(index(pendack,host(A)),c_0) | -setIn(A,alive) | -elem(m_Halt(A),queue(host(B))) | index(status,host(c3)) != index(status,host(A)).  [resolve(215,e,202,a),rewrite([210(5),210(22),210(29),227(29),210(29)]),xx(e),xx(f)].
1.88/2.20	386 host(c6) = A | leq(A,host(c5)) | -leq(A,host(c6)).  [para(221(a,1),105(c,2)),rewrite([221(3)])].
1.88/2.20	394 -setIn(A,alive) | -elem(m_Down(B),queue(host(A))) | host(B) != c_0.  [resolve(222,d,202,a),rewrite([210(9),210(12),227(12),210(12),210(15)]),xx(d),xx(e)].
1.88/2.20	401 host(c6) = nbr_proc.  [resolve(230,a,78,b),unit_del(a,150)].
1.88/2.20	406 nbr_proc = A | leq(A,host(c5)) | -leq(A,nbr_proc).  [back_rewrite(386),rewrite([401(2),401(7)])].
1.88/2.20	408 -elem(m_Ack(c7,A),queue(host(c3))) | host(B) != nbr_proc | host(c5) != host(A) | -elem(m_Down(B),queue(host(c3))) | -setIn(C,alive) | index(status,host(C)) != index(status,c_0) | index(ldr,host(C)) != host(C).  [back_rewrite(374),rewrite([401(8)]),flip(b)].
1.88/2.20	451 elem(m_Halt(c3),queue(host(c2))).  [para(165(a,1),246(a,2))].
1.88/2.20	576 -elem(m_Down(A),queue(host(c3))) | host(A) != c_0.  [resolve(394,a,198,a),rewrite([183(3)])].
1.88/2.20	619 c_0 != nbr_proc.  [resolve(332,a,576,a),rewrite([401(2)]),flip(a)].
1.88/2.20	884 -elem(m_Ack(c7,A),queue(host(c3))) | host(B) != nbr_proc | host(c5) != host(A) | -elem(m_Down(B),queue(host(c3))).  [resolve(408,e,202,a),rewrite([210(21),210(28),227(28),210(28)]),xx(e),xx(f)].
1.88/2.20	890 -elem(m_Ack(c7,A),queue(host(c3))) | host(c5) != host(A).  [resolve(884,d,332,a),rewrite([401(8)]),xx(b)].
1.88/2.20	2252 m_Ack(c7,c5) = m_Ack(c3,c2).  [resolve(338,b,890,a),xx(b)].
1.88/2.20	2264 c7 = c3.  [resolve(2252,a,135,b)].
1.88/2.20	2266 c5 = c2.  [resolve(2252,a,117,b)].
1.88/2.20	2323 setIn(c3,alive).  [back_rewrite(198),rewrite([2264(1)])].
1.88/2.20	2380 nbr_proc = A | leq(A,host(c2)) | -leq(A,nbr_proc).  [back_rewrite(406),rewrite([2266(3)])].
1.88/2.20	2388 index(pendack,host(c3)) = host(c2).  [back_rewrite(197),rewrite([2266(5)])].
1.88/2.20	2554 leq(host(c2),c_0) | -elem(m_Halt(c3),queue(host(A))).  [resolve(379,b,2323,a),rewrite([2388(4)]),xx(c)].
1.88/2.20	6387 leq(c_0,host(c2)).  [resolve(2380,c,359,a),flip(a),unit_del(a,619)].
1.88/2.20	6396 -leq(host(c2),c_0).  [resolve(6387,a,78,b),unit_del(b,229)].
1.88/2.20	6397 -elem(m_Halt(c3),queue(host(A))).  [back_unit_del(2554),unit_del(a,6396)].
1.88/2.20	6398 $F.  [resolve(6397,a,451,a)].
1.88/2.20	
1.88/2.20	% SZS output end Refutation
1.88/2.20	============================== end of proof ==========================
1.88/2.20	
1.88/2.20	============================== STATISTICS ============================
1.88/2.20	
1.88/2.20	Given=1029. Generated=40567. Kept=6323. proofs=1.
1.88/2.20	Usable=980. Sos=5089. Demods=36. Limbo=1, Disabled=382. Hints=0.
1.88/2.20	Megabytes=10.90.
1.88/2.20	User_CPU=1.03, System_CPU=0.03, Wall_clock=1.
1.88/2.20	
1.88/2.20	============================== end of statistics =====================
1.88/2.20	
1.88/2.20	============================== end of search =========================
1.88/2.20	
1.88/2.20	THEOREM PROVED
1.88/2.20	% SZS status Theorem
1.88/2.20	
1.88/2.20	Exiting with 1 proof.
1.88/2.20	
1.88/2.20	Process 16154 exit (max_proofs) Thu Aug 29 12:58:22 2019
1.88/2.20	Prover9 interrupted
1.88/2.20	EOF