TSTP Solution File: SET674+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET674+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.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 : Tue Jul 19 04:31:19 EDT 2022
% Result : Timeout 300.05s 300.31s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET674+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n005.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 : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 21:51:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.76/1.03 ============================== Prover9 ===============================
% 0.76/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.03 Process 18816 was started by sandbox2 on n005.cluster.edu,
% 0.76/1.03 Sun Jul 10 21:51:37 2022
% 0.76/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18663_n005.cluster.edu".
% 0.76/1.03 ============================== end of head ===========================
% 0.76/1.03
% 0.76/1.03 ============================== INPUT =================================
% 0.76/1.03
% 0.76/1.03 % Reading from file /tmp/Prover9_18663_n005.cluster.edu
% 0.76/1.03
% 0.76/1.03 set(prolog_style_variables).
% 0.76/1.03 set(auto2).
% 0.76/1.03 % set(auto2) -> set(auto).
% 0.76/1.03 % set(auto) -> set(auto_inference).
% 0.76/1.03 % set(auto) -> set(auto_setup).
% 0.76/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.03 % set(auto) -> set(auto_limits).
% 0.76/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.03 % set(auto) -> set(auto_denials).
% 0.76/1.03 % set(auto) -> set(auto_process).
% 0.76/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.03 % set(auto2) -> assign(stats, some).
% 0.76/1.03 % set(auto2) -> clear(echo_input).
% 0.76/1.03 % set(auto2) -> set(quiet).
% 0.76/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.03 % set(auto2) -> clear(print_given).
% 0.76/1.03 assign(lrs_ticks,-1).
% 0.76/1.03 assign(sos_limit,10000).
% 0.76/1.03 assign(order,kbo).
% 0.76/1.03 set(lex_order_vars).
% 0.76/1.03 clear(print_given).
% 0.76/1.03
% 0.76/1.03 % formulas(sos). % not echoed (41 formulas)
% 0.76/1.03
% 0.76/1.03 ============================== end of input ==========================
% 0.76/1.03
% 0.76/1.03 % From the command line: assign(max_seconds, 300).
% 0.76/1.03
% 0.76/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.03
% 0.76/1.03 % Formulas that are not ordinary clauses:
% 0.76/1.03 1 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,binary_relation_type) -> (member(B,domain_of(C)) <-> (exists D (ilf_type(D,set_type) & member(ordered_pair(B,D),C)))))))) # label(p1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 2 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,binary_relation_type) -> (member(B,range_of(C)) <-> (exists D (ilf_type(D,set_type) & member(ordered_pair(D,B),C)))))))) # label(p2) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 3 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,binary_relation_type) -> (member(ordered_pair(B,C),D) -> member(B,domain_of(D)) & member(C,range_of(D))))))))) # label(p3) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 4 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,binary_relation_type) -> (member(C,image(D,B)) <-> (exists E (ilf_type(E,set_type) & member(ordered_pair(E,C),D) & member(E,B)))))))))) # label(p4) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 5 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,binary_relation_type) -> (member(C,inverse2(D,B)) <-> (exists E (ilf_type(E,set_type) & member(ordered_pair(C,E),D) & member(E,B)))))))))) # label(p5) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 6 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ((all D (ilf_type(D,set_type) -> (member(D,B) <-> member(D,C)))) -> B = C))))) # label(p6) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 7 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,set_type) -> (all E (ilf_type(E,set_type) -> (all F (ilf_type(F,relation_type(B,C)) -> (member(ordered_pair(D,E),F) -> member(D,B) & member(E,C)))))))))))) # label(p7) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 8 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,subset_type(cross_product(B,C))) -> ilf_type(D,relation_type(B,C)))) & (all E (ilf_type(E,relation_type(B,C)) -> ilf_type(E,subset_type(cross_product(B,C))))))))) # label(p8) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 9 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (exists D ilf_type(D,relation_type(C,B))))))) # label(p9) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 10 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (B = C <-> subset(B,C) & subset(C,B)))))) # label(p10) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 11 (all B (ilf_type(B,binary_relation_type) -> (all C (ilf_type(C,set_type) -> ilf_type(inverse2(B,C),set_type))))) # label(p11) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 12 (all B (ilf_type(B,binary_relation_type) -> ilf_type(domain_of(B),set_type))) # label(p12) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 13 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ilf_type(cross_product(B,C),set_type))))) # label(p13) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 14 (all B (ilf_type(B,binary_relation_type) -> ilf_type(range_of(B),set_type))) # label(p14) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 15 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ilf_type(ordered_pair(B,C),set_type))))) # label(p15) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 16 (all B (ilf_type(B,binary_relation_type) -> (all C (ilf_type(C,set_type) -> ilf_type(image(B,C),set_type))))) # label(p16) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 17 (all B (ilf_type(B,set_type) -> (ilf_type(B,binary_relation_type) <-> relation_like(B) & ilf_type(B,set_type)))) # label(p17) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 18 (exists B ilf_type(B,binary_relation_type)) # label(p18) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 19 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (ilf_type(C,subset_type(B)) <-> ilf_type(C,member_type(power_set(B)))))))) # label(p19) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 20 (all B (ilf_type(B,set_type) -> (exists C ilf_type(C,subset_type(B))))) # label(p20) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 21 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (B = C <-> (all D (ilf_type(D,set_type) -> (member(D,B) <-> member(D,C))))))))) # label(p21) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 22 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (subset(B,C) <-> (all D (ilf_type(D,set_type) -> (member(D,B) -> member(D,C))))))))) # label(p22) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 23 (all B (ilf_type(B,set_type) -> subset(B,B))) # label(p23) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 24 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (member(B,power_set(C)) <-> (all D (ilf_type(D,set_type) -> (member(D,B) -> member(D,C))))))))) # label(p24) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 25 (all B (ilf_type(B,set_type) -> -empty(power_set(B)) & ilf_type(power_set(B),set_type))) # label(p25) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 26 (all B (ilf_type(B,set_type) -> (all C (-empty(C) & ilf_type(C,set_type) -> (ilf_type(B,member_type(C)) <-> member(B,C)))))) # label(p26) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 27 (all B (-empty(B) & ilf_type(B,set_type) -> (exists C ilf_type(C,member_type(B))))) # label(p27) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 28 (all B (ilf_type(B,set_type) -> (relation_like(B) <-> (all C (ilf_type(C,set_type) -> (member(C,B) -> (exists D (ilf_type(D,set_type) & (exists E (ilf_type(E,set_type) & C = ordered_pair(D,E))))))))))) # label(p28) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 29 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,subset_type(cross_product(B,C))) -> relation_like(D))))))) # label(p29) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 30 (all B (ilf_type(B,set_type) -> (empty(B) <-> (all C (ilf_type(C,set_type) -> -member(C,B)))))) # label(p30) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 31 (all B (empty(B) & ilf_type(B,set_type) -> relation_like(B))) # label(p31) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 32 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,relation_type(B,C)) -> domain(B,C,D) = domain_of(D))))))) # label(p32) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 33 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,relation_type(B,C)) -> ilf_type(domain(B,C,D),subset_type(B)))))))) # label(p33) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 34 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,relation_type(B,C)) -> range(B,C,D) = range_of(D))))))) # label(p34) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 35 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,relation_type(B,C)) -> ilf_type(range(B,C,D),subset_type(C)))))))) # label(p35) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 36 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,relation_type(B,C)) -> (all E (ilf_type(E,set_type) -> image4(B,C,D,E) = image(D,E))))))))) # label(p36) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 37 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,relation_type(B,C)) -> (all E (ilf_type(E,set_type) -> ilf_type(image4(B,C,D,E),subset_type(C)))))))))) # label(p37) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 38 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,relation_type(B,C)) -> (all E (ilf_type(E,set_type) -> inverse4(B,C,D,E) = inverse2(D,E))))))))) # label(p38) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 39 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,relation_type(B,C)) -> (all E (ilf_type(E,set_type) -> ilf_type(inverse4(B,C,D,E),subset_type(B)))))))))) # label(p39) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 40 (all B ilf_type(B,set_type)) # label(p40) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.03 41 -(all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,relation_type(B,C)) -> image4(B,C,D,B) = range(B,C,D) & inverse4(B,C,D,C) = domain(B,C,D))))))) # label(prove_relset_1_38) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.76/1.03
% 0.76/1.03 ============================== end of process non-clausal formulas ===
% 0.76/1.03
% 0.76/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.03
% 0.76/1.03 ============================== PREDICATE ELIMINATION =================
% 0.76/1.03 42 -ilf_type(A,set_type) | ilf_type(A,binary_relation_type) | -relation_like(A) # label(p17) # label(axiom). [clausify(17)].
% 0.76/1.03 43 -empty(A) | -ilf_type(A,set_type) | relation_like(A) # label(p31) # label(axiom). [clausify(31)].
% 0.76/1.03 44 -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type) | relation_like(A) # label(p17) # label(axiom). [clausify(17)].
% 0.76/1.03 Derived: -ilf_type(A,set_type) | ilf_type(A,binary_relation_type) | -empty(A) | -ilf_type(A,set_type). [resolve(42,c,43,c)].
% 0.76/1.03 45 -ilf_type(A,set_type) | relation_like(A) | ilf_type(f14(A),set_type) # label(p28) # label(axiom). [clausify(28)].
% 0.76/1.03 Derived: -ilf_type(A,set_type) | ilf_type(f14(A),set_type) | -ilf_type(A,set_type) | ilf_type(A,binary_relation_type). [resolve(45,b,42,c)].
% 0.76/1.03 46 -ilf_type(A,set_type) | relation_like(A) | member(f14(A),A) # label(p28) # label(axiom). [clausify(28)].
% 0.76/1.03 Derived: -ilf_type(A,set_type) | member(f14(A),A) | -ilf_type(A,set_type) | ilf_type(A,binary_relation_type). [resolve(46,b,42,c)].
% 0.76/1.03 47 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,subset_type(cross_product(A,B))) | relation_like(C) # label(p29) # label(axiom). [clausify(29)].
% 0.76/1.03 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,subset_type(cross_product(A,B))) | -ilf_type(C,set_type) | ilf_type(C,binary_relation_type). [resolve(47,d,42,c)].
% 0.76/1.03 48 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f12(A,B),set_type) # label(p28) # label(axiom). [clausify(28)].
% 0.76/1.03 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f12(A,B),set_type) | -empty(A) | -ilf_type(A,set_type). [resolve(48,b,43,c)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f12(A,B),set_type) | -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type). [resolve(48,b,44,c)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f12(A,B),set_type) | -ilf_type(A,set_type) | ilf_type(f14(A),set_type). [resolve(48,b,45,b)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f12(A,B),set_type) | -ilf_type(A,set_type) | member(f14(A),A). [resolve(48,b,46,b)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f12(A,B),set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -ilf_type(A,subset_type(cross_product(C,D))). [resolve(48,b,47,d)].
% 0.76/1.04 49 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f13(A,B),set_type) # label(p28) # label(axiom). [clausify(28)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f13(A,B),set_type) | -empty(A) | -ilf_type(A,set_type). [resolve(49,b,43,c)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f13(A,B),set_type) | -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type). [resolve(49,b,44,c)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f13(A,B),set_type) | -ilf_type(A,set_type) | ilf_type(f14(A),set_type). [resolve(49,b,45,b)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f13(A,B),set_type) | -ilf_type(A,set_type) | member(f14(A),A). [resolve(49,b,46,b)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f13(A,B),set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -ilf_type(A,subset_type(cross_product(C,D))). [resolve(49,b,47,d)].
% 0.76/1.04 50 -ilf_type(A,set_type) | relation_like(A) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | ordered_pair(B,C) != f14(A) # label(p28) # label(axiom). [clausify(28)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | ordered_pair(B,C) != f14(A) | -ilf_type(A,set_type) | ilf_type(A,binary_relation_type). [resolve(50,b,42,c)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | ordered_pair(B,C) != f14(A) | -ilf_type(A,set_type) | -ilf_type(D,set_type) | -member(D,A) | ilf_type(f12(A,D),set_type). [resolve(50,b,48,b)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | ordered_pair(B,C) != f14(A) | -ilf_type(A,set_type) | -ilf_type(D,set_type) | -member(D,A) | ilf_type(f13(A,D),set_type). [resolve(50,b,49,b)].
% 0.76/1.04 51 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f12(A,B),f13(A,B)) = B # label(p28) # label(axiom). [clausify(28)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f12(A,B),f13(A,B)) = B | -empty(A) | -ilf_type(A,set_type). [resolve(51,b,43,c)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f12(A,B),f13(A,B)) = B | -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type). [resolve(51,b,44,c)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f12(A,B),f13(A,B)) = B | -ilf_type(A,set_type) | ilf_type(f14(A),set_type). [resolve(51,b,45,b)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f12(A,B),f13(A,B)) = B | -ilf_type(A,set_type) | member(f14(A),A). [resolve(51,b,46,b)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f12(A,B),f13(A,B)) = B | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -ilf_type(A,subset_type(cross_product(C,D))). [resolve(51,b,47,d)].
% 0.76/1.04 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f12(A,B),f13(A,B)) = B | -ilf_type(A,set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | ordered_pair(C,D) != f14(A). [resolve(51,b,50,b)].
% 0.76/1.04
% 0.76/1.04 ============================== end predicate eliminatiCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------