0.08/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer   : n025.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 180
0.12/0.34	% DateTime   : Thu Aug 29 17:11:30 EDT 2019
0.12/0.34	% CPUTime    : 
0.45/1.05	============================== Prover9 ===============================
0.45/1.05	Prover9 (32) version 2009-11A, November 2009.
0.45/1.05	Process 21519 was started by sandbox2 on n025.cluster.edu,
0.45/1.05	Thu Aug 29 17:11:31 2019
0.45/1.05	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_21366_n025.cluster.edu".
0.45/1.05	============================== end of head ===========================
0.45/1.05	
0.45/1.05	============================== INPUT =================================
0.45/1.05	
0.45/1.05	% Reading from file /tmp/Prover9_21366_n025.cluster.edu
0.45/1.05	
0.45/1.05	set(prolog_style_variables).
0.45/1.05	set(auto2).
0.45/1.05	    % set(auto2) -> set(auto).
0.45/1.05	    % set(auto) -> set(auto_inference).
0.45/1.05	    % set(auto) -> set(auto_setup).
0.45/1.05	    % set(auto_setup) -> set(predicate_elim).
0.45/1.05	    % set(auto_setup) -> assign(eq_defs, unfold).
0.45/1.05	    % set(auto) -> set(auto_limits).
0.45/1.05	    % set(auto_limits) -> assign(max_weight, "100.000").
0.45/1.05	    % set(auto_limits) -> assign(sos_limit, 20000).
0.45/1.05	    % set(auto) -> set(auto_denials).
0.45/1.05	    % set(auto) -> set(auto_process).
0.45/1.05	    % set(auto2) -> assign(new_constants, 1).
0.45/1.05	    % set(auto2) -> assign(fold_denial_max, 3).
0.45/1.05	    % set(auto2) -> assign(max_weight, "200.000").
0.45/1.05	    % set(auto2) -> assign(max_hours, 1).
0.45/1.05	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.45/1.05	    % set(auto2) -> assign(max_seconds, 0).
0.45/1.05	    % set(auto2) -> assign(max_minutes, 5).
0.45/1.05	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.45/1.05	    % set(auto2) -> set(sort_initial_sos).
0.45/1.05	    % set(auto2) -> assign(sos_limit, -1).
0.45/1.05	    % set(auto2) -> assign(lrs_ticks, 3000).
0.45/1.05	    % set(auto2) -> assign(max_megs, 400).
0.45/1.05	    % set(auto2) -> assign(stats, some).
0.45/1.05	    % set(auto2) -> clear(echo_input).
0.45/1.05	    % set(auto2) -> set(quiet).
0.45/1.05	    % set(auto2) -> clear(print_initial_clauses).
0.45/1.05	    % set(auto2) -> clear(print_given).
0.45/1.05	assign(lrs_ticks,-1).
0.45/1.05	assign(sos_limit,10000).
0.45/1.05	assign(order,kbo).
0.45/1.05	set(lex_order_vars).
0.45/1.05	clear(print_given).
0.45/1.05	
0.45/1.05	% formulas(sos).  % not echoed (31 formulas)
0.45/1.05	
0.45/1.05	============================== end of input ==========================
0.45/1.05	
0.45/1.05	% From the command line: assign(max_seconds, 180).
0.45/1.05	
0.45/1.05	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.45/1.05	
0.45/1.05	% Formulas that are not ordinary clauses:
0.45/1.05	1 (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.45/1.05	2 (all Dom all El (element(El,Dom) -> subtract(Dom,El,El) = zero(Dom))) # label(subtract_to_0) # label(axiom) # label(non_clause).  [assumption].
0.45/1.05	3 (all Morphism all Dom all Cod (surjection(Morphism) & morphism(Morphism,Dom,Cod) -> (all ElCod (element(ElCod,Cod) -> (exists ElDom (apply(Morphism,ElDom) = ElCod & element(ElDom,Dom))))))) # label(surjection_properties) # label(axiom) # label(non_clause).  [assumption].
0.45/1.05	4 (all Dom all El1 all El2 (element(El2,Dom) & element(El1,Dom) -> element(subtract(Dom,El1,El2),Dom))) # label(subtract_in_domain) # label(axiom) # label(non_clause).  [assumption].
0.45/1.05	5 (all Morphism1 all Morphism2 all Dom all CodDom all Cod (morphism(Morphism1,Dom,CodDom) & (all ElCodDom ((exists ElDom (apply(Morphism1,ElDom) = ElCodDom & element(ElDom,Dom))) <-> zero(Cod) = apply(Morphism2,ElCodDom) & element(ElCodDom,CodDom))) & morphism(Morphism2,CodDom,Cod) -> exact(Morphism1,Morphism2))) # label(properties_for_exact) # label(axiom) # label(non_clause).  [assumption].
0.45/1.05	6 (all M1 all M2 all M3 all M4 all Dom all DomCod1 all DomCod2 all Cod (morphism(M1,Dom,DomCod1) & morphism(M3,Dom,DomCod2) & (all ElDom (element(ElDom,Dom) -> apply(M4,apply(M3,ElDom)) = apply(M2,apply(M1,ElDom)))) & morphism(M4,DomCod2,Cod) & morphism(M2,DomCod1,Cod) -> commute(M1,M2,M3,M4))) # label(properties_for_commute) # label(axiom) # label(non_clause).  [assumption].
0.45/1.05	7 (all Morphism all Dom all Cod (morphism(Morphism,Dom,Cod) -> (all El1 all El2 (element(El1,Dom) & element(El2,Dom) -> subtract(Cod,apply(Morphism,El1),apply(Morphism,El2)) = apply(Morphism,subtract(Dom,El1,El2)))))) # label(subtract_distribution) # label(axiom) # label(non_clause).  [assumption].
0.45/1.05	8 (all Morphism1 all Morphism2 all Dom all CodDom all Cod (exact(Morphism1,Morphism2) & morphism(Morphism2,CodDom,Cod) & morphism(Morphism1,Dom,CodDom) -> (all ElCodDom (apply(Morphism2,ElCodDom) = zero(Cod) & element(ElCodDom,CodDom) <-> (exists ElDom (element(ElDom,Dom) & apply(Morphism1,ElDom) = ElCodDom)))))) # label(exact_properties) # label(axiom) # label(non_clause).  [assumption].
0.45/1.05	9 (all Morphism all Dom all Cod ((all ElCod (element(ElCod,Cod) -> (exists ElDom (element(ElDom,Dom) & ElCod = apply(Morphism,ElDom))))) & morphism(Morphism,Dom,Cod) -> surjection(Morphism))) # label(properties_for_surjection) # label(axiom) # label(non_clause).  [assumption].
0.45/1.05	10 (all Morphism all Dom all Cod (morphism(Morphism,Dom,Cod) & injection(Morphism) -> (all El1 all El2 (element(El1,Dom) & element(El2,Dom) & apply(Morphism,El2) = apply(Morphism,El1) -> El1 = El2)))) # label(injection_properties) # label(axiom) # label(non_clause).  [assumption].
0.45/1.05	11 (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.45/1.05	12 (all M1 all M2 all M3 all M4 all Dom all DomCod1 all DomCod2 all Cod (commute(M1,M2,M3,M4) & morphism(M2,DomCod1,Cod) & morphism(M4,DomCod2,Cod) & morphism(M3,Dom,DomCod2) & morphism(M1,Dom,DomCod1) -> (all ElDom (element(ElDom,Dom) -> apply(M4,apply(M3,ElDom)) = apply(M2,apply(M1,ElDom)))))) # label(commute_properties) # label(axiom) # label(non_clause).  [assumption].
0.45/1.05	13 (all Morphism all Dom all Cod (morphism(Morphism,Dom,Cod) & (all El1 all El2 (apply(Morphism,El1) = apply(Morphism,El2) & element(El2,Dom) & element(El1,Dom) -> El1 = El2)) -> injection(Morphism))) # label(properties_for_injection) # label(axiom) # label(non_clause).  [assumption].
0.45/1.05	
0.45/1.05	============================== end of process non-clausal formulas ===
0.45/1.05	
0.45/1.05	============================== PROCESS INITIAL CLAUSES ===============
0.45/1.05	
0.45/1.05	============================== PREDICATE ELIMINATION =================
0.45/1.05	14 -surjection(A) | -morphism(A,B,C) | -element(D,C) | element(f1(A,B,C,D),B) # label(surjection_properties) # label(axiom).  [clausify(3)].
0.45/1.05	15 surjection(delta) # label(delta_surjection) # label(axiom).  [assumption].
0.45/1.05	16 surjection(beta) # label(beta_surjection) # label(axiom).  [assumption].
0.45/1.05	17 element(f6(A,B,C),C) | -morphism(A,B,C) | surjection(A) # label(properties_for_surjection) # label(axiom).  [clausify(9)].
0.45/1.05	Derived: -morphism(delta,A,B) | -element(C,B) | element(f1(delta,A,B,C),A).  [resolve(14,a,15,a)].
0.45/1.05	Derived: -morphism(beta,A,B) | -element(C,B) | element(f1(beta,A,B,C),A).  [resolve(14,a,16,a)].
0.45/1.05	Derived: -morphism(A,B,C) | -element(D,C) | element(f1(A,B,C,D),B) | element(f6(A,E,F),F) | -morphism(A,E,F).  [resolve(14,a,17,c)].
0.45/1.05	18 -element(A,B) | apply(C,A) != f6(C,B,D) | -morphism(C,B,D) | surjection(C) # label(properties_for_surjection) # label(axiom).  [clausify(9)].
0.45/1.05	Derived: -element(A,B) | apply(C,A) != f6(C,B,D) | -morphism(C,B,D) | -morphism(C,E,F) | -element(V6,F) | element(f1(C,E,F,V6),E).  [resolve(18,d,14,a)].
0.45/1.05	19 -surjection(A) | -morphism(A,B,C) | -element(D,C) | apply(A,f1(A,B,C,D)) = D # label(surjection_properties) # label(axiom).  [clausify(3)].
0.45/1.05	Derived: -morphism(delta,A,B) | -element(C,B) | apply(delta,f1(delta,A,B,C)) = C.  [resolve(19,a,15,a)].
0.45/1.05	Derived: -morphism(beta,A,B) | -element(C,B) | apply(beta,f1(beta,A,B,C)) = C.  [resolve(19,a,16,a)].
0.45/1.05	Derived: -morphism(A,B,C) | -element(D,C) | apply(A,f1(A,B,C,D)) = D | element(f6(A,E,F),F) | -morphism(A,E,F).  [resolve(19,a,17,c)].
0.45/1.05	Derived: -morphism(A,B,C) | -element(D,C) | apply(A,f1(A,B,C,D)) = D | -element(E,F) | apply(A,E) != f6(A,F,V6) | -morphism(A,F,V6).  [resolve(19,a,18,d)].
0.45/1.05	20 -exact(A,B) | -morphism(B,C,D) | -morphism(A,E,C) | element(F,C) | -element(V6,E) | apply(A,V6) != F # label(exact_properties) # label(axiom).  [clausify(8)].
0.45/1.05	21 exact(alpha,beta) # label(alpha_beta_exact) # label(axiom).  [assumption].
0.45/1.05	22 exact(gammma,delta) # label(gamma_delta_exact) # label(axiom).  [assumption].
0.45/1.05	Derived: -morphism(beta,A,B) | -morphism(alpha,C,A) | element(D,A) | -element(E,C) | apply(alpha,E) != D.  [resolve(20,a,21,a)].
0.45/1.05	Derived: -morphism(delta,A,B) | -morphism(gammma,C,A) | element(D,A) | -element(E,C) | apply(gammma,E) != D.  [resolve(20,a,22,a)].
0.45/1.05	23 -exact(A,B) | -morphism(B,C,D) | -morphism(A,E,C) | apply(B,F) = zero(D) | -element(V6,E) | apply(A,V6) != F # label(exact_properties) # label(axiom).  [clausify(8)].
0.45/1.05	Derived: -morphism(beta,A,B) | -morphism(alpha,C,A) | apply(beta,D) = zero(B) | -element(E,C) | apply(alpha,E) != D.  [resolve(23,a,21,a)].
0.45/1.05	Derived: -morphism(delta,A,B) | -morphism(gammma,C,A) | apply(delta,D) = zero(B) | -element(E,C) | apply(gammma,E) != D.  [resolve(23,a,22,a)].
0.45/1.05	24 -morphism(A,B,C) | element(f3(A,D,B,C,E),B) | element(f2(A,D,B,C,E),C) | -morphism(D,C,E) | exact(A,D) # label(properties_for_exact) # label(axiom).  [clausify(5)].
0.45/1.05	Derived: -morphism(A,B,C) | element(f3(A,D,B,C,E),B) | element(f2(A,D,B,C,E),C) | -morphism(D,C,E) | -morphism(D,F,V6) | -morphism(A,V7,F) | element(V8,F) | -element(V9,V7) | apply(A,V9) != V8.  [resolve(24,e,20,a)].
0.45/1.05	Derived: -morphism(A,B,C) | element(f3(A,D,B,C,E),B) | element(f2(A,D,B,C,E),C) | -morphism(D,C,E) | -morphism(D,F,V6) | -morphism(A,V7,F) | apply(D,V8) = zero(V6) | -element(V9,V7) | apply(A,V9) != V8.  [resolve(24,e,23,a)].
0.45/1.05	25 -exact(A,B) | -morphism(B,C,D) | -morphism(A,E,C) | apply(B,F) != zero(D) | -element(F,C) | element(f5(A,B,E,C,D,F),E) # label(exact_properties) # label(axiom).  [clausify(8)].
0.45/1.05	Derived: -morphism(beta,A,B) | -morphism(alpha,C,A) | apply(beta,D) != zero(B) | -element(D,A) | element(f5(alpha,beta,C,A,B,D),C).  [resolve(25,a,21,a)].
0.45/1.05	Derived: -morphism(delta,A,B) | -morphism(gammma,C,A) | apply(delta,D) != zero(B) | -element(D,A) | element(f5(gammma,delta,C,A,B,D),C).  [resolve(25,a,22,a)].
0.45/1.05	Derived: -morphism(A,B,C) | -morphism(D,E,B) | apply(A,F) != zero(C) | -element(F,B) | element(f5(D,A,E,B,C,F),E) | -morphism(D,V6,V7) | element(f3(D,A,V6,V7,V8),V6) | element(f2(D,A,V6,V7,V8),V7) | -morphism(A,V7,V8).  [resolve(25,a,24,e)].
0.45/1.05	26 -morphism(A,B,C) | element(f3(A,D,B,C,E),B) | apply(D,f2(A,D,B,C,E)) = zero(E) | -morphism(D,C,E) | exact(A,D) # label(properties_for_exact) # label(axiom).  [clausify(5)].
0.45/1.05	Derived: -morphism(A,B,C) | element(f3(A,D,B,C,E),B) | apply(D,f2(A,D,B,C,E)) = zero(E) | -morphism(D,C,E) | -morphism(D,F,V6) | -morphism(A,V7,F) | element(V8,F) | -element(V9,V7) | apply(A,V9) != V8.  [resolve(26,e,20,a)].
0.45/1.05	Derived: -morphism(A,B,C) | element(f3(A,D,B,C,E),B) | apply(D,f2(A,D,B,C,E)) = zero(E) | -morphism(D,C,E) | -morphism(D,F,V6) | -morphism(A,V7,F) | apply(D,V8) = zero(V6) | -element(V9,V7) | apply(A,V9) != V8.  [resolve(26,e,23,a)].
0.45/1.05	Derived: -morphism(A,B,C) | element(f3(A,D,B,C,E),B) | apply(D,f2(A,D,B,C,E)) = zero(E) | -morphism(D,C,E) | -morphism(D,F,V6) | -morphism(A,V7,F) | apply(D,V8) != zero(V6) | -element(V8,F) | element(f5(A,D,V7,F,V6,V8),V7).  [resolve(26,e,25,a)].
0.45/1.05	27 -exact(A,B) | -morphism(B,C,D) | -morphism(A,E,C) | apply(B,F) != zero(D) | -element(F,C) | apply(A,f5(A,B,E,C,D,F)) = F # label(exact_properties) # label(axiom).  [clausify(8)].
0.45/1.05	Derived: -morphism(beta,A,B) | -morphism(alpha,C,A) | apply(beta,D) != zero(B) | -element(D,A) | apply(alpha,f5(alpha,beta,C,A,B,D)) = D.  [resolve(27,a,21,a)].
0.45/1.05	Derived: -morphism(delta,A,B) | -morphism(gammma,C,A) | apply(delta,D) != zero(B) | -element(D,A) | apply(gammma,f5(gammma,delta,C,A,B,D)) = D.  [resolve(27,a,22,a)].
0.45/1.05	Derived: -morphism(A,B,C) | -morphism(D,E,B) | apply(A,F) != zero(C) | -element(F,B) | apply(D,f5(D,A,E,B,C,F)) = F | -morphism(D,V6,V7) | element(f3(D,A,V6,V7,V8),V6) | element(f2(D,A,V6,V7,V8),V7) | -morphism(A,V7,V8).  [resolve(27,a,24,e)].
0.45/1.05	Derived: -morphism(A,B,C) | -morphism(D,E,B) | apply(A,F) != zero(C) | -element(F,B) | apply(D,f5(D,A,E,B,C,F)) = F | -morphism(D,V6,V7) | element(f3(D,A,V6,V7,V8),V6) | apply(A,f2(D,A,V6,V7,V8)) = zero(V8) | -morphism(A,V7,V8).  [resolve(27,a,26,e)].
0.45/1.05	28 -morphism(A,B,C) | apply(A,f3(A,D,B,C,E)) = f2(A,D,B,C,E) | element(f2(A,D,B,C,E),C) | -morphism(D,C,E) | exact(A,D) # label(properties_for_exact) # label(axiom).  [clausify(5)].
0.45/1.05	Derived: -morphism(A,B,C) | apply(A,f3(A,D,B,C,E)) = f2(A,D,B,C,E) | element(f2(A,D,B,C,E),C) | -morphism(D,C,E) | -morphism(D,F,V6) | -morphism(A,V7,F) | element(V8,F) | -element(V9,V7) | apply(A,V9) != V8.  [resolve(28,e,20,a)].
0.45/1.06	Derived: -morphism(A,B,C) | apply(A,f3(A,D,B,C,E)) = f2(A,D,B,C,E) | element(f2(A,D,B,C,E),C) | -morphism(D,C,E) | -morphism(D,F,V6) | -morphism(A,V7,F) | apply(D,V8) = zero(V6) | -element(V9,V7) | apply(A,V9) != V8.  [resolve(28,e,23,a)].
0.45/1.06	Derived: -morphism(A,B,C) | apply(A,f3(A,D,B,C,E)) = f2(A,D,B,C,E) | element(f2(A,D,B,C,E),C) | -morphism(D,C,E) | -morphism(D,F,V6) | -morphism(A,V7,F) | apply(D,V8) != zero(V6) | -element(V8,F) | element(f5(A,D,V7,F,V6,V8),V7).  [resolve(28,e,25,a)].
0.45/1.06	Derived: -morphism(A,B,C) | apply(A,f3(A,D,B,C,E)) = f2(A,D,B,C,E) | element(f2(A,D,B,C,E),C) | -morphism(D,C,E) | -morphism(D,F,V6) | -morphism(A,V7,F) | apply(D,V8) != zero(V6) | -element(V8,F) | apply(A,f5(A,D,V7,F,V6,V8)) = V8.  [resolve(28,e,27,a)].
0.45/1.06	29 -morphism(A,B,C) | apply(A,f3(A,D,B,C,E)) = f2(A,D,B,C,E) | apply(D,f2(A,D,B,C,E)) = zero(E) | -morphism(D,C,E) | exact(A,D) # label(properties_for_exact) # label(axiom).  [clausify(5)].
0.45/1.06	Derived: -morphism(A,B,C) | apply(A,f3(A,D,B,C,E)) = f2(A,D,B,C,E) | apply(D,f2(A,D,B,C,E)) = zero(E) | -morphism(D,C,E) | -morphism(D,F,V6) | -morphism(A,V7,F) | element(V8,F) | -element(V9,V7) | apply(A,V9) != V8.  [resolve(29,e,20,a)].
0.45/1.06	Derived: -morphism(A,B,C) | apply(A,f3(A,D,B,C,E)) = f2(A,D,B,C,E) | apply(D,f2(A,D,B,C,E)) = zero(E) | -morphism(D,C,E) | -morphism(D,F,V6) | -morphism(A,V7,F) | apply(D,V8) = zero(V6) | -element(V9,V7) | apply(A,V9) != V8.  [resolve(29,e,23,a)].
0.45/1.06	Derived: -morphism(A,B,C) | apply(A,f3(A,D,B,C,E)) = f2(A,D,B,C,E) | apply(D,f2(A,D,B,C,E)) = zero(E) | -morphism(D,C,E) | -morphism(D,F,V6) | -morphism(A,V7,F) | apply(D,V8) != zero(V6) | -element(V8,F) | element(f5(A,D,V7,F,V6,V8),V7).  [resolve(29,e,25,a)].
0.45/1.06	Derived: -morphism(A,B,C) | apply(A,f3(A,D,B,C,E)) = f2(A,D,B,C,E) | apply(D,f2(A,D,B,C,E)) = zero(E) | -morphism(D,C,E) | -morphism(D,F,V6) | -morphism(A,V7,F) | apply(D,V8) != zero(V6) | -element(V8,F) | apply(A,f5(A,D,V7,F,V6,V8)) = V8.  [resolve(29,e,27,a)].
0.45/1.06	30 -morphism(A,B,C) | apply(A,D) != f2(A,E,B,C,F) | -element(D,B) | apply(E,f2(A,E,B,C,F)) != zero(F) | -element(f2(A,E,B,C,F),C) | -morphism(E,C,F) | exact(A,E) # label(properties_for_exact) # label(axiom).  [clausify(5)].
0.45/1.06	Derived: -morphism(A,B,C) | apply(A,D) != f2(A,E,B,C,F) | -element(D,B) | apply(E,f2(A,E,B,C,F)) != zero(F) | -element(f2(A,E,B,C,F),C) | -morphism(E,C,F) | -morphism(E,V6,V7) | -morphism(A,V8,V6) | element(V9,V6) | -element(V10,V8) | apply(A,V10) != V9.  [resolve(30,g,20,a)].
0.45/1.06	Derived: -morphism(A,B,C) | apply(A,D) != f2(A,E,B,C,F) | -element(D,B) | apply(E,f2(A,E,B,C,F)) != zero(F) | -element(f2(A,E,B,C,F),C) | -morphism(E,C,F) | -morphism(E,V6,V7) | -morphism(A,V8,V6) | apply(E,V9) = zero(V7) | -element(V10,V8) | apply(A,V10) != V9.  [resolve(30,g,23,a)].
0.45/1.06	Derived: -morphism(A,B,C) | apply(A,D) != f2(A,E,B,C,F) | -element(D,B) | apply(E,f2(A,E,B,C,F)) != zero(F) | -element(f2(A,E,B,C,F),C) | -morphism(E,C,F) | -morphism(E,V6,V7) | -morphism(A,V8,V6) | apply(E,V9) != zero(V7) | -element(V9,V6) | element(f5(A,E,V8,V6,V7,V9),V8).  [resolve(30,g,25,a)].
0.45/1.06	Derived: -morphism(A,B,C) | apply(A,D) != f2(A,E,B,C,F) | -element(D,B) | apply(E,f2(A,E,B,C,F)) != zero(F) | -element(f2(A,E,B,C,F),C) | -morphism(E,C,F) | -morphism(E,V6,V7) | -morphism(A,V8,V6) | apply(E,V9) != zero(V7) | -element(V9,V6) | apply(A,f5(A,E,V8,V6,V7,V9)) = V9.  [resolve(30,g,27,a)].
0.45/1.06	31 -commute(A,B,C,D) | -morphism(B,E,F) | -morphism(D,V6,F) | -morphism(C,V7,V6) | -morphism(A,V7,E) | -element(V8,V7) | apply(D,apply(C,V8)) = apply(B,apply(A,V8)) # label(commute_properties) # label(axiom).  [clausify(12)].
0.45/1.06	32 commute(alpha,g,f,gamma) # label(alpha_g_f_gamma_commute) # label(axiom).  [assumption].
0.45/1.06	33 commute(beta,h,g,delta) # label(beta_h_g_delta_commute) # label(axiom).  [assumption].
0.45/1.06	34 -morphism(A,B,C) | -morphism(D,B,E) | element(f4(A,F,D,V6,B,C,E,V7),B) | -morphism(V6,E,V7) | -morphism(F,C,V7) | commute(A,F,D,V6) # label(properties_for_commute) # label(axiom).  [cCputime limit exceeded (core dumped)
180.01/180.29	EOF