TSTP Solution File: HAL001+1 by Prover9---1109a

View Problem - Process Solution

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

% Computer : n017.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 12:45:52 EDT 2022

% Result   : Timeout 300.04s 300.29s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : HAL001+1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n017.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 : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jun  7 20:56:02 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.76/1.01  ============================== Prover9 ===============================
% 0.76/1.01  Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.01  Process 11899 was started by sandbox2 on n017.cluster.edu,
% 0.76/1.01  Tue Jun  7 20:56:03 2022
% 0.76/1.01  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_11745_n017.cluster.edu".
% 0.76/1.01  ============================== end of head ===========================
% 0.76/1.01  
% 0.76/1.01  ============================== INPUT =================================
% 0.76/1.01  
% 0.76/1.01  % Reading from file /tmp/Prover9_11745_n017.cluster.edu
% 0.76/1.01  
% 0.76/1.01  set(prolog_style_variables).
% 0.76/1.01  set(auto2).
% 0.76/1.01      % set(auto2) -> set(auto).
% 0.76/1.01      % set(auto) -> set(auto_inference).
% 0.76/1.01      % set(auto) -> set(auto_setup).
% 0.76/1.01      % set(auto_setup) -> set(predicate_elim).
% 0.76/1.01      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.01      % set(auto) -> set(auto_limits).
% 0.76/1.01      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.01      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.01      % set(auto) -> set(auto_denials).
% 0.76/1.01      % set(auto) -> set(auto_process).
% 0.76/1.01      % set(auto2) -> assign(new_constants, 1).
% 0.76/1.01      % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.01      % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.01      % set(auto2) -> assign(max_hours, 1).
% 0.76/1.01      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.01      % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.01      % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.01      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.01      % set(auto2) -> set(sort_initial_sos).
% 0.76/1.01      % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.01      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.01      % set(auto2) -> assign(max_megs, 400).
% 0.76/1.01      % set(auto2) -> assign(stats, some).
% 0.76/1.01      % set(auto2) -> clear(echo_input).
% 0.76/1.01      % set(auto2) -> set(quiet).
% 0.76/1.01      % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.01      % set(auto2) -> clear(print_given).
% 0.76/1.01  assign(lrs_ticks,-1).
% 0.76/1.01  assign(sos_limit,10000).
% 0.76/1.01  assign(order,kbo).
% 0.76/1.01  set(lex_order_vars).
% 0.76/1.01  clear(print_given).
% 0.76/1.01  
% 0.76/1.01  % formulas(sos).  % not echoed (31 formulas)
% 0.76/1.01  
% 0.76/1.01  ============================== end of input ==========================
% 0.76/1.01  
% 0.76/1.01  % From the command line: assign(max_seconds, 300).
% 0.76/1.01  
% 0.76/1.01  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.01  
% 0.76/1.01  % Formulas that are not ordinary clauses:
% 0.76/1.01  1 (all Morphism all Dom all Cod (morphism(Morphism,Dom,Cod) -> (all El (element(El,Dom) -> element(apply(Morphism,El),Cod))) & apply(Morphism,zero(Dom)) = zero(Cod))) # label(morphism) # label(axiom) # label(non_clause).  [assumption].
% 0.76/1.01  2 (all Morphism all Dom all Cod (injection(Morphism) & morphism(Morphism,Dom,Cod) -> (all El1 all El2 (element(El1,Dom) & element(El2,Dom) & apply(Morphism,El1) = apply(Morphism,El2) -> El1 = El2)))) # label(injection_properties) # label(axiom) # label(non_clause).  [assumption].
% 0.76/1.01  3 (all Morphism all Dom all Cod (morphism(Morphism,Dom,Cod) & (all El1 all El2 (element(El1,Dom) & element(El2,Dom) & apply(Morphism,El1) = apply(Morphism,El2) -> El1 = El2)) -> injection(Morphism))) # label(properties_for_injection) # label(axiom) # label(non_clause).  [assumption].
% 0.76/1.01  4 (all Morphism all Dom all Cod (surjection(Morphism) & morphism(Morphism,Dom,Cod) -> (all ElCod (element(ElCod,Cod) -> (exists ElDom (element(ElDom,Dom) & apply(Morphism,ElDom) = ElCod)))))) # label(surjection_properties) # label(axiom) # label(non_clause).  [assumption].
% 0.76/1.01  5 (all Morphism all Dom all Cod (morphism(Morphism,Dom,Cod) & (all ElCod (element(ElCod,Cod) -> (exists ElDom (element(ElDom,Dom) & apply(Morphism,ElDom) = ElCod)))) -> surjection(Morphism))) # label(properties_for_surjection) # label(axiom) # label(non_clause).  [assumption].
% 0.76/1.01  6 (all Morphism1 all Morphism2 all Dom all CodDom all Cod (exact(Morphism1,Morphism2) & morphism(Morphism1,Dom,CodDom) & morphism(Morphism2,CodDom,Cod) -> (all ElCodDom (element(ElCodDom,CodDom) & apply(Morphism2,ElCodDom) = zero(Cod) <-> (exists ElDom (element(ElDom,Dom) & apply(Morphism1,ElDom) = ElCodDom)))))) # label(exact_properties) # label(axiom) # label(non_clause).  [assumption].
% 0.76/1.01  7 (all Morphism1 all Morphism2 all Dom all CodDom all Cod (morphism(Morphism1,Dom,CodDom) & morphism(Morphism2,CodDom,Cod) & (all ElCodDom (element(ElCodDom,CodDom) & apply(Morphism2,ElCodDom) = zero(Cod) <-> (exists ElDom (element(ElDom,Dom) & apply(Morphism1,ElDom) = ElCodDom)))) -> exact(Morphism1,Morphism2))) # label(properties_for_exact) # label(axiom) # label(non_clause).  [assumption].
% 0.76/1.01  8 (all M1 all M2 all M3 all M4 all Dom all DomCod1 all DomCod2 all Cod (commute(M1,M2,M3,M4) & morphism(M1,Dom,DomCod1) & morphism(M2,DomCod1,Cod) & morphism(M3,Dom,DomCod2) & morphism(M4,DomCod2,Cod) -> (all ElDom (element(ElDom,Dom) -> apply(M2,apply(M1,ElDom)) = apply(M4,apply(M3,ElDom)))))) # label(commute_properties) # label(axiom) # label(non_clause).  [assumption].
% 0.76/1.01  9 (all M1 all M2 all M3 all M4 all Dom all DomCod1 all DomCod2 all Cod (morphism(M1,Dom,DomCod1) & morphism(M2,DomCod1,Cod) & morphism(M3,Dom,DomCod2) & morphism(M4,DomCod2,Cod) & (all ElDom (element(ElDom,Dom) -> apply(M2,apply(M1,ElDom)) = apply(M4,apply(M3,ElDom)))) -> commute(M1,M2,M3,M4))) # label(properties_for_commute) # label(axiom) # label(non_clause).  [assumption].
% 0.76/1.01  10 (all Dom all El1 all El2 (element(El1,Dom) & element(El2,Dom) -> element(subtract(Dom,El1,El2),Dom))) # label(subtract_in_domain) # label(axiom) # label(non_clause).  [assumption].
% 0.76/1.01  11 (all Dom all El (element(El,Dom) -> subtract(Dom,El,El) = zero(Dom))) # label(subtract_to_0) # label(axiom) # label(non_clause).  [assumption].
% 0.76/1.01  12 (all Dom all El1 all El2 (element(El1,Dom) & element(El2,Dom) -> subtract(Dom,El1,subtract(Dom,El1,El2)) = El2)) # label(subtract_cancellation) # label(axiom) # label(non_clause).  [assumption].
% 0.76/1.01  13 (all Morphism all Dom all Cod (morphism(Morphism,Dom,Cod) -> (all El1 all El2 (element(El1,Dom) & element(El2,Dom) -> apply(Morphism,subtract(Dom,El1,El2)) = subtract(Cod,apply(Morphism,El1),apply(Morphism,El2)))))) # label(subtract_distribution) # label(axiom) # label(non_clause).  [assumption].
% 0.76/1.01  
% 0.76/1.01  ============================== end of process non-clausal formulas ===
% 0.76/1.01  
% 0.76/1.01  ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.01  
% 0.76/1.01  ============================== PREDICATE ELIMINATION =================
% 0.76/1.01  14 -surjection(A) | -morphism(A,B,C) | -element(D,C) | element(f3(A,B,C,D),B) # label(surjection_properties) # label(axiom).  [clausify(4)].
% 0.76/1.01  15 surjection(beta) # label(beta_surjection) # label(axiom).  [assumption].
% 0.76/1.01  16 surjection(delta) # label(delta_surjection) # label(axiom).  [assumption].
% 0.76/1.01  17 -morphism(A,B,C) | element(f4(A,B,C),C) | surjection(A) # label(properties_for_surjection) # label(axiom).  [clausify(5)].
% 0.76/1.01  Derived: -morphism(beta,A,B) | -element(C,B) | element(f3(beta,A,B,C),A).  [resolve(14,a,15,a)].
% 0.76/1.01  Derived: -morphism(delta,A,B) | -element(C,B) | element(f3(delta,A,B,C),A).  [resolve(14,a,16,a)].
% 0.76/1.01  Derived: -morphism(A,B,C) | -element(D,C) | element(f3(A,B,C,D),B) | -morphism(A,E,F) | element(f4(A,E,F),F).  [resolve(14,a,17,c)].
% 0.76/1.01  18 -morphism(A,B,C) | -element(D,B) | apply(A,D) != f4(A,B,C) | surjection(A) # label(properties_for_surjection) # label(axiom).  [clausify(5)].
% 0.76/1.01  Derived: -morphism(A,B,C) | -element(D,B) | apply(A,D) != f4(A,B,C) | -morphism(A,E,F) | -element(V6,F) | element(f3(A,E,F,V6),E).  [resolve(18,d,14,a)].
% 0.76/1.01  19 -surjection(A) | -morphism(A,B,C) | -element(D,C) | apply(A,f3(A,B,C,D)) = D # label(surjection_properties) # label(axiom).  [clausify(4)].
% 0.76/1.01  Derived: -morphism(beta,A,B) | -element(C,B) | apply(beta,f3(beta,A,B,C)) = C.  [resolve(19,a,15,a)].
% 0.76/1.01  Derived: -morphism(delta,A,B) | -element(C,B) | apply(delta,f3(delta,A,B,C)) = C.  [resolve(19,a,16,a)].
% 0.76/1.01  Derived: -morphism(A,B,C) | -element(D,C) | apply(A,f3(A,B,C,D)) = D | -morphism(A,E,F) | element(f4(A,E,F),F).  [resolve(19,a,17,c)].
% 0.76/1.01  Derived: -morphism(A,B,C) | -element(D,C) | apply(A,f3(A,B,C,D)) = D | -morphism(A,E,F) | -element(V6,E) | apply(A,V6) != f4(A,E,F).  [resolve(19,a,18,d)].
% 0.76/1.01  20 -exact(A,B) | -morphism(A,C,D) | -morphism(B,D,E) | element(F,D) | -element(V6,C) | apply(A,V6) != F # label(exact_properties) # label(axiom).  [clausify(6)].
% 0.76/1.01  21 exact(alpha,beta) # label(alpha_beta_exact) # label(axiom).  [assumption].
% 0.76/1.01  22 exact(gammma,delta) # label(gamma_delta_exact) # label(axiom).  [assumption].
% 0.76/1.01  Derived: -morphism(alpha,A,B) | -morphism(beta,B,C) | element(D,B) | -element(E,A) | apply(alpha,E) != D.  [resolve(20,a,21,a)].
% 0.76/1.01  Derived: -morphism(gammma,A,B) | -morphism(delta,B,C) | element(D,B) | -element(E,A) | apply(gammma,E) != D.  [resolve(20,a,22,a)].
% 0.76/1.01  23 -exact(A,B) | -morphism(A,C,D) | -morphism(B,D,E) | zero(E) = apply(B,F) | -element(V6,C) | apply(A,V6) != F # label(exact_properties) # label(axiom).  [clausify(6)].
% 0.76/1.01  Derived: -morphism(alpha,A,B) | -morphism(beta,B,C) | zero(C) = apply(beta,D) | -element(E,A) | apply(alpha,E) != D.  [resolve(23,a,21,a)].
% 0.76/1.01  Derived: -morphism(gammma,A,B) | -morphism(delta,B,C) | zero(C) = apply(delta,D) | -element(E,A) | apply(gammma,E) != D.  [resolve(23,a,22,a)].
% 0.76/1.01  24 -morphism(A,B,C) | -morphism(D,C,E) | element(f6(A,D,B,C,E),C) | element(f7(A,D,B,C,E),B) | exact(A,D) # label(properties_for_exact) # label(axiom).  [clausify(7)].
% 0.76/1.01  Derived: -morphism(A,B,C) | -morphism(D,C,E) | element(f6(A,D,B,C,E),C) | element(f7(A,D,B,C,E),B) | -morphism(A,F,V6) | -morphism(D,V6,V7) | element(V8,V6) | -element(V9,F) | apply(A,V9) != V8.  [resolve(24,e,20,a)].
% 0.76/1.01  Derived: -morphism(A,B,C) | -morphism(D,C,E) | element(f6(A,D,B,C,E),C) | element(f7(A,D,B,C,E),B) | -morphism(A,F,V6) | -morphism(D,V6,V7) | zero(V7) = apply(D,V8) | -element(V9,F) | apply(A,V9) != V8.  [resolve(24,e,23,a)].
% 0.76/1.01  25 -exact(A,B) | -morphism(A,C,D) | -morphism(B,D,E) | -element(F,D) | zero(E) != apply(B,F) | element(f5(A,B,C,D,E,F),C) # label(exact_properties) # label(axiom).  [clausify(6)].
% 0.76/1.01  Derived: -morphism(alpha,A,B) | -morphism(beta,B,C) | -element(D,B) | zero(C) != apply(beta,D) | element(f5(alpha,beta,A,B,C,D),A).  [resolve(25,a,21,a)].
% 0.76/1.01  Derived: -morphism(gammma,A,B) | -morphism(delta,B,C) | -element(D,B) | zero(C) != apply(delta,D) | element(f5(gammma,delta,A,B,C,D),A).  [resolve(25,a,22,a)].
% 0.76/1.01  Derived: -morphism(A,B,C) | -morphism(D,C,E) | -element(F,C) | zero(E) != apply(D,F) | element(f5(A,D,B,C,E,F),B) | -morphism(A,V6,V7) | -morphism(D,V7,V8) | element(f6(A,D,V6,V7,V8),V7) | element(f7(A,D,V6,V7,V8),V6).  [resolve(25,a,24,e)].
% 0.76/1.01  26 -morphism(A,B,C) | -morphism(D,C,E) | zero(E) = apply(D,f6(A,D,B,C,E)) | element(f7(A,D,B,C,E),B) | exact(A,D) # label(properties_for_exact) # label(axiom).  [clausify(7)].
% 0.76/1.01  Derived: -morphism(A,B,C) | -morphism(D,C,E) | zero(E) = apply(D,f6(A,D,B,C,E)) | element(f7(A,D,B,C,E),B) | -morphism(A,F,V6) | -morphism(D,V6,V7) | element(V8,V6) | -element(V9,F) | apply(A,V9) != V8.  [resolve(26,e,20,a)].
% 0.76/1.01  Derived: -morphism(A,B,C) | -morphism(D,C,E) | zero(E) = apply(D,f6(A,D,B,C,E)) | element(f7(A,D,B,C,E),B) | -morphism(A,F,V6) | -morphism(D,V6,V7) | zero(V7) = apply(D,V8) | -element(V9,F) | apply(A,V9) != V8.  [resolve(26,e,23,a)].
% 0.76/1.01  Derived: -morphism(A,B,C) | -morphism(D,C,E) | zero(E) = apply(D,f6(A,D,B,C,E)) | element(f7(A,D,B,C,E),B) | -morphism(A,F,V6) | -morphism(D,V6,V7) | -element(V8,V6) | zero(V7) != apply(D,V8) | element(f5(A,D,F,V6,V7,V8),F).  [resolve(26,e,25,a)].
% 0.76/1.01  27 -exact(A,B) | -morphism(A,C,D) | -morphism(B,D,E) | -element(F,D) | zero(E) != apply(B,F) | apply(A,f5(A,B,C,D,E,F)) = F # label(exact_properties) # label(axiom).  [clausify(6)].
% 0.76/1.01  Derived: -morphism(alpha,A,B) | -morphism(beta,B,C) | -element(D,B) | zero(C) != apply(beta,D) | apply(alpha,f5(alpha,beta,A,B,C,D)) = D.  [resolve(27,a,21,a)].
% 0.76/1.01  Derived: -morphism(gammma,A,B) | -morphism(delta,B,C) | -element(D,B) | zero(C) != apply(delta,D) | apply(gammma,f5(gammma,delta,A,B,C,D)) = D.  [resolve(27,a,22,a)].
% 0.76/1.01  Derived: -morphism(A,B,C) | -morphism(D,C,E) | -element(F,C) | zero(E) != apply(D,F) | apply(A,f5(A,D,B,C,E,F)) = F | -morphism(A,V6,V7) | -morphism(D,V7,V8) | element(f6(A,D,V6,V7,V8),V7) | element(f7(A,D,V6,V7,V8),V6).  [resolve(27,a,24,e)].
% 0.76/1.01  Derived: -morphism(A,B,C) | -morphism(D,C,E) | -element(F,C) | zero(E) != apply(D,F) | apply(A,f5(A,D,B,C,E,F)) = F | -morphism(A,V6,V7) | -morphism(D,V7,V8) | zero(V8) = apply(D,f6(A,D,V6,V7,V8)) | element(f7(A,D,V6,V7,V8),V6).  [resolve(27,a,26,e)].
% 0.76/1.01  28 -morphism(A,B,C) | -morphism(D,C,E) | element(f6(A,D,B,C,E),C) | apply(A,f7(A,D,B,C,E)) = f6(A,D,B,C,E) | exact(A,D) # label(properties_for_exact) # label(axiom).  [clausify(7)].
% 0.76/1.01  Derived: -morphism(A,B,C) | -morphism(D,C,E) | element(f6(A,D,B,C,E),C) | apply(A,f7(A,D,B,C,E)) = f6(A,D,B,C,E) | -morphism(A,F,V6) | -morphism(D,V6,V7) | element(V8,V6) | -element(V9,F) | apply(A,V9) != V8.  [resolve(28,e,20,a)].
% 0.76/1.02  Derived: -morphism(A,B,C) | -morphism(D,C,E) | element(f6(A,D,B,C,E),C) | apply(A,f7(A,D,B,C,E)) = f6(A,D,B,C,E) | -morphism(A,F,V6) | -morphism(D,V6,V7) | zero(V7) = apply(D,V8) | -element(V9,F) | apply(A,V9) != V8.  [resolve(28,e,23,a)].
% 0.76/1.02  Derived: -morphism(A,B,C) | -morphism(D,C,E) | element(f6(A,D,B,C,E),C) | apply(A,f7(A,D,B,C,E)) = f6(A,D,B,C,E) | -morphism(A,F,V6) | -morphism(D,V6,V7) | -element(V8,V6) | zero(V7) != apply(D,V8) | element(f5(A,D,F,V6,V7,V8),F).  [resolve(28,e,25,a)].
% 0.76/1.02  Derived: -morphism(A,B,C) | -morphism(D,C,E) | element(f6(A,D,B,C,E),C) | apply(A,f7(A,D,B,C,E)) = f6(A,D,B,C,E) | -morphism(A,F,V6) | -morphism(D,V6,V7) | -element(V8,V6) | zero(V7) != apply(D,V8) | apply(A,f5(A,D,F,V6,V7,V8)) = V8.  [resolve(28,e,27,a)].
% 0.76/1.02  29 -morphism(A,B,C) | -morphism(D,C,E) | zero(E) = apply(D,f6(A,D,B,C,E)) | apply(A,f7(A,D,B,C,E)) = f6(A,D,B,C,E) | exact(A,D) # label(properties_for_exact) # label(axiom).  [clausify(7)].
% 0.76/1.02  Derived: -morphism(A,B,C) | -morphism(D,C,E) | zero(E) = apply(D,f6(A,D,B,C,E)) | apply(A,f7(A,D,B,C,E)) = f6(A,D,B,C,E) | -morphism(A,F,V6) | -morphism(D,V6,V7) | element(V8,V6) | -element(V9,F) | apply(A,V9) != V8.  [resolve(29,e,20,a)].
% 0.76/1.02  Derived: -morphism(A,B,C) | -morphism(D,C,E) | zero(E) = apply(D,f6(A,D,B,C,E)) | apply(A,f7(A,D,B,C,E)) = f6(A,D,B,C,E) | -morphism(A,F,V6) | -morphism(D,V6,V7) | zero(V7) = apply(D,V8) | -element(V9,F) | apply(A,V9) != V8.  [resolve(29,e,23,a)].
% 0.76/1.02  Derived: -morphism(A,B,C) | -morphism(D,C,E) | zero(E) = apply(D,f6(A,D,B,C,E)) | apply(A,f7(A,D,B,C,E)) = f6(A,D,B,C,E) | -morphism(A,F,V6) | -morphism(D,V6,V7) | -element(V8,V6) | zero(V7) != apply(D,V8) | element(f5(A,D,F,V6,V7,V8),F).  [resolve(29,e,25,a)].
% 0.76/1.02  Derived: -morphism(A,B,C) | -morphism(D,C,E) | zero(E) = apply(D,f6(A,D,B,C,E)) | apply(A,f7(A,D,B,C,E)) = f6(A,D,B,C,E) | -morphism(A,F,V6) | -morphism(D,V6,V7) | -element(V8,V6) | zero(V7) != apply(D,V8) | apply(A,f5(A,D,F,V6,V7,V8)) = V8.  [resolve(29,e,27,a)].
% 0.76/1.02  30 -morphism(A,B,C) | -morphism(D,C,E) | -element(f6(A,D,B,C,E),C) | zero(E) != apply(D,f6(A,D,B,C,E)) | -element(F,B) | apply(A,F) != f6(A,D,B,C,E) | exact(A,D) # label(properties_for_exact) # label(axiom).  [clausify(7)].
% 0.76/1.02  Derived: -morphism(A,B,C) | -morphism(D,C,E) | -element(f6(A,D,B,C,E),C) | zero(E) != apply(D,f6(A,D,B,C,E)) | -element(F,B) | apply(A,F) != f6(A,D,B,C,E) | -morphism(A,V6,V7) | -morphism(D,V7,V8) | element(V9,V7) | -element(V10,V6) | apply(A,V10) != V9.  [resolve(30,g,20,a)].
% 0.76/1.02  Derived: -morphism(A,B,C) | -morphism(D,C,E) | -element(f6(A,D,B,C,E),C) | zero(E) != apply(D,f6(A,D,B,C,E)) | -element(F,B) | apply(A,F) != f6(A,D,B,C,E) | -morphism(A,V6,V7) | -morphism(D,V7,V8) | zero(V8) = apply(D,V9) | -element(V10,V6) | apply(A,V10) != V9.  [resolve(30,g,23,a)].
% 0.76/1.02  Derived: -morphism(A,B,C) | -morphism(D,C,E) | -element(f6(A,D,B,C,E),C) | zero(E) != apply(D,f6(A,D,B,C,E)) | -element(F,B) | apply(A,F) != f6(A,D,B,C,E) | -morphism(A,V6,V7) | -morphism(D,V7,V8) | -element(V9,V7) | zero(V8) != apply(D,V9) | element(f5(A,D,V6,V7,V8,V9),V6).  [resolve(30,g,25,a)].
% 0.76/1.02  Derived: -morphism(A,B,C) | -morphism(D,C,E) | -element(f6(A,D,B,C,E),C) | zero(E) != apply(D,f6(A,D,B,C,E)) | -element(F,B) | apply(A,F) != f6(A,D,B,C,E) | -morphism(A,V6,V7) | -morphism(D,V7,V8) | -element(V9,V7) | zero(V8) != apply(D,V9) | apply(A,f5(A,D,V6,V7,V8,V9)) = V9.  [resolve(30,g,27,a)].
% 0.76/1.02  31 -commute(A,B,C,D) | -morphism(A,E,F) | -morphism(B,F,V6) | -morphism(C,E,V7) | -morphism(D,V7,V6) | -element(V8,E) | apply(D,apply(C,V8)) = apply(B,apply(A,V8)) # label(commute_properties) # label(axiom).  [clausify(8)].
% 0.76/1.02  32 commute(alpha,g,f,gamma) # label(alpha_g_f_gamma_commute) # label(axiom).  [assumption].
% 0.76/1.02  33 commute(beta,h,g,delta) # label(beta_h_g_delta_commute) # label(axiom).  [assumption].
% 0.76/1.02  34 -morphism(A,B,C) | -morphism(D,C,E) | -morphism(F,B,V6) | -morphism(V7,V6,E) | element(f8(A,D,F,V7,B,C,V6,E),B) | commute(A,D,F,V7) # label(properties_for_commute) # label(axCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------