0.03/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer : n008.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 : 960
0.12/0.33	% WCLimit  : 120
0.12/0.33	% DateTime : Tue Aug  9 05:51:38 EDT 2022
0.12/0.33	% CPUTime  : 
0.77/1.03	============================== Prover9 ===============================
0.77/1.03	Prover9 (32) version 2009-11A, November 2009.
0.77/1.03	Process 2008 was started by sandbox on n008.cluster.edu,
0.77/1.03	Tue Aug  9 05:51:39 2022
0.77/1.03	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_1853_n008.cluster.edu".
0.77/1.03	============================== end of head ===========================
0.77/1.03	
0.77/1.03	============================== INPUT =================================
0.77/1.03	
0.77/1.03	% Reading from file /tmp/Prover9_1853_n008.cluster.edu
0.77/1.03	
0.77/1.03	set(prolog_style_variables).
0.77/1.03	set(auto2).
0.77/1.03	    % set(auto2) -> set(auto).
0.77/1.03	    % set(auto) -> set(auto_inference).
0.77/1.03	    % set(auto) -> set(auto_setup).
0.77/1.03	    % set(auto_setup) -> set(predicate_elim).
0.77/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.77/1.03	    % set(auto) -> set(auto_limits).
0.77/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.77/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.77/1.03	    % set(auto) -> set(auto_denials).
0.77/1.03	    % set(auto) -> set(auto_process).
0.77/1.03	    % set(auto2) -> assign(new_constants, 1).
0.77/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.77/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.77/1.03	    % set(auto2) -> assign(max_hours, 1).
0.77/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.77/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.77/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.77/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.77/1.03	    % set(auto2) -> set(sort_initial_sos).
0.77/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.77/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.77/1.03	    % set(auto2) -> assign(max_megs, 400).
0.77/1.03	    % set(auto2) -> assign(stats, some).
0.77/1.03	    % set(auto2) -> clear(echo_input).
0.77/1.03	    % set(auto2) -> set(quiet).
0.77/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.77/1.03	    % set(auto2) -> clear(print_given).
0.77/1.03	assign(lrs_ticks,-1).
0.77/1.03	assign(sos_limit,10000).
0.77/1.03	assign(order,kbo).
0.77/1.03	set(lex_order_vars).
0.77/1.03	clear(print_given).
0.77/1.03	
0.77/1.03	% formulas(sos).  % not echoed (67 formulas)
0.77/1.03	
0.77/1.03	============================== end of input ==========================
0.77/1.03	
0.77/1.03	% From the command line: assign(max_seconds, 960).
0.77/1.03	
0.77/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.77/1.03	
0.77/1.03	% Formulas that are not ordinary clauses:
0.77/1.03	1 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	2 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	3 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	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.77/1.03	5 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	6 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	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.77/1.03	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.77/1.03	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.77/1.03	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.77/1.03	11 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	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.77/1.03	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.77/1.03	14 (all X all Y m_NotNorm(Y) != m_NormQ(X)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	15 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	16 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	17 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	18 (all P all Q (host(Q) = s(host(P)) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	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.77/1.03	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.77/1.03	21 (all X all Y (leq(X,Y) <-> leq(s(X),s(Y)))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	22 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	23 (all X all Y (Y != X <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	24 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	25 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	26 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	27 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	28 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	29 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	30 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	31 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	32 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	33 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	34 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	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.77/1.03	36 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	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.77/1.03	38 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	39 (all X all Y (X != Y <-> m_NormQ(Y) != m_NormQ(X))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	40 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	41 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	42 (all Q (cons(head(Q),tail(Q)) = Q | Q = q_nil)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	43 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	44 (all Q (Q = q_nil | snoc(init(Q),last(Q)) = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	45 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	46 (all X all Y (m_NotNorm(Y) != m_NotNorm(X) <-> Y != X)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	47 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	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.77/1.03	49 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.77/1.03	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	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.77/1.05	52 (all X all Y (X != Y <-> m_Down(Y) != m_Down(X))) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	53 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	54 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	55 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	56 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	57 (all X all Y (m_Ldr(X) != m_Ldr(Y) <-> Y != X)) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.77/1.05	58 -(all V all W all X all Y ((all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (Z != Pid0 & host(Z) = host(Pid0) -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z all Pid20 all Pid0 (host(Pid20) != host(Pid0) & setIn(Pid0,alive) & host(Pid20) = index(ldr,host(Pid0)) & norm = index(status,host(Pid0)) & host(Z) = host(Pid0) -> -elem(m_Down(Z),queue(host(Pid20))))) & queue(host(X)) = cons(m_Down(Y),V) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | V0 = host(Pid20))) & elem(m_Down(Pid20),queue(host(Pid0))) & index(status,host(Pid0)) = elec_1 & host(Pid30) = host(Pid0) & nbr_proc = host(Pid0) -> -(elem(m_Down(Pid30),queue(host(Z))) & setIn(Z,alive)))) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Z,alive) & host(Z) = host(Pid30) & host(Pid0) = host(Pid20) & setIn(Pid20,alive) & host(Z) != host(Pid20) -> -(elem(m_Down(Pid0),queue(host(Z))) & setIn(host(Pid30),index(down,host(Pid20)))))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Z,alive) & setIn(Pid20,alive) & host(Pid20) = host(Pid0) & host(Pid30) = host(Z) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & index(status,host(Pid0)) = wait & host(index(elid,host(Pid0))) = host(Pid20) & host(Z) = host(Pid0) & setIn(Pid0,alive) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z (setIn(Z,alive) & (elec_2 = index(status,host(Z)) | index(status,host(Z)) = elec_1) -> Z = index(elid,host(Z)))) & (all Z all Pid0 (host(Pid0) = nbr_proc -> -elem(m_NotNorm(Z),queue(host(Pid0))))) & (all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(index(status,host(X)) = wait & host(Y) = host(index(elid,host(X))) | index(ldr,host(X)) = host(Y) & index(status,host(X)) = norm) -> (-((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) -> (all Z (host(Z) != host(X) -> (all W0 all X0 all Y0 (host(Y0) = host(X) -> ((all V0 (leq(s(zero),V0) & -leq(host(Y0),V0) -> host(X0) = V0 | host(Y) = V0 | setIn(V0,index(down,host(X))))) & host(Y0) = host(W0) & host(Y0) = nbr_proc & elec_1 = index(status,host(Y0)) & elem(m_Down(X0),V) -> -(setIn(Z,alive) & elem(m_Down(W0),queue(host(Z))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.77/1.05	
0.77/1.05	============================== end of process non-clausal formulas ===
0.77/1.05	
0.77/1.05	============================== PROCESS INITIAL CLAUSES ===============
0.77/1.05	
0.77/1.05	============================== PREDICATE ELIMINATION =================
0.77/1.05	
0.77/1.05	============================== end predicate elimination =============
0.77/1.05	
0.77/1.05	Auto_denials:  (non-Horn, no changes).
0.77/1.05	
0.77/1.05	Term ordering decisions:
0.77/1.05	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. f2=1. f3=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. init=1. Alarm clock 
119.75/120.03	Prover9 interrupted
119.75/120.03	EOF