0.08/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer : n019.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 08:20:35 EDT 2023
0.13/0.35	% CPUTime  : 
0.80/1.11	============================== Prover9 ===============================
0.80/1.11	Prover9 (32) version 2009-11A, November 2009.
0.80/1.11	Process 32267 was started by sandbox2 on n019.cluster.edu,
0.80/1.11	Mon Jul  3 08:20:35 2023
0.80/1.11	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_31910_n019.cluster.edu".
0.80/1.11	============================== end of head ===========================
0.80/1.11	
0.80/1.11	============================== INPUT =================================
0.80/1.11	
0.80/1.11	% Reading from file /tmp/Prover9_31910_n019.cluster.edu
0.80/1.11	
0.80/1.11	set(prolog_style_variables).
0.80/1.11	set(auto2).
0.80/1.11	    % set(auto2) -> set(auto).
0.80/1.11	    % set(auto) -> set(auto_inference).
0.80/1.11	    % set(auto) -> set(auto_setup).
0.80/1.11	    % set(auto_setup) -> set(predicate_elim).
0.80/1.11	    % set(auto_setup) -> assign(eq_defs, unfold).
0.80/1.11	    % set(auto) -> set(auto_limits).
0.80/1.11	    % set(auto_limits) -> assign(max_weight, "100.000").
0.80/1.11	    % set(auto_limits) -> assign(sos_limit, 20000).
0.80/1.11	    % set(auto) -> set(auto_denials).
0.80/1.11	    % set(auto) -> set(auto_process).
0.80/1.11	    % set(auto2) -> assign(new_constants, 1).
0.80/1.11	    % set(auto2) -> assign(fold_denial_max, 3).
0.80/1.11	    % set(auto2) -> assign(max_weight, "200.000").
0.80/1.11	    % set(auto2) -> assign(max_hours, 1).
0.80/1.11	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.80/1.11	    % set(auto2) -> assign(max_seconds, 0).
0.80/1.11	    % set(auto2) -> assign(max_minutes, 5).
0.80/1.11	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.80/1.11	    % set(auto2) -> set(sort_initial_sos).
0.80/1.11	    % set(auto2) -> assign(sos_limit, -1).
0.80/1.11	    % set(auto2) -> assign(lrs_ticks, 3000).
0.80/1.11	    % set(auto2) -> assign(max_megs, 400).
0.80/1.11	    % set(auto2) -> assign(stats, some).
0.80/1.11	    % set(auto2) -> clear(echo_input).
0.80/1.11	    % set(auto2) -> set(quiet).
0.80/1.11	    % set(auto2) -> clear(print_initial_clauses).
0.80/1.11	    % set(auto2) -> clear(print_given).
0.80/1.11	assign(lrs_ticks,-1).
0.80/1.11	assign(sos_limit,10000).
0.80/1.11	assign(order,kbo).
0.80/1.11	set(lex_order_vars).
0.80/1.11	clear(print_given).
0.80/1.11	
0.80/1.11	% formulas(sos).  % not echoed (67 formulas)
0.80/1.11	
0.80/1.11	============================== end of input ==========================
0.80/1.11	
0.80/1.11	% From the command line: assign(max_seconds, 1440).
0.80/1.11	
0.80/1.11	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.80/1.11	
0.80/1.11	% Formulas that are not ordinary clauses:
0.80/1.11	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.11	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.11	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.11	4 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	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.11	6 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	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.11	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.11	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.11	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.11	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.11	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.11	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.11	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.11	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.11	16 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	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.11	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.11	19 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	20 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	21 (all X all Y m_NormQ(Y) != m_Ldr(X)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	22 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	23 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	24 (all Q (cons(head(Q),tail(Q)) = Q | Q = q_nil)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	25 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	26 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	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.11	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.11	29 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	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.11	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.11	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.11	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.11	34 (all Y all Q Q = init(snoc(Q,Y))) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	35 (all Q (Q = q_nil | snoc(init(Q),last(Q)) = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	36 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	37 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	38 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	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.11	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.11	41 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	42 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	43 (all X all Y m_Ldr(X) != m_NotNorm(Y)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	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.11	45 (all X all Y m_NotNorm(Y) != m_NormQ(X)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	46 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	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.11	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.11	49 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.80/1.11	50 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.85/1.45	51 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.85/1.45	52 (all X all Y all Z m_Ldr(Z) != m_Ack(X,Y)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.85/1.45	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.85/1.45	54 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.85/1.45	55 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.85/1.45	56 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.85/1.45	57 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.85/1.45	58 -(all V all W all X ((all Y all Z (elem(m_Down(Z),queue(host(Y))) -> host(Y) != host(Z))) & (all Y all Z (Z != Y & host(Y) = host(Z) -> -setIn(Z,alive) | -setIn(Y,alive))) & (all Y ((elec_1 = index(status,host(Y)) | index(status,host(Y)) = elec_2) & setIn(Y,alive) -> index(elid,host(Y)) = Y)) & (all Y all Z all Pid0 (host(Pid0) != host(Z) & host(Pid0) = host(Y) & host(Z) = index(ldr,host(Pid0)) & norm = index(status,host(Pid0)) & setIn(Pid0,alive) -> -elem(m_Down(Y),queue(host(Z))))) & (all Y all Z all Pid0 (host(Pid0) != host(Z) & host(Pid0) = host(Y) & host(Z) = host(index(elid,host(Pid0))) & index(status,host(Pid0)) = wait & setIn(Pid0,alive) -> -elem(m_Down(Y),queue(host(Z))))) & (all Y all Z all Pid20 all Pid0 (host(Y) != host(Pid20) & host(Y) = host(Z) & host(Pid20) = host(Pid0) & setIn(Pid20,alive) & setIn(Y,alive) -> -(elem(m_Down(Pid0),queue(host(Y))) & elem(m_Down(Z),queue(host(Pid20)))))) & cons(m_Halt(X),V) = queue(host(W)) & (all Y all Z all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid0) = nbr_proc & index(status,host(Pid0)) = elec_1 & host(Z) = host(Pid0) -> -(setIn(Y,alive) & elem(m_Down(Z),queue(host(Y)))))) & (all Y all Z all Pid20 all Pid0 (setIn(Y,alive) & host(Pid20) = host(Pid0) & host(Y) = host(Z) & setIn(Pid20,alive) & host(Pid20) != host(Y) -> -(elem(m_Down(Pid0),queue(host(Y))) & setIn(host(Z),index(down,host(Pid20)))))) & (all Y all Z (host(Z) = nbr_proc -> -elem(m_NotNorm(Y),queue(host(Z))))) & (all Y all Z (elem(m_Ldr(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) -> (setIn(W,alive) -> (all Y (host(X) = host(Y) -> (host(W) = host(Y) -> (all Z all X0 all Y0 (host(X) != host(Y0) -> (host(W) != host(Y0) -> ((all V0 (leq(s(zero),V0) & -leq(host(Y0),V0) -> host(X0) = V0 | setIn(V0,index(down,host(Y0))))) & host(Y0) = host(Z) & nbr_proc = host(Y0) & elec_1 = index(status,host(Y0)) & elem(m_Down(X0),queue(host(Y0))) -> -(elem(m_Down(Z),snoc(V,m_Ack(X,W))) & setIn(Y,alive)))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.85/1.45	
0.85/1.45	============================== end of process non-clausal formulas ===
0.85/1.45	
0.85/1.45	============================== PROCESS INITIAL CLAUSES ===============
0.85/1.45	
0.85/1.45	============================== PREDICATE ELIMINATION =================
0.85/1.45	
0.85/1.45	============================== end predicate elimination =============
0.85/1.45	
0.85/1.45	Auto_denials:  (non-Horn, no changes).
0.85/1.45	
0.85/1.45	Term ordering decisions:
0.85/1.45	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. setEmpty=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. snoc=1. cons=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.85/1.45	
0.85/1.45	============================== end of process initial clauses ========
0.85/1.45	
0.85/1.45	============================== CLAUSES FOR SEARCH ====================
0.85/1.45	
0.85/1.45	============================== end of clauses for search =============
0.85/1.45	
0.85/1.45	============================== SEARCH ================================
0.85/1.45	
0.85/1.45	% Starting search at 0.03 seconds.
0.85/1.45	
0.85/1.45	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 157 (0.00 of 0.36 sec).
23.83/24.11	
23.83/24.11	Low Water (keep): wt=16.000, iters=3881
23.83/24.11	
23.83/24.11	Low Water (keep): wt=15.000, iters=3497
23.83/24.11	
23.83/24.11	============================== PROOF =================================
23.83/24.11	% SZS status Theorem
23.83/24.11	% SZS output start Refutation
23.83/24.11	
23.83/24.11	% Proof 1 at 21.98 (+ 1.04) seconds.
23.83/24.11	% Length of proof is 54.
23.83/24.11	% Level of proof is 11.
23.83/24.11	% Maximum clause weight is 42.000.
23.83/24.11	% Given clauses 5801.
23.83/24.11	
23.83/24.11	13 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
23.83/24.11	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].
23.83/24.11	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].
23.83/24.11	58 -(all V all W all X ((all Y all Z (elem(m_Down(Z),queue(host(Y))) -> host(Y) != host(Z))) & (all Y all Z (Z != Y & host(Y) = host(Z) -> -setIn(Z,alive) | -setIn(Y,alive))) & (all Y ((elec_1 = index(status,host(Y)) | index(status,host(Y)) = elec_2) & setIn(Y,alive) -> index(elid,host(Y)) = Y)) & (all Y all Z all Pid0 (host(Pid0) != host(Z) & host(Pid0) = host(Y) & host(Z) = index(ldr,host(Pid0)) & norm = index(status,host(Pid0)) & setIn(Pid0,alive) -> -elem(m_Down(Y),queue(host(Z))))) & (all Y all Z all Pid0 (host(Pid0) != host(Z) & host(Pid0) = host(Y) & host(Z) = host(index(elid,host(Pid0))) & index(status,host(Pid0)) = wait & setIn(Pid0,alive) -> -elem(m_Down(Y),queue(host(Z))))) & (all Y all Z all Pid20 all Pid0 (host(Y) != host(Pid20) & host(Y) = host(Z) & host(Pid20) = host(Pid0) & setIn(Pid20,alive) & setIn(Y,alive) -> -(elem(m_Down(Pid0),queue(host(Y))) & elem(m_Down(Z),queue(host(Pid20)))))) & cons(m_Halt(X),V) = queue(host(W)) & (all Y all Z all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid0) = nbr_proc & index(status,host(Pid0)) = elec_1 & host(Z) = host(Pid0) -> -(setIn(Y,alive) & elem(m_Down(Z),queue(host(Y)))))) & (all Y all Z all Pid20 all Pid0 (setIn(Y,alive) & host(Pid20) = host(Pid0) & host(Y) = host(Z) & setIn(Pid20,alive) & host(Pid20) != host(Y) -> -(elem(m_Down(Pid0),queue(host(Y))) & setIn(host(Z),index(down,host(Pid20)))))) & (all Y all Z (host(Z) = nbr_proc -> -elem(m_NotNorm(Y),queue(host(Z))))) & (all Y all Z (elem(m_Ldr(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) -> (setIn(W,alive) -> (all Y (host(X) = host(Y) -> (host(W) = host(Y) -> (all Z all X0 all Y0 (host(X) != host(Y0) -> (host(W) != host(Y0) -> ((all V0 (leq(s(zero),V0) & -leq(host(Y0),V0) -> host(X0) = V0 | setIn(V0,index(down,host(Y0))))) & host(Y0) = host(Z) & nbr_proc = host(Y0) & elec_1 = index(status,host(Y0)) & elem(m_Down(X0),queue(host(Y0))) -> -(elem(m_Down(Z),snoc(V,m_Ack(X,W))) & setIn(Y,alive)))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
23.83/24.11	82 m_Down(A) != m_Ack(B,C) # label(axiom_12) # label(axiom).  [clausify(13)].
23.83/24.11	111 -elem(A,B) | elem(A,cons(C,B)) # label(axiom_46) # label(axiom).  [clausify(30)].
23.83/24.11	138 A = B | elem(B,C) | -elem(B,snoc(C,A)) # label(axiom_47) # label(axiom).  [clausify(47)].
23.83/24.11	163 queue(host(c2)) = cons(m_Halt(c3),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.83/24.11	164 cons(m_Halt(c3),c1) = queue(host(c2)).  [copy(163),flip(a)].
23.83/24.11	165 leq(s(zero),f4(A,B,C,D)) | -elem(m_Down(C),queue(host(D))) | host(D) != nbr_proc | index(status,host(D)) != elec_1 | host(D) != host(B) | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.83/24.11	166 -leq(host(A),f4(B,C,D,A)) | -elem(m_Down(D),queue(host(A))) | host(A) != nbr_proc | index(status,host(A)) != elec_1 | host(A) != host(C) | -setIn(B,alive) | -elem(m_Down(C),queue(host(B))) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.83/24.11	167 -setIn(f4(A,B,C,D),index(down,host(D))) | -elem(m_Down(C),queue(host(D))) | host(D) != nbr_proc | index(status,host(D)) != elec_1 | host(D) != host(B) | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.83/24.11	168 host(A) != f4(B,C,A,D) | -elem(m_Down(A),queue(host(D))) | host(D) != nbr_proc | index(status,host(D)) != elec_1 | host(D) != host(C) | -setIn(B,alive) | -elem(m_Down(C),queue(host(B))) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.83/24.11	169 f4(A,B,C,D) != host(C) | -elem(m_Down(C),queue(host(D))) | host(D) != nbr_proc | index(status,host(D)) != elec_1 | host(D) != host(B) | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))).  [copy(168),flip(a)].
23.83/24.11	173 setIn(c2,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.83/24.11	174 host(c4) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.83/24.11	175 host(c2) = host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.83/24.11	176 host(c3) = host(c2).  [copy(175),rewrite([174(4)]),flip(a)].
23.83/24.11	177 host(c7) != host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.83/24.11	178 host(c7) != host(c2).  [copy(177),rewrite([176(4)])].
23.83/24.11	179 -leq(s(zero),A) | leq(host(c7),A) | host(c6) = A | setIn(A,index(down,host(c7))) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.83/24.11	180 host(c7) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.83/24.11	181 host(c7) = nbr_proc # label(conj) # label(negated_conjecture).  [clausify(58)].
23.83/24.11	182 nbr_proc = host(c5).  [copy(181),rewrite([180(2)]),flip(a)].
23.83/24.11	183 index(status,host(c7)) = elec_1 # label(conj) # label(negated_conjecture).  [clausify(58)].
23.83/24.11	184 elec_1 = index(status,host(c5)).  [copy(183),rewrite([180(3)]),flip(a)].
23.83/24.11	185 elem(m_Down(c6),queue(host(c7))) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.83/24.11	186 elem(m_Down(c6),queue(host(c5))).  [copy(185),rewrite([180(4)])].
23.83/24.11	187 elem(m_Down(c5),snoc(c1,m_Ack(c3,c2))) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.83/24.11	194 host(c5) = c_0.  [new_symbol(178),rewrite([180(2)])].
23.83/24.11	195 -leq(s(zero),A) | leq(c_0,A) | host(c6) = A | setIn(A,index(down,c_0)).  [back_rewrite(179),rewrite([180(5),194(5),180(11),194(11)])].
23.83/24.11	198 f4(A,B,C,D) != host(C) | -elem(m_Down(C),queue(host(D))) | host(D) != c_0 | index(status,host(D)) != index(status,c_0) | host(D) != host(B) | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))).  [back_rewrite(169),rewrite([182(9),194(10),184(14),194(16)])].
23.83/24.11	199 -setIn(f4(A,B,C,D),index(down,host(D))) | -elem(m_Down(C),queue(host(D))) | host(D) != c_0 | index(status,host(D)) != index(status,c_0) | host(D) != host(B) | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))).  [back_rewrite(167),rewrite([182(11),194(12),184(16),194(18)])].
23.83/24.11	200 -leq(host(A),f4(B,C,D,A)) | -elem(m_Down(D),queue(host(A))) | host(A) != c_0 | index(status,host(A)) != index(status,c_0) | host(A) != host(C) | -setIn(B,alive) | -elem(m_Down(C),queue(host(B))).  [back_rewrite(166),rewrite([182(9),194(10),184(14),194(16)])].
23.83/24.11	201 leq(s(zero),f4(A,B,C,D)) | -elem(m_Down(C),queue(host(D))) | host(D) != c_0 | index(status,host(D)) != index(status,c_0) | host(D) != host(B) | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))).  [back_rewrite(165),rewrite([182(10),194(11),184(15),194(17)])].
23.83/24.11	216 elem(m_Down(c6),queue(c_0)).  [back_rewrite(186),rewrite([194(4)])].
23.83/24.11	308 elem(m_Down(c5),c1).  [resolve(187,a,138,c),unit_del(a(flip),82)].
23.83/24.11	332 f4(c2,A,B,C) != host(B) | -elem(m_Down(B),queue(host(C))) | host(C) != c_0 | index(status,host(C)) != index(status,c_0) | host(C) != host(A) | -elem(m_Down(A),queue(host(c2))).  [resolve(198,f,173,a)].
23.83/24.11	333 -setIn(f4(A,B,C,c5),index(down,c_0)) | -elem(m_Down(C),queue(c_0)) | host(B) != c_0 | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))).  [para(194(a,1),199(a,2,2)),rewrite([194(9),194(12),194(16),194(22)]),flip(e),xx(c),xx(d)].
23.83/24.11	335 -leq(host(A),f4(c2,B,C,A)) | -elem(m_Down(C),queue(host(A))) | host(A) != c_0 | index(status,host(A)) != index(status,c_0) | host(A) != host(B) | -elem(m_Down(B),queue(host(c2))).  [resolve(200,f,173,a)].
23.83/24.11	337 leq(s(zero),f4(c2,A,B,C)) | -elem(m_Down(B),queue(host(C))) | host(C) != c_0 | index(status,host(C)) != index(status,c_0) | host(C) != host(A) | -elem(m_Down(A),queue(host(c2))).  [resolve(201,f,173,a)].
23.83/24.11	376 elem(m_Down(c5),cons(A,c1)).  [resolve(308,a,111,a)].
23.83/24.11	459 f4(c2,A,B,c5) != host(B) | -elem(m_Down(B),queue(c_0)) | host(A) != c_0 | -elem(m_Down(A),queue(host(c2))).  [para(194(a,1),332(b,2,1)),rewrite([194(11),194(15),194(21)]),flip(e),xx(c),xx(d)].
23.83/24.11	461 f4(c2,A,c6,c5) != host(c6) | host(A) != c_0 | -elem(m_Down(A),queue(host(c2))).  [resolve(459,b,216,a)].
23.83/24.11	485 elem(m_Down(c5),queue(host(c2))).  [para(164(a,1),376(a,2))].
23.83/24.11	503 -leq(c_0,f4(c2,A,B,c5)) | -elem(m_Down(B),queue(c_0)) | host(A) != c_0 | -elem(m_Down(A),queue(host(c2))).  [para(194(a,1),335(b,2,1)),rewrite([194(2),194(11),194(15),194(21)]),flip(e),xx(c),xx(d)].
23.83/24.11	505 -leq(c_0,f4(c2,A,c6,c5)) | host(A) != c_0 | -elem(m_Down(A),queue(host(c2))).  [resolve(503,b,216,a)].
23.83/24.11	538 -leq(c_0,f4(c2,c5,c6,c5)).  [resolve(485,a,505,c),rewrite([194(9)]),xx(b)].
23.83/24.11	546 f4(c2,c5,c6,c5) != host(c6).  [resolve(485,a,461,c),rewrite([194(10)]),xx(b)].
23.83/24.11	2648 leq(s(zero),f4(c2,c5,A,B)) | -elem(m_Down(A),queue(host(B))) | host(B) != c_0 | index(status,host(B)) != index(status,c_0).  [resolve(337,f,485,a),rewrite([194(23)]),merge(e)].
23.83/24.11	15022 leq(s(zero),f4(c2,c5,A,c5)) | -elem(m_Down(A),queue(c_0)).  [para(194(a,1),2648(b,2,1)),rewrite([194(13),194(17)]),xx(c),xx(d)].
23.83/24.11	15024 leq(s(zero),f4(c2,c5,c6,c5)).  [resolve(15022,b,216,a)].
23.83/24.11	15061 setIn(f4(c2,c5,c6,c5),index(down,c_0)).  [resolve(15024,a,195,a),flip(b),unit_del(a,538),unit_del(b,546)].
23.83/24.11	15111 $F.  [resolve(15061,a,333,a),rewrite([194(7)]),xx(b),unit_del(a,216),unit_del(b,173),unit_del(c,485)].
23.83/24.11	
23.83/24.11	% SZS output end Refutation
23.83/24.11	============================== end of proof ==========================
23.83/24.11	
23.83/24.11	============================== STATISTICS ============================
23.83/24.11	
23.83/24.11	Given=5801. Generated=1908371. Kept=15042. proofs=1.
23.83/24.11	Usable=4966. Sos=8698. Demods=30. Limbo=0, Disabled=1501. Hints=0.
23.83/24.11	Megabytes=22.50.
23.83/24.11	User_CPU=21.98, System_CPU=1.04, Wall_clock=23.
23.83/24.11	
23.83/24.11	============================== end of statistics =====================
23.83/24.11	
23.83/24.11	============================== end of search =========================
23.83/24.11	
23.83/24.11	THEOREM PROVED
23.83/24.11	% SZS status Theorem
23.83/24.11	
23.83/24.11	Exiting with 1 proof.
23.83/24.11	
23.83/24.11	Process 32267 exit (max_proofs) Mon Jul  3 08:20:58 2023
23.83/24.11	Prover9 interrupted
23.83/24.12	EOF