0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n006.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 180
0.13/0.34	% DateTime   : Thu Aug 29 11:22:54 EDT 2019
0.13/0.34	% CPUTime    : 
0.44/1.03	============================== Prover9 ===============================
0.44/1.03	Prover9 (32) version 2009-11A, November 2009.
0.44/1.03	Process 22296 was started by sandbox on n006.cluster.edu,
0.44/1.03	Thu Aug 29 11:22:55 2019
0.44/1.03	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_22142_n006.cluster.edu".
0.44/1.03	============================== end of head ===========================
0.44/1.03	
0.44/1.03	============================== INPUT =================================
0.44/1.03	
0.44/1.03	% Reading from file /tmp/Prover9_22142_n006.cluster.edu
0.44/1.03	
0.44/1.03	set(prolog_style_variables).
0.44/1.03	set(auto2).
0.44/1.03	    % set(auto2) -> set(auto).
0.44/1.03	    % set(auto) -> set(auto_inference).
0.44/1.03	    % set(auto) -> set(auto_setup).
0.44/1.03	    % set(auto_setup) -> set(predicate_elim).
0.44/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.44/1.03	    % set(auto) -> set(auto_limits).
0.44/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.44/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.44/1.03	    % set(auto) -> set(auto_denials).
0.44/1.03	    % set(auto) -> set(auto_process).
0.44/1.03	    % set(auto2) -> assign(new_constants, 1).
0.44/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.44/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.44/1.03	    % set(auto2) -> assign(max_hours, 1).
0.44/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.44/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.44/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.44/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.44/1.03	    % set(auto2) -> set(sort_initial_sos).
0.44/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.44/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.44/1.03	    % set(auto2) -> assign(max_megs, 400).
0.44/1.03	    % set(auto2) -> assign(stats, some).
0.44/1.03	    % set(auto2) -> clear(echo_input).
0.44/1.03	    % set(auto2) -> set(quiet).
0.44/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.44/1.03	    % set(auto2) -> clear(print_given).
0.44/1.03	assign(lrs_ticks,-1).
0.44/1.03	assign(sos_limit,10000).
0.44/1.03	assign(order,kbo).
0.44/1.03	set(lex_order_vars).
0.44/1.03	clear(print_given).
0.44/1.03	
0.44/1.03	% formulas(sos).  % not echoed (25 formulas)
0.44/1.03	
0.44/1.03	============================== end of input ==========================
0.44/1.03	
0.44/1.03	% From the command line: assign(max_seconds, 180).
0.44/1.03	
0.44/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.44/1.03	
0.44/1.03	% Formulas that are not ordinary clauses:
0.44/1.03	1 (all B (ilf_type(B,binary_relation_type) -> ilf_type(range_of(B),set_type))) # label(p9) # label(axiom) # label(non_clause).  [assumption].
0.44/1.03	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(p2) # label(axiom) # label(non_clause).  [assumption].
0.44/1.03	3 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ilf_type(ordered_pair(B,C),set_type))))) # label(p19) # label(axiom) # label(non_clause).  [assumption].
0.44/1.03	4 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (exists D ilf_type(D,relation_type(C,B))))))) # label(p3) # label(axiom) # label(non_clause).  [assumption].
0.44/1.03	5 (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(p20) # label(axiom) # label(non_clause).  [assumption].
0.44/1.03	6 (all B (ilf_type(B,set_type) -> ((all C (ilf_type(C,set_type) -> (member(C,B) -> (exists D (ilf_type(D,set_type) & (exists E (ilf_type(E,set_type) & ordered_pair(D,E) = C))))))) <-> relation_like(B)))) # label(p16) # label(axiom) # label(non_clause).  [assumption].
0.44/1.03	7 (all B (ilf_type(B,set_type) -> ilf_type(power_set(B),set_type) & -empty(power_set(B)))) # label(p15) # label(axiom) # label(non_clause).  [assumption].
0.44/1.03	8 (all B (ilf_type(B,binary_relation_type) -> ilf_type(domain_of(B),set_type))) # label(p7) # label(axiom) # label(non_clause).  [assumption].
0.44/1.03	9 (all B (empty(B) & ilf_type(B,set_type) -> relation_like(B))) # label(p17) # label(axiom) # label(non_clause).  [assumption].
0.44/1.03	10 (all B (ilf_type(B,set_type) -> (exists C ilf_type(C,subset_type(B))))) # label(p13) # label(axiom) # label(non_clause).  [assumption].
0.44/1.03	11 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) & -empty(C) -> (member(B,C) <-> ilf_type(B,member_type(C))))))) # label(p4) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	12 (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(p12) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	13 (all B (ilf_type(B,set_type) -> (relation_like(B) & ilf_type(B,set_type) <-> ilf_type(B,binary_relation_type)))) # label(p10) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	14 (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(p18) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	15 (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(p21) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	16 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ilf_type(cross_product(B,C),set_type))))) # label(p8) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	17 (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(p14) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	18 (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(D,domain_of(C))))))))) # label(p1) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	19 (all B ilf_type(B,set_type)) # label(p24) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	20 (all B (ilf_type(B,set_type) -> ((all C (ilf_type(C,set_type) -> -member(C,B))) <-> empty(B)))) # label(p6) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	21 (all B (ilf_type(B,set_type) & -empty(B) -> (exists C ilf_type(C,member_type(B))))) # label(p5) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	22 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,relation_type(B,C)) -> range_of(D) = range(B,C,D))))))) # label(p22) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	23 (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(p23) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	24 (exists B ilf_type(B,binary_relation_type)) # label(p11) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	25 -(all B (ilf_type(B,set_type) & -empty(B) -> (all C (ilf_type(C,set_type) & -empty(C) -> (all D (ilf_type(D,relation_type(C,B)) -> (all E (ilf_type(E,member_type(B)) -> (member(E,range(C,B,D)) -> (exists F (ilf_type(F,member_type(C)) & member(F,domain(C,B,D))))))))))))) # label(prove_relset_1_50) # label(negated_conjecture) # label(non_clause).  [assumption].
0.44/1.04	
0.44/1.04	============================== end of process non-clausal formulas ===
0.44/1.04	
0.44/1.04	============================== PROCESS INITIAL CLAUSES ===============
0.44/1.04	
0.44/1.04	============================== PREDICATE ELIMINATION =================
0.44/1.04	26 -ilf_type(A,set_type) | -relation_like(A) | ilf_type(A,binary_relation_type) # label(p10) # label(axiom).  [clausify(13)].
0.44/1.04	27 -empty(A) | -ilf_type(A,set_type) | relation_like(A) # label(p17) # label(axiom).  [clausify(9)].
0.44/1.04	Derived: -ilf_type(A,set_type) | ilf_type(A,binary_relation_type) | -empty(A) | -ilf_type(A,set_type).  [resolve(26,b,27,c)].
0.44/1.04	28 -ilf_type(A,set_type) | relation_like(A) | -ilf_type(A,binary_relation_type) # label(p10) # label(axiom).  [clausify(13)].
0.44/1.04	29 -ilf_type(A,set_type) | ilf_type(f2(A),set_type) | relation_like(A) # label(p16) # label(axiom).  [clausify(6)].
0.44/1.04	Derived: -ilf_type(A,set_type) | ilf_type(f2(A),set_type) | -ilf_type(A,set_type) | ilf_type(A,binary_relation_type).  [resolve(29,c,26,b)].
0.44/1.04	30 -ilf_type(A,set_type) | member(f2(A),A) | relation_like(A) # label(p16) # label(axiom).  [clausify(6)].
0.44/1.04	Derived: -ilf_type(A,set_type) | member(f2(A),A) | -ilf_type(A,set_type) | ilf_type(A,binary_relation_type).  [resolve(30,c,26,b)].
0.44/1.04	31 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,subset_type(cross_product(A,B))) | relation_like(C) # label(p18) # label(axiom).  [clausify(14)].
0.44/1.04	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(31,d,26,b)].
0.44/1.04	32 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f3(A,B),set_type) | -relation_like(A) # label(p16) # label(axiom).  [clausify(6)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f3(A,B),set_type) | -empty(A) | -ilf_type(A,set_type).  [resolve(32,e,27,c)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f3(A,B),set_type) | -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type).  [resolve(32,e,28,b)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f3(A,B),set_type) | -ilf_type(A,set_type) | ilf_type(f2(A),set_type).  [resolve(32,e,29,c)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f3(A,B),set_type) | -ilf_type(A,set_type) | member(f2(A),A).  [resolve(32,e,30,c)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f3(A,B),set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -ilf_type(A,subset_type(cross_product(C,D))).  [resolve(32,e,31,d)].
0.44/1.04	33 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f4(A,B),set_type) | -relation_like(A) # label(p16) # label(axiom).  [clausify(6)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f4(A,B),set_type) | -empty(A) | -ilf_type(A,set_type).  [resolve(33,e,27,c)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f4(A,B),set_type) | -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type).  [resolve(33,e,28,b)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f4(A,B),set_type) | -ilf_type(A,set_type) | ilf_type(f2(A),set_type).  [resolve(33,e,29,c)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f4(A,B),set_type) | -ilf_type(A,set_type) | member(f2(A),A).  [resolve(33,e,30,c)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f4(A,B),set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -ilf_type(A,subset_type(cross_product(C,D))).  [resolve(33,e,31,d)].
0.44/1.04	34 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | ordered_pair(B,C) != f2(A) | relation_like(A) # label(p16) # label(axiom).  [clausify(6)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | ordered_pair(B,C) != f2(A) | -ilf_type(A,set_type) | ilf_type(A,binary_relation_type).  [resolve(34,e,26,b)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | ordered_pair(B,C) != f2(A) | -ilf_type(A,set_type) | -ilf_type(D,set_type) | -member(D,A) | ilf_type(f3(A,D),set_type).  [resolve(34,e,32,e)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | ordered_pair(B,C) != f2(A) | -ilf_type(A,set_type) | -ilf_type(D,set_type) | -member(D,A) | ilf_type(f4(A,D),set_type).  [resolve(34,e,33,e)].
0.44/1.04	35 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f3(A,B),f4(A,B)) = B | -relation_like(A) # label(p16) # label(axiom).  [clausify(6)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f3(A,B),f4(A,B)) = B | -empty(A) | -ilf_type(A,set_type).  [resolve(35,e,27,c)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f3(A,B),f4(A,B)) = B | -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type).  [resolve(35,e,28,b)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f3(A,B),f4(A,B)) = B | -ilf_type(A,set_type) | ilf_type(f2(A),set_type).  [resolve(35,e,29,c)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f3(A,B),f4(A,B)) = B | -ilf_type(A,set_type) | member(f2(A),A).  [resolve(35,e,30,c)].
0.44/1.04	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f3(A,B),f4(A,B)) = B | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -ilf_type(A,subset_type(cross_product(C,D))).  [resolve(35,e,31,d)].
0.44/1.05	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f3(A,B),f4(A,B)) = B | -ilf_type(A,set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | ordered_pair(C,D) != f2(A).  [resolve(35,e,34,e)].
0.44/1.05	
0.44/1.05	============================== end predicate elimination =============
0.44/1.05	
0.44/1.05	Auto_denials:  (non-Horn, no changes).
0.44/1.05	
0.44/1.05	Term ordering decisions:
0.44/1.05	Function symbol KB weights:  set_type=1. binary_relation_type=1. c1=1. c2=1. c3=1. c4=1. c5=1. ordered_pair=1. relation_type=1. cross_product=1. f1=1. f3=1. f4=1. f6=1. f7=1. subset_type=1. power_set=1. member_type=1. range_of=1. domain_of=1. f2=1. f5=1. f8=1. f9=1. range=1. domain=1.
0.44/1.05	
0.44/1.05	============================== end of process initial clauses ========
0.44/1.05	
0.44/1.05	============================== CLAUSES FOR SEARCH ====================
0.44/1.05	
0.44/1.05	============================== end of clauses for search =============
0.44/1.05	
0.44/1.05	============================== SEARCH ================================
0.44/1.05	
0.44/1.05	% Starting search at 0.02 seconds.
0.44/1.05	
0.44/1.05	============================== PROOF =================================
0.44/1.05	% SZS status Theorem
0.44/1.05	% SZS output start Refutation
0.44/1.05	
0.44/1.05	% Proof 1 at 0.03 (+ 0.00) seconds.
0.44/1.05	% Length of proof is 56.
0.44/1.05	% Level of proof is 9.
0.44/1.05	% Maximum clause weight is 13.000.
0.44/1.05	% Given clauses 73.
0.44/1.05	
0.44/1.05	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(p2) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	5 (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(p20) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	7 (all B (ilf_type(B,set_type) -> ilf_type(power_set(B),set_type) & -empty(power_set(B)))) # label(p15) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	11 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) & -empty(C) -> (member(B,C) <-> ilf_type(B,member_type(C))))))) # label(p4) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	12 (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(p12) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	13 (all B (ilf_type(B,set_type) -> (relation_like(B) & ilf_type(B,set_type) <-> ilf_type(B,binary_relation_type)))) # label(p10) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	14 (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(p18) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	15 (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(p21) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	17 (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(p14) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	18 (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(D,domain_of(C))))))))) # label(p1) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	19 (all B ilf_type(B,set_type)) # label(p24) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	22 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,relation_type(B,C)) -> range_of(D) = range(B,C,D))))))) # label(p22) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	25 -(all B (ilf_type(B,set_type) & -empty(B) -> (all C (ilf_type(C,set_type) & -empty(C) -> (all D (ilf_type(D,relation_type(C,B)) -> (all E (ilf_type(E,member_type(B)) -> (member(E,range(C,B,D)) -> (exists F (ilf_type(F,member_type(C)) & member(F,domain(C,B,D))))))))))))) # label(prove_relset_1_50) # label(negated_conjecture) # label(non_clause).  [assumption].
0.44/1.05	26 -ilf_type(A,set_type) | -relation_like(A) | ilf_type(A,binary_relation_type) # label(p10) # label(axiom).  [clausify(13)].
0.44/1.05	31 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,subset_type(cross_product(A,B))) | relation_like(C) # label(p18) # label(axiom).  [clausify(14)].
0.44/1.05	36 ilf_type(A,set_type) # label(p24) # label(axiom).  [clausify(19)].
0.44/1.05	39 ilf_type(c4,relation_type(c3,c2)) # label(prove_relset_1_50) # label(negated_conjecture).  [clausify(25)].
0.44/1.05	40 member(c5,range(c3,c2,c4)) # label(prove_relset_1_50) # label(negated_conjecture).  [clausify(25)].
0.44/1.05	42 -empty(c3) # label(prove_relset_1_50) # label(negated_conjecture).  [clausify(25)].
0.44/1.05	43 -ilf_type(A,set_type) | -empty(power_set(A)) # label(p15) # label(axiom).  [clausify(7)].
0.44/1.05	44 -empty(power_set(A)).  [copy(43),unit_del(a,36)].
0.44/1.05	45 -ilf_type(A,member_type(c3)) | -member(A,domain(c3,c2,c4)) # label(prove_relset_1_50) # label(negated_conjecture).  [clausify(25)].
0.44/1.05	60 -ilf_type(A,set_type) | -ilf_type(B,set_type) | empty(B) | -member(A,B) | ilf_type(A,member_type(B)) # label(p4) # label(axiom).  [clausify(11)].
0.44/1.05	61 empty(A) | -member(B,A) | ilf_type(B,member_type(A)).  [copy(60),unit_del(a,36),unit_del(b,36)].
0.44/1.05	62 -ilf_type(A,set_type) | -ilf_type(B,set_type) | empty(B) | member(A,B) | -ilf_type(A,member_type(B)) # label(p4) # label(axiom).  [clausify(11)].
0.44/1.05	63 empty(A) | member(B,A) | -ilf_type(B,member_type(A)).  [copy(62),unit_del(a,36),unit_del(b,36)].
0.44/1.05	64 -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(p12) # label(axiom).  [clausify(12)].
0.44/1.05	65 -ilf_type(A,subset_type(B)) | ilf_type(A,member_type(power_set(B))).  [copy(64),unit_del(a,36),unit_del(b,36)].
0.44/1.05	74 -ilf_type(A,set_type) | -ilf_type(B,binary_relation_type) | -member(A,range_of(B)) | member(f7(A,B),domain_of(B)) # label(p1) # label(axiom).  [clausify(18)].
0.44/1.05	75 -ilf_type(A,binary_relation_type) | -member(B,range_of(A)) | member(f7(B,A),domain_of(A)).  [copy(74),unit_del(a,36)].
0.44/1.05	78 -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(p2) # label(axiom).  [clausify(2)].
0.44/1.05	79 -ilf_type(A,relation_type(B,C)) | ilf_type(A,subset_type(cross_product(B,C))).  [copy(78),unit_del(a,36),unit_del(b,36)].
0.44/1.05	80 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,relation_type(A,B)) | domain_of(C) = domain(A,B,C) # label(p20) # label(axiom).  [clausify(5)].
0.44/1.05	81 -ilf_type(A,relation_type(B,C)) | domain(B,C,A) = domain_of(A).  [copy(80),flip(d),unit_del(a,36),unit_del(b,36)].
0.44/1.05	82 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,relation_type(A,B)) | ilf_type(domain(A,B,C),subset_type(A)) # label(p21) # label(axiom).  [clausify(15)].
0.44/1.05	83 -ilf_type(A,relation_type(B,C)) | ilf_type(domain(B,C,A),subset_type(B)).  [copy(82),unit_del(a,36),unit_del(b,36)].
0.44/1.05	84 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,relation_type(A,B)) | range(A,B,C) = range_of(C) # label(p22) # label(axiom).  [clausify(22)].
0.44/1.05	85 -ilf_type(A,relation_type(B,C)) | range(B,C,A) = range_of(A).  [copy(84),unit_del(a,36),unit_del(b,36)].
0.44/1.05	88 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(A,power_set(B)) | -ilf_type(C,set_type) | -member(C,A) | member(C,B) # label(p14) # label(axiom).  [clausify(17)].
0.44/1.05	89 -member(A,power_set(B)) | -member(C,A) | member(C,B).  [copy(88),unit_del(a,36),unit_del(b,36),unit_del(d,36)].
0.44/1.05	95 -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(31,d,26,b)].
0.44/1.05	96 -ilf_type(A,subset_type(cross_product(B,C))) | ilf_type(A,binary_relation_type).  [copy(95),unit_del(a,36),unit_del(b,36),unit_del(d,36)].
0.44/1.05	138 ilf_type(c4,subset_type(cross_product(c3,c2))).  [resolve(79,a,39,a)].
0.44/1.05	140 domain(c3,c2,c4) = domain_of(c4).  [resolve(81,a,39,a)].
0.44/1.05	143 -ilf_type(A,member_type(c3)) | -member(A,domain_of(c4)).  [back_rewrite(45),rewrite([140(7)])].
0.44/1.05	145 ilf_type(domain_of(c4),subset_type(c3)).  [resolve(83,a,39,a),rewrite([140(4)])].
0.44/1.05	147 range(c3,c2,c4) = range_of(c4).  [resolve(85,a,39,a)].
0.44/1.05	150 member(c5,range_of(c4)).  [back_rewrite(40),rewrite([147(5)])].
0.44/1.05	189 -ilf_type(c4,binary_relation_type) | member(f7(c5,c4),domain_of(c4)).  [resolve(150,a,75,b)].
0.44/1.05	190 ilf_type(domain_of(c4),member_type(power_set(c3))).  [resolve(145,a,65,a)].
0.44/1.05	222 ilf_type(c4,binary_relation_type).  [resolve(138,a,96,a)].
0.44/1.05	224 member(f7(c5,c4),domain_of(c4)).  [back_unit_del(189),unit_del(a,222)].
0.44/1.05	232 member(domain_of(c4),power_set(c3)).  [resolve(190,a,63,c),unit_del(a,44)].
0.44/1.05	250 -ilf_type(f7(c5,c4),member_type(c3)).  [resolve(224,a,143,b)].
0.44/1.05	270 -member(f7(c5,c4),c3).  [ur(61,a,42,a,c,250,a)].
0.44/1.05	271 $F.  [ur(89,b,224,a,c,270,a),unit_del(a,232)].
0.44/1.05	
0.44/1.05	% SZS output end Refutation
0.44/1.05	============================== end of proof ==========================
0.44/1.05	
0.44/1.05	============================== STATISTICS ============================
0.44/1.05	
0.44/1.05	Given=73. Generated=255. Kept=186. proofs=1.
0.44/1.05	Usable=71. Sos=103. Demods=6. Limbo=0, Disabled=83. Hints=0.
0.44/1.05	Megabytes=0.36.
0.44/1.05	User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
0.44/1.05	
0.44/1.05	============================== end of statistics =====================
0.44/1.05	
0.44/1.05	============================== end of search =========================
0.44/1.05	
0.44/1.05	THEOREM PROVED
0.44/1.05	% SZS status Theorem
0.44/1.05	
0.44/1.05	Exiting with 1 proof.
0.44/1.05	
0.44/1.05	Process 22296 exit (max_proofs) Thu Aug 29 11:22:55 2019
0.44/1.05	Prover9 interrupted
0.44/1.06	EOF