TSTP Solution File: SET658+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET658+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Jul 27 13:14:00 EDT 2022
% Result : Theorem 1.66s 2.26s
% Output : Refutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 6 RR)
% Number of literals : 12 ( 0 equ; 5 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 5 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ ilf_type(A,set_type)
| ~ ilf_type(B,binary_relation_type)
| ~ subset(domain_of(B),A)
| ilf_type(B,relation_type(A,range_of(B))) ),
file('SET658+3.p',unknown),
[] ).
cnf(24,axiom,
( ~ ilf_type(A,set_type)
| subset(A,A) ),
file('SET658+3.p',unknown),
[] ).
cnf(50,axiom,
~ ilf_type(dollar_c2,relation_type(domain_of(dollar_c2),range_of(dollar_c2))),
file('SET658+3.p',unknown),
[] ).
cnf(85,axiom,
ilf_type(A,set_type),
file('SET658+3.p',unknown),
[] ).
cnf(86,axiom,
ilf_type(dollar_c2,binary_relation_type),
file('SET658+3.p',unknown),
[] ).
cnf(93,plain,
subset(A,A),
inference(hyper,[status(thm)],[85,24]),
[iquote('hyper,85,24')] ).
cnf(101,plain,
ilf_type(dollar_c2,relation_type(domain_of(dollar_c2),range_of(dollar_c2))),
inference(hyper,[status(thm)],[93,1,85,86]),
[iquote('hyper,93,1,85,86')] ).
cnf(102,plain,
$false,
inference(binary,[status(thm)],[101,50]),
[iquote('binary,101.1,50.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SET658+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 10:30:53 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.66/2.25 ----- Otter 3.3f, August 2004 -----
% 1.66/2.25 The process was started by sandbox on n020.cluster.edu,
% 1.66/2.25 Wed Jul 27 10:30:53 2022
% 1.66/2.25 The command was "./otter". The process ID is 28508.
% 1.66/2.25
% 1.66/2.25 set(prolog_style_variables).
% 1.66/2.25 set(auto).
% 1.66/2.25 dependent: set(auto1).
% 1.66/2.25 dependent: set(process_input).
% 1.66/2.25 dependent: clear(print_kept).
% 1.66/2.25 dependent: clear(print_new_demod).
% 1.66/2.25 dependent: clear(print_back_demod).
% 1.66/2.25 dependent: clear(print_back_sub).
% 1.66/2.25 dependent: set(control_memory).
% 1.66/2.25 dependent: assign(max_mem, 12000).
% 1.66/2.25 dependent: assign(pick_given_ratio, 4).
% 1.66/2.25 dependent: assign(stats_level, 1).
% 1.66/2.25 dependent: assign(max_seconds, 10800).
% 1.66/2.25 clear(print_given).
% 1.66/2.25
% 1.66/2.25 formula_list(usable).
% 1.66/2.25 all A (A=A).
% 1.66/2.25 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,binary_relation_type)-> (subset(domain_of(C),B)->ilf_type(C,relation_type(B,range_of(C))))))).
% 1.66/2.25 all B (ilf_type(B,binary_relation_type)-> (all C (ilf_type(C,set_type)-> (member(C,domain_of(B))<-> (exists D (ilf_type(D,set_type)&member(ordered_pair(C,D),B))))))).
% 1.66/2.25 all B (ilf_type(B,binary_relation_type)->ilf_type(domain_of(B),set_type)).
% 1.66/2.25 all B (ilf_type(B,binary_relation_type)-> (all C (ilf_type(C,set_type)-> (member(C,range_of(B))<-> (exists D (ilf_type(D,set_type)&member(ordered_pair(D,C),B))))))).
% 1.66/2.25 all B (ilf_type(B,binary_relation_type)->ilf_type(range_of(B),set_type)).
% 1.66/2.25 all B (ilf_type(B,set_type)-> (ilf_type(B,binary_relation_type)<->relation_like(B)&ilf_type(B,set_type))).
% 1.66/2.25 exists B ilf_type(B,binary_relation_type).
% 1.66/2.25 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)))))))).
% 1.66/2.25 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (exists D ilf_type(D,relation_type(C,B)))))).
% 1.66/2.25 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(cross_product(B,C),set_type)))).
% 1.66/2.25 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(ordered_pair(B,C),set_type)))).
% 1.66/2.25 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))))))).
% 1.66/2.25 all B (ilf_type(B,set_type)-> (exists C ilf_type(C,subset_type(B)))).
% 1.66/2.25 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)))))))).
% 1.66/2.25 all B (ilf_type(B,set_type)->subset(B,B)).
% 1.66/2.25 all B (ilf_type(B,set_type)-> (relation_like(B)<-> (all C (ilf_type(C,set_type)-> (member(C,B)-> (exists D (ilf_type(D,set_type)& (exists E (ilf_type(E,set_type)&C=ordered_pair(D,E)))))))))).
% 1.66/2.25 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)))))).
% 1.66/2.25 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)))))))).
% 1.66/2.25 all B (ilf_type(B,set_type)-> -empty(power_set(B))&ilf_type(power_set(B),set_type)).
% 1.66/2.25 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))))).
% 1.66/2.25 all B (-empty(B)&ilf_type(B,set_type)-> (exists C ilf_type(C,member_type(B)))).
% 1.66/2.25 all B (ilf_type(B,set_type)-> (empty(B)<-> (all C (ilf_type(C,set_type)-> -member(C,B))))).
% 1.66/2.25 all B (empty(B)&ilf_type(B,set_type)->relation_like(B)).
% 1.66/2.25 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)))))).
% 1.66/2.25 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))))))).
% 1.66/2.25 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (all D (ilf_type(D,relation_type(B,C))->range(B,C,D)=range_of(D)))))).
% 1.66/2.25 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))))))).
% 1.66/2.25 all B ilf_type(B,set_type).
% 1.66/2.25 -(all B (ilf_type(B,binary_relation_type)->ilf_type(B,relation_type(domain_of(B),range_of(B))))).
% 1.66/2.25 end_of_list.
% 1.66/2.25
% 1.66/2.25 -------> usable clausifies to:
% 1.66/2.25
% 1.66/2.25 list(usable).
% 1.66/2.25 0 [] A=A.
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,binary_relation_type)| -subset(domain_of(C),B)|ilf_type(C,relation_type(B,range_of(C))).
% 1.66/2.25 0 [] -ilf_type(B,binary_relation_type)| -ilf_type(C,set_type)| -member(C,domain_of(B))|ilf_type($f1(B,C),set_type).
% 1.66/2.25 0 [] -ilf_type(B,binary_relation_type)| -ilf_type(C,set_type)| -member(C,domain_of(B))|member(ordered_pair(C,$f1(B,C)),B).
% 1.66/2.25 0 [] -ilf_type(B,binary_relation_type)| -ilf_type(C,set_type)|member(C,domain_of(B))| -ilf_type(D,set_type)| -member(ordered_pair(C,D),B).
% 1.66/2.25 0 [] -ilf_type(B,binary_relation_type)|ilf_type(domain_of(B),set_type).
% 1.66/2.25 0 [] -ilf_type(B,binary_relation_type)| -ilf_type(C,set_type)| -member(C,range_of(B))|ilf_type($f2(B,C),set_type).
% 1.66/2.25 0 [] -ilf_type(B,binary_relation_type)| -ilf_type(C,set_type)| -member(C,range_of(B))|member(ordered_pair($f2(B,C),C),B).
% 1.66/2.25 0 [] -ilf_type(B,binary_relation_type)| -ilf_type(C,set_type)|member(C,range_of(B))| -ilf_type(D,set_type)| -member(ordered_pair(D,C),B).
% 1.66/2.25 0 [] -ilf_type(B,binary_relation_type)|ilf_type(range_of(B),set_type).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(B,binary_relation_type)|relation_like(B).
% 1.66/2.25 0 [] -ilf_type(B,set_type)|ilf_type(B,binary_relation_type)| -relation_like(B).
% 1.66/2.25 0 [] ilf_type($c1,binary_relation_type).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,subset_type(cross_product(B,C)))|ilf_type(D,relation_type(B,C)).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(E,relation_type(B,C))|ilf_type(E,subset_type(cross_product(B,C))).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type($f3(B,C),relation_type(C,B)).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(cross_product(B,C),set_type).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(ordered_pair(B,C),set_type).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(C,subset_type(B))|ilf_type(C,member_type(power_set(B))).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(C,subset_type(B))| -ilf_type(C,member_type(power_set(B))).
% 1.66/2.25 0 [] -ilf_type(B,set_type)|ilf_type($f4(B),subset_type(B)).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -subset(B,C)| -ilf_type(D,set_type)| -member(D,B)|member(D,C).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|subset(B,C)|ilf_type($f5(B,C),set_type).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|subset(B,C)|member($f5(B,C),B).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|subset(B,C)| -member($f5(B,C),C).
% 1.66/2.25 0 [] -ilf_type(B,set_type)|subset(B,B).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -relation_like(B)| -ilf_type(C,set_type)| -member(C,B)|ilf_type($f7(B,C),set_type).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -relation_like(B)| -ilf_type(C,set_type)| -member(C,B)|ilf_type($f6(B,C),set_type).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -relation_like(B)| -ilf_type(C,set_type)| -member(C,B)|C=ordered_pair($f7(B,C),$f6(B,C)).
% 1.66/2.25 0 [] -ilf_type(B,set_type)|relation_like(B)|ilf_type($f8(B),set_type).
% 1.66/2.25 0 [] -ilf_type(B,set_type)|relation_like(B)|member($f8(B),B).
% 1.66/2.25 0 [] -ilf_type(B,set_type)|relation_like(B)| -ilf_type(D,set_type)| -ilf_type(E,set_type)|$f8(B)!=ordered_pair(D,E).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,subset_type(cross_product(B,C)))|relation_like(D).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -member(B,power_set(C))| -ilf_type(D,set_type)| -member(D,B)|member(D,C).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))|ilf_type($f9(B,C),set_type).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))|member($f9(B,C),B).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))| -member($f9(B,C),C).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -empty(power_set(B)).
% 1.66/2.25 0 [] -ilf_type(B,set_type)|ilf_type(power_set(B),set_type).
% 1.66/2.25 0 [] -ilf_type(B,set_type)|empty(C)| -ilf_type(C,set_type)| -ilf_type(B,member_type(C))|member(B,C).
% 1.66/2.25 0 [] -ilf_type(B,set_type)|empty(C)| -ilf_type(C,set_type)|ilf_type(B,member_type(C))| -member(B,C).
% 1.66/2.25 0 [] empty(B)| -ilf_type(B,set_type)|ilf_type($f10(B),member_type(B)).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -empty(B)| -ilf_type(C,set_type)| -member(C,B).
% 1.66/2.25 0 [] -ilf_type(B,set_type)|empty(B)|ilf_type($f11(B),set_type).
% 1.66/2.25 0 [] -ilf_type(B,set_type)|empty(B)|member($f11(B),B).
% 1.66/2.25 0 [] -empty(B)| -ilf_type(B,set_type)|relation_like(B).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,relation_type(B,C))|domain(B,C,D)=domain_of(D).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,relation_type(B,C))|ilf_type(domain(B,C,D),subset_type(B)).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,relation_type(B,C))|range(B,C,D)=range_of(D).
% 1.66/2.25 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,relation_type(B,C))|ilf_type(range(B,C,D),subset_type(C)).
% 1.66/2.25 0 [] ilf_type(B,set_type).
% 1.66/2.25 0 [] ilf_type($c2,binary_relation_type).
% 1.66/2.25 0 [] -ilf_type($c2,relation_type(domain_of($c2),range_of($c2))).
% 1.66/2.25 end_of_list.
% 1.66/2.25
% 1.66/2.25 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.66/2.25
% 1.66/2.25 This ia a non-Horn set with equality. The strategy will be
% 1.66/2.25 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.66/2.25 deletion, with positive clauses in sos and nonpositive
% 1.66/2.25 clauses in usable.
% 1.66/2.25
% 1.66/2.25 dependent: set(knuth_bendix).
% 1.66/2.25 dependent: set(anl_eq).
% 1.66/2.25 dependent: set(para_from).
% 1.66/2.25 dependent: set(para_into).
% 1.66/2.26 dependent: clear(para_from_right).
% 1.66/2.26 dependent: clear(para_into_right).
% 1.66/2.26 dependent: set(para_from_vars).
% 1.66/2.26 dependent: set(eq_units_both_ways).
% 1.66/2.26 dependent: set(dynamic_demod_all).
% 1.66/2.26 dependent: set(dynamic_demod).
% 1.66/2.26 dependent: set(order_eq).
% 1.66/2.26 dependent: set(back_demod).
% 1.66/2.26 dependent: set(lrpo).
% 1.66/2.26 dependent: set(hyper_res).
% 1.66/2.26 dependent: set(unit_deletion).
% 1.66/2.26 dependent: set(factor).
% 1.66/2.26
% 1.66/2.26 ------------> process usable:
% 1.66/2.26 ** KEPT (pick-wt=16): 1 [] -ilf_type(A,set_type)| -ilf_type(B,binary_relation_type)| -subset(domain_of(B),A)|ilf_type(B,relation_type(A,range_of(B))).
% 1.66/2.26 ** KEPT (pick-wt=15): 2 [] -ilf_type(A,binary_relation_type)| -ilf_type(B,set_type)| -member(B,domain_of(A))|ilf_type($f1(A,B),set_type).
% 1.66/2.26 ** KEPT (pick-wt=17): 3 [] -ilf_type(A,binary_relation_type)| -ilf_type(B,set_type)| -member(B,domain_of(A))|member(ordered_pair(B,$f1(A,B)),A).
% 1.66/2.26 ** KEPT (pick-wt=18): 4 [] -ilf_type(A,binary_relation_type)| -ilf_type(B,set_type)|member(B,domain_of(A))| -ilf_type(C,set_type)| -member(ordered_pair(B,C),A).
% 1.66/2.26 ** KEPT (pick-wt=7): 5 [] -ilf_type(A,binary_relation_type)|ilf_type(domain_of(A),set_type).
% 1.66/2.26 ** KEPT (pick-wt=15): 6 [] -ilf_type(A,binary_relation_type)| -ilf_type(B,set_type)| -member(B,range_of(A))|ilf_type($f2(A,B),set_type).
% 1.66/2.26 ** KEPT (pick-wt=17): 7 [] -ilf_type(A,binary_relation_type)| -ilf_type(B,set_type)| -member(B,range_of(A))|member(ordered_pair($f2(A,B),B),A).
% 1.66/2.26 ** KEPT (pick-wt=18): 8 [] -ilf_type(A,binary_relation_type)| -ilf_type(B,set_type)|member(B,range_of(A))| -ilf_type(C,set_type)| -member(ordered_pair(C,B),A).
% 1.66/2.26 ** KEPT (pick-wt=7): 9 [] -ilf_type(A,binary_relation_type)|ilf_type(range_of(A),set_type).
% 1.66/2.26 ** KEPT (pick-wt=8): 10 [] -ilf_type(A,set_type)| -ilf_type(A,binary_relation_type)|relation_like(A).
% 1.66/2.26 ** KEPT (pick-wt=8): 11 [] -ilf_type(A,set_type)|ilf_type(A,binary_relation_type)| -relation_like(A).
% 1.66/2.26 ** KEPT (pick-wt=17): 12 [] -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)).
% 1.66/2.26 ** KEPT (pick-wt=17): 13 [] -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))).
% 1.66/2.26 ** KEPT (pick-wt=13): 14 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type($f3(A,B),relation_type(B,A)).
% 1.66/2.26 ** KEPT (pick-wt=11): 15 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(cross_product(A,B),set_type).
% 1.66/2.26 ** KEPT (pick-wt=11): 16 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(ordered_pair(A,B),set_type).
% 1.66/2.26 ** KEPT (pick-wt=15): 17 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(B,subset_type(A))|ilf_type(B,member_type(power_set(A))).
% 1.66/2.26 ** KEPT (pick-wt=15): 18 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(B,subset_type(A))| -ilf_type(B,member_type(power_set(A))).
% 1.66/2.26 ** KEPT (pick-wt=8): 19 [] -ilf_type(A,set_type)|ilf_type($f4(A),subset_type(A)).
% 1.66/2.26 ** KEPT (pick-wt=18): 20 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -subset(A,B)| -ilf_type(C,set_type)| -member(C,A)|member(C,B).
% 1.66/2.26 ** KEPT (pick-wt=14): 21 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|subset(A,B)|ilf_type($f5(A,B),set_type).
% 1.66/2.26 ** KEPT (pick-wt=14): 22 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|subset(A,B)|member($f5(A,B),A).
% 1.66/2.26 ** KEPT (pick-wt=14): 23 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|subset(A,B)| -member($f5(A,B),B).
% 1.66/2.26 ** KEPT (pick-wt=6): 24 [] -ilf_type(A,set_type)|subset(A,A).
% 1.66/2.26 ** KEPT (pick-wt=16): 25 [] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ilf_type($f7(A,B),set_type).
% 1.66/2.26 ** KEPT (pick-wt=16): 26 [] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ilf_type($f6(A,B),set_type).
% 1.66/2.26 ** KEPT (pick-wt=20): 28 [copy,27,flip.5] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ordered_pair($f7(A,B),$f6(A,B))=B.
% 1.66/2.26 ** KEPT (pick-wt=9): 29 [] -ilf_type(A,set_type)|relation_like(A)|ilf_type($f8(A),set_type).
% 1.66/2.26 ** KEPT (pick-wt=9): 30 [] -ilf_type(A,set_type)|relation_like(A)|member($f8(A),A).
% 1.66/2.26 ** KEPT (pick-wt=17): 31 [] -ilf_type(A,set_type)|relation_like(A)| -ilf_type(B,set_type)| -ilf_type(C,set_type)|$f8(A)!=ordered_pair(B,C).
% 1.66/2.26 ** KEPT (pick-wt=14): 32 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,subset_type(cross_product(A,B)))|relation_like(C).
% 1.66/2.26 ** KEPT (pick-wt=19): 33 [] -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).
% 1.66/2.26 ** KEPT (pick-wt=15): 34 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))|ilf_type($f9(A,B),set_type).
% 1.66/2.26 ** KEPT (pick-wt=15): 35 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))|member($f9(A,B),A).
% 1.66/2.26 ** KEPT (pick-wt=15): 36 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))| -member($f9(A,B),B).
% 1.66/2.26 ** KEPT (pick-wt=6): 37 [] -ilf_type(A,set_type)| -empty(power_set(A)).
% 1.66/2.26 ** KEPT (pick-wt=7): 38 [] -ilf_type(A,set_type)|ilf_type(power_set(A),set_type).
% 1.66/2.26 ** KEPT (pick-wt=15): 39 [] -ilf_type(A,set_type)|empty(B)| -ilf_type(B,set_type)| -ilf_type(A,member_type(B))|member(A,B).
% 1.66/2.26 ** KEPT (pick-wt=15): 40 [] -ilf_type(A,set_type)|empty(B)| -ilf_type(B,set_type)|ilf_type(A,member_type(B))| -member(A,B).
% 1.66/2.26 ** KEPT (pick-wt=10): 41 [] empty(A)| -ilf_type(A,set_type)|ilf_type($f10(A),member_type(A)).
% 1.66/2.26 ** KEPT (pick-wt=11): 42 [] -ilf_type(A,set_type)| -empty(A)| -ilf_type(B,set_type)| -member(B,A).
% 1.66/2.26 ** KEPT (pick-wt=9): 43 [] -ilf_type(A,set_type)|empty(A)|ilf_type($f11(A),set_type).
% 1.66/2.26 ** KEPT (pick-wt=9): 44 [] -ilf_type(A,set_type)|empty(A)|member($f11(A),A).
% 1.66/2.26 ** KEPT (pick-wt=7): 45 [] -empty(A)| -ilf_type(A,set_type)|relation_like(A).
% 1.66/2.26 ** KEPT (pick-wt=18): 46 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,relation_type(A,B))|domain(A,B,C)=domain_of(C).
% 1.66/2.26 ** KEPT (pick-wt=18): 47 [] -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)).
% 1.66/2.26 ** KEPT (pick-wt=18): 48 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,relation_type(A,B))|range(A,B,C)=range_of(C).
% 1.66/2.26 ** KEPT (pick-wt=18): 49 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,relation_type(A,B))|ilf_type(range(A,B,C),subset_type(B)).
% 1.66/2.26 ** KEPT (pick-wt=7): 50 [] -ilf_type($c2,relation_type(domain_of($c2),range_of($c2))).
% 1.66/2.26
% 1.66/2.26 ------------> process sos:
% 1.66/2.26 ** KEPT (pick-wt=3): 83 [] A=A.
% 1.66/2.26 ** KEPT (pick-wt=3): 84 [] ilf_type($c1,binary_relation_type).
% 1.66/2.26 ** KEPT (pick-wt=3): 85 [] ilf_type(A,set_type).
% 1.66/2.26 ** KEPT (pick-wt=3): 86 [] ilf_type($c2,binary_relation_type).
% 1.66/2.26 Following clause subsumed by 83 during input processing: 0 [copy,83,flip.1] A=A.
% 1.66/2.26 85 back subsumes 72.
% 1.66/2.26 85 back subsumes 63.
% 1.66/2.26 85 back subsumes 62.
% 1.66/2.26 85 back subsumes 57.
% 1.66/2.26 85 back subsumes 56.
% 1.66/2.26 85 back subsumes 43.
% 1.66/2.26 85 back subsumes 38.
% 1.66/2.26 85 back subsumes 34.
% 1.66/2.26 85 back subsumes 29.
% 1.66/2.26 85 back subsumes 26.
% 1.66/2.26 85 back subsumes 25.
% 1.66/2.26 85 back subsumes 21.
% 1.66/2.26 85 back subsumes 16.
% 1.66/2.26 85 back subsumes 15.
% 1.66/2.26 85 back subsumes 9.
% 1.66/2.26 85 back subsumes 6.
% 1.66/2.26 85 back subsumes 5.
% 1.66/2.26 85 back subsumes 2.
% 1.66/2.26
% 1.66/2.26 ======= end of input processing =======
% 1.66/2.26
% 1.66/2.26 =========== start of search ===========
% 1.66/2.26
% 1.66/2.26 -------- PROOF --------
% 1.66/2.26
% 1.66/2.26 ----> UNIT CONFLICT at 0.01 sec ----> 102 [binary,101.1,50.1] $F.
% 1.66/2.26
% 1.66/2.26 Length of proof is 2. Level of proof is 2.
% 1.66/2.26
% 1.66/2.26 ---------------- PROOF ----------------
% 1.66/2.26 % SZS status Theorem
% 1.66/2.26 % SZS output start Refutation
% See solution above
% 1.66/2.26 ------------ end of proof -------------
% 1.66/2.26
% 1.66/2.26
% 1.66/2.26 Search stopped by max_proofs option.
% 1.66/2.26
% 1.66/2.26
% 1.66/2.26 Search stopped by max_proofs option.
% 1.66/2.26
% 1.66/2.26 ============ end of search ============
% 1.66/2.26
% 1.66/2.26 -------------- statistics -------------
% 1.66/2.26 clauses given 8
% 1.66/2.26 clauses generated 64
% 1.66/2.26 clauses kept 100
% 1.66/2.26 clauses forward subsumed 12
% 1.66/2.26 clauses back subsumed 30
% 1.66/2.26 Kbytes malloced 1953
% 1.66/2.26
% 1.66/2.26 ----------- times (seconds) -----------
% 1.66/2.26 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.66/2.26 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/2.26 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.66/2.26
% 1.66/2.26 That finishes the proof of the theorem.
% 1.66/2.26
% 1.66/2.26 Process 28508 finished Wed Jul 27 10:30:55 2022
% 1.66/2.26 Otter interrupted
% 1.66/2.26 PROOF FOUND
%------------------------------------------------------------------------------