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   : n022.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   : 180
0.12/0.34	% DateTime   : Thu Aug 29 13:36:58 EDT 2019
0.12/0.34	% CPUTime    : 
0.75/1.06	============================== Prover9 ===============================
0.75/1.06	Prover9 (32) version 2009-11A, November 2009.
0.75/1.06	Process 27619 was started by sandbox on n022.cluster.edu,
0.75/1.06	Thu Aug 29 13:36:59 2019
0.75/1.06	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_27466_n022.cluster.edu".
0.75/1.06	============================== end of head ===========================
0.75/1.06	
0.75/1.06	============================== INPUT =================================
0.75/1.06	
0.75/1.06	% Reading from file /tmp/Prover9_27466_n022.cluster.edu
0.75/1.06	
0.75/1.06	set(prolog_style_variables).
0.75/1.06	set(auto2).
0.75/1.06	    % set(auto2) -> set(auto).
0.75/1.06	    % set(auto) -> set(auto_inference).
0.75/1.06	    % set(auto) -> set(auto_setup).
0.75/1.06	    % set(auto_setup) -> set(predicate_elim).
0.75/1.06	    % set(auto_setup) -> assign(eq_defs, unfold).
0.75/1.06	    % set(auto) -> set(auto_limits).
0.75/1.06	    % set(auto_limits) -> assign(max_weight, "100.000").
0.75/1.06	    % set(auto_limits) -> assign(sos_limit, 20000).
0.75/1.06	    % set(auto) -> set(auto_denials).
0.75/1.06	    % set(auto) -> set(auto_process).
0.75/1.06	    % set(auto2) -> assign(new_constants, 1).
0.75/1.06	    % set(auto2) -> assign(fold_denial_max, 3).
0.75/1.06	    % set(auto2) -> assign(max_weight, "200.000").
0.75/1.06	    % set(auto2) -> assign(max_hours, 1).
0.75/1.06	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.75/1.06	    % set(auto2) -> assign(max_seconds, 0).
0.75/1.06	    % set(auto2) -> assign(max_minutes, 5).
0.75/1.06	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.75/1.06	    % set(auto2) -> set(sort_initial_sos).
0.75/1.06	    % set(auto2) -> assign(sos_limit, -1).
0.75/1.06	    % set(auto2) -> assign(lrs_ticks, 3000).
0.75/1.06	    % set(auto2) -> assign(max_megs, 400).
0.75/1.06	    % set(auto2) -> assign(stats, some).
0.75/1.06	    % set(auto2) -> clear(echo_input).
0.75/1.06	    % set(auto2) -> set(quiet).
0.75/1.06	    % set(auto2) -> clear(print_initial_clauses).
0.75/1.06	    % set(auto2) -> clear(print_given).
0.75/1.06	assign(lrs_ticks,-1).
0.75/1.06	assign(sos_limit,10000).
0.75/1.06	assign(order,kbo).
0.75/1.06	set(lex_order_vars).
0.75/1.06	clear(print_given).
0.75/1.06	
0.75/1.06	% formulas(sos).  % not echoed (67 formulas)
0.75/1.06	
0.75/1.06	============================== end of input ==========================
0.75/1.06	
0.75/1.06	% From the command line: assign(max_seconds, 180).
0.75/1.06	
0.75/1.06	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.75/1.06	
0.75/1.06	% Formulas that are not ordinary clauses:
0.75/1.06	1 (all X all Y (Y != X <-> m_NotNorm(Y) != m_NotNorm(X))) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	2 (all X (pidElem(X) <-> (exists Y (m_Halt(Y) = X | m_Down(Y) = X)))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	3 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	4 (all X all Y (m_Down(Y) != m_Down(X) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	5 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	6 (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.75/1.06	7 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	8 (all X all Y (Y != X <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	9 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	10 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	11 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	13 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	14 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	15 (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.75/1.06	16 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	17 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	18 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	19 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	20 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	21 (all X all Q ((all Y (host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) & pidElem(X) & elem(Y,Q) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q) <-> ordered(snoc(Q,X)))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	22 (all X X = pidMsg(m_Down(X))) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	23 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	24 (all Q (Q = cons(head(Q),tail(Q)) | q_nil = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	25 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	26 (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.75/1.06	27 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	28 (all P all Q (s(host(P)) = host(Q) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	29 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	30 (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.75/1.06	31 (all X all Q Q = tail(cons(X,Q))) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	32 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	33 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	34 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	35 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	36 (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.75/1.06	37 (all Q (q_nil = Q | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	38 (all Q all X all Y (host(X) = host(Y) & elem(m_Down(Y),Q) & ordered(cons(m_Halt(X),Q)) -> leq(X,Y))) # label(axiom_57) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	39 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	40 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	41 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	42 (all X all Y all Q (X = Y | elem(X,Q) <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	43 (all X all Q (ordered(cons(X,Q)) <-> (all Y (elem(Y,Q) & pidElem(X) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) -> leq(pidMsg(X),pidMsg(Y)))) & ordered(Q))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	44 (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.75/1.06	45 (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.75/1.06	46 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	47 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	48 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	49 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	50 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	51 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	52 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	53 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	54 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	55 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	56 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	57 (all X all Y (m_Halt(Y) != m_Halt(X) <-> X != Y)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.75/1.06	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 (host(Pid0) = host(Z) & Pid0 != Z -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z all Pid0 (index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & -leq(index(pendack,host(Pid0)),host(Z)) -> -(index(status,host(Z)) = norm & index(ldr,host(Z)) = host(Z) & setIn(Z,alive)))) & (all Z all Pid0 (setIn(Z,alive) & index(status,host(Z)) = norm & norm = index(status,host(Pid0)) & host(Pid0) = index(ldr,host(Pid0)) & host(Z) = index(ldr,host(Z)) & setIn(Pid0,alive) -> Pid0 = Z)) & (all Z all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 & elec_2 = index(status,host(Z)) & setIn(Z,alive) & -leq(host(Z),host(Pid0)) -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & (all Z all Pid20 all Pid0 (-leq(index(pendack,host(Pid0)),host(Z)) & setIn(Pid0,alive) & elem(m_Halt(Pid0),queue(host(Pid20))) & index(status,host(Pid0)) = elec_2 -> -(setIn(Z,alive) & index(status,host(Z)) = norm & host(Z) = index(ldr,host(Z))))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) & -leq(host(Pid0),host(Z)) & elem(m_Down(Pid20),queue(host(Pid0))) & elec_1 = index(status,host(Pid0)) -> -(norm = index(status,host(Z)) & index(ldr,host(Z)) = host(Z) & setIn(Z,alive)))) & (all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Pid20),queue(host(Pid0))) & host(Pid20) = host(Z) & setIn(Pid0,alive) -> -(setIn(Z,alive) & norm = index(status,host(Z)) & host(Z) = index(ldr,host(Z))))) & (all Z all Pid0 (setIn(Z,alive) & elec_2 = index(status,host(Z)) & elec_2 = index(status,host(Pid0)) & setIn(Pid0,alive) & -leq(host(Z),host(Pid0)) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (host(Pid20) = host(Z) & elem(m_Down(Pid20),queue(host(Pid0))) & setIn(Pid0,alive) -> -(norm = index(status,host(Z)) & index(ldr,host(Z)) = host(Z) & setIn(Z,alive)))) & (all Z ((index(status,host(Z)) = elec_2 | index(status,host(Z)) = elec_1) & setIn(Z,alive) -> index(elid,host(Z)) = Z)) & (all Z all Pid0 (leq(Pid0,Z) & host(Z) = host(Pid0) & -setIn(Z,alive) -> -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)) -> (-(host(index(elid,host(X))) = host(Y) & wait = index(status,host(X)) | host(Y) = index(ldr,host(X)) & norm = index(status,host(X))) -> ((all Z (leq(s(zero),Z) & -leq(host(X),Z) -> Z = host(Y) | setIn(Z,index(down,host(X))))) & elec_1 = index(status,host(X)) -> (-leq(nbr_proc,host(X)) -> (all Z (host(Z) != host(X) -> (all W0 (host(W0) != s(host(X)) -> (host(X) != host(W0) -> (all X0 (host(X0) = host(X) -> (-leq(s(host(X)),host(Z)) & elem(m_Halt(X0),queue(host(W0))) & setIn(X0,alive) -> -(setIn(Z,alive) & host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm)))))))))))))))) # label(conj) # label(negated_conjectureCputime limit exceeded (core dumped)
180.04/180.32	EOF