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   : n026.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   : 1200
0.12/0.33	% DateTime   : Wed Jul 14 14:52:15 EDT 2021
0.12/0.33	% CPUTime    : 
0.42/1.05	============================== Prover9 ===============================
0.42/1.05	Prover9 (32) version 2009-11A, November 2009.
0.42/1.05	Process 17024 was started by sandbox on n026.cluster.edu,
0.42/1.05	Wed Jul 14 14:52:15 2021
0.42/1.05	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_16870_n026.cluster.edu".
0.42/1.05	============================== end of head ===========================
0.42/1.05	
0.42/1.05	============================== INPUT =================================
0.42/1.05	
0.42/1.05	% Reading from file /tmp/Prover9_16870_n026.cluster.edu
0.42/1.05	
0.42/1.05	set(prolog_style_variables).
0.42/1.05	set(auto2).
0.42/1.05	    % set(auto2) -> set(auto).
0.42/1.05	    % set(auto) -> set(auto_inference).
0.42/1.05	    % set(auto) -> set(auto_setup).
0.42/1.05	    % set(auto_setup) -> set(predicate_elim).
0.42/1.05	    % set(auto_setup) -> assign(eq_defs, unfold).
0.42/1.05	    % set(auto) -> set(auto_limits).
0.42/1.05	    % set(auto_limits) -> assign(max_weight, "100.000").
0.42/1.05	    % set(auto_limits) -> assign(sos_limit, 20000).
0.42/1.05	    % set(auto) -> set(auto_denials).
0.42/1.05	    % set(auto) -> set(auto_process).
0.42/1.05	    % set(auto2) -> assign(new_constants, 1).
0.42/1.05	    % set(auto2) -> assign(fold_denial_max, 3).
0.42/1.05	    % set(auto2) -> assign(max_weight, "200.000").
0.42/1.05	    % set(auto2) -> assign(max_hours, 1).
0.42/1.05	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.42/1.05	    % set(auto2) -> assign(max_seconds, 0).
0.42/1.05	    % set(auto2) -> assign(max_minutes, 5).
0.42/1.05	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.42/1.05	    % set(auto2) -> set(sort_initial_sos).
0.42/1.05	    % set(auto2) -> assign(sos_limit, -1).
0.42/1.05	    % set(auto2) -> assign(lrs_ticks, 3000).
0.42/1.05	    % set(auto2) -> assign(max_megs, 400).
0.42/1.05	    % set(auto2) -> assign(stats, some).
0.42/1.05	    % set(auto2) -> clear(echo_input).
0.42/1.05	    % set(auto2) -> set(quiet).
0.42/1.05	    % set(auto2) -> clear(print_initial_clauses).
0.42/1.05	    % set(auto2) -> clear(print_given).
0.42/1.05	assign(lrs_ticks,-1).
0.42/1.05	assign(sos_limit,10000).
0.42/1.05	assign(order,kbo).
0.42/1.05	set(lex_order_vars).
0.42/1.05	clear(print_given).
0.42/1.05	
0.42/1.05	% formulas(sos).  % not echoed (67 formulas)
0.42/1.05	
0.42/1.05	============================== end of input ==========================
0.42/1.05	
0.42/1.05	% From the command line: assign(max_seconds, 1200).
0.42/1.05	
0.42/1.05	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.42/1.05	
0.42/1.05	% Formulas that are not ordinary clauses:
0.42/1.05	1 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	2 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	3 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	4 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	5 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	6 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	7 (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.42/1.05	8 (all Q (cons(head(Q),tail(Q)) = Q | q_nil = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	9 (all X all Y (X != Y <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	10 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	11 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	12 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	13 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	14 (all X all Y (m_NormQ(Y) != m_NormQ(X) <-> X != Y)) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	15 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	16 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	17 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	18 (all X1 all X2 all Y1 all Y2 (Y2 != Y1 -> m_Ack(X1,Y1) != m_Ack(X2,Y2))) # label(axiom_32) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	19 (all X (pidElem(X) <-> (exists Y (X = m_Down(Y) | m_Halt(Y) = X)))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	20 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	21 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	22 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	23 (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.42/1.05	24 (all X all Y (m_NotNorm(X) != m_NotNorm(Y) <-> X != Y)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	25 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	26 (all X all Y (X != Y <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	27 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	28 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	29 (all Q (Q = snoc(init(Q),last(Q)) | q_nil = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	30 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	31 (all X all Y (X = Y <-> leq(X,Y) & leq(Y,X))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	32 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	33 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	34 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	35 (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.42/1.05	36 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	37 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	38 (all X all Y m_NotNorm(X) != m_Halt(Y)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	39 (all X all Y all Q (elem(X,cons(Y,Q)) <-> X = Y | elem(X,Q))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	40 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	41 (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.42/1.05	42 (all X all Y all Z m_NormQ(Z) != m_Ack(X,Y)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	43 (all X all Y (m_Down(Y) != m_Down(X) <-> Y != X)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	44 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	45 (all Y all Q Q = init(snoc(Q,Y))) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	46 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	47 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	48 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	49 (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.42/1.05	50 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	51 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.42/1.05	52 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(Alarm clock 
119.77/120.06	Prover9 interrupted
119.77/120.06	EOF