0.07/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n010.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   : 180
0.12/0.33	% DateTime   : Thu Aug 29 12:54:21 EDT 2019
0.12/0.33	% CPUTime    : 
0.84/1.09	============================== Prover9 ===============================
0.84/1.09	Prover9 (32) version 2009-11A, November 2009.
0.84/1.09	Process 31982 was started by sandbox2 on n010.cluster.edu,
0.84/1.09	Thu Aug 29 12:54:22 2019
0.84/1.09	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_31814_n010.cluster.edu".
0.84/1.09	============================== end of head ===========================
0.84/1.09	
0.84/1.09	============================== INPUT =================================
0.84/1.09	
0.84/1.09	% Reading from file /tmp/Prover9_31814_n010.cluster.edu
0.84/1.09	
0.84/1.09	set(prolog_style_variables).
0.84/1.09	set(auto2).
0.84/1.09	    % set(auto2) -> set(auto).
0.84/1.09	    % set(auto) -> set(auto_inference).
0.84/1.09	    % set(auto) -> set(auto_setup).
0.84/1.09	    % set(auto_setup) -> set(predicate_elim).
0.84/1.09	    % set(auto_setup) -> assign(eq_defs, unfold).
0.84/1.09	    % set(auto) -> set(auto_limits).
0.84/1.09	    % set(auto_limits) -> assign(max_weight, "100.000").
0.84/1.09	    % set(auto_limits) -> assign(sos_limit, 20000).
0.84/1.09	    % set(auto) -> set(auto_denials).
0.84/1.09	    % set(auto) -> set(auto_process).
0.84/1.09	    % set(auto2) -> assign(new_constants, 1).
0.84/1.09	    % set(auto2) -> assign(fold_denial_max, 3).
0.84/1.09	    % set(auto2) -> assign(max_weight, "200.000").
0.84/1.09	    % set(auto2) -> assign(max_hours, 1).
0.84/1.09	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.84/1.09	    % set(auto2) -> assign(max_seconds, 0).
0.84/1.09	    % set(auto2) -> assign(max_minutes, 5).
0.84/1.09	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.84/1.09	    % set(auto2) -> set(sort_initial_sos).
0.84/1.09	    % set(auto2) -> assign(sos_limit, -1).
0.84/1.09	    % set(auto2) -> assign(lrs_ticks, 3000).
0.84/1.09	    % set(auto2) -> assign(max_megs, 400).
0.84/1.09	    % set(auto2) -> assign(stats, some).
0.84/1.09	    % set(auto2) -> clear(echo_input).
0.84/1.09	    % set(auto2) -> set(quiet).
0.84/1.09	    % set(auto2) -> clear(print_initial_clauses).
0.84/1.09	    % set(auto2) -> clear(print_given).
0.84/1.09	assign(lrs_ticks,-1).
0.84/1.09	assign(sos_limit,10000).
0.84/1.09	assign(order,kbo).
0.84/1.09	set(lex_order_vars).
0.84/1.09	clear(print_given).
0.84/1.09	
0.84/1.09	% formulas(sos).  % not echoed (402 formulas)
0.84/1.09	
0.84/1.09	============================== end of input ==========================
0.84/1.09	
0.84/1.09	% From the command line: assign(max_seconds, 180).
0.84/1.09	
0.84/1.09	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.84/1.09	
0.84/1.09	% Formulas that are not ordinary clauses:
0.84/1.09	1 (all X all Y all RDN_X all RDN_Y (rdn_translate(X,rdn_neg(RDN_X)) & rdn_translate(Y,rdn_neg(RDN_Y)) & rdn_positive_less(RDN_Y,RDN_X) -> less(X,Y))) # label(less_entry_point_neg_neg) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	2 (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.84/1.09	3 (all X all Y all Z (rdn_positive_less(rdnn(X),rdnn(Y)) & rdn_positive_less(rdnn(Y),rdnn(Z)) -> rdn_positive_less(rdnn(X),rdnn(Z)))) # label(rdn_positive_less_transitivity) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	4 (all X all Y (less(X,Y) <-> -less(Y,X) & X != Y)) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	5 (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.84/1.09	6 (all X all Y (less_or_equal(X,Y) <-> X = Y | less(X,Y))) # label(less_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	7 (all X all Y all Z (sum(X,n1,Y) & less(Z,Y) -> less_or_equal(Z,X))) # label(less_successor) # label(axiom) # label(non_clause).  [assumption].
0.84/1.09	8 (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.84/1.09	9 (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.84/1.09	10 (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.84/1.09	11 (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.84/1.10	12 (all X all Y all RDN_X all RDN_Y (rdn_translate(X,rdn_pos(RDN_X)) & rdn_positive_less(RDN_X,RDN_Y) & rdn_translate(Y,rdn_pos(RDN_Y)) -> less(X,Y))) # label(less_entry_point_pos_pos) # label(axiom) # label(non_clause).  [assumption].
0.84/1.10	13 (all X all Y all Z all RDN_X all RDN_Y all RDN_Z (rdn_positive_less(RDN_Y,RDN_X) & rdn_translate(Z,rdn_pos(RDN_Z)) & rdn_add_with_carry(rdnn(n0),RDN_Y,RDN_Z,RDN_X) & rdn_translate(Y,rdn_neg(RDN_Y)) & rdn_translate(X,rdn_pos(RDN_X)) -> sum(X,Y,Z))) # label(sum_entry_point_pos_neg_2) # label(axiom) # label(non_clause).  [assumption].
0.84/1.10	14 (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_Z,RDN_Y) & rdn_translate(Z,rdn_neg(RDN_Z)) & rdn_positive_less(RDN_X,RDN_Y) & rdn_translate(X,rdn_pos(RDN_X)) -> sum(X,Y,Z))) # label(sum_entry_point_pos_neg_1) # label(axiom) # label(non_clause).  [assumption].
0.84/1.10	15 (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.84/1.10	16 (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.84/1.10	17 (all C all D1 all D2 all ID all RD all IC1 all IC2 (rdn_digit_add(rdnn(IC1),rdnn(IC2),rdnn(n1),rdnn(n0)) & 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),rdnn(D2),rdn(rdnn(RD),rdnn(n1))))) # label(add_digit_digit_rdn) # label(axiom) # label(non_clause).  [assumption].
0.84/1.10	18 (all X all Y all Z all RDN_X all RDN_Y all RDN_Z (rdn_translate(Y,rdn_pos(RDN_Y)) & rdn_translate(Z,rdn_pos(RDN_Z)) & rdn_add_with_carry(rdnn(n0),RDN_X,RDN_Y,RDN_Z) & rdn_translate(X,rdn_pos(RDN_X)) -> sum(X,Y,Z))) # label(sum_entry_point_pos_pos) # label(axiom) # label(non_clause).  [assumption].
0.84/1.10	19 (all X all Y all Z all RDN_X all RDN_Y all RDN_Z (rdn_translate(X,rdn_neg(RDN_X)) & rdn_add_with_carry(rdnn(n0),RDN_X,RDN_Y,RDN_Z) & rdn_translate(Z,rdn_neg(RDN_Z)) & rdn_translate(Y,rdn_neg(RDN_Y)) -> sum(X,Y,Z))) # label(sum_entry_point_neg_neg) # label(axiom) # label(non_clause).  [assumption].
0.84/1.10	20 (all X all Y all Z all RDN_X all RDN_Y (rdn_translate(X,rdn_neg(RDN_X)) & sum(Y,X,Z) & rdn_translate(Y,rdn_pos(RDN_Y)) -> sum(X,Y,Z))) # label(sum_entry_point_neg_pos) # label(axiom) # label(non_clause).  [assumption].
0.84/1.10	21 (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.84/1.10	22 (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.84/1.10	23 (all X all Y all Z (difference(X,Y,Z) <-> sum(Y,Z,X))) # label(minus_entry_point) # label(axiom) # label(non_clause).  [assumption].
0.84/1.10	24 (all C all D1 all D2 all O2 all RD all RO all ID all IC1 all IC2 all NC (rdn_digit_add(rdnn(ID),rdnn(C),rdnn(RD),rdnn(IC2)) & rdn_digit_add(rdnn(IC1),rdnn(IC2),rdnn(NC),rdnn(n0)) & rdn_add_with_carry(rdnn(NC),rdnn(n0),O2,RO) & rdn_non_zero(O2) & rdn_non_zero(RO) & 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.84/1.10	25 (all X all Y1 all Y2 all Z (sum(X,Y2,Z) & sum(X,Y1,Z) -> Y1 = Y2)) # label(unique_RHS) # label(axiom) # label(non_clause).  [assumption].
0.84/1.10	26 (all X all Y all Z1 all Z2 (sum(X,Y,Z1) & sum(X,Y,Z2) -> Z2 = Z1)) # label(unique_sum) # label(axiom) # label(non_clause).  [assumption].
0.84/1.10	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(ID),rdnn(C),rdnn(RD),rdnn(IC2)) & rdn_add_with_carry(rdnn(RC),O1,O2,RO) & rdn_non_zero(O1) & rdn_non_zero(RO) & rdn_non_zero(O2) & rdn_digit_add(rdnn(IC1),rdnn(IC2),rdnn(RC),rdnn(n0)) & rdn_digit_add(rdnn(D1),rdnn(D2),rdnn(ID),rdnn(IC1)) -> rdn_add_with_carry(rdnn(C),rdn(rdnn(D1),O1),rdn(rdnn(D2),O2),rdn(rdnn(RD),RO)))) # label(add_rdn_rdn_rdn) # label(axiom) # label(non_clause).  [assumption].
42.13/42.40	28 -(all X (sum(n2,X,n5) -> n3 = X)) # label(sumn2_only_n3_n5) # label(negated_conjecture) # label(non_clause).  [assumption].
42.13/42.40	
42.13/42.40	============================== end of process non-clausal formulas ===
42.13/42.40	
42.13/42.40	============================== PROCESS INITIAL CLAUSES ===============
42.13/42.40	
42.13/42.40	============================== PREDICATE ELIMINATION =================
42.13/42.40	29 less_or_equal(A,B) | B != A # label(less_or_equal) # label(axiom).  [clausify(6)].
42.13/42.40	30 -less_or_equal(A,B) | B = A | less(A,B) # label(less_or_equal) # label(axiom).  [clausify(6)].
42.13/42.40	31 less_or_equal(A,B) | -less(A,B) # label(less_or_equal) # label(axiom).  [clausify(6)].
42.13/42.40	32 -sum(A,n1,B) | -less(C,B) | less_or_equal(C,A) # label(less_successor) # label(axiom).  [clausify(7)].
42.13/42.40	Derived: -sum(A,n1,B) | -less(C,B) | A = C | less(C,A).  [resolve(32,c,30,a)].
42.13/42.40	33 difference(A,B,C) | -sum(B,C,A) # label(minus_entry_point) # label(axiom).  [clausify(23)].
42.13/42.40	34 -difference(A,B,C) | sum(B,C,A) # label(minus_entry_point) # label(axiom).  [clausify(23)].
42.13/42.40	
42.13/42.40	============================== end predicate elimination =============
42.13/42.40	
42.13/42.40	Auto_denials:  (non-Horn, no changes).
42.13/42.40	
42.13/42.40	Term ordering decisions:
42.13/42.40	Function symbol KB weights:  n1=1. n0=1. n2=1. n5=1. n3=1. n4=1. n6=1. n7=1. n8=1. n9=1. n10=1. n100=1. n101=1. n102=1. n103=1. n104=1. n105=1. n106=1. n107=1. n108=1. n109=1. n11=1. n110=1. n111=1. n112=1. n113=1. n114=1. n115=1. n116=1. n117=1. n118=1. n119=1. n12=1. n120=1. n121=1. n122=1. n123=1. n124=1. n125=1. n126=1. n127=1. n13=1. n14=1. n15=1. n16=1. n17=1. n18=1. n19=1. n20=1. n21=1. n22=1. n23=1. n24=1. n25=1. n26=1. n27=1. n28=1. n29=1. n30=1. n31=1. n32=1. n33=1. n34=1. n35=1. n36=1. n37=1. n38=1. n39=1. n40=1. n41=1. n42=1. n43=1. n44=1. n45=1. n46=1. n47=1. n48=1. n49=1. n50=1. n51=1. n52=1. n53=1. n54=1. n55=1. n56=1. n57=1. n58=1. n59=1. n60=1. n61=1. n62=1. n63=1. n64=1. n65=1. n66=1. n67=1. n68=1. n69=1. n70=1. n71=1. n72=1. n73=1. n74=1. n75=1. n76=1. n77=1. n78=1. n79=1. n80=1. n81=1. n82=1. n83=1. n84=1. n85=1. n86=1. n87=1. n88=1. n89=1. n90=1. n91=1. n92=1. n93=1. n94=1. n95=1. n96=1. n97=1. n98=1. n99=1. nn1=1. nn10=1. nn100=1. nn101=1. nn102=1. nn103=1. nn104=1. nn105=1. nn106=1. nn107=1. nn108=1. nn109=1. nn11=1. nn110=1. nn111=1. nn112=1. nn113=1. nn114=1. nn115=1. nn116=1. nn117=1. nn118=1. nn119=1. nn12=1. nn120=1. nn121=1. nn122=1. nn123=1. nn124=1. nn125=1. nn126=1. nn127=1. nn128=1. nn13=1. nn14=1. nn15=1. nn16=1. nn17=1. nn18=1. nn19=1. nn2=1. nn20=1. nn21=1. nn22=1. nn23=1. nn24=1. nn25=1. nn26=1. nn27=1. nn28=1. nn29=1. nn3=1. nn30=1. nn31=1. nn32=1. nn33=1. nn34=1. nn35=1. nn36=1. nn37=1. nn38=1. nn39=1. nn4=1. nn40=1. nn41=1. nn42=1. nn43=1. nn44=1. nn45=1. nn46=1. nn47=1. nn48=1. nn49=1. nn5=1. nn50=1. nn51=1. nn52=1. nn53=1. nn54=1. nn55=1. nn56=1. nn57=1. nn58=1. nn59=1. nn6=1. nn60=1. nn61=1. nn62=1. nn63=1. nn64=1. nn65=1. nn66=1. nn67=1. nn68=1. nn69=1. nn7=1. nn70=1. nn71=1. nn72=1. nn73=1. nn74=1. nn75=1. nn76=1. nn77=1. nn78=1. nn79=1. nn8=1. nn80=1. nn81=1. nn82=1. nn83=1. nn84=1. nn85=1. nn86=1. nn87=1. nn88=1. nn89=1. nn9=1. nn90=1. nn91=1. nn92=1. nn93=1. nn94=1. nn95=1. nn96=1. nn97=1. nn98=1. nn99=1. c1=1. rdn=1. rdnn=1. rdn_neg=1. rdn_pos=1.
42.13/42.40	
42.13/42.40	============================== end of process initial clauses ========
42.13/42.40	
42.13/42.40	============================== CLAUSES FOR SEARCH ====================
42.13/42.40	
42.13/42.40	============================== end of clauses for search =============
42.13/42.40	
42.13/42.40	============================== SEARCH ================================
42.13/42.40	
42.13/42.40	% Starting search at 0.13 seconds.
42.13/42.40	
42.13/42.40	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 0.42 sec).
42.13/42.40	
42.13/42.40	Low Water (keep): wt=3.000, iters=3406
42.13/42.40	
42.13/42.40	============================== PROOF =================================
42.13/42.40	% SZS status Theorem
42.13/42.40	% SZS output start Refutation
42.13/42.40	
42.13/42.40	% Proof 1 at 41.18 (+ 0.16) seconds.
42.13/42.40	% Length of proof is 22.
42.13/42.40	% Level of proof is 8.
42.13/42.40	% Maximum clause weight is 27.000.
42.13/42.40	% Given clauses 33708.
42.13/42.40	
42.13/42.40	18 (all X all Y all Z all RDN_X all RDN_Y all RDN_Z (rdn_translate(Y,rdn_pos(RDN_Y)) & rdn_translate(Z,rdn_pos(RDN_Z)) & rdn_add_with_carry(rdnn(n0),RDN_X,RDN_Y,RDN_Z) & rdn_translate(X,rdn_pos(RDN_X)) -> sum(X,Y,Z))) # label(sum_entry_point_pos_pos) # label(axiom) # label(non_clause).  [assumption].
42.13/42.40	21 (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].
42.13/42.40	25 (all X all Y1 all Y2 all Z (sum(X,Y2,Z) & sum(X,Y1,Z) -> Y1 = Y2)) # label(unique_RHS) # label(axiom) # label(non_clause).  [assumption].
42.13/42.40	28 -(all X (sum(n2,X,n5) -> n3 = X)) # label(sumn2_only_n3_n5) # label(negated_conjecture) # label(non_clause).  [assumption].
42.13/42.40	66 rdn_translate(n2,rdn_pos(rdnn(n2))) # label(rdn2) # label(axiom).  [assumption].
42.13/42.40	71 rdn_translate(n3,rdn_pos(rdnn(n3))) # label(rdn3) # label(axiom).  [assumption].
42.13/42.40	144 rdn_translate(n5,rdn_pos(rdnn(n5))) # label(rdn5) # label(axiom).  [assumption].
42.13/42.40	329 rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)) # label(rdn_digit_add_n5_n0_n5_n0) # label(axiom).  [assumption].
42.13/42.40	357 rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)) # label(rdn_digit_add_n2_n3_n5_n0) # label(axiom).  [assumption].
42.13/42.40	373 -rdn_translate(A,rdn_pos(B)) | -rdn_translate(C,rdn_pos(D)) | -rdn_add_with_carry(rdnn(n0),E,B,D) | -rdn_translate(F,rdn_pos(E)) | sum(F,A,C) # label(sum_entry_point_pos_pos) # label(axiom).  [clausify(18)].
42.13/42.40	404 -rdn_digit_add(rdnn(A),rdnn(B),rdnn(C),rdnn(n0)) | -rdn_digit_add(rdnn(D),rdnn(E),rdnn(A),rdnn(n0)) | rdn_add_with_carry(rdnn(B),rdnn(D),rdnn(E),rdnn(C)) # label(add_digit_digit_digit) # label(axiom).  [clausify(21)].
42.13/42.40	421 -sum(A,B,C) | -sum(A,D,C) | B = D # label(unique_RHS) # label(axiom).  [clausify(25)].
42.13/42.40	435 sum(n2,c1,n5) # label(sumn2_only_n3_n5) # label(negated_conjecture).  [clausify(28)].
42.13/42.40	436 c1 != n3 # label(sumn2_only_n3_n5) # label(negated_conjecture).  [clausify(28)].
42.13/42.40	1013 -rdn_digit_add(rdnn(A),rdnn(B),rdnn(n5),rdnn(n0)) | rdn_add_with_carry(rdnn(n0),rdnn(A),rdnn(B),rdnn(n5)).  [resolve(404,a,329,a)].
42.13/42.40	1396 -sum(n2,A,n5) | c1 = A.  [resolve(435,a,421,b),flip(b)].
42.13/42.40	10335 rdn_add_with_carry(rdnn(n0),rdnn(n2),rdnn(n3),rdnn(n5)).  [resolve(1013,a,357,a)].
42.13/42.40	16881 -rdn_translate(A,rdn_pos(rdnn(n3))) | -rdn_translate(B,rdn_pos(rdnn(n5))) | -rdn_translate(C,rdn_pos(rdnn(n2))) | sum(C,A,B).  [resolve(10335,a,373,c)].
42.13/42.40	41677 -rdn_translate(A,rdn_pos(rdnn(n5))) | -rdn_translate(B,rdn_pos(rdnn(n2))) | sum(B,n3,A).  [resolve(16881,a,71,a)].
42.13/42.40	41797 -rdn_translate(A,rdn_pos(rdnn(n2))) | sum(A,n3,n5).  [resolve(41677,a,144,a)].
42.13/42.40	41799 sum(n2,n3,n5).  [resolve(41797,a,66,a)].
42.13/42.40	41800 $F.  [resolve(41799,a,1396,a),unit_del(a,436)].
42.13/42.40	
42.13/42.40	% SZS output end Refutation
42.13/42.40	============================== end of proof ==========================
42.13/42.40	
42.13/42.40	============================== STATISTICS ============================
42.13/42.40	
42.13/42.40	Given=33708. Generated=180448. Kept=41765. proofs=1.
42.13/42.40	Usable=33480. Sos=8056. Demods=0. Limbo=0, Disabled=638. Hints=0.
42.13/42.40	Megabytes=134.14.
42.13/42.40	User_CPU=41.18, System_CPU=0.16, Wall_clock=41.
42.13/42.40	
42.13/42.40	============================== end of statistics =====================
42.13/42.40	
42.13/42.40	============================== end of search =========================
42.13/42.40	
42.13/42.40	THEOREM PROVED
42.13/42.40	% SZS status Theorem
42.13/42.40	
42.13/42.40	Exiting with 1 proof.
42.13/42.40	
42.13/42.40	Process 31982 exit (max_proofs) Thu Aug 29 12:55:03 2019
42.13/42.40	Prover9 interrupted
42.13/42.41	EOF