0.12/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n020.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 13:00:55 EDT 2019
0.19/0.34	% CPUTime    : 
0.45/1.02	============================== Prover9 ===============================
0.45/1.02	Prover9 (32) version 2009-11A, November 2009.
0.45/1.02	Process 23420 was started by sandbox on n020.cluster.edu,
0.45/1.02	Thu Aug 29 13:00:56 2019
0.45/1.02	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_23267_n020.cluster.edu".
0.45/1.02	============================== end of head ===========================
0.45/1.02	
0.45/1.02	============================== INPUT =================================
0.45/1.02	
0.45/1.02	% Reading from file /tmp/Prover9_23267_n020.cluster.edu
0.45/1.02	
0.45/1.02	set(prolog_style_variables).
0.45/1.02	set(auto2).
0.45/1.02	    % set(auto2) -> set(auto).
0.45/1.02	    % set(auto) -> set(auto_inference).
0.45/1.02	    % set(auto) -> set(auto_setup).
0.45/1.02	    % set(auto_setup) -> set(predicate_elim).
0.45/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.45/1.02	    % set(auto) -> set(auto_limits).
0.45/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.45/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.45/1.02	    % set(auto) -> set(auto_denials).
0.45/1.02	    % set(auto) -> set(auto_process).
0.45/1.02	    % set(auto2) -> assign(new_constants, 1).
0.45/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.45/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.45/1.02	    % set(auto2) -> assign(max_hours, 1).
0.45/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.45/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.45/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.45/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.45/1.02	    % set(auto2) -> set(sort_initial_sos).
0.45/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.45/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.45/1.02	    % set(auto2) -> assign(max_megs, 400).
0.45/1.02	    % set(auto2) -> assign(stats, some).
0.45/1.02	    % set(auto2) -> clear(echo_input).
0.45/1.02	    % set(auto2) -> set(quiet).
0.45/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.45/1.02	    % set(auto2) -> clear(print_given).
0.45/1.02	assign(lrs_ticks,-1).
0.45/1.02	assign(sos_limit,10000).
0.45/1.02	assign(order,kbo).
0.45/1.02	set(lex_order_vars).
0.45/1.02	clear(print_given).
0.45/1.02	
0.45/1.02	% formulas(sos).  % not echoed (20 formulas)
0.45/1.02	
0.45/1.02	============================== end of input ==========================
0.45/1.02	
0.45/1.02	% From the command line: assign(max_seconds, 180).
0.45/1.02	
0.45/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.45/1.02	
0.45/1.02	% Formulas that are not ordinary clauses:
0.45/1.02	1 (all B (ilf_type(B,set_type) -> (all C (-empty(C) & ilf_type(C,set_type) -> (member(B,C) <-> ilf_type(B,member_type(C))))))) # label(p12) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	2 (all B ilf_type(B,set_type)) # label(p19) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	3 (all B (ilf_type(B,set_type) -> (exists C ilf_type(C,subset_type(B))))) # label(p8) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	4 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (ilf_type(C,member_type(power_set(B))) <-> ilf_type(C,subset_type(B))))))) # label(p7) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	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))) -> relation_like(D))))))) # label(p17) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	6 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all E (ilf_type(E,relation_type(B,C)) -> ilf_type(E,subset_type(cross_product(B,C))))) & (all D (ilf_type(D,subset_type(cross_product(B,C))) -> ilf_type(D,relation_type(B,C)))))))) # label(p3) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	7 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ((all D (ilf_type(D,set_type) -> (member(D,B) -> member(D,C)))) <-> member(B,power_set(C))))))) # label(p10) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	8 (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.45/1.02	9 (all B (empty(B) & ilf_type(B,set_type) -> relation_like(B))) # label(p16) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	10 (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(p2) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	11 (all B (ilf_type(B,set_type) -> subset(B,B))) # label(p9) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	12 (all B (ilf_type(B,set_type) -> -empty(power_set(B)) & ilf_type(power_set(B),set_type))) # label(p11) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	13 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ilf_type(cross_product(B,C),set_type))))) # label(p6) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	14 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ilf_type(ordered_pair(B,C),set_type))))) # label(p18) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	15 (all B (ilf_type(B,set_type) -> (relation_like(B) <-> (all C (ilf_type(C,set_type) -> (member(C,B) -> (exists D ((exists E (ilf_type(E,set_type) & ordered_pair(D,E) = C)) & ilf_type(D,set_type))))))))) # label(p15) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	16 (all B (ilf_type(B,set_type) & -empty(B) -> (exists C ilf_type(C,member_type(B))))) # label(p13) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	17 (all B (ilf_type(B,set_type) -> ((all C (ilf_type(C,set_type) -> -member(C,B))) <-> empty(B)))) # label(p14) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	18 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ((all D (ilf_type(D,set_type) -> (member(D,B) -> member(D,C)))) <-> subset(B,C)))))) # label(p5) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	19 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (exists D ilf_type(D,relation_type(C,B))))))) # label(p4) # label(axiom) # label(non_clause).  [assumption].
0.45/1.02	20 -(all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,set_type) -> (all E (ilf_type(E,set_type) -> (all F (ilf_type(F,relation_type(B,D)) -> (subset(B,C) & subset(D,E) -> ilf_type(F,relation_type(C,E))))))))))))) # label(prove_relset_1_17) # label(negated_conjecture) # label(non_clause).  [assumption].
0.45/1.02	
0.45/1.02	============================== end of process non-clausal formulas ===
0.45/1.02	
0.45/1.02	============================== PROCESS INITIAL CLAUSES ===============
0.45/1.02	
0.45/1.02	============================== PREDICATE ELIMINATION =================
0.45/1.02	21 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f4(A,B),set_type) # label(p15) # label(axiom).  [clausify(15)].
0.45/1.02	22 -empty(A) | -ilf_type(A,set_type) | relation_like(A) # label(p16) # label(axiom).  [clausify(9)].
0.45/1.02	23 -ilf_type(A,set_type) | relation_like(A) | ilf_type(f5(A),set_type) # label(p15) # label(axiom).  [clausify(15)].
0.45/1.02	24 -ilf_type(A,set_type) | relation_like(A) | member(f5(A),A) # label(p15) # label(axiom).  [clausify(15)].
0.45/1.02	25 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,subset_type(cross_product(A,B))) | relation_like(C) # label(p17) # label(axiom).  [clausify(5)].
0.45/1.02	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(21,b,22,c)].
0.45/1.02	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(f5(A),set_type).  [resolve(21,b,23,b)].
0.45/1.02	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(f5(A),A).  [resolve(21,b,24,b)].
0.45/1.02	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(21,b,25,d)].
0.45/1.02	26 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f3(A,B),set_type) # label(p15) # label(axiom).  [clausify(15)].
0.45/1.02	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(26,b,22,c)].
0.45/1.02	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(f5(A),set_type).  [resolve(26,b,23,b)].
0.45/1.02	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(f5(A),A).  [resolve(26,b,24,b)].
0.45/1.07	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(26,b,25,d)].
0.45/1.07	27 -ilf_type(A,set_type) | relation_like(A) | -ilf_type(B,set_type) | ordered_pair(C,B) != f5(A) | -ilf_type(C,set_type) # label(p15) # label(axiom).  [clausify(15)].
0.45/1.07	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | ordered_pair(C,B) != f5(A) | -ilf_type(C,set_type) | -ilf_type(A,set_type) | -ilf_type(D,set_type) | -member(D,A) | ilf_type(f4(A,D),set_type).  [resolve(27,b,21,b)].
0.45/1.07	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | ordered_pair(C,B) != f5(A) | -ilf_type(C,set_type) | -ilf_type(A,set_type) | -ilf_type(D,set_type) | -member(D,A) | ilf_type(f3(A,D),set_type).  [resolve(27,b,26,b)].
0.45/1.07	28 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f3(A,B),f4(A,B)) = B # label(p15) # label(axiom).  [clausify(15)].
0.45/1.07	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(28,b,22,c)].
0.45/1.07	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(f5(A),set_type).  [resolve(28,b,23,b)].
0.45/1.07	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(f5(A),A).  [resolve(28,b,24,b)].
0.45/1.07	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(28,b,25,d)].
0.45/1.07	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) | ordered_pair(D,C) != f5(A) | -ilf_type(D,set_type).  [resolve(28,b,27,b)].
0.45/1.07	
0.45/1.07	============================== end predicate elimination =============
0.45/1.07	
0.45/1.07	Auto_denials:  (non-Horn, no changes).
0.45/1.07	
0.45/1.07	Term ordering decisions:
0.45/1.07	Function symbol KB weights:  set_type=1. c1=1. c2=1. c3=1. c4=1. c5=1. ordered_pair=1. cross_product=1. relation_type=1. f2=1. f3=1. f4=1. f8=1. f9=1. subset_type=1. power_set=1. member_type=1. f1=1. f5=1. f6=1. f7=1.
0.45/1.07	
0.45/1.07	============================== end of process initial clauses ========
0.45/1.07	
0.45/1.07	============================== CLAUSES FOR SEARCH ====================
0.45/1.07	
0.45/1.07	============================== end of clauses for search =============
0.45/1.07	
0.45/1.07	============================== SEARCH ================================
0.45/1.07	
0.45/1.07	% Starting search at 0.02 seconds.
0.45/1.07	
0.45/1.07	============================== PROOF =================================
0.45/1.07	% SZS status Theorem
0.45/1.07	% SZS output start Refutation
0.45/1.07	
0.45/1.07	% Proof 1 at 0.06 (+ 0.00) seconds.
0.45/1.07	% Length of proof is 71.
0.45/1.07	% Level of proof is 12.
0.45/1.07	% Maximum clause weight is 13.000.
0.45/1.07	% Given clauses 164.
0.45/1.07	
0.45/1.07	1 (all B (ilf_type(B,set_type) -> (all C (-empty(C) & ilf_type(C,set_type) -> (member(B,C) <-> ilf_type(B,member_type(C))))))) # label(p12) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	2 (all B ilf_type(B,set_type)) # label(p19) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	4 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (ilf_type(C,member_type(power_set(B))) <-> ilf_type(C,subset_type(B))))))) # label(p7) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	6 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all E (ilf_type(E,relation_type(B,C)) -> ilf_type(E,subset_type(cross_product(B,C))))) & (all D (ilf_type(D,subset_type(cross_product(B,C))) -> ilf_type(D,relation_type(B,C)))))))) # label(p3) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	7 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ((all D (ilf_type(D,set_type) -> (member(D,B) -> member(D,C)))) <-> member(B,power_set(C))))))) # label(p10) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	10 (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(p2) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	11 (all B (ilf_type(B,set_type) -> subset(B,B))) # label(p9) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	12 (all B (ilf_type(B,set_type) -> -empty(power_set(B)) & ilf_type(power_set(B),set_type))) # label(p11) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	17 (all B (ilf_type(B,set_type) -> ((all C (ilf_type(C,set_type) -> -member(C,B))) <-> empty(B)))) # label(p14) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	18 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ((all D (ilf_type(D,set_type) -> (member(D,B) -> member(D,C)))) <-> subset(B,C)))))) # label(p5) # label(axiom) # label(non_clause).  [assumption].
0.45/1.07	20 -(all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,set_type) -> (all E (ilf_type(E,set_type) -> (all F (ilf_type(F,relation_type(B,D)) -> (subset(B,C) & subset(D,E) -> ilf_type(F,relation_type(C,E))))))))))))) # label(prove_relset_1_17) # label(negated_conjecture) # label(non_clause).  [assumption].
0.45/1.07	29 ilf_type(A,set_type) # label(p19) # label(axiom).  [clausify(2)].
0.45/1.07	30 subset(c1,c2) # label(prove_relset_1_17) # label(negated_conjecture).  [clausify(20)].
0.45/1.07	31 subset(c3,c4) # label(prove_relset_1_17) # label(negated_conjecture).  [clausify(20)].
0.45/1.07	32 ilf_type(c5,relation_type(c1,c3)) # label(prove_relset_1_17) # label(negated_conjecture).  [clausify(20)].
0.45/1.07	33 -ilf_type(c5,relation_type(c2,c4)) # label(prove_relset_1_17) # label(negated_conjecture).  [clausify(20)].
0.45/1.07	34 -ilf_type(A,set_type) | -empty(power_set(A)) # label(p11) # label(axiom).  [clausify(12)].
0.45/1.07	35 -empty(power_set(A)).  [copy(34),unit_del(a,29)].
0.45/1.07	36 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | -empty(A) # label(p14) # label(axiom).  [clausify(17)].
0.45/1.07	37 -member(A,B) | -empty(B).  [copy(36),unit_del(a,29),unit_del(b,29)].
0.45/1.07	38 -ilf_type(A,set_type) | subset(A,A) # label(p9) # label(axiom).  [clausify(11)].
0.45/1.07	39 subset(A,A).  [copy(38),unit_del(a,29)].
0.45/1.07	53 -ilf_type(A,set_type) | -ilf_type(B,set_type) | member(f8(A,B),A) | subset(A,B) # label(p5) # label(axiom).  [clausify(18)].
0.45/1.07	54 member(f8(A,B),A) | subset(A,B).  [copy(53),unit_del(a,29),unit_del(b,29)].
0.45/1.07	55 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(f8(A,B),B) | subset(A,B) # label(p5) # label(axiom).  [clausify(18)].
0.45/1.07	56 -member(f8(A,B),B) | subset(A,B).  [copy(55),unit_del(a,29),unit_del(b,29)].
0.45/1.07	57 -ilf_type(A,set_type) | empty(B) | -ilf_type(B,set_type) | -member(A,B) | ilf_type(A,member_type(B)) # label(p12) # label(axiom).  [clausify(1)].
0.45/1.07	58 empty(A) | -member(B,A) | ilf_type(B,member_type(A)).  [copy(57),unit_del(a,29),unit_del(c,29)].
0.45/1.07	59 -ilf_type(A,set_type) | empty(B) | -ilf_type(B,set_type) | member(A,B) | -ilf_type(A,member_type(B)) # label(p12) # label(axiom).  [clausify(1)].
0.45/1.07	60 empty(A) | member(B,A) | -ilf_type(B,member_type(A)).  [copy(59),unit_del(a,29),unit_del(c,29)].
0.45/1.07	61 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(B,member_type(power_set(A))) | ilf_type(B,subset_type(A)) # label(p7) # label(axiom).  [clausify(4)].
0.45/1.07	62 -ilf_type(A,member_type(power_set(B))) | ilf_type(A,subset_type(B)).  [copy(61),unit_del(a,29),unit_del(b,29)].
0.45/1.07	63 -ilf_type(A,set_type) | -ilf_type(B,set_type) | ilf_type(B,member_type(power_set(A))) | -ilf_type(B,subset_type(A)) # label(p7) # label(axiom).  [clausify(4)].
0.45/1.07	64 ilf_type(A,member_type(power_set(B))) | -ilf_type(A,subset_type(B)).  [copy(63),unit_del(a,29),unit_del(b,29)].
0.45/1.07	66 -ilf_type(A,set_type) | -ilf_type(B,set_type) | member(f2(A,B),A) | member(A,power_set(B)) # label(p10) # label(axiom).  [clausify(7)].
0.45/1.07	67 member(f2(A,B),A) | member(A,power_set(B)).  [copy(66),unit_del(a,29),unit_del(b,29)].
0.45/1.07	68 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(f2(A,B),B) | member(A,power_set(B)) # label(p10) # label(axiom).  [clausify(7)].
0.45/1.07	69 -member(f2(A,B),B) | member(A,power_set(B)).  [copy(68),unit_del(a,29),unit_del(b,29)].
0.45/1.07	70 -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(p3) # label(axiom).  [clausify(6)].
0.45/1.08	71 -ilf_type(A,relation_type(B,C)) | ilf_type(A,subset_type(cross_product(B,C))).  [copy(70),unit_del(a,29),unit_del(b,29)].
0.45/1.08	72 -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(p3) # label(axiom).  [clausify(6)].
0.45/1.08	73 -ilf_type(A,subset_type(cross_product(B,C))) | ilf_type(A,relation_type(B,C)).  [copy(72),unit_del(a,29),unit_del(b,29)].
0.45/1.08	76 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | -member(C,A) | member(C,B) | -subset(A,B) # label(p5) # label(axiom).  [clausify(18)].
0.45/1.08	77 -member(A,B) | member(A,C) | -subset(B,C).  [copy(76),unit_del(a,29),unit_del(b,29),unit_del(c,29)].
0.45/1.08	78 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | -member(C,A) | member(C,B) | -member(A,power_set(B)) # label(p10) # label(axiom).  [clausify(7)].
0.45/1.08	79 -member(A,B) | member(A,C) | -member(B,power_set(C)).  [copy(78),unit_del(a,29),unit_del(b,29),unit_del(c,29)].
0.45/1.08	80 -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(p2) # label(axiom).  [clausify(10)].
0.45/1.08	81 -subset(A,B) | -subset(C,D) | subset(cross_product(C,A),cross_product(D,B)).  [copy(80),unit_del(a,29),unit_del(b,29),unit_del(c,29),unit_del(d,29)].
0.45/1.08	106 member(A,power_set(B)) | empty(A) | ilf_type(f2(A,B),member_type(A)).  [resolve(67,a,58,b)].
0.45/1.08	107 member(A,power_set(B)) | -empty(A).  [resolve(67,a,37,a)].
0.45/1.08	110 ilf_type(c5,subset_type(cross_product(c1,c3))).  [resolve(71,a,32,a)].
0.45/1.08	112 -ilf_type(c5,subset_type(cross_product(c2,c4))).  [ur(73,b,33,a)].
0.45/1.08	128 -subset(A,B) | subset(cross_product(A,C),cross_product(B,C)).  [resolve(81,a,39,a)].
0.45/1.08	129 -subset(A,B) | subset(cross_product(A,c3),cross_product(B,c4)).  [resolve(81,a,31,a)].
0.45/1.08	145 -ilf_type(c5,member_type(power_set(cross_product(c2,c4)))).  [ur(62,b,112,a)].
0.45/1.08	146 -member(c5,power_set(cross_product(c2,c4))).  [ur(58,a,35,a,c,145,a)].
0.45/1.08	147 -member(f2(c5,cross_product(c2,c4)),cross_product(c2,c4)).  [ur(69,b,146,a)].
0.45/1.08	184 -empty(c5).  [ur(107,a,146,a)].
0.45/1.08	185 ilf_type(c5,member_type(power_set(cross_product(c1,c3)))).  [resolve(110,a,64,b)].
0.45/1.08	187 ilf_type(f2(c5,cross_product(c2,c4)),member_type(c5)).  [resolve(106,a,146,a),unit_del(a,184)].
0.45/1.08	324 member(c5,power_set(cross_product(c1,c3))).  [resolve(185,a,60,c),unit_del(a,35)].
0.45/1.08	354 -member(A,c5) | member(A,cross_product(c1,c3)).  [resolve(324,a,79,c)].
0.45/1.08	432 member(f2(c5,cross_product(c2,c4)),c5).  [resolve(187,a,60,c),unit_del(a,184)].
0.45/1.08	439 -subset(c5,cross_product(c2,c4)).  [ur(77,a,432,a,b,147,a)].
0.45/1.08	443 member(f8(c5,cross_product(c2,c4)),c5).  [resolve(439,a,54,b)].
0.45/1.08	444 -member(f8(c5,cross_product(c2,c4)),cross_product(c2,c4)).  [ur(56,b,439,a)].
0.45/1.08	566 member(f8(c5,cross_product(c2,c4)),cross_product(c1,c3)).  [resolve(354,a,443,a)].
0.45/1.08	633 subset(cross_product(c1,A),cross_product(c2,A)).  [resolve(128,a,30,a)].
0.45/1.08	681 -member(f8(c5,cross_product(c2,c4)),cross_product(c1,c4)).  [ur(77,b,444,a,c,633,a)].
0.45/1.08	714 subset(cross_product(A,c3),cross_product(A,c4)).  [resolve(129,a,39,a)].
0.45/1.08	752 $F.  [ur(77,b,681,a,c,714,a),unit_del(a,566)].
0.45/1.08	
0.45/1.08	% SZS output end Refutation
0.45/1.08	============================== end of proof ==========================
0.45/1.08	
0.45/1.08	============================== STATISTICS ============================
0.45/1.08	
0.45/1.08	Given=164. Generated=1068. Kept=681. proofs=1.
0.45/1.08	Usable=164. Sos=505. Demods=0. Limbo=11, Disabled=60. Hints=0.
0.45/1.08	Megabytes=0.90.
0.45/1.08	User_CPU=0.07, System_CPU=0.00, Wall_clock=0.
0.45/1.08	
0.45/1.08	============================== end of statistics =====================
0.45/1.08	
0.45/1.08	============================== end of search =========================
0.45/1.08	
0.45/1.08	THEOREM PROVED
0.45/1.08	% SZS status Theorem
0.45/1.08	
0.45/1.08	Exiting with 1 proof.
0.45/1.08	
0.45/1.08	Process 23420 exit (max_proofs) Thu Aug 29 13:00:56 2019
0.45/1.08	Prover9 interrupted
0.81/1.08	EOF