TSTP Solution File: SWV477+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV477+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Wed Jul 20 21:13:11 EDT 2022
% Result : Theorem 48.03s 48.30s
% Output : Refutation 48.03s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV477+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n010.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 : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 03:04:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.80/1.08 ============================== Prover9 ===============================
% 0.80/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.80/1.08 Process 31929 was started by sandbox on n010.cluster.edu,
% 0.80/1.08 Thu Jun 16 03:04:24 2022
% 0.80/1.08 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31749_n010.cluster.edu".
% 0.80/1.08 ============================== end of head ===========================
% 0.80/1.08
% 0.80/1.08 ============================== INPUT =================================
% 0.80/1.08
% 0.80/1.08 % Reading from file /tmp/Prover9_31749_n010.cluster.edu
% 0.80/1.08
% 0.80/1.08 set(prolog_style_variables).
% 0.80/1.08 set(auto2).
% 0.80/1.08 % set(auto2) -> set(auto).
% 0.80/1.08 % set(auto) -> set(auto_inference).
% 0.80/1.08 % set(auto) -> set(auto_setup).
% 0.80/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.80/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.80/1.08 % set(auto) -> set(auto_limits).
% 0.80/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.80/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.80/1.08 % set(auto) -> set(auto_denials).
% 0.80/1.08 % set(auto) -> set(auto_process).
% 0.80/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.80/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.80/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.80/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.80/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.80/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.80/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.80/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.80/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.80/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.80/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.80/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.80/1.08 % set(auto2) -> assign(stats, some).
% 0.80/1.08 % set(auto2) -> clear(echo_input).
% 0.80/1.08 % set(auto2) -> set(quiet).
% 0.80/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.80/1.08 % set(auto2) -> clear(print_given).
% 0.80/1.08 assign(lrs_ticks,-1).
% 0.80/1.08 assign(sos_limit,10000).
% 0.80/1.08 assign(order,kbo).
% 0.80/1.08 set(lex_order_vars).
% 0.80/1.08 clear(print_given).
% 0.80/1.08
% 0.80/1.08 % formulas(sos). % not echoed (67 formulas)
% 0.80/1.08
% 0.80/1.08 ============================== end of input ==========================
% 0.80/1.08
% 0.80/1.08 % From the command line: assign(max_seconds, 300).
% 0.80/1.08
% 0.80/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.80/1.08
% 0.80/1.08 % Formulas that are not ordinary clauses:
% 0.80/1.08 1 (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.08 2 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 3 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 4 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 5 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 6 (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.08 7 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 8 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 9 (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.08 10 (all X all Y m_NotNorm(X) != m_Halt(Y)) # label(axiom_16) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 11 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 13 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 14 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 15 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 16 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 17 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 18 (all X all Y m_Ldr(X) != m_NotNorm(Y)) # label(axiom_24) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 19 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 20 (all X all Y (X != Y <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 21 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 22 (all X all Y (X != Y <-> m_NotNorm(X) != m_NotNorm(Y))) # label(axiom_28) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 23 (all X all Y (X != Y <-> m_Ldr(X) != m_Ldr(Y))) # label(axiom_29) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 24 (all X all Y (X != Y <-> m_Down(X) != m_Down(Y))) # label(axiom_30) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 25 (all X1 all X2 all Y1 all Y2 (X1 != X2 -> m_Ack(X1,Y1) != m_Ack(X2,Y2))) # label(axiom_31) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 26 (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.80/1.08 27 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 28 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 29 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 30 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 31 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 32 (all Q (Q = q_nil | Q = cons(head(Q),tail(Q)))) # label(axiom_39) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 33 (all Q (Q = q_nil | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 34 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 35 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 36 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 37 (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.80/1.08 38 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 39 (all X all Y all Q (elem(X,cons(Y,Q)) <-> X = Y | elem(X,Q))) # label(axiom_46) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 40 (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.80/1.08 41 (all X (pidElem(X) <-> (exists Y (X = m_Halt(Y) | X = m_Down(Y))))) # label(axiom_48) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 42 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 43 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 44 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 45 (all X all Q (ordered(cons(X,Q)) <-> ordered(Q) & (all Y (elem(Y,Q) & pidElem(X) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) -> leq(pidMsg(X),pidMsg(Y)))))) # label(axiom_53) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 46 (all X all Q (ordered(snoc(Q,X)) <-> ordered(Q) & (all Y (elem(Y,Q) & pidElem(X) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) -> leq(pidMsg(Y),pidMsg(X)))))) # label(axiom_54) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 47 (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.08 48 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 49 (all Q all X all Y (ordered(cons(m_Halt(X),Q)) & host(X) = host(Y) & elem(m_Down(Y),Q) -> leq(X,Y))) # label(axiom_57) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 50 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 51 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 52 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 53 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 54 (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.80/1.08 55 (all X all Y (leq(X,Y) <-> leq(s(X),s(Y)))) # label(axiom_63) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 56 (all X all Y (leq(X,s(Y)) <-> X = s(Y) | leq(X,Y))) # label(axiom_64) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 57 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 58 -(all V all W all X all Y ((all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (Pid0 != Z & host(Pid0) = host(Z) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z ((index(status,host(Z)) = elec_1 | index(status,host(Z)) = elec_2) & setIn(Z,alive) -> index(elid,host(Z)) = Z)) & (all Z all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & setIn(host(Pid0),index(down,host(Z))) & index(status,host(Pid0)) = elec_2 -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid0) -> -(setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z)))))) & (all Z all Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & elem(m_Down(Pid20),queue(host(Z))) & host(Pid0) = host(Pid20) & index(status,host(Pid0)) = elec_2 -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Pid20) = host(Pid0) & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid0) -> -(setIn(Z,alive) & elem(m_Down(Pid20),queue(host(Z)))))) & (all Z all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & index(ldr,host(Z)) = host(Z) & index(status,host(Z)) = norm & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid0) -> Pid0 = Z)) & (all Z all Pid20 all Pid0 (-leq(host(Pid20),host(Pid0)) & setIn(Pid0,alive) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid20) = host(Z) -> -(setIn(Z,alive) & index(ldr,host(Z)) = host(Z) & index(status,host(Z)) = norm))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Z,alive) & setIn(Pid20,alive) & host(Pid30) = host(Z) & host(Pid0) = host(Pid20) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Z,alive) & setIn(Pid20,alive) & host(Pid30) = host(Z) & host(Pid0) = host(Pid20) -> -(elem(m_Down(Pid0),queue(host(Z))) & setIn(host(Pid30),index(down,host(Pid20)))))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & setIn(Pid0,alive) & elem(m_Down(Z),queue(host(Pid0))) & host(Pid20) = host(Z) & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid20) -> -(setIn(Pid20,alive) & index(status,host(Pid20)) = norm & index(ldr,host(Pid20)) = host(Pid20)))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & setIn(Pid0,alive) & elem(m_Down(Z),queue(host(Pid0))) & host(Pid20) = host(Z) & index(status,host(Pid0)) = wait & host(index(elid,host(Pid0))) = host(Pid20) -> -(setIn(Pid20,alive) & index(status,host(Pid20)) = norm & index(ldr,host(Pid20)) = host(Pid20)))) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | V0 = host(Pid20))) & setIn(Z,alive) & leq(host(Z),host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid30) = host(Pid0) & index(status,host(Z)) = elec_2 & index(status,host(Pid0)) = elec_1 -> -elem(m_Ack(Z,Pid30),queue(host(Z))))) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | V0 = host(Pid20))) & setIn(Pid0,alive) & leq(nbr_proc,s(host(Pid0))) & elem(m_Down(Pid20),queue(host(Pid0))) & elem(m_Down(Pid30),queue(host(Pid0))) & host(Pid30) = s(host(Pid0)) & index(status,host(Pid0)) = elec_1 -> -(setIn(Z,alive) & index(ldr,host(Z)) = host(Z) & index(status,host(Z)) = norm))) & queue(host(X)) = cons(m_Ack(W,Y),V) -> (setIn(X,alive) -> (index(elid,host(X)) = W & index(status,host(X)) = elec_2 & host(Y) = index(pendack,host(X)) -> (leq(nbr_proc,index(pendack,host(X))) -> (all Z (-(setIn(host(Z),index(acks,host(X))) | host(Z) = host(Y)) -> (all V0 (host(X) = host(V0) -> (all W0 all X0 all Y0 (host(X) != host(Y0) -> ((all V1 (-leq(host(Y0),V1) & leq(s(zero),V1) -> setIn(V1,index(down,host(Y0))) | V1 = host(X0))) & setIn(Y0,alive) & leq(nbr_proc,s(host(Y0))) & elem(m_Down(W0),queue(host(Y0))) & elem(m_Down(X0),queue(host(Y0))) & host(W0) = s(host(Y0)) & index(status,host(Y0)) = elec_1 -> -(setIn(V0,alive) & host(X) = host(V0)))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause). [assumption].
% 18.51/18.78
% 18.51/18.78 ============================== end of process non-clausal formulas ===
% 18.51/18.78
% 18.51/18.78 ============================== PROCESS INITIAL CLAUSES ===============
% 18.51/18.78
% 18.51/18.78 ============================== PREDICATE ELIMINATION =================
% 18.51/18.78
% 18.51/18.78 ============================== end predicate elimination =============
% 18.51/18.78
% 18.51/18.78 Auto_denials: (non-Horn, no changes).
% 18.51/18.78
% 18.51/18.78 Term ordering decisions:
% 18.51/18.78 Function symbol KB weights: alive=1. status=1. ldr=1. norm=1. q_nil=1. elec_2=1. nbr_proc=1. zero=1. elec_1=1. elid=1. pendack=1. down=1. pids=1. wait=1. acks=1. nil=1. setEmpty=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. index=1. cons=1. snoc=1. m_Ack=1. f2=1. f3=1. host=1. m_Down=1. pidMsg=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. f5=1.
% 18.51/18.78
% 18.51/18.78 ============================== end of process initial clauses ========
% 18.51/18.78
% 18.51/18.78 ============================== CLAUSES FOR SEARCH ====================
% 18.51/18.78
% 18.51/18.78 ============================== end of clauses for search =============
% 18.51/18.78
% 18.51/18.78 ============================== SEARCH ================================
% 18.51/18.78
% 18.51/18.78 % Starting search at 0.04 seconds.
% 18.51/18.78
% 18.51/18.78 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 127 (0.00 of 0.33 sec).
% 18.51/18.78
% 18.51/18.78 Low Water (keep): wt=61.000, iters=3949
% 18.51/18.78
% 18.51/18.78 Low Water (keep): wt=60.000, iters=3912
% 18.51/18.78
% 18.51/18.78 Low Water (keep): wt=23.000, iters=3378
% 18.51/18.78
% 18.51/18.78 Low Water (keep): wt=20.000, iters=3550
% 18.51/18.78
% 18.51/18.78 Low Water (keep): wt=19.000, iters=3442
% 18.51/18.78
% 18.51/18.78 Low Water (keep): wt=18.000, iters=3343
% 18.51/18.78
% 18.51/18.78 Low Water (keep): wt=17.000, iters=3387
% 18.51/18.78
% 18.51/18.78 Low Water (keep): wt=16.000, iters=3405
% 18.51/18.78
% 18.51/18.78 Low Water (keep): wt=15.000, iters=3351
% 18.51/18.78
% 18.51/18.78 Low Water (keep): wt=14.000, iters=3333
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6144, wt=193.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6156, wt=192.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=5672, wt=191.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=5684, wt=190.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6430, wt=188.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6327, wt=179.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6339, wt=178.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6283, wt=175.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6289, wt=174.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=5756, wt=173.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=5762, wt=172.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6614, wt=171.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=5604, wt=165.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=5450, wt=164.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=5612, wt=162.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6427, wt=161.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6434, wt=160.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6769, wt=155.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6276, wt=151.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6147, wt=149.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6607, wt=148.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6620, wt=147.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6330, wt=139.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6420, wt=135.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6764, wt=134.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6773, wt=133.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6273, wt=130.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6279, wt=129.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=5746, wt=128.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=5752, wt=127.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6610, wt=120.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6152, wt=119.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=5680, wt=117.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6417, wt=116.000
% 18.51/18.78
% 18.51/18.78 Low Water (displace): id=6423, wt=115.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6287, wt=114.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6432, wt=113.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6145, wt=112.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6290, wt=111.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6767, wt=110.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=5763, wt=109.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6428, wt=108.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6616, wt=106.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6173, wt=105.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6869, wt=104.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6609, wt=103.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=5676, wt=102.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6864, wt=101.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6771, wt=100.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6868, wt=99.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6331, wt=98.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6890, wt=97.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6656, wt=96.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6770, wt=95.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6888, wt=94.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6765, wt=93.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6889, wt=92.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6664, wt=91.000
% 47.93/48.30
% 47.93/48.30 Low Water (displace): id=6887, wt=90.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=6896, wt=89.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=12002, wt=86.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=18795, wt=85.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=12109, wt=82.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=15161, wt=81.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=15176, wt=80.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=12961, wt=78.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=15850, wt=77.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=15870, wt=76.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=12239, wt=75.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=12112, wt=74.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=17966, wt=73.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=12062, wt=72.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=12958, wt=71.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=13019, wt=70.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=18369, wt=69.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=14349, wt=68.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=15817, wt=67.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=15838, wt=66.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=19076, wt=65.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=18770, wt=64.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=18368, wt=63.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=18782, wt=62.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=19075, wt=61.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=18769, wt=60.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=12753, wt=59.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=19079, wt=58.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=19671, wt=57.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=20002, wt=56.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=20038, wt=55.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=20109, wt=54.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=20684, wt=53.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=20613, wt=52.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=20035, wt=51.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=20520, wt=50.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=21508, wt=49.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=22033, wt=48.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=22054, wt=47.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=22712, wt=46.000
% 48.03/48.30
% 48.03/48.30 Low Water (displace): id=23445, wt=14.000
% 48.03/48.30
% 48.03/48.30 ============================== PROOF =================================
% 48.03/48.30 % SZS status Theorem
% 48.03/48.30 % SZS output start Refutation
% 48.03/48.30
% 48.03/48.30 % Proof 1 at 45.67 (+ 1.58) seconds.
% 48.03/48.30 % Length of proof is 63.
% 48.03/48.30 % Level of proof is 12.
% 48.03/48.30 % Maximum clause weight is 33.000.
% 48.03/48.30 % Given clauses 11368.
% 48.03/48.30
% 48.03/48.30 3 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause). [assumption].
% 48.03/48.30 4 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause). [assumption].
% 48.03/48.30 50 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause). [assumption].
% 48.03/48.30 53 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause). [assumption].
% 48.03/48.30 56 (all X all Y (leq(X,s(Y)) <-> X = s(Y) | leq(X,Y))) # label(axiom_64) # label(axiom) # label(non_clause). [assumption].
% 48.03/48.30 58 -(all V all W all X all Y ((all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (Pid0 != Z & host(Pid0) = host(Z) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z ((index(status,host(Z)) = elec_1 | index(status,host(Z)) = elec_2) & setIn(Z,alive) -> index(elid,host(Z)) = Z)) & (all Z all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & setIn(host(Pid0),index(down,host(Z))) & index(status,host(Pid0)) = elec_2 -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid0) -> -(setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z)))))) & (all Z all Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & elem(m_Down(Pid20),queue(host(Z))) & host(Pid0) = host(Pid20) & index(status,host(Pid0)) = elec_2 -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Pid20) = host(Pid0) & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid0) -> -(setIn(Z,alive) & elem(m_Down(Pid20),queue(host(Z)))))) & (all Z all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & index(ldr,host(Z)) = host(Z) & index(status,host(Z)) = norm & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid0) -> Pid0 = Z)) & (all Z all Pid20 all Pid0 (-leq(host(Pid20),host(Pid0)) & setIn(Pid0,alive) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid20) = host(Z) -> -(setIn(Z,alive) & index(ldr,host(Z)) = host(Z) & index(status,host(Z)) = norm))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Z,alive) & setIn(Pid20,alive) & host(Pid30) = host(Z) & host(Pid0) = host(Pid20) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Z,alive) & setIn(Pid20,alive) & host(Pid30) = host(Z) & host(Pid0) = host(Pid20) -> -(elem(m_Down(Pid0),queue(host(Z))) & setIn(host(Pid30),index(down,host(Pid20)))))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & setIn(Pid0,alive) & elem(m_Down(Z),queue(host(Pid0))) & host(Pid20) = host(Z) & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid20) -> -(setIn(Pid20,alive) & index(status,host(Pid20)) = norm & index(ldr,host(Pid20)) = host(Pid20)))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & setIn(Pid0,alive) & elem(m_Down(Z),queue(host(Pid0))) & host(Pid20) = host(Z) & index(status,host(Pid0)) = wait & host(index(elid,host(Pid0))) = host(Pid20) -> -(setIn(Pid20,alive) & index(status,host(Pid20)) = norm & index(ldr,host(Pid20)) = host(Pid20)))) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | V0 = host(Pid20))) & setIn(Z,alive) & leq(host(Z),host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid30) = host(Pid0) & index(status,host(Z)) = elec_2 & index(status,host(Pid0)) = elec_1 -> -elem(m_Ack(Z,Pid30),queue(host(Z))))) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | V0 = host(Pid20))) & setIn(Pid0,alive) & leq(nbr_proc,s(host(Pid0))) & elem(m_Down(Pid20),queue(host(Pid0))) & elem(m_Down(Pid30),queue(host(Pid0))) & host(Pid30) = s(host(Pid0)) & index(status,host(Pid0)) = elec_1 -> -(setIn(Z,alive) & index(ldr,host(Z)) = host(Z) & index(status,host(Z)) = norm))) & queue(host(X)) = cons(m_Ack(W,Y),V) -> (setIn(X,alive) -> (index(elid,host(X)) = W & index(status,host(X)) = elec_2 & host(Y) = index(pendack,host(X)) -> (leq(nbr_proc,index(pendack,host(X))) -> (all Z (-(setIn(host(Z),index(acks,host(X))) | host(Z) = host(Y)) -> (all V0 (host(X) = host(V0) -> (all W0 all X0 all Y0 (host(X) != host(Y0) -> ((all V1 (-leq(host(Y0),V1) & leq(s(zero),V1) -> setIn(V1,index(down,host(Y0))) | V1 = host(X0))) & setIn(Y0,alive) & leq(nbr_proc,s(host(Y0))) & elem(m_Down(W0),queue(host(Y0))) & elem(m_Down(X0),queue(host(Y0))) & host(W0) = s(host(Y0)) & index(status,host(Y0)) = elec_1 -> -(setIn(V0,alive) & host(X) = host(V0)))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause). [assumption].
% 48.03/48.30 62 leq(s(zero),host(A)) # label(axiom_02) # label(axiom). [clausify(3)].
% 48.03/48.30 64 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom). [clausify(4)].
% 48.03/48.30 145 -leq(s(A),A) # label(axiom_58) # label(axiom). [clausify(50)].
% 48.03/48.30 148 -leq(A,B) | -leq(B,A) | B = A # label(axiom_61) # label(axiom). [clausify(53)].
% 48.03/48.30 154 -leq(A,s(B)) | s(B) = A | leq(A,B) # label(axiom_64) # label(axiom). [clausify(56)].
% 48.03/48.30 161 index(status,host(A)) != elec_2 | -setIn(A,alive) | index(elid,host(A)) = A # label(conj) # label(negated_conjecture). [clausify(58)].
% 48.03/48.30 162 -setIn(A,alive) | -setIn(B,alive) | -setIn(host(B),index(down,host(A))) | index(status,host(B)) != elec_2 | leq(index(pendack,host(B)),host(A)) # label(conj) # label(negated_conjecture). [clausify(58)].
% 48.03/48.30 164 -setIn(A,alive) | -setIn(B,alive) | -elem(m_Down(C),queue(host(A))) | host(C) != host(B) | index(status,host(B)) != elec_2 | leq(index(pendack,host(B)),host(A)) # label(conj) # label(negated_conjecture). [clausify(58)].
% 48.03/48.30 182 setIn(c3,alive) # label(conj) # label(negated_conjecture). [clausify(58)].
% 48.03/48.30 183 index(elid,host(c3)) = c2 # label(conj) # label(negated_conjecture). [clausify(58)].
% 48.03/48.30 184 index(status,host(c3)) = elec_2 # label(conj) # label(negated_conjecture). [clausify(58)].
% 48.03/48.30 185 elec_2 = index(status,host(c3)). [copy(184),flip(a)].
% 48.03/48.30 186 index(pendack,host(c3)) = host(c4) # label(conj) # label(negated_conjecture). [clausify(58)].
% 48.03/48.30 187 leq(nbr_proc,index(pendack,host(c3))) # label(conj) # label(negated_conjecture). [clausify(58)].
% 48.03/48.30 188 leq(nbr_proc,host(c4)). [copy(187),rewrite([186(5)])].
% 48.03/48.30 191 host(c6) = host(c3) # label(conj) # label(negated_conjecture). [clausify(58)].
% 48.03/48.30 192 host(c9) != host(c3) # label(conj) # label(negated_conjecture). [clausify(58)].
% 48.03/48.30 193 leq(host(c9),A) | -leq(s(zero),A) | setIn(A,index(down,host(c9))) | host(c8) = A # label(conj) # label(negated_conjecture). [clausify(58)].
% 48.03/48.30 194 setIn(c9,alive) # label(conj) # label(negated_conjecture). [clausify(58)].
% 48.03/48.30 195 leq(nbr_proc,s(host(c9))) # label(conj) # label(negated_conjecture). [clausify(58)].
% 48.03/48.30 196 elem(m_Down(c7),queue(host(c9))) # label(conj) # label(negated_conjecture). [clausify(58)].
% 48.03/48.30 197 elem(m_Down(c8),queue(host(c9))) # label(conj) # label(negated_conjecture). [clausify(58)].
% 48.03/48.30 198 s(host(c9)) = host(c7) # label(conj) # label(negated_conjecture). [clausify(58)].
% 48.03/48.30 201 setIn(c6,alive) # label(conj) # label(negated_conjecture). [clausify(58)].
% 48.03/48.30 217 -setIn(A,alive) | -setIn(B,alive) | -elem(m_Down(C),queue(host(A))) | host(C) != host(B) | index(status,host(c3)) != index(status,host(B)) | leq(index(pendack,host(B)),host(A)). [back_rewrite(164),rewrite([185(15)]),flip(e)].
% 48.03/48.30 218 -setIn(A,alive) | -setIn(B,alive) | -setIn(host(B),index(down,host(A))) | index(status,host(c3)) != index(status,host(B)) | leq(index(pendack,host(B)),host(A)). [back_rewrite(162),rewrite([185(13)]),flip(d)].
% 48.03/48.30 219 index(status,host(c3)) != index(status,host(A)) | -setIn(A,alive) | index(elid,host(A)) = A. [back_rewrite(161),rewrite([185(4)]),flip(a)].
% 48.03/48.30 223 leq(nbr_proc,host(c7)). [back_rewrite(195),rewrite([198(4)])].
% 48.03/48.30 331 host(c4) = nbr_proc. [resolve(188,a,148,b),flip(b),unit_del(a,64)].
% 48.03/48.30 333 index(pendack,host(c3)) = nbr_proc. [back_rewrite(186),rewrite([331(6)])].
% 48.03/48.30 345 leq(host(c9),host(A)) | setIn(host(A),index(down,host(c9))) | host(c8) = host(A). [resolve(193,b,62,a)].
% 48.03/48.30 366 -leq(host(c7),host(c9)). [para(198(a,1),145(a,1))].
% 48.03/48.30 369 -leq(A,host(c7)) | host(c7) = A | leq(A,host(c9)). [para(198(a,1),154(a,2)),rewrite([198(6)])].
% 48.03/48.30 392 -setIn(A,alive) | host(c8) != host(A) | index(status,host(c3)) != index(status,host(A)) | leq(index(pendack,host(A)),host(c9)). [resolve(217,c,197,a),unit_del(a,194)].
% 48.03/48.30 393 -setIn(A,alive) | host(c7) != host(A) | index(status,host(c3)) != index(status,host(A)) | leq(index(pendack,host(A)),host(c9)). [resolve(217,c,196,a),unit_del(a,194)].
% 48.03/48.30 395 -setIn(A,alive) | -setIn(host(c3),index(down,host(A))) | leq(nbr_proc,host(A)). [para(191(a,1),218(c,1)),rewrite([191(18),191(23),333(24)]),xx(d),unit_del(b,201)].
% 48.03/48.30 397 c6 = c2. [resolve(219,b,201,a),rewrite([191(7),191(12),183(13)]),flip(b),xx(a)].
% 48.03/48.30 398 c3 = c2. [resolve(219,b,182,a),rewrite([183(13)]),flip(b),xx(a)].
% 48.03/48.30 404 setIn(c2,alive). [back_rewrite(201),rewrite([397(1)])].
% 48.03/48.30 406 -setIn(A,alive) | -setIn(host(c2),index(down,host(A))) | leq(nbr_proc,host(A)). [back_rewrite(395),rewrite([398(3)])].
% 48.03/48.30 408 -setIn(A,alive) | host(c7) != host(A) | index(status,host(c2)) != index(status,host(A)) | leq(index(pendack,host(A)),host(c9)). [back_rewrite(393),rewrite([398(8)])].
% 48.03/48.30 409 -setIn(A,alive) | host(c8) != host(A) | index(status,host(c2)) != index(status,host(A)) | leq(index(pendack,host(A)),host(c9)). [back_rewrite(392),rewrite([398(8)])].
% 48.03/48.30 426 index(pendack,host(c2)) = nbr_proc. [back_rewrite(333),rewrite([398(2)])].
% 48.03/48.30 444 host(c9) != host(c2). [back_rewrite(192),rewrite([398(3)])].
% 48.03/48.30 453 host(c7) = nbr_proc. [resolve(223,a,148,b),flip(b),unit_del(a,64)].
% 48.03/48.30 455 -setIn(A,alive) | host(A) != nbr_proc | index(status,host(c2)) != index(status,host(A)) | leq(index(pendack,host(A)),host(c9)). [back_rewrite(408),rewrite([453(4)]),flip(b)].
% 48.03/48.30 461 -leq(A,nbr_proc) | nbr_proc = A | leq(A,host(c9)). [back_rewrite(369),rewrite([453(2),453(4)])].
% 48.03/48.30 464 -leq(nbr_proc,host(c9)). [back_rewrite(366),rewrite([453(2)])].
% 48.03/48.30 2660 host(A) = nbr_proc | leq(host(A),host(c9)). [resolve(461,a,64,a),flip(a)].
% 48.03/48.30 3000 leq(host(c9),host(c2)) | host(c8) = host(c2). [resolve(406,b,345,b),unit_del(a,194),unit_del(b,464)].
% 48.03/48.30 3045 host(c8) != host(c2). [resolve(409,a,404,a),rewrite([426(18)]),xx(b),unit_del(b,464)].
% 48.03/48.30 3046 leq(host(c9),host(c2)). [back_unit_del(3000),unit_del(b,3045)].
% 48.03/48.30 3056 -leq(host(c2),host(c9)). [resolve(3046,a,148,b),unit_del(b,444)].
% 48.03/48.30 3088 host(c2) = nbr_proc. [resolve(3056,a,2660,b)].
% 48.03/48.30 3312 -setIn(A,alive) | host(A) != nbr_proc | index(status,host(A)) != index(status,nbr_proc) | leq(index(pendack,host(A)),host(c9)). [back_rewrite(455),rewrite([3088(8)]),flip(c)].
% 48.03/48.30 3335 index(pendack,nbr_proc) = nbr_proc. [back_rewrite(426),rewrite([3088(3)])].
% 48.03/48.30 35026 $F. [resolve(3312,a,404,a),rewrite([3088(2),3088(6),3088(13),3335(13)]),xx(a),xx(b),unit_del(a,464)].
% 48.03/48.30
% 48.03/48.30 % SZS output end Refutation
% 48.03/48.30 ============================== end of proof ==========================
% 48.03/48.30
% 48.03/48.30 ============================== STATISTICS ============================
% 48.03/48.30
% 48.03/48.30 Given=11368. Generated=3017904. Kept=34958. proofs=1.
% 48.03/48.30 Usable=9519. Sos=9996. Demods=74. Limbo=0, Disabled=15580. Hints=0.
% 48.03/48.30 Megabytes=61.96.
% 48.03/48.30 User_CPU=45.67, System_CPU=1.58, Wall_clock=48.
% 48.03/48.30
% 48.03/48.30 ============================== end of statistics =====================
% 48.03/48.30
% 48.03/48.30 ============================== end of search =========================
% 48.03/48.30
% 48.03/48.30 THEOREM PROVED
% 48.03/48.30 % SZS status Theorem
% 48.03/48.30
% 48.03/48.30 Exiting with 1 proof.
% 48.03/48.30
% 48.03/48.30 Process 31929 exit (max_proofs) Thu Jun 16 03:05:12 2022
% 48.03/48.30 Prover9 interrupted
%------------------------------------------------------------------------------