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.02/0.23	% Computer   : n068.star.cs.uiowa.edu
0.02/0.23	% Model      : x86_64 x86_64
0.02/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.23	% Memory     : 32218.625MB
0.02/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.23	% CPULimit   : 300
0.02/0.23	% DateTime   : Sat Jul 14 05:26:39 CDT 2018
0.02/0.23	% CPUTime    : 
0.07/0.51	============================== Prover9 ===============================
0.07/0.51	Prover9 (32) version 2009-11A, November 2009.
0.07/0.51	Process 58702 was started by sandbox2 on n068.star.cs.uiowa.edu,
0.07/0.51	Sat Jul 14 05:26:40 2018
0.07/0.51	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_58670_n068.star.cs.uiowa.edu".
0.07/0.51	============================== end of head ===========================
0.07/0.51	
0.07/0.51	============================== INPUT =================================
0.07/0.51	
0.07/0.51	% Reading from file /tmp/Prover9_58670_n068.star.cs.uiowa.edu
0.07/0.51	
0.07/0.51	set(prolog_style_variables).
0.07/0.51	set(auto2).
0.07/0.51	    % set(auto2) -> set(auto).
0.07/0.51	    % set(auto) -> set(auto_inference).
0.07/0.51	    % set(auto) -> set(auto_setup).
0.07/0.51	    % set(auto_setup) -> set(predicate_elim).
0.07/0.51	    % set(auto_setup) -> assign(eq_defs, unfold).
0.07/0.51	    % set(auto) -> set(auto_limits).
0.07/0.51	    % set(auto_limits) -> assign(max_weight, "100.000").
0.07/0.51	    % set(auto_limits) -> assign(sos_limit, 20000).
0.07/0.51	    % set(auto) -> set(auto_denials).
0.07/0.51	    % set(auto) -> set(auto_process).
0.07/0.51	    % set(auto2) -> assign(new_constants, 1).
0.07/0.51	    % set(auto2) -> assign(fold_denial_max, 3).
0.07/0.51	    % set(auto2) -> assign(max_weight, "200.000").
0.07/0.51	    % set(auto2) -> assign(max_hours, 1).
0.07/0.51	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.07/0.51	    % set(auto2) -> assign(max_seconds, 0).
0.07/0.51	    % set(auto2) -> assign(max_minutes, 5).
0.07/0.51	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.07/0.51	    % set(auto2) -> set(sort_initial_sos).
0.07/0.51	    % set(auto2) -> assign(sos_limit, -1).
0.07/0.51	    % set(auto2) -> assign(lrs_ticks, 3000).
0.07/0.51	    % set(auto2) -> assign(max_megs, 400).
0.07/0.51	    % set(auto2) -> assign(stats, some).
0.07/0.51	    % set(auto2) -> clear(echo_input).
0.07/0.51	    % set(auto2) -> set(quiet).
0.07/0.51	    % set(auto2) -> clear(print_initial_clauses).
0.07/0.51	    % set(auto2) -> clear(print_given).
0.07/0.51	assign(lrs_ticks,-1).
0.07/0.51	assign(sos_limit,10000).
0.07/0.51	assign(order,kbo).
0.07/0.51	set(lex_order_vars).
0.07/0.51	clear(print_given).
0.07/0.51	
0.07/0.51	% formulas(sos).  % not echoed (67 formulas)
0.07/0.51	
0.07/0.51	============================== end of input ==========================
0.07/0.51	
0.07/0.51	% From the command line: assign(max_seconds, 300).
0.07/0.51	
0.07/0.51	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.07/0.51	
0.07/0.51	% Formulas that are not ordinary clauses:
0.07/0.51	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.51	2 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	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.51	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.51	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.51	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.51	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.51	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.51	9 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	10 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	11 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	12 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	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.51	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.51	15 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	16 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	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.51	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.51	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.51	20 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	21 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	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.51	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.51	24 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	25 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	26 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	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.51	28 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	29 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	30 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	31 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	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.51	33 (all Q (q_nil = Q | Q = cons(head(Q),tail(Q)))) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	34 (all Q (snoc(init(Q),last(Q)) = Q | q_nil = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	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.51	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.51	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.51	38 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	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.51	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.51	41 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	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.51	43 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	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.51	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.51	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.51	47 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	48 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	49 (all X X = pidMsg(m_Down(X))) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.07/0.51	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.07/0.52	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.52	52 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.07/0.52	53 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.07/0.52	54 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.07/0.52	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.52	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.52	57 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.07/0.52	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 (host(Pid0) = host(Z) & Z != Pid0 -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z (setIn(Z,alive) & (index(status,host(Z)) = elec_1 | elec_2 = index(status,host(Z))) -> index(elid,host(Z)) = Z)) & (all Z all Pid0 (index(status,host(Pid0)) = elec_2 & setIn(host(Pid0),index(down,host(Z))) & setIn(Pid0,alive) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 & host(Pid0) = host(Pid20) & elem(m_Down(Pid20),queue(host(Z))) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (setIn(Z,alive) & host(Z) = index(ldr,host(Z)) & norm = index(status,host(Pid0)) & host(Pid0) = index(ldr,host(Pid0)) & norm = index(status,host(Z)) & setIn(Pid0,alive) -> Pid0 = Z)) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Z,alive) & host(Z) = host(Pid30) & host(Pid20) = host(Pid0) & setIn(Pid20,alive) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) & elec_1 = index(status,host(Pid0)) & s(host(Pid0)) = host(Pid30) & elem(m_Down(Pid30),queue(host(Pid0))) & elem(m_Down(Pid20),queue(host(Pid0))) & leq(nbr_proc,s(host(Pid0))) & setIn(Pid0,alive) -> -(host(Z) = index(ldr,host(Z)) & norm = index(status,host(Z)) & setIn(Z,alive)))) & queue(host(X)) = cons(m_Ack(W,Y),V) & (all Z all Pid30 all Pid20 all Pid0 (index(status,host(Pid0)) = elec_1 & index(status,host(Z)) = elec_2 & host(Pid0) = host(Pid30) & elem(m_Down(Pid20),queue(host(Pid0))) & leq(host(Z),host(Pid0)) & setIn(Z,alive) & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> V0 = host(Pid20) | setIn(V0,index(down,host(Pid0))))) -> -elem(m_Ack(Z,Pid30),queue(host(Z))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Down(Z),queue(host(Pid0))) & host(Z) = host(Pid20) & index(status,host(Pid0)) = wait & host(Pid20) = host(index(elid,host(Pid0))) & host(Pid0) != host(Pid20) -> -(setIn(Pid20,alive) & index(ldr,host(Pid20)) = host(Pid20) & index(status,host(Pid20)) = norm))) & (all Z all Pid20 all Pid0 (host(Pid20) != host(Pid0) & setIn(Pid0,alive) & elem(m_Down(Z),queue(host(Pid0))) & norm = index(status,host(Pid0)) & host(Pid20) = index(ldr,host(Pid0)) & host(Z) = host(Pid20) -> -(setIn(Pid20,alive) & index(ldr,host(Pid20)) = host(Pid20) & index(status,host(Pid20)) = norm))) & (all Z all Pid30 all Pid20 all Pid0 (host(Z) != host(Pid20) & setIn(Z,alive) & host(Pid30) = host(Z) & host(Pid20) = host(Pid0) & setIn(Pid20,alive) -> -(elem(m_Down(Pid0),queue(host(Z))) & setIn(host(Pid30),index(down,host(Pid20)))))) & (all Z all Pid20 all Pid0 (-leq(host(Pid20),host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Z) = host(Pid20) & setIn(Pid0,alive) -> -(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)) = norm & host(Pid0) = index(ldr,host(Pid0)) & host(Pid20) = hCputime limit exceeded (core dumped)
300.01/300.22	EOF