0.08/0.13	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.15/0.35	% Computer : n011.cluster.edu
0.15/0.35	% Model    : x86_64 x86_64
0.15/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.35	% Memory   : 8042.1875MB
0.15/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.15/0.35	% CPULimit : 1440
0.15/0.35	% WCLimit  : 180
0.15/0.35	% DateTime : Mon Jul  3 07:07:39 EDT 2023
0.15/0.35	% CPUTime  : 
0.94/1.27	============================== Prover9 ===============================
0.94/1.27	Prover9 (32) version 2009-11A, November 2009.
0.94/1.27	Process 32370 was started by sandbox on n011.cluster.edu,
0.94/1.27	Mon Jul  3 07:07:40 2023
0.94/1.27	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_32216_n011.cluster.edu".
0.94/1.27	============================== end of head ===========================
0.94/1.27	
0.94/1.27	============================== INPUT =================================
0.94/1.27	
0.94/1.27	% Reading from file /tmp/Prover9_32216_n011.cluster.edu
0.94/1.27	
0.94/1.27	set(prolog_style_variables).
0.94/1.27	set(auto2).
0.94/1.27	    % set(auto2) -> set(auto).
0.94/1.27	    % set(auto) -> set(auto_inference).
0.94/1.27	    % set(auto) -> set(auto_setup).
0.94/1.27	    % set(auto_setup) -> set(predicate_elim).
0.94/1.27	    % set(auto_setup) -> assign(eq_defs, unfold).
0.94/1.27	    % set(auto) -> set(auto_limits).
0.94/1.27	    % set(auto_limits) -> assign(max_weight, "100.000").
0.94/1.27	    % set(auto_limits) -> assign(sos_limit, 20000).
0.94/1.27	    % set(auto) -> set(auto_denials).
0.94/1.27	    % set(auto) -> set(auto_process).
0.94/1.27	    % set(auto2) -> assign(new_constants, 1).
0.94/1.27	    % set(auto2) -> assign(fold_denial_max, 3).
0.94/1.27	    % set(auto2) -> assign(max_weight, "200.000").
0.94/1.27	    % set(auto2) -> assign(max_hours, 1).
0.94/1.27	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.94/1.27	    % set(auto2) -> assign(max_seconds, 0).
0.94/1.27	    % set(auto2) -> assign(max_minutes, 5).
0.94/1.27	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.94/1.27	    % set(auto2) -> set(sort_initial_sos).
0.94/1.27	    % set(auto2) -> assign(sos_limit, -1).
0.94/1.27	    % set(auto2) -> assign(lrs_ticks, 3000).
0.94/1.27	    % set(auto2) -> assign(max_megs, 400).
0.94/1.27	    % set(auto2) -> assign(stats, some).
0.94/1.27	    % set(auto2) -> clear(echo_input).
0.94/1.27	    % set(auto2) -> set(quiet).
0.94/1.27	    % set(auto2) -> clear(print_initial_clauses).
0.94/1.27	    % set(auto2) -> clear(print_given).
0.94/1.27	assign(lrs_ticks,-1).
0.94/1.27	assign(sos_limit,10000).
0.94/1.27	assign(order,kbo).
0.94/1.27	set(lex_order_vars).
0.94/1.27	clear(print_given).
0.94/1.27	
0.94/1.27	% formulas(sos).  % not echoed (62 formulas)
0.94/1.27	
0.94/1.27	============================== end of input ==========================
0.94/1.27	
0.94/1.27	% From the command line: assign(max_seconds, 1440).
0.94/1.27	
0.94/1.27	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.94/1.27	
0.94/1.27	% Formulas that are not ordinary clauses:
0.94/1.27	1 (all X all Y (X = Y | -(lteq(Y,X) & lteq(X,Y)) | -(integer(X) & integer(Y)))) # label(axiom_tptp_2) # label(axiom) # label(non_clause).  [assumption].
0.94/1.27	2 (all T1_7 all T2_7 (T1_7 = T2_7 | (all Fun_flat_foltrans_157 (-object(Fun_flat_foltrans_157) | Fun_flat_foltrans_157 != node_next(T1_7) | v__1(T1_7,Fun_flat_foltrans_157,T2_7))) | -v__1(T1_7,T2_7,T2_7) | -(object(T2_7) & object(T1_7)))) # label(hyp_tptp_11) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	3 (all T1_5 all T2_5 (-(object(T1_5) & object(T2_5)) | T2_5 = T1_5 | -v__1(T1_5,T2_5,T1_5))) # label(hyp_tptp_8) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	4 (all X all Y (-(object(X) & object(Y)) | (all Fun_flat_foltrans_160 (-object(Fun_flat_foltrans_160) | -v__1(Fun_flat_foltrans_160,Y,Y) | Fun_flat_foltrans_160 != node_next(X))) | (all Fun_flat_foltrans_162 all Fun_flat_foltrans_161 (node_key(Y) != Fun_flat_foltrans_161 | lteq(Fun_flat_foltrans_162,Fun_flat_foltrans_161) | Fun_flat_foltrans_162 != node_key(X) | -(integer(Fun_flat_foltrans_162) & integer(Fun_flat_foltrans_161)))) & (all T_eqof_foltrans_1 (node_key(X) != T_eqof_foltrans_1 | node_key(Y) != T_eqof_foltrans_1 | -integer(T_eqof_foltrans_1))) | null = Y | null = X | -v__1(sortedList_first,X,X))) # label(hyp_tptp_30) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	5 (all T all T0 all T1_1 all T2_1 (-(object(T) & object(T2_1) & object(T1_1) & object(T0)) | -v__1(T0,T1_1,T2_1) | -v__1(T1_1,T,T2_1) | v__1(T0,T1_1,T) & v__1(T0,T,T2_1))) # label(hyp_tptp_3) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	6 (all V__ all I__ object(array_arrayState(V__,I__))) # label(sort_info_array_arrayState) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	7 (all T1 all T2 all T3 (-(object(T1) & object(T2) & object(T3)) | -v__1(T2,T3,T3) | v__1(T1,T3,T3) | -v__1(T1,T2,T2))) # label(hyp_tptp_2) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	8 (all T1_3 all T2_3 all T3_1 (-(object(T1_3) & object(T2_3) & object(T3_1)) | -v__1(T1_3,T2_3,T2_3) | -v__1(T1_3,T3_1,T3_1) | v__1(T1_3,T3_1,T2_3) | v__1(T1_3,T2_3,T3_1))) # label(hyp_tptp_5) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	9 (all T_2 (v__1(T_2,T_2,T_2) | -object(T_2))) # label(hyp_tptp_7) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	10 nn = null | null != nn & v__1(sortedList_first,nn,nn) # label(hyp_tptp_18) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	11 (all T1_4 all T2_4 all T3_2 (-(object(T1_4) & object(T2_4) & object(T3_2)) | v__1(T2_4,T3_2,T3_2) & v__1(T1_4,T2_4,T2_4) | -v__1(T1_4,T2_4,T3_2))) # label(hyp_tptp_6) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	12 (all T1_6 all T2_6 (-(object(T1_6) & object(T2_6)) | T1_6 = T2_6 | -v__1(T1_6,T2_6,T2_6) | node_next(T1_6) != T1_6)) # label(hyp_tptp_9) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	13 (all X_3 (-object(X_3) | (all Y_2 (node_next(Y_2) != X_3 | -object(Y_2))) & (all Z all I (X_3 != array_arrayState(Z,I) | -(integer(I) & object(Z)))) & sortedList_first != X_3 & null = node_value(X_3) & (all J (-integer(J) | array_arrayState(X_3,J) = null)) & node_next(X_3) = null & (all Y_1 (node_value(Y_1) != X_3 | -object(Y_1))) | object_alloc(X_3))) # label(hyp_tptp_35) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	14 null = sortedList_first | (all N_1 (sortedList_first != node_next(N_1) | -object(N_1))) # label(hyp_tptp_32) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	15 (all X all Y (-(integer(X) & integer(Y)) | (-lteq(Y,X) | X = Y | -lteq(X,Y)) & (-(Y = X | -lteq(Y,X)) | lteq(X,Y)))) # label(axiom_tptp_5) # label(axiom) # label(non_clause).  [assumption].
0.94/1.27	16 (all T_3 ((all Fun_flat_foltrans_156 all Fun_flat_foltrans_155 (node_next(T_3) != Fun_flat_foltrans_156 | Fun_flat_foltrans_155 != node_next(T_3) | v__1(T_3,Fun_flat_foltrans_156,Fun_flat_foltrans_155) | -(object(Fun_flat_foltrans_155) & object(Fun_flat_foltrans_156)))) | -object(T_3))) # label(hyp_tptp_10) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	17 (all X_2 all N (null = X_2 | N = null | N != node_next(X_2) | v__1(sortedList_first,N,N) & N != null | -(object(X_2) & object(N)))) # label(hyp_tptp_31) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	18 (all XObj (-object(XObj) | object(XObj))) # label(hyp_tptp_42) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	19 (all V__ object(node_value(V__))) # label(sort_info_node_value) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	20 (all X (lteq(X,X) | -integer(X))) # label(axiom_tptp_1) # label(axiom) # label(non_clause).  [assumption].
0.94/1.27	21 (exists Fun_flat_foltrans_159 exists Fun_flat_foltrans_158 (integer(Fun_flat_foltrans_158) & lteq(Fun_flat_foltrans_159,Fun_flat_foltrans_158) & node_key(nn) = Fun_flat_foltrans_158 & Fun_flat_foltrans_159 = node_key(nn) & integer(Fun_flat_foltrans_159))) # label(hyp_tptp_13) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	22 null = prev_2 | v__1(sortedList_first,prev_2,prev_2) & prev_2 != null # label(hyp_tptp_17) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	23 (all Pto_foltrans_1 (-node(Pto_foltrans_1) | (all T_ms1_foltrans_1 (node(T_ms1_foltrans_1) | T_ms1_foltrans_1 != node_next(Pto_foltrans_1) | -object(T_ms1_foltrans_1))) | -object(Pto_foltrans_1))) # label(hyp_tptp_36) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	24 (all Z_setinc_foltrans_7 (-object(Z_setinc_foltrans_7) | null = Z_setinc_foltrans_7 | -array(Z_setinc_foltrans_7) | -sortedList(Z_setinc_foltrans_7))) # label(hyp_tptp_40_AndLHS) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	25 (all Z_setinc_foltrans_6 (Z_setinc_foltrans_6 != null | array(Z_setinc_foltrans_6) & sortedList(Z_setinc_foltrans_6) | -object(Z_setinc_foltrans_6))) # label(hyp_tptp_40_AndRHS) # label(hypothesis) # label(non_clause).  [assumption].
0.94/1.27	26 (all T_1 all T0_1 all T1_2 all T2_2 (v__1(T0_1,T_1,T2_2) & v__1(T_1,T1_2,T2_2) | -v__1(T0_1,T_1,T1_2) | -v__1(T0_1,T1_2,T2_2) | -(object(T_1) & object(T2_2) & object(T1_2) & object(T0_1)))) # label(hyp_tptp_4) # label(hypothesis) # labelAlarm clock 
179.78/180.04	Prover9 interrupted
179.78/180.05	EOF