TSTP Solution File: SWV451+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV451+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:06 EDT 2022
% Result : Theorem 50.25s 50.53s
% Output : Refutation 50.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV451+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 15 18:28:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.01 ============================== Prover9 ===============================
% 0.71/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.01 Process 20059 was started by sandbox on n014.cluster.edu,
% 0.71/1.01 Wed Jun 15 18:28:21 2022
% 0.71/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_19906_n014.cluster.edu".
% 0.71/1.01 ============================== end of head ===========================
% 0.71/1.01
% 0.71/1.01 ============================== INPUT =================================
% 0.71/1.01
% 0.71/1.01 % Reading from file /tmp/Prover9_19906_n014.cluster.edu
% 0.71/1.01
% 0.71/1.01 set(prolog_style_variables).
% 0.71/1.01 set(auto2).
% 0.71/1.01 % set(auto2) -> set(auto).
% 0.71/1.01 % set(auto) -> set(auto_inference).
% 0.71/1.01 % set(auto) -> set(auto_setup).
% 0.71/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.71/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.01 % set(auto) -> set(auto_limits).
% 0.71/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.01 % set(auto) -> set(auto_denials).
% 0.71/1.01 % set(auto) -> set(auto_process).
% 0.71/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.71/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.71/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.71/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.71/1.01 % set(auto2) -> assign(stats, some).
% 0.71/1.01 % set(auto2) -> clear(echo_input).
% 0.71/1.01 % set(auto2) -> set(quiet).
% 0.71/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.01 % set(auto2) -> clear(print_given).
% 0.71/1.01 assign(lrs_ticks,-1).
% 0.71/1.01 assign(sos_limit,10000).
% 0.71/1.01 assign(order,kbo).
% 0.71/1.01 set(lex_order_vars).
% 0.71/1.01 clear(print_given).
% 0.71/1.01
% 0.71/1.01 % formulas(sos). % not echoed (67 formulas)
% 0.71/1.01
% 0.71/1.01 ============================== end of input ==========================
% 0.71/1.01
% 0.71/1.01 % From the command line: assign(max_seconds, 300).
% 0.71/1.01
% 0.71/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.01
% 0.71/1.01 % Formulas that are not ordinary clauses:
% 0.71/1.01 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.71/1.01 2 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 3 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 4 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 5 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 6 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 7 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 8 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 9 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 10 (all X all Y m_NotNorm(X) != m_Halt(Y)) # label(axiom_16) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 11 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 13 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 14 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 15 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 16 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 17 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 18 (all X all Y m_Ldr(X) != m_NotNorm(Y)) # label(axiom_24) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 19 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 20 (all X all Y (X != Y <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 21 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 22 (all X all Y (X != Y <-> m_NotNorm(X) != m_NotNorm(Y))) # label(axiom_28) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 23 (all X all Y (X != Y <-> m_Ldr(X) != m_Ldr(Y))) # label(axiom_29) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 24 (all X all Y (X != Y <-> m_Down(X) != m_Down(Y))) # label(axiom_30) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 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.71/1.01 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.71/1.01 27 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 28 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 29 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 30 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 31 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 32 (all Q (Q = q_nil | Q = cons(head(Q),tail(Q)))) # label(axiom_39) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 33 (all Q (Q = q_nil | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 34 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 35 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 36 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 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.71/1.01 38 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 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.71/1.01 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.71/1.01 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.71/1.01 42 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 43 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 44 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 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.71/1.01 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.71/1.01 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.71/1.01 48 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause). [assumption].
% 0.71/1.01 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].
% 1.54/1.83 50 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause). [assumption].
% 1.54/1.83 51 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause). [assumption].
% 1.54/1.83 52 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause). [assumption].
% 1.54/1.83 53 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause). [assumption].
% 1.54/1.83 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].
% 1.54/1.83 55 (all X all Y (leq(X,Y) <-> leq(s(X),s(Y)))) # label(axiom_63) # label(axiom) # label(non_clause). [assumption].
% 1.54/1.83 56 (all X all Y (leq(X,s(Y)) <-> X = s(Y) | leq(X,Y))) # label(axiom_64) # label(axiom) # label(non_clause). [assumption].
% 1.54/1.83 57 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause). [assumption].
% 1.54/1.83 58 -(all V all W all X all Y ((all Z all Pid0 (setIn(Pid0,alive) -> -elem(m_Down(Pid0),queue(host(Z))))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> -setIn(Pid0,alive))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (-setIn(Z,alive) & leq(Pid0,Z) & host(Pid0) = host(Z) -> -setIn(Pid0,alive))) & (all Z all Pid0 (Pid0 != Z & host(Pid0) = host(Z) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (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)))))) & queue(host(Y)) = cons(m_NotNorm(X),V) -> (setIn(Y,alive) -> (index(ldr,host(Y)) = host(Y) & index(status,host(Y)) = norm & index(elid,host(Y)) = X -> ((all Z (host(Y) = host(Z) -> leq(Z,W))) & -setIn(W,pids) & host(Y) = host(W) -> (host(W) = s(zero) -> (-leq(nbr_proc,host(W)) -> (all Z (s(host(W)) = host(Z) -> (host(Y) != host(Z) -> (all X0 all Y0 (s(host(W)) != host(Y0) -> (host(Y) = host(Y0) -> (all Z0 ((Z != Y & setIn(Z,alive) | Z = W) & (Y0 != Y & setIn(Y0,alive) | Y0 = W) & host(Y0) != host(Z) & host(X0) = host(Z) & host(Z0) = host(Y0) -> -(elem(m_Down(X0),V) & elem(m_Down(Z0),snoc(queue(host(Z)),m_Halt(W))))))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.54/1.83
% 1.54/1.83 ============================== end of process non-clausal formulas ===
% 1.54/1.83
% 1.54/1.83 ============================== PROCESS INITIAL CLAUSES ===============
% 1.54/1.83
% 1.54/1.83 ============================== PREDICATE ELIMINATION =================
% 1.54/1.83
% 1.54/1.83 ============================== end predicate elimination =============
% 1.54/1.83
% 1.54/1.83 Auto_denials: (non-Horn, no changes).
% 1.54/1.83
% 1.54/1.83 Term ordering decisions:
% 1.54/1.83 Function symbol KB weights: alive=1. q_nil=1. zero=1. nbr_proc=1. pids=1. elid=1. ldr=1. norm=1. status=1. elec_1=1. elec_2=1. nil=1. setEmpty=1. wait=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. snoc=1. cons=1. m_Ack=1. index=1. f2=1. f3=1. host=1. pidMsg=1. s=1. m_Down=1. m_Halt=1. queue=1. m_Ldr=1. m_NotNorm=1. m_NormQ=1. head=1. init=1. last=1. tail=1. f1=1.
% 1.54/1.83
% 1.54/1.83 ============================== end of process initial clauses ========
% 1.54/1.83
% 1.54/1.83 ============================== CLAUSES FOR SEARCH ====================
% 1.54/1.83
% 1.54/1.83 ============================== end of clauses for search =============
% 1.54/1.83
% 1.54/1.83 ============================== SEARCH ================================
% 1.54/1.83
% 1.54/1.83 % Starting search at 0.03 seconds.
% 1.54/1.83
% 1.54/1.83 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 39 (0.00 of 0.29 sec).
% 1.54/1.83
% 1.54/1.83 Low Water (keep): wt=110.000, iters=3749
% 1.54/1.83
% 1.54/1.83 Low Water (keep): wt=109.000, iters=3745
% 1.54/1.83
% 1.54/1.83 Low Water (keep): wt=33.000, iters=3355
% 1.54/1.83
% 1.54/1.83 Low Water (keep): wt=29.000, iters=3436
% 1.54/1.83
% 1.54/1.83 Low Water (keep): wt=28.000, iters=3468
% 1.54/1.83
% 1.54/1.83 Low Water (keep): wt=26.000, iters=3408
% 1.54/1.83
% 1.54/1.83 Low Water (keep): wt=25.000, iters=3358
% 1.54/1.83
% 1.54/1.83 Low Water (keep): wt=24.000, iters=3351
% 1.54/1.83
% 1.54/1.83 Low Water (keep): wt=21.000, iters=3340
% 1.54/1.83
% 1.54/1.83 Low Water (keep): wt=20.000, iters=3337
% 1.54/1.83
% 1.54/1.83 Low Water (keep): wt=18.000, iters=3357
% 1.54/1.83
% 1.54/1.83 Low Water (keep): wt=17.000, iters=3333
% 50.25/50.53
% 50.25/50.53 Low Water (keep): wt=16.000, iters=3355
% 50.25/50.53
% 50.25/50.53 Low Water (keep): wt=15.000, iters=3436
% 50.25/50.53
% 50.25/50.53 Low Water (keep): wt=14.000, iters=3350
% 50.25/50.53
% 50.25/50.53 Low Water (keep): wt=13.000, iters=3394
% 50.25/50.53
% 50.25/50.53 ============================== PROOF =================================
% 50.25/50.53 % SZS status Theorem
% 50.25/50.53 % SZS output start Refutation
% 50.25/50.53
% 50.25/50.53 % Proof 1 at 47.51 (+ 2.02) seconds.
% 50.25/50.53 % Length of proof is 39.
% 50.25/50.53 % Level of proof is 9.
% 50.25/50.53 % Maximum clause weight is 33.000.
% 50.25/50.53 % Given clauses 12215.
% 50.25/50.53
% 50.25/50.53 11 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause). [assumption].
% 50.25/50.53 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].
% 50.25/50.53 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].
% 50.25/50.53 58 -(all V all W all X all Y ((all Z all Pid0 (setIn(Pid0,alive) -> -elem(m_Down(Pid0),queue(host(Z))))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> -setIn(Pid0,alive))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (-setIn(Z,alive) & leq(Pid0,Z) & host(Pid0) = host(Z) -> -setIn(Pid0,alive))) & (all Z all Pid0 (Pid0 != Z & host(Pid0) = host(Z) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (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)))))) & queue(host(Y)) = cons(m_NotNorm(X),V) -> (setIn(Y,alive) -> (index(ldr,host(Y)) = host(Y) & index(status,host(Y)) = norm & index(elid,host(Y)) = X -> ((all Z (host(Y) = host(Z) -> leq(Z,W))) & -setIn(W,pids) & host(Y) = host(W) -> (host(W) = s(zero) -> (-leq(nbr_proc,host(W)) -> (all Z (s(host(W)) = host(Z) -> (host(Y) != host(Z) -> (all X0 all Y0 (s(host(W)) != host(Y0) -> (host(Y) = host(Y0) -> (all Z0 ((Z != Y & setIn(Z,alive) | Z = W) & (Y0 != Y & setIn(Y0,alive) | Y0 = W) & host(Y0) != host(Z) & host(X0) = host(Z) & host(Z0) = host(Y0) -> -(elem(m_Down(X0),V) & elem(m_Down(Z0),snoc(queue(host(Z)),m_Halt(W))))))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause). [assumption].
% 50.25/50.53 81 m_Down(A) != m_Halt(B) # label(axiom_17) # label(axiom). [clausify(11)].
% 50.25/50.53 119 elem(A,cons(B,C)) | -elem(A,C) # label(axiom_46) # label(axiom). [clausify(39)].
% 50.25/50.53 120 -elem(A,snoc(B,C)) | C = A | elem(A,B) # label(axiom_47) # label(axiom). [clausify(40)].
% 50.25/50.53 166 host(A) = host(B) | -setIn(B,alive) | -setIn(A,alive) | host(C) != host(B) | host(A) != host(D) | -elem(m_Down(D),queue(host(B))) | -elem(m_Down(C),queue(host(A))) # label(conj) # label(negated_conjecture). [clausify(58)].
% 50.25/50.53 167 cons(m_NotNorm(c3),c1) = queue(host(c4)) # label(conj) # label(negated_conjecture). [clausify(58)].
% 50.25/50.53 168 setIn(c4,alive) # label(conj) # label(negated_conjecture). [clausify(58)].
% 50.25/50.53 176 host(c2) = host(c4) # label(conj) # label(negated_conjecture). [clausify(58)].
% 50.25/50.53 177 host(c4) = host(c2). [copy(176),flip(a)].
% 50.25/50.53 180 s(host(c2)) = host(c5) # label(conj) # label(negated_conjecture). [clausify(58)].
% 50.25/50.53 181 host(c5) != host(c4) # label(conj) # label(negated_conjecture). [clausify(58)].
% 50.25/50.53 182 host(c5) != host(c2). [copy(181),rewrite([177(4)])].
% 50.25/50.53 183 s(host(c2)) != host(c7) # label(conj) # label(negated_conjecture). [clausify(58)].
% 50.25/50.53 184 host(c7) != host(c5). [copy(183),rewrite([180(3)]),flip(a)].
% 50.25/50.53 185 host(c7) = host(c4) # label(conj) # label(negated_conjecture). [clausify(58)].
% 50.25/50.53 186 host(c7) = host(c2). [copy(185),rewrite([177(4)])].
% 50.25/50.53 189 setIn(c5,alive) | c2 = c5 # label(conj) # label(negated_conjecture). [clausify(58)].
% 50.25/50.53 190 setIn(c5,alive) | c5 = c2. [copy(189),flip(b)].
% 50.25/50.53 194 host(c6) = host(c5) # label(conj) # label(negated_conjecture). [clausify(58)].
% 50.25/50.53 195 host(c8) = host(c7) # label(conj) # label(negated_conjecture). [clausify(58)].
% 50.25/50.53 196 host(c8) = host(c2). [copy(195),rewrite([186(4)])].
% 50.25/50.53 197 elem(m_Down(c6),c1) # label(conj) # label(negated_conjecture). [clausify(58)].
% 50.25/50.53 198 elem(m_Down(c8),snoc(queue(host(c5)),m_Halt(c2))) # label(conj) # label(negated_conjecture). [clausify(58)].
% 50.25/50.53 206 cons(m_NotNorm(c3),c1) = queue(host(c2)). [back_rewrite(167),rewrite([177(6)])].
% 50.25/50.53 208 host(c5) = c_0. [new_symbol(182)].
% 50.25/50.53 209 host(c2) != c_0. [back_rewrite(184),rewrite([186(2),208(4)])].
% 50.25/50.53 210 elem(m_Down(c8),snoc(queue(c_0),m_Halt(c2))). [back_rewrite(198),rewrite([208(4)])].
% 50.25/50.53 211 host(c6) = c_0. [back_rewrite(194),rewrite([208(4)])].
% 50.25/50.53 288 host(c2) = host(A) | -setIn(A,alive) | host(B) != host(A) | host(c2) != host(C) | -elem(m_Down(C),queue(host(A))) | -elem(m_Down(B),queue(host(c2))). [resolve(168,a,166,c),rewrite([177(2),177(11),177(20)])].
% 50.25/50.53 319 elem(m_Down(c6),cons(A,c1)). [resolve(197,a,119,b)].
% 50.25/50.53 346 elem(m_Down(c8),queue(c_0)). [resolve(210,a,120,a),unit_del(a(flip),81)].
% 50.25/50.53 696 elem(m_Down(c6),queue(host(c2))). [para(206(a,1),319(a,2))].
% 50.25/50.53 1953 host(A) != c_0 | host(c2) != host(B) | -elem(m_Down(B),queue(c_0)) | -elem(m_Down(A),queue(host(c2))) | c5 = c2. [resolve(288,b,190,a),rewrite([208(4),208(7),208(14)]),unit_del(a,209)].
% 50.25/50.53 12299 host(A) != c_0 | -elem(m_Down(A),queue(host(c2))) | c5 = c2. [resolve(1953,c,346,a),rewrite([196(7)]),xx(b)].
% 50.25/50.53 18481 c5 = c2. [resolve(12299,b,696,a),rewrite([211(2)]),xx(a)].
% 50.25/50.53 18553 $F. [back_rewrite(208),rewrite([18481(1)]),unit_del(a,209)].
% 50.25/50.53
% 50.25/50.53 % SZS output end Refutation
% 50.25/50.53 ============================== end of proof ==========================
% 50.25/50.53
% 50.25/50.53 ============================== STATISTICS ============================
% 50.25/50.53
% 50.25/50.53 Given=12215. Generated=3729795. Kept=18477. proofs=1.
% 50.25/50.53 Usable=11750. Sos=5205. Demods=45. Limbo=72, Disabled=1577. Hints=0.
% 50.25/50.53 Megabytes=32.39.
% 50.25/50.53 User_CPU=47.51, System_CPU=2.02, Wall_clock=50.
% 50.25/50.53
% 50.25/50.53 ============================== end of statistics =====================
% 50.25/50.53
% 50.25/50.53 ============================== end of search =========================
% 50.25/50.53
% 50.25/50.53 THEOREM PROVED
% 50.25/50.53 % SZS status Theorem
% 50.25/50.53
% 50.25/50.53 Exiting with 1 proof.
% 50.25/50.53
% 50.25/50.53 Process 20059 exit (max_proofs) Wed Jun 15 18:29:11 2022
% 50.25/50.53 Prover9 interrupted
%------------------------------------------------------------------------------