0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.34 % Computer : n006.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 : 1440 0.12/0.34 % WCLimit : 180 0.12/0.34 % DateTime : Mon Jul 3 07:35:21 EDT 2023 0.12/0.34 % CPUTime : 0.65/0.95 ============================== Prover9 =============================== 0.65/0.95 Prover9 (32) version 2009-11A, November 2009. 0.65/0.95 Process 1514 was started by sandbox on n006.cluster.edu, 0.65/0.95 Mon Jul 3 07:35:22 2023 0.65/0.95 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_1360_n006.cluster.edu". 0.65/0.95 ============================== end of head =========================== 0.65/0.95 0.65/0.95 ============================== INPUT ================================= 0.65/0.95 0.65/0.95 % Reading from file /tmp/Prover9_1360_n006.cluster.edu 0.65/0.95 0.65/0.95 set(prolog_style_variables). 0.65/0.95 set(auto2). 0.65/0.95 % set(auto2) -> set(auto). 0.65/0.95 % set(auto) -> set(auto_inference). 0.65/0.95 % set(auto) -> set(auto_setup). 0.65/0.95 % set(auto_setup) -> set(predicate_elim). 0.65/0.95 % set(auto_setup) -> assign(eq_defs, unfold). 0.65/0.95 % set(auto) -> set(auto_limits). 0.65/0.95 % set(auto_limits) -> assign(max_weight, "100.000"). 0.65/0.95 % set(auto_limits) -> assign(sos_limit, 20000). 0.65/0.95 % set(auto) -> set(auto_denials). 0.65/0.95 % set(auto) -> set(auto_process). 0.65/0.95 % set(auto2) -> assign(new_constants, 1). 0.65/0.95 % set(auto2) -> assign(fold_denial_max, 3). 0.65/0.95 % set(auto2) -> assign(max_weight, "200.000"). 0.65/0.95 % set(auto2) -> assign(max_hours, 1). 0.65/0.95 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.65/0.95 % set(auto2) -> assign(max_seconds, 0). 0.65/0.95 % set(auto2) -> assign(max_minutes, 5). 0.65/0.95 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.65/0.95 % set(auto2) -> set(sort_initial_sos). 0.65/0.95 % set(auto2) -> assign(sos_limit, -1). 0.65/0.95 % set(auto2) -> assign(lrs_ticks, 3000). 0.65/0.95 % set(auto2) -> assign(max_megs, 400). 0.65/0.95 % set(auto2) -> assign(stats, some). 0.65/0.95 % set(auto2) -> clear(echo_input). 0.65/0.95 % set(auto2) -> set(quiet). 0.65/0.95 % set(auto2) -> clear(print_initial_clauses). 0.65/0.95 % set(auto2) -> clear(print_given). 0.65/0.95 assign(lrs_ticks,-1). 0.65/0.95 assign(sos_limit,10000). 0.65/0.95 assign(order,kbo). 0.65/0.95 set(lex_order_vars). 0.65/0.95 clear(print_given). 0.65/0.95 0.65/0.95 % formulas(sos). % not echoed (17 formulas) 0.65/0.95 0.65/0.95 ============================== end of input ========================== 0.65/0.95 0.65/0.95 % From the command line: assign(max_seconds, 1440). 0.65/0.95 0.65/0.95 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.65/0.95 0.65/0.95 % Formulas that are not ordinary clauses: 0.65/0.95 1 (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.65/0.95 2 (all Morphism1 all Morphism2 all Dom all CodDom all Cod (morphism(Morphism1,Dom,CodDom) & (all ElCodDom (zero(Cod) = apply(Morphism2,ElCodDom) & element(ElCodDom,CodDom) <-> (exists ElDom (ElCodDom = apply(Morphism1,ElDom) & element(ElDom,Dom))))) & morphism(Morphism2,CodDom,Cod) -> exact(Morphism1,Morphism2))) # label(properties_for_exact) # label(axiom) # label(non_clause). [assumption]. 0.65/0.95 3 (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.65/0.95 4 (all Morphism1 all Morphism2 all Dom all CodDom all Cod (exact(Morphism1,Morphism2) & morphism(Morphism1,Dom,CodDom) & morphism(Morphism2,CodDom,Cod) -> (all ElCodDom ((exists ElDom (element(ElDom,Dom) & ElCodDom = apply(Morphism1,ElDom))) <-> apply(Morphism2,ElCodDom) = zero(Cod) & element(ElCodDom,CodDom))))) # label(exact_properties) # label(axiom) # label(non_clause). [assumption]. 0.65/0.95 5 (all Morphism all Dom all Cod (injection(Morphism) & morphism(Morphism,Dom,Cod) -> (all El1 all El2 (element(El2,Dom) & apply(Morphism,El1) = apply(Morphism,El2) & element(El1,Dom) -> El1 = El2)))) # label(injection_properties) # label(axiom) # label(non_clause). [assumption]. 0.65/0.95 6 (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.65/0.95 7 (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) & (all ElDom (element(ElDom,Dom) -> apply(M2,apply(M1,ElDom)) = apply(M4,apply(M3,ElDom)))) & morphism(M4,DomCod2,Cod) -> commute(M1,M2,M3,M4))) # label(properties_for_commute) # label(axiom) # label(non_clause). [assumption]. 0.65/0.95 8 (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.65/0.95 9 (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.65/0.95 10 (all Dom all El (element(El,Dom) -> zero(Dom) = subtract(Dom,El,El))) # label(subtract_to_0) # label(axiom) # label(non_clause). [assumption]. 0.65/0.95 11 (all Morphism all Dom all Cod ((all El1 all El2 (element(El2,Dom) & apply(Morphism,El2) = apply(Morphism,El1) & element(El1,Dom) -> El1 = El2)) & morphism(Morphism,Dom,Cod) -> injection(Morphism))) # label(properties_for_injection) # label(axiom) # label(non_clause). [assumption]. 0.65/0.95 12 (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(M4,DomCod2,Cod) & morphism(M3,Dom,DomCod2) & commute(M1,M2,M3,M4) -> (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.65/0.95 13 (all Dom all El1 all El2 (element(El2,Dom) & element(El1,Dom) -> El2 = subtract(Dom,El1,subtract(Dom,El1,El2)))) # label(subtract_cancellation) # label(axiom) # label(non_clause). [assumption]. 0.65/0.95 14 (all Morphism all Dom all Cod (injection_2(Morphism) & morphism(Morphism,Dom,Cod) -> (all El (element(El,Dom) & zero(Cod) = apply(Morphism,El) -> El = zero(Dom))))) # label(injection_properties_2) # label(axiom) # label(non_clause). [assumption]. 0.65/0.95 15 (all Morphism all Dom all Cod ((all El (apply(Morphism,El) = zero(Cod) & element(El,Dom) -> El = zero(Dom))) & morphism(Morphism,Dom,Cod) -> injection_2(Morphism))) # label(properties_for_injection_2) # label(axiom) # label(non_clause). [assumption]. 0.65/0.95 16 -(injection(x) <-> injection_2(x)) # label(my) # label(negated_conjecture) # label(non_clause). [assumption]. 0.65/0.95 0.65/0.95 ============================== end of process non-clausal formulas === 0.65/0.95 0.65/0.95 ============================== PROCESS INITIAL CLAUSES =============== 0.65/0.95 0.65/0.95 ============================== PREDICATE ELIMINATION ================= 0.65/0.95 17 -surjection(A) | -morphism(A,B,C) | -element(D,C) | element(f4(A,B,C,D),B) # label(surjection_properties) # label(axiom). [clausify(6)]. 0.65/0.95 18 element(f6(A,B,C),C) | -morphism(A,B,C) | surjection(A) # label(properties_for_surjection) # label(axiom). [clausify(8)]. 0.65/0.95 Derived: -morphism(A,B,C) | -element(D,C) | element(f4(A,B,C,D),B) | element(f6(A,E,F),F) | -morphism(A,E,F). [resolve(17,a,18,c)]. 0.65/0.95 19 -element(A,B) | apply(C,A) != f6(C,B,D) | -morphism(C,B,D) | surjection(C) # label(properties_for_surjection) # label(axiom). [clausify(8)]. 0.65/0.95 Derived: -element(A,B) | apply(C,A) != f6(C,B,D) | -morphism(C,B,D) | -morphism(C,E,F) | -element(V6,F) | element(f4(C,E,F,V6),E). [resolve(19,d,17,a)]. 0.65/0.95 20 -surjection(A) | -morphism(A,B,C) | -element(D,C) | apply(A,f4(A,B,C,D)) = D # label(surjection_properties) # label(axiom). [clausify(6)]. 0.65/0.95 Derived: -morphism(A,B,C) | -element(D,C) | apply(A,f4(A,B,C,D)) = D | element(f6(A,E,F),F) | -morphism(A,E,F). [resolve(20,a,18,c)]. 0.65/0.95 Derived: -morphism(A,B,C) | -element(D,C) | apply(A,f4(A,B,C,D)) = D | -element(E,F) | apply(A,E) != f6(A,F,V6) | -morphism(A,F,V6). [resolve(20,a,19,d)]. 0.65/0.95 21 -morphism(A,B,C) | element(f1(A,D,B,C,E),C) | element(f2(A,D,B,C,E),B) | -morphism(D,C,E) | exact(A,D) # label(properties_for_exact) # label(axiom). [clausify(2)]. 0.65/0.95 22 -exact(A,B) | -morphism(A,C,D) | -morphism(B,D,E) | -element(F,C) | apply(A,F) != V6 | element(V6,D) # label(exact_properties) # label(axiom). [clausify(4)]. 0.65/0.95 23 -exact(A,B) | -morphism(A,C,D) | -morphism(B,D,E) | -element(F,C) | apply(A,F) != V6 | zero(E) = apply(B,V6) # label(exact_properties) # label(axiom). [clausify(4)]. 0.65/0.95 Derived: -morphism(A,B,C) | element(f1(A,D,B,C,E),C) | element(f2(A,D,B,C,E),B) | -morphism(D,C,E) | -morphism(A,F,V6) | -morphism(D,V6,V7) | -element(V8,F) | apply(A,V8) != V9 | element(V9,V6). [resolve(21,e,22,a)]. 0.65/0.95 Derived: -morphism(A,B,C) | element(f1(A,D,B,C,E),C) | element(f2(A,D,B,C,E),B) | -morphism(D,C,E) | -morphism(A,F,V6) | -morphism(D,V6,V7) | -element(V8,F) | apply(A,V8) != V9 | zero(V7) = apply(D,V9). [resolve(21,e,23,a)]. 0.65/0.95 24 -exact(A,B) | -morphism(A,C,D) | -morphism(B,D,E) | element(f3(A,B,C,D,E,F),C) | zero(E) != apply(B,F) | -element(F,D) # label(exact_properties) # label(axiom). [clausify(4)]. 0.65/0.95 Derived: -morphism(A,B,C) | -morphism(D,C,E) | element(f3(A,D,B,C,E,F),B) | zero(E) != apply(D,F) | -element(F,C) | -morphism(A,V6,V7) | element(f1(A,D,V6,V7,V8),V7) | element(f2(A,D,V6,V7,V8),V6) | -morphism(D,V7,V8). [resolve(24,a,21,e)]. 0.65/0.95 25 -morphism(A,B,C) | zero(D) = apply(E,f1(A,E,B,C,D)) | element(f2(A,E,B,C,D),B) | -morphism(E,C,D) | exact(A,E) # label(properties_for_exact) # label(axiom). [clausify(2)]. 0.65/0.95 Derived: -morphism(A,B,C) | zero(D) = apply(E,f1(A,E,B,C,D)) | element(f2(A,E,B,C,D),B) | -morphism(E,C,D) | -morphism(A,F,V6) | -morphism(E,V6,V7) | -element(V8,F) | apply(A,V8) != V9 | element(V9,V6). [resolve(25,e,22,a)]. 0.65/0.95 Derived: -morphism(A,B,C) | zero(D) = apply(E,f1(A,E,B,C,D)) | element(f2(A,E,B,C,D),B) | -morphism(E,C,D) | -morphism(A,F,V6) | -morphism(E,V6,V7) | -element(V8,F) | apply(A,V8) != V9 | zero(V7) = apply(E,V9). [resolve(25,e,23,a)]. 0.65/0.95 Derived: -morphism(A,B,C) | zero(D) = apply(E,f1(A,E,B,C,D)) | element(f2(A,E,B,C,D),B) | -morphism(E,C,D) | -morphism(A,F,V6) | -morphism(E,V6,V7) | element(f3(A,E,F,V6,V7,V8),F) | zero(V7) != apply(E,V8) | -element(V8,V6). [resolve(25,e,24,a)]. 0.65/0.95 26 -exact(A,B) | -morphism(A,C,D) | -morphism(B,D,E) | apply(A,f3(A,B,C,D,E,F)) = F | zero(E) != apply(B,F) | -element(F,D) # label(exact_properties) # label(axiom). [clausify(4)]. 0.65/0.95 Derived: -morphism(A,B,C) | -morphism(D,C,E) | apply(A,f3(A,D,B,C,E,F)) = F | zero(E) != apply(D,F) | -element(F,C) | -morphism(A,V6,V7) | element(f1(A,D,V6,V7,V8),V7) | element(f2(A,D,V6,V7,V8),V6) | -morphism(D,V7,V8). [resolve(26,a,21,e)]. 0.65/0.95 Derived: -morphism(A,B,C) | -morphism(D,C,E) | apply(A,f3(A,D,B,C,E,F)) = F | zero(E) != apply(D,F) | -element(F,C) | -morphism(A,V6,V7) | zero(V8) = apply(D,f1(A,D,V6,V7,V8)) | element(f2(A,D,V6,V7,V8),V6) | -morphism(D,V7,V8). [resolve(26,a,25,e)]. 0.65/0.95 27 -morphism(A,B,C) | element(f1(A,D,B,C,E),C) | apply(A,f2(A,D,B,C,E)) = f1(A,D,B,C,E) | -morphism(D,C,E) | exact(A,D) # label(properties_for_exact) # label(axiom). [clausify(2)]. 0.65/0.95 Derived: -morphism(A,B,C) | element(f1(A,D,B,C,E),C) | apply(A,f2(A,D,B,C,E)) = f1(A,D,B,C,E) | -morphism(D,C,E) | -morphism(A,F,V6) | -morphism(D,V6,V7) | -element(V8,F) | apply(A,V8) != V9 | element(V9,V6). [resolve(27,e,22,a)]. 0.65/0.95 Derived: -morphism(A,B,C) | element(f1(A,D,B,C,E),C) | apply(A,f2(A,D,B,C,E)) = f1(A,D,B,C,E) | -morphism(D,C,E) | -morphism(A,F,V6) | -morphism(D,V6,V7) | -element(V8,F) | apply(A,V8) != V9 | zero(V7) = apply(D,V9). [resolve(27,e,23,a)]. 0.65/0.95 Derived: -morphism(A,B,C) | element(f1(A,D,B,C,E),C) | apply(A,f2(A,D,B,C,E)) = f1(A,D,B,C,E) | -morphism(D,C,E) | -morphism(A,F,V6) | -morphism(D,V6,V7) | element(f3(A,D,F,V6,V7,V8),F) | zero(V7) != apply(D,V8) | -element(V8,V6). [resolve(27,e,24,a)]. 0.65/0.95 Derived: -morphism(A,B,C) | element(f1(A,D,B,C,E),C) | apply(A,f2(A,D,B,C,E)) = f1(A,D,B,C,E) | -morphism(D,C,E) | -morphism(A,F,V6) | -morphism(D,V6,V7) | apply(A,f3(A,D,F,V6,V7,V8)) = V8 | zero(V7) != apply(D,V8) | -element(V8,V6). [resolve(27,e,26,a)]. 0.65/0.95 28 -morphism(A,B,C) | zero(D) = apply(E,f1(A,E,B,C,D)) | apply(A,f2(A,E,B,C,D)) = f1(A,E,B,C,D) | -morphism(E,C,D) | exact(A,E) # label(properties_for_exact) # label(axiom). [clausify(2)]. 0.65/0.95 Derived: -morphism(A,B,C) | zero(D) = apply(E,f1(A,E,B,C,D)) | apply(A,f2(A,E,B,C,D)) = f1(A,E,B,C,D) | -morphism(E,C,D) | -morphism(A,F,V6) | -morphism(E,V6,V7) | -element(V8,F) | apply(A,V8) != V9 | element(V9,V6). [resolve(28,e,22,a)]. 4.23/4.58 Derived: -morphism(A,B,C) | zero(D) = apply(E,f1(A,E,B,C,D)) | apply(A,f2(A,E,B,C,D)) = f1(A,E,B,C,D) | -morphism(E,C,D) | -morphism(A,F,V6) | -morphism(E,V6,V7) | -element(V8,F) | apply(A,V8) != V9 | zero(V7) = apply(E,V9). [resolve(28,e,23,a)]. 4.23/4.58 Derived: -morphism(A,B,C) | zero(D) = apply(E,f1(A,E,B,C,D)) | apply(A,f2(A,E,B,C,D)) = f1(A,E,B,C,D) | -morphism(E,C,D) | -morphism(A,F,V6) | -morphism(E,V6,V7) | element(f3(A,E,F,V6,V7,V8),F) | zero(V7) != apply(E,V8) | -element(V8,V6). [resolve(28,e,24,a)]. 4.23/4.58 Derived: -morphism(A,B,C) | zero(D) = apply(E,f1(A,E,B,C,D)) | apply(A,f2(A,E,B,C,D)) = f1(A,E,B,C,D) | -morphism(E,C,D) | -morphism(A,F,V6) | -morphism(E,V6,V7) | apply(A,f3(A,E,F,V6,V7,V8)) = V8 | zero(V7) != apply(E,V8) | -element(V8,V6). [resolve(28,e,26,a)]. 4.23/4.58 29 -morphism(A,B,C) | zero(D) != apply(E,f1(A,E,B,C,D)) | -element(f1(A,E,B,C,D),C) | apply(A,F) != f1(A,E,B,C,D) | -element(F,B) | -morphism(E,C,D) | exact(A,E) # label(properties_for_exact) # label(axiom). [clausify(2)]. 4.23/4.58 Derived: -morphism(A,B,C) | zero(D) != apply(E,f1(A,E,B,C,D)) | -element(f1(A,E,B,C,D),C) | apply(A,F) != f1(A,E,B,C,D) | -element(F,B) | -morphism(E,C,D) | -morphism(A,V6,V7) | -morphism(E,V7,V8) | -element(V9,V6) | apply(A,V9) != V10 | element(V10,V7). [resolve(29,g,22,a)]. 4.23/4.58 Derived: -morphism(A,B,C) | zero(D) != apply(E,f1(A,E,B,C,D)) | -element(f1(A,E,B,C,D),C) | apply(A,F) != f1(A,E,B,C,D) | -element(F,B) | -morphism(E,C,D) | -morphism(A,V6,V7) | -morphism(E,V7,V8) | -element(V9,V6) | apply(A,V9) != V10 | zero(V8) = apply(E,V10). [resolve(29,g,23,a)]. 4.23/4.58 Derived: -morphism(A,B,C) | zero(D) != apply(E,f1(A,E,B,C,D)) | -element(f1(A,E,B,C,D),C) | apply(A,F) != f1(A,E,B,C,D) | -element(F,B) | -morphism(E,C,D) | -morphism(A,V6,V7) | -morphism(E,V7,V8) | element(f3(A,E,V6,V7,V8,V9),V6) | zero(V8) != apply(E,V9) | -element(V9,V7). [resolve(29,g,24,a)]. 4.23/4.58 Derived: -morphism(A,B,C) | zero(D) != apply(E,f1(A,E,B,C,D)) | -element(f1(A,E,B,C,D),C) | apply(A,F) != f1(A,E,B,C,D) | -element(F,B) | -morphism(E,C,D) | -morphism(A,V6,V7) | -morphism(E,V7,V8) | apply(A,f3(A,E,V6,V7,V8,V9)) = V9 | zero(V8) != apply(E,V9) | -element(V9,V7). [resolve(29,g,26,a)]. 4.23/4.58 30 -morphism(A,B,C) | -morphism(D,C,E) | -morphism(F,V6,E) | -morphism(V7,B,V6) | -commute(A,D,V7,F) | -element(V8,B) | apply(F,apply(V7,V8)) = apply(D,apply(A,V8)) # label(commute_properties) # label(axiom). [clausify(12)]. 4.23/4.58 31 -morphism(A,B,C) | -morphism(D,C,E) | -morphism(F,B,V6) | element(f5(A,D,F,V7,B,C,V6,E),B) | -morphism(V7,V6,E) | commute(A,D,F,V7) # label(properties_for_commute) # label(axiom). [clausify(7)]. 4.23/4.58 Derived: -morphism(A,B,C) | -morphism(D,C,E) | -morphism(F,V6,E) | -morphism(V7,B,V6) | -element(V8,B) | apply(F,apply(V7,V8)) = apply(D,apply(A,V8)) | -morphism(A,V9,V10) | -morphism(D,V10,V11) | -morphism(V7,V9,V12) | element(f5(A,D,V7,F,V9,V10,V12,V11),V9) | -morphism(F,V12,V11). [resolve(30,e,31,f)]. 4.23/4.58 32 -morphism(A,B,C) | -morphism(D,C,E) | -morphism(F,B,V6) | apply(V7,apply(F,f5(A,D,F,V7,B,C,V6,E))) != apply(D,apply(A,f5(A,D,F,V7,B,C,V6,E))) | -morphism(V7,V6,E) | commute(A,D,F,V7) # label(properties_for_commute) # label(axiom). [clausify(7)]. 4.23/4.58 Derived: -morphism(A,B,C) | -morphism(D,C,E) | -morphism(F,B,V6) | apply(V7,apply(F,f5(A,D,F,V7,B,C,V6,E))) != apply(D,apply(A,f5(A,D,F,V7,B,C,V6,E))) | -morphism(V7,V6,E) | -morphism(A,V8,V9) | -morphism(D,V9,V10) | -morphism(V7,V11,V10) | -morphism(F,V8,V11) | -element(V12,V8) | apply(V7,apply(F,V12)) = apply(D,apply(A,V12)). [resolve(32,f,30,e)]. 4.23/4.58 4.23/4.58 ============================== end predicate elimination ============= 4.23/4.58 4.23/4.58 Auto_denials: (non-Horn, no changes). 4.23/4.58 4.23/4.58 Term ordering decisions: 4.23/4.58 4.23/4.58 % Assigning unary symbol zero kb_weight 0 and highest precedence (20). 4.23/4.58 Function symbol KB weights: x=1. any1=1. any2=1. apply=1. subtract=1. f6=1. f7=1. f8=1. f9=1. f4=1. f1=1. f2=1. f3=1. f5=1. zero=0. 4.23/4.58 4.23/4.58 ============================== end of process initial clauses ======== 4.23/4.58 4.23/4.58 ============================== CLAUSES FOR SEARCH ==================== 4.23/4.58 4.23/4.58 ============================== end of clauses fAlarm clock 179.60/180.02 Prover9 interrupted 179.60/180.02 EOF