0.06/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer : n008.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit : 1440
0.13/0.34	% WCLimit  : 180
0.13/0.34	% DateTime : Mon Jul  3 07:14:04 EDT 2023
0.13/0.34	% CPUTime  : 
0.80/1.07	============================== Prover9 ===============================
0.80/1.07	Prover9 (32) version 2009-11A, November 2009.
0.80/1.07	Process 24743 was started by sandbox2 on n008.cluster.edu,
0.80/1.07	Mon Jul  3 07:14:05 2023
0.80/1.07	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_24346_n008.cluster.edu".
0.80/1.07	============================== end of head ===========================
0.80/1.07	
0.80/1.07	============================== INPUT =================================
0.80/1.07	
0.80/1.07	% Reading from file /tmp/Prover9_24346_n008.cluster.edu
0.80/1.07	
0.80/1.07	set(prolog_style_variables).
0.80/1.07	set(auto2).
0.80/1.07	    % set(auto2) -> set(auto).
0.80/1.07	    % set(auto) -> set(auto_inference).
0.80/1.07	    % set(auto) -> set(auto_setup).
0.80/1.07	    % set(auto_setup) -> set(predicate_elim).
0.80/1.07	    % set(auto_setup) -> assign(eq_defs, unfold).
0.80/1.07	    % set(auto) -> set(auto_limits).
0.80/1.07	    % set(auto_limits) -> assign(max_weight, "100.000").
0.80/1.07	    % set(auto_limits) -> assign(sos_limit, 20000).
0.80/1.07	    % set(auto) -> set(auto_denials).
0.80/1.07	    % set(auto) -> set(auto_process).
0.80/1.07	    % set(auto2) -> assign(new_constants, 1).
0.80/1.07	    % set(auto2) -> assign(fold_denial_max, 3).
0.80/1.07	    % set(auto2) -> assign(max_weight, "200.000").
0.80/1.07	    % set(auto2) -> assign(max_hours, 1).
0.80/1.07	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.80/1.07	    % set(auto2) -> assign(max_seconds, 0).
0.80/1.07	    % set(auto2) -> assign(max_minutes, 5).
0.80/1.07	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.80/1.07	    % set(auto2) -> set(sort_initial_sos).
0.80/1.07	    % set(auto2) -> assign(sos_limit, -1).
0.80/1.07	    % set(auto2) -> assign(lrs_ticks, 3000).
0.80/1.07	    % set(auto2) -> assign(max_megs, 400).
0.80/1.07	    % set(auto2) -> assign(stats, some).
0.80/1.07	    % set(auto2) -> clear(echo_input).
0.80/1.07	    % set(auto2) -> set(quiet).
0.80/1.07	    % set(auto2) -> clear(print_initial_clauses).
0.80/1.07	    % set(auto2) -> clear(print_given).
0.80/1.07	assign(lrs_ticks,-1).
0.80/1.07	assign(sos_limit,10000).
0.80/1.07	assign(order,kbo).
0.80/1.07	set(lex_order_vars).
0.80/1.07	clear(print_given).
0.80/1.07	
0.80/1.07	% formulas(sos).  % not echoed (67 formulas)
0.80/1.07	
0.80/1.07	============================== end of input ==========================
0.80/1.07	
0.80/1.07	% From the command line: assign(max_seconds, 1440).
0.80/1.07	
0.80/1.07	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.80/1.07	
0.80/1.07	% Formulas that are not ordinary clauses:
0.80/1.07	1 (all X1 all X2 all Y1 all Y2 (Y2 != Y1 -> m_Ack(X2,Y2) != m_Ack(X1,Y1))) # label(axiom_32) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	2 (all X all Y (m_Ldr(X) != m_Ldr(Y) <-> X != Y)) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	3 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	4 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	5 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	6 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	7 (all X all Q (ordered(cons(X,Q)) <-> ordered(Q) & (all Y (pidElem(Y) & host(pidMsg(X)) = host(pidMsg(Y)) & pidElem(X) & elem(Y,Q) -> leq(pidMsg(X),pidMsg(Y)))))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	8 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	9 (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.80/1.07	10 (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.80/1.07	11 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	12 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	13 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	14 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	15 (all X all Y (Y = X <-> leq(Y,X) & leq(X,Y))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	16 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	17 (all X all Q (ordered(snoc(Q,X)) <-> ordered(Q) & (all Y (elem(Y,Q) & pidElem(Y) & host(pidMsg(X)) = host(pidMsg(Y)) & pidElem(X) -> leq(pidMsg(Y),pidMsg(X)))))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	18 (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.80/1.07	19 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	20 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	21 (all X all Y m_NormQ(Y) != m_Ldr(X)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	22 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	23 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	24 (all Q (cons(head(Q),tail(Q)) = Q | Q = q_nil)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	25 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	26 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	27 (all P all Q (host(Q) = s(host(P)) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	28 (all Q all X all Y (elem(m_Down(Y),Q) & host(X) = host(Y) & ordered(cons(m_Halt(X),Q)) -> leq(X,Y))) # label(axiom_57) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	29 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	30 (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.80/1.07	31 (all X (pidElem(X) <-> (exists Y (m_Down(Y) = X | m_Halt(Y) = X)))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	32 (all X all Y (m_Halt(Y) != m_Halt(X) <-> Y != X)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	33 (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.80/1.07	34 (all Y all Q Q = init(snoc(Q,Y))) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	35 (all Q (Q = q_nil | snoc(init(Q),last(Q)) = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	36 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	37 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	38 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	39 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	40 (all X all Y (m_Down(X) != m_Down(Y) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	41 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	42 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	43 (all X all Y m_Ldr(X) != m_NotNorm(Y)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	44 (all X all Y (Y != X <-> m_NotNorm(X) != m_NotNorm(Y))) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	45 (all X all Y m_NotNorm(Y) != m_NormQ(X)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	46 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	47 (all X all Y all Q (Y = X | elem(X,Q) <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	48 (all X all Y (leq(X,Y) | s(Y) = X <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	49 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.80/1.07	50 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.82/1.08	51 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.82/1.08	52 (all X all Y all Z m_Ldr(Z) != m_Ack(X,Y)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.82/1.08	53 (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.82/1.08	54 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.82/1.08	55 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.82/1.08	56 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.82/1.08	57 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.82/1.08	58 -(all V all W all X all Y ((all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (host(Pid0) = nbr_proc -> -elem(m_NotNorm(Z),queue(host(Pid0))))) & (all Z (setIn(Z,alive) & (elec_1 = index(status,host(Z)) | elec_2 = index(status,host(Z))) -> index(elid,host(Z)) = Z)) & (all Z all Pid20 all Pid0 (host(Pid20) != host(Pid0) & setIn(Pid0,alive) & wait = index(status,host(Pid0)) & host(index(elid,host(Pid0))) = host(Pid20) & host(Pid0) = host(Z) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid30 all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid0) = nbr_proc & host(Pid0) = host(Pid30) & elec_1 = index(status,host(Pid0)) & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) -> -(setIn(Z,alive) & elem(m_Down(Pid30),queue(host(Z)))))) & cons(m_Ack(W,Y),V) = queue(host(X)) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Pid20,alive) & host(Pid30) = host(Z) & host(Pid20) = host(Pid0) & 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 (setIn(Z,alive) & host(Pid20) = host(Pid0) & host(Pid30) = host(Z) & setIn(Pid20,alive) & host(Pid20) != host(Z) -> -(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(Pid0) = host(Z) & index(status,host(Pid0)) = norm & host(Pid20) = index(ldr,host(Pid0)) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid0 (host(Z) = host(Pid0) & Z != Pid0 -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (-(W = index(elid,host(X)) & host(Y) = index(pendack,host(X)) & index(status,host(X)) = elec_2) -> (all Z (host(Z) != host(X) -> (all W0 all X0 all Y0 (host(Y0) = host(X) -> (elem(m_Down(X0),V) & nbr_proc = host(Y0) & elec_1 = index(status,host(Y0)) & host(W0) = host(Y0) & (all V0 (-leq(host(Y0),V0) & leq(s(zero),V0) -> host(X0) = V0 | setIn(V0,index(down,host(Y0))))) -> -(elem(m_Down(W0),queue(host(Z))) & setIn(Z,alive))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.82/1.08	
0.82/1.08	============================== end of process non-clausal formulas ===
0.82/1.08	
0.82/1.08	============================== PROCESS INITIAL CLAUSES ===============
0.82/1.08	
0.82/1.08	============================== PREDICATE ELIMINATION =================
0.82/1.08	
0.82/1.08	============================== end predicate elimination =============
0.82/1.08	
0.82/1.08	Auto_denials:  (non-Horn, no changes).
0.82/1.08	
0.82/1.08	Term ordering decisions:
0.82/1.08	Function symbol KB weights:  alive=1. q_nil=1. status=1. nbr_proc=1. zero=1. elec_1=1. elid=1. down=1. pids=1. elec_2=1. ldr=1. norm=1. wait=1. nil=1. pendack=1. setEmpty=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. cons=1. snoc=1. index=1. m_Ack=1. f1=1. f2=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. f3=1. f4=1.
0.82/1.08	
0.82/1.08	============================== end of process initial clauses ========
0.82/1.08	
0.82/1.08	============================== CLAUSES FOR SEARCH ====================
0.82/1.08	
0.82/1.08	============================== end of clauses for search =============
56.45/56.75	
56.45/56.75	============================== SEARCH ================================
56.45/56.75	
56.45/56.75	% Starting search at 0.03 seconds.
56.45/56.75	
56.45/56.75	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 177 (0.00 of 0.41 sec).
56.45/56.75	
56.45/56.75	Low Water (keep): wt=39.000, iters=3591
56.45/56.75	
56.45/56.75	Low Water (keep): wt=36.000, iters=3548
56.45/56.75	
56.45/56.75	Low Water (keep): wt=30.000, iters=3430
56.45/56.75	
56.45/56.75	Low Water (keep): wt=20.000, iters=3485
56.45/56.75	
56.45/56.75	Low Water (keep): wt=19.000, iters=3333
56.45/56.75	
56.45/56.75	Low Water (keep): wt=18.000, iters=3339
56.45/56.75	
56.45/56.75	Low Water (keep): wt=16.000, iters=3378
56.45/56.75	
56.45/56.75	Low Water (keep): wt=15.000, iters=3479
56.45/56.75	
56.45/56.75	Low Water (displace): id=11959, wt=15.000
56.45/56.75	
56.45/56.75	Low Water (displace): id=12132, wt=14.000
56.45/56.75	
56.45/56.75	Low Water (displace): id=15142, wt=13.000
56.45/56.75	
56.45/56.75	Low Water (displace): id=15155, wt=12.000
56.45/56.75	
56.45/56.75	============================== PROOF =================================
56.45/56.75	% SZS status Theorem
56.45/56.75	% SZS output start Refutation
56.45/56.75	
56.45/56.75	% Proof 1 at 53.96 (+ 1.75) seconds.
56.45/56.75	% Length of proof is 39.
56.45/56.75	% Level of proof is 8.
56.45/56.75	% Maximum clause weight is 44.000.
56.45/56.75	% Given clauses 12121.
56.45/56.75	
56.45/56.75	30 (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].
56.45/56.75	58 -(all V all W all X all Y ((all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (host(Pid0) = nbr_proc -> -elem(m_NotNorm(Z),queue(host(Pid0))))) & (all Z (setIn(Z,alive) & (elec_1 = index(status,host(Z)) | elec_2 = index(status,host(Z))) -> index(elid,host(Z)) = Z)) & (all Z all Pid20 all Pid0 (host(Pid20) != host(Pid0) & setIn(Pid0,alive) & wait = index(status,host(Pid0)) & host(index(elid,host(Pid0))) = host(Pid20) & host(Pid0) = host(Z) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid30 all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid0) = nbr_proc & host(Pid0) = host(Pid30) & elec_1 = index(status,host(Pid0)) & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) -> -(setIn(Z,alive) & elem(m_Down(Pid30),queue(host(Z)))))) & cons(m_Ack(W,Y),V) = queue(host(X)) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Pid20,alive) & host(Pid30) = host(Z) & host(Pid20) = host(Pid0) & 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 (setIn(Z,alive) & host(Pid20) = host(Pid0) & host(Pid30) = host(Z) & setIn(Pid20,alive) & host(Pid20) != host(Z) -> -(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(Pid0) = host(Z) & index(status,host(Pid0)) = norm & host(Pid20) = index(ldr,host(Pid0)) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid0 (host(Z) = host(Pid0) & Z != Pid0 -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (-(W = index(elid,host(X)) & host(Y) = index(pendack,host(X)) & index(status,host(X)) = elec_2) -> (all Z (host(Z) != host(X) -> (all W0 all X0 all Y0 (host(Y0) = host(X) -> (elem(m_Down(X0),V) & nbr_proc = host(Y0) & elec_1 = index(status,host(Y0)) & host(W0) = host(Y0) & (all V0 (-leq(host(Y0),V0) & leq(s(zero),V0) -> host(X0) = V0 | setIn(V0,index(down,host(Y0))))) -> -(elem(m_Down(W0),queue(host(Z))) & setIn(Z,alive))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
56.45/56.75	112 -elem(A,B) | elem(A,cons(C,B)) # label(axiom_46) # label(axiom).  [clausify(30)].
56.45/56.75	163 -elem(m_Down(A),queue(host(B))) | host(B) != nbr_proc | host(C) != host(B) | index(status,host(B)) != elec_1 | -leq(host(B),f4(D,C,A,B)) | -setIn(D,alive) | -elem(m_Down(C),queue(host(D))) # label(conj) # label(negated_conjecture).  [clausify(58)].
56.45/56.75	164 -elem(m_Down(A),queue(host(B))) | host(B) != nbr_proc | host(C) != host(B) | index(status,host(B)) != elec_1 | leq(s(zero),f4(D,C,A,B)) | -setIn(D,alive) | -elem(m_Down(C),queue(host(D))) # label(conj) # label(negated_conjecture).  [clausify(58)].
56.45/56.75	165 -elem(m_Down(A),queue(host(B))) | host(B) != nbr_proc | host(C) != host(B) | index(status,host(B)) != elec_1 | -setIn(f4(D,C,A,B),index(down,host(B))) | -setIn(D,alive) | -elem(m_Down(C),queue(host(D))) # label(conj) # label(negated_conjecture).  [clausify(58)].
56.45/56.75	166 -elem(m_Down(A),queue(host(B))) | host(B) != nbr_proc | host(C) != host(B) | index(status,host(B)) != elec_1 | host(A) != f4(D,C,A,B) | -setIn(D,alive) | -elem(m_Down(C),queue(host(D))) # label(conj) # label(negated_conjecture).  [clausify(58)].
56.45/56.75	167 -elem(m_Down(A),queue(host(B))) | host(B) != nbr_proc | host(C) != host(B) | index(status,host(B)) != elec_1 | f4(D,C,A,B) != host(A) | -setIn(D,alive) | -elem(m_Down(C),queue(host(D))).  [copy(166),flip(e)].
56.45/56.75	168 queue(host(c3)) = cons(m_Ack(c2,c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
56.45/56.75	169 cons(m_Ack(c2,c4),c1) = queue(host(c3)).  [copy(168),flip(a)].
56.45/56.75	178 host(c8) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
56.45/56.75	179 elem(m_Down(c7),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
56.45/56.75	180 host(c8) = nbr_proc # label(conj) # label(negated_conjecture).  [clausify(58)].
56.45/56.75	181 nbr_proc = host(c3).  [copy(180),rewrite([178(2)]),flip(a)].
56.45/56.75	182 index(status,host(c8)) = elec_1 # label(conj) # label(negated_conjecture).  [clausify(58)].
56.45/56.75	183 elec_1 = index(status,host(c3)).  [copy(182),rewrite([178(3)]),flip(a)].
56.45/56.75	184 host(c8) = host(c6) # label(conj) # label(negated_conjecture).  [clausify(58)].
56.45/56.75	185 host(c6) = host(c3).  [copy(184),rewrite([178(2)]),flip(a)].
56.45/56.75	186 leq(host(c8),A) | -leq(s(zero),A) | host(c7) = A | setIn(A,index(down,host(c8))) # label(conj) # label(negated_conjecture).  [clausify(58)].
56.45/56.75	187 leq(host(c3),A) | -leq(s(zero),A) | host(c7) = A | setIn(A,index(down,host(c3))).  [copy(186),rewrite([178(2),178(12)])].
56.45/56.75	188 elem(m_Down(c6),queue(host(c5))) # label(conj) # label(negated_conjecture).  [clausify(58)].
56.45/56.75	189 setIn(c5,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
56.45/56.75	190 -elem(m_Down(A),queue(host(B))) | host(c3) != host(B) | host(C) != host(B) | index(status,host(c3)) != index(status,host(B)) | f4(D,C,A,B) != host(A) | -setIn(D,alive) | -elem(m_Down(C),queue(host(D))).  [back_rewrite(167),rewrite([181(6),183(15)]),flip(b),flip(d)].
56.45/56.75	191 -elem(m_Down(A),queue(host(B))) | host(c3) != host(B) | host(C) != host(B) | index(status,host(c3)) != index(status,host(B)) | -setIn(f4(D,C,A,B),index(down,host(B))) | -setIn(D,alive) | -elem(m_Down(C),queue(host(D))).  [back_rewrite(165),rewrite([181(6),183(15)]),flip(b),flip(d)].
56.45/56.75	192 -elem(m_Down(A),queue(host(B))) | host(c3) != host(B) | host(C) != host(B) | index(status,host(c3)) != index(status,host(B)) | leq(s(zero),f4(D,C,A,B)) | -setIn(D,alive) | -elem(m_Down(C),queue(host(D))).  [back_rewrite(164),rewrite([181(6),183(15)]),flip(b),flip(d)].
56.45/56.75	193 -elem(m_Down(A),queue(host(B))) | host(c3) != host(B) | host(C) != host(B) | index(status,host(c3)) != index(status,host(B)) | -leq(host(B),f4(D,C,A,B)) | -setIn(D,alive) | -elem(m_Down(C),queue(host(D))).  [back_rewrite(163),rewrite([181(6),183(15)]),flip(b),flip(d)].
56.45/56.75	291 elem(m_Down(c7),cons(A,c1)).  [resolve(179,a,112,a)].
56.45/56.75	313 -elem(m_Down(A),queue(host(B))) | host(c3) != host(B) | host(C) != host(B) | index(status,host(c3)) != index(status,host(B)) | f4(c5,C,A,B) != host(A) | -elem(m_Down(C),queue(host(c5))).  [resolve(190,f,189,a)].
56.45/56.75	320 -elem(m_Down(A),queue(host(B))) | host(c3) != host(B) | host(C) != host(B) | index(status,host(c3)) != index(status,host(B)) | leq(s(zero),f4(c5,C,A,B)) | -elem(m_Down(C),queue(host(c5))).  [resolve(192,f,189,a)].
56.45/56.75	325 -elem(m_Down(A),queue(host(B))) | host(c3) != host(B) | host(C) != host(B) | index(status,host(c3)) != index(status,host(B)) | -leq(host(B),f4(c5,C,A,B)) | -elem(m_Down(C),queue(host(c5))).  [resolve(193,f,189,a)].
56.45/56.75	413 elem(m_Down(c7),queue(host(c3))).  [para(169(a,1),291(a,2))].
56.45/56.75	549 host(c3) != host(A) | f4(c5,A,c7,c3) != host(c7) | -elem(m_Down(A),queue(host(c5))).  [resolve(313,a,413,a),flip(b),xx(a),xx(c)].
56.45/56.75	553 f4(c5,c6,c7,c3) != host(c7).  [resolve(549,c,188,a),rewrite([185(4)]),xx(a)].
56.45/56.75	634 host(c3) != host(A) | -leq(host(c3),f4(c5,A,c7,c3)) | -elem(m_Down(A),queue(host(c5))).  [resolve(325,a,413,a),flip(b),xx(a),xx(c)].
56.45/56.75	638 -leq(host(c3),f4(c5,c6,c7,c3)).  [resolve(634,c,188,a),rewrite([185(4)]),xx(a)].
56.45/56.75	3592 host(c3) != host(A) | leq(s(zero),f4(c5,A,c7,c3)) | -elem(m_Down(A),queue(host(c5))).  [resolve(320,a,413,a),flip(b),xx(a),xx(c)].
56.45/56.75	37461 leq(s(zero),f4(c5,c6,c7,c3)).  [resolve(3592,c,188,a),rewrite([185(4)]),xx(a)].
56.45/56.75	37522 setIn(f4(c5,c6,c7,c3),index(down,host(c3))).  [resolve(37461,a,187,b),flip(b),unit_del(a,638),unit_del(b,553)].
56.45/56.75	37679 $F.  [resolve(37522,a,191,e),rewrite([185(13)]),xx(b),xx(c),xx(d),unit_del(a,413),unit_del(b,189),unit_del(c,188)].
56.45/56.75	
56.45/56.75	% SZS output end Refutation
56.45/56.75	============================== end of proof ==========================
56.45/56.75	
56.45/56.75	============================== STATISTICS ============================
56.45/56.75	
56.45/56.75	Given=12121. Generated=3468609. Kept=37609. proofs=1.
56.45/56.75	Usable=11873. Sos=9998. Demods=65. Limbo=0, Disabled=15860. Hints=0.
56.45/56.75	Megabytes=55.34.
56.45/56.75	User_CPU=53.96, System_CPU=1.75, Wall_clock=56.
56.45/56.75	
56.45/56.75	============================== end of statistics =====================
56.45/56.75	
56.45/56.75	============================== end of search =========================
56.45/56.75	
56.45/56.75	THEOREM PROVED
56.45/56.75	% SZS status Theorem
56.45/56.75	
56.45/56.75	Exiting with 1 proof.
56.45/56.75	
56.45/56.75	Process 24743 exit (max_proofs) Mon Jul  3 07:15:01 2023
56.45/56.75	Prover9 interrupted
56.45/56.76	EOF