TSTP Solution File: SWV455+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV455+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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:07 EDT 2022
% Result : Theorem 1.00s 1.29s
% Output : Refutation 1.00s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV455+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 19:52:39 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.45/1.06 ============================== Prover9 ===============================
% 0.45/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.06 Process 6986 was started by sandbox on n004.cluster.edu,
% 0.45/1.06 Tue Jun 14 19:52:39 2022
% 0.45/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_6832_n004.cluster.edu".
% 0.45/1.06 ============================== end of head ===========================
% 0.45/1.06
% 0.45/1.06 ============================== INPUT =================================
% 0.45/1.06
% 0.45/1.06 % Reading from file /tmp/Prover9_6832_n004.cluster.edu
% 0.45/1.06
% 0.45/1.06 set(prolog_style_variables).
% 0.45/1.06 set(auto2).
% 0.45/1.06 % set(auto2) -> set(auto).
% 0.45/1.06 % set(auto) -> set(auto_inference).
% 0.45/1.06 % set(auto) -> set(auto_setup).
% 0.45/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.06 % set(auto) -> set(auto_limits).
% 0.45/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.06 % set(auto) -> set(auto_denials).
% 0.45/1.06 % set(auto) -> set(auto_process).
% 0.45/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.06 % set(auto2) -> assign(stats, some).
% 0.45/1.06 % set(auto2) -> clear(echo_input).
% 0.45/1.06 % set(auto2) -> set(quiet).
% 0.45/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.06 % set(auto2) -> clear(print_given).
% 0.45/1.06 assign(lrs_ticks,-1).
% 0.45/1.06 assign(sos_limit,10000).
% 0.45/1.06 assign(order,kbo).
% 0.45/1.06 set(lex_order_vars).
% 0.45/1.06 clear(print_given).
% 0.45/1.06
% 0.45/1.06 % formulas(sos). % not echoed (67 formulas)
% 0.45/1.06
% 0.45/1.06 ============================== end of input ==========================
% 0.45/1.06
% 0.45/1.06 % From the command line: assign(max_seconds, 300).
% 0.45/1.06
% 0.45/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.06
% 0.45/1.06 % Formulas that are not ordinary clauses:
% 0.45/1.06 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.45/1.06 2 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 3 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 4 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 5 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 6 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 7 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 8 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 9 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 10 (all X all Y m_NotNorm(X) != m_Halt(Y)) # label(axiom_16) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 11 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 13 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 14 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 15 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 16 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 17 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 18 (all X all Y m_Ldr(X) != m_NotNorm(Y)) # label(axiom_24) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 19 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 20 (all X all Y (X != Y <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 21 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 22 (all X all Y (X != Y <-> m_NotNorm(X) != m_NotNorm(Y))) # label(axiom_28) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 23 (all X all Y (X != Y <-> m_Ldr(X) != m_Ldr(Y))) # label(axiom_29) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 24 (all X all Y (X != Y <-> m_Down(X) != m_Down(Y))) # label(axiom_30) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 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.45/1.06 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.45/1.06 27 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 28 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 29 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 30 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 31 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 32 (all Q (Q = q_nil | Q = cons(head(Q),tail(Q)))) # label(axiom_39) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 33 (all Q (Q = q_nil | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 34 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 35 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 36 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 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.45/1.06 38 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.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].
% 0.45/1.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].
% 0.45/1.06 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.45/1.06 42 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 43 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 44 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 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.45/1.06 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.45/1.06 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.45/1.06 48 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.06 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.00/1.29 50 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause). [assumption].
% 1.00/1.29 51 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause). [assumption].
% 1.00/1.29 52 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause). [assumption].
% 1.00/1.29 53 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause). [assumption].
% 1.00/1.29 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.00/1.29 55 (all X all Y (leq(X,Y) <-> leq(s(X),s(Y)))) # label(axiom_63) # label(axiom) # label(non_clause). [assumption].
% 1.00/1.29 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.00/1.29 57 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause). [assumption].
% 1.00/1.29 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(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) -> (all Z (host(X) != host(Z) -> (all W0 all X0 (host(X) = host(X0) -> (all Y0 (host(X0) != host(Z) & setIn(Z,alive) & setIn(X0,alive) & host(W0) = host(Z) & host(Y0) = host(X0) -> -(elem(m_Down(W0),V) & elem(m_Down(Y0),queue(host(Z)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.00/1.29
% 1.00/1.29 ============================== end of process non-clausal formulas ===
% 1.00/1.29
% 1.00/1.29 ============================== PROCESS INITIAL CLAUSES ===============
% 1.00/1.29
% 1.00/1.29 ============================== PREDICATE ELIMINATION =================
% 1.00/1.29
% 1.00/1.29 ============================== end predicate elimination =============
% 1.00/1.29
% 1.00/1.29 Auto_denials: (non-Horn, no changes).
% 1.00/1.29
% 1.00/1.29 Term ordering decisions:
% 1.00/1.29 Function symbol KB weights: alive=1. q_nil=1. zero=1. nbr_proc=1. pids=1. elec_1=1. status=1. down=1. elec_2=1. elid=1. ldr=1. nil=1. norm=1. setEmpty=1. wait=1. c1=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. cons=1. snoc=1. m_Ack=1. index=1. f2=1. f3=1. host=1. pidMsg=1. m_Down=1. s=1. m_Halt=1. queue=1. m_Ldr=1. m_NormQ=1. m_NotNorm=1. head=1. init=1. last=1. tail=1. f1=1.
% 1.00/1.29
% 1.00/1.29 ============================== end of process initial clauses ========
% 1.00/1.29
% 1.00/1.29 ============================== CLAUSES FOR SEARCH ====================
% 1.00/1.29
% 1.00/1.29 ============================== end of clauses for search =============
% 1.00/1.29
% 1.00/1.29 ============================== SEARCH ================================
% 1.00/1.29
% 1.00/1.29 % Starting search at 0.03 seconds.
% 1.00/1.29
% 1.00/1.29 ============================== PROOF =================================
% 1.00/1.29 % SZS status Theorem
% 1.00/1.29 % SZS output start Refutation
% 1.00/1.29
% 1.00/1.29 % Proof 1 at 0.23 (+ 0.01) seconds.
% 1.00/1.29 % Length of proof is 20.
% 1.00/1.29 % Level of proof is 5.
% 1.00/1.29 % Maximum clause weight is 33.000.
% 1.00/1.29 % Given clauses 394.
% 1.00/1.29
% 1.00/1.29 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].
% 1.00/1.29 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(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) -> (all Z (host(X) != host(Z) -> (all W0 all X0 (host(X) = host(X0) -> (all Y0 (host(X0) != host(Z) & setIn(Z,alive) & setIn(X0,alive) & host(W0) = host(Z) & host(Y0) = host(X0) -> -(elem(m_Down(W0),V) & elem(m_Down(Y0),queue(host(Z)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.00/1.29 119 elem(A,cons(B,C)) | -elem(A,C) # label(axiom_46) # label(axiom). [clausify(39)].
% 1.00/1.29 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)].
% 1.00/1.29 167 cons(m_Down(c4),c1) = queue(host(c3)) # label(conj) # label(negated_conjecture). [clausify(58)].
% 1.00/1.29 168 setIn(c3,alive) # label(conj) # label(negated_conjecture). [clausify(58)].
% 1.00/1.29 176 host(c6) != host(c3) # label(conj) # label(negated_conjecture). [clausify(58)].
% 1.00/1.29 177 host(c8) = host(c3) # label(conj) # label(negated_conjecture). [clausify(58)].
% 1.00/1.29 179 setIn(c6,alive) # label(conj) # label(negated_conjecture). [clausify(58)].
% 1.00/1.29 181 host(c7) = host(c6) # label(conj) # label(negated_conjecture). [clausify(58)].
% 1.00/1.29 182 host(c9) = host(c8) # label(conj) # label(negated_conjecture). [clausify(58)].
% 1.00/1.29 183 host(c9) = host(c3). [copy(182),rewrite([177(4)])].
% 1.00/1.29 184 elem(m_Down(c7),c1) # label(conj) # label(negated_conjecture). [clausify(58)].
% 1.00/1.29 185 elem(m_Down(c9),queue(host(c6))) # label(conj) # label(negated_conjecture). [clausify(58)].
% 1.00/1.29 277 host(c3) = host(A) | -setIn(A,alive) | host(B) != host(A) | host(c3) != host(C) | -elem(m_Down(C),queue(host(A))) | -elem(m_Down(B),queue(host(c3))). [resolve(168,a,166,c)].
% 1.00/1.29 306 elem(m_Down(c7),cons(A,c1)). [resolve(184,a,119,b)].
% 1.00/1.29 489 elem(m_Down(c7),queue(host(c3))). [para(167(a,1),306(a,2))].
% 1.00/1.29 1821 host(c6) != host(A) | host(c3) != host(B) | -elem(m_Down(B),queue(host(c6))) | -elem(m_Down(A),queue(host(c3))). [resolve(277,b,179,a),flip(a),flip(b),unit_del(a,176)].
% 1.00/1.29 1822 host(c6) != host(A) | -elem(m_Down(A),queue(host(c3))). [resolve(1821,c,185,a),rewrite([183(8)]),xx(b)].
% 1.00/1.29 1824 $F. [resolve(1822,b,489,a),rewrite([181(4)]),xx(a)].
% 1.00/1.29
% 1.00/1.29 % SZS output end Refutation
% 1.00/1.29 ============================== end of proof ==========================
% 1.00/1.29
% 1.00/1.29 ============================== STATISTICS ============================
% 1.00/1.29
% 1.00/1.29 Given=394. Generated=6244. Kept=1756. proofs=1.
% 1.00/1.29 Usable=391. Sos=1351. Demods=28. Limbo=0, Disabled=136. Hints=0.
% 1.00/1.29 Megabytes=3.56.
% 1.00/1.29 User_CPU=0.23, System_CPU=0.01, Wall_clock=0.
% 1.00/1.29
% 1.00/1.29 ============================== end of statistics =====================
% 1.00/1.29
% 1.00/1.29 ============================== end of search =========================
% 1.00/1.29
% 1.00/1.29 THEOREM PROVED
% 1.00/1.29 % SZS status Theorem
% 1.00/1.29
% 1.00/1.29 Exiting with 1 proof.
% 1.00/1.29
% 1.00/1.29 Process 6986 exit (max_proofs) Tue Jun 14 19:52:39 2022
% 1.00/1.29 Prover9 interrupted
%------------------------------------------------------------------------------