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