0.07/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n002.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   : 1200
0.12/0.33	% DateTime   : Wed Jul 14 14:23:02 EDT 2021
0.12/0.33	% CPUTime    : 
0.73/1.00	============================== Prover9 ===============================
0.73/1.00	Prover9 (32) version 2009-11A, November 2009.
0.73/1.00	Process 9699 was started by sandbox on n002.cluster.edu,
0.73/1.00	Wed Jul 14 14:23:03 2021
0.73/1.00	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_9546_n002.cluster.edu".
0.73/1.00	============================== end of head ===========================
0.73/1.00	
0.73/1.00	============================== INPUT =================================
0.73/1.00	
0.73/1.00	% Reading from file /tmp/Prover9_9546_n002.cluster.edu
0.73/1.00	
0.73/1.00	set(prolog_style_variables).
0.73/1.00	set(auto2).
0.73/1.00	    % set(auto2) -> set(auto).
0.73/1.00	    % set(auto) -> set(auto_inference).
0.73/1.00	    % set(auto) -> set(auto_setup).
0.73/1.00	    % set(auto_setup) -> set(predicate_elim).
0.73/1.00	    % set(auto_setup) -> assign(eq_defs, unfold).
0.73/1.00	    % set(auto) -> set(auto_limits).
0.73/1.00	    % set(auto_limits) -> assign(max_weight, "100.000").
0.73/1.00	    % set(auto_limits) -> assign(sos_limit, 20000).
0.73/1.00	    % set(auto) -> set(auto_denials).
0.73/1.00	    % set(auto) -> set(auto_process).
0.73/1.00	    % set(auto2) -> assign(new_constants, 1).
0.73/1.00	    % set(auto2) -> assign(fold_denial_max, 3).
0.73/1.00	    % set(auto2) -> assign(max_weight, "200.000").
0.73/1.00	    % set(auto2) -> assign(max_hours, 1).
0.73/1.00	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.73/1.00	    % set(auto2) -> assign(max_seconds, 0).
0.73/1.00	    % set(auto2) -> assign(max_minutes, 5).
0.73/1.00	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.73/1.00	    % set(auto2) -> set(sort_initial_sos).
0.73/1.00	    % set(auto2) -> assign(sos_limit, -1).
0.73/1.00	    % set(auto2) -> assign(lrs_ticks, 3000).
0.73/1.00	    % set(auto2) -> assign(max_megs, 400).
0.73/1.00	    % set(auto2) -> assign(stats, some).
0.73/1.00	    % set(auto2) -> clear(echo_input).
0.73/1.00	    % set(auto2) -> set(quiet).
0.73/1.00	    % set(auto2) -> clear(print_initial_clauses).
0.73/1.00	    % set(auto2) -> clear(print_given).
0.73/1.00	assign(lrs_ticks,-1).
0.73/1.00	assign(sos_limit,10000).
0.73/1.00	assign(order,kbo).
0.73/1.00	set(lex_order_vars).
0.73/1.00	clear(print_given).
0.73/1.00	
0.73/1.00	% formulas(sos).  % not echoed (67 formulas)
0.73/1.00	
0.73/1.00	============================== end of input ==========================
0.73/1.00	
0.73/1.00	% From the command line: assign(max_seconds, 1200).
0.73/1.00	
0.73/1.00	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.73/1.00	
0.73/1.00	% Formulas that are not ordinary clauses:
0.73/1.00	1 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	2 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	3 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	4 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	5 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	6 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	7 (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.73/1.00	8 (all Q (cons(head(Q),tail(Q)) = Q | q_nil = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	9 (all X all Y (X != Y <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	10 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	11 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	12 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	13 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	14 (all X all Y (m_NormQ(Y) != m_NormQ(X) <-> X != Y)) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	15 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	16 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	17 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	18 (all X1 all X2 all Y1 all Y2 (Y2 != Y1 -> m_Ack(X1,Y1) != m_Ack(X2,Y2))) # label(axiom_32) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	19 (all X (pidElem(X) <-> (exists Y (X = m_Down(Y) | m_Halt(Y) = X)))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	20 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	21 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	22 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	23 (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.73/1.00	24 (all X all Y (m_NotNorm(X) != m_NotNorm(Y) <-> X != Y)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	25 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	26 (all X all Y (X != Y <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	27 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	28 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	29 (all Q (Q = snoc(init(Q),last(Q)) | q_nil = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	30 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	31 (all X all Y (X = Y <-> leq(X,Y) & leq(Y,X))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	32 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	33 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	34 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	35 (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.73/1.00	36 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	37 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	38 (all X all Y m_NotNorm(X) != m_Halt(Y)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	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.73/1.00	40 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	41 (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.73/1.00	42 (all X all Y all Z m_NormQ(Z) != m_Ack(X,Y)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	43 (all X all Y (m_Down(Y) != m_Down(X) <-> Y != X)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	44 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	45 (all Y all Q Q = init(snoc(Q,Y))) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	46 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	47 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	48 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	49 (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.73/1.00	50 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	51 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.73/1.00	52 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
1.17/1.50	53 (all X all Q (ordered(cons(X,Q)) <-> (all Y (elem(Y,Q) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(X) -> leq(pidMsg(X),pidMsg(Y)))) & ordered(Q))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
1.17/1.50	54 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
1.17/1.50	55 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
1.17/1.50	56 (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].
1.17/1.50	57 (all X all Q ((all Y (elem(Y,Q) & pidElem(X) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q) <-> ordered(snoc(Q,X)))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
1.17/1.50	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 (host(Pid0) = host(Z) & Z != Pid0 -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z ((elec_2 = index(status,host(Z)) | elec_1 = index(status,host(Z))) & setIn(Z,alive) -> index(elid,host(Z)) = Z)) & (all Z all Pid0 (setIn(Z,alive) & index(ldr,host(Z)) = host(Z) & host(Pid0) = index(ldr,host(Pid0)) & norm = index(status,host(Pid0)) & norm = index(status,host(Z)) & setIn(Pid0,alive) -> Z = Pid0)) & (all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Pid20),queue(host(Pid0))) & index(status,host(Pid0)) = elec_2 & index(pendack,host(Pid0)) = host(Pid20) & leq(nbr_proc,index(pendack,host(Pid0))) & setIn(Pid0,alive) -> -(host(Z) = index(ldr,host(Z)) & norm = index(status,host(Z)) & setIn(Z,alive)))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> V0 = host(Pid20) | setIn(V0,index(down,host(Pid0))))) & -leq(host(Pid0),host(Z)) & elem(m_Down(Pid20),queue(host(Pid0))) & index(status,host(Pid0)) = elec_1 -> -(host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm & setIn(Z,alive)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 & host(Pid20) = index(pendack,host(Pid0)) & leq(nbr_proc,index(pendack,host(Pid0))) & elem(m_Down(Pid20),queue(host(Pid0))) -> -(setIn(Z,alive) & host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(index(status,host(X)) = wait & host(index(elid,host(X))) = host(Y) | index(status,host(X)) = norm & host(Y) = index(ldr,host(X))) -> ((all Z (leq(s(zero),Z) & -leq(host(X),Z) -> Z = host(Y) | setIn(Z,index(down,host(X))))) & index(status,host(X)) = elec_1 -> (leq(nbr_proc,host(X)) -> (all Z (-setIn(host(Z),setEmpty) -> (all V0 (host(X) = host(V0) -> (all W0 (host(W0) != host(X) -> (host(X) = host(V0) & index(ldr,host(W0)) = host(W0) & norm = index(status,host(W0)) & setIn(W0,alive) & setIn(V0,alive) -> V0 = W0)))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
1.17/1.50	
1.17/1.50	============================== end of process non-clausal formulas ===
1.17/1.50	
1.17/1.50	============================== PROCESS INITIAL CLAUSES ===============
1.17/1.50	
1.17/1.50	============================== PREDICATE ELIMINATION =================
1.17/1.50	
1.17/1.50	============================== end predicate elimination =============
1.17/1.50	
1.17/1.50	Auto_denials:  (non-Horn, no changes).
1.17/1.50	
1.17/1.50	Term ordering decisions:
1.17/1.50	Function symbol KB weights:  status=1. alive=1. ldr=1. norm=1. q_nil=1. elec_1=1. zero=1. nbr_proc=1. down=1. elid=1. pids=1. elec_2=1. nil=1. pendack=1. setEmpty=1. wait=1. c1=1. c3=1. c4=1. c5=1. c6=1. c7=1. index=1. cons=1. snoc=1. m_Ack=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. f4=1.
1.17/1.50	
1.17/1.50	============================== end of process initial clauses ========
1.17/1.50	
1.17/1.50	============================== CLAUSES FOR SEARCH ====================
1.17/1.50	
1.17/1.50	============================== end of clauses for search =============
1.17/1.50	
1.17/1.50	============================== SEARCH ================================
1.17/1.50	
1.17/1.50	% Starting search at 0.03 seconds.
1.17/1.50	
1.17/1.50	NOTE: Back_subsAlarm clock 
119.82/120.09	Prover9 interrupted
119.82/120.10	EOF