TSTP Solution File: SET676+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET676+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n004.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:03 EDT 2022
% Result : Theorem 1.74s 1.91s
% Output : Refutation 1.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 4 RR)
% Number of literals : 12 ( 0 equ; 6 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 8 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ ilf_type(A,set_type)
| ~ ilf_type(B,set_type)
| ilf_type(cross_product(A,B),relation_type(A,B)) ),
file('SET676+3.p',unknown),
[] ).
cnf(11,axiom,
( ~ ilf_type(A,set_type)
| ~ ilf_type(B,set_type)
| ilf_type(B,identity_relation_of_type(A))
| ~ ilf_type(B,relation_type(A,A)) ),
file('SET676+3.p',unknown),
[] ).
cnf(41,axiom,
~ ilf_type(cross_product(dollar_c1,dollar_c1),identity_relation_of_type(dollar_c1)),
file('SET676+3.p',unknown),
[] ).
cnf(141,axiom,
ilf_type(A,set_type),
file('SET676+3.p',unknown),
[] ).
cnf(152,plain,
ilf_type(cross_product(A,B),relation_type(A,B)),
inference(hyper,[status(thm)],[141,1,141]),
[iquote('hyper,141,1,141')] ).
cnf(174,plain,
ilf_type(cross_product(A,A),identity_relation_of_type(A)),
inference(hyper,[status(thm)],[152,11,141,141]),
[iquote('hyper,152,11,141,141')] ).
cnf(175,plain,
$false,
inference(binary,[status(thm)],[174,41]),
[iquote('binary,174.1,41.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET676+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n004.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:35:21 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.66/1.86 ----- Otter 3.3f, August 2004 -----
% 1.66/1.86 The process was started by sandbox2 on n004.cluster.edu,
% 1.66/1.86 Wed Jul 27 10:35:21 2022
% 1.66/1.86 The command was "./otter". The process ID is 14101.
% 1.66/1.86
% 1.66/1.86 set(prolog_style_variables).
% 1.66/1.86 set(auto).
% 1.66/1.86 dependent: set(auto1).
% 1.66/1.86 dependent: set(process_input).
% 1.66/1.86 dependent: clear(print_kept).
% 1.66/1.86 dependent: clear(print_new_demod).
% 1.66/1.86 dependent: clear(print_back_demod).
% 1.66/1.86 dependent: clear(print_back_sub).
% 1.66/1.86 dependent: set(control_memory).
% 1.66/1.86 dependent: assign(max_mem, 12000).
% 1.66/1.86 dependent: assign(pick_given_ratio, 4).
% 1.66/1.86 dependent: assign(stats_level, 1).
% 1.66/1.86 dependent: assign(max_seconds, 10800).
% 1.66/1.86 clear(print_given).
% 1.66/1.86
% 1.66/1.86 formula_list(usable).
% 1.66/1.86 all A (A=A).
% 1.66/1.86 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(cross_product(B,C),relation_type(B,C))))).
% 1.66/1.86 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (all D (ilf_type(D,set_type)-> (member(D,cross_product(B,C))<-> (exists E (ilf_type(E,set_type)& (exists F (ilf_type(F,set_type)&member(E,B)&member(F,C)&D=ordered_pair(E,F))))))))))).
% 1.66/1.86 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(cross_product(B,C),set_type)))).
% 1.66/1.86 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (ilf_type(C,identity_relation_of_type(B))<->ilf_type(C,relation_type(B,B)))))).
% 1.66/1.86 all B (ilf_type(B,set_type)-> (exists C ilf_type(C,identity_relation_of_type(B)))).
% 1.66/1.86 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(ordered_pair(B,C),set_type)))).
% 1.66/1.86 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/1.86 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/1.86 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/1.86 all B (ilf_type(B,set_type)-> (exists C ilf_type(C,subset_type(B)))).
% 1.66/1.86 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/1.86 all B (ilf_type(B,set_type)-> -empty(power_set(B))&ilf_type(power_set(B),set_type)).
% 1.66/1.86 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/1.86 all B (-empty(B)&ilf_type(B,set_type)-> (exists C ilf_type(C,member_type(B)))).
% 1.66/1.86 all B (ilf_type(B,set_type)-> (empty(B)<-> (all C (ilf_type(C,set_type)-> -member(C,B))))).
% 1.66/1.86 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/1.86 all B (empty(B)&ilf_type(B,set_type)->relation_like(B)).
% 1.66/1.86 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/1.86 all B ilf_type(B,set_type).
% 1.66/1.86 -(all B (ilf_type(B,set_type)->ilf_type(cross_product(B,B),identity_relation_of_type(B)))).
% 1.66/1.86 end_of_list.
% 1.66/1.86
% 1.66/1.86 -------> usable clausifies to:
% 1.66/1.86
% 1.66/1.86 list(usable).
% 1.66/1.86 0 [] A=A.
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(cross_product(B,C),relation_type(B,C)).
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -member(D,cross_product(B,C))|ilf_type($f2(B,C,D),set_type).
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -member(D,cross_product(B,C))|ilf_type($f1(B,C,D),set_type).
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -member(D,cross_product(B,C))|member($f2(B,C,D),B).
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -member(D,cross_product(B,C))|member($f1(B,C,D),C).
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -member(D,cross_product(B,C))|D=ordered_pair($f2(B,C,D),$f1(B,C,D)).
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)|member(D,cross_product(B,C))| -ilf_type(E,set_type)| -ilf_type(F,set_type)| -member(E,B)| -member(F,C)|D!=ordered_pair(E,F).
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(cross_product(B,C),set_type).
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(C,identity_relation_of_type(B))|ilf_type(C,relation_type(B,B)).
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(C,identity_relation_of_type(B))| -ilf_type(C,relation_type(B,B)).
% 1.66/1.86 0 [] -ilf_type(B,set_type)|ilf_type($f3(B),identity_relation_of_type(B)).
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(ordered_pair(B,C),set_type).
% 1.66/1.86 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/1.86 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/1.86 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type($f4(B,C),relation_type(C,B)).
% 1.66/1.86 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/1.86 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/1.86 0 [] -ilf_type(B,set_type)|ilf_type($f5(B),subset_type(B)).
% 1.66/1.86 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/1.86 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))|ilf_type($f6(B,C),set_type).
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))|member($f6(B,C),B).
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))| -member($f6(B,C),C).
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -empty(power_set(B)).
% 1.66/1.86 0 [] -ilf_type(B,set_type)|ilf_type(power_set(B),set_type).
% 1.66/1.86 0 [] -ilf_type(B,set_type)|empty(C)| -ilf_type(C,set_type)| -ilf_type(B,member_type(C))|member(B,C).
% 1.66/1.86 0 [] -ilf_type(B,set_type)|empty(C)| -ilf_type(C,set_type)|ilf_type(B,member_type(C))| -member(B,C).
% 1.66/1.86 0 [] empty(B)| -ilf_type(B,set_type)|ilf_type($f7(B),member_type(B)).
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -empty(B)| -ilf_type(C,set_type)| -member(C,B).
% 1.66/1.86 0 [] -ilf_type(B,set_type)|empty(B)|ilf_type($f8(B),set_type).
% 1.66/1.86 0 [] -ilf_type(B,set_type)|empty(B)|member($f8(B),B).
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -relation_like(B)| -ilf_type(C,set_type)| -member(C,B)|ilf_type($f10(B,C),set_type).
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -relation_like(B)| -ilf_type(C,set_type)| -member(C,B)|ilf_type($f9(B,C),set_type).
% 1.66/1.86 0 [] -ilf_type(B,set_type)| -relation_like(B)| -ilf_type(C,set_type)| -member(C,B)|C=ordered_pair($f10(B,C),$f9(B,C)).
% 1.66/1.86 0 [] -ilf_type(B,set_type)|relation_like(B)|ilf_type($f11(B),set_type).
% 1.66/1.86 0 [] -ilf_type(B,set_type)|relation_like(B)|member($f11(B),B).
% 1.66/1.86 0 [] -ilf_type(B,set_type)|relation_like(B)| -ilf_type(D,set_type)| -ilf_type(E,set_type)|$f11(B)!=ordered_pair(D,E).
% 1.66/1.86 0 [] -empty(B)| -ilf_type(B,set_type)|relation_like(B).
% 1.66/1.86 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/1.86 0 [] ilf_type(B,set_type).
% 1.66/1.86 0 [] ilf_type($c1,set_type).
% 1.66/1.86 0 [] -ilf_type(cross_product($c1,$c1),identity_relation_of_type($c1)).
% 1.66/1.86 end_of_list.
% 1.66/1.86
% 1.66/1.86 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 1.66/1.86
% 1.66/1.86 This ia a non-Horn set with equality. The strategy will be
% 1.66/1.86 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.66/1.86 deletion, with positive clauses in sos and nonpositive
% 1.66/1.86 clauses in usable.
% 1.66/1.86
% 1.66/1.86 dependent: set(knuth_bendix).
% 1.66/1.86 dependent: set(anl_eq).
% 1.66/1.86 dependent: set(para_from).
% 1.66/1.86 dependent: set(para_into).
% 1.66/1.86 dependent: clear(para_from_right).
% 1.66/1.86 dependent: clear(para_into_right).
% 1.66/1.86 dependent: set(para_from_vars).
% 1.66/1.86 dependent: set(eq_units_both_ways).
% 1.66/1.86 dependent: set(dynamic_demod_all).
% 1.66/1.86 dependent: set(dynamic_demod).
% 1.66/1.86 dependent: set(order_eq).
% 1.66/1.86 dependent: set(back_demod).
% 1.66/1.86 dependent: set(lrpo).
% 1.66/1.86 dependent: set(hyper_res).
% 1.66/1.86 dependent: set(unit_deletion).
% 1.66/1.86 dependent: set(factor).
% 1.66/1.86
% 1.66/1.86 ------------> process usable:
% 1.66/1.86 ** KEPT (pick-wt=13): 1 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(cross_product(A,B),relation_type(A,B)).
% 1.66/1.86 ** KEPT (pick-wt=20): 2 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -member(C,cross_product(A,B))|ilf_type($f2(A,B,C),set_type).
% 1.66/1.86 ** KEPT (pick-wt=20): 3 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -member(C,cross_product(A,B))|ilf_type($f1(A,B,C),set_type).
% 1.74/1.90 ** KEPT (pick-wt=20): 4 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -member(C,cross_product(A,B))|member($f2(A,B,C),A).
% 1.74/1.90 ** KEPT (pick-wt=20): 5 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -member(C,cross_product(A,B))|member($f1(A,B,C),B).
% 1.74/1.90 ** KEPT (pick-wt=25): 7 [copy,6,flip.5] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -member(C,cross_product(A,B))|ordered_pair($f2(A,B,C),$f1(A,B,C))=C.
% 1.74/1.90 ** KEPT (pick-wt=31): 8 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(C,cross_product(A,B))| -ilf_type(D,set_type)| -ilf_type(E,set_type)| -member(D,A)| -member(E,B)|C!=ordered_pair(D,E).
% 1.74/1.90 ** KEPT (pick-wt=11): 9 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(cross_product(A,B),set_type).
% 1.74/1.90 ** KEPT (pick-wt=15): 10 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(B,identity_relation_of_type(A))|ilf_type(B,relation_type(A,A)).
% 1.74/1.90 ** KEPT (pick-wt=15): 11 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(B,identity_relation_of_type(A))| -ilf_type(B,relation_type(A,A)).
% 1.74/1.90 ** KEPT (pick-wt=8): 12 [] -ilf_type(A,set_type)|ilf_type($f3(A),identity_relation_of_type(A)).
% 1.74/1.90 ** KEPT (pick-wt=11): 13 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(ordered_pair(A,B),set_type).
% 1.74/1.90 ** KEPT (pick-wt=17): 14 [] -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.74/1.90 ** KEPT (pick-wt=17): 15 [] -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.74/1.90 ** KEPT (pick-wt=13): 16 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type($f4(A,B),relation_type(B,A)).
% 1.74/1.90 ** 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.74/1.90 ** 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.74/1.90 ** KEPT (pick-wt=8): 19 [] -ilf_type(A,set_type)|ilf_type($f5(A),subset_type(A)).
% 1.74/1.90 ** KEPT (pick-wt=19): 20 [] -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.74/1.90 ** KEPT (pick-wt=15): 21 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))|ilf_type($f6(A,B),set_type).
% 1.74/1.90 ** KEPT (pick-wt=15): 22 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))|member($f6(A,B),A).
% 1.74/1.90 ** KEPT (pick-wt=15): 23 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))| -member($f6(A,B),B).
% 1.74/1.90 ** KEPT (pick-wt=6): 24 [] -ilf_type(A,set_type)| -empty(power_set(A)).
% 1.74/1.90 ** KEPT (pick-wt=7): 25 [] -ilf_type(A,set_type)|ilf_type(power_set(A),set_type).
% 1.74/1.90 ** 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.74/1.90 ** KEPT (pick-wt=15): 27 [] -ilf_type(A,set_type)|empty(B)| -ilf_type(B,set_type)|ilf_type(A,member_type(B))| -member(A,B).
% 1.74/1.90 ** KEPT (pick-wt=10): 28 [] empty(A)| -ilf_type(A,set_type)|ilf_type($f7(A),member_type(A)).
% 1.74/1.90 ** KEPT (pick-wt=11): 29 [] -ilf_type(A,set_type)| -empty(A)| -ilf_type(B,set_type)| -member(B,A).
% 1.74/1.90 ** KEPT (pick-wt=9): 30 [] -ilf_type(A,set_type)|empty(A)|ilf_type($f8(A),set_type).
% 1.74/1.90 ** KEPT (pick-wt=9): 31 [] -ilf_type(A,set_type)|empty(A)|member($f8(A),A).
% 1.74/1.90 ** KEPT (pick-wt=16): 32 [] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ilf_type($f10(A,B),set_type).
% 1.74/1.90 ** KEPT (pick-wt=16): 33 [] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ilf_type($f9(A,B),set_type).
% 1.74/1.90 ** KEPT (pick-wt=20): 35 [copy,34,flip.5] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ordered_pair($f10(A,B),$f9(A,B))=B.
% 1.74/1.90 ** KEPT (pick-wt=9): 36 [] -ilf_type(A,set_type)|relation_like(A)|ilf_type($f11(A),set_type).
% 1.74/1.90 ** KEPT (pick-wt=9): 37 [] -ilf_type(A,set_type)|relation_like(A)|member($f11(A),A).
% 1.74/1.91 ** KEPT (pick-wt=17): 38 [] -ilf_type(A,set_type)|relation_like(A)| -ilf_type(B,set_type)| -ilf_type(C,set_type)|$f11(A)!=ordered_pair(B,C).
% 1.74/1.91 ** KEPT (pick-wt=7): 39 [] -empty(A)| -ilf_type(A,set_type)|relation_like(A).
% 1.74/1.91 ** KEPT (pick-wt=14): 40 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,subset_type(cross_product(A,B)))|relation_like(C).
% 1.74/1.91 ** KEPT (pick-wt=6): 41 [] -ilf_type(cross_product($c1,$c1),identity_relation_of_type($c1)).
% 1.74/1.91
% 1.74/1.91 ------------> process sos:
% 1.74/1.91 ** KEPT (pick-wt=3): 140 [] A=A.
% 1.74/1.91 ** KEPT (pick-wt=3): 141 [] ilf_type(A,set_type).
% 1.74/1.91 Following clause subsumed by 141 during input processing: 0 [] ilf_type($c1,set_type).
% 1.74/1.91 Following clause subsumed by 140 during input processing: 0 [copy,140,flip.1] A=A.
% 1.74/1.91 141 back subsumes 95.
% 1.74/1.91 141 back subsumes 94.
% 1.74/1.91 141 back subsumes 88.
% 1.74/1.91 141 back subsumes 87.
% 1.74/1.91 141 back subsumes 81.
% 1.74/1.91 141 back subsumes 72.
% 1.74/1.91 141 back subsumes 69.
% 1.74/1.91 141 back subsumes 48.
% 1.74/1.91 141 back subsumes 47.
% 1.74/1.91 141 back subsumes 46.
% 1.74/1.91 141 back subsumes 45.
% 1.74/1.91 141 back subsumes 44.
% 1.74/1.91 141 back subsumes 43.
% 1.74/1.91 141 back subsumes 36.
% 1.74/1.91 141 back subsumes 33.
% 1.74/1.91 141 back subsumes 32.
% 1.74/1.91 141 back subsumes 30.
% 1.74/1.91 141 back subsumes 25.
% 1.74/1.91 141 back subsumes 21.
% 1.74/1.91 141 back subsumes 13.
% 1.74/1.91 141 back subsumes 9.
% 1.74/1.91 141 back subsumes 3.
% 1.74/1.91 141 back subsumes 2.
% 1.74/1.91
% 1.74/1.91 ======= end of input processing =======
% 1.74/1.91
% 1.74/1.91 =========== start of search ===========
% 1.74/1.91
% 1.74/1.91 -------- PROOF --------
% 1.74/1.91
% 1.74/1.91 ----> UNIT CONFLICT at 0.05 sec ----> 175 [binary,174.1,41.1] $F.
% 1.74/1.91
% 1.74/1.91 Length of proof is 2. Level of proof is 2.
% 1.74/1.91
% 1.74/1.91 ---------------- PROOF ----------------
% 1.74/1.91 % SZS status Theorem
% 1.74/1.91 % SZS output start Refutation
% See solution above
% 1.74/1.91 ------------ end of proof -------------
% 1.74/1.91
% 1.74/1.91
% 1.74/1.91 Search stopped by max_proofs option.
% 1.74/1.91
% 1.74/1.91
% 1.74/1.91 Search stopped by max_proofs option.
% 1.74/1.91
% 1.74/1.91 ============ end of search ============
% 1.74/1.91
% 1.74/1.91 -------------- statistics -------------
% 1.74/1.91 clauses given 15
% 1.74/1.91 clauses generated 318
% 1.74/1.91 clauses kept 172
% 1.74/1.91 clauses forward subsumed 186
% 1.74/1.91 clauses back subsumed 41
% 1.74/1.91 Kbytes malloced 1953
% 1.74/1.91
% 1.74/1.91 ----------- times (seconds) -----------
% 1.74/1.91 user CPU time 0.05 (0 hr, 0 min, 0 sec)
% 1.74/1.91 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.74/1.91 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.74/1.91
% 1.74/1.91 That finishes the proof of the theorem.
% 1.74/1.91
% 1.74/1.91 Process 14101 finished Wed Jul 27 10:35:22 2022
% 1.74/1.91 Otter interrupted
% 1.74/1.91 PROOF FOUND
%------------------------------------------------------------------------------