TSTP Solution File: SWV473+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV473+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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 53.13s 53.43s
% Output : Refutation 53.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV473+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n018.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 : Tue Jun 14 22:51:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.05 ============================== Prover9 ===============================
% 0.44/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.05 Process 23858 was started by sandbox on n018.cluster.edu,
% 0.44/1.05 Tue Jun 14 22:51:44 2022
% 0.44/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23705_n018.cluster.edu".
% 0.44/1.05 ============================== end of head ===========================
% 0.44/1.05
% 0.44/1.05 ============================== INPUT =================================
% 0.44/1.05
% 0.44/1.05 % Reading from file /tmp/Prover9_23705_n018.cluster.edu
% 0.44/1.05
% 0.44/1.05 set(prolog_style_variables).
% 0.44/1.05 set(auto2).
% 0.44/1.05 % set(auto2) -> set(auto).
% 0.44/1.05 % set(auto) -> set(auto_inference).
% 0.44/1.05 % set(auto) -> set(auto_setup).
% 0.44/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.05 % set(auto) -> set(auto_limits).
% 0.44/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.05 % set(auto) -> set(auto_denials).
% 0.44/1.05 % set(auto) -> set(auto_process).
% 0.44/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.05 % set(auto2) -> assign(stats, some).
% 0.44/1.05 % set(auto2) -> clear(echo_input).
% 0.44/1.05 % set(auto2) -> set(quiet).
% 0.44/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.05 % set(auto2) -> clear(print_given).
% 0.44/1.05 assign(lrs_ticks,-1).
% 0.44/1.05 assign(sos_limit,10000).
% 0.44/1.05 assign(order,kbo).
% 0.44/1.05 set(lex_order_vars).
% 0.44/1.05 clear(print_given).
% 0.44/1.05
% 0.44/1.05 % formulas(sos). % not echoed (67 formulas)
% 0.44/1.05
% 0.44/1.05 ============================== end of input ==========================
% 0.44/1.05
% 0.44/1.05 % From the command line: assign(max_seconds, 300).
% 0.44/1.05
% 0.44/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.05
% 0.44/1.05 % Formulas that are not ordinary clauses:
% 0.44/1.05 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.44/1.05 2 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 3 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 4 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 5 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 6 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 7 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 8 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 9 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 10 (all X all Y m_NotNorm(X) != m_Halt(Y)) # label(axiom_16) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 11 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 13 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 14 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 15 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 16 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 17 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 18 (all X all Y m_Ldr(X) != m_NotNorm(Y)) # label(axiom_24) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 19 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause). [assumption].
% 0.44/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.44/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.44/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.44/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.44/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.44/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.44/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.44/1.05 27 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 28 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 29 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 30 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 31 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 32 (all Q (Q = q_nil | Q = cons(head(Q),tail(Q)))) # label(axiom_39) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 33 (all Q (Q = q_nil | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 34 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 35 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 36 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause). [assumption].
% 0.44/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.44/1.05 38 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause). [assumption].
% 0.44/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.44/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.44/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.44/1.05 42 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.05 43 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause). [assumption].
% 0.44/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.44/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.44/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.44/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.44/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.44/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.81/1.08 50 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.08 51 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.08 52 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause). [assumption].
% 0.81/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.81/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.81/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.81/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.81/1.08 57 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause). [assumption].
% 0.81/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 (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))) -> (all Z (host(X) != host(Z) -> (all W0 all X0 all 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),V) & host(Y0) = host(W0) & host(Y0) = nbr_proc & index(status,host(Y0)) = elec_1 -> -(setIn(Z,alive) & elem(m_Down(W0),queue(host(Z))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.81/1.08
% 0.81/1.08 ============================== end of process non-clausal formulas ===
% 0.81/1.08
% 0.81/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.81/1.08
% 0.81/1.08 ============================== PREDICATE ELIMINATION =================
% 0.81/1.08
% 0.81/1.08 ============================== end predicate elimination =============
% 0.81/1.08
% 0.81/1.08 Auto_denials: (non-Horn, no changes).
% 0.81/1.08
% 0.81/1.08 Term ordering decisions:
% 0.81/1.08 Function symbol KB weights: alive=1. q_nil=1. status=1. nbr_proc=1. zero=1. elec_1=1. elid=1. down=1. pids=1. elec_2=1. ldr=1. norm=1. wait=1. nil=1. pendack=1. setEmpty=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. cons=1. snoc=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.81/1.08
% 0.81/1.08 ============================== end of process initial clauses ========
% 0.81/1.08
% 0.81/1.08 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.08
% 0.81/1.08 ============================== end of clauses for search =============
% 53.13/53.43
% 53.13/53.43 ============================== SEARCH ================================
% 53.13/53.43
% 53.13/53.43 % Starting search at 0.03 seconds.
% 53.13/53.43
% 53.13/53.43 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 98 (0.00 of 0.28 sec).
% 53.13/53.43
% 53.13/53.43 Low Water (keep): wt=27.000, iters=3380
% 53.13/53.43
% 53.13/53.43 Low Water (keep): wt=22.000, iters=3368
% 53.13/53.43
% 53.13/53.43 Low Water (keep): wt=19.000, iters=3359
% 53.13/53.43
% 53.13/53.43 Low Water (keep): wt=18.000, iters=3784
% 53.13/53.43
% 53.13/53.43 Low Water (keep): wt=17.000, iters=3538
% 53.13/53.43
% 53.13/53.43 Low Water (keep): wt=16.000, iters=4180
% 53.13/53.43
% 53.13/53.43 Low Water (keep): wt=15.000, iters=3549
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5125, wt=148.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5131, wt=129.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=4883, wt=126.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5201, wt=125.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5204, wt=108.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5198, wt=107.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5621, wt=99.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5124, wt=97.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5255, wt=90.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5612, wt=89.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=4687, wt=88.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=4881, wt=87.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5623, wt=86.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5625, wt=84.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=4885, wt=80.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=3738, wt=77.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5618, wt=76.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5197, wt=73.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5202, wt=69.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=3713, wt=68.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5150, wt=67.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5121, wt=65.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5607, wt=63.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=5158, wt=62.000
% 53.13/53.43
% 53.13/53.43 Low Water (displace): id=13538, wt=14.000
% 53.13/53.43
% 53.13/53.43 ============================== PROOF =================================
% 53.13/53.43 % SZS status Theorem
% 53.13/53.43 % SZS output start Refutation
% 53.13/53.43
% 53.13/53.43 % Proof 1 at 51.07 (+ 1.31) seconds.
% 53.13/53.43 % Length of proof is 38.
% 53.13/53.43 % Level of proof is 8.
% 53.13/53.43 % Maximum clause weight is 44.000.
% 53.13/53.43 % Given clauses 12429.
% 53.13/53.43
% 53.13/53.43 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].
% 53.13/53.43 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))) -> (all Z (host(X) != host(Z) -> (all W0 all X0 all 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),V) & host(Y0) = host(W0) & host(Y0) = nbr_proc & index(status,host(Y0)) = elec_1 -> -(setIn(Z,alive) & elem(m_Down(W0),queue(host(Z))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause). [assumption].
% 53.13/53.43 119 elem(A,cons(B,C)) | -elem(A,C) # label(axiom_46) # label(axiom). [clausify(39)].
% 53.13/53.43 170 -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)].
% 53.13/53.43 171 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)].
% 53.13/53.43 172 -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)].
% 53.13/53.43 173 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)].
% 53.13/53.43 174 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(173),flip(a)].
% 53.13/53.43 175 cons(m_Ack(c2,c4),c1) = queue(host(c3)) # label(conj) # label(negated_conjecture). [clausify(58)].
% 53.13/53.43 179 host(c8) = host(c3) # label(conj) # label(negated_conjecture). [clausify(58)].
% 53.13/53.43 180 leq(host(c8),A) | -leq(s(zero),A) | setIn(A,index(down,host(c8))) | host(c7) = A # label(conj) # label(negated_conjecture). [clausify(58)].
% 53.13/53.43 181 leq(host(c3),A) | -leq(s(zero),A) | setIn(A,index(down,host(c3))) | host(c7) = A. [copy(180),rewrite([179(2),179(9)])].
% 53.13/53.43 182 elem(m_Down(c7),c1) # label(conj) # label(negated_conjecture). [clausify(58)].
% 53.13/53.43 183 host(c8) = host(c6) # label(conj) # label(negated_conjecture). [clausify(58)].
% 53.13/53.43 184 host(c6) = host(c3). [copy(183),rewrite([179(2)]),flip(a)].
% 53.13/53.43 185 host(c8) = nbr_proc # label(conj) # label(negated_conjecture). [clausify(58)].
% 53.13/53.43 186 nbr_proc = host(c3). [copy(185),rewrite([179(2)]),flip(a)].
% 53.13/53.43 187 index(status,host(c8)) = elec_1 # label(conj) # label(negated_conjecture). [clausify(58)].
% 53.13/53.43 188 elec_1 = index(status,host(c3)). [copy(187),rewrite([179(3)]),flip(a)].
% 53.13/53.43 189 setIn(c5,alive) # label(conj) # label(negated_conjecture). [clausify(58)].
% 53.13/53.43 190 elem(m_Down(c6),queue(host(c5))) # label(conj) # label(negated_conjecture). [clausify(58)].
% 53.13/53.43 191 f4(A,B,C,D) != host(C) | -elem(m_Down(C),queue(host(D))) | host(c3) != host(D) | host(B) != host(D) | index(status,host(c3)) != index(status,host(D)) | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))). [back_rewrite(174),rewrite([186(9),188(18)]),flip(c),flip(e)].
% 53.13/53.43 192 -setIn(f4(A,B,C,D),index(down,host(D))) | -elem(m_Down(C),queue(host(D))) | host(c3) != host(D) | host(B) != host(D) | index(status,host(c3)) != index(status,host(D)) | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))). [back_rewrite(172),rewrite([186(11),188(20)]),flip(c),flip(e)].
% 53.13/53.43 193 leq(s(zero),f4(A,B,C,D)) | -elem(m_Down(C),queue(host(D))) | host(c3) != host(D) | host(B) != host(D) | index(status,host(c3)) != index(status,host(D)) | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))). [back_rewrite(171),rewrite([186(10),188(19)]),flip(c),flip(e)].
% 53.13/53.43 194 -leq(host(A),f4(B,C,D,A)) | -elem(m_Down(D),queue(host(A))) | host(c3) != host(A) | host(C) != host(A) | index(status,host(c3)) != index(status,host(A)) | -setIn(B,alive) | -elem(m_Down(C),queue(host(B))). [back_rewrite(170),rewrite([186(9),188(18)]),flip(c),flip(e)].
% 53.13/53.43 302 elem(m_Down(c7),cons(A,c1)). [resolve(182,a,119,b)].
% 53.13/53.43 318 f4(c5,A,B,C) != host(B) | -elem(m_Down(B),queue(host(C))) | host(c3) != host(C) | host(A) != host(C) | index(status,host(c3)) != index(status,host(C)) | -elem(m_Down(A),queue(host(c5))). [resolve(191,f,189,a)].
% 53.13/53.43 325 leq(s(zero),f4(c5,A,B,C)) | -elem(m_Down(B),queue(host(C))) | host(c3) != host(C) | host(A) != host(C) | index(status,host(c3)) != index(status,host(C)) | -elem(m_Down(A),queue(host(c5))). [resolve(193,f,189,a)].
% 53.13/53.43 330 -leq(host(A),f4(c5,B,C,A)) | -elem(m_Down(C),queue(host(A))) | host(c3) != host(A) | host(B) != host(A) | index(status,host(c3)) != index(status,host(A)) | -elem(m_Down(B),queue(host(c5))). [resolve(194,f,189,a)].
% 53.13/53.43 473 elem(m_Down(c7),queue(host(c3))). [para(175(a,1),302(a,2))].
% 53.13/53.43 761 f4(c5,A,c7,c3) != host(c7) | host(c3) != host(A) | -elem(m_Down(A),queue(host(c5))). [resolve(318,b,473,a),flip(c),xx(b),xx(d)].
% 53.13/53.43 773 f4(c5,c6,c7,c3) != host(c7). [resolve(761,c,190,a),rewrite([184(12)]),xx(b)].
% 53.13/53.43 914 -leq(host(c3),f4(c5,A,c7,c3)) | host(c3) != host(A) | -elem(m_Down(A),queue(host(c5))). [resolve(330,b,473,a),flip(c),xx(b),xx(d)].
% 53.13/53.43 926 -leq(host(c3),f4(c5,c6,c7,c3)). [resolve(914,c,190,a),rewrite([184(12)]),xx(b)].
% 53.13/53.43 3006 leq(s(zero),f4(c5,A,c7,c3)) | host(c3) != host(A) | -elem(m_Down(A),queue(host(c5))). [resolve(325,b,473,a),flip(c),xx(b),xx(d)].
% 53.13/53.43 51239 leq(s(zero),f4(c5,c6,c7,c3)). [resolve(3006,c,190,a),rewrite([184(12)]),xx(b)].
% 53.13/53.43 51301 setIn(f4(c5,c6,c7,c3),index(down,host(c3))). [resolve(51239,a,181,b),flip(c),unit_del(a,926),unit_del(c,773)].
% 53.13/53.43 51449 $F. [resolve(51301,a,192,a),rewrite([184(13)]),xx(b),xx(c),xx(d),unit_del(a,473),unit_del(b,189),unit_del(c,190)].
% 53.13/53.43
% 53.13/53.43 % SZS output end Refutation
% 53.13/53.43 ============================== end of proof ==========================
% 53.13/53.43
% 53.13/53.43 ============================== STATISTICS ============================
% 53.13/53.43
% 53.13/53.43 Given=12429. Generated=2452433. Kept=51378. proofs=1.
% 53.13/53.43 Usable=11732. Sos=9995. Demods=59. Limbo=0, Disabled=29773. Hints=0.
% 53.13/53.43 Megabytes=78.11.
% 53.13/53.43 User_CPU=51.07, System_CPU=1.31, Wall_clock=53.
% 53.13/53.43
% 53.13/53.43 ============================== end of statistics =====================
% 53.13/53.43
% 53.13/53.43 ============================== end of search =========================
% 53.13/53.43
% 53.13/53.43 THEOREM PROVED
% 53.13/53.43 % SZS status Theorem
% 53.13/53.43
% 53.13/53.43 Exiting with 1 proof.
% 53.13/53.43
% 53.13/53.43 Process 23858 exit (max_proofs) Tue Jun 14 22:52:37 2022
% 53.13/53.43 Prover9 interrupted
%------------------------------------------------------------------------------