0.05/0.10	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.05/0.11	% Command  : tptp2X_and_run_prover9 %d %s
0.09/0.31	% Computer : n010.cluster.edu
0.09/0.31	% Model    : x86_64 x86_64
0.09/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.31	% Memory   : 8042.1875MB
0.09/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.09/0.31	% CPULimit : 1440
0.09/0.31	% WCLimit  : 180
0.09/0.31	% DateTime : Mon Jul  3 07:45:54 EDT 2023
0.09/0.32	% CPUTime  : 
0.34/1.07	============================== Prover9 ===============================
0.34/1.07	Prover9 (32) version 2009-11A, November 2009.
0.34/1.07	Process 28836 was started by sandbox2 on n010.cluster.edu,
0.34/1.07	Mon Jul  3 07:45:55 2023
0.34/1.07	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_28593_n010.cluster.edu".
0.34/1.07	============================== end of head ===========================
0.34/1.07	
0.34/1.07	============================== INPUT =================================
0.34/1.07	
0.34/1.07	% Reading from file /tmp/Prover9_28593_n010.cluster.edu
0.34/1.07	
0.34/1.07	set(prolog_style_variables).
0.34/1.07	set(auto2).
0.34/1.07	    % set(auto2) -> set(auto).
0.34/1.07	    % set(auto) -> set(auto_inference).
0.34/1.07	    % set(auto) -> set(auto_setup).
0.34/1.07	    % set(auto_setup) -> set(predicate_elim).
0.34/1.07	    % set(auto_setup) -> assign(eq_defs, unfold).
0.34/1.07	    % set(auto) -> set(auto_limits).
0.34/1.07	    % set(auto_limits) -> assign(max_weight, "100.000").
0.34/1.07	    % set(auto_limits) -> assign(sos_limit, 20000).
0.34/1.07	    % set(auto) -> set(auto_denials).
0.34/1.07	    % set(auto) -> set(auto_process).
0.34/1.07	    % set(auto2) -> assign(new_constants, 1).
0.34/1.07	    % set(auto2) -> assign(fold_denial_max, 3).
0.34/1.07	    % set(auto2) -> assign(max_weight, "200.000").
0.34/1.07	    % set(auto2) -> assign(max_hours, 1).
0.34/1.07	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.34/1.07	    % set(auto2) -> assign(max_seconds, 0).
0.34/1.07	    % set(auto2) -> assign(max_minutes, 5).
0.34/1.07	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.34/1.07	    % set(auto2) -> set(sort_initial_sos).
0.34/1.07	    % set(auto2) -> assign(sos_limit, -1).
0.34/1.07	    % set(auto2) -> assign(lrs_ticks, 3000).
0.34/1.07	    % set(auto2) -> assign(max_megs, 400).
0.34/1.07	    % set(auto2) -> assign(stats, some).
0.34/1.07	    % set(auto2) -> clear(echo_input).
0.34/1.07	    % set(auto2) -> set(quiet).
0.34/1.07	    % set(auto2) -> clear(print_initial_clauses).
0.34/1.07	    % set(auto2) -> clear(print_given).
0.34/1.07	assign(lrs_ticks,-1).
0.34/1.07	assign(sos_limit,10000).
0.34/1.07	assign(order,kbo).
0.34/1.07	set(lex_order_vars).
0.34/1.07	clear(print_given).
0.34/1.07	
0.34/1.07	% formulas(sos).  % not echoed (26 formulas)
0.34/1.07	
0.34/1.07	============================== end of input ==========================
0.34/1.07	
0.34/1.07	% From the command line: assign(max_seconds, 1440).
0.34/1.07	
0.34/1.07	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.34/1.07	
0.34/1.07	% Formulas that are not ordinary clauses:
0.34/1.07	1 (all B (ilf_type(B,set_type) -> ilf_type(power_set(B),set_type) & -empty(power_set(B)))) # label(p18) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	2 (all B ilf_type(B,set_type)) # label(p25) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	3 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ilf_type(cross_product(B,C),set_type))))) # label(p9) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	4 (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,set_type) -> (F = ordered_pair(D,E) <-> unordered_pair(unordered_pair(D,E),singleton(D)) = F))))))))))) # label(p7) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	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(p4) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	6 (all B (ilf_type(B,set_type) -> subset(B,B))) # label(p16) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	7 (all B (ilf_type(B,set_type) -> (relation_like(B) <-> (all C (ilf_type(C,set_type) -> (member(C,B) -> (exists D ((exists E (C = ordered_pair(D,E) & ilf_type(E,set_type))) & ilf_type(D,set_type))))))))) # label(p22) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	8 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ilf_type(unordered_pair(B,C),set_type))))) # label(p10) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	9 (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(p17) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	10 (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(p3) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	11 (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) -> (E = C <-> member(E,D)))) <-> singleton(C) = D))))))) # label(p5) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	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.34/1.07	13 (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(p19) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	14 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ilf_type(ordered_pair(B,C),set_type))))) # label(p8) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	15 (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(p15) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	16 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (C = B <-> (all D (ilf_type(D,set_type) -> (member(D,B) <-> member(D,C))))))))) # label(p14) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	17 (all B (ilf_type(B,set_type) -> (exists C ilf_type(C,subset_type(B))))) # label(p13) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	18 (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(p24) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	19 (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) -> (member(ordered_pair(B,C),cross_product(D,E)) <-> member(B,D) & member(C,E)))))))))) # label(p2) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	20 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (subset(singleton(B),C) <-> member(B,C)))))) # label(p1) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	21 (all B (ilf_type(B,set_type) & empty(B) -> relation_like(B))) # label(p23) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	22 (all B (-empty(B) & ilf_type(B,set_type) -> (exists C ilf_type(C,member_type(B))))) # label(p20) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	23 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> unordered_pair(C,B) = unordered_pair(B,C))))) # label(p11) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	24 (all B (ilf_type(B,set_type) -> ((all C (ilf_type(C,set_type) -> -member(C,B))) <-> empty(B)))) # label(p21) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	25 (all B (ilf_type(B,set_type) -> ilf_type(singleton(B),set_type))) # label(p6) # label(axiom) # label(non_clause).  [assumption].
0.34/1.07	26 -(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) -> (member(D,B) & member(E,C) -> ilf_type(singleton(ordered_pair(D,E)),relation_type(B,C))))))))))) # label(prove_relset_1_8) # label(negated_conjecture) # label(non_clause).  [assumption].
0.34/1.07	
0.34/1.07	============================== end of process non-clausal formulas ===
0.34/1.07	
0.34/1.07	============================== PROCESS INITIAL CLAUSES ===============
0.34/1.07	
0.34/1.07	============================== PREDICATE ELIMINATION =================
0.34/1.07	27 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f3(A,B),set_type) # label(p22) # label(axiom).  [clausify(7)].
0.34/1.07	28 -ilf_type(A,set_type) | -empty(A) | relation_like(A) # label(p23) # label(axiom).  [clausify(21)].
0.34/1.07	29 -ilf_type(A,set_type) | relation_like(A) | ilf_type(f4(A),set_type) # label(p22) # label(axiom).  [clausify(7)].
0.34/1.07	30 -ilf_type(A,set_type) | relation_like(A) | member(f4(A),A) # label(p22) # label(axiom).  [clausify(7)].
0.34/1.07	31 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,subset_type(cross_product(A,B))) | relation_like(C) # label(p24) # label(axiom).  [clausify(18)].
0.34/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(A,set_type) | -empty(A).  [resolve(27,b,28,c)].
1.38/1.75	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(f4(A),set_type).  [resolve(27,b,29,b)].
1.38/1.75	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(f4(A),A).  [resolve(27,b,30,b)].
1.38/1.75	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(27,b,31,d)].
1.38/1.75	32 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f2(A,B),set_type) # label(p22) # label(axiom).  [clausify(7)].
1.38/1.75	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f2(A,B),set_type) | -ilf_type(A,set_type) | -empty(A).  [resolve(32,b,28,c)].
1.38/1.75	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f2(A,B),set_type) | -ilf_type(A,set_type) | ilf_type(f4(A),set_type).  [resolve(32,b,29,b)].
1.38/1.75	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f2(A,B),set_type) | -ilf_type(A,set_type) | member(f4(A),A).  [resolve(32,b,30,b)].
1.38/1.75	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f2(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,b,31,d)].
1.38/1.75	33 -ilf_type(A,set_type) | relation_like(A) | ordered_pair(B,C) != f4(A) | -ilf_type(C,set_type) | -ilf_type(B,set_type) # label(p22) # label(axiom).  [clausify(7)].
1.38/1.75	Derived: -ilf_type(A,set_type) | ordered_pair(B,C) != f4(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(f3(A,D),set_type).  [resolve(33,b,27,b)].
1.38/1.75	Derived: -ilf_type(A,set_type) | ordered_pair(B,C) != f4(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(f2(A,D),set_type).  [resolve(33,b,32,b)].
1.38/1.76	34 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f2(A,B),f3(A,B)) = B # label(p22) # label(axiom).  [clausify(7)].
1.38/1.76	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f2(A,B),f3(A,B)) = B | -ilf_type(A,set_type) | -empty(A).  [resolve(34,b,28,c)].
1.38/1.76	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f2(A,B),f3(A,B)) = B | -ilf_type(A,set_type) | ilf_type(f4(A),set_type).  [resolve(34,b,29,b)].
1.38/1.76	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f2(A,B),f3(A,B)) = B | -ilf_type(A,set_type) | member(f4(A),A).  [resolve(34,b,30,b)].
1.38/1.76	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f2(A,B),f3(A,B)) = B | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -ilf_type(A,subset_type(cross_product(C,D))).  [resolve(34,b,31,d)].
1.38/1.76	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f2(A,B),f3(A,B)) = B | -ilf_type(A,set_type) | ordered_pair(C,D) != f4(A) | -ilf_type(D,set_type) | -ilf_type(C,set_type).  [resolve(34,b,33,b)].
1.38/1.76	
1.38/1.76	============================== end predicate elimination =============
1.38/1.76	
1.38/1.76	Auto_denials:  (non-Horn, no changes).
1.38/1.76	
1.38/1.76	Term ordering decisions:
1.38/1.76	Function symbol KB weights:  set_type=1. c1=1. c2=1. c3=1. c4=1. ordered_pair=1. cross_product=1. unordered_pair=1. relation_type=1. f1=1. f2=1. f3=1. f5=1. f7=1. f8=1. singleton=1. subset_type=1. power_set=1. member_type=1. f4=1. f9=1. f10=1. f11=1. f6=1.
1.38/1.76	
1.38/1.76	============================== end of process initial clauses ========
1.38/1.76	
1.38/1.76	============================== CLAUSES FOR SEARCH ====================
1.38/1.76	
1.38/1.76	============================== end of clauses for search =============
1.38/1.76	
1.38/1.76	============================== SEARCH ================================
1.38/1.76	
1.38/1.76	% Starting search at 0.02 seconds.
1.38/1.76	
1.38/1.76	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 868 (0.00 of 0.35 sec).
1.38/1.76	
1.38/1.76	Low Water (keep): wt=37.000, iters=3333
1.94/2.25	
1.94/2.25	Low Water (keep): wt=36.000, iters=3373
1.94/2.25	
1.94/2.25	Low Water (keep): wt=32.000, iters=3397
1.94/2.25	
1.94/2.25	Low Water (keep): wt=28.000, iters=3350
1.94/2.25	
1.94/2.25	Low Water (keep): wt=27.000, iters=3388
1.94/2.25	
1.94/2.25	Low Water (keep): wt=26.000, iters=3417
1.94/2.25	
1.94/2.25	Low Water (keep): wt=25.000, iters=3368
1.94/2.25	
1.94/2.25	Low Water (keep): wt=24.000, iters=3435
1.94/2.25	
1.94/2.25	Low Water (keep): wt=23.000, iters=3487
1.94/2.25	
1.94/2.25	Low Water (keep): wt=22.000, iters=3476
1.94/2.25	
1.94/2.25	Low Water (keep): wt=21.000, iters=3354
1.94/2.25	
1.94/2.25	Low Water (keep): wt=20.000, iters=3341
1.94/2.25	
1.94/2.25	Low Water (keep): wt=19.000, iters=3340
1.94/2.25	
1.94/2.25	Low Water (keep): wt=18.000, iters=3377
1.94/2.25	
1.94/2.25	Low Water (keep): wt=17.000, iters=3348
1.94/2.25	
1.94/2.25	============================== PROOF =================================
1.94/2.25	% SZS status Theorem
1.94/2.25	% SZS output start Refutation
1.94/2.25	
1.94/2.25	% Proof 1 at 1.15 (+ 0.04) seconds.
1.94/2.25	% Length of proof is 51.
1.94/2.25	% Level of proof is 9.
1.94/2.25	% Maximum clause weight is 18.000.
1.94/2.25	% Given clauses 1043.
1.94/2.25	
1.94/2.25	1 (all B (ilf_type(B,set_type) -> ilf_type(power_set(B),set_type) & -empty(power_set(B)))) # label(p18) # label(axiom) # label(non_clause).  [assumption].
1.94/2.25	2 (all B ilf_type(B,set_type)) # label(p25) # label(axiom) # label(non_clause).  [assumption].
1.94/2.25	6 (all B (ilf_type(B,set_type) -> subset(B,B))) # label(p16) # label(axiom) # label(non_clause).  [assumption].
1.94/2.25	9 (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(p17) # label(axiom) # label(non_clause).  [assumption].
1.94/2.25	10 (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(p3) # label(axiom) # label(non_clause).  [assumption].
1.94/2.25	11 (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) -> (E = C <-> member(E,D)))) <-> singleton(C) = D))))))) # label(p5) # label(axiom) # label(non_clause).  [assumption].
1.94/2.25	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].
1.94/2.25	13 (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(p19) # label(axiom) # label(non_clause).  [assumption].
1.94/2.25	19 (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) -> (member(ordered_pair(B,C),cross_product(D,E)) <-> member(B,D) & member(C,E)))))))))) # label(p2) # label(axiom) # label(non_clause).  [assumption].
1.94/2.25	20 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (subset(singleton(B),C) <-> member(B,C)))))) # label(p1) # label(axiom) # label(non_clause).  [assumption].
1.94/2.25	26 -(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) -> (member(D,B) & member(E,C) -> ilf_type(singleton(ordered_pair(D,E)),relation_type(B,C))))))))))) # label(prove_relset_1_8) # label(negated_conjecture) # label(non_clause).  [assumption].
1.94/2.25	35 ilf_type(A,set_type) # label(p25) # label(axiom).  [clausify(2)].
1.94/2.25	36 member(c3,c1) # label(prove_relset_1_8) # label(negated_conjecture).  [clausify(26)].
1.94/2.25	37 member(c4,c2) # label(prove_relset_1_8) # label(negated_conjecture).  [clausify(26)].
1.94/2.25	38 -ilf_type(A,set_type) | -empty(power_set(A)) # label(p18) # label(axiom).  [clausify(1)].
1.94/2.25	39 -empty(power_set(A)).  [copy(38),unit_del(a,35)].
1.94/2.25	40 -ilf_type(singleton(ordered_pair(c3,c4)),relation_type(c1,c2)) # label(prove_relset_1_8) # label(negated_conjecture).  [clausify(26)].
1.94/2.25	43 -ilf_type(A,set_type) | subset(A,A) # label(p16) # label(axiom).  [clausify(6)].
1.94/2.25	44 subset(A,A).  [copy(43),unit_del(a,35)].
1.94/2.25	59 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -subset(singleton(A),B) | member(A,B) # label(p1) # label(axiom).  [clausify(20)].
1.94/2.25	60 -subset(singleton(A),B) | member(A,B).  [copy(59),unit_del(a,35),unit_del(b,35)].
1.94/2.25	72 -ilf_type(A,set_type) | -ilf_type(B,set_type) | member(f5(A,B),A) | member(A,power_set(B)) # label(p17) # label(axiom).  [clausify(9)].
1.94/2.25	73 member(f5(A,B),A) | member(A,power_set(B)).  [copy(72),unit_del(a,35),unit_del(b,35)].
1.94/2.25	74 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(f5(A,B),B) | member(A,power_set(B)) # label(p17) # label(axiom).  [clausify(9)].
1.94/2.25	75 -member(f5(A,B),B) | member(A,power_set(B)).  [copy(74),unit_del(a,35),unit_del(b,35)].
1.94/2.25	78 -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)].
1.94/2.25	79 ilf_type(A,subset_type(B)) | -ilf_type(A,member_type(power_set(B))).  [copy(78),unit_del(a,35),unit_del(b,35)].
1.94/2.25	80 -ilf_type(A,set_type) | empty(B) | -ilf_type(B,set_type) | -member(A,B) | ilf_type(A,member_type(B)) # label(p19) # label(axiom).  [clausify(13)].
1.94/2.25	81 empty(A) | -member(B,A) | ilf_type(B,member_type(A)).  [copy(80),unit_del(a,35),unit_del(c,35)].
1.94/2.25	84 -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(10)].
1.94/2.25	85 -ilf_type(A,subset_type(cross_product(B,C))) | ilf_type(A,relation_type(B,C)).  [copy(84),unit_del(a,35),unit_del(b,35)].
1.94/2.25	94 -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(p17) # label(axiom).  [clausify(9)].
1.94/2.25	95 -member(A,B) | member(A,C) | -member(B,power_set(C)).  [copy(94),unit_del(a,35),unit_del(b,35),unit_del(c,35)].
1.94/2.25	103 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | D = B | -member(D,C) | singleton(B) != C # label(p5) # label(axiom).  [clausify(11)].
1.94/2.25	104 A = B | -member(A,C) | singleton(B) != C.  [copy(103),unit_del(a,35),unit_del(b,35),unit_del(c,35),unit_del(d,35)].
1.94/2.25	113 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | member(ordered_pair(A,B),cross_product(C,D)) | -member(A,C) | -member(B,D) # label(p2) # label(axiom).  [clausify(19)].
1.94/2.25	114 member(ordered_pair(A,B),cross_product(C,D)) | -member(A,C) | -member(B,D).  [copy(113),unit_del(a,35),unit_del(b,35),unit_del(c,35),unit_del(d,35)].
1.94/2.25	142 member(A,singleton(A)).  [resolve(60,a,44,a)].
1.94/2.25	158 -ilf_type(singleton(ordered_pair(c3,c4)),subset_type(cross_product(c1,c2))).  [ur(85,b,40,a)].
1.94/2.25	199 f5(A,B) = C | singleton(C) != A | member(A,power_set(B)).  [resolve(104,b,73,a)].
1.94/2.25	217 member(ordered_pair(c3,A),cross_product(c1,B)) | -member(A,B).  [resolve(114,b,36,a)].
1.94/2.25	254 -ilf_type(singleton(ordered_pair(c3,c4)),member_type(power_set(cross_product(c1,c2)))).  [ur(79,a,158,a)].
1.94/2.25	255 -member(singleton(ordered_pair(c3,c4)),power_set(cross_product(c1,c2))).  [ur(81,a,39,a,c,254,a)].
1.94/2.25	271 -member(singleton(singleton(ordered_pair(c3,c4))),power_set(power_set(cross_product(c1,c2)))).  [ur(95,a,142,a,b,255,a)].
1.94/2.25	324 -member(f5(singleton(singleton(ordered_pair(c3,c4))),power_set(cross_product(c1,c2))),power_set(cross_product(c1,c2))).  [ur(75,b,271,a)].
1.94/2.25	2494 f5(singleton(A),B) = A | member(singleton(A),power_set(B)).  [xx_res(199,b)].
1.94/2.25	2855 member(ordered_pair(c3,c4),cross_product(c1,c2)).  [resolve(217,b,37,a)].
1.94/2.25	10322 -member(f5(f5(singleton(singleton(ordered_pair(c3,c4))),power_set(cross_product(c1,c2))),cross_product(c1,c2)),cross_product(c1,c2)).  [ur(75,b,324,a)].
1.94/2.25	10711 f5(singleton(singleton(ordered_pair(c3,c4))),power_set(cross_product(c1,c2))) = singleton(ordered_pair(c3,c4)).  [resolve(2494,b,271,a)].
1.94/2.25	10714 f5(singleton(ordered_pair(c3,c4)),cross_product(c1,c2)) = ordered_pair(c3,c4).  [resolve(2494,b,255,a)].
1.94/2.25	10727 $F.  [back_rewrite(10322),rewrite([10711(10),10714(8)]),unit_del(a,2855)].
1.94/2.25	
1.94/2.25	% SZS output end Refutation
1.94/2.25	============================== end of proof ==========================
1.94/2.25	
1.94/2.25	============================== STATISTICS ============================
1.94/2.25	
1.94/2.25	Given=1043. Generated=23080. Kept=10632. proofs=1.
1.94/2.25	Usable=925. Sos=8087. Demods=120. Limbo=16, Disabled=1680. Hints=0.
1.94/2.25	Megabytes=10.88.
1.94/2.25	User_CPU=1.16, System_CPU=0.04, Wall_clock=1.
1.94/2.25	
1.94/2.25	============================== end of statistics =====================
1.94/2.25	
1.94/2.25	============================== end of search =========================
1.94/2.25	
1.94/2.25	THEOREM PROVED
1.94/2.25	% SZS status Theorem
1.94/2.25	
1.94/2.25	Exiting with 1 proof.
1.94/2.25	
1.94/2.25	Process 28836 exit (max_proofs) Mon Jul  3 07:45:56 2023
1.94/2.25	Prover9 interrupted
1.94/2.25	EOF