0.00/0.11	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.11	% Command  : tptp2X_and_run_prover9 %d %s
0.10/0.31	% Computer : n005.cluster.edu
0.10/0.31	% Model    : x86_64 x86_64
0.10/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.31	% Memory   : 8042.1875MB
0.10/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.31	% CPULimit : 960
0.10/0.31	% WCLimit  : 120
0.10/0.31	% DateTime : Tue Aug  9 06:06:34 EDT 2022
0.10/0.32	% CPUTime  : 
0.82/1.13	============================== Prover9 ===============================
0.82/1.13	Prover9 (32) version 2009-11A, November 2009.
0.82/1.13	Process 4944 was started by sandbox2 on n005.cluster.edu,
0.82/1.13	Tue Aug  9 06:06:35 2022
0.82/1.13	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_4789_n005.cluster.edu".
0.82/1.13	============================== end of head ===========================
0.82/1.13	
0.82/1.13	============================== INPUT =================================
0.82/1.13	
0.82/1.13	% Reading from file /tmp/Prover9_4789_n005.cluster.edu
0.82/1.13	
0.82/1.13	set(prolog_style_variables).
0.82/1.13	set(auto2).
0.82/1.13	    % set(auto2) -> set(auto).
0.82/1.13	    % set(auto) -> set(auto_inference).
0.82/1.13	    % set(auto) -> set(auto_setup).
0.82/1.13	    % set(auto_setup) -> set(predicate_elim).
0.82/1.13	    % set(auto_setup) -> assign(eq_defs, unfold).
0.82/1.13	    % set(auto) -> set(auto_limits).
0.82/1.13	    % set(auto_limits) -> assign(max_weight, "100.000").
0.82/1.13	    % set(auto_limits) -> assign(sos_limit, 20000).
0.82/1.13	    % set(auto) -> set(auto_denials).
0.82/1.13	    % set(auto) -> set(auto_process).
0.82/1.13	    % set(auto2) -> assign(new_constants, 1).
0.82/1.13	    % set(auto2) -> assign(fold_denial_max, 3).
0.82/1.13	    % set(auto2) -> assign(max_weight, "200.000").
0.82/1.13	    % set(auto2) -> assign(max_hours, 1).
0.82/1.13	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.82/1.13	    % set(auto2) -> assign(max_seconds, 0).
0.82/1.13	    % set(auto2) -> assign(max_minutes, 5).
0.82/1.13	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.82/1.13	    % set(auto2) -> set(sort_initial_sos).
0.82/1.13	    % set(auto2) -> assign(sos_limit, -1).
0.82/1.13	    % set(auto2) -> assign(lrs_ticks, 3000).
0.82/1.13	    % set(auto2) -> assign(max_megs, 400).
0.82/1.13	    % set(auto2) -> assign(stats, some).
0.82/1.13	    % set(auto2) -> clear(echo_input).
0.82/1.13	    % set(auto2) -> set(quiet).
0.82/1.13	    % set(auto2) -> clear(print_initial_clauses).
0.82/1.13	    % set(auto2) -> clear(print_given).
0.82/1.13	assign(lrs_ticks,-1).
0.82/1.13	assign(sos_limit,10000).
0.82/1.13	assign(order,kbo).
0.82/1.13	set(lex_order_vars).
0.82/1.13	clear(print_given).
0.82/1.13	
0.82/1.13	% formulas(sos).  % not echoed (67 formulas)
0.82/1.13	
0.82/1.13	============================== end of input ==========================
0.82/1.13	
0.82/1.13	% From the command line: assign(max_seconds, 960).
0.82/1.13	
0.82/1.13	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.82/1.13	
0.82/1.13	% Formulas that are not ordinary clauses:
0.82/1.13	1 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	2 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	3 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	4 (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.82/1.13	5 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	6 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	7 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,cons(Y,Q)))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	8 (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.82/1.13	9 (all Pid all Pid2 (elem(m_Ack(Pid,Pid2),queue(host(Pid))) -> setIn(Pid2,pids) & setIn(Pid,pids))) # label(axiom) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	10 (all X all Y (leq(X,s(Y)) <-> s(Y) = X | leq(X,Y))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	11 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	12 (all X ((exists Y (m_Halt(Y) = X | m_Down(Y) = X)) <-> pidElem(X))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	13 (all X all Y all Z (leq(Y,Z) & leq(X,Y) -> leq(X,Z))) # label(axiom_62) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	14 (all X all Y m_NotNorm(Y) != m_NormQ(X)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	15 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	16 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	17 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	18 (all P all Q (host(Q) = s(host(P)) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	19 (all X all Y all Q (elem(X,Q) | X = Y <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	20 (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.82/1.13	21 (all X all Y (leq(X,Y) <-> leq(s(X),s(Y)))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	22 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	23 (all X all Y (Y != X <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	24 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	25 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	26 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	27 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	28 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	29 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	30 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	31 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	32 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	33 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	34 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	35 (all X all Q (ordered(cons(X,Q)) <-> (all Y (pidElem(X) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) & elem(Y,Q) -> leq(pidMsg(X),pidMsg(Y)))) & ordered(Q))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	36 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	37 (all X all Q (ordered(snoc(Q,X)) <-> (all Y (elem(Y,Q) & pidElem(Y) & host(pidMsg(X)) = host(pidMsg(Y)) & pidElem(X) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	38 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	39 (all X all Y (X != Y <-> m_NormQ(Y) != m_NormQ(X))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	40 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	41 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	42 (all Q (cons(head(Q),tail(Q)) = Q | Q = q_nil)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	43 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	44 (all Q (Q = q_nil | snoc(init(Q),last(Q)) = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	45 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	46 (all X all Y (m_NotNorm(Y) != m_NotNorm(X) <-> Y != X)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	47 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	48 (all X1 all X2 all Y1 all Y2 (X2 != X1 -> m_Ack(X2,Y2) != m_Ack(X1,Y1))) # label(axiom_31) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	49 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	51 (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.82/1.14	52 (all X all Y (X != Y <-> m_Down(Y) != m_Down(X))) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	53 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	54 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	55 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	56 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	57 (all X all Y (m_Ldr(X) != m_Ldr(Y) <-> Y != X)) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	58 -(all V all W all X all Y ((all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (elec_2 = index(status,host(Z)) & elec_2 = index(status,host(Pid0)) & setIn(Pid0,alive) & setIn(Z,alive) & -leq(host(Z),host(Pid0)) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (setIn(Z,alive) & norm = index(status,host(Pid0)) & index(ldr,host(Pid0)) = host(Pid0) & index(status,host(Z)) = norm & host(Z) = index(ldr,host(Z)) & setIn(Pid0,alive) -> Z = Pid0)) & (all Z all Pid0 (elec_2 = index(status,host(Z)) & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & setIn(Z,alive) & -leq(host(Z),host(Pid0)) -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & (all Z all Pid20 all Pid0 (elec_1 = index(status,host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) & -leq(host(Pid0),host(Z)) & (all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) -> -(setIn(Z,alive) & index(status,host(Z)) = norm & host(Z) = index(ldr,host(Z))))) & queue(host(X)) = cons(m_Down(Y),V) & (all Z all Pid20 all Pid0 (-leq(index(pendack,host(Pid0)),host(Z)) & setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 & elem(m_Halt(Pid0),queue(host(Pid20))) -> -(setIn(Z,alive) & index(status,host(Z)) = norm & index(ldr,host(Z)) = 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(status,host(Z)) = norm & host(Z) = index(ldr,host(Z))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Z) = host(Pid20) & elem(m_Ack(Pid0,Pid20),queue(host(Pid0))) -> -(setIn(Z,alive) & host(Z) = index(ldr,host(Z)) & norm = index(status,host(Z))))) & (all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid20) = host(Z) & setIn(Pid0,alive) -> -(host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm & setIn(Z,alive)))) & (all Z ((elec_2 = index(status,host(Z)) | elec_1 = index(status,host(Z))) & setIn(Z,alive) -> Z = index(elid,host(Z)))) & (all Z all Pid0 (host(Pid0) = host(Z) & Z != Pid0 -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (-setIn(Z,alive) & leq(Pid0,Z) & host(Pid0) = host(Z) -> -setIn(Pid0,alive))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (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))) -> -setIn(Pid0,alive))) & (all Z leq(index(pendack,host(Z)),nbr_proc)) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(index(status,host(X)) = norm & index(ldr,host(X)) = host(Y) | wait = index(status,host(X)) & host(Y) = host(index(elid,host(X)))) -> ((all Z (-leq(host(X),Z) & leq(s(zero),Z) -> host(Y) = Z | setIn(Z,index(down,host(X))))) & index(status,host(X)) = elec_1 -> (-leq(nbr_proc,host(X)) -> (all Z (host(Z) != host(X) -> (all W0 (s(host(X)) != host(W0) -> (host(X) != host(W0) -> (all X0 (host(X) = host(X0) -> (-leq(s(host(X)),host(Z)) & setIn(X0,alive) & elem(m_Halt(X0),queue(host(W0))) -> -(setIn(Z,alive) & host(Z) = index(ldr,host(Z)) & norm = index(status,host(Z)))))))))))))))))) # label(conj) # label(negated_conjecture)Alarm clock 
119.77/120.07	Prover9 interrupted
119.77/120.08	EOF