0.06/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.11/0.33 % Computer : n016.cluster.edu 0.11/0.33 % Model : x86_64 x86_64 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.33 % Memory : 8042.1875MB 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.33 % CPULimit : 960 0.11/0.33 % WCLimit : 120 0.11/0.33 % DateTime : Tue Aug 9 05:26:57 EDT 2022 0.11/0.33 % CPUTime : 0.43/1.00 ============================== Prover9 =============================== 0.43/1.00 Prover9 (32) version 2009-11A, November 2009. 0.43/1.00 Process 23324 was started by sandbox2 on n016.cluster.edu, 0.43/1.00 Tue Aug 9 05:26:57 2022 0.43/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_23071_n016.cluster.edu". 0.43/1.00 ============================== end of head =========================== 0.43/1.00 0.43/1.00 ============================== INPUT ================================= 0.43/1.00 0.43/1.00 % Reading from file /tmp/Prover9_23071_n016.cluster.edu 0.43/1.00 0.43/1.00 set(prolog_style_variables). 0.43/1.00 set(auto2). 0.43/1.00 % set(auto2) -> set(auto). 0.43/1.00 % set(auto) -> set(auto_inference). 0.43/1.00 % set(auto) -> set(auto_setup). 0.43/1.00 % set(auto_setup) -> set(predicate_elim). 0.43/1.00 % set(auto_setup) -> assign(eq_defs, unfold). 0.43/1.00 % set(auto) -> set(auto_limits). 0.43/1.00 % set(auto_limits) -> assign(max_weight, "100.000"). 0.43/1.00 % set(auto_limits) -> assign(sos_limit, 20000). 0.43/1.00 % set(auto) -> set(auto_denials). 0.43/1.00 % set(auto) -> set(auto_process). 0.43/1.00 % set(auto2) -> assign(new_constants, 1). 0.43/1.00 % set(auto2) -> assign(fold_denial_max, 3). 0.43/1.00 % set(auto2) -> assign(max_weight, "200.000"). 0.43/1.00 % set(auto2) -> assign(max_hours, 1). 0.43/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.43/1.00 % set(auto2) -> assign(max_seconds, 0). 0.43/1.00 % set(auto2) -> assign(max_minutes, 5). 0.43/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.43/1.00 % set(auto2) -> set(sort_initial_sos). 0.43/1.00 % set(auto2) -> assign(sos_limit, -1). 0.43/1.00 % set(auto2) -> assign(lrs_ticks, 3000). 0.43/1.00 % set(auto2) -> assign(max_megs, 400). 0.43/1.00 % set(auto2) -> assign(stats, some). 0.43/1.00 % set(auto2) -> clear(echo_input). 0.43/1.00 % set(auto2) -> set(quiet). 0.43/1.00 % set(auto2) -> clear(print_initial_clauses). 0.43/1.00 % set(auto2) -> clear(print_given). 0.43/1.00 assign(lrs_ticks,-1). 0.43/1.00 assign(sos_limit,10000). 0.43/1.00 assign(order,kbo). 0.43/1.00 set(lex_order_vars). 0.43/1.00 clear(print_given). 0.43/1.00 0.43/1.00 % formulas(sos). % not echoed (43 formulas) 0.43/1.00 0.43/1.00 ============================== end of input ========================== 0.43/1.00 0.43/1.00 % From the command line: assign(max_seconds, 960). 0.43/1.00 0.43/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.43/1.00 0.43/1.00 % Formulas that are not ordinary clauses: 0.43/1.00 1 (all A (relation(A) -> (all B all C ((all D (in(D,C) <-> (exists E (in(ordered_pair(D,E),A) & in(E,B))))) <-> C = relation_inverse_image(A,B))))) # label(d14_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 2 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 3 (all A (empty(A) -> empty_set = A)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 4 (all A all B -empty(unordered_pair(A,B))) # label(fc3_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 5 (all A all B -(A != B & empty(B) & empty(A))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 6 (all A (-empty(A) -> (exists B (element(B,powerset(A)) & -empty(B))))) # label(rc1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 7 (all A -empty(powerset(A))) # label(fc1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 8 (all A all B (subset(A,B) <-> (all C (in(C,A) -> in(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 9 (exists A (relation(A) & function(A) & one_to_one(A))) # label(rc3_funct_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 10 (all A all B all C -(element(B,powerset(C)) & empty(C) & in(A,B))) # label(t5_subset) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 11 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 12 (all A (relation(A) & -empty(A) -> -empty(relation_dom(A)))) # label(fc5_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 13 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 14 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 15 (all A (empty(A) -> function(A))) # label(cc1_funct_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 16 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 17 (exists A (relation(A) & relation_empty_yielding(A))) # label(rc3_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 18 (exists A (function(A) & empty(A) & relation(A))) # label(rc2_funct_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 19 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 20 (exists A (-empty(A) & relation(A))) # label(rc2_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 21 (all A all B all C (element(B,powerset(C)) & in(A,B) -> element(A,C))) # label(t4_subset) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 22 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 23 (all A exists B (element(B,powerset(A)) & empty(B))) # label(rc2_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 24 (all A all B (element(A,B) -> in(A,B) | empty(B))) # label(t2_subset) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 25 (all A (empty(A) -> relation(A))) # label(cc1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 26 (all A (empty(A) -> empty(relation_dom(A)) & relation(relation_dom(A)))) # label(fc7_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 27 (all A (relation(A) -> (all B all C (C = relation_image(A,B) <-> (all D ((exists E (in(E,B) & in(ordered_pair(E,D),A))) <-> in(D,C))))))) # label(d13_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 28 (all A (function(A) & empty(A) & relation(A) -> one_to_one(A) & function(A) & relation(A))) # label(cc2_funct_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 29 (all A (relation(A) -> (all B (relation_dom(A) = B <-> (all C ((exists D in(ordered_pair(C,D),A)) <-> in(C,B))))))) # label(d4_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 30 (all A all B unordered_pair(unordered_pair(A,B),singleton(A)) = ordered_pair(A,B)) # label(d5_tarski) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 31 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 32 (all A all B (subset(A,B) <-> element(A,powerset(B)))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 33 (exists A (relation(A) & function(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 34 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 35 (exists A (empty(A) & relation(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 36 (all A -empty(singleton(A))) # label(fc2_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.00 37 -(all A all B (relation(B) -> (subset(A,relation_dom(B)) -> subset(A,relation_inverse_image(B,relation_image(B,A)))))) # label(t146_funct_1) # label(negated_conjecture) # label(non_clause). [assumption]. 0.43/1.00 0.43/1.00 ============================== end of process non-clausal formulas === 0.43/1.00 0.43/1.00 ============================== PROCESS INITIAL CLAUSES =============== 0.43/1.00 0.43/1.00 ============================== PREDICATE ELIMINATION ================= 0.43/1.00 38 -relation(A) | empty(A) | -empty(relation_dom(A)) # label(fc5_relat_1) # label(axiom). [clausify(12)]. 0.43/1.00 39 relation(empty_set) # label(fc12_relat_1_AndRHS_AndLHS) # label(axiom). [assumption]. 0.43/1.00 40 relation(c1) # label(rc3_funct_1) # label(axiom). [clausify(9)]. 0.43/1.00 41 relation(c3) # label(rc3_relat_1) # label(axiom). [clausify(17)]. 0.43/1.00 42 relation(c4) # label(rc2_funct_1) # label(axiom). [clausify(18)]. 0.43/1.00 43 relation(c6) # label(rc2_relat_1) # label(axiom). [clausify(20)]. 0.43/1.00 44 relation(empty_set) # label(fc4_relat_1_AndLHS) # label(axiom). [assumption]. 0.43/1.00 45 relation(c7) # label(rc1_funct_1) # label(axiom). [clausify(33)]. 0.43/1.00 46 relation(c8) # label(rc1_relat_1) # label(axiom). [clausify(35)]. 0.43/1.00 47 relation(c10) # label(t146_funct_1) # label(negated_conjecture). [clausify(37)]. 0.43/1.00 48 -empty(A) | relation(A) # label(cc1_relat_1) # label(axiom). [clausify(25)]. 0.43/1.00 49 -empty(A) | relation(relation_dom(A)) # label(fc7_relat_1) # label(axiom). [clausify(26)]. 0.43/1.01 Derived: empty(empty_set) | -empty(relation_dom(empty_set)). [resolve(38,a,39,a)]. 0.43/1.01 Derived: empty(c1) | -empty(relation_dom(c1)). [resolve(38,a,40,a)]. 0.43/1.01 Derived: empty(c3) | -empty(relation_dom(c3)). [resolve(38,a,41,a)]. 0.43/1.01 Derived: empty(c4) | -empty(relation_dom(c4)). [resolve(38,a,42,a)]. 0.43/1.01 Derived: empty(c6) | -empty(relation_dom(c6)). [resolve(38,a,43,a)]. 0.43/1.01 Derived: empty(c7) | -empty(relation_dom(c7)). [resolve(38,a,45,a)]. 0.43/1.01 Derived: empty(c8) | -empty(relation_dom(c8)). [resolve(38,a,46,a)]. 0.43/1.01 Derived: empty(c10) | -empty(relation_dom(c10)). [resolve(38,a,47,a)]. 0.43/1.01 Derived: empty(relation_dom(A)) | -empty(relation_dom(relation_dom(A))) | -empty(A). [resolve(38,a,49,b)]. 0.43/1.01 50 -function(A) | -empty(A) | -relation(A) | one_to_one(A) # label(cc2_funct_1) # label(axiom). [clausify(28)]. 0.43/1.01 Derived: -function(empty_set) | -empty(empty_set) | one_to_one(empty_set). [resolve(50,c,39,a)]. 0.43/1.01 Derived: -function(c1) | -empty(c1) | one_to_one(c1). [resolve(50,c,40,a)]. 0.43/1.01 Derived: -function(c3) | -empty(c3) | one_to_one(c3). [resolve(50,c,41,a)]. 0.43/1.01 Derived: -function(c4) | -empty(c4) | one_to_one(c4). [resolve(50,c,42,a)]. 0.43/1.01 Derived: -function(c6) | -empty(c6) | one_to_one(c6). [resolve(50,c,43,a)]. 0.43/1.01 Derived: -function(c7) | -empty(c7) | one_to_one(c7). [resolve(50,c,45,a)]. 0.43/1.01 Derived: -function(c8) | -empty(c8) | one_to_one(c8). [resolve(50,c,46,a)]. 0.43/1.01 Derived: -function(c10) | -empty(c10) | one_to_one(c10). [resolve(50,c,47,a)]. 0.43/1.01 Derived: -function(A) | -empty(A) | one_to_one(A) | -empty(A). [resolve(50,c,48,b)]. 0.43/1.01 51 -relation(A) | relation_dom(A) != B | -in(ordered_pair(C,D),A) | in(C,B) # label(d4_relat_1) # label(axiom). [clausify(29)]. 0.43/1.01 Derived: relation_dom(empty_set) != A | -in(ordered_pair(B,C),empty_set) | in(B,A). [resolve(51,a,39,a)]. 0.43/1.01 Derived: relation_dom(c1) != A | -in(ordered_pair(B,C),c1) | in(B,A). [resolve(51,a,40,a)]. 0.43/1.01 Derived: relation_dom(c3) != A | -in(ordered_pair(B,C),c3) | in(B,A). [resolve(51,a,41,a)]. 0.43/1.01 Derived: relation_dom(c4) != A | -in(ordered_pair(B,C),c4) | in(B,A). [resolve(51,a,42,a)]. 0.43/1.01 Derived: relation_dom(c6) != A | -in(ordered_pair(B,C),c6) | in(B,A). [resolve(51,a,43,a)]. 0.43/1.01 Derived: relation_dom(c7) != A | -in(ordered_pair(B,C),c7) | in(B,A). [resolve(51,a,45,a)]. 0.43/1.01 Derived: relation_dom(c8) != A | -in(ordered_pair(B,C),c8) | in(B,A). [resolve(51,a,46,a)]. 0.43/1.01 Derived: relation_dom(c10) != A | -in(ordered_pair(B,C),c10) | in(B,A). [resolve(51,a,47,a)]. 0.43/1.01 Derived: relation_dom(A) != B | -in(ordered_pair(C,D),A) | in(C,B) | -empty(A). [resolve(51,a,48,b)]. 0.43/1.01 Derived: relation_dom(relation_dom(A)) != B | -in(ordered_pair(C,D),relation_dom(A)) | in(C,B) | -empty(A). [resolve(51,a,49,b)]. 0.43/1.01 52 -relation(A) | -in(B,C) | in(f3(A,D,C,B),D) | relation_inverse_image(A,D) != C # label(d14_relat_1) # label(axiom). [clausify(1)]. 0.43/1.01 Derived: -in(A,B) | in(f3(empty_set,C,B,A),C) | relation_inverse_image(empty_set,C) != B. [resolve(52,a,39,a)]. 0.43/1.01 Derived: -in(A,B) | in(f3(c1,C,B,A),C) | relation_inverse_image(c1,C) != B. [resolve(52,a,40,a)]. 0.43/1.01 Derived: -in(A,B) | in(f3(c3,C,B,A),C) | relation_inverse_image(c3,C) != B. [resolve(52,a,41,a)]. 0.43/1.01 Derived: -in(A,B) | in(f3(c4,C,B,A),C) | relation_inverse_image(c4,C) != B. [resolve(52,a,42,a)]. 0.43/1.01 Derived: -in(A,B) | in(f3(c6,C,B,A),C) | relation_inverse_image(c6,C) != B. [resolve(52,a,43,a)]. 0.43/1.01 Derived: -in(A,B) | in(f3(c7,C,B,A),C) | relation_inverse_image(c7,C) != B. [resolve(52,a,45,a)]. 0.43/1.01 Derived: -in(A,B) | in(f3(c8,C,B,A),C) | relation_inverse_image(c8,C) != B. [resolve(52,a,46,a)]. 0.43/1.01 Derived: -in(A,B) | in(f3(c10,C,B,A),C) | relation_inverse_image(c10,C) != B. [resolve(52,a,47,a)]. 0.43/1.01 Derived: -in(A,B) | in(f3(C,D,B,A),D) | relation_inverse_image(C,D) != B | -empty(C). [resolve(52,a,48,b)]. 0.43/1.01 Derived: -in(A,B) | in(f3(relation_dom(C),D,B,A),D) | relation_inverse_image(relation_dom(C),D) != B | -empty(C). [resolve(52,a,49,b)]. 0.43/1.01 53 -relation(A) | relation_image(A,B) != C | in(f8(A,B,C,D),B) | -in(D,C) # label(d13_relat_1) # label(axiom). [clausify(27)]. 0.43/1.01 Derived: relation_image(empty_set,A) != B | in(f8(empty_set,A,B,C),A) | -in(C,B). [resolve(53,a,39,a)]. 0.43/1.01 Derived: relation_image(c1,A) != B | in(f8(c1,A,B,C),A) | -in(C,B). [resolve(53,a,40,a)]. 0.43/1.01 Derived: relation_image(c3,A) != B | in(f8(c3,A,B,C),A) | -in(C,B). [resolve(53,a,41,a)]. 0.43/1.01 Derived: relation_image(c4,A) != B | in(f8(c4,A,B,C),A) | -in(C,B). [resolve(53,a,42,a)]. 0.43/1.01 Derived: relation_image(c6,A) != B | in(f8(c6,A,B,C),A) | -in(C,B). [resolve(53,a,43,a)]. 0.43/1.01 Derived: relation_image(c7,A) != B | in(f8(c7,A,B,C),A) | -in(C,B). [resolve(53,a,45,a)]. 0.43/1.01 Derived: relation_image(c8,A) != B | in(f8(c8,A,B,C),A) | -in(C,B). [resolve(53,a,46,a)]. 0.43/1.01 Derived: relation_image(c10,A) != B | in(f8(c10,A,B,C),A) | -in(C,B). [resolve(53,a,47,a)]. 0.43/1.01 Derived: relation_image(A,B) != C | in(f8(A,B,C,D),B) | -in(D,C) | -empty(A). [resolve(53,a,48,b)]. 0.43/1.01 Derived: relation_image(relation_dom(A),B) != C | in(f8(relation_dom(A),B,C,D),B) | -in(D,C) | -empty(A). [resolve(53,a,49,b)]. 0.43/1.01 54 -relation(A) | relation_dom(A) != B | in(ordered_pair(C,f11(A,B,C)),A) | -in(C,B) # label(d4_relat_1) # label(axiom). [clausify(29)]. 0.43/1.01 Derived: relation_dom(empty_set) != A | in(ordered_pair(B,f11(empty_set,A,B)),empty_set) | -in(B,A). [resolve(54,a,39,a)]. 0.43/1.01 Derived: relation_dom(c1) != A | in(ordered_pair(B,f11(c1,A,B)),c1) | -in(B,A). [resolve(54,a,40,a)]. 0.43/1.01 Derived: relation_dom(c3) != A | in(ordered_pair(B,f11(c3,A,B)),c3) | -in(B,A). [resolve(54,a,41,a)]. 0.43/1.01 Derived: relation_dom(c4) != A | in(ordered_pair(B,f11(c4,A,B)),c4) | -in(B,A). [resolve(54,a,42,a)]. 0.43/1.01 Derived: relation_dom(c6) != A | in(ordered_pair(B,f11(c6,A,B)),c6) | -in(B,A). [resolve(54,a,43,a)]. 0.43/1.01 Derived: relation_dom(c7) != A | in(ordered_pair(B,f11(c7,A,B)),c7) | -in(B,A). [resolve(54,a,45,a)]. 0.43/1.01 Derived: relation_dom(c8) != A | in(ordered_pair(B,f11(c8,A,B)),c8) | -in(B,A). [resolve(54,a,46,a)]. 0.43/1.01 Derived: relation_dom(c10) != A | in(ordered_pair(B,f11(c10,A,B)),c10) | -in(B,A). [resolve(54,a,47,a)]. 0.43/1.01 Derived: relation_dom(A) != B | in(ordered_pair(C,f11(A,B,C)),A) | -in(C,B) | -empty(A). [resolve(54,a,48,b)]. 0.43/1.01 Derived: relation_dom(relation_dom(A)) != B | in(ordered_pair(C,f11(relation_dom(A),B,C)),relation_dom(A)) | -in(C,B) | -empty(A). [resolve(54,a,49,b)]. 0.43/1.01 55 -relation(A) | in(B,C) | -in(ordered_pair(B,D),A) | -in(D,E) | relation_inverse_image(A,E) != C # label(d14_relat_1) # label(axiom). [clausify(1)]. 0.43/1.01 Derived: in(A,B) | -in(ordered_pair(A,C),empty_set) | -in(C,D) | relation_inverse_image(empty_set,D) != B. [resolve(55,a,39,a)]. 0.43/1.01 Derived: in(A,B) | -in(ordered_pair(A,C),c1) | -in(C,D) | relation_inverse_image(c1,D) != B. [resolve(55,a,40,a)]. 0.43/1.01 Derived: in(A,B) | -in(ordered_pair(A,C),c3) | -in(C,D) | relation_inverse_image(c3,D) != B. [resolve(55,a,41,a)]. 0.43/1.01 Derived: in(A,B) | -in(ordered_pair(A,C),c4) | -in(C,D) | relation_inverse_image(c4,D) != B. [resolve(55,a,42,a)]. 0.43/1.01 Derived: in(A,B) | -in(ordered_pair(A,C),c6) | -in(C,D) | relation_inverse_image(c6,D) != B. [resolve(55,a,43,a)]. 0.43/1.01 Derived: in(A,B) | -in(ordered_pair(A,C),c7) | -in(C,D) | relation_inverse_image(c7,D) != B. [resolve(55,a,45,a)]. 0.43/1.01 Derived: in(A,B) | -in(ordered_pair(A,C),c8) | -in(C,D) | relation_inverse_image(c8,D) != B. [resolve(55,a,46,a)]. 0.43/1.01 Derived: in(A,B) | -in(ordered_pair(A,C),c10) | -in(C,D) | relation_inverse_image(c10,D) != B. [resolve(55,a,47,a)]. 0.43/1.01 Derived: in(A,B) | -in(ordered_pair(A,C),D) | -in(C,E) | relation_inverse_image(D,E) != B | -empty(D). [resolve(55,a,48,b)]. 0.43/1.01 Derived: in(A,B) | -in(ordered_pair(A,C),relation_dom(D)) | -in(C,E) | relation_inverse_image(relation_dom(D),E) != B | -empty(D). [resolve(55,a,49,b)]. 0.43/1.01 56 -relation(A) | relation_image(A,B) != C | -in(D,B) | -in(ordered_pair(D,E),A) | in(E,C) # label(d13_relat_1) # label(axiom). [clausify(27)]. 0.43/1.01 Derived: relation_image(empty_set,A) != B | -in(C,A) | -in(ordered_pair(C,D),empty_set) | in(D,B). [resolve(56,a,39,a)]. 0.43/1.01 Derived: relation_image(c1,A) != B | -in(C,A) | -in(ordered_pair(C,D),c1) | in(D,B). [resolve(56,a,40,a)]. 0.43/1.01 Derived: relation_image(c3,A) != B | -in(C,A) | -in(ordered_pair(C,D),c3) | in(D,B). [resolve(56,a,41,a)]. 0.43/1.01 Derived: relation_image(c4,A) != B | -in(C,A) | -in(ordered_pair(C,D),c4) | in(D,B). [resolve(56,a,42,a)]. 0.43/1.01 Derived: relation_image(c6,A) != B | -in(C,A) | -in(ordered_pair(C,D),c6) | in(D,B). [resolve(56,a,43,a)]. 0.43/1.01 Derived: relation_image(c7,A) != B | -in(C,A) | -in(ordered_pair(C,D),c7) | in(D,B). [resolve(56,a,45,a)]. 0.43/1.01 Derived: relation_image(c8,A) != B | -in(C,A) | -in(ordered_pair(C,D),c8) | in(D,B). [resolve(56,a,46,a)]. 0.43/1.01 Derived: relation_image(c10,A) != B | -in(C,A) | -in(ordered_pair(C,D),c10) | in(D,B). [resolve(56,a,47,a)]. 0.43/1.01 Derived: relation_image(A,B) != C | -in(D,B) | -in(ordered_pair(D,E),A) | in(E,C) | -empty(A). [resolve(56,a,48,b)]. 0.43/1.01 Derived: relation_image(relation_dom(A),B) != C | -in(D,B) | -in(ordered_pair(D,E),relation_dom(A)) | in(E,C) | -empty(A). [resolve(56,a,49,b)]. 0.43/1.01 57 -relation(A) | relation_dom(A) = B | -in(ordered_pair(f12(A,B),C),A) | -in(f12(A,B),B) # label(d4_relat_1) # label(axiom). [clausify(29)]. 0.43/1.01 Derived: relation_dom(empty_set) = A | -in(ordered_pair(f12(empty_set,A),B),empty_set) | -in(f12(empty_set,A),A). [resolve(57,a,39,a)]. 0.43/1.01 Derived: relation_dom(c1) = A | -in(ordered_pair(f12(c1,A),B),c1) | -in(f12(c1,A),A). [resolve(57,a,40,a)]. 0.43/1.01 Derived: relation_dom(c3) = A | -in(ordered_pair(f12(c3,A),B),c3) | -in(f12(c3,A),A). [resolve(57,a,41,a)]. 0.43/1.01 Derived: relation_dom(c4) = A | -in(ordered_pair(f12(c4,A),B),c4) | -in(f12(c4,A),A). [resolve(57,a,42,a)]. 0.43/1.01 Derived: relation_dom(c6) = A | -in(ordered_pair(f12(c6,A),B),c6) | -in(f12(c6,A),A). [resolve(57,a,43,a)]. 0.43/1.01 Derived: relation_dom(c7) = A | -in(ordered_pair(f12(c7,A),B),c7) | -in(f12(c7,A),A). [resolve(57,a,45,a)]. 0.43/1.01 Derived: relation_dom(c8) = A | -in(ordered_pair(f12(c8,A),B),c8) | -in(f12(c8,A),A). [resolve(57,a,46,a)]. 0.43/1.01 Derived: relation_dom(c10) = A | -in(ordered_pair(f12(c10,A),B),c10) | -in(f12(c10,A),A). [resolve(57,a,47,a)]. 0.43/1.01 Derived: relation_dom(A) = B | -in(ordered_pair(f12(A,B),C),A) | -in(f12(A,B),B) | -empty(A). [resolve(57,a,48,b)]. 0.43/1.01 Derived: relation_dom(relation_dom(A)) = B | -in(ordered_pair(f12(relation_dom(A),B),C),relation_dom(A)) | -in(f12(relation_dom(A),B),B) | -empty(A). [resolve(57,a,49,b)]. 0.43/1.01 58 -relation(A) | in(f1(A,B,C),C) | in(f2(A,B,C),B) | relation_inverse_image(A,B) = C # label(d14_relat_1) # label(axiom). [clausify(1)]. 0.43/1.01 Derived: in(f1(empty_set,A,B),B) | in(f2(empty_set,A,B),A) | relation_inverse_image(empty_set,A) = B. [resolve(58,a,39,a)]. 0.43/1.01 Derived: in(f1(c1,A,B),B) | in(f2(c1,A,B),A) | relation_inverse_image(c1,A) = B. [resolve(58,a,40,a)]. 0.43/1.01 Derived: in(f1(c3,A,B),B) | in(f2(c3,A,B),A) | relation_inverse_image(c3,A) = B. [resolve(58,a,41,a)]. 0.43/1.01 Derived: in(f1(c4,A,B),B) | in(f2(c4,A,B),A) | relation_inverse_image(c4,A) = B. [resolve(58,a,42,a)]. 0.43/1.01 Derived: in(f1(c6,A,B),B) | in(f2(c6,A,B),A) | relation_inverse_image(c6,A) = B. [resolve(58,a,43,a)]. 0.43/1.01 Derived: in(f1(c7,A,B),B) | in(f2(c7,A,B),A) | relation_inverse_image(c7,A) = B. [resolve(58,a,45,a)]. 0.43/1.01 Derived: in(f1(c8,A,B),B) | in(f2(c8,A,B),A) | relation_inverse_image(c8,A) = B. [resolve(58,a,46,a)]. 0.43/1.01 Derived: in(f1(c10,A,B),B) | in(f2(c10,A,B),A) | relation_inverse_image(c10,A) = B. [resolve(58,a,47,a)]. 0.43/1.01 Derived: in(f1(A,B,C),C) | in(f2(A,B,C),B) | relation_inverse_image(A,B) = C | -empty(A). [resolve(58,a,48,b)]. 0.43/1.01 Derived: in(f1(relation_dom(A),B,C),C) | in(f2(relation_dom(A),B,C),B) | relation_inverse_image(relation_dom(A),B) = C | -empty(A). [resolve(58,a,49,b)]. 0.43/1.01 59 -relation(A) | -in(B,C) | in(ordered_pair(B,f3(A,D,C,B)),A) | relation_inverse_image(A,D) != C # label(d14_relat_1) # label(axiom). [clausify(1)]. 0.43/1.01 Derived: -in(A,B) | in(ordered_pair(A,f3(empty_set,C,B,A)),empty_set) | relation_inverse_image(empty_set,C) != B. [resolve(59,a,39,a)]. 0.43/1.01 Derived: -in(A,B) | in(ordered_pair(A,f3(c1,C,B,A)),c1) | relation_inverse_image(c1,C) != B. [resolve(59,a,40,a)]. 0.43/1.01 Derived: -in(A,B) | in(ordered_pair(A,f3(c3,C,B,A)),c3) | relation_inverse_image(c3,C) != B. [resolve(59,a,41,a)]. 0.43/1.01 Derived: -in(A,B) | in(ordered_pair(A,f3(c4,C,B,A)),c4) | relation_inverse_image(c4,C) != B. [resolve(59,a,42,a)]. 0.43/1.01 Derived: -in(A,B) | in(ordered_pair(A,f3(c6,C,B,A)),c6) | relation_inverse_image(c6,C) != B. [resolve(59,a,43,a)]. 0.43/1.01 Derived: -in(A,B) | in(ordered_pair(A,f3(c7,C,B,A)),c7) | relation_inverse_image(c7,C) != B. [resolve(59,a,45,a)]. 0.43/1.01 Derived: -in(A,B) | in(ordered_pair(A,f3(c8,C,B,A)),c8) | relation_inverse_image(c8,C) != B. [resolve(59,a,46,a)]. 0.43/1.01 Derived: -in(A,B) | in(ordered_pair(A,f3(c10,C,B,A)),c10) | relation_inverse_image(c10,C) != B. [resolve(59,a,47,a)]. 0.43/1.01 Derived: -in(A,B) | in(ordered_pair(A,f3(C,D,B,A)),C) | relation_inverse_image(C,D) != B | -empty(C). [resolve(59,a,48,b)]. 0.43/1.01 Derived: -in(A,B) | in(ordered_pair(A,f3(relation_dom(C),D,B,A)),relation_dom(C)) | relation_inverse_image(relation_dom(C),D) != B | -empty(C). [resolve(59,a,49,b)]. 0.43/1.01 60 -relation(A) | relation_image(A,B) != C | in(ordered_pair(f8(A,B,C,D),D),A) | -in(D,C) # label(d13_relat_1) # label(axiom). [clausify(27)]. 0.43/1.01 Derived: relation_image(empty_set,A) != B | in(ordered_pair(f8(empty_set,A,B,C),C),empty_set) | -in(C,B). [resolve(60,a,39,a)]. 0.43/1.01 Derived: relation_image(c1,A) != B | in(ordered_pair(f8(c1,A,B,C),C),c1) | -in(C,B). [resolve(60,a,40,a)]. 0.43/1.01 Derived: relation_image(c3,A) != B | in(ordered_pair(f8(c3,A,B,C),C),c3) | -in(C,B). [resolve(60,a,41,a)]. 0.43/1.01 Derived: relation_image(c4,A) != B | in(ordered_pair(f8(c4,A,B,C),C),c4) | -in(C,B). [resolve(60,a,42,a)]. 0.43/1.01 Derived: relation_image(c6,A) != B | in(ordered_pair(f8(c6,A,B,C),C),c6) | -in(C,B). [resolve(60,a,43,a)]. 0.43/1.01 Derived: relation_image(c7,A) != B | in(ordered_pair(f8(c7,A,B,C),C),c7) | -in(C,B). [resolve(60,a,45,a)]. 0.43/1.01 Derived: relation_image(c8,A) != B | in(ordered_pair(f8(c8,A,B,C),C),c8) | -in(C,B). [resolve(60,a,46,a)]. 0.43/1.01 Derived: relation_image(c10,A) != B | in(ordered_pair(f8(c10,A,B,C),C),c10) | -in(C,B). [resolve(60,a,47,a)]. 0.43/1.01 Derived: relation_image(A,B) != C | in(ordered_pair(f8(A,B,C,D),D),A) | -in(D,C) | -empty(A). [resolve(60,a,48,b)]. 0.43/1.01 Derived: relation_image(relation_dom(A),B) != C | in(ordered_pair(f8(relation_dom(A),B,C,D),D),relation_dom(A)) | -in(D,C) | -empty(A). [resolve(60,a,49,b)]. 0.43/1.01 61 -relation(A) | relation_image(A,B) = C | in(f10(A,B,C),B) | in(f9(A,B,C),C) # label(d13_relat_1) # label(axiom). [clausify(27)]. 0.43/1.01 Derived: relation_image(empty_set,A) = B | in(f10(empty_set,A,B),A) | in(f9(empty_set,A,B),B). [resolve(61,a,39,a)]. 0.43/1.01 Derived: relation_image(c1,A) = B | in(f10(c1,A,B),A) | in(f9(c1,A,B),B). [resolve(61,a,40,a)]. 0.43/1.01 Derived: relation_image(c3,A) = B | in(f10(c3,A,B),A) | in(f9(c3,A,B),B). [resolve(61,a,41,a)]. 0.43/1.01 Derived: relation_image(c4,A) = B | in(f10(c4,A,B),A) | in(f9(c4,A,B),B). [resolve(61,a,42,a)]. 0.43/1.01 Derived: relation_image(c6,A) = B | in(f10(c6,A,B),A) | in(f9(c6,A,B),B). [resolve(61,a,43,a)]. 0.43/1.01 Derived: relation_image(c7,A) = B | in(f10(c7,A,B),A) | in(f9(c7,A,B),B). [resolve(61,a,45,a)]. 0.43/1.01 Derived: relation_image(c8,A) = B | in(f10(c8,A,B),A) | in(f9(c8,A,B),B). [resolve(61,a,46,a)]. 0.43/1.01 Derived: relation_image(c10,A) = B | in(f10(c10,A,B),A) | in(f9(c10,A,B),B). [resolve(61,a,47,a)]. 0.43/1.01 Derived: relation_image(A,B) = C | in(f10(A,B,C),B) | in(f9(A,B,C),C) | -empty(A). [resolve(61,a,48,b)]. 0.43/1.01 Derived: relation_image(relation_dom(A),B) = C | in(f10(relation_dom(A),B,C),B) | in(f9(relation_dom(A),B,C),C) | -empty(A). [resolve(61,a,49,b)]. 0.43/1.01 62 -relation(A) | relation_dom(A) = B | in(ordered_pair(f12(A,B),f13(A,B)),A) | in(f12(A,B),B) # label(d4_relat_1) # label(axiom). [clausify(29)]. 0.43/1.01 Derived: relation_dom(empty_set) = A | in(ordered_pair(f12(empty_set,A),f13(empty_set,A)),empty_set) | in(f12(empty_set,A),A). [resolve(62,a,39,a)]. 0.43/1.01 Derived: relation_dom(c1) = A | in(ordered_pair(f12(c1,A),f13(c1,A)),c1) | in(f12(c1,A),A). [resolve(62,a,40,a)]. 0.43/1.01 Derived: relation_dom(c3) = A | in(ordered_pair(f12(c3,A),f13(c3,A)),c3) | in(f12(c3,A),A). [resolve(62,a,41,a)]. 0.43/1.01 Derived: relation_dom(c4) = A | in(ordered_pair(f12(c4,A),f13(c4,A)),c4) | in(f12(c4,A),A). [resolve(62,a,42,a)]. 0.43/1.01 Derived: relation_dom(c6) = A | in(ordered_pair(f12(c6,A),f13(c6,A)),c6) | in(f12(c6,A),A). [resolve(62,a,43,a)]. 0.43/1.01 Derived: relation_dom(c7) = A | in(ordered_pair(f12(c7,A),f13(c7,A)),c7) | in(f12(c7,A),A). [resolve(62,a,45,a)]. 0.43/1.01 Derived: relation_dom(c8) = A | in(ordered_pair(f12(c8,A),f13(c8,A)),c8) | in(f12(c8,A),A). [resolve(62,a,46,a)]. 0.43/1.01 Derived: relation_dom(c10) = A | in(ordered_pair(f12(c10,A),f13(c10,A)),c10) | in(f12(c10,A),A). [resolve(62,a,47,a)]. 0.43/1.01 Derived: relation_dom(A) = B | in(ordered_pair(f12(A,B),f13(A,B)),A) | in(f12(A,B),B) | -empty(A). [resolve(62,a,48,b)]. 0.43/1.01 Derived: relation_dom(relation_dom(A)) = B | in(ordered_pair(f12(relation_dom(A),B),f13(relation_dom(A),B)),relation_dom(A)) | in(f12(relation_dom(A),B),B) | -empty(A). [resolve(62,a,49,b)]. 0.43/1.01 63 -relation(A) | in(f1(A,B,C),C) | in(ordered_pair(f1(A,B,C),f2(A,B,C)),A) | relation_inverse_image(A,B) = C # label(d14_relat_1) # label(axiom). [clausify(1)]. 0.43/1.01 Derived: in(f1(empty_set,A,B),B) | in(ordered_pair(f1(empty_set,A,B),f2(empty_set,A,B)),empty_set) | relation_inverse_image(empty_set,A) = B. [resolve(63,a,39,a)]. 0.43/1.01 Derived: in(f1(c1,A,B),B) | in(ordered_pair(f1(c1,A,B),f2(c1,A,B)),c1) | relation_inverse_image(c1,A) = B. [resolve(63,a,40,a)]. 0.43/1.01 Derived: in(f1(c3,A,B),B) | in(ordered_pair(f1(c3,A,B),f2(c3,A,B)),c3) | relation_inverse_image(c3,A) = B. [resolve(63,a,41,a)]. 0.43/1.01 Derived: in(f1(c4,A,B),B) | in(ordered_pair(f1(c4,A,B),f2(c4,A,B)),c4) | relation_inverse_image(c4,A) = B. [resolve(63,a,42,a)]. 0.43/1.01 Derived: in(f1(c6,A,B),B) | in(ordered_pair(f1(c6,A,B),f2(c6,A,B)),c6) | relation_inverse_image(c6,A) = B. [resolve(63,a,43,a)]. 0.43/1.01 Derived: in(f1(c7,A,B),B) | in(ordered_pair(f1(c7,A,B),f2(c7,A,B)),c7) | relation_inverse_image(c7,A) = B. [resolve(63,a,45,a)]. 0.43/1.01 Derived: in(f1(c8,A,B),B) | in(ordered_pair(f1(c8,A,B),f2(c8,A,B)),c8) | relation_inverse_image(c8,A) = B. [resolve(63,a,46,a)]. 0.43/1.01 Derived: in(f1(c10,A,B),B) | in(ordered_pair(f1(c10,A,B),f2(c10,A,B)),c10) | relation_inverse_image(c10,A) = B. [resolve(63,a,47,a)]. 0.43/1.01 Derived: in(f1(A,B,C),C) | in(ordered_pair(f1(A,B,C),f2(A,B,C)),A) | relation_inverse_image(A,B) = C | -empty(A). [resolve(63,a,48,b)]. 0.43/1.01 Derived: in(f1(relation_dom(A),B,C),C) | in(ordered_pair(f1(relation_dom(A),B,C),f2(relation_dom(A),B,C)),relation_dom(A)) | relation_inverse_image(relation_dom(A),B) = C | -empty(A). [resolve(63,a,49,b)]. 0.43/1.01 64 -relation(A) | -in(f1(A,B,C),C) | -in(ordered_pair(f1(A,B,C),D),A) | -in(D,B) | relation_inverse_image(A,B) = C # label(d14_relat_1) # label(axiom). [clausify(1)]. 0.43/1.01 Derived: -in(f1(empty_set,A,B),B) | -in(ordered_pair(f1(empty_set,A,B),C),empty_set) | -in(C,A) | relation_inverse_image(empty_set,A) = B. [resolve(64,a,39,a)]. 0.43/1.01 Derived: -in(f1(c1,A,B),B) | -in(ordered_pair(f1(c1,A,B),C),c1) | -in(C,A) | relation_inverse_image(c1,A) = B. [resolve(64,a,40,a)]. 0.43/1.01 Derived: -in(f1(c3,A,B),B) | -in(ordered_pair(f1(c3,A,B),C),c3) | -in(C,A) | relation_inverse_image(c3,A) = B. [resolve(64,a,41,a)]. 0.43/1.01 Derived: -in(f1(c4,A,B),B) | -in(ordered_pair(f1(c4,A,B),C),c4) | -in(C,A) | relation_inverse_image(c4,A) = B. [resolve(64,a,42,a)]. 0.43/1.01 Derived: -in(f1(c6,A,B),B) | -in(ordered_pair(f1(c6,A,B),C),c6) | -in(C,A) | relation_inverse_image(c6,A) = B. [resolve(64,a,43,a)]. 0.43/1.01 Derived: -in(f1(c7,A,B),B) | -in(ordered_pair(f1(c7,A,B),C),c7) | -in(C,A) | relation_inverse_image(c7,A) = B. [resolve(64,a,45,a)]. 0.43/1.01 Derived: -in(f1(c8,A,B),B) | -in(ordered_pair(f1(c8,A,B),C),c8) | -in(C,A) | relation_inverse_image(c8,A) = B. [resolve(64,a,46,a)]. 0.43/1.01 Derived: -in(f1(c10,A,B),B) | -in(ordered_pair(f1(c10,A,B),C),c10) | -in(C,A) | relation_inverse_image(c10,A) = B. [resolve(64,a,47,a)]. 0.43/1.01 Derived: -in(f1(A,B,C),C) | -in(ordered_pair(f1(A,B,C),D),A) | -in(D,B) | relation_inverse_image(A,B) = C | -empty(A). [resolve(64,a,48,b)]. 0.43/1.01 Derived: -in(f1(relation_dom(A),B,C),C) | -in(ordered_pair(f1(relation_dom(A),B,C),D),relation_dom(A)) | -in(D,B) | relation_inverse_image(relation_dom(A),B) = C | -empty(A). [resolve(64,a,49,b)]. 0.43/1.01 65 -relation(A) | relation_image(A,B) = C | in(ordered_pair(f10(A,B,C),f9(A,B,C)),A) | in(f9(A,B,C),C) # label(d13_relat_1) # label(axiom). [clausify(27)]. 0.43/1.01 Derived: relation_image(empty_set,A) = B | in(ordered_pair(f10(empty_set,A,B),f9(empty_set,A,B)),empty_set) | in(f9(empty_set,A,B),B). [resolve(65,a,39,a)]. 0.43/1.01 Derived: relation_image(c1,A) = B | in(ordered_pair(f10(c1,A,B),f9(c1,A,B)),c1) | in(f9(c1,A,B),B). [resolve(65,a,40,a)]. 0.43/1.01 Derived: relation_image(c3,A) = B | in(ordered_pair(f10(c3,A,B),f9(c3,A,B)),c3) | in(f9(c3,A,B),B). [resolve(65,a,41,a)]. 1.72/2.03 Derived: relation_image(c4,A) = B | in(ordered_pair(f10(c4,A,B),f9(c4,A,B)),c4) | in(f9(c4,A,B),B). [resolve(65,a,42,a)]. 1.72/2.03 Derived: relation_image(c6,A) = B | in(ordered_pair(f10(c6,A,B),f9(c6,A,B)),c6) | in(f9(c6,A,B),B). [resolve(65,a,43,a)]. 1.72/2.03 Derived: relation_image(c7,A) = B | in(ordered_pair(f10(c7,A,B),f9(c7,A,B)),c7) | in(f9(c7,A,B),B). [resolve(65,a,45,a)]. 1.72/2.03 Derived: relation_image(c8,A) = B | in(ordered_pair(f10(c8,A,B),f9(c8,A,B)),c8) | in(f9(c8,A,B),B). [resolve(65,a,46,a)]. 1.72/2.03 Derived: relation_image(c10,A) = B | in(ordered_pair(f10(c10,A,B),f9(c10,A,B)),c10) | in(f9(c10,A,B),B). [resolve(65,a,47,a)]. 1.72/2.03 Derived: relation_image(A,B) = C | in(ordered_pair(f10(A,B,C),f9(A,B,C)),A) | in(f9(A,B,C),C) | -empty(A). [resolve(65,a,48,b)]. 1.72/2.03 Derived: relation_image(relation_dom(A),B) = C | in(ordered_pair(f10(relation_dom(A),B,C),f9(relation_dom(A),B,C)),relation_dom(A)) | in(f9(relation_dom(A),B,C),C) | -empty(A). [resolve(65,a,49,b)]. 1.72/2.03 66 -relation(A) | relation_image(A,B) = C | -in(D,B) | -in(ordered_pair(D,f9(A,B,C)),A) | -in(f9(A,B,C),C) # label(d13_relat_1) # label(axiom). [clausify(27)]. 1.72/2.03 Derived: relation_image(empty_set,A) = B | -in(C,A) | -in(ordered_pair(C,f9(empty_set,A,B)),empty_set) | -in(f9(empty_set,A,B),B). [resolve(66,a,39,a)]. 1.72/2.03 Derived: relation_image(c1,A) = B | -in(C,A) | -in(ordered_pair(C,f9(c1,A,B)),c1) | -in(f9(c1,A,B),B). [resolve(66,a,40,a)]. 1.72/2.03 Derived: relation_image(c3,A) = B | -in(C,A) | -in(ordered_pair(C,f9(c3,A,B)),c3) | -in(f9(c3,A,B),B). [resolve(66,a,41,a)]. 1.72/2.03 Derived: relation_image(c4,A) = B | -in(C,A) | -in(ordered_pair(C,f9(c4,A,B)),c4) | -in(f9(c4,A,B),B). [resolve(66,a,42,a)]. 1.72/2.03 Derived: relation_image(c6,A) = B | -in(C,A) | -in(ordered_pair(C,f9(c6,A,B)),c6) | -in(f9(c6,A,B),B). [resolve(66,a,43,a)]. 1.72/2.03 Derived: relation_image(c7,A) = B | -in(C,A) | -in(ordered_pair(C,f9(c7,A,B)),c7) | -in(f9(c7,A,B),B). [resolve(66,a,45,a)]. 1.72/2.03 Derived: relation_image(c8,A) = B | -in(C,A) | -in(ordered_pair(C,f9(c8,A,B)),c8) | -in(f9(c8,A,B),B). [resolve(66,a,46,a)]. 1.72/2.03 Derived: relation_image(c10,A) = B | -in(C,A) | -in(ordered_pair(C,f9(c10,A,B)),c10) | -in(f9(c10,A,B),B). [resolve(66,a,47,a)]. 1.72/2.03 Derived: relation_image(A,B) = C | -in(D,B) | -in(ordered_pair(D,f9(A,B,C)),A) | -in(f9(A,B,C),C) | -empty(A). [resolve(66,a,48,b)]. 1.72/2.03 Derived: relation_image(relation_dom(A),B) = C | -in(D,B) | -in(ordered_pair(D,f9(relation_dom(A),B,C)),relation_dom(A)) | -in(f9(relation_dom(A),B,C),C) | -empty(A). [resolve(66,a,49,b)]. 1.72/2.03 1.72/2.03 ============================== end predicate elimination ============= 1.72/2.03 1.72/2.03 Auto_denials: (non-Horn, no changes). 1.72/2.03 1.72/2.03 Term ordering decisions: 1.72/2.03 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. ordered_pair=1. relation_image=1. relation_inverse_image=1. unordered_pair=1. f5=1. f12=1. f13=1. relation_dom=1. powerset=1. singleton=1. f4=1. f6=1. f7=1. f1=1. f2=1. f9=1. f10=1. f11=1. f3=1. f8=1. 1.72/2.03 1.72/2.03 ============================== end of process initial clauses ======== 1.72/2.03 1.72/2.03 ============================== CLAUSES FOR SEARCH ==================== 1.72/2.03 1.72/2.03 ============================== end of clauses for search ============= 1.72/2.03 1.72/2.03 ============================== SEARCH ================================ 1.72/2.03 1.72/2.03 % Starting search at 0.06 seconds. 1.72/2.03 1.72/2.03 Low Water (keep): wt=44.000, iters=3531 1.72/2.03 1.72/2.03 Low Water (keep): wt=41.000, iters=3427 1.72/2.03 1.72/2.03 Low Water (keep): wt=33.000, iters=3922 1.72/2.03 1.72/2.03 Low Water (keep): wt=32.000, iters=3553 1.72/2.03 1.72/2.03 Low Water (keep): wt=31.000, iters=3710 1.72/2.03 1.72/2.03 Low Water (keep): wt=29.000, iters=3396 1.72/2.03 1.72/2.03 Low Water (keep): wt=25.000, iters=3541 1.72/2.03 1.72/2.03 Low Water (keep): wt=22.000, iters=3384 1.72/2.03 1.72/2.03 Low Water (keep): wt=21.000, iters=3501 1.72/2.03 1.72/2.03 Low Water (keep): wt=19.000, iters=3478 1.72/2.03 1.72/2.03 Low Water (displace): id=3331, wt=80.000 1.72/2.03 1.72/2.03 Low Water (displace): id=3332, wt=76.000 1.72/2.03 1.72/2.03 Low Water (displace): id=3339, wt=75.000 1.72/2.03 1.72/2.03 Low Water (displace): id=3337, wt=74.000 1.72/2.03 1.72/2.03 Low Water (displace): id=3361, wt=73.000 1.72/2.03 1.72/2.03 Low Water (displace): id=3340, wt=72.000 1.72/2.03 1.72/2.03 Low Water (displace): id=3362, wt=70.000 1.72/2.03 1.72/2.03 Low Water (displace): id=2475, wt=69.000 1.72/2.03 1.72/2.03 Low Water (displace): id=3367, wt=68.000 1.72/2.03 1.72/2.03 Low Water (dAlarm clock 119.76/120.03 Prover9 interrupted 119.76/120.03 EOF