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