TSTP Solution File: SWV468+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV468+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n012.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:09 EDT 2022
% Result : Theorem 64.44s 64.71s
% Output : Refutation 64.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV468+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 15 16:20:09 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.75/1.04 ============================== Prover9 ===============================
% 0.75/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.04 Process 17369 was started by sandbox on n012.cluster.edu,
% 0.75/1.04 Wed Jun 15 16:20:10 2022
% 0.75/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17216_n012.cluster.edu".
% 0.75/1.04 ============================== end of head ===========================
% 0.75/1.04
% 0.75/1.04 ============================== INPUT =================================
% 0.75/1.04
% 0.75/1.04 % Reading from file /tmp/Prover9_17216_n012.cluster.edu
% 0.75/1.04
% 0.75/1.04 set(prolog_style_variables).
% 0.75/1.04 set(auto2).
% 0.75/1.04 % set(auto2) -> set(auto).
% 0.75/1.04 % set(auto) -> set(auto_inference).
% 0.75/1.04 % set(auto) -> set(auto_setup).
% 0.75/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.04 % set(auto) -> set(auto_limits).
% 0.75/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.04 % set(auto) -> set(auto_denials).
% 0.75/1.04 % set(auto) -> set(auto_process).
% 0.75/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.04 % set(auto2) -> assign(stats, some).
% 0.75/1.04 % set(auto2) -> clear(echo_input).
% 0.75/1.04 % set(auto2) -> set(quiet).
% 0.75/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.04 % set(auto2) -> clear(print_given).
% 0.75/1.04 assign(lrs_ticks,-1).
% 0.75/1.04 assign(sos_limit,10000).
% 0.75/1.04 assign(order,kbo).
% 0.75/1.04 set(lex_order_vars).
% 0.75/1.04 clear(print_given).
% 0.75/1.04
% 0.75/1.04 % formulas(sos). % not echoed (67 formulas)
% 0.75/1.04
% 0.75/1.04 ============================== end of input ==========================
% 0.75/1.04
% 0.75/1.04 % From the command line: assign(max_seconds, 300).
% 0.75/1.04
% 0.75/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.04
% 0.75/1.04 % Formulas that are not ordinary clauses:
% 0.75/1.04 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.75/1.04 2 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 3 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 4 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 5 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 6 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 7 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 8 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 9 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 10 (all X all Y m_NotNorm(X) != m_Halt(Y)) # label(axiom_16) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 11 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 13 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 14 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 15 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 16 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 17 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 18 (all X all Y m_Ldr(X) != m_NotNorm(Y)) # label(axiom_24) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 19 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 20 (all X all Y (X != Y <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 21 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 22 (all X all Y (X != Y <-> m_NotNorm(X) != m_NotNorm(Y))) # label(axiom_28) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 23 (all X all Y (X != Y <-> m_Ldr(X) != m_Ldr(Y))) # label(axiom_29) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 24 (all X all Y (X != Y <-> m_Down(X) != m_Down(Y))) # label(axiom_30) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 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.75/1.05 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.75/1.05 27 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 28 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 29 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 30 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 31 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 32 (all Q (Q = q_nil | Q = cons(head(Q),tail(Q)))) # label(axiom_39) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 33 (all Q (Q = q_nil | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 34 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 35 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 36 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 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.75/1.05 38 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 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.75/1.05 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.75/1.05 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.75/1.05 42 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 43 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 44 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 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.75/1.05 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.75/1.05 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.75/1.05 48 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 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.75/1.05 50 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 51 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 52 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 53 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 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.75/1.05 55 (all X all Y (leq(X,Y) <-> leq(s(X),s(Y)))) # label(axiom_63) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 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.75/1.05 57 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.05 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 (Pid0 != Z & host(Pid0) = host(Z) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 -> -elem(m_Ack(Z,Pid0),queue(host(Z))))) & (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 (-leq(host(Pid0),host(Z)) & setIn(Z,alive) & setIn(Pid0,alive) & host(Pid0) = host(Pid20) & index(status,host(Pid0)) = elec_2 -> -elem(m_Down(Pid20),queue(host(Z))))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Z,alive) & setIn(Pid0,alive) & index(status,host(Z)) = elec_2 & index(status,host(Pid0)) = elec_2 -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Ack(Pid0,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 Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & host(Pid0) = host(Pid20) & index(status,host(Z)) = elec_2 & index(status,host(Pid0)) = elec_2 -> -elem(m_Ack(Z,Pid20),queue(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 (-leq(index(pendack,host(Pid0)),host(Z)) & setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 -> -(setIn(Z,alive) & index(ldr,host(Z)) = host(Z) & index(status,host(Z)) = norm))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Z,alive) & setIn(Pid0,alive) & index(status,host(Z)) = elec_2 & index(status,host(Pid0)) = elec_2 -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid20) = host(Z) & index(status,host(Pid0)) = elec_2 -> -(setIn(Z,alive) & index(ldr,host(Z)) = host(Z) & index(status,host(Z)) = norm))) & (all Z all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | V0 = host(Pid20))) & -leq(host(Pid0),host(Z)) & elem(m_Down(Pid20),queue(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_Down(Y),V) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(index(ldr,host(X)) = host(Y) & index(status,host(X)) = norm | index(status,host(X)) = wait & host(Y) = host(index(elid,host(X)))) -> ((all Z (-leq(host(X),Z) & leq(s(zero),Z) -> setIn(Z,index(down,host(X))) | Z = host(Y))) & index(status,host(X)) = elec_1 -> (leq(nbr_proc,host(X)) -> (all Z (-setIn(host(Z),setEmpty) -> (all V0 (host(X) = host(V0) -> (all W0 (host(X) != host(W0) -> (-leq(index(pendack,host(W0)),host(V0)) & setIn(W0,alive) & index(status,host(W0)) = elec_2 -> -(setIn(V0,alive) & host(X) = host(V0)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause). [assumption].
% 64.44/64.71
% 64.44/64.71 ============================== end of process non-clausal formulas ===
% 64.44/64.71
% 64.44/64.71 ============================== PROCESS INITIAL CLAUSES ===============
% 64.44/64.71
% 64.44/64.71 ============================== PREDICATE ELIMINATION =================
% 64.44/64.71
% 64.44/64.71 ============================== end predicate elimination =============
% 64.44/64.71
% 64.44/64.71 Auto_denials: (non-Horn, no changes).
% 64.44/64.71
% 64.44/64.71 Term ordering decisions:
% 64.44/64.71 Function symbol KB weights: alive=1. status=1. elec_2=1. q_nil=1. elec_1=1. pendack=1. ldr=1. norm=1. zero=1. down=1. nbr_proc=1. elid=1. pids=1. nil=1. setEmpty=1. wait=1. c1=1. c3=1. c4=1. c5=1. c6=1. c7=1. index=1. cons=1. snoc=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.
% 64.44/64.71
% 64.44/64.71 ============================== end of process initial clauses ========
% 64.44/64.71
% 64.44/64.71 ============================== CLAUSES FOR SEARCH ====================
% 64.44/64.71
% 64.44/64.71 ============================== end of clauses for search =============
% 64.44/64.71
% 64.44/64.71 ============================== SEARCH ================================
% 64.44/64.71
% 64.44/64.71 % Starting search at 0.04 seconds.
% 64.44/64.71
% 64.44/64.71 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 139 (0.00 of 0.37 sec).
% 64.44/64.71
% 64.44/64.71 Low Water (keep): wt=16.000, iters=3924
% 64.44/64.71
% 64.44/64.71 Low Water (keep): wt=15.000, iters=3587
% 64.44/64.71
% 64.44/64.71 Low Water (keep): wt=14.000, iters=3335
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=4854, wt=124.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=12813, wt=122.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=17496, wt=119.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=13761, wt=116.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=16015, wt=115.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=17096, wt=114.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=13767, wt=113.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=12224, wt=110.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=12674, wt=107.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=16014, wt=103.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=17095, wt=102.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=13981, wt=101.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=13766, wt=99.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=11654, wt=98.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=17525, wt=93.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=17117, wt=92.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=15614, wt=91.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=12673, wt=90.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=12445, wt=88.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=13939, wt=87.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=10399, wt=86.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=16012, wt=85.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=15333, wt=81.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=15342, wt=80.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=12676, wt=79.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=17524, wt=78.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=17116, wt=77.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=13983, wt=76.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=15341, wt=75.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=15345, wt=74.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=15372, wt=73.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=17527, wt=71.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=17120, wt=70.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=17526, wt=69.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=17118, wt=68.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=17531, wt=67.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=17494, wt=66.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=17449, wt=65.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=13764, wt=64.000
% 64.44/64.71
% 64.44/64.71 Low Water (displace): id=17870, wt=14.000
% 64.44/64.71
% 64.44/64.71 ============================== PROOF =================================
% 64.44/64.71 % SZS status Theorem
% 64.44/64.71 % SZS output start Refutation
% 64.44/64.71
% 64.44/64.71 % Proof 1 at 61.53 (+ 2.15) seconds.
% 64.44/64.71 % Length of proof is 53.
% 64.44/64.71 % Level of proof is 11.
% 64.44/64.71 % Maximum clause weight is 33.000.
% 64.44/64.71 % Given clauses 15041.
% 64.44/64.71
% 64.44/64.71 3 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause). [assumption].
% 64.44/64.71 4 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause). [assumption].
% 64.44/64.71 31 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause). [assumption].
% 64.44/64.71 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].
% 64.44/64.71 52 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause). [assumption].
% 64.44/64.71 53 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause). [assumption].
% 64.44/64.71 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 (Pid0 != Z & host(Pid0) = host(Z) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 -> -elem(m_Ack(Z,Pid0),queue(host(Z))))) & (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 (-leq(host(Pid0),host(Z)) & setIn(Z,alive) & setIn(Pid0,alive) & host(Pid0) = host(Pid20) & index(status,host(Pid0)) = elec_2 -> -elem(m_Down(Pid20),queue(host(Z))))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Z,alive) & setIn(Pid0,alive) & index(status,host(Z)) = elec_2 & index(status,host(Pid0)) = elec_2 -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Ack(Pid0,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 Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & host(Pid0) = host(Pid20) & index(status,host(Z)) = elec_2 & index(status,host(Pid0)) = elec_2 -> -elem(m_Ack(Z,Pid20),queue(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 (-leq(index(pendack,host(Pid0)),host(Z)) & setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 -> -(setIn(Z,alive) & index(ldr,host(Z)) = host(Z) & index(status,host(Z)) = norm))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Z,alive) & setIn(Pid0,alive) & index(status,host(Z)) = elec_2 & index(status,host(Pid0)) = elec_2 -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid20) = host(Z) & index(status,host(Pid0)) = elec_2 -> -(setIn(Z,alive) & index(ldr,host(Z)) = host(Z) & index(status,host(Z)) = norm))) & (all Z all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | V0 = host(Pid20))) & -leq(host(Pid0),host(Z)) & elem(m_Down(Pid20),queue(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_Down(Y),V) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(index(ldr,host(X)) = host(Y) & index(status,host(X)) = norm | index(status,host(X)) = wait & host(Y) = host(index(elid,host(X)))) -> ((all Z (-leq(host(X),Z) & leq(s(zero),Z) -> setIn(Z,index(down,host(X))) | Z = host(Y))) & index(status,host(X)) = elec_1 -> (leq(nbr_proc,host(X)) -> (all Z (-setIn(host(Z),setEmpty) -> (all V0 (host(X) = host(V0) -> (all W0 (host(X) != host(W0) -> (-leq(index(pendack,host(W0)),host(V0)) & setIn(W0,alive) & index(status,host(W0)) = elec_2 -> -(setIn(V0,alive) & host(X) = host(V0)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause). [assumption].
% 64.44/64.71 62 leq(s(zero),host(A)) # label(axiom_02) # label(axiom). [clausify(3)].
% 64.44/64.71 63 leq(s(zero),nbr_proc) # label(axiom_03) # label(axiom). [assumption].
% 64.44/64.71 64 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom). [clausify(4)].
% 64.44/64.71 108 init(snoc(A,B)) = A # label(axiom_38) # label(axiom). [clausify(31)].
% 64.44/64.71 117 elem(A,cons(B,C)) | B != A # label(axiom_46) # label(axiom). [clausify(39)].
% 64.44/64.71 149 leq(A,B) | leq(B,A) # label(axiom_60) # label(axiom). [clausify(52)].
% 64.44/64.71 150 -leq(A,B) | -leq(B,A) | B = A # label(axiom_61) # label(axiom). [clausify(53)].
% 64.44/64.71 164 -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)].
% 64.44/64.71 170 -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)].
% 64.44/64.71 179 cons(m_Down(c4),c1) = queue(host(c3)) # label(conj) # label(negated_conjecture). [clausify(58)].
% 64.44/64.71 180 setIn(c3,alive) # label(conj) # label(negated_conjecture). [clausify(58)].
% 64.44/64.71 184 leq(host(c3),A) | -leq(s(zero),A) | setIn(A,index(down,host(c3))) | host(c4) = A # label(conj) # label(negated_conjecture). [clausify(58)].
% 64.44/64.71 187 leq(nbr_proc,host(c3)) # label(conj) # label(negated_conjecture). [clausify(58)].
% 64.44/64.71 188 host(c6) = host(c3) # label(conj) # label(negated_conjecture). [clausify(58)].
% 64.44/64.71 189 host(c7) != host(c3) # label(conj) # label(negated_conjecture). [clausify(58)].
% 64.44/64.71 190 -leq(index(pendack,host(c7)),host(c6)) # label(conj) # label(negated_conjecture). [clausify(58)].
% 64.44/64.71 191 -leq(index(pendack,host(c7)),host(c3)). [copy(190),rewrite([188(6)])].
% 64.44/64.71 192 setIn(c7,alive) # label(conj) # label(negated_conjecture). [clausify(58)].
% 64.44/64.71 193 index(status,host(c7)) = elec_2 # label(conj) # label(negated_conjecture). [clausify(58)].
% 64.44/64.71 194 elec_2 = index(status,host(c7)). [copy(193),flip(a)].
% 64.44/64.71 213 -setIn(A,alive) | -setIn(B,alive) | -elem(m_Down(C),queue(host(A))) | host(C) != host(B) | index(status,host(c7)) != index(status,host(B)) | leq(index(pendack,host(B)),host(A)). [back_rewrite(170),rewrite([194(15)]),flip(e)].
% 64.44/64.71 217 -setIn(A,alive) | -setIn(B,alive) | -setIn(host(B),index(down,host(A))) | index(status,host(c7)) != index(status,host(B)) | leq(index(pendack,host(B)),host(A)). [back_rewrite(164),rewrite([194(13)]),flip(d)].
% 64.44/64.71 245 elem(A,cons(A,B)). [resolve(117,b,108,a),rewrite([108(2)])].
% 64.44/64.71 284 -leq(nbr_proc,host(A)) | host(A) = nbr_proc. [resolve(150,a,64,a),flip(b)].
% 64.44/64.71 285 -leq(nbr_proc,s(zero)) | s(zero) = nbr_proc. [resolve(150,a,63,a),flip(b)].
% 64.44/64.71 286 -leq(host(A),s(zero)) | s(zero) = host(A). [resolve(150,a,62,a),flip(b)].
% 64.44/64.71 315 leq(host(c3),A) | setIn(A,index(down,host(c3))) | host(c4) = A | leq(A,s(zero)). [resolve(184,b,149,b)].
% 64.44/64.71 317 leq(host(c3),host(A)) | setIn(host(A),index(down,host(c3))) | host(c4) = host(A). [resolve(184,b,62,a)].
% 64.44/64.71 322 host(c3) = nbr_proc. [resolve(187,a,150,b),flip(b),unit_del(a,64)].
% 64.44/64.71 323 leq(nbr_proc,host(A)) | setIn(host(A),index(down,nbr_proc)) | host(c4) = host(A). [back_rewrite(317),rewrite([322(2),322(7)])].
% 64.44/64.71 325 leq(nbr_proc,A) | setIn(A,index(down,nbr_proc)) | host(c4) = A | leq(A,s(zero)). [back_rewrite(315),rewrite([322(2),322(5)])].
% 64.44/64.71 341 -leq(index(pendack,host(c7)),nbr_proc). [back_rewrite(191),rewrite([322(6)])].
% 64.44/64.71 342 host(c7) != nbr_proc. [back_rewrite(189),rewrite([322(4)])].
% 64.44/64.71 347 cons(m_Down(c4),c1) = queue(nbr_proc). [back_rewrite(179),rewrite([322(6)])].
% 64.44/64.71 403 -setIn(A,alive) | -elem(m_Down(B),queue(nbr_proc)) | host(B) != host(A) | index(status,host(c7)) != index(status,host(A)) | leq(index(pendack,host(A)),nbr_proc). [para(322(a,1),213(c,2,1)),rewrite([322(25)]),unit_del(a,180)].
% 64.44/64.71 404 -setIn(A,alive) | -setIn(host(A),index(down,nbr_proc)) | index(status,host(c7)) != index(status,host(A)) | leq(index(pendack,host(A)),nbr_proc). [para(322(a,1),217(c,2,2)),rewrite([322(23)]),unit_del(a,180)].
% 64.44/64.71 740 elem(m_Down(c4),queue(nbr_proc)). [para(347(a,1),245(a,2))].
% 64.44/64.71 4333 -setIn(A,alive) | host(c4) != host(A) | index(status,host(c7)) != index(status,host(A)) | leq(index(pendack,host(A)),nbr_proc). [resolve(403,b,740,a)].
% 64.44/64.71 4360 -setIn(A,alive) | index(status,host(c7)) != index(status,host(A)) | leq(index(pendack,host(A)),nbr_proc) | leq(nbr_proc,host(A)) | host(c4) = host(A) | leq(host(A),s(zero)). [resolve(404,b,325,b)].
% 64.44/64.71 4361 -setIn(A,alive) | index(status,host(c7)) != index(status,host(A)) | leq(index(pendack,host(A)),nbr_proc) | leq(nbr_proc,host(A)) | host(c4) = host(A). [resolve(404,b,323,b)].
% 64.44/64.71 31289 host(c7) != host(c4). [resolve(4333,a,192,a),flip(a),xx(b),unit_del(b,341)].
% 64.44/64.71 31433 leq(nbr_proc,host(c7)) | leq(host(c7),s(zero)). [resolve(4360,a,192,a),flip(d),xx(a),unit_del(a,341),unit_del(c,31289)].
% 64.44/64.71 31469 leq(nbr_proc,host(c7)) | s(zero) = host(c7). [resolve(31433,b,286,a)].
% 64.44/64.71 31494 s(zero) = host(c7). [resolve(31469,a,284,a),unit_del(b,342)].
% 64.44/64.71 32022 -leq(nbr_proc,host(c7)). [back_rewrite(285),rewrite([31494(3),31494(6)]),unit_del(b,342)].
% 64.44/64.71 32139 $F. [resolve(4361,a,192,a),flip(d),xx(a),unit_del(a,341),unit_del(b,32022),unit_del(c,31289)].
% 64.44/64.71
% 64.44/64.71 % SZS output end Refutation
% 64.44/64.71 ============================== end of proof ==========================
% 64.44/64.71
% 64.44/64.71 ============================== STATISTICS ============================
% 64.44/64.71
% 64.44/64.71 Given=15041. Generated=4298760. Kept=32070. proofs=1.
% 64.44/64.71 Usable=11992. Sos=8594. Demods=72. Limbo=0, Disabled=11615. Hints=0.
% 64.44/64.71 Megabytes=55.01.
% 64.44/64.71 User_CPU=61.53, System_CPU=2.15, Wall_clock=64.
% 64.44/64.71
% 64.44/64.71 ============================== end of statistics =====================
% 64.44/64.71
% 64.44/64.71 ============================== end of search =========================
% 64.44/64.71
% 64.44/64.71 THEOREM PROVED
% 64.44/64.71 % SZS status Theorem
% 64.44/64.71
% 64.44/64.71 Exiting with 1 proof.
% 64.44/64.71
% 64.44/64.71 Process 17369 exit (max_proofs) Wed Jun 15 16:21:14 2022
% 64.44/64.71 Prover9 interrupted
%------------------------------------------------------------------------------