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