TSTP Solution File: SET649+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET649+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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:09 EDT 2022
% Result : Theorem 0.84s 1.10s
% Output : Refutation 0.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SET649+3 : TPTP v8.1.0. Released v2.2.0.
% 0.13/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n016.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jul 10 20:15:42 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.49/1.06 ============================== Prover9 ===============================
% 0.49/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.49/1.06 Process 25942 was started by sandbox2 on n016.cluster.edu,
% 0.49/1.06 Sun Jul 10 20:15:42 2022
% 0.49/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_25788_n016.cluster.edu".
% 0.49/1.06 ============================== end of head ===========================
% 0.49/1.06
% 0.49/1.06 ============================== INPUT =================================
% 0.49/1.06
% 0.49/1.06 % Reading from file /tmp/Prover9_25788_n016.cluster.edu
% 0.49/1.06
% 0.49/1.06 set(prolog_style_variables).
% 0.49/1.06 set(auto2).
% 0.49/1.06 % set(auto2) -> set(auto).
% 0.49/1.06 % set(auto) -> set(auto_inference).
% 0.49/1.06 % set(auto) -> set(auto_setup).
% 0.49/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.49/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/1.06 % set(auto) -> set(auto_limits).
% 0.49/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/1.06 % set(auto) -> set(auto_denials).
% 0.49/1.06 % set(auto) -> set(auto_process).
% 0.49/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.49/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.49/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.49/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.49/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.49/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.49/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.49/1.06 % set(auto2) -> assign(stats, some).
% 0.49/1.06 % set(auto2) -> clear(echo_input).
% 0.49/1.06 % set(auto2) -> set(quiet).
% 0.49/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.49/1.06 % set(auto2) -> clear(print_given).
% 0.49/1.06 assign(lrs_ticks,-1).
% 0.49/1.06 assign(sos_limit,10000).
% 0.49/1.06 assign(order,kbo).
% 0.49/1.06 set(lex_order_vars).
% 0.49/1.06 clear(print_given).
% 0.49/1.06
% 0.49/1.06 % formulas(sos). % not echoed (27 formulas)
% 0.49/1.06
% 0.49/1.06 ============================== end of input ==========================
% 0.49/1.06
% 0.49/1.06 % From the command line: assign(max_seconds, 300).
% 0.49/1.06
% 0.49/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/1.06
% 0.49/1.06 % Formulas that are not ordinary clauses:
% 0.49/1.06 1 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,set_type) -> (subset(B,C) & subset(C,D) -> subset(B,D)))))))) # label(p1) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 2 (all B (ilf_type(B,binary_relation_type) -> subset(B,cross_product(domain_of(B),range_of(B))))) # label(p2) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 3 (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) -> (subset(B,C) & subset(D,E) -> subset(cross_product(B,D),cross_product(C,E))))))))))) # label(p3) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 4 (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(p4) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 5 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (exists D ilf_type(D,relation_type(C,B))))))) # label(p5) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 6 (all B (ilf_type(B,binary_relation_type) -> (all C (ilf_type(C,set_type) -> (member(C,domain_of(B)) <-> (exists D (ilf_type(D,set_type) & member(ordered_pair(C,D),B)))))))) # label(p6) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 7 (all B (ilf_type(B,binary_relation_type) -> ilf_type(domain_of(B),set_type))) # label(p7) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 8 (all B (ilf_type(B,binary_relation_type) -> (all C (ilf_type(C,set_type) -> (member(C,range_of(B)) <-> (exists D (ilf_type(D,set_type) & member(ordered_pair(D,C),B)))))))) # label(p8) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 9 (all B (ilf_type(B,binary_relation_type) -> ilf_type(range_of(B),set_type))) # label(p9) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 10 (all B (ilf_type(B,set_type) -> (ilf_type(B,binary_relation_type) <-> relation_like(B) & ilf_type(B,set_type)))) # label(p10) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 11 (exists B ilf_type(B,binary_relation_type)) # label(p11) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 12 (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(p12) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 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.49/1.06 14 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ilf_type(ordered_pair(B,C),set_type))))) # label(p14) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 15 (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.49/1.06 16 (all B (ilf_type(B,set_type) -> (exists C ilf_type(C,subset_type(B))))) # label(p16) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 17 (all B (ilf_type(B,set_type) -> subset(B,B))) # label(p17) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 18 (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(p18) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 19 (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(p19) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 20 (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(p20) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 21 (all B (ilf_type(B,set_type) -> -empty(power_set(B)) & ilf_type(power_set(B),set_type))) # label(p21) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 22 (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(p22) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 23 (all B (-empty(B) & ilf_type(B,set_type) -> (exists C ilf_type(C,member_type(B))))) # label(p23) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 24 (all B (ilf_type(B,set_type) -> (empty(B) <-> (all C (ilf_type(C,set_type) -> -member(C,B)))))) # label(p24) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 25 (all B (empty(B) & ilf_type(B,set_type) -> relation_like(B))) # label(p25) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 26 (all B ilf_type(B,set_type)) # label(p26) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 27 -(all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,binary_relation_type) -> (subset(domain_of(D),B) & subset(range_of(D),C) -> ilf_type(D,relation_type(B,C))))))))) # label(prove_relset_1_11) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.49/1.06
% 0.49/1.06 ============================== end of process non-clausal formulas ===
% 0.49/1.06
% 0.49/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/1.06
% 0.49/1.06 ============================== PREDICATE ELIMINATION =================
% 0.49/1.06 28 -ilf_type(A,set_type) | ilf_type(A,binary_relation_type) | -relation_like(A) # label(p10) # label(axiom). [clausify(10)].
% 0.49/1.06 29 -empty(A) | -ilf_type(A,set_type) | relation_like(A) # label(p25) # label(axiom). [clausify(25)].
% 0.49/1.06 30 -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type) | relation_like(A) # label(p10) # label(axiom). [clausify(10)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | ilf_type(A,binary_relation_type) | -empty(A) | -ilf_type(A,set_type). [resolve(28,c,29,c)].
% 0.49/1.06 31 -ilf_type(A,set_type) | relation_like(A) | ilf_type(f8(A),set_type) # label(p18) # label(axiom). [clausify(18)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | ilf_type(f8(A),set_type) | -ilf_type(A,set_type) | ilf_type(A,binary_relation_type). [resolve(31,b,28,c)].
% 0.49/1.06 32 -ilf_type(A,set_type) | relation_like(A) | member(f8(A),A) # label(p18) # label(axiom). [clausify(18)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | member(f8(A),A) | -ilf_type(A,set_type) | ilf_type(A,binary_relation_type). [resolve(32,b,28,c)].
% 0.49/1.06 33 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,subset_type(cross_product(A,B))) | relation_like(C) # label(p19) # label(axiom). [clausify(19)].
% 0.49/1.06 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(33,d,28,c)].
% 0.49/1.06 34 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f6(A,B),set_type) # label(p18) # label(axiom). [clausify(18)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f6(A,B),set_type) | -empty(A) | -ilf_type(A,set_type). [resolve(34,b,29,c)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f6(A,B),set_type) | -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type). [resolve(34,b,30,c)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f6(A,B),set_type) | -ilf_type(A,set_type) | ilf_type(f8(A),set_type). [resolve(34,b,31,b)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f6(A,B),set_type) | -ilf_type(A,set_type) | member(f8(A),A). [resolve(34,b,32,b)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f6(A,B),set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -ilf_type(A,subset_type(cross_product(C,D))). [resolve(34,b,33,d)].
% 0.49/1.06 35 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f7(A,B),set_type) # label(p18) # label(axiom). [clausify(18)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f7(A,B),set_type) | -empty(A) | -ilf_type(A,set_type). [resolve(35,b,29,c)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f7(A,B),set_type) | -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type). [resolve(35,b,30,c)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f7(A,B),set_type) | -ilf_type(A,set_type) | ilf_type(f8(A),set_type). [resolve(35,b,31,b)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f7(A,B),set_type) | -ilf_type(A,set_type) | member(f8(A),A). [resolve(35,b,32,b)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f7(A,B),set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -ilf_type(A,subset_type(cross_product(C,D))). [resolve(35,b,33,d)].
% 0.49/1.06 36 -ilf_type(A,set_type) | relation_like(A) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | ordered_pair(B,C) != f8(A) # label(p18) # label(axiom). [clausify(18)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | ordered_pair(B,C) != f8(A) | -ilf_type(A,set_type) | ilf_type(A,binary_relation_type). [resolve(36,b,28,c)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | ordered_pair(B,C) != f8(A) | -ilf_type(A,set_type) | -ilf_type(D,set_type) | -member(D,A) | ilf_type(f6(A,D),set_type). [resolve(36,b,34,b)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | ordered_pair(B,C) != f8(A) | -ilf_type(A,set_type) | -ilf_type(D,set_type) | -member(D,A) | ilf_type(f7(A,D),set_type). [resolve(36,b,35,b)].
% 0.49/1.06 37 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f6(A,B),f7(A,B)) = B # label(p18) # label(axiom). [clausify(18)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f6(A,B),f7(A,B)) = B | -empty(A) | -ilf_type(A,set_type). [resolve(37,b,29,c)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f6(A,B),f7(A,B)) = B | -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type). [resolve(37,b,30,c)].
% 0.49/1.06 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f6(A,B),f7(A,B)) = B | -ilf_type(A,set_type) | ilf_type(f8(A),set_type). [resolve(37,b,31,b)].
% 0.84/1.10 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f6(A,B),f7(A,B)) = B | -ilf_type(A,set_type) | member(f8(A),A). [resolve(37,b,32,b)].
% 0.84/1.10 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f6(A,B),f7(A,B)) = B | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -ilf_type(A,subset_type(cross_product(C,D))). [resolve(37,b,33,d)].
% 0.84/1.10 Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f6(A,B),f7(A,B)) = B | -ilf_type(A,set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | ordered_pair(C,D) != f8(A). [resolve(37,b,36,b)].
% 0.84/1.10
% 0.84/1.10 ============================== end predicate elimination =============
% 0.84/1.10
% 0.84/1.10 Auto_denials: (non-Horn, no changes).
% 0.84/1.10
% 0.84/1.10 Term ordering decisions:
% 0.84/1.10 Function symbol KB weights: set_type=1. binary_relation_type=1. c1=1. c2=1. c3=1. c4=1. ordered_pair=1. cross_product=1. relation_type=1. f1=1. f2=1. f3=1. f4=1. f6=1. f7=1. f9=1. subset_type=1. power_set=1. domain_of=1. range_of=1. member_type=1. f5=1. f8=1. f10=1. f11=1.
% 0.84/1.10
% 0.84/1.10 ============================== end of process initial clauses ========
% 0.84/1.10
% 0.84/1.10 ============================== CLAUSES FOR SEARCH ====================
% 0.84/1.10
% 0.84/1.10 ============================== end of clauses for search =============
% 0.84/1.10
% 0.84/1.10 ============================== SEARCH ================================
% 0.84/1.10
% 0.84/1.10 % Starting search at 0.02 seconds.
% 0.84/1.10
% 0.84/1.10 ============================== PROOF =================================
% 0.84/1.10 % SZS status Theorem
% 0.84/1.10 % SZS output start Refutation
% 0.84/1.10
% 0.84/1.10 % Proof 1 at 0.05 (+ 0.00) seconds.
% 0.84/1.10 % Length of proof is 53.
% 0.84/1.10 % Level of proof is 11.
% 0.84/1.10 % Maximum clause weight is 13.000.
% 0.84/1.10 % Given clauses 128.
% 0.84/1.10
% 0.84/1.10 1 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,set_type) -> (subset(B,C) & subset(C,D) -> subset(B,D)))))))) # label(p1) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.10 2 (all B (ilf_type(B,binary_relation_type) -> subset(B,cross_product(domain_of(B),range_of(B))))) # label(p2) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.10 3 (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) -> (subset(B,C) & subset(D,E) -> subset(cross_product(B,D),cross_product(C,E))))))))))) # label(p3) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.10 4 (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(p4) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.10 12 (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(p12) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.10 15 (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.84/1.10 20 (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(p20) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.10 21 (all B (ilf_type(B,set_type) -> -empty(power_set(B)) & ilf_type(power_set(B),set_type))) # label(p21) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.10 22 (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(p22) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.10 24 (all B (ilf_type(B,set_type) -> (empty(B) <-> (all C (ilf_type(C,set_type) -> -member(C,B)))))) # label(p24) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.10 26 (all B ilf_type(B,set_type)) # label(p26) # label(axiom) # label(non_clause). [assumption].
% 0.84/1.10 27 -(all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,binary_relation_type) -> (subset(domain_of(D),B) & subset(range_of(D),C) -> ilf_type(D,relation_type(B,C))))))))) # label(prove_relset_1_11) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.84/1.10 39 ilf_type(A,set_type) # label(p26) # label(axiom). [clausify(26)].
% 0.84/1.10 40 ilf_type(c4,binary_relation_type) # label(prove_relset_1_11) # label(negated_conjecture). [clausify(27)].
% 0.84/1.10 41 subset(domain_of(c4),c2) # label(prove_relset_1_11) # label(negated_conjecture). [clausify(27)].
% 0.84/1.10 42 subset(range_of(c4),c3) # label(prove_relset_1_11) # label(negated_conjecture). [clausify(27)].
% 0.84/1.10 43 -ilf_type(c4,relation_type(c2,c3)) # label(prove_relset_1_11) # label(negated_conjecture). [clausify(27)].
% 0.84/1.10 44 -ilf_type(A,set_type) | -empty(power_set(A)) # label(p21) # label(axiom). [clausify(21)].
% 0.84/1.10 45 -empty(power_set(A)). [copy(44),unit_del(a,39)].
% 0.84/1.10 46 -ilf_type(A,set_type) | -empty(A) | -ilf_type(B,set_type) | -member(B,A) # label(p24) # label(axiom). [clausify(24)].
% 0.84/1.10 47 -empty(A) | -member(B,A). [copy(46),unit_del(a,39),unit_del(c,39)].
% 0.84/1.10 56 -ilf_type(A,binary_relation_type) | subset(A,cross_product(domain_of(A),range_of(A))) # label(p2) # label(axiom). [clausify(2)].
% 0.84/1.10 72 -ilf_type(A,set_type) | -ilf_type(B,set_type) | ilf_type(B,subset_type(A)) | -ilf_type(B,member_type(power_set(A))) # label(p15) # label(axiom). [clausify(15)].
% 0.84/1.10 73 ilf_type(A,subset_type(B)) | -ilf_type(A,member_type(power_set(B))). [copy(72),unit_del(a,39),unit_del(b,39)].
% 0.84/1.10 75 -ilf_type(A,set_type) | -ilf_type(B,set_type) | member(A,power_set(B)) | member(f9(A,B),A) # label(p20) # label(axiom). [clausify(20)].
% 0.84/1.10 76 member(A,power_set(B)) | member(f9(A,B),A). [copy(75),unit_del(a,39),unit_del(b,39)].
% 0.84/1.10 77 -ilf_type(A,set_type) | -ilf_type(B,set_type) | member(A,power_set(B)) | -member(f9(A,B),B) # label(p20) # label(axiom). [clausify(20)].
% 0.84/1.10 78 member(A,power_set(B)) | -member(f9(A,B),B). [copy(77),unit_del(a,39),unit_del(b,39)].
% 0.84/1.10 79 -ilf_type(A,set_type) | empty(B) | -ilf_type(B,set_type) | -ilf_type(A,member_type(B)) | member(A,B) # label(p22) # label(axiom). [clausify(22)].
% 0.84/1.10 80 empty(A) | -ilf_type(B,member_type(A)) | member(B,A). [copy(79),unit_del(a,39),unit_del(c,39)].
% 0.84/1.10 81 -ilf_type(A,set_type) | empty(B) | -ilf_type(B,set_type) | ilf_type(A,member_type(B)) | -member(A,B) # label(p22) # label(axiom). [clausify(22)].
% 0.84/1.10 82 empty(A) | ilf_type(B,member_type(A)) | -member(B,A). [copy(81),unit_del(a,39),unit_del(c,39)].
% 0.84/1.10 83 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,subset_type(cross_product(A,B))) | ilf_type(C,relation_type(A,B)) # label(p4) # label(axiom). [clausify(4)].
% 0.84/1.10 84 -ilf_type(A,subset_type(cross_product(B,C))) | ilf_type(A,relation_type(B,C)). [copy(83),unit_del(a,39),unit_del(b,39)].
% 0.84/1.10 91 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | -subset(A,B) | -subset(B,C) | subset(A,C) # label(p1) # label(axiom). [clausify(1)].
% 0.84/1.10 92 -subset(A,B) | -subset(B,C) | subset(A,C). [copy(91),unit_del(a,39),unit_del(b,39),unit_del(c,39)].
% 0.84/1.10 97 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -subset(A,B) | -ilf_type(C,set_type) | -member(C,A) | member(C,B) # label(p12) # label(axiom). [clausify(12)].
% 0.84/1.10 98 -subset(A,B) | -member(C,A) | member(C,B). [copy(97),unit_del(a,39),unit_del(b,39),unit_del(d,39)].
% 0.84/1.10 101 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -subset(A,B) | -subset(C,D) | subset(cross_product(A,C),cross_product(B,D)) # label(p3) # label(axiom). [clausify(3)].
% 0.84/1.10 102 -subset(A,B) | -subset(C,D) | subset(cross_product(A,C),cross_product(B,D)). [copy(101),unit_del(a,39),unit_del(b,39),unit_del(c,39),unit_del(d,39)].
% 0.84/1.10 136 subset(c4,cross_product(domain_of(c4),range_of(c4))). [resolve(56,a,40,a)].
% 0.84/1.10 140 member(A,power_set(B)) | -empty(A). [resolve(76,b,47,b)].
% 0.84/1.10 143 empty(A) | ilf_type(f9(A,B),member_type(A)) | member(A,power_set(B)). [resolve(82,c,76,b)].
% 0.84/1.10 146 -ilf_type(c4,subset_type(cross_product(c2,c3))). [ur(84,b,43,a)].
% 0.84/1.10 197 -ilf_type(c4,member_type(power_set(cross_product(c2,c3)))). [ur(73,a,146,a)].
% 0.84/1.10 198 -member(c4,power_set(cross_product(c2,c3))). [ur(82,a,45,a,b,197,a)].
% 0.84/1.10 199 -member(f9(c4,cross_product(c2,c3)),cross_product(c2,c3)). [ur(78,a,198,a)].
% 0.84/1.10 244 -empty(c4). [ur(140,a,198,a)].
% 0.84/1.10 266 ilf_type(f9(c4,cross_product(c2,c3)),member_type(c4)). [resolve(143,c,198,a),unit_del(a,244)].
% 0.84/1.10 435 member(f9(c4,cross_product(c2,c3)),c4). [resolve(266,a,80,b),unit_del(a,244)].
% 0.84/1.10 443 -subset(c4,cross_product(c2,c3)). [ur(98,b,435,a,c,199,a)].
% 0.84/1.10 459 -subset(cross_product(domain_of(c4),range_of(c4)),cross_product(c2,c3)). [ur(92,a,136,a,c,443,a)].
% 0.84/1.10 507 $F. [ur(102,b,42,a,c,459,a),unit_del(a,41)].
% 0.84/1.10
% 0.84/1.10 % SZS output end Refutation
% 0.84/1.10 ============================== end of proof ==========================
% 0.84/1.10
% 0.84/1.10 ============================== STATISTICS ============================
% 0.84/1.10
% 0.84/1.10 Given=128. Generated=651. Kept=413. proofs=1.
% 0.84/1.10 Usable=128. Sos=278. Demods=2. Limbo=1, Disabled=83. Hints=0.
% 0.84/1.10 Megabytes=0.73.
% 0.84/1.10 User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
% 0.84/1.10
% 0.84/1.10 ============================== end of statistics =====================
% 0.84/1.10
% 0.84/1.10 ============================== end of search =========================
% 0.84/1.10
% 0.84/1.10 THEOREM PROVED
% 0.84/1.10 % SZS status Theorem
% 0.84/1.10
% 0.84/1.10 Exiting with 1 proof.
% 0.84/1.10
% 0.84/1.10 Process 25942 exit (max_proofs) Sun Jul 10 20:15:42 2022
% 0.84/1.10 Prover9 interrupted
%------------------------------------------------------------------------------