0.06/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.11	% Command    : tptp2X_and_run_prover9 %d %s
0.11/0.32	% Computer   : n028.cluster.edu
0.11/0.32	% Model      : x86_64 x86_64
0.11/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory     : 8042.1875MB
0.11/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 960
0.11/0.32	% DateTime   : Thu Jul  2 08:00:36 EDT 2020
0.11/0.32	% CPUTime    : 
0.89/1.17	============================== Prover9 ===============================
0.89/1.17	Prover9 (32) version 2009-11A, November 2009.
0.89/1.17	Process 29462 was started by sandbox2 on n028.cluster.edu,
0.89/1.17	Thu Jul  2 08:00:37 2020
0.89/1.17	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_29309_n028.cluster.edu".
0.89/1.17	============================== end of head ===========================
0.89/1.17	
0.89/1.17	============================== INPUT =================================
0.89/1.17	
0.89/1.17	% Reading from file /tmp/Prover9_29309_n028.cluster.edu
0.89/1.17	
0.89/1.17	set(prolog_style_variables).
0.89/1.17	set(auto2).
0.89/1.17	    % set(auto2) -> set(auto).
0.89/1.17	    % set(auto) -> set(auto_inference).
0.89/1.17	    % set(auto) -> set(auto_setup).
0.89/1.17	    % set(auto_setup) -> set(predicate_elim).
0.89/1.17	    % set(auto_setup) -> assign(eq_defs, unfold).
0.89/1.17	    % set(auto) -> set(auto_limits).
0.89/1.17	    % set(auto_limits) -> assign(max_weight, "100.000").
0.89/1.17	    % set(auto_limits) -> assign(sos_limit, 20000).
0.89/1.17	    % set(auto) -> set(auto_denials).
0.89/1.17	    % set(auto) -> set(auto_process).
0.89/1.17	    % set(auto2) -> assign(new_constants, 1).
0.89/1.17	    % set(auto2) -> assign(fold_denial_max, 3).
0.89/1.17	    % set(auto2) -> assign(max_weight, "200.000").
0.89/1.17	    % set(auto2) -> assign(max_hours, 1).
0.89/1.17	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.89/1.17	    % set(auto2) -> assign(max_seconds, 0).
0.89/1.17	    % set(auto2) -> assign(max_minutes, 5).
0.89/1.17	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.89/1.17	    % set(auto2) -> set(sort_initial_sos).
0.89/1.17	    % set(auto2) -> assign(sos_limit, -1).
0.89/1.17	    % set(auto2) -> assign(lrs_ticks, 3000).
0.89/1.17	    % set(auto2) -> assign(max_megs, 400).
0.89/1.17	    % set(auto2) -> assign(stats, some).
0.89/1.17	    % set(auto2) -> clear(echo_input).
0.89/1.17	    % set(auto2) -> set(quiet).
0.89/1.17	    % set(auto2) -> clear(print_initial_clauses).
0.89/1.17	    % set(auto2) -> clear(print_given).
0.89/1.17	assign(lrs_ticks,-1).
0.89/1.17	assign(sos_limit,10000).
0.89/1.17	assign(order,kbo).
0.89/1.17	set(lex_order_vars).
0.89/1.17	clear(print_given).
0.89/1.17	
0.89/1.17	% formulas(sos).  % not echoed (67 formulas)
0.89/1.17	
0.89/1.17	============================== end of input ==========================
0.89/1.17	
0.89/1.17	% From the command line: assign(max_seconds, 960).
0.89/1.17	
0.89/1.17	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.89/1.17	
0.89/1.17	% Formulas that are not ordinary clauses:
0.89/1.17	1 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	2 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	3 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	4 (all X all Y (m_NormQ(X) != m_NormQ(Y) <-> Y != X)) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	5 (all X all Y all Z m_Ldr(Z) != m_Ack(X,Y)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	6 (all Q (q_nil = Q | cons(head(Q),tail(Q)) = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	7 (all X all Q ((all Y (pidElem(X) & pidElem(Y) & elem(Y,Q) & host(pidMsg(X)) = host(pidMsg(Y)) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q) <-> ordered(snoc(Q,X)))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	8 (all X (pidElem(X) <-> (exists Y (X = m_Down(Y) | X = m_Halt(Y))))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	9 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	10 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	11 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	12 (all Q all X all Y (host(Y) = host(X) & ordered(cons(m_Halt(X),Q)) & elem(m_Down(Y),Q) -> leq(X,Y))) # label(axiom_57) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	13 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	14 (all X all Y m_NormQ(Y) != m_Ldr(X)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	15 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	16 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	17 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	18 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	19 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	20 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	21 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	22 (all X all Y (m_Down(X) != m_Down(Y) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	23 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	24 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	25 (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.89/1.17	26 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	27 (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.89/1.17	28 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	29 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	30 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	31 (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.89/1.17	32 (all X all Y all Q (elem(X,snoc(Q,Y)) <-> X = Y | elem(X,Q))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	33 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	34 (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.89/1.17	35 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	36 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	37 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,cons(Y,Q)))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	38 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	39 (all X all Q cons(X,Q) != q_nil) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	40 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	41 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	42 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	43 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	44 (all X1 all X2 all Y1 all Y2 (Y2 != Y1 -> m_Ack(X2,Y2) != m_Ack(X1,Y1))) # label(axiom_32) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	45 (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.89/1.17	46 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	47 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	48 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	49 (all Q (Q = q_nil | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.89/1.17	51 (all X all Y (m_NotNorm(X) != m_NotNorm(Y) <-> X != Y)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.89/1.18	52 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.89/1.18	53 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.89/1.18	54 (all X all Y (m_Halt(Y) != m_Halt(X) <-> Y != X)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.89/1.18	55 (all X all Q (ordered(cons(X,Q)) <-> ordered(Q) & (all Y (pidElem(X) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) & elem(Y,Q) -> leq(pidMsg(X),pidMsg(Y)))))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
0.89/1.18	56 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.89/1.18	57 (all X all Y all Z m_NormQ(Z) != m_Ack(X,Y)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.89/1.18	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 (elem(m_Down(Pid0),queue(host(Z))) -> host(Z) != host(Pid0))) & (all Z all Pid0 (Z != Pid0 & host(Z) = host(Pid0) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z))) & elec_2 = index(status,host(Pid0)) & setIn(Pid0,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (norm = index(status,host(Pid0)) & host(Pid0) = index(ldr,host(Pid0)) & host(Pid0) = host(Pid20) & setIn(Pid0,alive) -> -(elem(m_Down(Pid20),queue(host(Z))) & setIn(Z,alive)))) & (all Z all Pid0 (setIn(Z,alive) & host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm & norm = index(status,host(Pid0)) & host(Pid0) = index(ldr,host(Pid0)) & setIn(Pid0,alive) -> Z = Pid0)) & (all Z all Pid20 all Pid0 (host(Pid20) != host(Pid0) & setIn(Pid0,alive) & host(Pid20) = host(index(elid,host(Pid0))) & wait = index(status,host(Pid0)) & host(Pid20) = host(Z) & elem(m_Down(Z),queue(host(Pid0))) -> -(setIn(Pid20,alive) & host(Pid20) = index(ldr,host(Pid20)) & norm = index(status,host(Pid20))))) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Pid0,alive) & leq(nbr_proc,s(host(Pid0))) & elem(m_Down(Pid20),queue(host(Pid0))) & elem(m_Down(Pid30),queue(host(Pid0))) & elec_1 = index(status,host(Pid0)) & host(Pid30) = s(host(Pid0)) & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> V0 = host(Pid20) | setIn(V0,index(down,host(Pid0))))) -> -(host(Z) = index(ldr,host(Z)) & norm = index(status,host(Z)) & setIn(Z,alive)))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid30 all Pid20 all Pid0 (elec_2 = index(status,host(Z)) & elec_1 = index(status,host(Pid0)) & host(Pid0) = host(Pid30) & elem(m_Down(Pid20),queue(host(Pid0))) & leq(host(Z),host(Pid0)) & setIn(Z,alive) & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> V0 = host(Pid20) | setIn(V0,index(down,host(Pid0))))) -> -elem(m_Ack(Z,Pid30),queue(host(Z))))) & (all Z all Pid20 all Pid0 (host(Pid20) = host(Z) & index(ldr,host(Pid0)) = host(Pid20) & index(status,host(Pid0)) = norm & elem(m_Down(Z),queue(host(Pid0))) & setIn(Pid0,alive) & host(Pid0) != host(Pid20) -> -(setIn(Pid20,alive) & index(ldr,host(Pid20)) = host(Pid20) & index(status,host(Pid20)) = norm))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) = host(Pid0) & host(Pid30) = host(Z) & setIn(Pid20,alive) & setIn(Z,alive) & host(Z) != host(Pid20) -> -(elem(m_Down(Pid0),queue(host(Z))) & setIn(host(Pid30),index(down,host(Pid20)))))) & (all Z all Pid30 all Pid20 all Pid0 (host(Z) != host(Pid20) & setIn(Pid20,alive) & host(Z) = host(Pid30) & host(Pid0) = host(Pid20) & setIn(Z,alive) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & host(Z) = host(Pid20) & setIn(Pid0,alive) & -leq(host(Pid20),host(Pid0)) -> -(setIn(Z,alive) & norm = index(status,host(Z)) & host(Z) = index(ldr,host(Z))))) & (all Z all Pid20 all Pid0 (host(Pid0) = host(Pid20) & index(status,host(Pid0)) = elec_2 & elem(m_Down(Pid20),queue(host(Z))) & setIn(Pid0,alive) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (index(ldr,host(Pid0)) = host(Pid0) & index(status,host(Pid0)) = norm & setIn(Pid0,alive) -> -(setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z)))))) & (all Z (setIn(Z,alive) & (elec_2 = index(status,host(Z)) | elec_1 = index(status,host(Z))) -> index(elid,host(Z)) = Z)) -> (setIn(X,alive) -> (leq(host(X),host(Y)) -> (host(Y) = index(pendack,host(X)) & elec_2 = index(status,host(X)) -> (leq(nbr_proc,index(pendack,host(X))) -> (all Z (setIn(host(Z),index(acks,host(X))) -> (all V0 (host(X) = host(V0) -> (all W0 all X0 all Y0 (host(Z) != host(Y0) -> (host(X) != host(Y0) -> ((all V1 (-leq(host(Y0),V1) & leq(s(zero),V1) -> V1 = host(X0) | setIn(V1,index(down,host(Y0))))) & elem(m_Down(W0),queue(host(Y0))) & elem(m_Down(X0),queue(host(Y0))) & elec_1 = index(status,host(Y0)) & host(W0) = s(host(Y0)) & leq(nbr_proc,s(host(Y0))) & setIn(Y0,alive) -> -(setIn(V0,alive) & host(X) = host(V0)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
85.95/86.43	
85.95/86.43	============================== end of process non-clausal formulas ===
85.95/86.43	
85.95/86.43	============================== PROCESS INITIAL CLAUSES ===============
85.95/86.43	
85.95/86.43	============================== PREDICATE ELIMINATION =================
85.95/86.43	
85.95/86.43	============================== end predicate elimination =============
85.95/86.43	
85.95/86.43	Auto_denials:  (non-Horn, no changes).
85.95/86.43	
85.95/86.43	Term ordering decisions:
85.95/86.43	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. cons=1. snoc=1. m_Ack=1. f1=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. f2=1. f4=1. f5=1.
85.95/86.43	
85.95/86.43	============================== end of process initial clauses ========
85.95/86.43	
85.95/86.43	============================== CLAUSES FOR SEARCH ====================
85.95/86.43	
85.95/86.43	============================== end of clauses for search =============
85.95/86.43	
85.95/86.43	============================== SEARCH ================================
85.95/86.43	
85.95/86.43	% Starting search at 0.04 seconds.
85.95/86.43	
85.95/86.43	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 185 (0.00 of 0.47 sec).
85.95/86.43	
85.95/86.43	Low Water (keep): wt=63.000, iters=3393
85.95/86.43	
85.95/86.43	Low Water (keep): wt=62.000, iters=3373
85.95/86.43	
85.95/86.43	Low Water (keep): wt=56.000, iters=3335
85.95/86.43	
85.95/86.43	Low Water (keep): wt=54.000, iters=3455
85.95/86.43	
85.95/86.43	Low Water (keep): wt=42.000, iters=3356
85.95/86.43	
85.95/86.43	Low Water (keep): wt=16.000, iters=4226
85.95/86.43	
85.95/86.43	Low Water (keep): wt=15.000, iters=3355
85.95/86.43	
85.95/86.43	Low Water (displace): id=4231, wt=117.000
85.95/86.43	
85.95/86.43	Low Water (displace): id=4222, wt=115.000
85.95/86.43	
85.95/86.43	Low Water (displace): id=4228, wt=110.000
85.95/86.43	
85.95/86.43	Low Water (displace): id=4257, wt=106.000
85.95/86.43	
85.95/86.43	Low Water (displace): id=12093, wt=15.000
85.95/86.43	
85.95/86.43	Low Water (displace): id=13458, wt=14.000
85.95/86.43	
85.95/86.43	============================== PROOF =================================
85.95/86.43	% SZS status Theorem
85.95/86.43	% SZS output start Refutation
85.95/86.43	
85.95/86.43	% Proof 1 at 82.38 (+ 2.75) seconds.
85.95/86.43	% Length of proof is 64.
85.95/86.43	% Level of proof is 10.
85.95/86.43	% Maximum clause weight is 34.000.
85.95/86.43	% Given clauses 8961.
85.95/86.43	
85.95/86.43	9 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
85.95/86.43	24 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
85.95/86.43	33 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
85.95/86.43	37 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,cons(Y,Q)))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
85.95/86.43	43 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
85.95/86.43	46 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
85.95/86.43	52 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
85.95/86.43	53 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
85.95/86.43	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 (elem(m_Down(Pid0),queue(host(Z))) -> host(Z) != host(Pid0))) & (all Z all Pid0 (Z != Pid0 & host(Z) = host(Pid0) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z))) & elec_2 = index(status,host(Pid0)) & setIn(Pid0,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (norm = index(status,host(Pid0)) & host(Pid0) = index(ldr,host(Pid0)) & host(Pid0) = host(Pid20) & setIn(Pid0,alive) -> -(elem(m_Down(Pid20),queue(host(Z))) & setIn(Z,alive)))) & (all Z all Pid0 (setIn(Z,alive) & host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm & norm = index(status,host(Pid0)) & host(Pid0) = index(ldr,host(Pid0)) & setIn(Pid0,alive) -> Z = Pid0)) & (all Z all Pid20 all Pid0 (host(Pid20) != host(Pid0) & setIn(Pid0,alive) & host(Pid20) = host(index(elid,host(Pid0))) & wait = index(status,host(Pid0)) & host(Pid20) = host(Z) & elem(m_Down(Z),queue(host(Pid0))) -> -(setIn(Pid20,alive) & host(Pid20) = index(ldr,host(Pid20)) & norm = index(status,host(Pid20))))) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Pid0,alive) & leq(nbr_proc,s(host(Pid0))) & elem(m_Down(Pid20),queue(host(Pid0))) & elem(m_Down(Pid30),queue(host(Pid0))) & elec_1 = index(status,host(Pid0)) & host(Pid30) = s(host(Pid0)) & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> V0 = host(Pid20) | setIn(V0,index(down,host(Pid0))))) -> -(host(Z) = index(ldr,host(Z)) & norm = index(status,host(Z)) & setIn(Z,alive)))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid30 all Pid20 all Pid0 (elec_2 = index(status,host(Z)) & elec_1 = index(status,host(Pid0)) & host(Pid0) = host(Pid30) & elem(m_Down(Pid20),queue(host(Pid0))) & leq(host(Z),host(Pid0)) & setIn(Z,alive) & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> V0 = host(Pid20) | setIn(V0,index(down,host(Pid0))))) -> -elem(m_Ack(Z,Pid30),queue(host(Z))))) & (all Z all Pid20 all Pid0 (host(Pid20) = host(Z) & index(ldr,host(Pid0)) = host(Pid20) & index(status,host(Pid0)) = norm & elem(m_Down(Z),queue(host(Pid0))) & setIn(Pid0,alive) & host(Pid0) != host(Pid20) -> -(setIn(Pid20,alive) & index(ldr,host(Pid20)) = host(Pid20) & index(status,host(Pid20)) = norm))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) = host(Pid0) & host(Pid30) = host(Z) & setIn(Pid20,alive) & setIn(Z,alive) & host(Z) != host(Pid20) -> -(elem(m_Down(Pid0),queue(host(Z))) & setIn(host(Pid30),index(down,host(Pid20)))))) & (all Z all Pid30 all Pid20 all Pid0 (host(Z) != host(Pid20) & setIn(Pid20,alive) & host(Z) = host(Pid30) & host(Pid0) = host(Pid20) & setIn(Z,alive) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & host(Z) = host(Pid20) & setIn(Pid0,alive) & -leq(host(Pid20),host(Pid0)) -> -(setIn(Z,alive) & norm = index(status,host(Z)) & host(Z) = index(ldr,host(Z))))) & (all Z all Pid20 all Pid0 (host(Pid0) = host(Pid20) & index(status,host(Pid0)) = elec_2 & elem(m_Down(Pid20),queue(host(Z))) & setIn(Pid0,alive) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (index(ldr,host(Pid0)) = host(Pid0) & index(status,host(Pid0)) = norm & setIn(Pid0,alive) -> -(setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z)))))) & (all Z (setIn(Z,alive) & (elec_2 = index(status,host(Z)) | elec_1 = index(status,host(Z))) -> index(elid,host(Z)) = Z)) -> (setIn(X,alive) -> (leq(host(X),host(Y)) -> (host(Y) = index(pendack,host(X)) & elec_2 = index(status,host(X)) -> (leq(nbr_proc,index(pendack,host(X))) -> (all Z (setIn(host(Z),index(acks,host(X))) -> (all V0 (host(X) = host(V0) -> (all W0 all X0 all Y0 (host(Z) != host(Y0) -> (host(X) != host(Y0) -> ((all V1 (-leq(host(Y0),V1) & leq(s(zero),V1) -> V1 = host(X0) | setIn(V1,index(down,host(Y0))))) & elem(m_Down(W0),queue(host(Y0))) & elem(m_Down(X0),queue(host(Y0))) & elec_1 = index(status,host(Y0)) & host(W0) = s(host(Y0)) & leq(nbr_proc,s(host(Y0))) & setIn(Y0,alive) -> -(setIn(V0,alive) & host(X) = host(V0)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
85.95/86.43	77 -leq(A,B) | -leq(B,A) | B = A # label(axiom_61) # label(axiom).  [clausify(9)].
85.95/86.43	99 -leq(s(A),A) # label(axiom_58) # label(axiom).  [clausify(24)].
85.95/86.43	114 init(snoc(A,B)) = A # label(axiom_38) # label(axiom).  [clausify(33)].
85.95/86.43	119 A != B | elem(B,cons(A,C)) # label(axiom_46) # label(axiom).  [clausify(37)].
85.95/86.43	130 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom).  [clausify(43)].
85.95/86.43	134 s(A) = B | leq(B,A) | -leq(B,s(A)) # label(axiom_64) # label(axiom).  [clausify(46)].
85.95/86.43	142 leq(s(zero),host(A)) # label(axiom_02) # label(axiom).  [clausify(52)].
85.95/86.43	143 leq(A,B) | leq(B,A) # label(axiom_60) # label(axiom).  [clausify(53)].
85.95/86.43	160 -elem(m_Down(A),queue(host(B))) | host(A) != host(B) # label(conj) # label(negated_conjecture).  [clausify(58)].
85.95/86.43	162 -setIn(A,alive) | -setIn(host(B),index(down,host(A))) | index(status,host(B)) != elec_2 | -setIn(B,alive) | leq(index(pendack,host(B)),host(A)) # label(conj) # label(negated_conjecture).  [clausify(58)].
85.95/86.43	171 queue(host(c3)) = cons(m_Down(c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
85.95/86.43	172 cons(m_Down(c4),c1) = queue(host(c3)).  [copy(171),flip(a)].
85.95/86.43	181 host(A) != host(B) | index(status,host(B)) != elec_2 | -elem(m_Down(A),queue(host(C))) | -setIn(B,alive) | -setIn(C,alive) | leq(index(pendack,host(B)),host(C)) # label(conj) # label(negated_conjecture).  [clausify(58)].
85.95/86.43	185 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
85.95/86.43	187 index(pendack,host(c3)) = host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
85.95/86.43	188 index(status,host(c3)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
85.95/86.43	189 elec_2 = index(status,host(c3)).  [copy(188),flip(a)].
85.95/86.43	190 leq(nbr_proc,index(pendack,host(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
85.95/86.43	191 leq(nbr_proc,host(c4)).  [copy(190),rewrite([187(5)])].
85.95/86.43	193 host(c6) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
85.95/86.43	195 host(c9) != host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
85.95/86.43	196 leq(host(c9),A) | -leq(s(zero),A) | host(c8) = A | setIn(A,index(down,host(c9))) # label(conj) # label(negated_conjecture).  [clausify(58)].
85.95/86.43	198 elem(m_Down(c8),queue(host(c9))) # label(conj) # label(negated_conjecture).  [clausify(58)].
85.95/86.43	201 s(host(c9)) = host(c7) # label(conj) # label(negated_conjecture).  [clausify(58)].
85.95/86.43	202 leq(nbr_proc,s(host(c9))) # label(conj) # label(negated_conjecture).  [clausify(58)].
85.95/86.43	203 leq(nbr_proc,host(c7)).  [copy(202),rewrite([201(4)])].
85.95/86.43	204 setIn(c9,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
85.95/86.43	218 host(A) != host(B) | index(status,host(c3)) != index(status,host(B)) | -elem(m_Down(A),queue(host(C))) | -setIn(B,alive) | -setIn(C,alive) | leq(index(pendack,host(B)),host(C)).  [back_rewrite(181),rewrite([189(7)]),flip(b)].
85.95/86.43	223 -setIn(A,alive) | -setIn(host(B),index(down,host(A))) | index(status,host(c3)) != index(status,host(B)) | -setIn(B,alive) | leq(index(pendack,host(B)),host(A)).  [back_rewrite(162),rewrite([189(11)]),flip(c)].
85.95/86.43	264 elem(A,cons(A,B)).  [resolve(119,a,114,a),rewrite([114(2)])].
85.95/86.43	304 -leq(host(A),s(zero)) | s(zero) = host(A).  [resolve(142,a,77,b)].
85.95/86.43	336 host(c4) = nbr_proc.  [resolve(191,a,77,b),flip(b),unit_del(a,130)].
85.95/86.43	337 index(pendack,host(c3)) = nbr_proc.  [back_rewrite(187),rewrite([336(6)])].
85.95/86.43	341 -elem(m_Down(A),queue(host(c3))) | host(c3) != host(A).  [para(193(a,1),160(a,2,1)),rewrite([193(8)]),flip(b)].
85.95/86.43	347 leq(host(c9),A) | host(c8) = A | setIn(A,index(down,host(c9))) | leq(A,s(zero)).  [resolve(196,b,143,b)].
85.95/86.43	348 leq(host(c9),host(A)) | host(c8) = host(A) | setIn(host(A),index(down,host(c9))).  [resolve(196,b,142,a)].
85.95/86.43	370 -leq(host(c7),host(c9)).  [para(201(a,1),99(a,1))].
85.95/86.43	372 host(c7) = A | leq(A,host(c9)) | -leq(A,host(c7)).  [para(201(a,1),134(c,2)),rewrite([201(3)])].
85.95/86.43	377 host(c7) = nbr_proc.  [resolve(203,a,77,b),flip(b),unit_del(a,130)].
85.95/86.43	378 nbr_proc = A | leq(A,host(c9)) | -leq(A,nbr_proc).  [back_rewrite(372),rewrite([377(2),377(7)])].
85.95/86.43	380 -leq(nbr_proc,host(c9)).  [back_rewrite(370),rewrite([377(2)])].
85.95/86.43	405 host(c8) != host(A) | index(status,host(c3)) != index(status,host(A)) | -setIn(A,alive) | leq(index(pendack,host(A)),host(c9)).  [resolve(218,c,198,a),unit_del(d,204)].
85.95/86.43	547 elem(m_Down(c4),queue(host(c3))).  [para(172(a,1),264(a,2))].
85.95/86.43	695 host(c3) != nbr_proc.  [resolve(547,a,341,a),rewrite([336(4)])].
85.95/86.43	2551 host(A) = nbr_proc | leq(host(A),host(c9)).  [resolve(378,c,130,a),flip(a)].
85.95/86.43	2556 host(A) = nbr_proc | -leq(host(c9),host(A)) | host(c9) = host(A).  [resolve(2551,b,77,b),flip(c)].
85.95/86.43	2637 leq(host(c9),host(A)) | host(c8) = host(A) | leq(host(A),s(zero)) | index(status,host(c3)) != index(status,host(A)) | -setIn(A,alive) | leq(index(pendack,host(A)),host(c9)).  [resolve(347,c,223,b),unit_del(d,204)].
85.95/86.43	2768 leq(host(c9),host(A)) | host(c8) = host(A) | index(status,host(c3)) != index(status,host(A)) | -setIn(A,alive) | leq(index(pendack,host(A)),host(c9)).  [resolve(348,c,223,b),unit_del(c,204)].
85.95/86.43	3303 host(c8) != host(c3).  [resolve(405,c,185,a),rewrite([337(18)]),xx(b),unit_del(b,380)].
85.95/86.43	27864 leq(host(c9),host(c3)) | leq(host(c3),s(zero)).  [resolve(2637,e,185,a),rewrite([337(28)]),xx(d),unit_del(b,3303),unit_del(d,380)].
85.95/86.43	27869 leq(host(c3),s(zero)).  [resolve(27864,a,2556,b),unit_del(b,695),unit_del(c,195)].
85.95/86.43	27955 s(zero) = host(c3).  [resolve(27869,a,304,a)].
85.95/86.43	28401 -leq(host(A),host(c3)) | host(c3) = host(A).  [back_rewrite(304),rewrite([27955(3),27955(6)])].
85.95/86.43	28565 leq(host(c9),host(c3)).  [resolve(2768,d,185,a),rewrite([337(23)]),xx(c),unit_del(b,3303),unit_del(c,380)].
85.95/86.43	28568 $F.  [resolve(28565,a,28401,a),flip(a),unit_del(a,195)].
85.95/86.43	
85.95/86.43	% SZS output end Refutation
85.95/86.43	============================== end of proof ==========================
85.95/86.43	
85.95/86.43	============================== STATISTICS ============================
85.95/86.43	
85.95/86.43	Given=8961. Generated=2633179. Kept=28497. proofs=1.
85.95/86.43	Usable=7455. Sos=8771. Demods=72. Limbo=1, Disabled=12407. Hints=0.
85.95/86.43	Megabytes=47.23.
85.95/86.43	User_CPU=82.38, System_CPU=2.75, Wall_clock=85.
85.95/86.43	
85.95/86.43	============================== end of statistics =====================
85.95/86.43	
85.95/86.43	============================== end of search =========================
85.95/86.43	
85.95/86.43	THEOREM PROVED
85.95/86.43	% SZS status Theorem
85.95/86.43	
85.95/86.43	Exiting with 1 proof.
85.95/86.43	
85.95/86.43	Process 29462 exit (max_proofs) Thu Jul  2 08:02:02 2020
85.95/86.43	Prover9 interrupted
85.95/86.44	EOF