0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n015.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 180
0.12/0.33	% DateTime   : Thu Aug 29 13:00:37 EDT 2019
0.12/0.33	% CPUTime    : 
0.79/1.09	============================== Prover9 ===============================
0.79/1.09	Prover9 (32) version 2009-11A, November 2009.
0.79/1.09	Process 13538 was started by sandbox on n015.cluster.edu,
0.79/1.09	Thu Aug 29 13:00:37 2019
0.79/1.09	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_13385_n015.cluster.edu".
0.79/1.09	============================== end of head ===========================
0.79/1.09	
0.79/1.09	============================== INPUT =================================
0.79/1.09	
0.79/1.09	% Reading from file /tmp/Prover9_13385_n015.cluster.edu
0.79/1.09	
0.79/1.09	set(prolog_style_variables).
0.79/1.09	set(auto2).
0.79/1.09	    % set(auto2) -> set(auto).
0.79/1.09	    % set(auto) -> set(auto_inference).
0.79/1.09	    % set(auto) -> set(auto_setup).
0.79/1.09	    % set(auto_setup) -> set(predicate_elim).
0.79/1.09	    % set(auto_setup) -> assign(eq_defs, unfold).
0.79/1.09	    % set(auto) -> set(auto_limits).
0.79/1.09	    % set(auto_limits) -> assign(max_weight, "100.000").
0.79/1.09	    % set(auto_limits) -> assign(sos_limit, 20000).
0.79/1.09	    % set(auto) -> set(auto_denials).
0.79/1.09	    % set(auto) -> set(auto_process).
0.79/1.09	    % set(auto2) -> assign(new_constants, 1).
0.79/1.09	    % set(auto2) -> assign(fold_denial_max, 3).
0.79/1.09	    % set(auto2) -> assign(max_weight, "200.000").
0.79/1.09	    % set(auto2) -> assign(max_hours, 1).
0.79/1.09	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.79/1.09	    % set(auto2) -> assign(max_seconds, 0).
0.79/1.09	    % set(auto2) -> assign(max_minutes, 5).
0.79/1.09	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.79/1.09	    % set(auto2) -> set(sort_initial_sos).
0.79/1.09	    % set(auto2) -> assign(sos_limit, -1).
0.79/1.09	    % set(auto2) -> assign(lrs_ticks, 3000).
0.79/1.09	    % set(auto2) -> assign(max_megs, 400).
0.79/1.09	    % set(auto2) -> assign(stats, some).
0.79/1.09	    % set(auto2) -> clear(echo_input).
0.79/1.09	    % set(auto2) -> set(quiet).
0.79/1.09	    % set(auto2) -> clear(print_initial_clauses).
0.79/1.09	    % set(auto2) -> clear(print_given).
0.79/1.09	assign(lrs_ticks,-1).
0.79/1.09	assign(sos_limit,10000).
0.79/1.09	assign(order,kbo).
0.79/1.09	set(lex_order_vars).
0.79/1.09	clear(print_given).
0.79/1.09	
0.79/1.09	% formulas(sos).  % not echoed (27 formulas)
0.79/1.09	
0.79/1.09	============================== end of input ==========================
0.79/1.09	
0.79/1.09	% From the command line: assign(max_seconds, 180).
0.79/1.09	
0.79/1.09	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.79/1.09	
0.79/1.09	% Formulas that are not ordinary clauses:
0.79/1.09	1 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,relation_type(B,C)) -> subset(range_of(D),C) & subset(domain_of(D),B))))))) # label(p6) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	2 (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.79/1.09	3 (all B ilf_type(B,set_type)) # label(p26) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	4 (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.79/1.09	5 (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.79/1.09	6 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,set_type) -> (subset(C,D) & subset(B,C) -> subset(B,D)))))))) # label(p1) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	7 (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.79/1.09	8 (all B (ilf_type(B,set_type) -> -empty(power_set(B)) & ilf_type(power_set(B),set_type))) # label(p19) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	9 (all B (ilf_type(B,binary_relation_type) -> ilf_type(domain_of(B),set_type))) # label(p8) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	10 (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(p20) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	11 (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(p18) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	12 (all B (ilf_type(B,binary_relation_type) -> ilf_type(range_of(B),set_type))) # label(p11) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	13 (all B (-empty(B) & ilf_type(B,set_type) -> (exists C ilf_type(C,member_type(B))))) # label(p21) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	14 (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(p9) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	15 (exists B ilf_type(B,binary_relation_type)) # label(p14) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	16 (all B (ilf_type(B,set_type) -> subset(B,B))) # label(p17) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	17 (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.79/1.09	18 (all B (ilf_type(B,set_type) -> (exists C ilf_type(C,subset_type(B))))) # label(p16) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	19 (all B (ilf_type(B,set_type) -> ((all C (ilf_type(C,set_type) -> -member(C,B))) <-> empty(B)))) # label(p24) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	20 (all B (ilf_type(B,set_type) & empty(B) -> relation_like(B))) # label(p25) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	21 (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(D,E) & subset(B,C) -> subset(cross_product(B,D),cross_product(C,E))))))))))) # label(p3) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	22 (all B (ilf_type(B,set_type) -> (ilf_type(B,set_type) & relation_like(B) <-> ilf_type(B,binary_relation_type)))) # label(p13) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	23 (all B (ilf_type(B,binary_relation_type) -> (all C (ilf_type(C,set_type) -> ((exists D (ilf_type(D,set_type) & member(ordered_pair(C,D),B))) <-> member(C,domain_of(B))))))) # label(p7) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	24 (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.79/1.09	25 (all B (ilf_type(B,set_type) -> ((all C (ilf_type(C,set_type) -> (member(C,B) -> (exists D ((exists E (ordered_pair(D,E) = C & ilf_type(E,set_type))) & ilf_type(D,set_type)))))) <-> relation_like(B)))) # label(p22) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	26 (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(p23) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	27 -(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,relation_type(B,D)) -> (subset(domain_of(E),C) -> ilf_type(E,relation_type(C,D))))))))))) # label(prove_relset_1_13) # label(negated_conjecture) # label(non_clause).  [assumption].
0.79/1.09	
0.79/1.09	============================== end of process non-clausal formulas ===
0.79/1.09	
0.79/1.09	============================== PROCESS INITIAL CLAUSES ===============
0.79/1.09	
0.79/1.09	============================== PREDICATE ELIMINATION =================
0.79/1.09	28 -ilf_type(A,set_type) | -relation_like(A) | ilf_type(A,binary_relation_type) # label(p13) # label(axiom).  [clausify(22)].
0.79/1.09	29 -ilf_type(A,set_type) | -empty(A) | relation_like(A) # label(p25) # label(axiom).  [clausify(20)].
0.79/1.09	Derived: -ilf_type(A,set_type) | ilf_type(A,binary_relation_type) | -ilf_type(A,set_type) | -empty(A).  [resolve(28,b,29,c)].
0.79/1.09	30 -ilf_type(A,set_type) | relation_like(A) | -ilf_type(A,binary_relation_type) # label(p13) # label(axiom).  [clausify(22)].
0.79/1.09	31 -ilf_type(A,set_type) | ilf_type(f8(A),set_type) | relation_like(A) # label(p22) # label(axiom).  [clausify(25)].
0.79/1.09	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,c,28,b)].
0.79/1.09	32 -ilf_type(A,set_type) | member(f8(A),A) | relation_like(A) # label(p22) # label(axiom).  [clausify(25)].
0.79/1.09	Derived: -ilf_type(A,set_type) | member(f8(A),A) | -ilf_type(A,set_type) | ilf_type(A,binary_relation_type).  [resolve(32,c,28,b)].
0.79/1.09	33 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,subset_type(cross_product(A,B))) | relation_like(C) # label(p23) # label(axiom).  [clausify(26)].
0.79/1.09	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,b)].
0.79/1.09	34 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f10(A,B),set_type) | -relation_like(A) # label(p22) # label(axiom).  [clausify(25)].
0.79/1.09	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) | -empty(A).  [resolve(34,e,29,c)].
0.79/1.09	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(34,e,30,b)].
0.79/1.09	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(f8(A),set_type).  [resolve(34,e,31,c)].
0.79/1.09	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(f8(A),A).  [resolve(34,e,32,c)].
0.79/1.09	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(34,e,33,d)].
0.79/1.09	35 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f9(A,B),set_type) | -relation_like(A) # label(p22) # label(axiom).  [clausify(25)].
0.79/1.09	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) | -empty(A).  [resolve(35,e,29,c)].
0.79/1.09	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(35,e,30,b)].
0.79/1.09	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(f8(A),set_type).  [resolve(35,e,31,c)].
0.79/1.09	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(f8(A),A).  [resolve(35,e,32,c)].
0.79/1.09	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(35,e,33,d)].
0.79/1.09	36 -ilf_type(A,set_type) | ordered_pair(B,C) != f8(A) | -ilf_type(C,set_type) | -ilf_type(B,set_type) | relation_like(A) # label(p22) # label(axiom).  [clausify(25)].
0.79/1.09	Derived: -ilf_type(A,set_type) | ordered_pair(B,C) != f8(A) | -ilf_type(C,set_type) | -ilf_type(B,set_type) | -ilf_type(A,set_type) | ilf_type(A,binary_relation_type).  [resolve(36,e,28,b)].
0.79/1.09	Derived: -ilf_type(A,set_type) | ordered_pair(B,C) != f8(A) | -ilf_type(C,set_type) | -ilf_type(B,set_type) | -ilf_type(A,set_type) | -ilf_type(D,set_type) | -member(D,A) | ilf_type(f10(A,D),set_type).  [resolve(36,e,34,e)].
0.79/1.09	Derived: -ilf_type(A,set_type) | ordered_pair(B,C) != f8(A) | -ilf_type(C,set_type) | -ilf_type(B,set_type) | -ilf_type(A,set_type) | -ilf_type(D,set_type) | -member(D,A) | ilf_type(f9(A,D),set_type).  [resolve(36,e,35,e)].
0.79/1.09	37 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f9(A,B),f10(A,B)) = B | -relation_like(A) # label(p22) # label(axiom).  [clausify(25)].
0.79/1.09	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) | -empty(A).  [resolve(37,e,29,c)].
0.79/1.09	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(37,e,30,b)].
0.79/1.09	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(f8(A),set_type).  [resolve(37,e,31,c)].
0.93/1.18	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(f8(A),A).  [resolve(37,e,32,c)].
0.93/1.18	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(37,e,33,d)].
0.93/1.18	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) | ordered_pair(C,D) != f8(A) | -ilf_type(D,set_type) | -ilf_type(C,set_type).  [resolve(37,e,36,e)].
0.93/1.18	
0.93/1.18	============================== end predicate elimination =============
0.93/1.18	
0.93/1.18	Auto_denials:  (non-Horn, no changes).
0.93/1.18	
0.93/1.18	Term ordering decisions:
0.93/1.18	Function symbol KB weights:  set_type=1. binary_relation_type=1. c1=1. c2=1. c3=1. c4=1. c5=1. ordered_pair=1. cross_product=1. relation_type=1. f1=1. f2=1. f4=1. f7=1. f9=1. f10=1. subset_type=1. domain_of=1. power_set=1. member_type=1. range_of=1. f3=1. f5=1. f6=1. f8=1.
0.93/1.18	
0.93/1.18	============================== end of process initial clauses ========
0.93/1.18	
0.93/1.18	============================== CLAUSES FOR SEARCH ====================
0.93/1.18	
0.93/1.18	============================== end of clauses for search =============
0.93/1.18	
0.93/1.18	============================== SEARCH ================================
0.93/1.18	
0.93/1.18	% Starting search at 0.02 seconds.
0.93/1.18	
0.93/1.18	============================== PROOF =================================
0.93/1.18	% SZS status Theorem
0.93/1.18	% SZS output start Refutation
0.93/1.18	
0.93/1.18	% Proof 1 at 0.10 (+ 0.00) seconds.
0.93/1.18	% Length of proof is 66.
0.93/1.18	% Level of proof is 11.
0.93/1.18	% Maximum clause weight is 13.000.
0.93/1.18	% Given clauses 197.
0.93/1.18	
0.93/1.18	1 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,relation_type(B,C)) -> subset(range_of(D),C) & subset(domain_of(D),B))))))) # label(p6) # label(axiom) # label(non_clause).  [assumption].
0.93/1.18	2 (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.93/1.18	3 (all B ilf_type(B,set_type)) # label(p26) # label(axiom) # label(non_clause).  [assumption].
0.93/1.18	4 (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.93/1.18	6 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,set_type) -> (subset(C,D) & subset(B,C) -> subset(B,D)))))))) # label(p1) # label(axiom) # label(non_clause).  [assumption].
0.93/1.18	8 (all B (ilf_type(B,set_type) -> -empty(power_set(B)) & ilf_type(power_set(B),set_type))) # label(p19) # label(axiom) # label(non_clause).  [assumption].
0.93/1.18	10 (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(p20) # label(axiom) # label(non_clause).  [assumption].
0.93/1.18	11 (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(p18) # label(axiom) # label(non_clause).  [assumption].
0.93/1.18	14 (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(p9) # label(axiom) # label(non_clause).  [assumption].
0.93/1.18	19 (all B (ilf_type(B,set_type) -> ((all C (ilf_type(C,set_type) -> -member(C,B))) <-> empty(B)))) # label(p24) # label(axiom) # label(non_clause).  [assumption].
0.93/1.18	21 (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(D,E) & subset(B,C) -> subset(cross_product(B,D),cross_product(C,E))))))))))) # label(p3) # label(axiom) # label(non_clause).  [assumption].
0.93/1.18	22 (all B (ilf_type(B,set_type) -> (ilf_type(B,set_type) & relation_like(B) <-> ilf_type(B,binary_relation_type)))) # label(p13) # label(axiom) # label(non_clause).  [assumption].
0.93/1.18	24 (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.93/1.18	26 (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(p23) # label(axiom) # label(non_clause).  [assumption].
0.93/1.18	27 -(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,relation_type(B,D)) -> (subset(domain_of(E),C) -> ilf_type(E,relation_type(C,D))))))))))) # label(prove_relset_1_13) # label(negated_conjecture) # label(non_clause).  [assumption].
0.93/1.18	28 -ilf_type(A,set_type) | -relation_like(A) | ilf_type(A,binary_relation_type) # label(p13) # label(axiom).  [clausify(22)].
0.93/1.18	33 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,subset_type(cross_product(A,B))) | relation_like(C) # label(p23) # label(axiom).  [clausify(26)].
0.93/1.18	38 ilf_type(A,set_type) # label(p26) # label(axiom).  [clausify(3)].
0.93/1.18	40 subset(domain_of(c5),c3) # label(prove_relset_1_13) # label(negated_conjecture).  [clausify(27)].
0.93/1.18	41 ilf_type(c5,relation_type(c2,c4)) # label(prove_relset_1_13) # label(negated_conjecture).  [clausify(27)].
0.93/1.18	42 -ilf_type(c5,relation_type(c3,c4)) # label(prove_relset_1_13) # label(negated_conjecture).  [clausify(27)].
0.93/1.18	43 -ilf_type(A,set_type) | -empty(power_set(A)) # label(p19) # label(axiom).  [clausify(8)].
0.93/1.18	44 -empty(power_set(A)).  [copy(43),unit_del(a,38)].
0.93/1.18	45 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | -empty(A) # label(p24) # label(axiom).  [clausify(19)].
0.93/1.18	46 -member(A,B) | -empty(B).  [copy(45),unit_del(a,38),unit_del(b,38)].
0.93/1.18	55 -ilf_type(A,binary_relation_type) | subset(A,cross_product(domain_of(A),range_of(A))) # label(p2) # label(axiom).  [clausify(4)].
0.93/1.18	67 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,relation_type(A,B)) | subset(range_of(C),B) # label(p6) # label(axiom).  [clausify(1)].
0.93/1.18	68 -ilf_type(A,relation_type(B,C)) | subset(range_of(A),C).  [copy(67),unit_del(a,38),unit_del(b,38)].
0.93/1.18	71 -ilf_type(A,set_type) | empty(B) | -ilf_type(B,set_type) | -ilf_type(A,member_type(B)) | member(A,B) # label(p20) # label(axiom).  [clausify(10)].
0.93/1.18	72 empty(A) | -ilf_type(B,member_type(A)) | member(B,A).  [copy(71),unit_del(a,38),unit_del(c,38)].
0.93/1.18	73 -ilf_type(A,set_type) | empty(B) | -ilf_type(B,set_type) | ilf_type(A,member_type(B)) | -member(A,B) # label(p20) # label(axiom).  [clausify(10)].
0.93/1.18	74 empty(A) | ilf_type(B,member_type(A)) | -member(B,A).  [copy(73),unit_del(a,38),unit_del(c,38)].
0.93/1.18	76 -ilf_type(A,set_type) | -ilf_type(B,set_type) | member(A,power_set(B)) | member(f2(A,B),A) # label(p18) # label(axiom).  [clausify(11)].
0.93/1.18	77 member(A,power_set(B)) | member(f2(A,B),A).  [copy(76),unit_del(a,38),unit_del(b,38)].
0.93/1.18	78 -ilf_type(A,set_type) | -ilf_type(B,set_type) | member(A,power_set(B)) | -member(f2(A,B),B) # label(p18) # label(axiom).  [clausify(11)].
0.93/1.18	79 member(A,power_set(B)) | -member(f2(A,B),B).  [copy(78),unit_del(a,38),unit_del(b,38)].
0.93/1.18	83 -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(24)].
0.93/1.18	84 ilf_type(A,subset_type(B)) | -ilf_type(A,member_type(power_set(B))).  [copy(83),unit_del(a,38),unit_del(b,38)].
0.93/1.18	85 -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(2)].
0.93/1.18	86 -ilf_type(A,subset_type(cross_product(B,C))) | ilf_type(A,relation_type(B,C)).  [copy(85),unit_del(a,38),unit_del(b,38)].
0.93/1.18	87 -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(p4) # label(axiom).  [clausify(2)].
0.93/1.18	88 -ilf_type(A,relation_type(B,C)) | ilf_type(A,subset_type(cross_product(B,C))).  [copy(87),unit_del(a,38),unit_del(b,38)].
0.93/1.18	91 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | -subset(B,C) | -subset(A,B) | subset(A,C) # label(p1) # label(axiom).  [clausify(6)].
0.93/1.18	92 -subset(A,B) | -subset(C,A) | subset(C,B).  [copy(91),unit_del(a,38),unit_del(b,38),unit_del(c,38)].
0.93/1.18	93 -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(p9) # label(axiom).  [clausify(14)].
0.93/1.18	94 -subset(A,B) | -member(C,A) | member(C,B).  [copy(93),unit_del(a,38),unit_del(b,38),unit_del(d,38)].
0.93/1.18	99 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -subset(C,D) | -subset(A,B) | subset(cross_product(A,C),cross_product(B,D)) # label(p3) # label(axiom).  [clausify(21)].
0.93/1.18	100 -subset(A,B) | -subset(C,D) | subset(cross_product(C,A),cross_product(D,B)).  [copy(99),unit_del(a,38),unit_del(b,38),unit_del(c,38),unit_del(d,38)].
0.93/1.18	106 -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,b)].
0.93/1.18	107 -ilf_type(A,subset_type(cross_product(B,C))) | ilf_type(A,binary_relation_type).  [copy(106),unit_del(a,38),unit_del(b,38),unit_del(d,38)].
0.93/1.18	136 subset(range_of(c5),c4).  [resolve(68,a,41,a)].
0.93/1.18	141 member(A,power_set(B)) | empty(A) | ilf_type(f2(A,B),member_type(A)).  [resolve(77,b,74,c)].
0.93/1.18	142 member(A,power_set(B)) | -empty(A).  [resolve(77,b,46,a)].
0.93/1.18	147 -ilf_type(c5,subset_type(cross_product(c3,c4))).  [ur(86,b,42,a)].
0.93/1.18	149 ilf_type(c5,subset_type(cross_product(c2,c4))).  [resolve(88,a,41,a)].
0.93/1.18	190 -ilf_type(c5,member_type(power_set(cross_product(c3,c4)))).  [ur(84,a,147,a)].
0.93/1.18	191 -member(c5,power_set(cross_product(c3,c4))).  [ur(74,a,44,a,b,190,a)].
0.93/1.18	192 -member(f2(c5,cross_product(c3,c4)),cross_product(c3,c4)).  [ur(79,a,191,a)].
0.93/1.18	269 -empty(c5).  [ur(142,a,191,a)].
0.93/1.18	286 ilf_type(f2(c5,cross_product(c3,c4)),member_type(c5)).  [resolve(141,a,191,a),unit_del(a,269)].
0.93/1.18	312 ilf_type(c5,binary_relation_type).  [resolve(149,a,107,a)].
0.93/1.18	314 subset(c5,cross_product(domain_of(c5),range_of(c5))).  [resolve(312,a,55,a)].
0.93/1.18	1058 member(f2(c5,cross_product(c3,c4)),c5).  [resolve(286,a,72,b),unit_del(a,269)].
0.93/1.18	1118 -subset(c5,cross_product(c3,c4)).  [ur(94,b,1058,a,c,192,a)].
0.93/1.18	1128 -subset(cross_product(domain_of(c5),range_of(c5)),cross_product(c3,c4)).  [ur(92,b,314,a,c,1118,a)].
0.93/1.18	1289 $F.  [ur(100,b,40,a,c,1128,a),unit_del(a,136)].
0.93/1.18	
0.93/1.18	% SZS output end Refutation
0.93/1.18	============================== end of proof ==========================
0.93/1.18	
0.93/1.18	============================== STATISTICS ============================
0.93/1.18	
0.93/1.18	Given=197. Generated=1606. Kept=1196. proofs=1.
0.93/1.18	Usable=197. Sos=988. Demods=3. Limbo=1, Disabled=86. Hints=0.
0.93/1.18	Megabytes=1.63.
0.93/1.18	User_CPU=0.10, System_CPU=0.00, Wall_clock=1.
0.93/1.18	
0.93/1.18	============================== end of statistics =====================
0.93/1.18	
0.93/1.18	============================== end of search =========================
0.93/1.18	
0.93/1.18	THEOREM PROVED
0.93/1.18	% SZS status Theorem
0.93/1.18	
0.93/1.18	Exiting with 1 proof.
0.93/1.18	
0.93/1.18	Process 13538 exit (max_proofs) Thu Aug 29 13:00:38 2019
0.93/1.18	Prover9 interrupted
0.93/1.18	EOF