TSTP Solution File: GRP594-1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : GRP594-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Sat Jul 16 11:19:46 EDT 2022

% Result   : Unsatisfiable 0.64s 0.95s
% Output   : Refutation 0.64s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : GRP594-1 : TPTP v8.1.0. Released v2.6.0.
% 0.00/0.10  % Command  : tptp2X_and_run_prover9 %d %s
% 0.10/0.30  % Computer : n007.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 600
% 0.10/0.30  % DateTime : Mon Jun 13 07:32:53 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.64/0.95  ============================== Prover9 ===============================
% 0.64/0.95  Prover9 (32) version 2009-11A, November 2009.
% 0.64/0.95  Process 16087 was started by sandbox on n007.cluster.edu,
% 0.64/0.95  Mon Jun 13 07:32:54 2022
% 0.64/0.95  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15933_n007.cluster.edu".
% 0.64/0.95  ============================== end of head ===========================
% 0.64/0.95  
% 0.64/0.95  ============================== INPUT =================================
% 0.64/0.95  
% 0.64/0.95  % Reading from file /tmp/Prover9_15933_n007.cluster.edu
% 0.64/0.95  
% 0.64/0.95  set(prolog_style_variables).
% 0.64/0.95  set(auto2).
% 0.64/0.95      % set(auto2) -> set(auto).
% 0.64/0.95      % set(auto) -> set(auto_inference).
% 0.64/0.95      % set(auto) -> set(auto_setup).
% 0.64/0.95      % set(auto_setup) -> set(predicate_elim).
% 0.64/0.95      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.64/0.95      % set(auto) -> set(auto_limits).
% 0.64/0.95      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.64/0.95      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.64/0.95      % set(auto) -> set(auto_denials).
% 0.64/0.95      % set(auto) -> set(auto_process).
% 0.64/0.95      % set(auto2) -> assign(new_constants, 1).
% 0.64/0.95      % set(auto2) -> assign(fold_denial_max, 3).
% 0.64/0.95      % set(auto2) -> assign(max_weight, "200.000").
% 0.64/0.95      % set(auto2) -> assign(max_hours, 1).
% 0.64/0.95      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.64/0.95      % set(auto2) -> assign(max_seconds, 0).
% 0.64/0.95      % set(auto2) -> assign(max_minutes, 5).
% 0.64/0.95      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.64/0.95      % set(auto2) -> set(sort_initial_sos).
% 0.64/0.95      % set(auto2) -> assign(sos_limit, -1).
% 0.64/0.95      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.64/0.95      % set(auto2) -> assign(max_megs, 400).
% 0.64/0.95      % set(auto2) -> assign(stats, some).
% 0.64/0.95      % set(auto2) -> clear(echo_input).
% 0.64/0.95      % set(auto2) -> set(quiet).
% 0.64/0.95      % set(auto2) -> clear(print_initial_clauses).
% 0.64/0.95      % set(auto2) -> clear(print_given).
% 0.64/0.95  assign(lrs_ticks,-1).
% 0.64/0.95  assign(sos_limit,10000).
% 0.64/0.95  assign(order,kbo).
% 0.64/0.95  set(lex_order_vars).
% 0.64/0.95  clear(print_given).
% 0.64/0.95  
% 0.64/0.95  % formulas(sos).  % not echoed (3 formulas)
% 0.64/0.95  
% 0.64/0.95  ============================== end of input ==========================
% 0.64/0.95  
% 0.64/0.95  % From the command line: assign(max_seconds, 300).
% 0.64/0.95  
% 0.64/0.95  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.64/0.95  
% 0.64/0.95  % Formulas that are not ordinary clauses:
% 0.64/0.95  
% 0.64/0.95  ============================== end of process non-clausal formulas ===
% 0.64/0.95  
% 0.64/0.95  ============================== PROCESS INITIAL CLAUSES ===============
% 0.64/0.95  
% 0.64/0.95  ============================== PREDICATE ELIMINATION =================
% 0.64/0.95  
% 0.64/0.95  ============================== end predicate elimination =============
% 0.64/0.95  
% 0.64/0.95  Auto_denials:
% 0.64/0.95    % copying label prove_these_axioms_2 to answer in negative clause
% 0.64/0.95  
% 0.64/0.95  Term ordering decisions:
% 0.64/0.95  
% 0.64/0.95  % Assigning unary symbol inverse kb_weight 0 and highest precedence (6).
% 0.64/0.95  Function symbol KB weights:  a2=1. b2=1. double_divide=1. multiply=1. inverse=0.
% 0.64/0.95  
% 0.64/0.95  ============================== end of process initial clauses ========
% 0.64/0.95  
% 0.64/0.95  ============================== CLAUSES FOR SEARCH ====================
% 0.64/0.95  
% 0.64/0.95  ============================== end of clauses for search =============
% 0.64/0.95  
% 0.64/0.95  ============================== SEARCH ================================
% 0.64/0.95  
% 0.64/0.95  % Starting search at 0.01 seconds.
% 0.64/0.95  
% 0.64/0.95  ============================== PROOF =================================
% 0.64/0.95  % SZS status Unsatisfiable
% 0.64/0.95  % SZS output start Refutation
% 0.64/0.95  
% 0.64/0.95  % Proof 1 at 0.04 (+ 0.00) seconds: prove_these_axioms_2.
% 0.64/0.95  % Length of proof is 85.
% 0.64/0.95  % Level of proof is 21.
% 0.64/0.95  % Maximum clause weight is 30.000.
% 0.64/0.95  % Given clauses 14.
% 0.64/0.95  
% 0.64/0.95  1 multiply(A,B) = inverse(double_divide(B,A)) # label(multiply) # label(axiom).  [assumption].
% 0.64/0.95  2 inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(C,B)))))) = C # label(single_axiom) # label(axiom).  [assumption].
% 0.64/0.95  3 multiply(multiply(inverse(b2),b2),a2) != a2 # label(prove_these_axioms_2) # label(negated_conjecture) # answer(prove_these_axioms_2).  [assumption].
% 0.64/0.95  4 inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))) != a2 # answer(prove_these_axioms_2).  [copy(3),rewrite([1(4),1(7)])].
% 0.64/0.95  5 inverse(double_divide(double_divide(A,inverse(double_divide(B,inverse(double_divide(C,D))))),inverse(double_divide(A,C)))) = double_divide(B,D).  [para(2(a,1),2(a,1,1,2,1,2))].
% 0.64/0.95  6 inverse(double_divide(double_divide(double_divide(A,B),inverse(double_divide(C,B))),C)) = A.  [para(2(a,1),2(a,1,1,2))].
% 0.64/0.95  7 inverse(double_divide(double_divide(A,inverse(double_divide(B,C))),inverse(double_divide(A,double_divide(D,E))))) = double_divide(B,inverse(double_divide(D,inverse(double_divide(C,E))))).  [para(5(a,1),2(a,1,1,2,1,2))].
% 0.64/0.95  8 inverse(double_divide(double_divide(double_divide(A,inverse(double_divide(B,inverse(double_divide(C,D))))),C),double_divide(B,D))) = A.  [para(5(a,1),2(a,1,1,2))].
% 0.64/0.95  16 double_divide(inverse(double_divide(double_divide(A,inverse(double_divide(B,C))),B)),C) = A.  [para(6(a,1),5(a,1)),flip(a)].
% 0.64/0.95  21 inverse(double_divide(double_divide(inverse(double_divide(double_divide(A,inverse(double_divide(B,inverse(double_divide(C,D))))),B)),D),inverse(A))) = C.  [para(16(a,1),2(a,1,1,2,1))].
% 0.64/0.95  24 inverse(double_divide(double_divide(A,inverse(B)),inverse(double_divide(A,C)))) = double_divide(inverse(double_divide(double_divide(B,inverse(double_divide(D,inverse(double_divide(C,E))))),D)),E).  [para(16(a,1),5(a,1,1,1,2,1))].
% 0.64/0.95  28 double_divide(double_divide(inverse(double_divide(A,B)),C),inverse(double_divide(B,C))) = A.  [para(5(a,1),16(a,1,1))].
% 0.64/0.95  33 inverse(double_divide(double_divide(A,inverse(double_divide(B,inverse(double_divide(C,D))))),B)) = double_divide(inverse(double_divide(A,C)),D).  [para(16(a,1),16(a,1,1,1,1)),flip(a)].
% 0.64/0.95  35 inverse(double_divide(double_divide(A,inverse(B)),inverse(double_divide(A,C)))) = double_divide(double_divide(inverse(double_divide(B,C)),D),D).  [back_rewrite(24),rewrite([33(13)])].
% 0.64/0.95  36 inverse(double_divide(double_divide(double_divide(inverse(double_divide(A,B)),C),C),inverse(A))) = B.  [back_rewrite(21),rewrite([33(7)])].
% 0.64/0.95  38 inverse(double_divide(double_divide(A,inverse(double_divide(B,C))),inverse(double_divide(A,inverse(D))))) = double_divide(inverse(double_divide(D,B)),C).  [para(28(a,1),2(a,1,1,2,1,2,1))].
% 0.64/0.95  46 double_divide(double_divide(A,B),inverse(double_divide(C,B))) = double_divide(double_divide(A,D),inverse(double_divide(C,D))).  [para(6(a,1),28(a,1,1,1))].
% 0.64/0.95  52 double_divide(double_divide(inverse(double_divide(A,double_divide(inverse(double_divide(B,C)),D))),inverse(double_divide(C,D))),inverse(B)) = A.  [para(28(a,1),28(a,1,2,1))].
% 0.64/0.95  58 inverse(double_divide(double_divide(double_divide(double_divide(inverse(double_divide(A,B)),C),C),inverse(double_divide(D,inverse(double_divide(inverse(A),E))))),B)) = double_divide(D,E).  [para(36(a,1),5(a,1,1,2))].
% 0.64/0.95  63 double_divide(inverse(double_divide(A,B)),inverse(double_divide(inverse(A),C))) = double_divide(B,C).  [para(36(a,1),16(a,1,1)),flip(a)].
% 0.64/0.95  65 double_divide(double_divide(inverse(double_divide(A,B)),C),C) = double_divide(double_divide(B,D),inverse(double_divide(inverse(A),D))).  [para(36(a,1),28(a,1,1,1)),flip(a)].
% 0.64/0.95  71 double_divide(A,inverse(double_divide(B,inverse(double_divide(inverse(double_divide(double_divide(B,C),D)),C))))) = double_divide(A,D).  [para(7(a,1),5(a,1))].
% 0.64/0.95  73 inverse(double_divide(double_divide(double_divide(A,inverse(double_divide(B,double_divide(C,D)))),double_divide(E,inverse(double_divide(C,inverse(double_divide(F,D)))))),double_divide(B,inverse(double_divide(E,F))))) = A.  [para(7(a,1),6(a,1,1,1,2))].
% 0.64/0.95  77 inverse(double_divide(double_divide(A,inverse(B)),inverse(double_divide(A,double_divide(C,D))))) = double_divide(inverse(double_divide(double_divide(B,inverse(double_divide(E,F))),E)),inverse(double_divide(C,inverse(double_divide(F,D))))).  [para(16(a,1),7(a,1,1,1,2,1))].
% 0.64/0.95  79 inverse(double_divide(double_divide(A,inverse(double_divide(B,C))),inverse(double_divide(A,D)))) = double_divide(B,inverse(double_divide(inverse(double_divide(double_divide(D,inverse(double_divide(E,F))),E)),inverse(double_divide(C,F))))).  [para(16(a,1),7(a,1,1,2,1,2))].
% 0.64/0.95  85 inverse(double_divide(double_divide(A,B),inverse(double_divide(A,double_divide(C,D))))) = double_divide(double_divide(double_divide(inverse(double_divide(E,B)),F),F),inverse(double_divide(C,inverse(double_divide(inverse(E),D))))).  [para(36(a,1),7(a,1,1,1,2))].
% 0.64/0.95  88 double_divide(inverse(double_divide(double_divide(A,B),inverse(C))),B) = inverse(double_divide(C,A)).  [para(63(a,1),2(a,1,1,2,1,2,1)),rewrite([38(10)])].
% 0.64/0.95  89 double_divide(inverse(double_divide(A,inverse(double_divide(B,C)))),D) = double_divide(B,inverse(double_divide(inverse(double_divide(A,C)),D))).  [para(2(a,1),63(a,1,1)),flip(a)].
% 0.64/0.95  98 double_divide(inverse(double_divide(double_divide(double_divide(double_divide(A,B),inverse(double_divide(C,B))),C),D)),inverse(double_divide(A,E))) = double_divide(D,E).  [para(6(a,1),63(a,1,2,1,1))].
% 0.64/0.95  104 inverse(double_divide(double_divide(double_divide(inverse(double_divide(A,B)),C),C),inverse(inverse(double_divide(D,A))))) = inverse(double_divide(inverse(D),B)).  [para(63(a,1),36(a,1,1,1,1,1,1))].
% 0.64/0.95  121 inverse(double_divide(double_divide(A,inverse(double_divide(B,C))),A)) = double_divide(B,C).  [para(2(a,1),88(a,1,1)),flip(a)].
% 0.64/0.95  132 inverse(double_divide(double_divide(double_divide(double_divide(A,B),inverse(double_divide(C,B))),C),D)) = double_divide(inverse(double_divide(double_divide(D,E),A)),E).  [para(6(a,1),88(a,1,1,1,2)),flip(a)].
% 0.64/0.95  133 inverse(double_divide(A,double_divide(B,C))) = double_divide(B,inverse(double_divide(inverse(A),C))).  [para(6(a,1),88(a,1,1)),flip(a)].
% 0.64/0.95  134 double_divide(double_divide(A,B),B) = A.  [para(6(a,1),88(a,2)),rewrite([89(9),89(7),71(9)])].
% 0.64/0.95  136 inverse(double_divide(double_divide(A,inverse(double_divide(B,C))),inverse(D))) = double_divide(inverse(double_divide(inverse(double_divide(D,A)),B)),C).  [para(88(a,1),16(a,1,1,1,1)),flip(a)].
% 0.64/0.95  142 double_divide(inverse(double_divide(A,B)),inverse(double_divide(inverse(double_divide(double_divide(inverse(double_divide(B,C)),D),C)),D))) = inverse(A).  [para(28(a,1),88(a,2,1)),rewrite([89(10)])].
% 0.64/0.95  151 double_divide(inverse(double_divide(double_divide(inverse(double_divide(A,B)),C),D)),C) = double_divide(D,inverse(inverse(double_divide(A,B)))).  [para(88(a,1),7(a,2,2,1)),rewrite([136(9),134(9),136(11),121(7)])].
% 0.64/0.95  157 double_divide(inverse(double_divide(double_divide(A,B),inverse(C))),inverse(double_divide(inverse(D),B))) = inverse(double_divide(C,inverse(double_divide(D,A)))).  [para(63(a,1),88(a,1,1,1,1))].
% 0.64/0.95  165 double_divide(inverse(double_divide(A,B)),inverse(double_divide(C,inverse(double_divide(inverse(A),D))))) = double_divide(C,inverse(double_divide(B,D))).  [back_rewrite(85),rewrite([133(4),133(7),63(6),134(7)]),flip(a)].
% 0.64/0.95  170 double_divide(inverse(double_divide(double_divide(A,inverse(double_divide(B,C))),B)),inverse(double_divide(D,inverse(double_divide(C,E))))) = double_divide(D,inverse(double_divide(inverse(A),E))).  [back_rewrite(77),rewrite([133(5),133(8),63(7)]),flip(a)].
% 0.64/0.95  173 double_divide(A,double_divide(inverse(double_divide(inverse(double_divide(double_divide(B,C),B)),D)),inverse(double_divide(A,C)))) = D.  [back_rewrite(73),rewrite([133(3),133(16),133(12),133(6),136(13),121(5),157(8),136(9)])].
% 0.64/0.95  179 double_divide(double_divide(double_divide(inverse(double_divide(A,B)),inverse(double_divide(inverse(C),D))),inverse(double_divide(B,D))),inverse(A)) = C.  [back_rewrite(52),rewrite([133(5)])].
% 0.64/0.95  190 double_divide(A,inverse(double_divide(inverse(double_divide(double_divide(B,inverse(double_divide(A,inverse(double_divide(C,D))))),C)),D))) = B.  [back_rewrite(8),rewrite([133(9)])].
% 0.64/0.95  193 inverse(double_divide(inverse(double_divide(A,B)),inverse(inverse(double_divide(C,A))))) = inverse(double_divide(inverse(C),B)).  [back_rewrite(104),rewrite([134(4)])].
% 0.64/0.95  196 double_divide(double_divide(A,B),inverse(double_divide(inverse(C),B))) = inverse(double_divide(C,A)).  [back_rewrite(65),rewrite([134(4)]),flip(a)].
% 0.64/0.95  199 inverse(double_divide(double_divide(A,inverse(double_divide(B,C))),B)) = double_divide(A,C).  [back_rewrite(58),rewrite([134(4),165(8)])].
% 0.64/0.95  204 inverse(double_divide(double_divide(A,inverse(B)),inverse(double_divide(A,C)))) = inverse(double_divide(B,C)).  [back_rewrite(35),rewrite([134(10)])].
% 0.64/0.95  207 double_divide(A,inverse(double_divide(double_divide(B,C),inverse(double_divide(D,C))))) = inverse(double_divide(double_divide(A,D),B)).  [back_rewrite(79),rewrite([204(7),199(8)]),flip(a)].
% 0.64/0.95  208 inverse(double_divide(double_divide(A,B),inverse(C))) = double_divide(inverse(double_divide(C,A)),B).  [back_rewrite(38),rewrite([204(8)])].
% 0.64/0.95  213 double_divide(inverse(double_divide(A,B)),inverse(double_divide(C,inverse(inverse(double_divide(B,C)))))) = inverse(A).  [back_rewrite(142),rewrite([151(8)])].
% 0.64/0.95  221 double_divide(double_divide(A,B),inverse(double_divide(C,inverse(double_divide(B,D))))) = double_divide(C,inverse(double_divide(inverse(A),D))).  [back_rewrite(170),rewrite([199(5)])].
% 0.64/0.95  225 double_divide(inverse(double_divide(A,B)),C) = double_divide(A,inverse(double_divide(B,C))).  [back_rewrite(33),rewrite([199(7)]),flip(a)].
% 0.64/0.95  227 double_divide(A,double_divide(double_divide(B,C),inverse(double_divide(D,C)))) = inverse(double_divide(double_divide(A,B),D)).  [back_rewrite(207),rewrite([208(5),225(4)])].
% 0.64/0.95  230 double_divide(double_divide(A,inverse(double_divide(B,C))),inverse(double_divide(inverse(D),C))) = inverse(double_divide(A,inverse(double_divide(D,B)))).  [back_rewrite(157),rewrite([208(4),225(3)])].
% 0.64/0.95  235 double_divide(double_divide(A,inverse(double_divide(B,C))),C) = inverse(double_divide(A,B)).  [back_rewrite(88),rewrite([208(4),225(3)])].
% 0.64/0.95  245 double_divide(A,inverse(double_divide(B,inverse(double_divide(C,inverse(inverse(double_divide(B,C)))))))) = inverse(A).  [back_rewrite(213),rewrite([225(8)])].
% 0.64/0.95  247 inverse(double_divide(double_divide(A,B),inverse(C))) = double_divide(C,inverse(double_divide(A,B))).  [back_rewrite(208),rewrite([225(7)])].
% 0.64/0.95  248 inverse(double_divide(A,inverse(double_divide(B,inverse(inverse(double_divide(C,A))))))) = inverse(double_divide(inverse(C),B)).  [back_rewrite(193),rewrite([225(6)])].
% 0.64/0.95  250 double_divide(A,inverse(inverse(double_divide(B,A)))) = B.  [back_rewrite(190),rewrite([225(8),235(8)])].
% 0.64/0.95  255 double_divide(double_divide(double_divide(A,inverse(double_divide(B,inverse(double_divide(inverse(C),D))))),inverse(double_divide(B,D))),inverse(A)) = C.  [back_rewrite(179),rewrite([225(6)])].
% 0.64/0.95  256 double_divide(A,double_divide(double_divide(double_divide(B,C),inverse(double_divide(B,D))),inverse(double_divide(A,D)))) = C.  [back_rewrite(173),rewrite([225(4),247(5)])].
% 0.64/0.95  267 double_divide(double_divide(A,inverse(double_divide(B,C))),inverse(double_divide(D,C))) = double_divide(D,inverse(inverse(double_divide(A,B)))).  [back_rewrite(151),rewrite([225(3),225(6)])].
% 0.64/0.95  271 inverse(double_divide(double_divide(double_divide(double_divide(A,B),inverse(double_divide(C,B))),C),D)) = double_divide(double_divide(D,E),inverse(double_divide(A,E))).  [back_rewrite(132),rewrite([225(11)])].
% 0.64/0.95  276 double_divide(double_divide(double_divide(double_divide(A,B),inverse(double_divide(C,B))),C),inverse(double_divide(D,inverse(double_divide(A,E))))) = double_divide(D,E).  [back_rewrite(98),rewrite([225(10)])].
% 0.64/0.95  280 double_divide(A,inverse(inverse(double_divide(double_divide(B,C),B)))) = double_divide(A,C).  [back_rewrite(71),rewrite([225(4),247(5),227(5)])].
% 0.64/0.95  286 double_divide(A,inverse(double_divide(B,inverse(B)))) = inverse(A).  [back_rewrite(245),rewrite([250(4)])].
% 0.64/0.95  288 double_divide(A,double_divide(A,B)) = B.  [back_rewrite(256),rewrite([267(7),280(5)])].
% 0.64/0.95  289 inverse(double_divide(A,inverse(double_divide(B,C)))) = double_divide(inverse(B),inverse(inverse(double_divide(A,C)))).  [back_rewrite(230),rewrite([267(7)]),flip(a)].
% 0.64/0.95  291 inverse(inverse(a2)) != a2 # answer(prove_these_axioms_2).  [back_rewrite(4),rewrite([286(7)])].
% 0.64/0.95  296 double_divide(double_divide(double_divide(double_divide(A,B),inverse(double_divide(C,B))),C),double_divide(inverse(A),inverse(inverse(double_divide(D,E))))) = double_divide(D,E).  [back_rewrite(276),rewrite([289(9)])].
% 0.64/0.95  310 double_divide(double_divide(double_divide(A,double_divide(inverse(inverse(B)),inverse(inverse(double_divide(C,D))))),inverse(double_divide(C,D))),inverse(A)) = B.  [back_rewrite(255),rewrite([289(5)])].
% 0.64/0.95  313 inverse(double_divide(inverse(A),B)) = double_divide(inverse(B),inverse(inverse(A))).  [back_rewrite(248),rewrite([289(7),250(5)]),flip(a)].
% 0.64/0.95  324 double_divide(double_divide(A,B),double_divide(inverse(B),inverse(inverse(double_divide(C,D))))) = double_divide(C,double_divide(inverse(D),inverse(inverse(A)))).  [back_rewrite(221),rewrite([289(5),313(10)])].
% 0.64/0.95  351 double_divide(double_divide(A,B),double_divide(inverse(B),inverse(inverse(C)))) = inverse(double_divide(C,A)).  [back_rewrite(196),rewrite([313(4)])].
% 0.64/0.95  356 inverse(double_divide(double_divide(A,B),C)) = double_divide(A,double_divide(inverse(B),inverse(inverse(C)))).  [back_rewrite(324),rewrite([351(7)])].
% 0.64/0.95  366 double_divide(double_divide(double_divide(A,B),inverse(double_divide(C,B))),double_divide(inverse(C),inverse(inverse(D)))) = double_divide(double_divide(D,E),inverse(double_divide(A,E))).  [back_rewrite(271),rewrite([356(7)])].
% 0.64/0.95  375 double_divide(double_divide(A,B),A) = B.  [para(134(a,1),288(a,1,2))].
% 0.64/0.95  379 double_divide(double_divide(A,B),double_divide(C,double_divide(inverse(D),inverse(inverse(B))))) = double_divide(double_divide(A,D),inverse(C)).  [para(134(a,1),46(a,1,2,1)),rewrite([356(7)]),flip(a)].
% 0.64/0.95  382 double_divide(double_divide(A,double_divide(B,C)),inverse(C)) = double_divide(double_divide(A,D),inverse(double_divide(B,D))).  [para(288(a,1),46(a,1,2,1))].
% 0.64/0.95  384 double_divide(double_divide(A,inverse(double_divide(B,C))),double_divide(inverse(B),inverse(inverse(D)))) = double_divide(double_divide(A,C),inverse(D)).  [para(46(a,1),46(a,1,2,1)),rewrite([289(8),134(6),356(12),379(15)])].
% 0.64/0.95  388 double_divide(double_divide(A,B),inverse(double_divide(C,B))) = double_divide(C,inverse(A)).  [back_rewrite(366),rewrite([384(9),134(2)]),flip(a)].
% 0.64/0.95  391 double_divide(double_divide(A,double_divide(B,C)),inverse(C)) = double_divide(B,inverse(A)).  [back_rewrite(382),rewrite([388(8)])].
% 0.64/0.95  396 inverse(inverse(double_divide(A,B))) = double_divide(A,B).  [back_rewrite(296),rewrite([388(4),375(3),288(7)])].
% 0.64/0.95  408 inverse(inverse(A)) = A.  [back_rewrite(310),rewrite([396(5),391(8),134(6)])].
% 0.64/0.95  409 $F # answer(prove_these_axioms_2).  [resolve(408,a,291,a)].
% 0.64/0.95  
% 0.64/0.95  % SZS output end Refutation
% 0.64/0.95  ============================== end of proof ==========================
% 0.64/0.95  
% 0.64/0.95  ============================== STATISTICS ============================
% 0.64/0.95  
% 0.64/0.95  Given=14. Generated=609. Kept=407. proofs=1.
% 0.64/0.95  Usable=3. Sos=62. Demods=69. Limbo=18, Disabled=326. Hints=0.
% 0.64/0.95  Megabytes=0.41.
% 0.64/0.95  User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.64/0.95  
% 0.64/0.95  ============================== end of statistics =====================
% 0.64/0.95  
% 0.64/0.95  ============================== end of search =========================
% 0.64/0.95  
% 0.64/0.95  THEOREM PROVED
% 0.64/0.95  % SZS status Unsatisfiable
% 0.64/0.95  
% 0.64/0.95  Exiting with 1 proof.
% 0.64/0.95  
% 0.64/0.95  Process 16087 exit (max_proofs) Mon Jun 13 07:32:54 2022
% 0.64/0.96  Prover9 interrupted
%------------------------------------------------------------------------------