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