0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.33	% Computer   : n022.cluster.edu
0.13/0.33	% Model      : x86_64 x86_64
0.13/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory     : 8042.1875MB
0.13/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.33	% CPULimit   : 180
0.13/0.33	% DateTime   : Thu Aug 29 13:53:13 EDT 2019
0.13/0.33	% CPUTime    : 
0.86/1.13	============================== Prover9 ===============================
0.86/1.13	Prover9 (32) version 2009-11A, November 2009.
0.86/1.13	Process 8177 was started by sandbox on n022.cluster.edu,
0.86/1.13	Thu Aug 29 13:53:14 2019
0.86/1.13	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_8023_n022.cluster.edu".
0.86/1.13	============================== end of head ===========================
0.86/1.13	
0.86/1.13	============================== INPUT =================================
0.86/1.13	
0.86/1.13	% Reading from file /tmp/Prover9_8023_n022.cluster.edu
0.86/1.13	
0.86/1.13	set(prolog_style_variables).
0.86/1.13	set(auto2).
0.86/1.13	    % set(auto2) -> set(auto).
0.86/1.13	    % set(auto) -> set(auto_inference).
0.86/1.13	    % set(auto) -> set(auto_setup).
0.86/1.13	    % set(auto_setup) -> set(predicate_elim).
0.86/1.13	    % set(auto_setup) -> assign(eq_defs, unfold).
0.86/1.13	    % set(auto) -> set(auto_limits).
0.86/1.13	    % set(auto_limits) -> assign(max_weight, "100.000").
0.86/1.13	    % set(auto_limits) -> assign(sos_limit, 20000).
0.86/1.13	    % set(auto) -> set(auto_denials).
0.86/1.13	    % set(auto) -> set(auto_process).
0.86/1.13	    % set(auto2) -> assign(new_constants, 1).
0.86/1.13	    % set(auto2) -> assign(fold_denial_max, 3).
0.86/1.13	    % set(auto2) -> assign(max_weight, "200.000").
0.86/1.13	    % set(auto2) -> assign(max_hours, 1).
0.86/1.13	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.86/1.13	    % set(auto2) -> assign(max_seconds, 0).
0.86/1.13	    % set(auto2) -> assign(max_minutes, 5).
0.86/1.13	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.86/1.13	    % set(auto2) -> set(sort_initial_sos).
0.86/1.13	    % set(auto2) -> assign(sos_limit, -1).
0.86/1.13	    % set(auto2) -> assign(lrs_ticks, 3000).
0.86/1.13	    % set(auto2) -> assign(max_megs, 400).
0.86/1.13	    % set(auto2) -> assign(stats, some).
0.86/1.13	    % set(auto2) -> clear(echo_input).
0.86/1.13	    % set(auto2) -> set(quiet).
0.86/1.13	    % set(auto2) -> clear(print_initial_clauses).
0.86/1.13	    % set(auto2) -> clear(print_given).
0.86/1.13	assign(lrs_ticks,-1).
0.86/1.13	assign(sos_limit,10000).
0.86/1.13	assign(order,kbo).
0.86/1.13	set(lex_order_vars).
0.86/1.13	clear(print_given).
0.86/1.13	
0.86/1.13	% formulas(sos).  % not echoed (67 formulas)
0.86/1.13	
0.86/1.13	============================== end of input ==========================
0.86/1.13	
0.86/1.13	% From the command line: assign(max_seconds, 180).
0.86/1.13	
0.86/1.13	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.86/1.13	
0.86/1.13	% Formulas that are not ordinary clauses:
0.86/1.13	1 (all X all Y (Y != X <-> m_NotNorm(Y) != m_NotNorm(X))) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	2 (all X (pidElem(X) <-> (exists Y (m_Halt(Y) = X | m_Down(Y) = X)))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	3 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	4 (all X all Y (m_Down(Y) != m_Down(X) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	5 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	6 (all X all Y all Q snoc(cons(X,Q),Y) = cons(X,snoc(Q,Y))) # label(axiom_44) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	7 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	8 (all X all Y (Y != X <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	9 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	10 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	11 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	13 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	14 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	15 (all Q all X all Y (ordered(Q) -> ordered(snoc(Q,m_Ack(X,Y))))) # label(axiom_55) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	16 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	17 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	18 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	19 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	20 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	21 (all X all Q ((all Y (host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) & pidElem(X) & elem(Y,Q) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q) <-> ordered(snoc(Q,X)))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	22 (all X X = pidMsg(m_Down(X))) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	23 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	24 (all Q (Q = cons(head(Q),tail(Q)) | q_nil = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	25 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	26 (all X all Y all Q (X = Y | elem(X,Q) <-> elem(X,cons(Y,Q)))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	27 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	28 (all P all Q (s(host(P)) = host(Q) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	29 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	30 (all X all Y all Z (leq(X,Y) & leq(Y,Z) -> leq(X,Z))) # label(axiom_62) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	31 (all X all Q Q = tail(cons(X,Q))) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	32 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	33 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	34 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	35 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	36 (all X1 all X2 all Y1 all Y2 (Y1 != Y2 -> m_Ack(X1,Y1) != m_Ack(X2,Y2))) # label(axiom_32) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	37 (all Q (q_nil = Q | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	38 (all Q all X all Y (host(X) = host(Y) & elem(m_Down(Y),Q) & ordered(cons(m_Halt(X),Q)) -> leq(X,Y))) # label(axiom_57) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	39 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	40 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	41 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	42 (all X all Y all Q (X = Y | elem(X,Q) <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	43 (all X all Q (ordered(cons(X,Q)) <-> (all Y (elem(Y,Q) & pidElem(X) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) -> leq(pidMsg(X),pidMsg(Y)))) & ordered(Q))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	44 (all X1 all X2 all Y1 all Y2 (X1 != X2 -> m_Ack(X2,Y2) != m_Ack(X1,Y1))) # label(axiom_31) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	45 (all Pid all Pid2 (elem(m_Ack(Pid,Pid2),queue(host(Pid))) -> setIn(Pid2,pids) & setIn(Pid,pids))) # label(axiom) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	46 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	47 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	48 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.86/1.13	49 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.90/1.15	50 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.90/1.15	51 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.90/1.15	52 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.90/1.15	53 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.90/1.15	54 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.90/1.15	55 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.90/1.15	56 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.90/1.15	57 (all X all Y (m_Halt(Y) != m_Halt(X) <-> X != Y)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.90/1.15	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 Pid20 all Pid0 (host(Pid0) = host(Z) & norm = index(status,host(Pid0)) & host(Pid20) = index(ldr,host(Pid0)) & setIn(Pid0,alive) & host(Pid0) != host(Pid20) -> -elem(m_Down(Z),queue(host(Pid20))))) & cons(m_Ack(W,Y),V) = queue(host(X)) & (all Z all Pid30 all Pid20 all Pid0 (nbr_proc = host(Pid0) & index(status,host(Pid0)) = elec_1 & host(Pid30) = host(Pid0) & elem(m_Down(Pid20),queue(host(Pid0))) & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> V0 = host(Pid20) | setIn(V0,index(down,host(Pid0))))) -> -(elem(m_Down(Pid30),queue(host(Z))) & setIn(Z,alive)))) & (all Z all Pid30 all Pid20 all Pid0 (host(Z) != host(Pid20) & setIn(Pid20,alive) & host(Pid0) = host(Pid20) & host(Pid30) = host(Z) & setIn(Z,alive) -> -(setIn(host(Pid30),index(down,host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Pid20,alive) & host(Pid30) = host(Z) & host(Pid0) = host(Pid20) & setIn(Z,alive) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & setIn(Pid0,alive) & host(index(elid,host(Pid0))) = host(Pid20) & index(status,host(Pid0)) = wait & host(Pid0) = host(Z) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z ((index(status,host(Z)) = elec_2 | elec_1 = index(status,host(Z))) & setIn(Z,alive) -> Z = index(elid,host(Z)))) & (all Z all Pid0 (host(Pid0) = host(Z) & Pid0 != Z -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Z) != host(Pid0))) & (all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (index(elid,host(X)) = W & index(pendack,host(X)) = host(Y) & index(status,host(X)) = elec_2 -> (-leq(nbr_proc,index(pendack,host(X))) -> (all Z (s(index(pendack,host(X))) = host(Z) -> (host(Z) = host(X) -> (all W0 all X0 all Y0 (host(Y0) != s(index(pendack,host(X))) -> (host(X) != host(Y0) -> (elem(m_Down(X0),queue(host(Y0))) & elec_1 = index(status,host(Y0)) & host(Y0) = nbr_proc & host(Y0) = host(W0) & (all V0 (-leq(host(Y0),V0) & leq(s(zero),V0) -> host(X0) = V0 | 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.90/1.15	
0.90/1.15	============================== end of process non-clausal formulas ===
0.90/1.15	
0.90/1.15	============================== PROCESS INITIAL CLAUSES ===============
0.90/1.15	
0.90/1.15	============================== PREDICATE ELIMINATION =================
0.90/1.15	
0.90/1.15	============================== end predicate elimination =============
0.90/1.15	
0.90/1.15	Auto_denials:  (non-Horn, no changes).
0.90/1.15	
0.90/1.15	Term ordering decisions:
0.90/1.15	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.90/1.15	
0.90/1.15	============================== end of process initial clauses ========
19.71/19.99	
19.71/19.99	============================== CLAUSES FOR SEARCH ====================
19.71/19.99	
19.71/19.99	============================== end of clauses for search =============
19.71/19.99	
19.71/19.99	============================== SEARCH ================================
19.71/19.99	
19.71/19.99	% Starting search at 0.03 seconds.
19.71/19.99	
19.71/19.99	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 86 (0.00 of 0.32 sec).
19.71/19.99	
19.71/19.99	Low Water (keep): wt=27.000, iters=3541
19.71/19.99	
19.71/19.99	Low Water (keep): wt=20.000, iters=3415
19.71/19.99	
19.71/19.99	Low Water (keep): wt=18.000, iters=4640
19.71/19.99	
19.71/19.99	Low Water (keep): wt=17.000, iters=4302
19.71/19.99	
19.71/19.99	Low Water (keep): wt=16.000, iters=3899
19.71/19.99	
19.71/19.99	Low Water (keep): wt=15.000, iters=3377
19.71/19.99	
19.71/19.99	============================== PROOF =================================
19.71/19.99	% SZS status Theorem
19.71/19.99	% SZS output start Refutation
19.71/19.99	
19.71/19.99	% Proof 1 at 18.23 (+ 0.64) seconds.
19.71/19.99	% Length of proof is 50.
19.71/19.99	% Level of proof is 11.
19.71/19.99	% Maximum clause weight is 40.000.
19.71/19.99	% Given clauses 6943.
19.71/19.99	
19.71/19.99	26 (all X all Y all Q (X = Y | elem(X,Q) <-> elem(X,cons(Y,Q)))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
19.71/19.99	42 (all X all Y all Q (X = Y | elem(X,Q) <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
19.71/19.99	51 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
19.71/19.99	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 Pid20 all Pid0 (host(Pid0) = host(Z) & norm = index(status,host(Pid0)) & host(Pid20) = index(ldr,host(Pid0)) & setIn(Pid0,alive) & host(Pid0) != host(Pid20) -> -elem(m_Down(Z),queue(host(Pid20))))) & cons(m_Ack(W,Y),V) = queue(host(X)) & (all Z all Pid30 all Pid20 all Pid0 (nbr_proc = host(Pid0) & index(status,host(Pid0)) = elec_1 & host(Pid30) = host(Pid0) & elem(m_Down(Pid20),queue(host(Pid0))) & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> V0 = host(Pid20) | setIn(V0,index(down,host(Pid0))))) -> -(elem(m_Down(Pid30),queue(host(Z))) & setIn(Z,alive)))) & (all Z all Pid30 all Pid20 all Pid0 (host(Z) != host(Pid20) & setIn(Pid20,alive) & host(Pid0) = host(Pid20) & host(Pid30) = host(Z) & setIn(Z,alive) -> -(setIn(host(Pid30),index(down,host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Pid20,alive) & host(Pid30) = host(Z) & host(Pid0) = host(Pid20) & setIn(Z,alive) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & setIn(Pid0,alive) & host(index(elid,host(Pid0))) = host(Pid20) & index(status,host(Pid0)) = wait & host(Pid0) = host(Z) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z ((index(status,host(Z)) = elec_2 | elec_1 = index(status,host(Z))) & setIn(Z,alive) -> Z = index(elid,host(Z)))) & (all Z all Pid0 (host(Pid0) = host(Z) & Pid0 != Z -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Z) != host(Pid0))) & (all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (index(elid,host(X)) = W & index(pendack,host(X)) = host(Y) & index(status,host(X)) = elec_2 -> (-leq(nbr_proc,index(pendack,host(X))) -> (all Z (s(index(pendack,host(X))) = host(Z) -> (host(Z) = host(X) -> (all W0 all X0 all Y0 (host(Y0) != s(index(pendack,host(X))) -> (host(X) != host(Y0) -> (elem(m_Down(X0),queue(host(Y0))) & elec_1 = index(status,host(Y0)) & host(Y0) = nbr_proc & host(Y0) = host(W0) & (all V0 (-leq(host(Y0),V0) & leq(s(zero),V0) -> host(X0) = V0 | 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.71/19.99	102 -elem(A,B) | elem(A,cons(C,B)) # label(axiom_46) # label(axiom).  [clausify(26)].
19.71/19.99	127 A = B | elem(B,C) | -elem(B,snoc(C,A)) # label(axiom_47) # label(axiom).  [clausify(42)].
19.71/19.99	150 m_Down(A) != m_Halt(B) # label(axiom_17) # label(axiom).  [clausify(51)].
19.71/19.99	161 queue(host(c3)) = cons(m_Ack(c2,c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
19.71/19.99	162 cons(m_Ack(c2,c4),c1) = queue(host(c3)).  [copy(161),flip(a)].
19.71/19.99	163 host(A) != nbr_proc | index(status,host(A)) != elec_1 | host(B) != host(A) | -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.71/19.99	164 host(A) != nbr_proc | index(status,host(A)) != elec_1 | host(B) != host(A) | -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.71/19.99	165 host(A) != nbr_proc | index(status,host(A)) != elec_1 | host(B) != host(A) | -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.71/19.99	166 host(A) != nbr_proc | index(status,host(A)) != elec_1 | host(B) != host(A) | -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(165),flip(e)].
19.71/19.99	167 host(A) != nbr_proc | index(status,host(A)) != elec_1 | host(B) != host(A) | -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.71/19.99	171 index(status,host(A)) != elec_2 | -setIn(A,alive) | index(elid,host(A)) = A # label(conj) # label(negated_conjecture).  [clausify(58)].
19.71/19.99	176 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
19.71/19.99	177 index(elid,host(c3)) = c2 # label(conj) # label(negated_conjecture).  [clausify(58)].
19.71/19.99	179 index(status,host(c3)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
19.71/19.99	187 elem(m_Down(c7),queue(host(c8))) # label(conj) # label(negated_conjecture).  [clausify(58)].
19.71/19.99	188 index(status,host(c8)) = elec_1 # label(conj) # label(negated_conjecture).  [clausify(58)].
19.71/19.99	189 host(c8) = nbr_proc # label(conj) # label(negated_conjecture).  [clausify(58)].
19.71/19.99	190 host(c8) = host(c6) # label(conj) # label(negated_conjecture).  [clausify(58)].
19.71/19.99	191 host(c6) = nbr_proc.  [copy(190),rewrite([189(2)]),flip(a)].
19.71/19.99	192 leq(host(c8),A) | -leq(s(zero),A) | host(c7) = A | setIn(A,index(down,host(c8))) # label(conj) # label(negated_conjecture).  [clausify(58)].
19.71/19.99	193 leq(nbr_proc,A) | -leq(s(zero),A) | host(c7) = A | setIn(A,index(down,nbr_proc)).  [copy(192),rewrite([189(2),189(11)])].
19.71/19.99	195 elem(m_Down(c6),snoc(c1,m_Halt(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
19.71/19.99	198 index(status,nbr_proc) = elec_1.  [back_rewrite(188),rewrite([189(3)])].
19.71/19.99	199 elem(m_Down(c7),queue(nbr_proc)).  [back_rewrite(187),rewrite([189(4)])].
19.71/19.99	288 c3 = c2.  [resolve(176,a,171,b),rewrite([179(4),177(7)]),flip(b),xx(a)].
19.71/19.99	293 host(A) != nbr_proc | index(status,host(A)) != elec_1 | host(B) != host(A) | -elem(m_Down(C),queue(host(A))) | f4(c2,B,C,A) != host(C) | -elem(m_Down(B),queue(host(c2))).  [resolve(176,a,166,g),rewrite([288(16),288(21)])].
19.71/19.99	294 host(A) != nbr_proc | index(status,host(A)) != elec_1 | host(B) != host(A) | -elem(m_Down(C),queue(host(A))) | leq(s(zero),f4(c2,B,C,A)) | -elem(m_Down(B),queue(host(c2))).  [resolve(176,a,164,g),rewrite([288(18),288(22)])].
19.71/19.99	295 host(A) != nbr_proc | index(status,host(A)) != elec_1 | host(B) != host(A) | -elem(m_Down(C),queue(host(A))) | -leq(host(A),f4(c2,B,C,A)) | -elem(m_Down(B),queue(host(c2))).  [resolve(176,a,163,g),rewrite([288(17),288(21)])].
19.71/19.99	305 elem(m_Down(c6),snoc(c1,m_Halt(c2))).  [back_rewrite(195),rewrite([288(4)])].
19.71/19.99	310 setIn(c2,alive).  [back_rewrite(176),rewrite([288(1)])].
19.71/19.99	311 cons(m_Ack(c2,c4),c1) = queue(host(c2)).  [back_rewrite(162),rewrite([288(6)])].
19.71/19.99	317 host(A) != nbr_proc | -elem(m_Down(B),queue(nbr_proc)) | -setIn(f4(C,A,B,c8),index(down,nbr_proc)) | -elem(m_Down(A),queue(host(C))) | -setIn(C,alive).  [para(189(a,1),167(e,2,2)),rewrite([189(2),189(6),198(6),189(9),189(12)]),xx(a),xx(b)].
19.71/19.99	361 host(A) != nbr_proc | -elem(m_Down(B),queue(nbr_proc)) | f4(c2,A,B,c8) != host(B) | -elem(m_Down(A),queue(host(c2))).  [para(189(a,1),293(d,2,1)),rewrite([189(2),189(6),198(6),189(9)]),xx(a),xx(b)].
19.71/19.99	387 host(A) != nbr_proc | f4(c2,A,c7,c8) != host(c7) | -elem(m_Down(A),queue(host(c2))).  [resolve(361,b,199,a)].
19.71/19.99	404 host(A) != nbr_proc | -elem(m_Down(B),queue(nbr_proc)) | -leq(nbr_proc,f4(c2,A,B,c8)) | -elem(m_Down(A),queue(host(c2))).  [para(189(a,1),295(d,2,1)),rewrite([189(2),189(6),198(6),189(9),189(15)]),xx(a),xx(b)].
19.71/19.99	406 host(A) != nbr_proc | -leq(nbr_proc,f4(c2,A,c7,c8)) | -elem(m_Down(A),queue(host(c2))).  [resolve(404,b,199,a)].
19.71/19.99	634 elem(m_Down(c6),c1).  [resolve(305,a,127,c),unit_del(a(flip),150)].
19.71/19.99	642 elem(m_Down(c6),cons(A,c1)).  [resolve(634,a,102,a)].
19.71/19.99	1367 elem(m_Down(c6),queue(host(c2))).  [para(311(a,1),642(a,2))].
19.71/19.99	1383 -leq(nbr_proc,f4(c2,c6,c7,c8)).  [resolve(1367,a,406,c),rewrite([191(2)]),xx(a)].
19.71/19.99	1387 f4(c2,c6,c7,c8) != host(c7).  [resolve(1367,a,387,c),rewrite([191(2)]),xx(a)].
19.71/19.99	1996 host(A) != nbr_proc | index(status,host(A)) != elec_1 | -elem(m_Down(B),queue(host(A))) | leq(s(zero),f4(c2,c6,B,A)).  [resolve(294,f,1367,a),rewrite([191(10)]),flip(c),merge(c)].
19.71/19.99	16075 -elem(m_Down(A),queue(nbr_proc)) | leq(s(zero),f4(c2,c6,A,c8)).  [para(189(a,1),1996(c,2,1)),rewrite([189(2),189(6),198(6)]),xx(a),xx(b)].
19.71/19.99	16470 leq(s(zero),f4(c2,c6,c7,c8)).  [resolve(16075,a,199,a)].
19.71/19.99	16500 setIn(f4(c2,c6,c7,c8),index(down,nbr_proc)).  [resolve(16470,a,193,b),flip(b),unit_del(a,1383),unit_del(b,1387)].
19.71/19.99	16545 $F.  [resolve(16500,a,317,c),rewrite([191(2)]),xx(a),unit_del(a,199),unit_del(b,1367),unit_del(c,310)].
19.71/19.99	
19.71/19.99	% SZS output end Refutation
19.71/19.99	============================== end of proof ==========================
19.71/19.99	
19.71/19.99	============================== STATISTICS ============================
19.71/19.99	
19.71/19.99	Given=6943. Generated=1269866. Kept=16473. proofs=1.
19.71/19.99	Usable=5001. Sos=8726. Demods=34. Limbo=0, Disabled=2873. Hints=0.
19.71/19.99	Megabytes=30.29.
19.71/19.99	User_CPU=18.24, System_CPU=0.64, Wall_clock=19.
19.71/19.99	
19.71/19.99	============================== end of statistics =====================
19.71/19.99	
19.71/19.99	============================== end of search =========================
19.71/19.99	
19.71/19.99	THEOREM PROVED
19.71/19.99	% SZS status Theorem
19.71/19.99	
19.71/19.99	Exiting with 1 proof.
19.71/19.99	
19.71/19.99	Process 8177 exit (max_proofs) Thu Aug 29 13:53:33 2019
19.71/19.99	Prover9 interrupted
19.71/19.99	EOF