TSTP Solution File: SET663+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET663+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:14 EDT 2022
% Result : Theorem 0.48s 1.06s
% Output : Refutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET663+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 11 10:00:04 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.48/1.04 ============================== Prover9 ===============================
% 0.48/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.48/1.04 Process 23837 was started by sandbox2 on n027.cluster.edu,
% 0.48/1.04 Mon Jul 11 10:00:04 2022
% 0.48/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_23456_n027.cluster.edu".
% 0.48/1.04 ============================== end of head ===========================
% 0.48/1.04
% 0.48/1.04 ============================== INPUT =================================
% 0.48/1.04
% 0.48/1.04 % Reading from file /tmp/Prover9_23456_n027.cluster.edu
% 0.48/1.04
% 0.48/1.04 set(prolog_style_variables).
% 0.48/1.04 set(auto2).
% 0.48/1.04 % set(auto2) -> set(auto).
% 0.48/1.04 % set(auto) -> set(auto_inference).
% 0.48/1.04 % set(auto) -> set(auto_setup).
% 0.48/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.48/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/1.04 % set(auto) -> set(auto_limits).
% 0.48/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/1.04 % set(auto) -> set(auto_denials).
% 0.48/1.04 % set(auto) -> set(auto_process).
% 0.48/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.48/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.48/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.48/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.48/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.48/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.48/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.48/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.48/1.04 % set(auto2) -> assign(stats, some).
% 0.48/1.04 % set(auto2) -> clear(echo_input).
% 0.48/1.04 % set(auto2) -> set(quiet).
% 0.48/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.48/1.04 % set(auto2) -> clear(print_given).
% 0.48/1.04 assign(lrs_ticks,-1).
% 0.48/1.04 assign(sos_limit,10000).
% 0.48/1.04 assign(order,kbo).
% 0.48/1.04 set(lex_order_vars).
% 0.48/1.04 clear(print_given).
% 0.48/1.04
% 0.48/1.04 % formulas(sos). % not echoed (35 formulas)
% 0.48/1.04
% 0.48/1.04 ============================== end of input ==========================
% 0.48/1.04
% 0.48/1.04 % From the command line: assign(max_seconds, 300).
% 0.48/1.04
% 0.48/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/1.04
% 0.48/1.04 % Formulas that are not ordinary clauses:
% 0.48/1.04 1 (all B (ilf_type(B,set_type) -> (subset(B,empty_set) -> B = empty_set))) # label(p1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 2 (all B (ilf_type(B,binary_relation_type) -> (domain_of(B) = empty_set | range_of(B) = empty_set -> B = empty_set))) # label(p2) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 3 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,relation_type(B,C)) -> subset(domain_of(D),B) & subset(range_of(D),C))))))) # label(p3) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 4 (all B (ilf_type(B,set_type) -> -member(B,empty_set))) # label(p4) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 5 (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(p6) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 6 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (exists D ilf_type(D,relation_type(C,B))))))) # label(p7) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 7 (all B (ilf_type(B,binary_relation_type) -> (all C (ilf_type(C,binary_relation_type) -> (B = C <-> (all D (ilf_type(D,set_type) -> (all E (ilf_type(E,set_type) -> (member(ordered_pair(D,E),B) <-> member(ordered_pair(D,E),C))))))))))) # label(p8) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 8 (all B (ilf_type(B,binary_relation_type) -> ilf_type(domain_of(B),set_type))) # label(p9) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 9 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ilf_type(cross_product(B,C),set_type))))) # label(p10) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 10 (all B (ilf_type(B,binary_relation_type) -> ilf_type(range_of(B),set_type))) # label(p11) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 11 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ilf_type(ordered_pair(B,C),set_type))))) # label(p12) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 12 (all B (ilf_type(B,set_type) -> (ilf_type(B,binary_relation_type) <-> relation_like(B) & ilf_type(B,set_type)))) # label(p13) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 13 (exists B ilf_type(B,binary_relation_type)) # label(p14) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 14 (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(p15) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 15 (all B (ilf_type(B,set_type) -> (exists C ilf_type(C,subset_type(B))))) # label(p16) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 16 (all B (ilf_type(B,binary_relation_type) -> (all C (ilf_type(C,binary_relation_type) -> (B = C -> C = B))))) # label(p17) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 17 (all B (ilf_type(B,binary_relation_type) -> B = B)) # label(p18) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 18 (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(p19) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 19 (all B (ilf_type(B,set_type) -> subset(B,B))) # label(p20) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 20 (all B (ilf_type(B,set_type) -> (empty(B) <-> (all C (ilf_type(C,set_type) -> -member(C,B)))))) # label(p21) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 21 (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(p22) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 22 (all B (ilf_type(B,set_type) -> -empty(power_set(B)) & ilf_type(power_set(B),set_type))) # label(p23) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 23 (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(p24) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 24 (all B (-empty(B) & ilf_type(B,set_type) -> (exists C ilf_type(C,member_type(B))))) # label(p25) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 25 (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(p26) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 26 (all B (empty(B) & ilf_type(B,set_type) -> relation_like(B))) # label(p27) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 27 (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(p28) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 28 (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(p29) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 29 (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(p30) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 30 (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(p31) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 31 (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(p32) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 32 (all B ilf_type(B,set_type)) # label(p33) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.05 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(D,relation_type(empty_set,C)) -> D = empty_set))))))) # label(prove_relset_1_26) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.48/1.05
% 0.48/1.05 ============================== end of process non-clausal formulas ===
% 0.48/1.05
% 0.48/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.48/1.05
% 0.48/1.05 ============================== PREDICATE ELIMINATION =================
% 0.48/1.05 34 -ilf_type(A,set_type) | ilf_type(A,binary_relation_type) | -relation_like(A) # label(p13) # label(axiom). [clausify(12)].
% 0.48/1.05 35 -empty(A) | -ilf_type(A,set_type) | relation_like(A) # label(p27) # label(axiom). [clausify(26)].
% 0.48/1.05 36 -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type) | relation_like(A) # label(p13) # label(axiom). [clausify(12)].
% 0.48/1.05 Derived: -ilf_type(A,set_type) | ilf_type(A,binary_relation_type) | -empty(A) | -ilf_type(A,set_type). [resolve(34,c,35,c)].
% 0.48/1.05 37 -ilf_type(A,set_type) | relation_like(A) | ilf_type(f11(A),set_type) # label(p26) # label(axiom). [clausify(25)].
% 0.48/1.05 Derived: -ilf_type(A,set_type) | ilf_type(f11(A),set_type) | -ilf_type(A,set_type) | ilf_type(A,binary_relation_type). [resolve(37,b,34,c)].
% 0.48/1.05 38 -ilf_type(A,set_type) | relation_like(A) | member(f11(A),A) # label(p26) # label(axiom). [clausify(25)].
% 0.48/1.05 Derived: -ilf_type(A,set_type) | member(f11(A),A) | -ilf_type(A,set_type) | ilf_type(A,binary_relation_type). [resolve(38,b,34,c)].
% 0.48/1.05 39 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,subset_type(cross_product(A,B))) | relation_like(C) # label(p28) # label(axiom). [clausify(27)].
% 0.48/1.05 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(39,d,34,c)].
% 0.48/1.05 40 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f9(A,B),set_type) # label(p26) # label(axiom). [clausify(25)].
% 0.48/1.05 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f9(A,B),set_type) | -empty(A) | -ilf_type(A,set_type). [resolve(40,b,35,c)].
% 0.48/1.05 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f9(A,B),set_type) | -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type). [resolve(40,b,36,c)].
% 0.48/1.05 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f9(A,B),set_type) | -ilf_type(A,set_type) | ilf_type(f11(A),set_type). [resolve(40,b,37,b)].
% 0.48/1.05 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f9(A,B),set_type) | -ilf_type(A,set_type) | member(f11(A),A). [resolve(40,b,38,b)].
% 0.48/1.05 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f9(A,B),set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -ilf_type(A,subset_type(cross_product(C,D))). [resolve(40,b,39,d)].
% 0.48/1.05 41 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f10(A,B),set_type) # label(p26) # label(axiom). [clausify(25)].
% 0.48/1.05 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f10(A,B),set_type) | -empty(A) | -ilf_type(A,set_type). [resolve(41,b,35,c)].
% 0.48/1.05 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f10(A,B),set_type) | -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type). [resolve(41,b,36,c)].
% 0.48/1.05 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f10(A,B),set_type) | -ilf_type(A,set_type) | ilf_type(f11(A),set_type). [resolve(41,b,37,b)].
% 0.48/1.05 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f10(A,B),set_type) | -ilf_type(A,set_type) | member(f11(A),A). [resolve(41,b,38,b)].
% 0.48/1.05 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f10(A,B),set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -ilf_type(A,subset_type(cross_product(C,D))). [resolve(41,b,39,d)].
% 0.48/1.05 42 -ilf_type(A,set_type) | relation_like(A) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | ordered_pair(B,C) != f11(A) # label(p26) # label(axiom). [clausify(25)].
% 0.48/1.05 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | ordered_pair(B,C) != f11(A) | -ilf_type(A,set_type) | ilf_type(A,binary_relation_type). [resolve(42,b,34,c)].
% 0.48/1.05 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | ordered_pair(B,C) != f11(A) | -ilf_type(A,set_type) | -ilf_type(D,set_type) | -member(D,A) | ilf_type(f9(A,D),set_type). [resolve(42,b,40,b)].
% 0.48/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | ordered_pair(B,C) != f11(A) | -ilf_type(A,set_type) | -ilf_type(D,set_type) | -member(D,A) | ilf_type(f10(A,D),set_type). [resolve(42,b,41,b)].
% 0.48/1.06 43 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f9(A,B),f10(A,B)) = B # label(p26) # label(axiom). [clausify(25)].
% 0.48/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f9(A,B),f10(A,B)) = B | -empty(A) | -ilf_type(A,set_type). [resolve(43,b,35,c)].
% 0.48/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f9(A,B),f10(A,B)) = B | -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type). [resolve(43,b,36,c)].
% 0.48/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f9(A,B),f10(A,B)) = B | -ilf_type(A,set_type) | ilf_type(f11(A),set_type). [resolve(43,b,37,b)].
% 0.48/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f9(A,B),f10(A,B)) = B | -ilf_type(A,set_type) | member(f11(A),A). [resolve(43,b,38,b)].
% 0.48/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f9(A,B),f10(A,B)) = B | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -ilf_type(A,subset_type(cross_product(C,D))). [resolve(43,b,39,d)].
% 0.48/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f9(A,B),f10(A,B)) = B | -ilf_type(A,set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | ordered_pair(C,D) != f11(A). [resolve(43,b,42,b)].
% 0.48/1.06
% 0.48/1.06 ============================== end predicate elimination =============
% 0.48/1.06
% 0.48/1.06 Auto_denials: (non-Horn, no changes).
% 0.48/1.06
% 0.48/1.06 Term ordering decisions:
% 0.48/1.06 Function symbol KB weights: set_type=1. binary_relation_type=1. empty_set=1. c1=1. c2=1. c3=1. c4=1. ordered_pair=1. relation_type=1. cross_product=1. f1=1. f2=1. f3=1. f5=1. f7=1. f9=1. f10=1. subset_type=1. power_set=1. member_type=1. domain_of=1. range_of=1. f4=1. f6=1. f8=1. f11=1. domain=1. range=1.
% 0.48/1.06
% 0.48/1.06 ============================== end of process initial clauses ========
% 0.48/1.06
% 0.48/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.48/1.06
% 0.48/1.06 ============================== end of clauses for search =============
% 0.48/1.06
% 0.48/1.06 ============================== SEARCH ================================
% 0.48/1.06
% 0.48/1.06 % Starting search at 0.02 seconds.
% 0.48/1.06
% 0.48/1.06 ============================== PROOF =================================
% 0.48/1.06 % SZS status Theorem
% 0.48/1.06 % SZS output start Refutation
% 0.48/1.06
% 0.48/1.06 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.48/1.06 % Length of proof is 29.
% 0.48/1.06 % Level of proof is 7.
% 0.48/1.06 % Maximum clause weight is 11.000.
% 0.48/1.06 % Given clauses 63.
% 0.48/1.06
% 0.48/1.06 1 (all B (ilf_type(B,set_type) -> (subset(B,empty_set) -> B = empty_set))) # label(p1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 2 (all B (ilf_type(B,binary_relation_type) -> (domain_of(B) = empty_set | range_of(B) = empty_set -> B = empty_set))) # label(p2) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 3 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,relation_type(B,C)) -> subset(domain_of(D),B) & subset(range_of(D),C))))))) # label(p3) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 5 (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(p6) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 12 (all B (ilf_type(B,set_type) -> (ilf_type(B,binary_relation_type) <-> relation_like(B) & ilf_type(B,set_type)))) # label(p13) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 27 (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(p28) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 32 (all B ilf_type(B,set_type)) # label(p33) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 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(D,relation_type(empty_set,C)) -> D = empty_set))))))) # label(prove_relset_1_26) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.48/1.06 34 -ilf_type(A,set_type) | ilf_type(A,binary_relation_type) | -relation_like(A) # label(p13) # label(axiom). [clausify(12)].
% 0.48/1.06 39 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,subset_type(cross_product(A,B))) | relation_like(C) # label(p28) # label(axiom). [clausify(27)].
% 0.48/1.06 46 ilf_type(A,set_type) # label(p33) # label(axiom). [clausify(32)].
% 0.48/1.06 47 ilf_type(c4,relation_type(c2,c3)) # label(prove_relset_1_26) # label(negated_conjecture). [clausify(33)].
% 0.48/1.06 48 ilf_type(c4,relation_type(empty_set,c3)) # label(prove_relset_1_26) # label(negated_conjecture). [clausify(33)].
% 0.48/1.06 49 c4 != empty_set # label(prove_relset_1_26) # label(negated_conjecture). [clausify(33)].
% 0.48/1.06 61 -ilf_type(A,set_type) | -subset(A,empty_set) | empty_set = A # label(p1) # label(axiom). [clausify(1)].
% 0.48/1.06 62 -subset(A,empty_set) | empty_set = A. [copy(61),unit_del(a,46)].
% 0.48/1.06 66 -ilf_type(A,binary_relation_type) | domain_of(A) != empty_set | empty_set = A # label(p2) # label(axiom). [clausify(2)].
% 0.48/1.06 79 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,relation_type(A,B)) | subset(domain_of(C),A) # label(p3) # label(axiom). [clausify(3)].
% 0.48/1.06 80 -ilf_type(A,relation_type(B,C)) | subset(domain_of(A),B). [copy(79),unit_del(a,46),unit_del(b,46)].
% 0.48/1.06 98 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,relation_type(A,B)) | ilf_type(C,subset_type(cross_product(A,B))) # label(p6) # label(axiom). [clausify(5)].
% 0.48/1.06 99 -ilf_type(A,relation_type(B,C)) | ilf_type(A,subset_type(cross_product(B,C))). [copy(98),unit_del(a,46),unit_del(b,46)].
% 0.48/1.06 123 -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(39,d,34,c)].
% 0.48/1.06 124 -ilf_type(A,subset_type(cross_product(B,C))) | ilf_type(A,binary_relation_type). [copy(123),unit_del(a,46),unit_del(b,46),unit_del(d,46)].
% 0.48/1.06 155 subset(domain_of(c4),empty_set). [resolve(80,a,48,a)].
% 0.48/1.06 170 ilf_type(c4,subset_type(cross_product(c2,c3))). [resolve(99,a,47,a)].
% 0.48/1.06 210 domain_of(c4) = empty_set. [resolve(155,a,62,a),flip(a)].
% 0.48/1.06 232 -ilf_type(c4,binary_relation_type). [ur(66,b,210,a,c,49,a(flip))].
% 0.48/1.06 234 -ilf_type(c4,subset_type(cross_product(A,B))). [ur(124,b,232,a)].
% 0.48/1.06 235 $F. [resolve(234,a,170,a)].
% 0.48/1.06
% 0.48/1.06 % SZS output end Refutation
% 0.48/1.06 ============================== end of proof ==========================
% 0.48/1.06
% 0.48/1.06 ============================== STATISTICS ============================
% 0.48/1.06
% 0.48/1.06 Given=63. Generated=214. Kept=133. proofs=1.
% 0.48/1.06 Usable=61. Sos=62. Demods=7. Limbo=1, Disabled=94. Hints=0.
% 0.48/1.06 Megabytes=0.30.
% 0.48/1.06 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.48/1.06
% 0.48/1.06 ============================== end of statistics =====================
% 0.48/1.06
% 0.48/1.06 ============================== end of search =========================
% 0.48/1.06
% 0.48/1.06 THEOREM PROVED
% 0.48/1.06 % SZS status Theorem
% 0.48/1.06
% 0.48/1.06 Exiting with 1 proof.
% 0.48/1.06
% 0.48/1.06 Process 23837 exit (max_proofs) Mon Jul 11 10:00:04 2022
% 0.48/1.06 Prover9 interrupted
%------------------------------------------------------------------------------