0.04/0.13	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.35	% Computer : n010.cluster.edu
0.13/0.35	% Model    : x86_64 x86_64
0.13/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory   : 8042.1875MB
0.13/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit : 1440
0.13/0.35	% WCLimit  : 180
0.13/0.35	% DateTime : Mon Jul  3 08:26:39 EDT 2023
0.13/0.35	% CPUTime  : 
0.47/1.07	============================== Prover9 ===============================
0.47/1.07	Prover9 (32) version 2009-11A, November 2009.
0.47/1.07	Process 8610 was started by sandbox2 on n010.cluster.edu,
0.47/1.07	Mon Jul  3 08:26:40 2023
0.47/1.07	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_8455_n010.cluster.edu".
0.47/1.07	============================== end of head ===========================
0.47/1.07	
0.47/1.07	============================== INPUT =================================
0.47/1.07	
0.47/1.07	% Reading from file /tmp/Prover9_8455_n010.cluster.edu
0.47/1.07	
0.47/1.07	set(prolog_style_variables).
0.47/1.07	set(auto2).
0.47/1.07	    % set(auto2) -> set(auto).
0.47/1.07	    % set(auto) -> set(auto_inference).
0.47/1.07	    % set(auto) -> set(auto_setup).
0.47/1.07	    % set(auto_setup) -> set(predicate_elim).
0.47/1.07	    % set(auto_setup) -> assign(eq_defs, unfold).
0.47/1.07	    % set(auto) -> set(auto_limits).
0.47/1.07	    % set(auto_limits) -> assign(max_weight, "100.000").
0.47/1.07	    % set(auto_limits) -> assign(sos_limit, 20000).
0.47/1.07	    % set(auto) -> set(auto_denials).
0.47/1.07	    % set(auto) -> set(auto_process).
0.47/1.07	    % set(auto2) -> assign(new_constants, 1).
0.47/1.07	    % set(auto2) -> assign(fold_denial_max, 3).
0.47/1.07	    % set(auto2) -> assign(max_weight, "200.000").
0.47/1.07	    % set(auto2) -> assign(max_hours, 1).
0.47/1.07	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.47/1.07	    % set(auto2) -> assign(max_seconds, 0).
0.47/1.07	    % set(auto2) -> assign(max_minutes, 5).
0.47/1.07	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.47/1.07	    % set(auto2) -> set(sort_initial_sos).
0.47/1.07	    % set(auto2) -> assign(sos_limit, -1).
0.47/1.07	    % set(auto2) -> assign(lrs_ticks, 3000).
0.47/1.07	    % set(auto2) -> assign(max_megs, 400).
0.47/1.07	    % set(auto2) -> assign(stats, some).
0.47/1.07	    % set(auto2) -> clear(echo_input).
0.47/1.07	    % set(auto2) -> set(quiet).
0.47/1.07	    % set(auto2) -> clear(print_initial_clauses).
0.47/1.07	    % set(auto2) -> clear(print_given).
0.47/1.07	assign(lrs_ticks,-1).
0.47/1.07	assign(sos_limit,10000).
0.47/1.07	assign(order,kbo).
0.47/1.07	set(lex_order_vars).
0.47/1.07	clear(print_given).
0.47/1.07	
0.47/1.07	% formulas(sos).  % not echoed (67 formulas)
0.47/1.07	
0.47/1.07	============================== end of input ==========================
0.47/1.07	
0.47/1.07	% From the command line: assign(max_seconds, 1440).
0.47/1.07	
0.47/1.07	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.47/1.07	
0.47/1.07	% Formulas that are not ordinary clauses:
0.47/1.07	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.47/1.07	2 (all X all Y (m_Ldr(X) != m_Ldr(Y) <-> X != Y)) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	3 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	4 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	5 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	6 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	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.47/1.07	8 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	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.47/1.07	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.47/1.07	11 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	12 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	13 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	14 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	15 (all X all Y (Y = X <-> leq(Y,X) & leq(X,Y))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	16 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	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.47/1.07	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.47/1.07	19 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	20 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	21 (all X all Y m_NormQ(Y) != m_Ldr(X)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	22 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	23 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	24 (all Q (cons(head(Q),tail(Q)) = Q | Q = q_nil)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	25 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	26 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	27 (all P all Q (host(Q) = s(host(P)) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	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.47/1.07	29 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	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.47/1.07	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.47/1.07	32 (all X all Y (m_Halt(Y) != m_Halt(X) <-> Y != X)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	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.47/1.07	34 (all Y all Q Q = init(snoc(Q,Y))) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	35 (all Q (Q = q_nil | snoc(init(Q),last(Q)) = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	36 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	37 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	38 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	39 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	40 (all X all Y (m_Down(X) != m_Down(Y) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	41 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	42 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	43 (all X all Y m_Ldr(X) != m_NotNorm(Y)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	44 (all X all Y (Y != X <-> m_NotNorm(X) != m_NotNorm(Y))) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	45 (all X all Y m_NotNorm(Y) != m_NormQ(X)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	46 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	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.47/1.07	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.47/1.07	49 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.47/1.07	50 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	51 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	52 (all X all Y all Z m_Ldr(Z) != m_Ack(X,Y)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	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.84/1.09	54 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	55 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	56 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	57 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	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 (nbr_proc = host(Pid0) -> -elem(m_NotNorm(Z),queue(host(Pid0))))) & (all Z all Pid0 (Pid0 != Z & host(Z) = host(Pid0) -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Pid20,alive) & host(Pid30) = host(Z) & host(Pid0) = host(Pid20) & setIn(Z,alive) & host(Z) != host(Pid20) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & host(Z) = host(Pid30) & host(Pid20) = host(Pid0) & setIn(Pid20,alive) & setIn(Z,alive) -> -(setIn(host(Pid30),index(down,host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (index(status,host(Pid0)) = elec_1 & host(Pid30) = host(Pid0) & host(Pid0) = nbr_proc & elem(m_Down(Pid20),queue(host(Pid0))) & (all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) -> -(setIn(Z,alive) & elem(m_Down(Pid30),queue(host(Z)))))) & queue(host(X)) = cons(m_Down(Y),V) & (all Z all Pid20 all Pid0 (host(Pid20) != host(Pid0) & setIn(Pid0,alive) & host(Pid0) = host(Z) & wait = index(status,host(Pid0)) & host(index(elid,host(Pid0))) = host(Pid20) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid20) & host(Pid0) = host(Z) & setIn(Pid0,alive) -> -elem(m_Down(Z),queue(host(Pid20))))) & (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 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(host(Y) = host(index(elid,host(X))) & index(status,host(X)) = wait | index(status,host(X)) = norm & host(Y) = index(ldr,host(X))) -> (-(index(status,host(X)) = elec_1 & (all Z (-leq(host(X),Z) & leq(s(zero),Z) -> setIn(Z,index(down,host(X))) | Z = host(Y)))) -> (all Z (host(X) != host(Z) -> (all W0 all X0 all Y0 (host(Y0) = host(X) -> ((all V0 (-leq(host(Y0),V0) & leq(s(zero),V0) -> host(Y) = V0 | V0 = host(X0) | setIn(V0,index(down,host(X))))) & elem(m_Down(X0),V) & host(Y0) = nbr_proc & elec_1 = index(status,host(Y0)) & host(W0) = host(Y0) -> -(elem(m_Down(W0),queue(host(Z))) & setIn(Z,alive))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.84/1.09	
0.84/1.09	============================== end of process non-clausal formulas ===
0.84/1.09	
0.84/1.09	============================== PROCESS INITIAL CLAUSES ===============
0.84/1.09	
0.84/1.09	============================== PREDICATE ELIMINATION =================
0.84/1.09	
0.84/1.09	============================== end predicate elimination =============
0.84/1.09	
0.84/1.09	Auto_denials:  (non-Horn, no changes).
0.84/1.09	
0.84/1.09	Term ordering decisions:
0.84/1.09	Function symbol KB weights:  alive=1. q_nil=1. status=1. zero=1. elec_1=1. nbr_proc=1. elid=1. down=1. pids=1. elec_2=1. ldr=1. norm=1. wait=1. nil=1. setEmpty=1. c1=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. cons=1. snoc=1. index=1. m_Ack=1. f1=1. f2=1. host=1. m_Down=1. pidMsg=1. s=1. queue=1. m_Halt=1. m_Ldr=1. m_NormQ=1. m_NotNorm=1. head=1. initAlarm clock 
179.37/180.04	Prover9 interrupted
179.37/180.04	EOF