0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.33	% Computer   : n008.cluster.edu
0.13/0.33	% Model      : x86_64 x86_64
0.13/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory     : 8042.1875MB
0.13/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.33	% CPULimit   : 1200
0.13/0.33	% DateTime   : Wed Jul 14 15:01:44 EDT 2021
0.13/0.34	% CPUTime    : 
0.43/1.06	============================== Prover9 ===============================
0.43/1.06	Prover9 (32) version 2009-11A, November 2009.
0.43/1.06	Process 8302 was started by sandbox on n008.cluster.edu,
0.43/1.06	Wed Jul 14 15:01:45 2021
0.43/1.06	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_8149_n008.cluster.edu".
0.43/1.06	============================== end of head ===========================
0.43/1.06	
0.43/1.06	============================== INPUT =================================
0.43/1.06	
0.43/1.06	% Reading from file /tmp/Prover9_8149_n008.cluster.edu
0.43/1.06	
0.43/1.06	set(prolog_style_variables).
0.43/1.06	set(auto2).
0.43/1.06	    % set(auto2) -> set(auto).
0.43/1.06	    % set(auto) -> set(auto_inference).
0.43/1.06	    % set(auto) -> set(auto_setup).
0.43/1.06	    % set(auto_setup) -> set(predicate_elim).
0.43/1.06	    % set(auto_setup) -> assign(eq_defs, unfold).
0.43/1.06	    % set(auto) -> set(auto_limits).
0.43/1.06	    % set(auto_limits) -> assign(max_weight, "100.000").
0.43/1.06	    % set(auto_limits) -> assign(sos_limit, 20000).
0.43/1.06	    % set(auto) -> set(auto_denials).
0.43/1.06	    % set(auto) -> set(auto_process).
0.43/1.06	    % set(auto2) -> assign(new_constants, 1).
0.43/1.06	    % set(auto2) -> assign(fold_denial_max, 3).
0.43/1.06	    % set(auto2) -> assign(max_weight, "200.000").
0.43/1.06	    % set(auto2) -> assign(max_hours, 1).
0.43/1.06	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.43/1.06	    % set(auto2) -> assign(max_seconds, 0).
0.43/1.06	    % set(auto2) -> assign(max_minutes, 5).
0.43/1.06	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.43/1.06	    % set(auto2) -> set(sort_initial_sos).
0.43/1.06	    % set(auto2) -> assign(sos_limit, -1).
0.43/1.06	    % set(auto2) -> assign(lrs_ticks, 3000).
0.43/1.06	    % set(auto2) -> assign(max_megs, 400).
0.43/1.06	    % set(auto2) -> assign(stats, some).
0.43/1.06	    % set(auto2) -> clear(echo_input).
0.43/1.06	    % set(auto2) -> set(quiet).
0.43/1.06	    % set(auto2) -> clear(print_initial_clauses).
0.43/1.06	    % set(auto2) -> clear(print_given).
0.43/1.06	assign(lrs_ticks,-1).
0.43/1.06	assign(sos_limit,10000).
0.43/1.06	assign(order,kbo).
0.43/1.06	set(lex_order_vars).
0.43/1.06	clear(print_given).
0.43/1.06	
0.43/1.06	% formulas(sos).  % not echoed (67 formulas)
0.43/1.06	
0.43/1.06	============================== end of input ==========================
0.43/1.06	
0.43/1.06	% From the command line: assign(max_seconds, 1200).
0.43/1.06	
0.43/1.06	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.43/1.06	
0.43/1.06	% Formulas that are not ordinary clauses:
0.43/1.06	1 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.43/1.06	2 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.43/1.06	3 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.43/1.06	4 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.43/1.06	5 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.43/1.06	6 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.43/1.06	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.43/1.06	8 (all Q (cons(head(Q),tail(Q)) = Q | q_nil = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.43/1.06	9 (all X all Y (X != Y <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.43/1.06	10 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.43/1.06	11 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.43/1.06	12 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.43/1.06	13 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.43/1.06	14 (all X all Y (m_NormQ(Y) != m_NormQ(X) <-> X != Y)) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.43/1.06	15 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.43/1.06	16 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.43/1.06	17 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	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.43/1.07	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.43/1.07	20 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	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.43/1.07	22 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	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.43/1.07	24 (all X all Y (m_NotNorm(X) != m_NotNorm(Y) <-> X != Y)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	25 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	26 (all X all Y (X != Y <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	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.43/1.07	28 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	29 (all Q (Q = snoc(init(Q),last(Q)) | q_nil = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	30 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	31 (all X all Y (X = Y <-> leq(X,Y) & leq(Y,X))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	32 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	33 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	34 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	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.43/1.07	36 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	37 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	38 (all X all Y m_NotNorm(X) != m_Halt(Y)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	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.43/1.07	40 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	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.43/1.07	42 (all X all Y all Z m_NormQ(Z) != m_Ack(X,Y)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	43 (all X all Y (m_Down(Y) != m_Down(X) <-> Y != X)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	44 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	45 (all Y all Q Q = init(snoc(Q,Y))) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	46 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	47 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	48 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	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.43/1.07	50 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	51 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.43/1.07	52 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	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.79/1.08	54 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	55 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	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.79/1.08	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.79/1.08	58 -(all V all W all X all Y ((all Z all Pid0 (host(Pid0) = nbr_proc -> -elem(m_NotNorm(Z),queue(host(Pid0))))) & (all Z all Pid0 (Z != Pid0 & host(Z) = host(Pid0) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z ((index(status,host(Z)) = elec_2 | elec_1 = index(status,host(Z))) & setIn(Z,alive) -> index(elid,host(Z)) = Z)) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & setIn(Pid0,alive) & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid20) & host(Pid0) = host(Z) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Pid20) = host(index(elid,host(Pid0))) & index(status,host(Pid0)) = wait & host(Pid0) = host(Z) & host(Pid20) != host(Pid0) -> -elem(m_Down(Z),queue(host(Pid20))))) & (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 Pid30 all Pid20 all Pid0 (host(Z) != host(Pid20) & setIn(Z,alive) & host(Pid0) = host(Pid20) & host(Pid30) = host(Z) & setIn(Pid20,alive) -> -(setIn(host(Pid30),index(down,host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (index(status,host(Pid0)) = elec_1 & host(Pid0) = host(Pid30) & host(Pid0) = nbr_proc & elem(m_Down(Pid20),queue(host(Pid0))) & (all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) -> -(elem(m_Down(Pid30),queue(host(Z))) & setIn(Z,alive)))) & queue(host(X)) = cons(m_Ack(W,Y),V) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (index(elid,host(X)) = W & host(Y) = index(pendack,host(X)) & index(status,host(X)) = elec_2 -> (-leq(nbr_proc,index(pendack,host(X))) -> (all Z (host(Z) = s(index(pendack,host(X))) -> (host(X) = host(Z) -> (all W0 all X0 all Y0 (s(index(pendack,host(X))) != host(Y0) -> (host(X) != host(Y0) -> (elem(m_Down(X0),queue(host(Y0))) & host(Y0) = host(W0) & host(Y0) = nbr_proc & elec_1 = index(status,host(Y0)) & (all V0 (leq(s(zero),V0) & -leq(host(Y0),V0) -> V0 = host(X0) | setIn(V0,index(down,host(Y0))))) -> -(setIn(Z,alive) & elem(m_Down(W0),snoc(V,m_Halt(X)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.79/1.08	
0.79/1.08	============================== end of process non-clausal formulas ===
0.79/1.08	
0.79/1.08	============================== PROCESS INITIAL CLAUSES ===============
0.79/1.08	
0.79/1.08	============================== PREDICATE ELIMINATION =================
0.79/1.08	
0.79/1.08	============================== end predicate elimination =============
0.79/1.08	
0.79/1.08	Auto_denials:  (non-Horn, no changes).
0.79/1.08	
0.79/1.08	Term ordering decisions:
0.79/1.08	Function symbol KB weights:  alive=1. q_nil=1. status=1. elid=1. nbr_proc=1. zero=1. elec_1=1. down=1. elec_2=1. pendack=1. pids=1. ldr=1. norm=1. wait=1. nil=1. setEmpty=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. snoc=1. cons=1. index=1. m_Ack=1. f2=1. f3=1. host=1. pidMsg=1. m_Down=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.
0.79/1.08	
0.79/1.08	============================== end of process initial clauses ========
19.52/19.83	
19.52/19.83	============================== CLAUSES FOR SEARCH ====================
19.52/19.83	
19.52/19.83	============================== end of clauses for search =============
19.52/19.83	
19.52/19.83	============================== SEARCH ================================
19.52/19.83	
19.52/19.83	% Starting search at 0.03 seconds.
19.52/19.83	
19.52/19.83	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 71 (0.00 of 0.37 sec).
19.52/19.83	
19.52/19.83	Low Water (keep): wt=22.000, iters=3894
19.52/19.83	
19.52/19.83	Low Water (keep): wt=18.000, iters=3445
19.52/19.83	
19.52/19.83	Low Water (keep): wt=17.000, iters=3336
19.52/19.83	
19.52/19.83	Low Water (keep): wt=16.000, iters=3333
19.52/19.83	
19.52/19.83	Low Water (keep): wt=15.000, iters=3341
19.52/19.83	
19.52/19.83	============================== PROOF =================================
19.52/19.83	% SZS status Theorem
19.52/19.83	% SZS output start Refutation
19.52/19.83	
19.52/19.83	% Proof 1 at 18.16 (+ 0.62) seconds.
19.52/19.83	% Length of proof is 53.
19.52/19.83	% Level of proof is 11.
19.52/19.83	% Maximum clause weight is 40.000.
19.52/19.83	% Given clauses 6845.
19.52/19.83	
19.52/19.83	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].
19.52/19.83	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].
19.52/19.83	55 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
19.52/19.83	58 -(all V all W all X all Y ((all Z all Pid0 (host(Pid0) = nbr_proc -> -elem(m_NotNorm(Z),queue(host(Pid0))))) & (all Z all Pid0 (Z != Pid0 & host(Z) = host(Pid0) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z ((index(status,host(Z)) = elec_2 | elec_1 = index(status,host(Z))) & setIn(Z,alive) -> index(elid,host(Z)) = Z)) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & setIn(Pid0,alive) & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid20) & host(Pid0) = host(Z) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Pid20) = host(index(elid,host(Pid0))) & index(status,host(Pid0)) = wait & host(Pid0) = host(Z) & host(Pid20) != host(Pid0) -> -elem(m_Down(Z),queue(host(Pid20))))) & (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 Pid30 all Pid20 all Pid0 (host(Z) != host(Pid20) & setIn(Z,alive) & host(Pid0) = host(Pid20) & host(Pid30) = host(Z) & setIn(Pid20,alive) -> -(setIn(host(Pid30),index(down,host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (index(status,host(Pid0)) = elec_1 & host(Pid0) = host(Pid30) & host(Pid0) = nbr_proc & elem(m_Down(Pid20),queue(host(Pid0))) & (all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) -> -(elem(m_Down(Pid30),queue(host(Z))) & setIn(Z,alive)))) & queue(host(X)) = cons(m_Ack(W,Y),V) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (index(elid,host(X)) = W & host(Y) = index(pendack,host(X)) & index(status,host(X)) = elec_2 -> (-leq(nbr_proc,index(pendack,host(X))) -> (all Z (host(Z) = s(index(pendack,host(X))) -> (host(X) = host(Z) -> (all W0 all X0 all Y0 (s(index(pendack,host(X))) != host(Y0) -> (host(X) != host(Y0) -> (elem(m_Down(X0),queue(host(Y0))) & host(Y0) = host(W0) & host(Y0) = nbr_proc & elec_1 = index(status,host(Y0)) & (all V0 (leq(s(zero),V0) & -leq(host(Y0),V0) -> V0 = host(X0) | setIn(V0,index(down,host(Y0))))) -> -(setIn(Z,alive) & elem(m_Down(W0),snoc(V,m_Halt(X)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
19.52/19.83	102 elem(A,B) | C = A | -elem(A,snoc(B,C)) # label(axiom_47) # label(axiom).  [clausify(27)].
19.52/19.83	125 elem(A,cons(B,C)) | -elem(A,C) # label(axiom_46) # label(axiom).  [clausify(39)].
19.52/19.83	151 m_Halt(A) != m_Down(B) # label(axiom_17) # label(axiom).  [clausify(55)].
19.52/19.83	163 index(status,host(A)) != elec_2 | -setIn(A,alive) | index(elid,host(A)) = A # label(conj) # label(negated_conjecture).  [clausify(58)].
19.52/19.83	169 index(status,host(A)) != elec_1 | host(B) != host(A) | host(A) != nbr_proc | -elem(m_Down(C),queue(host(A))) | leq(s(zero),f4(D,B,C,A)) | -elem(m_Down(B),queue(host(D))) | -setIn(D,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
19.52/19.83	170 index(status,host(A)) != elec_1 | host(B) != host(A) | host(A) != nbr_proc | -elem(m_Down(C),queue(host(A))) | -leq(host(A),f4(D,B,C,A)) | -elem(m_Down(B),queue(host(D))) | -setIn(D,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
19.52/19.83	171 index(status,host(A)) != elec_1 | host(B) != host(A) | host(A) != nbr_proc | -elem(m_Down(C),queue(host(A))) | host(C) != f4(D,B,C,A) | -elem(m_Down(B),queue(host(D))) | -setIn(D,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
19.52/19.83	172 index(status,host(A)) != elec_1 | host(B) != host(A) | host(A) != nbr_proc | -elem(m_Down(C),queue(host(A))) | f4(D,B,C,A) != host(C) | -elem(m_Down(B),queue(host(D))) | -setIn(D,alive).  [copy(171),flip(e)].
19.52/19.83	173 index(status,host(A)) != elec_1 | host(B) != host(A) | host(A) != nbr_proc | -elem(m_Down(C),queue(host(A))) | -setIn(f4(D,B,C,A),index(down,host(A))) | -elem(m_Down(B),queue(host(D))) | -setIn(D,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
19.52/19.83	174 queue(host(c3)) = cons(m_Ack(c2,c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
19.52/19.83	175 cons(m_Ack(c2,c4),c1) = queue(host(c3)).  [copy(174),flip(a)].
19.52/19.83	178 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
19.52/19.83	179 index(elid,host(c3)) = c2 # label(conj) # label(negated_conjecture).  [clausify(58)].
19.52/19.83	181 index(status,host(c3)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
19.52/19.83	189 elem(m_Down(c7),queue(host(c8))) # label(conj) # label(negated_conjecture).  [clausify(58)].
19.52/19.83	190 host(c8) = host(c6) # label(conj) # label(negated_conjecture).  [clausify(58)].
19.52/19.83	191 host(c8) = nbr_proc # label(conj) # label(negated_conjecture).  [clausify(58)].
19.52/19.83	192 host(c6) = nbr_proc.  [copy(191),rewrite([190(2)])].
19.52/19.83	193 index(status,host(c8)) = elec_1 # label(conj) # label(negated_conjecture).  [clausify(58)].
19.52/19.83	194 index(status,nbr_proc) = elec_1.  [copy(193),rewrite([190(3),192(3)])].
19.52/19.83	195 -leq(s(zero),A) | leq(host(c8),A) | host(c7) = A | setIn(A,index(down,host(c8))) # label(conj) # label(negated_conjecture).  [clausify(58)].
19.52/19.83	196 -leq(s(zero),A) | leq(nbr_proc,A) | host(c7) = A | setIn(A,index(down,nbr_proc)).  [copy(195),rewrite([190(5),192(5),190(11),192(11)])].
19.52/19.83	198 elem(m_Down(c6),snoc(c1,m_Halt(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
19.52/19.83	201 elem(m_Down(c7),queue(nbr_proc)).  [back_rewrite(189),rewrite([190(4),192(4)])].
19.52/19.83	290 index(status,host(A)) != elec_1 | host(B) != host(A) | host(A) != nbr_proc | -elem(m_Down(C),queue(host(A))) | f4(c3,B,C,A) != host(C) | -elem(m_Down(B),queue(host(c3))).  [resolve(178,a,172,g)].
19.52/19.83	291 index(status,host(A)) != elec_1 | host(B) != host(A) | host(A) != nbr_proc | -elem(m_Down(C),queue(host(A))) | -leq(host(A),f4(c3,B,C,A)) | -elem(m_Down(B),queue(host(c3))).  [resolve(178,a,170,g)].
19.52/19.83	292 index(status,host(A)) != elec_1 | host(B) != host(A) | host(A) != nbr_proc | -elem(m_Down(C),queue(host(A))) | leq(s(zero),f4(c3,B,C,A)) | -elem(m_Down(B),queue(host(c3))).  [resolve(178,a,169,g)].
19.52/19.83	296 c3 = c2.  [resolve(178,a,163,b),rewrite([181(4),179(7)]),flip(b),xx(a)].
19.52/19.83	304 index(status,host(A)) != elec_1 | host(B) != host(A) | host(A) != nbr_proc | -elem(m_Down(C),queue(host(A))) | leq(s(zero),f4(c2,B,C,A)) | -elem(m_Down(B),queue(host(c2))).  [back_rewrite(292),rewrite([296(18),296(22)])].
19.52/19.83	305 index(status,host(A)) != elec_1 | host(B) != host(A) | host(A) != nbr_proc | -elem(m_Down(C),queue(host(A))) | -leq(host(A),f4(c2,B,C,A)) | -elem(m_Down(B),queue(host(c2))).  [back_rewrite(291),rewrite([296(17),296(21)])].
19.52/19.83	306 index(status,host(A)) != elec_1 | host(B) != host(A) | host(A) != nbr_proc | -elem(m_Down(C),queue(host(A))) | f4(c2,B,C,A) != host(C) | -elem(m_Down(B),queue(host(c2))).  [back_rewrite(290),rewrite([296(16),296(21)])].
19.52/19.83	314 elem(m_Down(c6),snoc(c1,m_Halt(c2))).  [back_rewrite(198),rewrite([296(4)])].
19.52/19.83	319 setIn(c2,alive).  [back_rewrite(178),rewrite([296(1)])].
19.52/19.83	320 cons(m_Ack(c2,c4),c1) = queue(host(c2)).  [back_rewrite(175),rewrite([296(6)])].
19.52/19.83	328 host(A) != nbr_proc | -elem(m_Down(B),queue(nbr_proc)) | -setIn(f4(C,A,B,c6),index(down,nbr_proc)) | -elem(m_Down(A),queue(host(C))) | -setIn(C,alive).  [para(192(a,1),173(e,2,2)),rewrite([192(3),194(3),192(6),192(8),192(12)]),xx(a),xx(c)].
19.52/19.83	379 host(A) != nbr_proc | -elem(m_Down(B),queue(nbr_proc)) | -leq(nbr_proc,f4(c2,A,B,c6)) | -elem(m_Down(A),queue(host(c2))).  [para(192(a,1),305(d,2,1)),rewrite([192(3),194(3),192(6),192(8),192(15)]),xx(a),xx(c)].
19.52/19.83	402 host(A) != nbr_proc | -leq(nbr_proc,f4(c2,A,c7,c6)) | -elem(m_Down(A),queue(host(c2))).  [resolve(379,b,201,a)].
19.52/19.83	424 host(A) != nbr_proc | -elem(m_Down(B),queue(nbr_proc)) | f4(c2,A,B,c6) != host(B) | -elem(m_Down(A),queue(host(c2))).  [para(192(a,1),306(d,2,1)),rewrite([192(3),194(3),192(6),192(8)]),xx(a),xx(c)].
19.52/19.83	426 host(A) != nbr_proc | f4(c2,A,c7,c6) != host(c7) | -elem(m_Down(A),queue(host(c2))).  [resolve(424,b,201,a)].
19.52/19.83	598 elem(m_Down(c6),c1).  [resolve(314,a,102,c),unit_del(b,151)].
19.52/19.83	614 elem(m_Down(c6),cons(A,c1)).  [resolve(598,a,125,b)].
19.52/19.83	1341 elem(m_Down(c6),queue(host(c2))).  [para(320(a,1),614(a,2))].
19.52/19.83	1348 f4(c2,c6,c7,c6) != host(c7).  [resolve(1341,a,426,c),rewrite([192(2)]),xx(a)].
19.52/19.83	1352 -leq(nbr_proc,f4(c2,c6,c7,c6)).  [resolve(1341,a,402,c),rewrite([192(2)]),xx(a)].
19.52/19.83	2084 index(status,host(A)) != elec_1 | host(A) != nbr_proc | -elem(m_Down(B),queue(host(A))) | leq(s(zero),f4(c2,c6,B,A)).  [resolve(304,f,1341,a),rewrite([192(7)]),flip(b),merge(c)].
19.52/19.83	15920 -elem(m_Down(A),queue(nbr_proc)) | leq(s(zero),f4(c2,c6,A,c6)).  [para(192(a,1),2084(c,2,1)),rewrite([192(3),194(3),192(5)]),xx(a),xx(b)].
19.52/19.83	15922 leq(s(zero),f4(c2,c6,c7,c6)).  [resolve(15920,a,201,a)].
19.52/19.83	15951 setIn(f4(c2,c6,c7,c6),index(down,nbr_proc)).  [resolve(15922,a,196,a),flip(b),unit_del(a,1352),unit_del(b,1348)].
19.52/19.83	15997 $F.  [resolve(15951,a,328,c),rewrite([192(2)]),xx(a),unit_del(a,201),unit_del(b,1341),unit_del(c,319)].
19.52/19.83	
19.52/19.83	% SZS output end Refutation
19.52/19.83	============================== end of proof ==========================
19.52/19.83	
19.52/19.83	============================== STATISTICS ============================
19.52/19.83	
19.52/19.83	Given=6845. Generated=1254142. Kept=15924. proofs=1.
19.52/19.83	Usable=4838. Sos=8251. Demods=34. Limbo=0, Disabled=2962. Hints=0.
19.52/19.83	Megabytes=32.36.
19.52/19.83	User_CPU=18.16, System_CPU=0.62, Wall_clock=18.
19.52/19.83	
19.52/19.83	============================== end of statistics =====================
19.52/19.83	
19.52/19.83	============================== end of search =========================
19.52/19.83	
19.52/19.83	THEOREM PROVED
19.52/19.83	% SZS status Theorem
19.52/19.83	
19.52/19.83	Exiting with 1 proof.
19.52/19.83	
19.52/19.83	Process 8302 exit (max_proofs) Wed Jul 14 15:02:03 2021
19.52/19.83	Prover9 interrupted
19.52/19.83	EOF