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