0.00/0.04	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : tptp2X_and_run_prover9 %d %s
0.03/0.23	% Computer   : n120.star.cs.uiowa.edu
0.03/0.23	% Model      : x86_64 x86_64
0.03/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.23	% Memory     : 32218.625MB
0.03/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.23	% CPULimit   : 300
0.03/0.23	% DateTime   : Sat Jul 14 05:21:39 CDT 2018
0.03/0.23	% CPUTime    : 
0.07/0.51	============================== Prover9 ===============================
0.07/0.51	Prover9 (32) version 2009-11A, November 2009.
0.07/0.51	Process 25185 was started by sandbox2 on n120.star.cs.uiowa.edu,
0.07/0.51	Sat Jul 14 05:21:40 2018
0.07/0.51	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_25153_n120.star.cs.uiowa.edu".
0.07/0.51	============================== end of head ===========================
0.07/0.51	
0.07/0.51	============================== INPUT =================================
0.07/0.51	
0.07/0.51	% Reading from file /tmp/Prover9_25153_n120.star.cs.uiowa.edu
0.07/0.51	
0.07/0.51	set(prolog_style_variables).
0.07/0.51	set(auto2).
0.07/0.51	    % set(auto2) -> set(auto).
0.07/0.51	    % set(auto) -> set(auto_inference).
0.07/0.51	    % set(auto) -> set(auto_setup).
0.07/0.51	    % set(auto_setup) -> set(predicate_elim).
0.07/0.51	    % set(auto_setup) -> assign(eq_defs, unfold).
0.07/0.51	    % set(auto) -> set(auto_limits).
0.07/0.51	    % set(auto_limits) -> assign(max_weight, "100.000").
0.07/0.51	    % set(auto_limits) -> assign(sos_limit, 20000).
0.07/0.51	    % set(auto) -> set(auto_denials).
0.07/0.51	    % set(auto) -> set(auto_process).
0.07/0.51	    % set(auto2) -> assign(new_constants, 1).
0.07/0.51	    % set(auto2) -> assign(fold_denial_max, 3).
0.07/0.51	    % set(auto2) -> assign(max_weight, "200.000").
0.07/0.51	    % set(auto2) -> assign(max_hours, 1).
0.07/0.51	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.07/0.51	    % set(auto2) -> assign(max_seconds, 0).
0.07/0.51	    % set(auto2) -> assign(max_minutes, 5).
0.07/0.51	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.07/0.51	    % set(auto2) -> set(sort_initial_sos).
0.07/0.51	    % set(auto2) -> assign(sos_limit, -1).
0.07/0.51	    % set(auto2) -> assign(lrs_ticks, 3000).
0.07/0.51	    % set(auto2) -> assign(max_megs, 400).
0.07/0.51	    % set(auto2) -> assign(stats, some).
0.07/0.51	    % set(auto2) -> clear(echo_input).
0.07/0.51	    % set(auto2) -> set(quiet).
0.07/0.51	    % set(auto2) -> clear(print_initial_clauses).
0.07/0.51	    % set(auto2) -> clear(print_given).
0.07/0.51	assign(lrs_ticks,-1).
0.07/0.51	assign(sos_limit,10000).
0.07/0.51	assign(order,kbo).
0.07/0.51	set(lex_order_vars).
0.07/0.51	clear(print_given).
0.07/0.51	
0.07/0.51	% formulas(sos).  % not echoed (67 formulas)
0.07/0.51	
0.07/0.51	============================== end of input ==========================
0.07/0.51	
0.07/0.51	% From the command line: assign(max_seconds, 300).
0.07/0.51	
0.07/0.51	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.07/0.51	
0.07/0.51	% Formulas that are not ordinary clauses:
0.07/0.51	1 (all X all Y (s(Y) = X | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	2 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	3 (all Q all X all Y (ordered(Q) -> ordered(snoc(Q,m_Ack(X,Y))))) # label(axiom_55) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	4 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	5 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	6 (all Q all X all Y (host(X) = host(Y) & elem(m_Down(Y),Q) & ordered(cons(m_Halt(X),Q)) -> leq(X,Y))) # label(axiom_57) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	7 (all X all Y all Q (elem(X,snoc(Q,Y)) <-> elem(X,Q) | Y = X)) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	8 (all X ((exists Y (m_Down(Y) = X | X = m_Halt(Y))) <-> pidElem(X))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	9 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	10 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	11 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	12 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	13 (all Pid all Pid2 (elem(m_Ack(Pid,Pid2),queue(host(Pid))) -> setIn(Pid,pids) & setIn(Pid2,pids))) # label(axiom) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	14 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	15 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	16 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	17 (all X all Q (ordered(snoc(Q,X)) <-> (all Y (elem(Y,Q) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) & pidElem(X) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	18 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	19 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	20 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	21 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	22 (all X1 all X2 all Y1 all Y2 (X1 != X2 -> m_Ack(X1,Y1) != m_Ack(X2,Y2))) # label(axiom_31) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	23 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	24 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	25 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	26 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	27 (all X1 all X2 all Y1 all Y2 (Y1 != Y2 -> m_Ack(X2,Y2) != m_Ack(X1,Y1))) # label(axiom_32) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	28 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	29 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	30 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	31 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	32 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	33 (all Q (q_nil = Q | Q = cons(head(Q),tail(Q)))) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	34 (all Q (snoc(init(Q),last(Q)) = Q | q_nil = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	35 (all X all Y all Z (leq(Y,Z) & leq(X,Y) -> leq(X,Z))) # label(axiom_62) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	36 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	37 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	38 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	39 (all X all Q (ordered(cons(X,Q)) <-> (all Y (elem(Y,Q) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(X) -> leq(pidMsg(X),pidMsg(Y)))) & ordered(Q))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	40 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	41 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	42 (all P all Q (host(Q) = s(host(P)) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	43 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	44 (all X all Y (X != Y <-> m_Down(X) != m_Down(Y))) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	45 (all X all Y all Q (elem(X,cons(Y,Q)) <-> elem(X,Q) | X = Y)) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	46 (all X all Y (m_Halt(X) != m_Halt(Y) <-> X != Y)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	47 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	48 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	49 (all X X = pidMsg(m_Down(X))) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.07/0.52	51 (all X all Y (m_NotNorm(Y) != m_NotNorm(X) <-> Y != X)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.07/0.52	52 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.07/0.52	53 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.07/0.52	54 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.07/0.52	55 (all X all Y all Q cons(X,snoc(Q,Y)) = snoc(cons(X,Q),Y)) # label(axiom_44) # label(axiom) # label(non_clause).  [assumption].
0.07/0.52	56 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.07/0.52	57 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.07/0.52	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(Pid0) != host(Z))) & (all Z all Pid0 (Z != Pid0 & host(Pid0) = host(Z) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid20 all Pid0 (index(status,host(Pid0)) = norm & host(Pid0) = index(ldr,host(Pid0)) & host(Pid20) = host(Pid0) & setIn(Pid0,alive) -> -(elem(m_Down(Pid20),queue(host(Z))) & setIn(Z,alive)))) & (all Z all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & norm = index(status,host(Z)) & norm = index(status,host(Pid0)) & host(Pid0) = index(ldr,host(Pid0)) & host(Z) = index(ldr,host(Z)) -> Pid0 = 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)) -> -(index(status,host(Z)) = norm & index(ldr,host(Z)) = host(Z) & setIn(Z,alive)))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid0) = host(Pid20) & host(Z) = host(Pid30) & setIn(Pid20,alive) & setIn(Z,alive) & host(Z) != host(Pid20) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid20,alive) & host(Pid20) = host(Pid0) & host(Pid30) = host(Z) & host(Pid20) != host(Z) -> -(elem(m_Down(Pid0),queue(host(Z))) & setIn(host(Pid30),index(down,host(Pid20)))))) & (all Z all Pid30 all Pid20 all Pid0 (elem(m_Down(Pid30),queue(host(Pid0))) & host(Pid30) = s(host(Pid0)) & index(status,host(Pid0)) = elec_1 & elem(m_Down(Pid20),queue(host(Pid0))) & leq(nbr_proc,s(host(Pid0))) & setIn(Pid0,alive) & (all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) -> -(setIn(Z,alive) & index(status,host(Z)) = norm & host(Z) = index(ldr,host(Z))))) & queue(host(X)) = cons(m_Down(Y),V) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid0) = host(Pid30) & index(status,host(Z)) = elec_2 & elec_1 = index(status,host(Pid0)) & leq(host(Z),host(Pid0)) & setIn(Z,alive) -> -elem(m_Ack(Z,Pid30),queue(host(Z))))) & (all Z all Pid20 all Pid0 (host(Pid20) != host(Pid0) & host(Z) = host(Pid20) & wait = index(status,host(Pid0)) & host(index(elid,host(Pid0))) = host(Pid20) & elem(m_Down(Z),queue(host(Pid0))) & setIn(Pid0,alive) -> -(index(ldr,host(Pid20)) = host(Pid20) & norm = index(status,host(Pid20)) & setIn(Pid20,alive)))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & setIn(Pid0,alive) & host(Pid20) = host(Z) & index(ldr,host(Pid0)) = host(Pid20) & index(status,host(Pid0)) = norm & elem(m_Down(Z),queue(host(Pid0))) -> -(setIn(Pid20,alive) & index(status,host(Pid20)) = norm & host(Pid20) = index(ldr,host(Pid20))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Down(Pid20),queue(host(Z))) & elec_2 = index(status,host(Pid0)) & host(Pid20) = host(Pid0) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (host(Pid0) = index(ldr,host(Pid0)) & norm = index(status,host(Pid0)) & setIn(Pid0,alive) -> -(setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z)))))) & (all Z all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & setIn(host(Pid0),index(down,host(Z))) & index(status,host(Pid0)) = elec_2 -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z (setIn(Z,alive) & (elec_1 = index(status,host(Z)) | index(status,host(Z)) = elec_2) -> index(elid,host(Z)) = Z)) -> (setIn(X,alive) -> (leq(host(X),host(Y)) -> (host(Y) = index(pendack,host(X)) & index(status,host(X)) = elec_2 -> (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(X) != host(Y0) -> ((all V1 (-leq(host(Y0),V1) & leq(s(zero),V1) -> setIn(V1,index(down,host(Y0))) | V1 = host(X0))) & setIn(Y0,alive) & leq(nbr_proc,s(host(Y0))) & elem(m_Down(X0),queue(host(Y0))) & s(host(Y0)) = host(W0) & index(status,host(Y0)) = elec_1 & elem(m_Down(W0),queue(host(Y0))) -> -(host(V0) = host(X) & setIn(V0,alive))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
38.23/38.44	
38.23/38.44	============================== end of process non-clausal formulas ===
38.23/38.44	
38.23/38.44	============================== PROCESS INITIAL CLAUSES ===============
38.23/38.44	
38.23/38.44	============================== PREDICATE ELIMINATION =================
38.23/38.44	
38.23/38.44	============================== end predicate elimination =============
38.23/38.44	
38.23/38.44	Auto_denials:  (non-Horn, no changes).
38.23/38.44	
38.23/38.44	Term ordering decisions:
38.23/38.44	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. wait=1. acks=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. 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.
38.23/38.44	
38.23/38.44	============================== end of process initial clauses ========
38.23/38.44	
38.23/38.44	============================== CLAUSES FOR SEARCH ====================
38.23/38.44	
38.23/38.44	============================== end of clauses for search =============
38.23/38.44	
38.23/38.44	============================== SEARCH ================================
38.23/38.44	
38.23/38.44	% Starting search at 0.03 seconds.
38.23/38.44	
38.23/38.44	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 149 (0.00 of 0.32 sec).
38.23/38.44	
38.23/38.44	Low Water (keep): wt=16.000, iters=4060
38.23/38.44	
38.23/38.44	Low Water (keep): wt=15.000, iters=3498
38.23/38.44	
38.23/38.44	Low Water (displace): id=15996, wt=199.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15572, wt=198.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15992, wt=197.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15323, wt=196.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15578, wt=187.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15574, wt=186.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15994, wt=185.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15471, wt=184.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15576, wt=175.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15477, wt=174.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15473, wt=173.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15575, wt=163.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15573, wt=162.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15326, wt=161.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15324, wt=160.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16133, wt=154.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16125, wt=153.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16318, wt=152.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16310, wt=151.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16131, wt=146.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16127, wt=145.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16316, wt=144.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16312, wt=143.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16244, wt=140.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16236, wt=139.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16129, wt=138.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16314, wt=136.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16242, wt=133.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16238, wt=132.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16128, wt=130.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16126, wt=129.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16313, wt=128.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16311, wt=127.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16240, wt=126.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16000, wt=123.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15789, wt=122.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16001, wt=121.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15858, wt=120.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16239, wt=119.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=16237, wt=118.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15795, wt=117.000
38.23/38.44	
38.23/38.44	Low Water (displace): id=15791, wt=116.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15864, wt=115.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15860, wt=114.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15793, wt=111.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=13312, wt=110.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15862, wt=109.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=16022, wt=108.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=13624, wt=107.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=16020, wt=106.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=16017, wt=105.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15790, wt=104.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15861, wt=103.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=16028, wt=102.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=16026, wt=101.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=16024, wt=100.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=13595, wt=97.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=13379, wt=96.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=13632, wt=95.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=13265, wt=94.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=13585, wt=93.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15998, wt=92.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15031, wt=91.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=13526, wt=90.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=13613, wt=89.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=13565, wt=88.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=13603, wt=87.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15274, wt=86.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15033, wt=85.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15989, wt=83.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=16016, wt=82.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=13630, wt=81.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=16014, wt=80.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15417, wt=78.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15436, wt=77.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=13563, wt=76.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15438, wt=75.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15451, wt=74.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15437, wt=73.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15318, wt=72.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15425, wt=70.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15452, wt=69.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=14931, wt=68.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15454, wt=67.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15434, wt=66.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15453, wt=65.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15435, wt=64.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=13885, wt=63.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=13810, wt=61.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=13742, wt=60.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=14059, wt=56.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15450, wt=55.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15448, wt=54.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15446, wt=53.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=14024, wt=52.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15828, wt=51.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=14027, wt=50.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=15442, wt=49.000
52.63/52.89	
52.63/52.89	Low Water (displace): id=17554, wt=14.000
52.63/52.89	
52.63/52.89	============================== PROOF =================================
52.63/52.89	% SZS status Theorem
52.63/52.89	% SZS output start Refutation
52.63/52.89	
52.63/52.89	% Proof 1 at 51.03 (+ 1.35) seconds.
52.63/52.89	% Length of proof is 56.
52.63/52.89	% Level of proof is 8.
52.63/52.89	% Maximum clause weight is 33.000.
52.63/52.89	% Given clauses 8167.
52.63/52.89	
52.63/52.89	1 (all X all Y (s(Y) = X | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
52.63/52.89	15 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
52.63/52.89	26 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
52.63/52.89	32 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
52.63/52.89	41 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
52.63/52.89	43 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
52.63/52.89	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].
52.63/52.89	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(Pid0) != host(Z))) & (all Z all Pid0 (Z != Pid0 & host(Pid0) = host(Z) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid20 all Pid0 (index(status,host(Pid0)) = norm & host(Pid0) = index(ldr,host(Pid0)) & host(Pid20) = host(Pid0) & setIn(Pid0,alive) -> -(elem(m_Down(Pid20),queue(host(Z))) & setIn(Z,alive)))) & (all Z all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & norm = index(status,host(Z)) & norm = index(status,host(Pid0)) & host(Pid0) = index(ldr,host(Pid0)) & host(Z) = index(ldr,host(Z)) -> Pid0 = 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)) -> -(index(status,host(Z)) = norm & index(ldr,host(Z)) = host(Z) & setIn(Z,alive)))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid0) = host(Pid20) & host(Z) = host(Pid30) & setIn(Pid20,alive) & setIn(Z,alive) & host(Z) != host(Pid20) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid20,alive) & host(Pid20) = host(Pid0) & host(Pid30) = host(Z) & host(Pid20) != host(Z) -> -(elem(m_Down(Pid0),queue(host(Z))) & setIn(host(Pid30),index(down,host(Pid20)))))) & (all Z all Pid30 all Pid20 all Pid0 (elem(m_Down(Pid30),queue(host(Pid0))) & host(Pid30) = s(host(Pid0)) & index(status,host(Pid0)) = elec_1 & elem(m_Down(Pid20),queue(host(Pid0))) & leq(nbr_proc,s(host(Pid0))) & setIn(Pid0,alive) & (all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) -> -(setIn(Z,alive) & index(status,host(Z)) = norm & host(Z) = index(ldr,host(Z))))) & queue(host(X)) = cons(m_Down(Y),V) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid0) = host(Pid30) & index(status,host(Z)) = elec_2 & elec_1 = index(status,host(Pid0)) & leq(host(Z),host(Pid0)) & setIn(Z,alive) -> -elem(m_Ack(Z,Pid30),queue(host(Z))))) & (all Z all Pid20 all Pid0 (host(Pid20) != host(Pid0) & host(Z) = host(Pid20) & wait = index(status,host(Pid0)) & host(index(elid,host(Pid0))) = host(Pid20) & elem(m_Down(Z),queue(host(Pid0))) & setIn(Pid0,alive) -> -(index(ldr,host(Pid20)) = host(Pid20) & norm = index(status,host(Pid20)) & setIn(Pid20,alive)))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & setIn(Pid0,alive) & host(Pid20) = host(Z) & index(ldr,host(Pid0)) = host(Pid20) & index(status,host(Pid0)) = norm & elem(m_Down(Z),queue(host(Pid0))) -> -(setIn(Pid20,alive) & index(status,host(Pid20)) = norm & host(Pid20) = index(ldr,host(Pid20))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Down(Pid20),queue(host(Z))) & elec_2 = index(status,host(Pid0)) & host(Pid20) = host(Pid0) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (host(Pid0) = index(ldr,host(Pid0)) & norm = index(status,host(Pid0)) & setIn(Pid0,alive) -> -(setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z)))))) & (all Z all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & setIn(host(Pid0),index(down,host(Z))) & index(status,host(Pid0)) = elec_2 -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z (setIn(Z,alive) & (elec_1 = index(status,host(Z)) | index(status,host(Z)) = elec_2) -> index(elid,host(Z)) = Z)) -> (setIn(X,alive) -> (leq(host(X),host(Y)) -> (host(Y) = index(pendack,host(X)) & index(status,host(X)) = elec_2 -> (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(X) != host(Y0) -> ((all V1 (-leq(host(Y0),V1) & leq(s(zero),V1) -> setIn(V1,index(down,host(Y0))) | V1 = host(X0))) & setIn(Y0,alive) & leq(nbr_proc,s(host(Y0))) & elem(m_Down(X0),queue(host(Y0))) & s(host(Y0)) = host(W0) & index(status,host(Y0)) = elec_1 & elem(m_Down(W0),queue(host(Y0))) -> -(host(V0) = host(X) & setIn(V0,alive))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
52.63/52.89	61 s(A) = B | leq(B,A) | -leq(B,s(A)) # label(axiom_64) # label(axiom).  [clausify(1)].
52.63/52.89	83 -leq(s(A),A) # label(axiom_58) # label(axiom).  [clausify(15)].
52.63/52.89	104 leq(s(zero),host(A)) # label(axiom_02) # label(axiom).  [clausify(26)].
52.63/52.89	110 -leq(A,B) | -leq(B,A) | A = B # label(axiom_61) # label(axiom).  [clausify(32)].
52.63/52.89	134 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom).  [clausify(41)].
52.63/52.89	136 init(snoc(A,B)) = A # label(axiom_38) # label(axiom).  [clausify(43)].
52.63/52.89	141 elem(A,cons(B,C)) | B != A # label(axiom_46) # label(axiom).  [clausify(45)].
52.63/52.89	162 -elem(m_Down(A),queue(host(B))) | host(A) != host(B) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.63/52.89	173 queue(host(c3)) = cons(m_Down(c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.63/52.89	174 cons(m_Down(c4),c1) = queue(host(c3)).  [copy(173),flip(a)].
52.63/52.89	182 -setIn(A,alive) | -elem(m_Down(B),queue(host(C))) | index(status,host(A)) != elec_2 | host(B) != host(A) | -setIn(C,alive) | leq(index(pendack,host(A)),host(C)) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.63/52.89	184 -setIn(A,alive) | -setIn(B,alive) | -setIn(host(B),index(down,host(A))) | index(status,host(B)) != elec_2 | leq(index(pendack,host(B)),host(A)) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.63/52.89	187 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.63/52.89	189 index(pendack,host(c3)) = host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.63/52.89	190 index(status,host(c3)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
52.63/52.89	191 elec_2 = index(status,host(c3)).  [copy(190),flip(a)].
52.63/52.89	192 leq(nbr_proc,index(pendack,host(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.63/52.89	193 leq(nbr_proc,host(c4)).  [copy(192),rewrite([189(5)])].
52.63/52.89	195 host(c6) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.63/52.89	196 host(c9) != host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.63/52.89	197 leq(host(c9),A) | -leq(s(zero),A) | setIn(A,index(down,host(c9))) | host(c8) = A # label(conj) # label(negated_conjecture).  [clausify(58)].
52.63/52.89	198 setIn(c9,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.63/52.89	199 leq(nbr_proc,s(host(c9))) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.63/52.89	200 elem(m_Down(c8),queue(host(c9))) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.63/52.89	201 host(c7) = s(host(c9)) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.63/52.89	202 s(host(c9)) = host(c7).  [copy(201),flip(a)].
52.63/52.89	219 -setIn(A,alive) | -setIn(B,alive) | -setIn(host(B),index(down,host(A))) | index(status,host(c3)) != index(status,host(B)) | leq(index(pendack,host(B)),host(A)).  [back_rewrite(184),rewrite([191(13)]),flip(d)].
52.63/52.89	220 -setIn(A,alive) | -elem(m_Down(B),queue(host(C))) | index(status,host(c3)) != index(status,host(A)) | host(B) != host(A) | -setIn(C,alive) | leq(index(pendack,host(A)),host(C)).  [back_rewrite(182),rewrite([191(10)]),flip(c)].
52.63/52.89	228 leq(nbr_proc,host(c7)).  [back_rewrite(199),rewrite([202(4)])].
52.63/52.89	291 elem(A,cons(A,B)).  [resolve(141,b,136,a),rewrite([136(2)])].
52.63/52.89	336 host(c4) = nbr_proc.  [resolve(193,a,110,b),unit_del(a,134)].
52.63/52.89	337 index(pendack,host(c3)) = nbr_proc.  [back_rewrite(189),rewrite([336(6)])].
52.63/52.89	341 -elem(m_Down(A),queue(host(c3))) | host(c3) != host(A).  [para(195(a,1),162(a,2,1)),rewrite([195(8)]),flip(b)].
52.63/52.89	348 leq(host(c9),host(A)) | setIn(host(A),index(down,host(c9))) | host(c8) = host(A).  [resolve(197,b,104,a)].
52.63/52.89	361 host(c7) = A | leq(A,host(c9)) | -leq(A,host(c7)).  [para(202(a,1),61(c,2)),rewrite([202(3)])].
52.63/52.89	362 -leq(host(c7),host(c9)).  [para(202(a,1),83(a,1))].
52.63/52.89	388 -setIn(A,alive) | index(status,host(c3)) != index(status,host(A)) | host(c8) != host(A) | leq(index(pendack,host(A)),host(c9)).  [resolve(220,b,200,a),unit_del(d,198)].
52.63/52.89	400 host(c7) = nbr_proc.  [resolve(228,a,110,b),unit_del(a,134)].
52.63/52.89	417 -leq(nbr_proc,host(c9)).  [back_rewrite(362),rewrite([400(2)])].
52.63/52.89	418 nbr_proc = A | leq(A,host(c9)) | -leq(A,nbr_proc).  [back_rewrite(361),rewrite([400(2),400(7)])].
52.63/52.89	545 elem(m_Down(c4),queue(host(c3))).  [para(174(a,1),291(a,2))].
52.63/52.89	630 host(c3) != nbr_proc.  [resolve(545,a,341,a),rewrite([336(4)])].
52.63/52.89	2584 host(A) = nbr_proc | leq(host(A),host(c9)).  [resolve(418,c,134,a),flip(a)].
52.63/52.89	2590 host(A) = nbr_proc | -leq(host(c9),host(A)) | host(c9) = host(A).  [resolve(2584,b,110,b)].
52.63/52.89	2886 leq(host(c9),host(A)) | host(c8) = host(A) | -setIn(A,alive) | index(status,host(c3)) != index(status,host(A)) | leq(index(pendack,host(A)),host(c9)).  [resolve(348,b,219,c),unit_del(c,198)].
52.63/52.89	3252 host(c8) != host(c3).  [resolve(388,a,187,a),rewrite([337(18)]),xx(a),unit_del(b,417)].
52.63/52.89	24779 leq(host(c9),host(c3)).  [resolve(2886,c,187,a),rewrite([337(23)]),xx(c),unit_del(b,3252),unit_del(c,417)].
52.63/52.89	24845 $F.  [resolve(24779,a,2590,b),unit_del(a,630),unit_del(b,196)].
52.63/52.89	
52.63/52.89	% SZS output end Refutation
52.63/52.89	============================== end of proof ==========================
52.63/52.89	
52.63/52.89	============================== STATISTICS ============================
52.63/52.89	
52.63/52.89	Given=8167. Generated=2751144. Kept=24773. proofs=1.
52.63/52.89	Usable=7949. Sos=9996. Demods=72. Limbo=41, Disabled=6923. Hints=0.
52.63/52.89	Megabytes=42.38.
52.63/52.89	User_CPU=51.03, System_CPU=1.35, Wall_clock=52.
52.63/52.89	
52.63/52.89	============================== end of statistics =====================
52.63/52.89	
52.63/52.89	============================== end of search =========================
52.63/52.89	
52.63/52.89	THEOREM PROVED
52.63/52.89	% SZS status Theorem
52.63/52.89	
52.63/52.89	Exiting with 1 proof.
52.63/52.89	
52.63/52.89	Process 25185 exit (max_proofs) Sat Jul 14 05:22:32 2018
52.63/52.89	Prover9 interrupted
52.63/52.90	EOF