0.11/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n011.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1200
0.12/0.33	% DateTime   : Wed Jul 14 15:02:25 EDT 2021
0.12/0.33	% CPUTime    : 
0.83/1.15	============================== Prover9 ===============================
0.83/1.15	Prover9 (32) version 2009-11A, November 2009.
0.83/1.15	Process 8377 was started by sandbox on n011.cluster.edu,
0.83/1.15	Wed Jul 14 15:02:25 2021
0.83/1.15	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_8199_n011.cluster.edu".
0.83/1.15	============================== end of head ===========================
0.83/1.15	
0.83/1.15	============================== INPUT =================================
0.83/1.15	
0.83/1.15	% Reading from file /tmp/Prover9_8199_n011.cluster.edu
0.83/1.15	
0.83/1.15	set(prolog_style_variables).
0.83/1.15	set(auto2).
0.83/1.15	    % set(auto2) -> set(auto).
0.83/1.15	    % set(auto) -> set(auto_inference).
0.83/1.15	    % set(auto) -> set(auto_setup).
0.83/1.15	    % set(auto_setup) -> set(predicate_elim).
0.83/1.15	    % set(auto_setup) -> assign(eq_defs, unfold).
0.83/1.15	    % set(auto) -> set(auto_limits).
0.83/1.15	    % set(auto_limits) -> assign(max_weight, "100.000").
0.83/1.15	    % set(auto_limits) -> assign(sos_limit, 20000).
0.83/1.15	    % set(auto) -> set(auto_denials).
0.83/1.15	    % set(auto) -> set(auto_process).
0.83/1.15	    % set(auto2) -> assign(new_constants, 1).
0.83/1.15	    % set(auto2) -> assign(fold_denial_max, 3).
0.83/1.15	    % set(auto2) -> assign(max_weight, "200.000").
0.83/1.15	    % set(auto2) -> assign(max_hours, 1).
0.83/1.15	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.83/1.15	    % set(auto2) -> assign(max_seconds, 0).
0.83/1.15	    % set(auto2) -> assign(max_minutes, 5).
0.83/1.15	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.83/1.15	    % set(auto2) -> set(sort_initial_sos).
0.83/1.15	    % set(auto2) -> assign(sos_limit, -1).
0.83/1.15	    % set(auto2) -> assign(lrs_ticks, 3000).
0.83/1.15	    % set(auto2) -> assign(max_megs, 400).
0.83/1.15	    % set(auto2) -> assign(stats, some).
0.83/1.15	    % set(auto2) -> clear(echo_input).
0.83/1.15	    % set(auto2) -> set(quiet).
0.83/1.15	    % set(auto2) -> clear(print_initial_clauses).
0.83/1.15	    % set(auto2) -> clear(print_given).
0.83/1.15	assign(lrs_ticks,-1).
0.83/1.15	assign(sos_limit,10000).
0.83/1.15	assign(order,kbo).
0.83/1.15	set(lex_order_vars).
0.83/1.15	clear(print_given).
0.83/1.15	
0.83/1.15	% formulas(sos).  % not echoed (67 formulas)
0.83/1.15	
0.83/1.15	============================== end of input ==========================
0.83/1.15	
0.83/1.15	% From the command line: assign(max_seconds, 1200).
0.83/1.15	
0.83/1.15	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.83/1.15	
0.83/1.15	% Formulas that are not ordinary clauses:
0.83/1.15	1 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	2 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	3 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	4 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	5 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	6 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	7 (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.83/1.15	8 (all Q (cons(head(Q),tail(Q)) = Q | q_nil = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	9 (all X all Y (X != Y <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	10 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	11 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	12 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	13 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	14 (all X all Y (m_NormQ(Y) != m_NormQ(X) <-> X != Y)) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	15 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	16 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	17 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	18 (all X1 all X2 all Y1 all Y2 (Y2 != Y1 -> m_Ack(X1,Y1) != m_Ack(X2,Y2))) # label(axiom_32) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	19 (all X (pidElem(X) <-> (exists Y (X = m_Down(Y) | m_Halt(Y) = X)))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	20 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	21 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	22 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	23 (all Q all X all Y (ordered(cons(m_Halt(X),Q)) & host(X) = host(Y) & elem(m_Down(Y),Q) -> leq(X,Y))) # label(axiom_57) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	24 (all X all Y (m_NotNorm(X) != m_NotNorm(Y) <-> X != Y)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	25 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	26 (all X all Y (X != Y <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	27 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	28 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	29 (all Q (Q = snoc(init(Q),last(Q)) | q_nil = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	30 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	31 (all X all Y (X = Y <-> leq(X,Y) & leq(Y,X))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	32 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	33 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	34 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	35 (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.83/1.15	36 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	37 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	38 (all X all Y m_NotNorm(X) != m_Halt(Y)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	39 (all X all Y all Q (elem(X,cons(Y,Q)) <-> X = Y | elem(X,Q))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	40 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	41 (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.83/1.15	42 (all X all Y all Z m_NormQ(Z) != m_Ack(X,Y)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	43 (all X all Y (m_Down(Y) != m_Down(X) <-> Y != X)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	44 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	45 (all Y all Q Q = init(snoc(Q,Y))) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	46 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	47 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	48 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	49 (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.83/1.15	50 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	51 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.83/1.15	52 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.83/1.16	53 (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.83/1.16	54 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.83/1.16	55 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.83/1.16	56 (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.83/1.16	57 (all X all Q ((all Y (elem(Y,Q) & pidElem(X) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q) <-> ordered(snoc(Q,X)))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.83/1.16	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 (Z != Pid0 & host(Z) = host(Pid0) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (setIn(host(Pid0),index(down,host(Z))) & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid0) & setIn(Pid0,alive) & setIn(Z,alive) -> Pid0 = Z)) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid20,alive) & host(Pid0) = host(Pid20) & 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 Pid20 all Pid0 (host(Pid20) != host(Pid0) & elem(m_Down(Z),queue(host(Pid0))) & wait = index(status,host(Pid0)) & host(index(elid,host(Pid0))) = host(Pid20) & host(Z) = host(Pid20) & setIn(Pid0,alive) -> -(setIn(Pid20,alive) & host(Pid20) = index(ldr,host(Pid20)) & index(status,host(Pid20)) = norm))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid0) = host(Pid30) & index(status,host(Z)) = elec_2 & elec_1 = index(status,host(Pid0)) & 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) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) -> -elem(m_Ack(Z,Pid30),queue(host(Z))))) & (all Z all Pid30 all Pid20 all Pid0 (leq(nbr_proc,s(host(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))) & setIn(Pid0,alive) & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) -> -(host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm & setIn(Z,alive)))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid20 all Pid0 (elem(m_Down(Z),queue(host(Pid0))) & host(Pid20) = host(Z) & host(Pid20) = index(ldr,host(Pid0)) & index(status,host(Pid0)) = norm & setIn(Pid0,alive) & host(Pid20) != host(Pid0) -> -(index(ldr,host(Pid20)) = host(Pid20) & index(status,host(Pid20)) = norm & setIn(Pid20,alive)))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & host(Z) = host(Pid30) & host(Pid20) = host(Pid0) & setIn(Pid20,alive) & setIn(Z,alive) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid20 all Pid0 (-leq(host(Pid20),host(Pid0)) & host(Z) = host(Pid20) & elem(m_Down(Pid20),queue(host(Pid0))) & setIn(Pid0,alive) -> -(setIn(Z,alive) & norm = index(status,host(Z)) & host(Z) = index(ldr,host(Z))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Pid0) = host(Pid20) & index(status,host(Pid0)) = norm & host(Pid0) = index(ldr,host(Pid0)) -> -(setIn(Z,alive) & elem(m_Down(Pid20),queue(host(Z)))))) & (all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Z))) & index(status,host(Pid0)) = elec_2 & host(Pid0) = host(Pid20) & setIn(Pid0,alive) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (setIn(Pid0,alive) & host(Pid0) = index(ldr,host(Pid0)) & norm = index(status,host(Pid0)) -> -(setIn(host(Pid0),index(down,host(Z))) & setIn(Z,alive)))) & (all Z ((elec_1 = index(status,host(Z)) | elec_2 = index(status,host(Z))) & setIn(Z,alive) -> Z = index(elid,host(Z)))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) -> (setIn(X,alive) -> (leq(host(X),host(Y)) -> (elec_2 = index(status,host(X)) & index(pendack,host(X)) = host(Y) -> (leq(nbr_proc,index(pendack,host(X))) -> (all Z (setIn(host(Z),index(acks,host(X))) -> (all V0 (host(V0) = host(X) -> (all W0 all X0 all Y0 (host(Y0) = host(Z) -> (host(Y0) != host(X) -> (setIn(Y0,alive) & elem(m_Down(W0),snoc(queue(host(Y0)),m_Ldr(X))) & host(W0) = s(host(Y0)) & elec_1 = index(status,host(Y0)) & elem(m_Down(X0),snoc(queue(host(Y0)),m_Ldr(X))) & leq(nbr_proc,s(host(Y0))) & (all V1 (-leq(host(Y0),V1) & leq(s(zero),V1) -> V1 = host(X0) | setIn(V1,index(down,host(Y0))))) -> -(setIn(V0,alive) & host(X) = host(V0)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
53.70/53.98	
53.70/53.98	============================== end of process non-clausal formulas ===
53.70/53.98	
53.70/53.98	============================== PROCESS INITIAL CLAUSES ===============
53.70/53.98	
53.70/53.98	============================== PREDICATE ELIMINATION =================
53.70/53.98	
53.70/53.98	============================== end predicate elimination =============
53.70/53.98	
53.70/53.98	Auto_denials:  (non-Horn, no changes).
53.70/53.98	
53.70/53.98	Term ordering decisions:
53.70/53.98	Function symbol KB weights:  alive=1. status=1. ldr=1. norm=1. q_nil=1. elec_2=1. nbr_proc=1. zero=1. elec_1=1. pendack=1. down=1. elid=1. pids=1. acks=1. wait=1. nil=1. setEmpty=1. c1=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. index=1. snoc=1. cons=1. m_Ack=1. f2=1. f3=1. host=1. m_Down=1. pidMsg=1. s=1. queue=1. m_Halt=1. m_Ldr=1. m_NormQ=1. m_NotNorm=1. head=1. init=1. last=1. tail=1. f1=1. f4=1. f5=1.
53.70/53.98	
53.70/53.98	============================== end of process initial clauses ========
53.70/53.98	
53.70/53.98	============================== CLAUSES FOR SEARCH ====================
53.70/53.98	
53.70/53.98	============================== end of clauses for search =============
53.70/53.98	
53.70/53.98	============================== SEARCH ================================
53.70/53.98	
53.70/53.98	% Starting search at 0.05 seconds.
53.70/53.98	
53.70/53.98	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 58 (0.00 of 0.28 sec).
53.70/53.98	
53.70/53.98	Low Water (keep): wt=27.000, iters=3380
53.70/53.98	
53.70/53.98	Low Water (keep): wt=26.000, iters=3362
53.70/53.98	
53.70/53.98	Low Water (keep): wt=20.000, iters=3375
53.70/53.98	
53.70/53.98	Low Water (keep): wt=18.000, iters=5163
53.70/53.98	
53.70/53.98	Low Water (keep): wt=16.000, iters=4540
53.70/53.98	
53.70/53.98	Low Water (keep): wt=15.000, iters=3894
53.70/53.98	
53.70/53.98	Low Water (keep): wt=14.000, iters=3336
53.70/53.98	
53.70/53.98	Low Water (displace): id=5647, wt=116.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=5656, wt=114.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=5653, wt=109.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=5637, wt=105.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=6487, wt=103.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=6496, wt=101.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=5627, wt=99.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=5636, wt=98.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=6493, wt=97.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=6477, wt=93.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=6461, wt=92.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=6474, wt=91.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=6582, wt=90.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=6588, wt=88.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=6590, wt=87.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=5657, wt=86.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=6586, wt=84.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=5645, wt=82.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=5654, wt=81.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=6599, wt=80.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=5704, wt=79.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=6698, wt=78.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=5701, wt=77.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=21208, wt=15.000
53.70/53.98	
53.70/53.98	Low Water (displace): id=21419, wt=14.000
53.70/53.98	
53.70/53.98	============================== PROOF =================================
53.70/53.98	% SZS status Theorem
53.70/53.98	% SZS output start Refutation
53.70/53.98	
53.70/53.98	% Proof 1 at 50.81 (+ 2.03) seconds.
53.70/53.98	% Length of proof is 75.
53.70/53.98	% Level of proof is 11.
53.70/53.98	% Maximum clause weight is 33.000.
53.70/53.98	% Given clauses 11683.
53.70/53.98	
53.70/53.98	3 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
53.70/53.98	13 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
53.70/53.98	21 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
53.70/53.98	27 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
53.70/53.98	31 (all X all Y (X = Y <-> leq(X,Y) & leq(Y,X))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
53.70/53.98	37 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
53.70/53.98	39 (all X all Y all Q (elem(X,cons(Y,Q)) <-> X = Y | elem(X,Q))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
53.70/53.98	44 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
53.70/53.98	46 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
53.70/53.98	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 (Z != Pid0 & host(Z) = host(Pid0) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (setIn(host(Pid0),index(down,host(Z))) & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid0) & setIn(Pid0,alive) & setIn(Z,alive) -> Pid0 = Z)) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid20,alive) & host(Pid0) = host(Pid20) & 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 Pid20 all Pid0 (host(Pid20) != host(Pid0) & elem(m_Down(Z),queue(host(Pid0))) & wait = index(status,host(Pid0)) & host(index(elid,host(Pid0))) = host(Pid20) & host(Z) = host(Pid20) & setIn(Pid0,alive) -> -(setIn(Pid20,alive) & host(Pid20) = index(ldr,host(Pid20)) & index(status,host(Pid20)) = norm))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid0) = host(Pid30) & index(status,host(Z)) = elec_2 & elec_1 = index(status,host(Pid0)) & 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) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) -> -elem(m_Ack(Z,Pid30),queue(host(Z))))) & (all Z all Pid30 all Pid20 all Pid0 (leq(nbr_proc,s(host(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))) & setIn(Pid0,alive) & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) -> -(host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm & setIn(Z,alive)))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid20 all Pid0 (elem(m_Down(Z),queue(host(Pid0))) & host(Pid20) = host(Z) & host(Pid20) = index(ldr,host(Pid0)) & index(status,host(Pid0)) = norm & setIn(Pid0,alive) & host(Pid20) != host(Pid0) -> -(index(ldr,host(Pid20)) = host(Pid20) & index(status,host(Pid20)) = norm & setIn(Pid20,alive)))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & host(Z) = host(Pid30) & host(Pid20) = host(Pid0) & setIn(Pid20,alive) & setIn(Z,alive) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid20 all Pid0 (-leq(host(Pid20),host(Pid0)) & host(Z) = host(Pid20) & elem(m_Down(Pid20),queue(host(Pid0))) & setIn(Pid0,alive) -> -(setIn(Z,alive) & norm = index(status,host(Z)) & host(Z) = index(ldr,host(Z))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Pid0) = host(Pid20) & index(status,host(Pid0)) = norm & host(Pid0) = index(ldr,host(Pid0)) -> -(setIn(Z,alive) & elem(m_Down(Pid20),queue(host(Z)))))) & (all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Z))) & index(status,host(Pid0)) = elec_2 & host(Pid0) = host(Pid20) & setIn(Pid0,alive) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (setIn(Pid0,alive) & host(Pid0) = index(ldr,host(Pid0)) & norm = index(status,host(Pid0)) -> -(setIn(host(Pid0),index(down,host(Z))) & setIn(Z,alive)))) & (all Z ((elec_1 = index(status,host(Z)) | elec_2 = index(status,host(Z))) & setIn(Z,alive) -> Z = index(elid,host(Z)))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) -> (setIn(X,alive) -> (leq(host(X),host(Y)) -> (elec_2 = index(status,host(X)) & index(pendack,host(X)) = host(Y) -> (leq(nbr_proc,index(pendack,host(X))) -> (all Z (setIn(host(Z),index(acks,host(X))) -> (all V0 (host(V0) = host(X) -> (all W0 all X0 all Y0 (host(Y0) = host(Z) -> (host(Y0) != host(X) -> (setIn(Y0,alive) & elem(m_Down(W0),snoc(queue(host(Y0)),m_Ldr(X))) & host(W0) = s(host(Y0)) & elec_1 = index(status,host(Y0)) & elem(m_Down(X0),snoc(queue(host(Y0)),m_Ldr(X))) & leq(nbr_proc,s(host(Y0))) & (all V1 (-leq(host(Y0),V1) & leq(s(zero),V1) -> V1 = host(X0) | setIn(V1,index(down,host(Y0))))) -> -(setIn(V0,alive) & host(X) = host(V0)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
53.70/53.98	63 leq(s(zero),host(A)) # label(axiom_02) # label(axiom).  [clausify(3)].
53.70/53.98	78 host(A) != s(host(B)) | host(A) != host(B) # label(axiom_01) # label(axiom).  [clausify(13)].
53.70/53.98	93 s(A) = B | leq(B,A) | -leq(B,s(A)) # label(axiom_64) # label(axiom).  [clausify(21)].
53.70/53.98	103 elem(A,B) | C = A | -elem(A,snoc(B,C)) # label(axiom_47) # label(axiom).  [clausify(27)].
53.70/53.98	112 A = B | -leq(B,A) | -leq(A,B) # label(axiom_61) # label(axiom).  [clausify(31)].
53.70/53.98	121 pidMsg(m_Down(A)) = A # label(axiom_50) # label(axiom).  [clausify(37)].
53.70/53.98	124 elem(A,cons(B,C)) | B != A # label(axiom_46) # label(axiom).  [clausify(39)].
53.70/53.98	132 m_Ldr(A) != m_Down(B) # label(axiom_18) # label(axiom).  [clausify(44)].
53.70/53.98	134 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom).  [clausify(46)].
53.70/53.98	164 -setIn(host(A),index(down,host(B))) | index(status,host(A)) != elec_2 | -setIn(A,alive) | -setIn(B,alive) | leq(index(pendack,host(A)),host(B)) # label(conj) # label(negated_conjecture).  [clausify(58)].
53.70/53.98	178 queue(host(c3)) = cons(m_Down(c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
53.70/53.98	179 cons(m_Down(c4),c1) = queue(host(c3)).  [copy(178),flip(a)].
53.70/53.98	184 -elem(m_Down(A),queue(host(B))) | index(status,host(C)) != elec_2 | host(A) != host(C) | -setIn(C,alive) | -setIn(B,alive) | leq(index(pendack,host(C)),host(B)) # label(conj) # label(negated_conjecture).  [clausify(58)].
53.70/53.98	188 -elem(m_Down(A),queue(host(B))) | host(A) != host(B) # label(conj) # label(negated_conjecture).  [clausify(58)].
53.70/53.98	189 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
53.70/53.98	191 index(status,host(c3)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
53.70/53.98	192 elec_2 = index(status,host(c3)).  [copy(191),flip(a)].
53.70/53.98	193 index(pendack,host(c3)) = host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
53.70/53.98	194 leq(nbr_proc,index(pendack,host(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
53.70/53.98	195 leq(nbr_proc,host(c4)).  [copy(194),rewrite([193(5)])].
53.70/53.98	197 host(c6) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
53.70/53.98	198 host(c9) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
53.70/53.98	199 host(c9) != host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
53.70/53.98	200 host(c5) != host(c3).  [copy(199),rewrite([198(2)])].
53.70/53.98	201 setIn(c9,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
53.70/53.98	204 host(c7) = s(host(c9)) # label(conj) # label(negated_conjecture).  [clausify(58)].
53.70/53.98	205 s(host(c5)) = host(c7).  [copy(204),rewrite([198(4)]),flip(a)].
53.70/53.98	208 elem(m_Down(c8),snoc(queue(host(c9)),m_Ldr(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
53.70/53.98	209 elem(m_Down(c8),snoc(queue(host(c5)),m_Ldr(c3))).  [copy(208),rewrite([198(4)])].
53.70/53.98	210 leq(nbr_proc,s(host(c9))) # label(conj) # label(negated_conjecture).  [clausify(58)].
53.70/53.98	211 leq(nbr_proc,host(c7)).  [copy(210),rewrite([198(3),205(4)])].
53.70/53.98	212 leq(host(c9),A) | -leq(s(zero),A) | host(c8) = A | setIn(A,index(down,host(c9))) # label(conj) # label(negated_conjecture).  [clausify(58)].
53.70/53.98	213 leq(host(c5),A) | -leq(s(zero),A) | host(c8) = A | setIn(A,index(down,host(c5))).  [copy(212),rewrite([198(2),198(12)])].
53.70/53.98	227 -elem(m_Down(A),queue(host(B))) | index(status,host(c3)) != index(status,host(C)) | host(A) != host(C) | -setIn(C,alive) | -setIn(B,alive) | leq(index(pendack,host(C)),host(B)).  [back_rewrite(184),rewrite([192(8)]),flip(b)].
53.70/53.98	232 -setIn(host(A),index(down,host(B))) | index(status,host(c3)) != index(status,host(A)) | -setIn(A,alive) | -setIn(B,alive) | leq(index(pendack,host(A)),host(B)).  [back_rewrite(164),rewrite([192(9)]),flip(b)].
53.70/53.98	236 host(c5) = c_0.  [new_symbol(200)].
53.70/53.98	261 leq(c_0,A) | -leq(s(zero),A) | host(c8) = A | setIn(A,index(down,c_0)).  [back_rewrite(213),rewrite([236(2),236(11)])].
53.70/53.98	262 elem(m_Down(c8),snoc(queue(c_0),m_Ldr(c3))).  [back_rewrite(209),rewrite([236(4)])].
53.70/53.98	264 s(c_0) = host(c7).  [back_rewrite(205),rewrite([236(2)])].
53.70/53.98	266 host(c3) != c_0.  [back_rewrite(200),rewrite([236(2)]),flip(a)].
53.70/53.98	267 host(c9) = c_0.  [back_rewrite(198),rewrite([236(4)])].
53.70/53.98	315 elem(A,cons(A,B)).  [resolve(124,b,121,a),rewrite([121(2)])].
53.70/53.98	362 host(c4) = nbr_proc.  [resolve(195,a,112,c),flip(a),unit_del(b,134)].
53.70/53.98	363 index(pendack,host(c3)) = nbr_proc.  [back_rewrite(193),rewrite([362(6)])].
53.70/53.98	373 -elem(m_Down(A),queue(host(c3))) | host(c3) != host(A).  [para(197(a,1),188(a,2,1)),rewrite([197(8)]),flip(b)].
53.70/53.98	376 host(c7) = nbr_proc.  [resolve(211,a,112,c),flip(a),unit_del(b,134)].
53.70/53.98	377 s(c_0) = nbr_proc.  [back_rewrite(264),rewrite([376(4)])].
53.70/53.98	385 host(A) != nbr_proc | host(A) != c_0.  [para(236(a,1),78(a,2,1)),rewrite([377(3),236(6)])].
53.70/53.98	386 leq(c_0,nbr_proc).  [para(236(a,1),134(a,1))].
53.70/53.98	413 leq(c_0,host(A)) | host(c8) = host(A) | setIn(host(A),index(down,c_0)).  [resolve(261,b,63,a)].
53.70/53.98	417 elem(m_Down(c8),queue(c_0)).  [resolve(262,a,103,c),unit_del(b,132)].
53.70/53.98	433 -elem(m_Down(A),queue(c_0)) | index(status,host(c3)) != index(status,host(B)) | host(A) != host(B) | -setIn(B,alive) | leq(index(pendack,host(B)),c_0).  [para(267(a,1),227(a,2,1)),rewrite([267(25)]),unit_del(e,201)].
53.70/53.98	434 -setIn(host(A),index(down,c_0)) | index(status,host(c3)) != index(status,host(A)) | -setIn(A,alive) | leq(index(pendack,host(A)),c_0).  [para(267(a,1),232(a,2,2)),rewrite([267(23)]),unit_del(d,201)].
53.70/53.98	449 c_0 != nbr_proc.  [resolve(385,b,267,a),rewrite([267(2)])].
53.70/53.98	452 -leq(nbr_proc,c_0).  [resolve(386,a,112,c),unit_del(a,449)].
53.70/53.98	545 nbr_proc = A | leq(A,c_0) | -leq(A,nbr_proc).  [para(377(a,1),93(c,2)),rewrite([377(2)])].
53.70/53.98	606 elem(m_Down(c4),queue(host(c3))).  [para(179(a,1),315(a,2))].
53.70/53.98	818 host(c3) != nbr_proc.  [resolve(606,a,373,a),rewrite([362(4)])].
53.70/53.98	2339 host(A) = nbr_proc | leq(host(A),c_0).  [resolve(545,c,134,a),flip(a)].
53.70/53.98	2343 host(A) = nbr_proc | host(A) = c_0 | -leq(c_0,host(A)).  [resolve(2339,b,112,c)].
53.70/53.98	3228 index(status,host(c3)) != index(status,host(A)) | host(c8) != host(A) | -setIn(A,alive) | leq(index(pendack,host(A)),c_0).  [resolve(433,a,417,a)].
53.70/53.98	3320 index(status,host(c3)) != index(status,host(A)) | -setIn(A,alive) | leq(index(pendack,host(A)),c_0) | leq(c_0,host(A)) | host(c8) = host(A).  [resolve(434,a,413,c)].
53.70/53.98	24067 host(c8) != host(c3).  [resolve(3228,c,189,a),rewrite([363(18)]),xx(a),unit_del(b,452)].
53.70/53.98	24249 leq(c_0,host(c3)).  [resolve(3320,b,189,a),rewrite([363(13)]),xx(a),unit_del(a,452),unit_del(c,24067)].
53.70/53.98	24292 $F.  [resolve(24249,a,2343,c),unit_del(a,818),unit_del(b,266)].
53.70/53.98	
53.70/53.98	% SZS output end Refutation
53.70/53.98	============================== end of proof ==========================
53.70/53.98	
53.70/53.98	============================== STATISTICS ============================
53.70/53.98	
53.70/53.98	Given=11683. Generated=4081796. Kept=24214. proofs=1.
53.70/53.98	Usable=8679. Sos=9947. Demods=36. Limbo=42, Disabled=5683. Hints=0.
53.70/53.98	Megabytes=47.92.
53.70/53.98	User_CPU=50.81, System_CPU=2.03, Wall_clock=53.
53.70/53.98	
53.70/53.98	============================== end of statistics =====================
53.70/53.98	
53.70/53.98	============================== end of search =========================
53.70/53.98	
53.70/53.98	THEOREM PROVED
53.70/53.98	% SZS status Theorem
53.70/53.98	
53.70/53.98	Exiting with 1 proof.
53.70/53.98	
53.70/53.98	Process 8377 exit (max_proofs) Wed Jul 14 15:03:18 2021
53.70/53.98	Prover9 interrupted
53.70/53.98	EOF