0.04/0.07	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.08	% Command    : tptp2X_and_run_prover9 %d %s
0.06/0.27	% Computer   : n013.cluster.edu
0.06/0.27	% Model      : x86_64 x86_64
0.06/0.27	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.06/0.27	% Memory     : 8042.1875MB
0.06/0.27	% OS         : Linux 3.10.0-693.el7.x86_64
0.06/0.28	% CPULimit   : 960
0.06/0.28	% DateTime   : Thu Jul  2 06:49:18 EDT 2020
0.06/0.28	% CPUTime    : 
0.57/0.88	============================== Prover9 ===============================
0.57/0.88	Prover9 (32) version 2009-11A, November 2009.
0.57/0.88	Process 12281 was started by sandbox2 on n013.cluster.edu,
0.57/0.88	Thu Jul  2 06:49:19 2020
0.57/0.88	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_12121_n013.cluster.edu".
0.57/0.88	============================== end of head ===========================
0.57/0.88	
0.57/0.88	============================== INPUT =================================
0.57/0.88	
0.57/0.88	% Reading from file /tmp/Prover9_12121_n013.cluster.edu
0.57/0.88	
0.57/0.88	set(prolog_style_variables).
0.57/0.88	set(auto2).
0.57/0.88	    % set(auto2) -> set(auto).
0.57/0.88	    % set(auto) -> set(auto_inference).
0.57/0.88	    % set(auto) -> set(auto_setup).
0.57/0.88	    % set(auto_setup) -> set(predicate_elim).
0.57/0.88	    % set(auto_setup) -> assign(eq_defs, unfold).
0.57/0.88	    % set(auto) -> set(auto_limits).
0.57/0.88	    % set(auto_limits) -> assign(max_weight, "100.000").
0.57/0.88	    % set(auto_limits) -> assign(sos_limit, 20000).
0.57/0.88	    % set(auto) -> set(auto_denials).
0.57/0.88	    % set(auto) -> set(auto_process).
0.57/0.88	    % set(auto2) -> assign(new_constants, 1).
0.57/0.88	    % set(auto2) -> assign(fold_denial_max, 3).
0.57/0.88	    % set(auto2) -> assign(max_weight, "200.000").
0.57/0.88	    % set(auto2) -> assign(max_hours, 1).
0.57/0.88	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.57/0.88	    % set(auto2) -> assign(max_seconds, 0).
0.57/0.88	    % set(auto2) -> assign(max_minutes, 5).
0.57/0.88	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.57/0.88	    % set(auto2) -> set(sort_initial_sos).
0.57/0.88	    % set(auto2) -> assign(sos_limit, -1).
0.57/0.88	    % set(auto2) -> assign(lrs_ticks, 3000).
0.57/0.88	    % set(auto2) -> assign(max_megs, 400).
0.57/0.88	    % set(auto2) -> assign(stats, some).
0.57/0.88	    % set(auto2) -> clear(echo_input).
0.57/0.88	    % set(auto2) -> set(quiet).
0.57/0.88	    % set(auto2) -> clear(print_initial_clauses).
0.57/0.88	    % set(auto2) -> clear(print_given).
0.57/0.88	assign(lrs_ticks,-1).
0.57/0.88	assign(sos_limit,10000).
0.57/0.88	assign(order,kbo).
0.57/0.88	set(lex_order_vars).
0.57/0.88	clear(print_given).
0.57/0.88	
0.57/0.88	% formulas(sos).  % not echoed (12 formulas)
0.57/0.88	
0.57/0.88	============================== end of input ==========================
0.57/0.88	
0.57/0.88	% From the command line: assign(max_seconds, 960).
0.57/0.88	
0.57/0.88	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.57/0.88	
0.57/0.88	% Formulas that are not ordinary clauses:
0.57/0.88	1 (all X16 all X17 exists Y23 all X18 (r4(X16,X17,X18) & X18 = Y23 | -r4(X16,X17,X18) & Y23 != X18)) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.57/0.88	2 (all X6 ((exists Y19 (X6 = Y19 & r1(Y19))) | (exists Y1 exists Y11 (Y11 = X6 & r2(Y1,Y11))))) # label(axiom_6a) # label(axiom) # label(non_clause).  [assumption].
0.57/0.88	3 (all X11 exists Y21 all X12 (X12 = Y21 & r2(X11,X12) | -r2(X11,X12) & X12 != Y21)) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.57/0.88	4 (all X2 all X9 exists Y2 ((exists Y6 (r4(X2,X9,Y6) & r3(Y6,X2,Y2))) & (exists Y3 (Y2 = Y3 & (exists Y14 (r4(X2,Y14,Y3) & r2(X9,Y14))))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.57/0.88	5 (exists Y24 all X19 (r1(X19) & Y24 = X19 | Y24 != X19 & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.57/0.88	6 (all X5 exists Y8 ((exists Y17 (r4(X5,Y17,Y8) & r1(Y17))) & (exists Y18 (Y18 = Y8 & r1(Y18))))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
0.57/0.88	7 (all X13 all X14 exists Y22 all X15 (-r3(X13,X14,X15) & X15 != Y22 | r3(X13,X14,X15) & Y22 = X15)) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
0.57/0.88	8 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (Y10 != Y20 | -r1(Y20))))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.57/0.88	9 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r3(X1,Y15,Y5) & r2(X8,Y15))) & Y4 = Y5)) & (exists Y7 (r3(X1,X8,Y7) & r2(Y7,Y4))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.57/0.88	10 (all X3 all X10 (X10 = X3 | (all Y12 (-r2(X10,Y12) | (all Y13 (-r2(X3,Y13) | Y13 != Y12)))))) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
0.57/0.88	11 (all X4 exists Y9 (X4 = Y9 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.57/0.88	12 -(exists Y1 exists Y2 exists Y3 (r3(Y1,Y2,Y3) & (exists Y4 (Y4 = Y3 & (exists Y5 ((exists Y6 ((exists Y7 (r1(Y7) & r2(Y7,Y6))) & r2(Y6,Y5))) & r2(Y5,Y4))))))) # label(xplusyeqthree) # label(negated_conjecture) # label(non_clause).  [assumption].
0.57/0.88	
0.57/0.88	============================== end of process non-clausal formulas ===
0.57/0.88	
0.57/0.88	============================== PROCESS INITIAL CLAUSES ===============
0.57/0.88	
0.57/0.88	============================== PREDICATE ELIMINATION =================
0.57/0.88	13 -r2(A,B) | C != B | -r1(C) # label(axiom_7a) # label(axiom).  [clausify(8)].
0.57/0.88	14 r1(f11(A)) # label(axiom_5a) # label(axiom).  [clausify(6)].
0.57/0.88	15 r1(f12(A)) # label(axiom_5a) # label(axiom).  [clausify(6)].
0.57/0.88	16 r1(f19(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
0.57/0.88	17 r1(f2(A)) | f4(A) = A # label(axiom_6a) # label(axiom).  [clausify(2)].
0.57/0.88	18 r1(f2(A)) | r2(f3(A),f4(A)) # label(axiom_6a) # label(axiom).  [clausify(2)].
0.57/0.88	Derived: -r2(A,B) | f11(C) != B.  [resolve(13,c,14,a)].
0.57/0.88	Derived: -r2(A,B) | f12(C) != B.  [resolve(13,c,15,a)].
0.57/0.88	Derived: -r2(A,B) | f19(C) != B.  [resolve(13,c,16,a)].
0.57/0.88	Derived: -r2(A,B) | f2(C) != B | f4(C) = C.  [resolve(13,c,17,a)].
0.57/0.88	Derived: -r2(A,B) | f2(C) != B | r2(f3(C),f4(C)).  [resolve(13,c,18,a)].
0.57/0.88	19 -r3(A,B,C) | D != C | -r1(E) | -r2(E,F) | -r2(F,V6) | -r2(V6,D) # label(xplusyeqthree) # label(negated_conjecture).  [clausify(12)].
0.57/0.88	Derived: -r3(A,B,C) | D != C | -r2(f11(E),F) | -r2(F,V6) | -r2(V6,D).  [resolve(19,c,14,a)].
0.57/0.88	Derived: -r3(A,B,C) | D != C | -r2(f12(E),F) | -r2(F,V6) | -r2(V6,D).  [resolve(19,c,15,a)].
0.57/0.88	Derived: -r3(A,B,C) | D != C | -r2(f19(E),F) | -r2(F,V6) | -r2(V6,D).  [resolve(19,c,16,a)].
0.57/0.88	Derived: -r3(A,B,C) | D != C | -r2(f2(E),F) | -r2(F,V6) | -r2(V6,D) | f4(E) = E.  [resolve(19,c,17,a)].
0.57/0.88	Derived: -r3(A,B,C) | D != C | -r2(f2(E),F) | -r2(F,V6) | -r2(V6,D) | r2(f3(E),f4(E)).  [resolve(19,c,18,a)].
0.57/0.88	20 r1(A) | A != c1 # label(axiom_1) # label(axiom).  [clausify(5)].
0.57/0.88	Derived: A != c1 | -r2(B,C) | A != C.  [resolve(20,a,13,c)].
0.57/0.88	Derived: A != c1 | -r3(B,C,D) | E != D | -r2(A,F) | -r2(F,V6) | -r2(V6,E).  [resolve(20,a,19,c)].
0.57/0.88	21 A = c1 | -r1(A) # label(axiom_1) # label(axiom).  [clausify(5)].
0.57/0.88	Derived: f11(A) = c1.  [resolve(21,b,14,a)].
0.57/0.88	Derived: f12(A) = c1.  [resolve(21,b,15,a)].
0.57/0.88	Derived: f19(A) = c1.  [resolve(21,b,16,a)].
0.57/0.88	Derived: f2(A) = c1 | f4(A) = A.  [resolve(21,b,17,a)].
0.57/0.88	Derived: f2(A) = c1 | r2(f3(A),f4(A)).  [resolve(21,b,18,a)].
0.57/0.88	22 A = f1(B,C) | -r4(B,C,A) # label(axiom_4) # label(axiom).  [clausify(1)].
0.57/0.88	23 r4(A,B,f7(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
0.57/0.88	24 r4(A,f11(A),f10(A)) # label(axiom_5a) # label(axiom).  [clausify(6)].
0.57/0.88	25 r4(A,f9(A,B),f8(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
0.57/0.88	26 r4(A,B,C) | C != f1(A,B) # label(axiom_4) # label(axiom).  [clausify(1)].
0.57/0.88	Derived: f7(A,B) = f1(A,B).  [resolve(22,b,23,a)].
0.57/0.88	Derived: f10(A) = f1(A,f11(A)).  [resolve(22,b,24,a)].
0.57/0.88	Derived: f8(A,B) = f1(A,f9(A,B)).  [resolve(22,b,25,a)].
0.57/0.88	27 -r3(A,B,C) | C = f13(A,B) # label(axiom_3) # label(axiom).  [clausify(7)].
0.57/0.88	28 r3(A,B,f17(A,B)) # label(axiom_1a) # label(axiom).  [clausify(9)].
0.57/0.88	29 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
0.57/0.88	30 r3(f7(A,B),A,f6(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
0.57/0.88	31 r3(A,f16(A,B),f15(A,B)) # label(axiom_1a) # label(axiom).  [clausify(9)].
0.57/0.88	Derived: f17(A,B) = f13(A,B).  [resolve(27,a,28,a)].
0.57/0.88	Derived: f18(A) = f13(A,f19(A)).  [resolve(27,a,29,a)].
0.57/0.88	Derived: f6(A,B) = f13(f7(A,B),A).  [resolve(27,a,30,a)].
0.57/0.88	Derived: f15(A,B) = f13(A,f16(A,B)).  [resolve(27,a,31,a)].
0.57/0.88	32 A != f13(B,C) | r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(7)].
0.57/0.88	33 -r3(A,B,C) | D != C | -r2(f11(E),F) | -r2(F,V6) | -r2(V6,D).  [resolve(19,c,14,a)].
0.57/0.88	Derived: A != f17(B,C) | -r2(f11(D),E) | -r2(E,F) | -r2(F,A).  [resolve(33,a,28,a)].
0.57/0.88	Derived: A != f18(B) | -r2(f11(C),D) | -r2(D,E) | -r2(E,A).  [resolve(33,a,29,a)].
0.57/0.88	Derived: A != f6(B,C) | -r2(f11(D),E) | -r2(E,F) | -r2(F,A).  [resolve(33,a,30,a)].
0.57/0.88	Derived: A != f15(B,C) | -r2(f11(D),E) | -r2(E,F) | -r2(F,A).  [resolve(33,a,31,a)].
0.57/0.88	Derived: A != B | -r2(f11(C),D) | -r2(D,E) | -r2(E,A) | B != f13(F,V6).  [resolve(33,a,32,b)].
0.57/0.88	34 -r3(A,B,C) | D != C | -r2(f12(E),F) | -r2(F,V6) | -r2(V6,D).  [resolve(19,c,15,a)].
0.57/0.88	Derived: A != f17(B,C) | -r2(f12(D),E) | -r2(E,F) | -r2(F,A).  [resolve(34,a,28,a)].
0.57/0.90	Derived: A != f18(B) | -r2(f12(C),D) | -r2(D,E) | -r2(E,A).  [resolve(34,a,29,a)].
0.57/0.90	Derived: A != f6(B,C) | -r2(f12(D),E) | -r2(E,F) | -r2(F,A).  [resolve(34,a,30,a)].
0.57/0.90	Derived: A != f15(B,C) | -r2(f12(D),E) | -r2(E,F) | -r2(F,A).  [resolve(34,a,31,a)].
0.57/0.90	Derived: A != B | -r2(f12(C),D) | -r2(D,E) | -r2(E,A) | B != f13(F,V6).  [resolve(34,a,32,b)].
0.57/0.90	35 -r3(A,B,C) | D != C | -r2(f19(E),F) | -r2(F,V6) | -r2(V6,D).  [resolve(19,c,16,a)].
0.57/0.90	Derived: A != f17(B,C) | -r2(f19(D),E) | -r2(E,F) | -r2(F,A).  [resolve(35,a,28,a)].
0.57/0.90	Derived: A != f18(B) | -r2(f19(C),D) | -r2(D,E) | -r2(E,A).  [resolve(35,a,29,a)].
0.57/0.90	Derived: A != f6(B,C) | -r2(f19(D),E) | -r2(E,F) | -r2(F,A).  [resolve(35,a,30,a)].
0.57/0.90	Derived: A != f15(B,C) | -r2(f19(D),E) | -r2(E,F) | -r2(F,A).  [resolve(35,a,31,a)].
0.57/0.90	Derived: A != B | -r2(f19(C),D) | -r2(D,E) | -r2(E,A) | B != f13(F,V6).  [resolve(35,a,32,b)].
0.57/0.90	36 -r3(A,B,C) | D != C | -r2(f2(E),F) | -r2(F,V6) | -r2(V6,D) | f4(E) = E.  [resolve(19,c,17,a)].
0.57/0.90	Derived: A != f17(B,C) | -r2(f2(D),E) | -r2(E,F) | -r2(F,A) | f4(D) = D.  [resolve(36,a,28,a)].
0.57/0.90	Derived: A != f18(B) | -r2(f2(C),D) | -r2(D,E) | -r2(E,A) | f4(C) = C.  [resolve(36,a,29,a)].
0.57/0.90	Derived: A != f6(B,C) | -r2(f2(D),E) | -r2(E,F) | -r2(F,A) | f4(D) = D.  [resolve(36,a,30,a)].
0.57/0.90	Derived: A != f15(B,C) | -r2(f2(D),E) | -r2(E,F) | -r2(F,A) | f4(D) = D.  [resolve(36,a,31,a)].
0.57/0.90	Derived: A != B | -r2(f2(C),D) | -r2(D,E) | -r2(E,A) | f4(C) = C | B != f13(F,V6).  [resolve(36,a,32,b)].
0.57/0.90	37 -r3(A,B,C) | D != C | -r2(f2(E),F) | -r2(F,V6) | -r2(V6,D) | r2(f3(E),f4(E)).  [resolve(19,c,18,a)].
0.57/0.90	Derived: A != f17(B,C) | -r2(f2(D),E) | -r2(E,F) | -r2(F,A) | r2(f3(D),f4(D)).  [resolve(37,a,28,a)].
0.57/0.90	Derived: A != f18(B) | -r2(f2(C),D) | -r2(D,E) | -r2(E,A) | r2(f3(C),f4(C)).  [resolve(37,a,29,a)].
0.57/0.90	Derived: A != f6(B,C) | -r2(f2(D),E) | -r2(E,F) | -r2(F,A) | r2(f3(D),f4(D)).  [resolve(37,a,30,a)].
0.57/0.90	Derived: A != f15(B,C) | -r2(f2(D),E) | -r2(E,F) | -r2(F,A) | r2(f3(D),f4(D)).  [resolve(37,a,31,a)].
0.57/0.90	Derived: A != B | -r2(f2(C),D) | -r2(D,E) | -r2(E,A) | r2(f3(C),f4(C)) | B != f13(F,V6).  [resolve(37,a,32,b)].
0.57/0.90	38 A != c1 | -r3(B,C,D) | E != D | -r2(A,F) | -r2(F,V6) | -r2(V6,E).  [resolve(20,a,19,c)].
0.57/0.90	Derived: A != c1 | B != f17(C,D) | -r2(A,E) | -r2(E,F) | -r2(F,B).  [resolve(38,b,28,a)].
0.57/0.90	Derived: A != c1 | B != f18(C) | -r2(A,D) | -r2(D,E) | -r2(E,B).  [resolve(38,b,29,a)].
0.57/0.90	Derived: A != c1 | B != f6(C,D) | -r2(A,E) | -r2(E,F) | -r2(F,B).  [resolve(38,b,30,a)].
0.57/0.90	Derived: A != c1 | B != f15(C,D) | -r2(A,E) | -r2(E,F) | -r2(F,B).  [resolve(38,b,31,a)].
0.57/0.90	Derived: A != c1 | B != C | -r2(A,D) | -r2(D,E) | -r2(E,B) | C != f13(F,V6).  [resolve(38,b,32,b)].
0.57/0.90	
0.57/0.90	============================== end predicate elimination =============
0.57/0.90	
0.57/0.90	Auto_denials:  (non-Horn, no changes).
0.57/0.90	
0.57/0.90	Term ordering decisions:
0.57/0.90	Function symbol KB weights:  c1=1. f1=1. f6=1. f7=1. f8=1. f9=1. f13=1. f14=1. f15=1. f16=1. f17=1. f2=1. f3=1. f4=1. f5=1. f10=1. f11=1. f12=1. f18=1. f19=1.
0.57/0.90	
0.57/0.90	============================== end of process initial clauses ========
0.57/0.90	
0.57/0.90	============================== CLAUSES FOR SEARCH ====================
0.57/0.90	
0.57/0.90	============================== end of clauses for search =============
0.57/0.90	
0.57/0.90	============================== SEARCH ================================
0.57/0.90	
0.57/0.90	% Starting search at 0.01 seconds.
0.57/0.90	
0.57/0.90	============================== PROOF =================================
0.57/0.90	% SZS status Theorem
0.57/0.90	% SZS output start Refutation
0.57/0.90	
0.57/0.90	% Proof 1 at 0.03 (+ 0.00) seconds.
0.57/0.90	% Length of proof is 30.
0.57/0.90	% Level of proof is 7.
0.57/0.90	% Maximum clause weight is 17.000.
0.57/0.90	% Given clauses 61.
0.57/0.90	
0.57/0.90	3 (all X11 exists Y21 all X12 (X12 = Y21 & r2(X11,X12) | -r2(X11,X12) & X12 != Y21)) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.57/0.90	5 (exists Y24 all X19 (r1(X19) & Y24 = X19 | Y24 != X19 & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.57/0.90	7 (all X13 all X14 exists Y22 all X15 (-r3(X13,X14,X15) & X15 != Y22 | r3(X13,X14,X15) & Y22 = X15)) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
0.57/0.90	9 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r3(X1,Y15,Y5) & r2(X8,Y15))) & Y4 = Y5)) & (exists Y7 (r3(X1,X8,Y7) & r2(Y7,Y4))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.57/0.90	11 (all X4 exists Y9 (X4 = Y9 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.57/0.90	12 -(exists Y1 exists Y2 exists Y3 (r3(Y1,Y2,Y3) & (exists Y4 (Y4 = Y3 & (exists Y5 ((exists Y6 ((exists Y7 (r1(Y7) & r2(Y7,Y6))) & r2(Y6,Y5))) & r2(Y5,Y4))))))) # label(xplusyeqthree) # label(negated_conjecture) # label(non_clause).  [assumption].
0.57/0.90	16 r1(f19(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
0.57/0.90	19 -r3(A,B,C) | D != C | -r1(E) | -r2(E,F) | -r2(F,V6) | -r2(V6,D) # label(xplusyeqthree) # label(negated_conjecture).  [clausify(12)].
0.57/0.90	20 r1(A) | A != c1 # label(axiom_1) # label(axiom).  [clausify(5)].
0.57/0.90	21 A = c1 | -r1(A) # label(axiom_1) # label(axiom).  [clausify(5)].
0.57/0.90	27 -r3(A,B,C) | C = f13(A,B) # label(axiom_3) # label(axiom).  [clausify(7)].
0.57/0.90	28 r3(A,B,f17(A,B)) # label(axiom_1a) # label(axiom).  [clausify(9)].
0.57/0.90	29 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
0.57/0.90	31 r3(A,f16(A,B),f15(A,B)) # label(axiom_1a) # label(axiom).  [clausify(9)].
0.57/0.90	38 A != c1 | -r3(B,C,D) | E != D | -r2(A,F) | -r2(F,V6) | -r2(V6,E).  [resolve(20,a,19,c)].
0.57/0.90	39 f18(A) = A # label(axiom_4a) # label(axiom).  [clausify(11)].
0.57/0.90	44 f15(A,B) = f14(A,B) # label(axiom_1a) # label(axiom).  [clausify(9)].
0.57/0.90	45 r2(f17(A,B),f14(A,B)) # label(axiom_1a) # label(axiom).  [clausify(9)].
0.57/0.90	50 r2(A,B) | B != f5(A) # label(axiom_2) # label(axiom).  [clausify(3)].
0.57/0.90	51 r2(A,B) | f5(A) != B.  [copy(50),flip(b)].
0.57/0.90	64 f19(A) = c1.  [resolve(21,b,16,a)].
0.57/0.90	72 f17(A,B) = f13(A,B).  [resolve(27,a,28,a)].
0.57/0.90	73 f18(A) = f13(A,f19(A)).  [resolve(27,a,29,a)].
0.57/0.90	74 f13(A,c1) = A.  [copy(73),rewrite([39(1),64(1)]),flip(a)].
0.57/0.90	122 A != c1 | B != f15(C,D) | -r2(A,E) | -r2(E,F) | -r2(F,B).  [resolve(38,b,31,a)].
0.57/0.90	123 c1 != A | f14(B,C) != D | -r2(A,E) | -r2(E,F) | -r2(F,D).  [copy(122),rewrite([44(3)]),flip(a),flip(b)].
0.57/0.90	129 r2(f13(A,B),f14(A,B)).  [back_rewrite(45),rewrite([72(1)])].
0.57/0.90	285 -r2(f14(c1,c1),f13(A,B)).  [ur(123,a,74,a(flip),b,xx,c,129,a,e,129,a)].
0.57/0.90	322 f13(A,B) != f5(f14(c1,c1)).  [ur(51,a,285,a),flip(a)].
0.57/0.90	323 $F.  [resolve(322,a,74,a)].
0.57/0.90	
0.57/0.90	% SZS output end Refutation
0.57/0.90	============================== end of proof ==========================
0.57/0.90	
0.57/0.90	============================== STATISTICS ============================
0.57/0.90	
0.57/0.90	Given=61. Generated=501. Kept=244. proofs=1.
0.57/0.90	Usable=59. Sos=134. Demods=18. Limbo=0, Disabled=136. Hints=0.
0.57/0.90	Megabytes=0.28.
0.57/0.90	User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
0.57/0.90	
0.57/0.90	============================== end of statistics =====================
0.57/0.90	
0.57/0.90	============================== end of search =========================
0.57/0.90	
0.57/0.90	THEOREM PROVED
0.57/0.90	% SZS status Theorem
0.57/0.90	
0.57/0.90	Exiting with 1 proof.
0.57/0.90	
0.57/0.90	Process 12281 exit (max_proofs) Thu Jul  2 06:49:19 2020
0.57/0.90	Prover9 interrupted
0.57/0.90	EOF