0.10/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n026.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   : 960
0.13/0.34	% DateTime   : Thu Jul  2 09:00:39 EDT 2020
0.13/0.34	% CPUTime    : 
0.47/1.07	============================== Prover9 ===============================
0.47/1.07	Prover9 (32) version 2009-11A, November 2009.
0.47/1.07	Process 9332 was started by sandbox on n026.cluster.edu,
0.47/1.07	Thu Jul  2 09:00:40 2020
0.47/1.07	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_9001_n026.cluster.edu".
0.47/1.07	============================== end of head ===========================
0.47/1.07	
0.47/1.07	============================== INPUT =================================
0.47/1.07	
0.47/1.07	% Reading from file /tmp/Prover9_9001_n026.cluster.edu
0.47/1.07	
0.47/1.07	set(prolog_style_variables).
0.47/1.07	set(auto2).
0.47/1.07	    % set(auto2) -> set(auto).
0.47/1.07	    % set(auto) -> set(auto_inference).
0.47/1.07	    % set(auto) -> set(auto_setup).
0.47/1.07	    % set(auto_setup) -> set(predicate_elim).
0.47/1.07	    % set(auto_setup) -> assign(eq_defs, unfold).
0.47/1.07	    % set(auto) -> set(auto_limits).
0.47/1.07	    % set(auto_limits) -> assign(max_weight, "100.000").
0.47/1.07	    % set(auto_limits) -> assign(sos_limit, 20000).
0.47/1.07	    % set(auto) -> set(auto_denials).
0.47/1.07	    % set(auto) -> set(auto_process).
0.47/1.07	    % set(auto2) -> assign(new_constants, 1).
0.47/1.07	    % set(auto2) -> assign(fold_denial_max, 3).
0.47/1.07	    % set(auto2) -> assign(max_weight, "200.000").
0.47/1.07	    % set(auto2) -> assign(max_hours, 1).
0.47/1.07	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.47/1.07	    % set(auto2) -> assign(max_seconds, 0).
0.47/1.07	    % set(auto2) -> assign(max_minutes, 5).
0.47/1.07	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.47/1.07	    % set(auto2) -> set(sort_initial_sos).
0.47/1.07	    % set(auto2) -> assign(sos_limit, -1).
0.47/1.07	    % set(auto2) -> assign(lrs_ticks, 3000).
0.47/1.07	    % set(auto2) -> assign(max_megs, 400).
0.47/1.07	    % set(auto2) -> assign(stats, some).
0.47/1.07	    % set(auto2) -> clear(echo_input).
0.47/1.07	    % set(auto2) -> set(quiet).
0.47/1.07	    % set(auto2) -> clear(print_initial_clauses).
0.47/1.07	    % set(auto2) -> clear(print_given).
0.47/1.07	assign(lrs_ticks,-1).
0.47/1.07	assign(sos_limit,10000).
0.47/1.07	assign(order,kbo).
0.47/1.07	set(lex_order_vars).
0.47/1.07	clear(print_given).
0.47/1.07	
0.47/1.07	% formulas(sos).  % not echoed (67 formulas)
0.47/1.07	
0.47/1.07	============================== end of input ==========================
0.47/1.07	
0.47/1.07	% From the command line: assign(max_seconds, 960).
0.47/1.07	
0.47/1.07	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.47/1.07	
0.47/1.07	% Formulas that are not ordinary clauses:
0.47/1.07	1 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	2 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	3 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	4 (all X all Y (m_NormQ(X) != m_NormQ(Y) <-> Y != X)) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	5 (all X all Y all Z m_Ldr(Z) != m_Ack(X,Y)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	6 (all Q (q_nil = Q | cons(head(Q),tail(Q)) = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	7 (all X all Q ((all Y (pidElem(X) & pidElem(Y) & elem(Y,Q) & host(pidMsg(X)) = host(pidMsg(Y)) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q) <-> ordered(snoc(Q,X)))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	8 (all X (pidElem(X) <-> (exists Y (X = m_Down(Y) | X = m_Halt(Y))))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	9 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	10 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	11 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	12 (all Q all X all Y (host(Y) = host(X) & ordered(cons(m_Halt(X),Q)) & elem(m_Down(Y),Q) -> leq(X,Y))) # label(axiom_57) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	13 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	14 (all X all Y m_NormQ(Y) != m_Ldr(X)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	15 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	16 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	17 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	18 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	19 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	20 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	21 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	22 (all X all Y (m_Down(X) != m_Down(Y) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	23 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	24 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	25 (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.47/1.07	26 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	27 (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.47/1.07	28 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	29 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	30 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	31 (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.47/1.07	32 (all X all Y all Q (elem(X,snoc(Q,Y)) <-> X = Y | elem(X,Q))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	33 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	34 (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.47/1.07	35 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	36 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	37 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,cons(Y,Q)))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	38 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	39 (all X all Q cons(X,Q) != q_nil) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	40 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	41 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	42 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	43 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	44 (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.47/1.07	45 (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.47/1.07	46 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	47 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	48 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	49 (all Q (Q = q_nil | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	51 (all X all Y (m_NotNorm(X) != m_NotNorm(Y) <-> X != Y)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
1.10/1.37	52 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
1.10/1.37	53 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
1.10/1.37	54 (all X all Y (m_Halt(Y) != m_Halt(X) <-> Y != X)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
1.10/1.37	55 (all X all Q (ordered(cons(X,Q)) <-> ordered(Q) & (all Y (pidElem(X) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) & elem(Y,Q) -> leq(pidMsg(X),pidMsg(Y)))))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
1.10/1.37	56 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
1.10/1.37	57 (all X all Y all Z m_NormQ(Z) != m_Ack(X,Y)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
1.10/1.37	58 -(all V all W all X ((all Y all Z (elem(m_Ldr(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) & (all Y all Z (elem(m_Down(Z),queue(host(Y))) -> host(Z) != host(Y))) & (all Y all Z all Pid0 (norm = index(status,host(Pid0)) & host(Z) = index(ldr,host(Pid0)) & host(Pid0) = host(Y) & setIn(Pid0,alive) & host(Pid0) != host(Z) -> -elem(m_Down(Y),queue(host(Z))))) & (all Y all Z all Pid20 all Pid0 (host(Pid20) != host(Y) & setIn(Y,alive) & host(Pid20) = host(Pid0) & host(Z) = host(Y) & setIn(Pid20,alive) -> -(elem(m_Down(Pid0),queue(host(Y))) & elem(m_Down(Z),queue(host(Pid20)))))) & (all Y all Z all Pid20 all Pid0 (host(Y) != host(Pid20) & host(Pid20) = host(Pid0) & host(Y) = host(Z) & setIn(Pid20,alive) & setIn(Y,alive) -> -(elem(m_Down(Pid0),queue(host(Y))) & setIn(host(Z),index(down,host(Pid20)))))) & (all Y all Z all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) & elem(m_Down(Pid20),queue(host(Pid0))) & index(status,host(Pid0)) = elec_1 & host(Pid0) = nbr_proc & host(Pid0) = host(Z) -> -(elem(m_Down(Z),queue(host(Y))) & setIn(Y,alive)))) & cons(m_Halt(X),V) = queue(host(W)) & (all Y all Z all Pid0 (host(Z) != host(Pid0) & host(Pid0) = host(Y) & wait = index(status,host(Pid0)) & host(Z) = host(index(elid,host(Pid0))) & setIn(Pid0,alive) -> -elem(m_Down(Y),queue(host(Z))))) & (all Y (setIn(Y,alive) & (index(status,host(Y)) = elec_2 | index(status,host(Y)) = elec_1) -> index(elid,host(Y)) = Y)) & (all Y all Z (host(Y) = host(Z) & Z != Y -> -setIn(Z,alive) | -setIn(Y,alive))) & (all Y all Z (nbr_proc = host(Z) -> -elem(m_NotNorm(Y),queue(host(Z))))) -> (setIn(W,alive) -> (all Y (host(X) != host(Y) -> (host(W) = host(Y) -> (all Z all X0 all Y0 (host(Y0) = host(X) -> (host(Y0) != host(W) -> (elem(m_Down(X0),snoc(queue(host(Y0)),m_Ack(X,W))) & nbr_proc = host(Y0) & index(status,host(Y0)) = elec_1 & host(Y0) = host(Z) & (all V0 (-leq(host(Y0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Y0))) | host(X0) = V0)) -> -(setIn(Y,alive) & elem(m_Down(Z),V)))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
1.10/1.37	
1.10/1.37	============================== end of process non-clausal formulas ===
1.10/1.37	
1.10/1.37	============================== PROCESS INITIAL CLAUSES ===============
1.10/1.37	
1.10/1.37	============================== PREDICATE ELIMINATION =================
1.10/1.37	
1.10/1.37	============================== end predicate elimination =============
1.10/1.37	
1.10/1.37	Auto_denials:  (non-Horn, no changes).
1.10/1.37	
1.10/1.37	Term ordering decisions:
1.10/1.37	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. 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. f2=1. f4=1.
1.10/1.37	
1.10/1.37	============================== end of process initial clauses ========
1.10/1.37	
1.10/1.37	============================== CLAUSES FOR SEARCH ====================
1.10/1.37	
1.10/1.37	============================== end of clauses for search =============
1.10/1.37	
1.10/1.37	============================== SEARCH ================================
1.10/1.37	
1.10/1.37	% Starting search at 0.03 seconds.
1.10/1.37	
1.10/1.37	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 156 (0.00 of 0.31 sec).
22.22/22.49	
22.22/22.49	Low Water (keep): wt=41.000, iters=3433
22.22/22.49	
22.22/22.49	Low Water (keep): wt=33.000, iters=3358
22.22/22.49	
22.22/22.49	Low Water (keep): wt=30.000, iters=3360
22.22/22.49	
22.22/22.49	Low Water (keep): wt=29.000, iters=3349
22.22/22.49	
22.22/22.49	Low Water (keep): wt=25.000, iters=3341
22.22/22.49	
22.22/22.49	Low Water (keep): wt=18.000, iters=4906
22.22/22.49	
22.22/22.49	Low Water (keep): wt=17.000, iters=4497
22.22/22.49	
22.22/22.49	Low Water (keep): wt=16.000, iters=4079
22.22/22.49	
22.22/22.49	Low Water (keep): wt=15.000, iters=3340
22.22/22.49	
22.22/22.49	============================== PROOF =================================
22.22/22.49	% SZS status Theorem
22.22/22.49	% SZS output start Refutation
22.22/22.49	
22.22/22.49	% Proof 1 at 20.62 (+ 0.81) seconds.
22.22/22.49	% Length of proof is 55.
22.22/22.49	% Level of proof is 10.
22.22/22.49	% Maximum clause weight is 42.000.
22.22/22.49	% Given clauses 7284.
22.22/22.49	
22.22/22.49	32 (all X all Y all Q (elem(X,snoc(Q,Y)) <-> X = Y | elem(X,Q))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
22.22/22.49	37 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,cons(Y,Q)))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
22.22/22.49	42 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
22.22/22.49	58 -(all V all W all X ((all Y all Z (elem(m_Ldr(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) & (all Y all Z (elem(m_Down(Z),queue(host(Y))) -> host(Z) != host(Y))) & (all Y all Z all Pid0 (norm = index(status,host(Pid0)) & host(Z) = index(ldr,host(Pid0)) & host(Pid0) = host(Y) & setIn(Pid0,alive) & host(Pid0) != host(Z) -> -elem(m_Down(Y),queue(host(Z))))) & (all Y all Z all Pid20 all Pid0 (host(Pid20) != host(Y) & setIn(Y,alive) & host(Pid20) = host(Pid0) & host(Z) = host(Y) & setIn(Pid20,alive) -> -(elem(m_Down(Pid0),queue(host(Y))) & elem(m_Down(Z),queue(host(Pid20)))))) & (all Y all Z all Pid20 all Pid0 (host(Y) != host(Pid20) & host(Pid20) = host(Pid0) & host(Y) = host(Z) & setIn(Pid20,alive) & setIn(Y,alive) -> -(elem(m_Down(Pid0),queue(host(Y))) & setIn(host(Z),index(down,host(Pid20)))))) & (all Y all Z all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) & elem(m_Down(Pid20),queue(host(Pid0))) & index(status,host(Pid0)) = elec_1 & host(Pid0) = nbr_proc & host(Pid0) = host(Z) -> -(elem(m_Down(Z),queue(host(Y))) & setIn(Y,alive)))) & cons(m_Halt(X),V) = queue(host(W)) & (all Y all Z all Pid0 (host(Z) != host(Pid0) & host(Pid0) = host(Y) & wait = index(status,host(Pid0)) & host(Z) = host(index(elid,host(Pid0))) & setIn(Pid0,alive) -> -elem(m_Down(Y),queue(host(Z))))) & (all Y (setIn(Y,alive) & (index(status,host(Y)) = elec_2 | index(status,host(Y)) = elec_1) -> index(elid,host(Y)) = Y)) & (all Y all Z (host(Y) = host(Z) & Z != Y -> -setIn(Z,alive) | -setIn(Y,alive))) & (all Y all Z (nbr_proc = host(Z) -> -elem(m_NotNorm(Y),queue(host(Z))))) -> (setIn(W,alive) -> (all Y (host(X) != host(Y) -> (host(W) = host(Y) -> (all Z all X0 all Y0 (host(Y0) = host(X) -> (host(Y0) != host(W) -> (elem(m_Down(X0),snoc(queue(host(Y0)),m_Ack(X,W))) & nbr_proc = host(Y0) & index(status,host(Y0)) = elec_1 & host(Y0) = host(Z) & (all V0 (-leq(host(Y0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Y0))) | host(X0) = V0)) -> -(setIn(Y,alive) & elem(m_Down(Z),V)))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
22.22/22.49	111 -elem(A,snoc(B,C)) | C = A | elem(A,B) # label(axiom_47) # label(axiom).  [clausify(32)].
22.22/22.49	118 -elem(A,B) | elem(A,cons(C,B)) # label(axiom_46) # label(axiom).  [clausify(37)].
22.22/22.49	129 m_Ack(A,B) != m_Down(C) # label(axiom_12) # label(axiom).  [clausify(42)].
22.22/22.49	163 -leq(host(A),f4(B,C,D,A)) | -elem(m_Down(D),queue(host(A))) | index(status,host(A)) != elec_1 | host(A) != nbr_proc | host(A) != host(C) | -elem(m_Down(C),queue(host(B))) | -setIn(B,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
22.22/22.49	164 leq(s(zero),f4(A,B,C,D)) | -elem(m_Down(C),queue(host(D))) | index(status,host(D)) != elec_1 | host(D) != nbr_proc | host(D) != host(B) | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
22.22/22.49	165 -setIn(f4(A,B,C,D),index(down,host(D))) | -elem(m_Down(C),queue(host(D))) | index(status,host(D)) != elec_1 | host(D) != nbr_proc | host(D) != host(B) | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
22.22/22.49	166 host(A) != f4(B,C,A,D) | -elem(m_Down(A),queue(host(D))) | index(status,host(D)) != elec_1 | host(D) != nbr_proc | host(D) != host(C) | -elem(m_Down(C),queue(host(B))) | -setIn(B,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
22.22/22.49	167 f4(A,B,C,D) != host(C) | -elem(m_Down(C),queue(host(D))) | index(status,host(D)) != elec_1 | host(D) != nbr_proc | host(D) != host(B) | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive).  [copy(166),flip(a)].
22.22/22.49	168 queue(host(c2)) = cons(m_Halt(c3),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
22.22/22.49	169 cons(m_Halt(c3),c1) = queue(host(c2)).  [copy(168),flip(a)].
22.22/22.49	175 setIn(c2,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
22.22/22.49	179 host(c7) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
22.22/22.49	180 host(c7) != host(c2) # label(conj) # label(negated_conjecture).  [clausify(58)].
22.22/22.49	181 host(c3) != host(c2).  [copy(180),rewrite([179(2)])].
22.22/22.49	182 elem(m_Down(c6),snoc(queue(host(c7)),m_Ack(c3,c2))) # label(conj) # label(negated_conjecture).  [clausify(58)].
22.22/22.49	183 elem(m_Down(c6),snoc(queue(host(c3)),m_Ack(c3,c2))).  [copy(182),rewrite([179(4)])].
22.22/22.49	184 host(c7) = nbr_proc # label(conj) # label(negated_conjecture).  [clausify(58)].
22.22/22.49	185 nbr_proc = host(c3).  [copy(184),rewrite([179(2)]),flip(a)].
22.22/22.49	186 index(status,host(c7)) = elec_1 # label(conj) # label(negated_conjecture).  [clausify(58)].
22.22/22.49	187 elec_1 = index(status,host(c3)).  [copy(186),rewrite([179(3)]),flip(a)].
22.22/22.49	188 host(c7) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
22.22/22.49	189 host(c5) = host(c3).  [copy(188),rewrite([179(2)]),flip(a)].
22.22/22.49	190 leq(host(c7),A) | -leq(s(zero),A) | setIn(A,index(down,host(c7))) | host(c6) = A # label(conj) # label(negated_conjecture).  [clausify(58)].
22.22/22.49	191 leq(host(c3),A) | -leq(s(zero),A) | setIn(A,index(down,host(c3))) | host(c6) = A.  [copy(190),rewrite([179(2),179(9)])].
22.22/22.49	193 elem(m_Down(c5),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
22.22/22.49	198 host(c3) = c_0.  [new_symbol(181)].
22.22/22.49	200 f4(A,B,C,D) != host(C) | -elem(m_Down(C),queue(host(D))) | index(status,host(D)) != index(status,c_0) | host(D) != c_0 | host(D) != host(B) | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive).  [back_rewrite(167),rewrite([187(11),198(13),185(16),198(17)])].
22.22/22.49	201 -setIn(f4(A,B,C,D),index(down,host(D))) | -elem(m_Down(C),queue(host(D))) | index(status,host(D)) != index(status,c_0) | host(D) != c_0 | host(D) != host(B) | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive).  [back_rewrite(165),rewrite([187(13),198(15),185(18),198(19)])].
22.22/22.49	202 leq(s(zero),f4(A,B,C,D)) | -elem(m_Down(C),queue(host(D))) | index(status,host(D)) != index(status,c_0) | host(D) != c_0 | host(D) != host(B) | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive).  [back_rewrite(164),rewrite([187(12),198(14),185(17),198(18)])].
22.22/22.49	203 -leq(host(A),f4(B,C,D,A)) | -elem(m_Down(D),queue(host(A))) | index(status,host(A)) != index(status,c_0) | host(A) != c_0 | host(A) != host(C) | -elem(m_Down(C),queue(host(B))) | -setIn(B,alive).  [back_rewrite(163),rewrite([187(11),198(13),185(16),198(17)])].
22.22/22.49	218 leq(c_0,A) | -leq(s(zero),A) | setIn(A,index(down,c_0)) | host(c6) = A.  [back_rewrite(191),rewrite([198(2),198(8)])].
22.22/22.49	219 host(c5) = c_0.  [back_rewrite(189),rewrite([198(4)])].
22.22/22.49	222 elem(m_Down(c6),snoc(queue(c_0),m_Ack(c3,c2))).  [back_rewrite(183),rewrite([198(4)])].
22.22/22.49	317 elem(m_Down(c5),cons(A,c1)).  [resolve(193,a,118,a)].
22.22/22.49	331 f4(c2,A,B,C) != host(B) | -elem(m_Down(B),queue(host(C))) | index(status,host(C)) != index(status,c_0) | host(C) != c_0 | host(C) != host(A) | -elem(m_Down(A),queue(host(c2))).  [resolve(200,g,175,a)].
22.22/22.49	332 -setIn(f4(A,B,C,c3),index(down,c_0)) | -elem(m_Down(C),queue(c_0)) | host(B) != c_0 | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive).  [para(198(a,1),201(a,2,2)),rewrite([198(9),198(13),198(19),198(22)]),flip(e),xx(c),xx(d)].
22.22/22.49	334 leq(s(zero),f4(c2,A,B,C)) | -elem(m_Down(B),queue(host(C))) | index(status,host(C)) != index(status,c_0) | host(C) != c_0 | host(C) != host(A) | -elem(m_Down(A),queue(host(c2))).  [resolve(202,g,175,a)].
22.22/22.50	336 -leq(host(A),f4(c2,B,C,A)) | -elem(m_Down(C),queue(host(A))) | index(status,host(A)) != index(status,c_0) | host(A) != c_0 | host(A) != host(B) | -elem(m_Down(B),queue(host(c2))).  [resolve(203,g,175,a)].
22.22/22.50	359 elem(m_Down(c6),queue(c_0)).  [resolve(222,a,111,a),unit_del(a,129)].
22.22/22.50	472 elem(m_Down(c5),queue(host(c2))).  [para(169(a,1),317(a,2))].
22.22/22.50	504 f4(c2,A,B,c3) != host(B) | -elem(m_Down(B),queue(c_0)) | host(A) != c_0 | -elem(m_Down(A),queue(host(c2))).  [para(198(a,1),331(b,2,1)),rewrite([198(12),198(18),198(21)]),flip(e),xx(c),xx(d)].
22.22/22.50	509 f4(c2,A,c6,c3) != host(c6) | host(A) != c_0 | -elem(m_Down(A),queue(host(c2))).  [resolve(504,b,359,a)].
22.22/22.50	581 -leq(c_0,f4(c2,A,B,c3)) | -elem(m_Down(B),queue(c_0)) | host(A) != c_0 | -elem(m_Down(A),queue(host(c2))).  [para(198(a,1),336(b,2,1)),rewrite([198(2),198(12),198(18),198(21)]),flip(e),xx(c),xx(d)].
22.22/22.50	594 f4(c2,c5,c6,c3) != host(c6).  [resolve(472,a,509,c),rewrite([219(10)]),xx(b)].
22.22/22.50	768 -leq(c_0,f4(c2,c5,A,c3)) | -elem(m_Down(A),queue(c_0)).  [resolve(581,d,472,a),rewrite([219(12)]),xx(c)].
22.22/22.50	771 -leq(c_0,f4(c2,c5,c6,c3)).  [resolve(768,b,359,a)].
22.22/22.50	2546 leq(s(zero),f4(c2,c5,A,B)) | -elem(m_Down(A),queue(host(B))) | index(status,host(B)) != index(status,c_0) | host(B) != c_0.  [resolve(334,f,472,a),rewrite([219(23)]),merge(e)].
22.22/22.50	16491 leq(s(zero),f4(c2,c5,A,c3)) | -elem(m_Down(A),queue(c_0)).  [para(198(a,1),2546(b,2,1)),rewrite([198(14),198(20)]),xx(c),xx(d)].
22.22/22.50	16494 leq(s(zero),f4(c2,c5,c6,c3)).  [resolve(16491,b,359,a)].
22.22/22.50	16530 setIn(f4(c2,c5,c6,c3),index(down,c_0)).  [resolve(16494,a,218,b),flip(c),unit_del(a,771),unit_del(c,594)].
22.22/22.50	16578 $F.  [resolve(16530,a,332,a),rewrite([219(7)]),xx(b),unit_del(a,359),unit_del(b,472),unit_del(c,175)].
22.22/22.50	
22.22/22.50	% SZS output end Refutation
22.22/22.50	============================== end of proof ==========================
22.22/22.50	
22.22/22.50	============================== STATISTICS ============================
22.22/22.50	
22.22/22.50	Given=7284. Generated=1575971. Kept=16506. proofs=1.
22.22/22.50	Usable=5150. Sos=8326. Demods=30. Limbo=0, Disabled=3153. Hints=0.
22.22/22.50	Megabytes=28.12.
22.22/22.50	User_CPU=20.63, System_CPU=0.81, Wall_clock=21.
22.22/22.50	
22.22/22.50	============================== end of statistics =====================
22.22/22.50	
22.22/22.50	============================== end of search =========================
22.22/22.50	
22.22/22.50	THEOREM PROVED
22.22/22.50	% SZS status Theorem
22.22/22.50	
22.22/22.50	Exiting with 1 proof.
22.22/22.50	
22.22/22.50	Process 9332 exit (max_proofs) Thu Jul  2 09:01:01 2020
22.22/22.50	Prover9 interrupted
22.22/22.50	EOF