TSTP Solution File: SET643+3 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SET643+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n021.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:58 EDT 2022

% Result   : Theorem 1.89s 2.08s
% Output   : Refutation 1.89s
% 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   :    5 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 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(C,set_type)
    | ~ subset(A,cross_product(B,C))
    | ilf_type(A,relation_type(B,C)) ),
    file('SET643+3.p',unknown),
    [] ).

cnf(21,axiom,
    ( ~ ilf_type(A,set_type)
    | subset(A,A) ),
    file('SET643+3.p',unknown),
    [] ).

cnf(43,axiom,
    ~ ilf_type(cross_product(dollar_c2,dollar_c1),relation_type(dollar_c2,dollar_c1)),
    file('SET643+3.p',unknown),
    [] ).

cnf(146,axiom,
    ilf_type(A,set_type),
    file('SET643+3.p',unknown),
    [] ).

cnf(153,plain,
    subset(A,A),
    inference(hyper,[status(thm)],[146,21]),
    [iquote('hyper,146,21')] ).

cnf(158,plain,
    ilf_type(cross_product(A,B),relation_type(A,B)),
    inference(hyper,[status(thm)],[153,1,146,146,146]),
    [iquote('hyper,153,1,146,146,146')] ).

cnf(159,plain,
    $false,
    inference(binary,[status(thm)],[158,43]),
    [iquote('binary,158.1,43.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET643+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13  % Command  : otter-tptp-script %s
% 0.12/0.34  % Computer : n021.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Jul 27 10:29:08 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.83/2.03  ----- Otter 3.3f, August 2004 -----
% 1.83/2.03  The process was started by sandbox2 on n021.cluster.edu,
% 1.83/2.03  Wed Jul 27 10:29:08 2022
% 1.83/2.03  The command was "./otter".  The process ID is 26431.
% 1.83/2.03  
% 1.83/2.03  set(prolog_style_variables).
% 1.83/2.03  set(auto).
% 1.83/2.03     dependent: set(auto1).
% 1.83/2.03     dependent: set(process_input).
% 1.83/2.03     dependent: clear(print_kept).
% 1.83/2.03     dependent: clear(print_new_demod).
% 1.83/2.03     dependent: clear(print_back_demod).
% 1.83/2.03     dependent: clear(print_back_sub).
% 1.83/2.03     dependent: set(control_memory).
% 1.83/2.03     dependent: assign(max_mem, 12000).
% 1.83/2.03     dependent: assign(pick_given_ratio, 4).
% 1.83/2.03     dependent: assign(stats_level, 1).
% 1.83/2.03     dependent: assign(max_seconds, 10800).
% 1.83/2.03  clear(print_given).
% 1.83/2.03  
% 1.83/2.03  formula_list(usable).
% 1.83/2.03  all A (A=A).
% 1.83/2.03  all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (all D (ilf_type(D,set_type)-> (subset(B,cross_product(C,D))->ilf_type(B,relation_type(C,D)))))))).
% 1.83/2.03  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.83/2.03  all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(cross_product(B,C),set_type)))).
% 1.83/2.03  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.83/2.03  all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (exists D ilf_type(D,relation_type(C,B)))))).
% 1.83/2.03  all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(ordered_pair(B,C),set_type)))).
% 1.83/2.03  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.83/2.03  all B (ilf_type(B,set_type)-> (exists C ilf_type(C,subset_type(B)))).
% 1.83/2.03  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.83/2.03  all B (ilf_type(B,set_type)->subset(B,B)).
% 1.83/2.03  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.83/2.03  all B (ilf_type(B,set_type)-> -empty(power_set(B))&ilf_type(power_set(B),set_type)).
% 1.83/2.03  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.83/2.03  all B (-empty(B)&ilf_type(B,set_type)-> (exists C ilf_type(C,member_type(B)))).
% 1.83/2.03  all B (ilf_type(B,set_type)-> (empty(B)<-> (all C (ilf_type(C,set_type)-> -member(C,B))))).
% 1.83/2.03  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.83/2.03  all B (empty(B)&ilf_type(B,set_type)->relation_like(B)).
% 1.83/2.03  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.83/2.03  all B ilf_type(B,set_type).
% 1.83/2.03  -(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.83/2.03  end_of_list.
% 1.83/2.03  
% 1.83/2.03  -------> usable clausifies to:
% 1.83/2.03  
% 1.83/2.03  list(usable).
% 1.83/2.03  0 [] A=A.
% 1.83/2.03  0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -subset(B,cross_product(C,D))|ilf_type(B,relation_type(C,D)).
% 1.83/2.03  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.83/2.03  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.83/2.03  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.83/2.03  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.83/2.03  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.83/2.03  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.83/2.03  0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(cross_product(B,C),set_type).
% 1.83/2.03  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.83/2.03  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.83/2.03  0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type($f3(B,C),relation_type(C,B)).
% 1.83/2.03  0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(ordered_pair(B,C),set_type).
% 1.83/2.03  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.83/2.03  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.83/2.03  0 [] -ilf_type(B,set_type)|ilf_type($f4(B),subset_type(B)).
% 1.83/2.03  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.83/2.03  0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|subset(B,C)|ilf_type($f5(B,C),set_type).
% 1.83/2.03  0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|subset(B,C)|member($f5(B,C),B).
% 1.83/2.03  0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|subset(B,C)| -member($f5(B,C),C).
% 1.83/2.03  0 [] -ilf_type(B,set_type)|subset(B,B).
% 1.83/2.03  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.83/2.03  0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))|ilf_type($f6(B,C),set_type).
% 1.83/2.03  0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))|member($f6(B,C),B).
% 1.83/2.03  0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))| -member($f6(B,C),C).
% 1.83/2.03  0 [] -ilf_type(B,set_type)| -empty(power_set(B)).
% 1.83/2.03  0 [] -ilf_type(B,set_type)|ilf_type(power_set(B),set_type).
% 1.83/2.03  0 [] -ilf_type(B,set_type)|empty(C)| -ilf_type(C,set_type)| -ilf_type(B,member_type(C))|member(B,C).
% 1.83/2.03  0 [] -ilf_type(B,set_type)|empty(C)| -ilf_type(C,set_type)|ilf_type(B,member_type(C))| -member(B,C).
% 1.83/2.03  0 [] empty(B)| -ilf_type(B,set_type)|ilf_type($f7(B),member_type(B)).
% 1.83/2.03  0 [] -ilf_type(B,set_type)| -empty(B)| -ilf_type(C,set_type)| -member(C,B).
% 1.83/2.03  0 [] -ilf_type(B,set_type)|empty(B)|ilf_type($f8(B),set_type).
% 1.83/2.03  0 [] -ilf_type(B,set_type)|empty(B)|member($f8(B),B).
% 1.83/2.03  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.83/2.03  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.83/2.03  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.83/2.03  0 [] -ilf_type(B,set_type)|relation_like(B)|ilf_type($f11(B),set_type).
% 1.83/2.03  0 [] -ilf_type(B,set_type)|relation_like(B)|member($f11(B),B).
% 1.83/2.03  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.83/2.03  0 [] -empty(B)| -ilf_type(B,set_type)|relation_like(B).
% 1.83/2.03  0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,subset_type(cross_product(B,C)))|relation_like(D).
% 1.83/2.03  0 [] ilf_type(B,set_type).
% 1.83/2.03  0 [] ilf_type($c2,set_type).
% 1.83/2.03  0 [] ilf_type($c1,set_type).
% 1.83/2.03  0 [] -ilf_type(cross_product($c2,$c1),relation_type($c2,$c1)).
% 1.83/2.03  end_of_list.
% 1.83/2.03  
% 1.83/2.03  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 1.83/2.03  
% 1.83/2.03  This ia a non-Horn set with equality.  The strategy will be
% 1.83/2.03  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.83/2.03  deletion, with positive clauses in sos and nonpositive
% 1.83/2.03  clauses in usable.
% 1.83/2.03  
% 1.83/2.03     dependent: set(knuth_bendix).
% 1.83/2.03     dependent: set(anl_eq).
% 1.83/2.03     dependent: set(para_from).
% 1.83/2.03     dependent: set(para_into).
% 1.83/2.03     dependent: clear(para_from_right).
% 1.83/2.03     dependent: clear(para_into_right).
% 1.83/2.03     dependent: set(para_from_vars).
% 1.83/2.03     dependent: set(eq_units_both_ways).
% 1.83/2.03     dependent: set(dynamic_demod_all).
% 1.83/2.03     dependent: set(dynamic_demod).
% 1.83/2.03     dependent: set(order_eq).
% 1.83/2.03     dependent: set(back_demod).
% 1.83/2.03     dependent: set(lrpo).
% 1.83/2.03     dependent: set(hyper_res).
% 1.83/2.03     dependent: set(unit_deletion).
% 1.83/2.03     dependent: set(factor).
% 1.83/2.03  
% 1.83/2.03  ------------> process usable:
% 1.83/2.03  ** KEPT (pick-wt=19): 1 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -subset(A,cross_product(B,C))|ilf_type(A,relation_type(B,C)).
% 1.89/2.08  ** 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.89/2.08  ** 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.89/2.08  ** 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.89/2.08  ** 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.89/2.08  ** 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.89/2.08  ** 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.89/2.08  ** KEPT (pick-wt=11): 9 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(cross_product(A,B),set_type).
% 1.89/2.08  ** KEPT (pick-wt=17): 10 [] -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.89/2.08  ** KEPT (pick-wt=17): 11 [] -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.89/2.08  ** KEPT (pick-wt=13): 12 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type($f3(A,B),relation_type(B,A)).
% 1.89/2.08  ** KEPT (pick-wt=11): 13 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(ordered_pair(A,B),set_type).
% 1.89/2.08  ** KEPT (pick-wt=15): 14 [] -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.89/2.08  ** 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.89/2.08  ** KEPT (pick-wt=8): 16 [] -ilf_type(A,set_type)|ilf_type($f4(A),subset_type(A)).
% 1.89/2.08  ** KEPT (pick-wt=18): 17 [] -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.89/2.08  ** KEPT (pick-wt=14): 18 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|subset(A,B)|ilf_type($f5(A,B),set_type).
% 1.89/2.08  ** KEPT (pick-wt=14): 19 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|subset(A,B)|member($f5(A,B),A).
% 1.89/2.08  ** KEPT (pick-wt=14): 20 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|subset(A,B)| -member($f5(A,B),B).
% 1.89/2.08  ** KEPT (pick-wt=6): 21 [] -ilf_type(A,set_type)|subset(A,A).
% 1.89/2.08  ** KEPT (pick-wt=19): 22 [] -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.89/2.08  ** KEPT (pick-wt=15): 23 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))|ilf_type($f6(A,B),set_type).
% 1.89/2.08  ** KEPT (pick-wt=15): 24 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))|member($f6(A,B),A).
% 1.89/2.08  ** KEPT (pick-wt=15): 25 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))| -member($f6(A,B),B).
% 1.89/2.08  ** KEPT (pick-wt=6): 26 [] -ilf_type(A,set_type)| -empty(power_set(A)).
% 1.89/2.08  ** KEPT (pick-wt=7): 27 [] -ilf_type(A,set_type)|ilf_type(power_set(A),set_type).
% 1.89/2.08  ** KEPT (pick-wt=15): 28 [] -ilf_type(A,set_type)|empty(B)| -ilf_type(B,set_type)| -ilf_type(A,member_type(B))|member(A,B).
% 1.89/2.08  ** KEPT (pick-wt=15): 29 [] -ilf_type(A,set_type)|empty(B)| -ilf_type(B,set_type)|ilf_type(A,member_type(B))| -member(A,B).
% 1.89/2.08  ** KEPT (pick-wt=10): 30 [] empty(A)| -ilf_type(A,set_type)|ilf_type($f7(A),member_type(A)).
% 1.89/2.08  ** KEPT (pick-wt=11): 31 [] -ilf_type(A,set_type)| -empty(A)| -ilf_type(B,set_type)| -member(B,A).
% 1.89/2.08  ** KEPT (pick-wt=9): 32 [] -ilf_type(A,set_type)|empty(A)|ilf_type($f8(A),set_type).
% 1.89/2.08  ** KEPT (pick-wt=9): 33 [] -ilf_type(A,set_type)|empty(A)|member($f8(A),A).
% 1.89/2.08  ** KEPT (pick-wt=16): 34 [] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ilf_type($f10(A,B),set_type).
% 1.89/2.08  ** KEPT (pick-wt=16): 35 [] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ilf_type($f9(A,B),set_type).
% 1.89/2.08  ** KEPT (pick-wt=20): 37 [copy,36,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.89/2.08  ** KEPT (pick-wt=9): 38 [] -ilf_type(A,set_type)|relation_like(A)|ilf_type($f11(A),set_type).
% 1.89/2.08  ** KEPT (pick-wt=9): 39 [] -ilf_type(A,set_type)|relation_like(A)|member($f11(A),A).
% 1.89/2.08  ** KEPT (pick-wt=17): 40 [] -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.89/2.08  ** KEPT (pick-wt=7): 41 [] -empty(A)| -ilf_type(A,set_type)|relation_like(A).
% 1.89/2.08  ** KEPT (pick-wt=14): 42 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,subset_type(cross_product(A,B)))|relation_like(C).
% 1.89/2.08  ** KEPT (pick-wt=7): 43 [] -ilf_type(cross_product($c2,$c1),relation_type($c2,$c1)).
% 1.89/2.08  
% 1.89/2.08  ------------> process sos:
% 1.89/2.08  ** KEPT (pick-wt=3): 145 [] A=A.
% 1.89/2.08  ** KEPT (pick-wt=3): 146 [] ilf_type(A,set_type).
% 1.89/2.08    Following clause subsumed by 146 during input processing: 0 [] ilf_type($c2,set_type).
% 1.89/2.08    Following clause subsumed by 146 during input processing: 0 [] ilf_type($c1,set_type).
% 1.89/2.08    Following clause subsumed by 145 during input processing: 0 [copy,145,flip.1] A=A.
% 1.89/2.08  146 back subsumes 100.
% 1.89/2.08  146 back subsumes 99.
% 1.89/2.08  146 back subsumes 92.
% 1.89/2.08  146 back subsumes 91.
% 1.89/2.08  146 back subsumes 85.
% 1.89/2.08  146 back subsumes 77.
% 1.89/2.08  146 back subsumes 73.
% 1.89/2.08  146 back subsumes 52.
% 1.89/2.08  146 back subsumes 51.
% 1.89/2.08  146 back subsumes 50.
% 1.89/2.08  146 back subsumes 49.
% 1.89/2.08  146 back subsumes 48.
% 1.89/2.08  146 back subsumes 47.
% 1.89/2.08  146 back subsumes 38.
% 1.89/2.08  146 back subsumes 35.
% 1.89/2.08  146 back subsumes 34.
% 1.89/2.08  146 back subsumes 32.
% 1.89/2.08  146 back subsumes 27.
% 1.89/2.08  146 back subsumes 23.
% 1.89/2.08  146 back subsumes 18.
% 1.89/2.08  146 back subsumes 13.
% 1.89/2.08  146 back subsumes 9.
% 1.89/2.08  146 back subsumes 3.
% 1.89/2.08  146 back subsumes 2.
% 1.89/2.08  
% 1.89/2.08  ======= end of input processing =======
% 1.89/2.08  
% 1.89/2.08  =========== start of search ===========
% 1.89/2.08  
% 1.89/2.08  -------- PROOF -------- 
% 1.89/2.08  
% 1.89/2.08  ----> UNIT CONFLICT at   0.05 sec ----> 159 [binary,158.1,43.1] $F.
% 1.89/2.08  
% 1.89/2.08  Length of proof is 2.  Level of proof is 2.
% 1.89/2.08  
% 1.89/2.08  ---------------- PROOF ----------------
% 1.89/2.08  % SZS status Theorem
% 1.89/2.08  % SZS output start Refutation
% See solution above
% 1.89/2.08  ------------ end of proof -------------
% 1.89/2.08  
% 1.89/2.08  
% 1.89/2.08  Search stopped by max_proofs option.
% 1.89/2.08  
% 1.89/2.08  
% 1.89/2.08  Search stopped by max_proofs option.
% 1.89/2.08  
% 1.89/2.08  ============ end of search ============
% 1.89/2.08  
% 1.89/2.08  -------------- statistics -------------
% 1.89/2.08  clauses given                  3
% 1.89/2.08  clauses generated            296
% 1.89/2.08  clauses kept                 156
% 1.89/2.08  clauses forward subsumed     180
% 1.89/2.08  clauses back subsumed         36
% 1.89/2.08  Kbytes malloced             1953
% 1.89/2.08  
% 1.89/2.08  ----------- times (seconds) -----------
% 1.89/2.08  user CPU time          0.05          (0 hr, 0 min, 0 sec)
% 1.89/2.08  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.89/2.08  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.89/2.08  
% 1.89/2.08  That finishes the proof of the theorem.
% 1.89/2.08  
% 1.89/2.08  Process 26431 finished Wed Jul 27 10:29:10 2022
% 1.89/2.08  Otter interrupted
% 1.89/2.08  PROOF FOUND
%------------------------------------------------------------------------------