TSTP Solution File: SWV472+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV472+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:10 EDT 2022
% Result : Theorem 18.70s 19.06s
% Output : Refutation 18.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : SWV472+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Tue Jun 14 15:42:58 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.54/0.86 ============================== Prover9 ===============================
% 0.54/0.86 Prover9 (32) version 2009-11A, November 2009.
% 0.54/0.86 Process 25830 was started by sandbox on n032.cluster.edu,
% 0.54/0.86 Tue Jun 14 15:42:58 2022
% 0.54/0.86 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_25677_n032.cluster.edu".
% 0.54/0.86 ============================== end of head ===========================
% 0.54/0.86
% 0.54/0.86 ============================== INPUT =================================
% 0.54/0.86
% 0.54/0.86 % Reading from file /tmp/Prover9_25677_n032.cluster.edu
% 0.54/0.86
% 0.54/0.86 set(prolog_style_variables).
% 0.54/0.86 set(auto2).
% 0.54/0.86 % set(auto2) -> set(auto).
% 0.54/0.86 % set(auto) -> set(auto_inference).
% 0.54/0.86 % set(auto) -> set(auto_setup).
% 0.54/0.86 % set(auto_setup) -> set(predicate_elim).
% 0.54/0.86 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.54/0.86 % set(auto) -> set(auto_limits).
% 0.54/0.86 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.54/0.86 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.54/0.86 % set(auto) -> set(auto_denials).
% 0.54/0.86 % set(auto) -> set(auto_process).
% 0.54/0.86 % set(auto2) -> assign(new_constants, 1).
% 0.54/0.86 % set(auto2) -> assign(fold_denial_max, 3).
% 0.54/0.86 % set(auto2) -> assign(max_weight, "200.000").
% 0.54/0.86 % set(auto2) -> assign(max_hours, 1).
% 0.54/0.86 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.54/0.86 % set(auto2) -> assign(max_seconds, 0).
% 0.54/0.86 % set(auto2) -> assign(max_minutes, 5).
% 0.54/0.86 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.54/0.86 % set(auto2) -> set(sort_initial_sos).
% 0.54/0.86 % set(auto2) -> assign(sos_limit, -1).
% 0.54/0.86 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.54/0.86 % set(auto2) -> assign(max_megs, 400).
% 0.54/0.86 % set(auto2) -> assign(stats, some).
% 0.54/0.86 % set(auto2) -> clear(echo_input).
% 0.54/0.86 % set(auto2) -> set(quiet).
% 0.54/0.86 % set(auto2) -> clear(print_initial_clauses).
% 0.54/0.86 % set(auto2) -> clear(print_given).
% 0.54/0.86 assign(lrs_ticks,-1).
% 0.54/0.86 assign(sos_limit,10000).
% 0.54/0.86 assign(order,kbo).
% 0.54/0.86 set(lex_order_vars).
% 0.54/0.86 clear(print_given).
% 0.54/0.86
% 0.54/0.86 % formulas(sos). % not echoed (67 formulas)
% 0.54/0.86
% 0.54/0.86 ============================== end of input ==========================
% 0.54/0.86
% 0.54/0.86 % From the command line: assign(max_seconds, 300).
% 0.54/0.86
% 0.54/0.86 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.54/0.86
% 0.54/0.86 % Formulas that are not ordinary clauses:
% 0.54/0.86 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.54/0.86 2 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 3 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 4 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 5 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 6 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 7 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 8 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 9 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 10 (all X all Y m_NotNorm(X) != m_Halt(Y)) # label(axiom_16) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 11 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 13 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 14 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 15 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 16 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 17 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 18 (all X all Y m_Ldr(X) != m_NotNorm(Y)) # label(axiom_24) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 19 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 20 (all X all Y (X != Y <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 21 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 22 (all X all Y (X != Y <-> m_NotNorm(X) != m_NotNorm(Y))) # label(axiom_28) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 23 (all X all Y (X != Y <-> m_Ldr(X) != m_Ldr(Y))) # label(axiom_29) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 24 (all X all Y (X != Y <-> m_Down(X) != m_Down(Y))) # label(axiom_30) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 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.54/0.86 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.54/0.86 27 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 28 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 29 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 30 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 31 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 32 (all Q (Q = q_nil | Q = cons(head(Q),tail(Q)))) # label(axiom_39) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 33 (all Q (Q = q_nil | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 34 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 35 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 36 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 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.54/0.86 38 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 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.54/0.86 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.54/0.86 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.54/0.86 42 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 43 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 44 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 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.54/0.86 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.54/0.86 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.54/0.86 48 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.86 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.58/0.87 50 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause). [assumption].
% 0.58/0.87 51 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause). [assumption].
% 0.58/0.87 52 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause). [assumption].
% 0.58/0.87 53 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause). [assumption].
% 0.58/0.87 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.58/0.87 55 (all X all Y (leq(X,Y) <-> leq(s(X),s(Y)))) # label(axiom_63) # label(axiom) # label(non_clause). [assumption].
% 0.58/0.87 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.58/0.87 57 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause). [assumption].
% 0.58/0.87 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 (host(Pid0) = nbr_proc -> -elem(m_NotNorm(Z),queue(host(Pid0))))) & (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 Pid20 all Pid0 (host(Pid0) != host(Pid20) & setIn(Pid0,alive) & host(Pid0) = host(Z) & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid20) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & setIn(Pid0,alive) & host(Pid0) = host(Z) & index(status,host(Pid0)) = wait & host(index(elid,host(Pid0))) = host(Pid20) -> -elem(m_Down(Z),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))) & 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 Pid30 all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | V0 = host(Pid20))) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid0) = nbr_proc & host(Pid0) = host(Pid30) & index(status,host(Pid0)) = elec_1 -> -(setIn(Z,alive) & elem(m_Down(Pid30),queue(host(Z)))))) & 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 (s(index(pendack,host(X))) = host(Z) -> (host(X) = host(Z) -> (all W0 all X0 all Y0 (s(index(pendack,host(X))) != host(Y0) -> (host(X) != host(Y0) -> ((all V0 (-leq(host(Y0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Y0))) | V0 = host(X0))) & elem(m_Down(X0),queue(host(Y0))) & host(Y0) = host(W0) & host(Y0) = nbr_proc & index(status,host(Y0)) = elec_1 -> -(setIn(Z,alive) & elem(m_Down(W0),snoc(V,m_Halt(X)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.58/0.87
% 0.58/0.87 ============================== end of process non-clausal formulas ===
% 0.58/0.87
% 0.58/0.87 ============================== PROCESS INITIAL CLAUSES ===============
% 0.58/0.87
% 0.58/0.87 ============================== PREDICATE ELIMINATION =================
% 0.58/0.87
% 0.58/0.87 ============================== end predicate elimination =============
% 0.58/0.87
% 0.58/0.87 Auto_denials: (non-Horn, no changes).
% 0.58/0.87
% 0.58/0.87 Term ordering decisions:
% 0.58/0.87 Function symbol KB weights: alive=1. q_nil=1. status=1. elid=1. nbr_proc=1. zero=1. elec_1=1. down=1. elec_2=1. pendack=1. pids=1. ldr=1. norm=1. wait=1. nil=1. setEmpty=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. snoc=1. cons=1. index=1. m_Ack=1. f2=1. f3=1. host=1. pidMsg=1. m_Down=1. s=1. queue=1. m_Halt=1. m_Ldr=1. m_NormQ=1. m_NotNorm=1. head=1. init=1. last=1. tail=1. f1=1. f4=1.
% 0.58/0.87
% 0.58/0.87 ============================== end of process initial clauses ========
% 18.70/19.06
% 18.70/19.06 ============================== CLAUSES FOR SEARCH ====================
% 18.70/19.06
% 18.70/19.06 ============================== end of clauses for search =============
% 18.70/19.06
% 18.70/19.06 ============================== SEARCH ================================
% 18.70/19.06
% 18.70/19.06 % Starting search at 0.03 seconds.
% 18.70/19.06
% 18.70/19.06 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 64 (0.00 of 0.30 sec).
% 18.70/19.06
% 18.70/19.06 Low Water (keep): wt=57.000, iters=3705
% 18.70/19.06
% 18.70/19.06 Low Water (keep): wt=55.000, iters=3693
% 18.70/19.06
% 18.70/19.06 Low Water (keep): wt=40.000, iters=3540
% 18.70/19.06
% 18.70/19.06 Low Water (keep): wt=31.000, iters=3343
% 18.70/19.06
% 18.70/19.06 Low Water (keep): wt=26.000, iters=3387
% 18.70/19.06
% 18.70/19.06 Low Water (keep): wt=22.000, iters=3387
% 18.70/19.06
% 18.70/19.06 Low Water (keep): wt=21.000, iters=3370
% 18.70/19.06
% 18.70/19.06 Low Water (keep): wt=19.000, iters=3364
% 18.70/19.06
% 18.70/19.06 Low Water (keep): wt=18.000, iters=3364
% 18.70/19.06
% 18.70/19.06 Low Water (keep): wt=17.000, iters=3337
% 18.70/19.06
% 18.70/19.06 Low Water (keep): wt=16.000, iters=3348
% 18.70/19.06
% 18.70/19.06 Low Water (keep): wt=15.000, iters=3340
% 18.70/19.06
% 18.70/19.06 ============================== PROOF =================================
% 18.70/19.06 % SZS status Theorem
% 18.70/19.06 % SZS output start Refutation
% 18.70/19.06
% 18.70/19.06 % Proof 1 at 17.63 (+ 0.59) seconds.
% 18.70/19.06 % Length of proof is 52.
% 18.70/19.06 % Level of proof is 11.
% 18.70/19.06 % Maximum clause weight is 40.000.
% 18.70/19.06 % Given clauses 6608.
% 18.70/19.06
% 18.70/19.06 11 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause). [assumption].
% 18.70/19.06 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].
% 18.70/19.06 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].
% 18.70/19.06 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 (host(Pid0) = nbr_proc -> -elem(m_NotNorm(Z),queue(host(Pid0))))) & (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 Pid20 all Pid0 (host(Pid0) != host(Pid20) & setIn(Pid0,alive) & host(Pid0) = host(Z) & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid20) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & setIn(Pid0,alive) & host(Pid0) = host(Z) & index(status,host(Pid0)) = wait & host(index(elid,host(Pid0))) = host(Pid20) -> -elem(m_Down(Z),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))) & 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 Pid30 all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | V0 = host(Pid20))) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid0) = nbr_proc & host(Pid0) = host(Pid30) & index(status,host(Pid0)) = elec_1 -> -(setIn(Z,alive) & elem(m_Down(Pid30),queue(host(Z)))))) & 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 (s(index(pendack,host(X))) = host(Z) -> (host(X) = host(Z) -> (all W0 all X0 all Y0 (s(index(pendack,host(X))) != host(Y0) -> (host(X) != host(Y0) -> ((all V0 (-leq(host(Y0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Y0))) | V0 = host(X0))) & elem(m_Down(X0),queue(host(Y0))) & host(Y0) = host(W0) & host(Y0) = nbr_proc & index(status,host(Y0)) = elec_1 -> -(setIn(Z,alive) & elem(m_Down(W0),snoc(V,m_Halt(X)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause). [assumption].
% 18.70/19.06 83 m_Down(A) != m_Halt(B) # label(axiom_17) # label(axiom). [clausify(11)].
% 18.70/19.06 121 elem(A,cons(B,C)) | -elem(A,C) # label(axiom_46) # label(axiom). [clausify(39)].
% 18.70/19.06 122 -elem(A,snoc(B,C)) | C = A | elem(A,B) # label(axiom_47) # label(axiom). [clausify(40)].
% 18.70/19.06 167 index(status,host(A)) != elec_2 | -setIn(A,alive) | index(elid,host(A)) = A # label(conj) # label(negated_conjecture). [clausify(58)].
% 18.70/19.06 172 -leq(host(A),f4(B,C,D,A)) | -elem(m_Down(D),queue(host(A))) | host(A) != nbr_proc | host(C) != host(A) | index(status,host(A)) != elec_1 | -setIn(B,alive) | -elem(m_Down(C),queue(host(B))) # label(conj) # label(negated_conjecture). [clausify(58)].
% 18.70/19.06 173 leq(s(zero),f4(A,B,C,D)) | -elem(m_Down(C),queue(host(D))) | host(D) != nbr_proc | host(B) != host(D) | index(status,host(D)) != elec_1 | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))) # label(conj) # label(negated_conjecture). [clausify(58)].
% 18.70/19.06 174 -setIn(f4(A,B,C,D),index(down,host(D))) | -elem(m_Down(C),queue(host(D))) | host(D) != nbr_proc | host(B) != host(D) | index(status,host(D)) != elec_1 | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))) # label(conj) # label(negated_conjecture). [clausify(58)].
% 18.70/19.06 175 host(A) != f4(B,C,A,D) | -elem(m_Down(A),queue(host(D))) | host(D) != nbr_proc | host(C) != host(D) | index(status,host(D)) != elec_1 | -setIn(B,alive) | -elem(m_Down(C),queue(host(B))) # label(conj) # label(negated_conjecture). [clausify(58)].
% 18.70/19.06 176 f4(A,B,C,D) != host(C) | -elem(m_Down(C),queue(host(D))) | host(D) != nbr_proc | host(B) != host(D) | index(status,host(D)) != elec_1 | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))). [copy(175),flip(a)].
% 18.70/19.06 177 cons(m_Ack(c2,c4),c1) = queue(host(c3)) # label(conj) # label(negated_conjecture). [clausify(58)].
% 18.70/19.06 178 setIn(c3,alive) # label(conj) # label(negated_conjecture). [clausify(58)].
% 18.70/19.06 179 index(elid,host(c3)) = c2 # label(conj) # label(negated_conjecture). [clausify(58)].
% 18.70/19.06 180 index(status,host(c3)) = elec_2 # label(conj) # label(negated_conjecture). [clausify(58)].
% 18.70/19.06 189 leq(host(c8),A) | -leq(s(zero),A) | setIn(A,index(down,host(c8))) | host(c7) = A # label(conj) # label(negated_conjecture). [clausify(58)].
% 18.70/19.06 190 elem(m_Down(c7),queue(host(c8))) # label(conj) # label(negated_conjecture). [clausify(58)].
% 18.70/19.06 191 host(c8) = host(c6) # label(conj) # label(negated_conjecture). [clausify(58)].
% 18.70/19.06 192 host(c8) = nbr_proc # label(conj) # label(negated_conjecture). [clausify(58)].
% 18.70/19.06 193 host(c6) = nbr_proc. [copy(192),rewrite([191(2)])].
% 18.70/19.06 194 index(status,host(c8)) = elec_1 # label(conj) # label(negated_conjecture). [clausify(58)].
% 18.70/19.06 195 index(status,nbr_proc) = elec_1. [copy(194),rewrite([191(3),193(3)])].
% 18.70/19.06 197 elem(m_Down(c6),snoc(c1,m_Halt(c3))) # label(conj) # label(negated_conjecture). [clausify(58)].
% 18.70/19.06 200 elem(m_Down(c7),queue(nbr_proc)). [back_rewrite(190),rewrite([191(4),193(4)])].
% 18.70/19.06 201 leq(nbr_proc,A) | -leq(s(zero),A) | setIn(A,index(down,nbr_proc)) | host(c7) = A. [back_rewrite(189),rewrite([191(2),193(2),191(8),193(8)])].
% 18.70/19.06 294 f4(c3,A,B,C) != host(B) | -elem(m_Down(B),queue(host(C))) | host(C) != nbr_proc | host(A) != host(C) | index(status,host(C)) != elec_1 | -elem(m_Down(A),queue(host(c3))). [resolve(178,a,176,f)].
% 18.70/19.06 295 leq(s(zero),f4(c3,A,B,C)) | -elem(m_Down(B),queue(host(C))) | host(C) != nbr_proc | host(A) != host(C) | index(status,host(C)) != elec_1 | -elem(m_Down(A),queue(host(c3))). [resolve(178,a,173,f)].
% 18.70/19.06 296 -leq(host(A),f4(c3,B,C,A)) | -elem(m_Down(C),queue(host(A))) | host(A) != nbr_proc | host(B) != host(A) | index(status,host(A)) != elec_1 | -elem(m_Down(B),queue(host(c3))). [resolve(178,a,172,f)].
% 18.70/19.06 300 c3 = c2. [resolve(178,a,167,b),rewrite([180(4),179(7)]),flip(b),xx(a)].
% 18.70/19.06 309 -leq(host(A),f4(c2,B,C,A)) | -elem(m_Down(C),queue(host(A))) | host(A) != nbr_proc | host(B) != host(A) | index(status,host(A)) != elec_1 | -elem(m_Down(B),queue(host(c2))). [back_rewrite(296),rewrite([300(2),300(21)])].
% 18.70/19.06 310 leq(s(zero),f4(c2,A,B,C)) | -elem(m_Down(B),queue(host(C))) | host(C) != nbr_proc | host(A) != host(C) | index(status,host(C)) != elec_1 | -elem(m_Down(A),queue(host(c2))). [back_rewrite(295),rewrite([300(3),300(22)])].
% 18.70/19.06 311 f4(c2,A,B,C) != host(B) | -elem(m_Down(B),queue(host(C))) | host(C) != nbr_proc | host(A) != host(C) | index(status,host(C)) != elec_1 | -elem(m_Down(A),queue(host(c2))). [back_rewrite(294),rewrite([300(1),300(21)])].
% 18.70/19.07 319 elem(m_Down(c6),snoc(c1,m_Halt(c2))). [back_rewrite(197),rewrite([300(4)])].
% 18.70/19.07 324 setIn(c2,alive). [back_rewrite(178),rewrite([300(1)])].
% 18.70/19.07 325 cons(m_Ack(c2,c4),c1) = queue(host(c2)). [back_rewrite(177),rewrite([300(6)])].
% 18.70/19.07 335 -setIn(f4(A,B,C,c6),index(down,nbr_proc)) | -elem(m_Down(C),queue(nbr_proc)) | host(B) != nbr_proc | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))). [para(193(a,1),174(a,2,2)),rewrite([193(9),193(12),193(16),193(19),195(19)]),xx(c),xx(e)].
% 18.70/19.07 430 -leq(nbr_proc,f4(c2,A,B,c6)) | -elem(m_Down(B),queue(nbr_proc)) | host(A) != nbr_proc | -elem(m_Down(A),queue(host(c2))). [para(193(a,1),309(b,2,1)),rewrite([193(2),193(11),193(15),193(18),195(18)]),xx(c),xx(e)].
% 18.70/19.07 469 -leq(nbr_proc,f4(c2,A,c7,c6)) | host(A) != nbr_proc | -elem(m_Down(A),queue(host(c2))). [resolve(430,b,200,a)].
% 18.70/19.07 501 f4(c2,A,B,c6) != host(B) | -elem(m_Down(B),queue(nbr_proc)) | host(A) != nbr_proc | -elem(m_Down(A),queue(host(c2))). [para(193(a,1),311(b,2,1)),rewrite([193(11),193(15),193(18),195(18)]),xx(c),xx(e)].
% 18.70/19.07 507 f4(c2,A,c7,c6) != host(c7) | host(A) != nbr_proc | -elem(m_Down(A),queue(host(c2))). [resolve(501,b,200,a)].
% 18.70/19.07 777 elem(m_Down(c6),c1). [resolve(319,a,122,a),unit_del(a(flip),83)].
% 18.70/19.07 783 elem(m_Down(c6),cons(A,c1)). [resolve(777,a,121,b)].
% 18.70/19.07 1376 elem(m_Down(c6),queue(host(c2))). [para(325(a,1),783(a,2))].
% 18.70/19.07 1386 f4(c2,c6,c7,c6) != host(c7). [resolve(1376,a,507,c),rewrite([193(10)]),xx(b)].
% 18.70/19.07 1390 -leq(nbr_proc,f4(c2,c6,c7,c6)). [resolve(1376,a,469,c),rewrite([193(9)]),xx(b)].
% 18.70/19.07 1940 leq(s(zero),f4(c2,c6,A,B)) | -elem(m_Down(A),queue(host(B))) | host(B) != nbr_proc | index(status,host(B)) != elec_1. [resolve(310,f,1376,a),rewrite([193(15)]),flip(d),merge(d)].
% 18.70/19.07 14164 leq(s(zero),f4(c2,c6,A,c6)) | -elem(m_Down(A),queue(nbr_proc)). [para(193(a,1),1940(b,2,1)),rewrite([193(13),193(17),195(17)]),xx(c),xx(d)].
% 18.70/19.07 14166 leq(s(zero),f4(c2,c6,c7,c6)). [resolve(14164,b,200,a)].
% 18.70/19.07 14186 setIn(f4(c2,c6,c7,c6),index(down,nbr_proc)). [resolve(14166,a,201,b),flip(c),unit_del(a,1390),unit_del(c,1386)].
% 18.70/19.07 14221 $F. [resolve(14186,a,335,a),rewrite([193(7)]),xx(b),unit_del(a,200),unit_del(b,324),unit_del(c,1376)].
% 18.70/19.07
% 18.70/19.07 % SZS output end Refutation
% 18.70/19.07 ============================== end of proof ==========================
% 18.70/19.07
% 18.70/19.07 ============================== STATISTICS ============================
% 18.70/19.07
% 18.70/19.07 Given=6608. Generated=1156326. Kept=14147. proofs=1.
% 18.70/19.07 Usable=6594. Sos=7402. Demods=48. Limbo=0, Disabled=278. Hints=0.
% 18.70/19.07 Megabytes=29.95.
% 18.70/19.07 User_CPU=17.63, System_CPU=0.59, Wall_clock=18.
% 18.70/19.07
% 18.70/19.07 ============================== end of statistics =====================
% 18.70/19.07
% 18.70/19.07 ============================== end of search =========================
% 18.70/19.07
% 18.70/19.07 THEOREM PROVED
% 18.70/19.07 % SZS status Theorem
% 18.70/19.07
% 18.70/19.07 Exiting with 1 proof.
% 18.70/19.07
% 18.70/19.07 Process 25830 exit (max_proofs) Tue Jun 14 15:43:16 2022
% 18.70/19.07 Prover9 interrupted
%------------------------------------------------------------------------------