0.00/0.04	% 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.24	% Computer   : n063.star.cs.uiowa.edu
0.02/0.24	% Model      : x86_64 x86_64
0.02/0.24	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.24	% Memory     : 32218.625MB
0.02/0.24	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.24	% CPULimit   : 300
0.02/0.24	% DateTime   : Sat Jul 14 04:42:10 CDT 2018
0.02/0.24	% CPUTime    : 
0.43/0.66	============================== Prover9 ===============================
0.43/0.66	Prover9 (32) version 2009-11A, November 2009.
0.43/0.66	Process 43358 was started by sandbox on n063.star.cs.uiowa.edu,
0.43/0.66	Sat Jul 14 04:42:10 2018
0.43/0.66	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_43326_n063.star.cs.uiowa.edu".
0.43/0.66	============================== end of head ===========================
0.43/0.66	
0.43/0.66	============================== INPUT =================================
0.43/0.66	
0.43/0.66	% Reading from file /tmp/Prover9_43326_n063.star.cs.uiowa.edu
0.43/0.66	
0.43/0.66	set(prolog_style_variables).
0.43/0.66	set(auto2).
0.43/0.66	    % set(auto2) -> set(auto).
0.43/0.66	    % set(auto) -> set(auto_inference).
0.43/0.66	    % set(auto) -> set(auto_setup).
0.43/0.66	    % set(auto_setup) -> set(predicate_elim).
0.43/0.66	    % set(auto_setup) -> assign(eq_defs, unfold).
0.43/0.66	    % set(auto) -> set(auto_limits).
0.43/0.66	    % set(auto_limits) -> assign(max_weight, "100.000").
0.43/0.66	    % set(auto_limits) -> assign(sos_limit, 20000).
0.43/0.66	    % set(auto) -> set(auto_denials).
0.43/0.66	    % set(auto) -> set(auto_process).
0.43/0.66	    % set(auto2) -> assign(new_constants, 1).
0.43/0.66	    % set(auto2) -> assign(fold_denial_max, 3).
0.43/0.66	    % set(auto2) -> assign(max_weight, "200.000").
0.43/0.66	    % set(auto2) -> assign(max_hours, 1).
0.43/0.66	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.43/0.66	    % set(auto2) -> assign(max_seconds, 0).
0.43/0.66	    % set(auto2) -> assign(max_minutes, 5).
0.43/0.66	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.43/0.66	    % set(auto2) -> set(sort_initial_sos).
0.43/0.66	    % set(auto2) -> assign(sos_limit, -1).
0.43/0.66	    % set(auto2) -> assign(lrs_ticks, 3000).
0.43/0.66	    % set(auto2) -> assign(max_megs, 400).
0.43/0.66	    % set(auto2) -> assign(stats, some).
0.43/0.66	    % set(auto2) -> clear(echo_input).
0.43/0.66	    % set(auto2) -> set(quiet).
0.43/0.66	    % set(auto2) -> clear(print_initial_clauses).
0.43/0.66	    % set(auto2) -> clear(print_given).
0.43/0.66	assign(lrs_ticks,-1).
0.43/0.66	assign(sos_limit,10000).
0.43/0.66	assign(order,kbo).
0.43/0.66	set(lex_order_vars).
0.43/0.66	clear(print_given).
0.43/0.66	
0.43/0.66	% formulas(sos).  % not echoed (62 formulas)
0.43/0.66	
0.43/0.66	============================== end of input ==========================
0.43/0.66	
0.43/0.66	% From the command line: assign(max_seconds, 300).
0.43/0.66	
0.43/0.66	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.43/0.66	
0.43/0.66	% Formulas that are not ordinary clauses:
0.43/0.66	1 v__1(sortedList_first,prev_2,prev_2) & null != prev_2 | prev_2 = null # label(hyp_tptp_17) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	2 (all X all Y (-(integer(X) & integer(Y)) | Y = X | -(lteq(X,Y) & lteq(Y,X)))) # label(axiom_tptp_2) # label(axiom) # label(non_clause).  [assumption].
0.43/0.66	3 (all T1_3 all T2_3 all T3_1 (-(object(T1_3) & object(T3_1) & object(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) | -v__1(T1_3,T2_3,T2_3))) # label(hyp_tptp_5) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	4 null = sortedList_first | (all N_1 (-object(N_1) | node_next(N_1) != sortedList_first)) # label(hyp_tptp_32) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	5 (all Pto_foltrans_1 (-object(Pto_foltrans_1) | (all T_ms1_foltrans_1 (-object(T_ms1_foltrans_1) | node(T_ms1_foltrans_1) | T_ms1_foltrans_1 != node_next(Pto_foltrans_1))) | -node(Pto_foltrans_1))) # label(hyp_tptp_36) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	6 (all T1 all T2 all T3 (-v__1(T2,T3,T3) | v__1(T1,T3,T3) | -v__1(T1,T2,T2) | -(object(T3) & object(T2) & object(T1)))) # label(hyp_tptp_2) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	7 (all Z_setinc_foltrans_3 (-object_alloc(Z_setinc_foltrans_3) | object_alloc(Z_setinc_foltrans_3) | -object(Z_setinc_foltrans_3))) # label(hyp_tptp_27) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	8 (all T_1 all T0_1 all T1_2 all T2_2 (-v__1(T0_1,T_1,T1_2) | v__1(T0_1,T_1,T2_2) & v__1(T_1,T1_2,T2_2) | -v__1(T0_1,T1_2,T2_2) | -(object(T2_2) & object(T1_2) & object(T0_1) & object(T_1)))) # label(hyp_tptp_4) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	9 (all X (-integer(X) | lteq(X,X))) # label(axiom_tptp_1) # label(axiom) # label(non_clause).  [assumption].
0.43/0.66	10 (exists Fun_flat_foltrans_159 exists Fun_flat_foltrans_158 (Fun_flat_foltrans_158 = node_key(nn) & node_key(nn) = Fun_flat_foltrans_159 & lteq(Fun_flat_foltrans_159,Fun_flat_foltrans_158) & integer(Fun_flat_foltrans_158) & integer(Fun_flat_foltrans_159))) # label(hyp_tptp_13) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	11 (all Z_setinc_foltrans_9 (-object(Z_setinc_foltrans_9) | -node(Z_setinc_foltrans_9) | -array(Z_setinc_foltrans_9) | Z_setinc_foltrans_9 = null)) # label(hyp_tptp_41_AndLHS) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	12 (all Z_setinc_foltrans_8 (Z_setinc_foltrans_8 != null | array(Z_setinc_foltrans_8) & node(Z_setinc_foltrans_8) | -object(Z_setinc_foltrans_8))) # label(hyp_tptp_41_AndRHS) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	13 nn = null | v__1(sortedList_first,nn,nn) & null != nn # label(hyp_tptp_18) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	14 (all V__ all I__ object(array_arrayState(V__,I__))) # label(sort_info_array_arrayState) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	15 (all T1_6 all T2_6 (T1_6 != node_next(T1_6) | -v__1(T1_6,T2_6,T2_6) | T1_6 = T2_6 | -(object(T2_6) & object(T1_6)))) # label(hyp_tptp_9) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	16 (all X_2 all N (null = X_2 | null = N | null != N & v__1(sortedList_first,N,N) | N != node_next(X_2) | -(object(N) & object(X_2)))) # label(hyp_tptp_31) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	17 (all XObj (object(XObj) | -object(XObj))) # label(hyp_tptp_42) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	18 (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(T) & object(T1_1) & object(T2_1) & object(T0)))) # label(hyp_tptp_3) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	19 (all X_3 (-object(X_3) | object_alloc(X_3) | (all Y_1 (-object(Y_1) | X_3 != node_value(Y_1))) & (all Z all I (X_3 != array_arrayState(Z,I) | -(object(Z) & integer(I)))) & sortedList_first != X_3 & null = node_value(X_3) & (all J (array_arrayState(X_3,J) = null | -integer(J))) & node_next(X_3) = null & (all Y_2 (node_next(Y_2) != X_3 | -object(Y_2))))) # label(hyp_tptp_35) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	20 (all X all Y (lteq(Y,X) | lteq(X,Y) | -(integer(X) & integer(Y)))) # label(axiom_tptp_4) # label(axiom) # label(non_clause).  [assumption].
0.43/0.66	21 (all Z_setinc_foltrans_7 (-sortedList(Z_setinc_foltrans_7) | null = Z_setinc_foltrans_7 | -array(Z_setinc_foltrans_7) | -object(Z_setinc_foltrans_7))) # label(hyp_tptp_40_AndLHS) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	22 (all Z_setinc_foltrans_6 (null != Z_setinc_foltrans_6 | 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.43/0.66	23 (all V__ object(node_value(V__))) # label(sort_info_node_value) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	24 (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.43/0.66	25 (all T1_4 all T2_4 all T3_2 (-v__1(T1_4,T2_4,T3_2) | v__1(T2_4,T3_2,T3_2) & v__1(T1_4,T2_4,T2_4) | -(object(T3_2) & object(T2_4) & object(T1_4)))) # label(hyp_tptp_6) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	26 (all T_3 (-object(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)))))) # label(hyp_tptp_10) # label(hypothesis) # label(non_clause).  [assumption].
0.43/0.66	27 (all X all Y (-(object(X) & object(Y)) | -v__1(sortedList_first,X,X) | (all Fun_flat_foltrans_160 (-v__1(Fun_flat_foltrans_160,Y,Y) | node_next(X) != Fun_flat_foltrans_160 | -object(Fun_flat_foltrans_160))) | (all Fun_flat_foltrans_162 all Fun_flat_foltrans_161 (-(integer(Fun_flat_foltrans_161) & integer(Fun_flat_foltrans_162)) | lteq(Fun_flat_foltrans_162,Fun_flat_foltrans_161) | node_key(Y) != Fun_flat_foltrans_161 | Fun_flat_foltrans_162 != node_key(X))) & (all T_eqof_foltrans_1 (node_key(X) != T_eqoCputime limit exceeded (core dumped)
300.07/300.27	EOF