0.03/0.11	% 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 : n021.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 : 1440
0.12/0.33	% WCLimit  : 180
0.12/0.33	% DateTime : Mon Jul  3 09:28:52 EDT 2023
0.12/0.33	% CPUTime  : 
0.42/1.02	============================== Prover9 ===============================
0.42/1.02	Prover9 (32) version 2009-11A, November 2009.
0.42/1.02	Process 26876 was started by sandbox2 on n021.cluster.edu,
0.42/1.02	Mon Jul  3 09:28:53 2023
0.42/1.02	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_26722_n021.cluster.edu".
0.42/1.02	============================== end of head ===========================
0.42/1.02	
0.42/1.02	============================== INPUT =================================
0.42/1.02	
0.42/1.02	% Reading from file /tmp/Prover9_26722_n021.cluster.edu
0.42/1.02	
0.42/1.02	set(prolog_style_variables).
0.42/1.02	set(auto2).
0.42/1.02	    % set(auto2) -> set(auto).
0.42/1.02	    % set(auto) -> set(auto_inference).
0.42/1.02	    % set(auto) -> set(auto_setup).
0.42/1.02	    % set(auto_setup) -> set(predicate_elim).
0.42/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.42/1.02	    % set(auto) -> set(auto_limits).
0.42/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.42/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.42/1.02	    % set(auto) -> set(auto_denials).
0.42/1.02	    % set(auto) -> set(auto_process).
0.42/1.02	    % set(auto2) -> assign(new_constants, 1).
0.42/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.42/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.42/1.02	    % set(auto2) -> assign(max_hours, 1).
0.42/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.42/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.42/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.42/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.42/1.02	    % set(auto2) -> set(sort_initial_sos).
0.42/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.42/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.42/1.02	    % set(auto2) -> assign(max_megs, 400).
0.42/1.02	    % set(auto2) -> assign(stats, some).
0.42/1.02	    % set(auto2) -> clear(echo_input).
0.42/1.02	    % set(auto2) -> set(quiet).
0.42/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.42/1.02	    % set(auto2) -> clear(print_given).
0.42/1.02	assign(lrs_ticks,-1).
0.42/1.02	assign(sos_limit,10000).
0.42/1.02	assign(order,kbo).
0.42/1.02	set(lex_order_vars).
0.42/1.02	clear(print_given).
0.42/1.02	
0.42/1.02	% formulas(sos).  % not echoed (402 formulas)
0.42/1.02	
0.42/1.02	============================== end of input ==========================
0.42/1.02	
0.42/1.02	% From the command line: assign(max_seconds, 1440).
0.42/1.02	
0.42/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.42/1.02	
0.42/1.02	% Formulas that are not ordinary clauses:
0.42/1.02	1 (all D all Db all Ob (rdn_non_zero(Ob) -> rdn_positive_less(rdnn(D),rdn(rdnn(Db),Ob)))) # label(rdn_extra_digits_positive_less) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	2 (all X all Y (less(X,Y) <-> -less(Y,X) & X != Y)) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	3 (all X all Y all RDN_X all RDN_Y (rdn_translate(Y,rdn_pos(RDN_Y)) & rdn_translate(X,rdn_neg(RDN_X)) -> less(X,Y))) # label(less_entry_point_neg_pos) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	4 (all D all O (rdn_non_zero(O) -> rdn_non_zero(rdn(rdnn(D),O)))) # label(rdn_non_zero_by_structure) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	5 (all X (rdn_non_zero_digit(rdnn(X)) -> rdn_non_zero(rdnn(X)))) # label(rdn_non_zero_by_digit) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	6 (all X all Y (X = Y | less(X,Y) <-> less_or_equal(X,Y))) # label(less_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	7 (all X all Y all RDN_X all RDN_Y (rdn_translate(X,rdn_neg(RDN_X)) & rdn_positive_less(RDN_Y,RDN_X) & rdn_translate(Y,rdn_neg(RDN_Y)) -> less(X,Y))) # label(less_entry_point_neg_neg) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	8 (all X all Y all Z (less(Z,Y) & sum(X,n1,Y) -> less_or_equal(Z,X))) # label(less_successor) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	9 (all X all Y all RDN_X all RDN_Y (rdn_translate(Y,rdn_pos(RDN_Y)) & rdn_positive_less(RDN_X,RDN_Y) & rdn_translate(X,rdn_pos(RDN_X)) -> less(X,Y))) # label(less_entry_point_pos_pos) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	10 (all Ds all Os all Db all Ob (rdn_positive_less(Os,Ob) -> rdn_positive_less(rdn(rdnn(Ds),Os),rdn(rdnn(Db),Ob)))) # label(rdn_positive_less_multi_digit_high) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	11 (all X all Y all Z (rdn_positive_less(rdnn(Y),rdnn(Z)) & rdn_positive_less(rdnn(X),rdnn(Y)) -> rdn_positive_less(rdnn(X),rdnn(Z)))) # label(rdn_positive_less_transitivity) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	12 (all Ds all O all Db (rdn_non_zero(O) & rdn_positive_less(rdnn(Ds),rdnn(Db)) -> rdn_positive_less(rdn(rdnn(Ds),O),rdn(rdnn(Db),O)))) # label(rdn_positive_less_multi_digit_low) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	13 (all X all Y all Z all RDN_X all RDN_Y all RDN_Z (rdn_translate(X,rdn_pos(RDN_X)) & rdn_translate(Y,rdn_neg(RDN_Y)) & rdn_add_with_carry(rdnn(n0),RDN_X,RDN_Z,RDN_Y) & rdn_translate(Z,rdn_neg(RDN_Z)) & rdn_positive_less(RDN_X,RDN_Y) -> sum(X,Y,Z))) # label(sum_entry_point_pos_neg_1) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	14 (all X all Y all Z all RDN_X all RDN_Y all RDN_Z (rdn_add_with_carry(rdnn(n0),RDN_X,RDN_Y,RDN_Z) & rdn_translate(Z,rdn_pos(RDN_Z)) & rdn_translate(Y,rdn_pos(RDN_Y)) & rdn_translate(X,rdn_pos(RDN_X)) -> sum(X,Y,Z))) # label(sum_entry_point_pos_pos) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	15 (all X all Y all Z all RDN_X all RDN_Y (rdn_translate(X,rdn_neg(RDN_X)) & rdn_translate(Y,rdn_pos(RDN_Y)) & sum(Y,X,Z) -> sum(X,Y,Z))) # label(sum_entry_point_neg_pos) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	16 (all C all D1 all D2 all O2 all RD all RO all ID all IC1 all IC2 all NC (rdn_digit_add(rdnn(IC1),rdnn(IC2),rdnn(NC),rdnn(n0)) & rdn_non_zero(O2) & rdn_non_zero(RO) & rdn_add_with_carry(rdnn(NC),rdnn(n0),O2,RO) & rdn_digit_add(rdnn(ID),rdnn(C),rdnn(RD),rdnn(IC2)) & rdn_digit_add(rdnn(D1),rdnn(D2),rdnn(ID),rdnn(IC1)) -> rdn_add_with_carry(rdnn(C),rdnn(D1),rdn(rdnn(D2),O2),rdn(rdnn(RD),RO)))) # label(add_digit_rdn_rdn) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	17 (all X all Y all Z all RDN_X all RDN_Y all RDN_Z (rdn_translate(X,rdn_pos(RDN_X)) & rdn_translate(Y,rdn_neg(RDN_Y)) & rdn_positive_less(RDN_Y,RDN_X) & rdn_add_with_carry(rdnn(n0),RDN_Y,RDN_Z,RDN_X) & rdn_translate(Z,rdn_pos(RDN_Z)) -> sum(X,Y,Z))) # label(sum_entry_point_pos_neg_2) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	18 (all C all D1 all D2 all RD all ID (rdn_digit_add(rdnn(ID),rdnn(C),rdnn(RD),rdnn(n0)) & rdn_digit_add(rdnn(D1),rdnn(D2),rdnn(ID),rdnn(n0)) -> rdn_add_with_carry(rdnn(C),rdnn(D1),rdnn(D2),rdnn(RD)))) # label(add_digit_digit_digit) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	19 (all C all D1 all D2 all ID all RD all IC1 all IC2 (rdn_digit_add(rdnn(D1),rdnn(D2),rdnn(ID),rdnn(IC1)) & rdn_digit_add(rdnn(ID),rdnn(C),rdnn(RD),rdnn(IC2)) & rdn_digit_add(rdnn(IC1),rdnn(IC2),rdnn(n1),rdnn(n0)) -> rdn_add_with_carry(rdnn(C),rdnn(D1),rdnn(D2),rdn(rdnn(RD),rdnn(n1))))) # label(add_digit_digit_rdn) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	20 (all X all Y all Z1 all Z2 (sum(X,Y,Z1) & sum(X,Y,Z2) -> Z1 = Z2)) # label(unique_sum) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	21 (all X all Y1 all Y2 all Z (sum(X,Y2,Z) & sum(X,Y1,Z) -> Y2 = Y1)) # label(unique_RHS) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	22 (all X1 all X2 all Y all Z (sum(X2,Y,Z) & sum(X1,Y,Z) -> X1 = X2)) # label(unique_LHS) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	23 (all POS_X all NEG_X all RDN_X (rdn_translate(POS_X,rdn_pos(RDN_X)) & rdn_translate(NEG_X,rdn_neg(RDN_X)) -> sum(POS_X,NEG_X,n0))) # label(sum_entry_point_posx_negx) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	24 (all X all Y all Z (sum(Y,Z,X) <-> difference(X,Y,Z))) # label(minus_entry_point) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	25 (all C all D1 all O1 all D2 all RD all RO (rdn_add_with_carry(rdnn(C),rdnn(D2),rdn(rdnn(D1),O1),rdn(rdnn(RD),RO)) -> rdn_add_with_carry(rdnn(C),rdn(rdnn(D1),O1),rdnn(D2),rdn(rdnn(RD),RO)))) # label(add_rdn_digit_rdn) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	26 (all X all Y all Z all RDN_X all RDN_Y all RDN_Z (rdn_translate(Y,rdn_neg(RDN_Y)) & rdn_add_with_carry(rdnn(n0),RDN_X,RDN_Y,RDN_Z) & rdn_translate(Z,rdn_neg(RDN_Z)) & rdn_translate(X,rdn_neg(RDN_X)) -> sum(X,Y,Z))) # label(sum_entry_point_neg_neg) # label(axiom) # label(non_clause).  [assumption].
0.42/1.02	27 (all C all D1 all O1 all D2 all O2 all RD all RO all ID all IC1 all IC2 all RC (rdn_digit_add(rdnn(D1),rdnn(D2),rdnn(ID),rdnn(IC1)) & rdn_digit_add(rdAlarm clock 
179.79/180.05	Prover9 interrupted
179.79/180.05	EOF