TSTP Solution File: SET007-1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SET007-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n007.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:12:46 EDT 2022

% Result   : Unsatisfiable 37.43s 37.70s
% Output   : Refutation 37.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   78 (  19 unt;  49 nHn;  39 RR)
%            Number of literals    :  172 (   0 equ;  25 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-3 aty)
%            Number of variables   :   95 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(6,axiom,
    ( ~ union(A,B,C)
    | ~ member(D,C)
    | member(D,A)
    | member(D,B) ),
    file('SET007-1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ union(A,B,C)
    | ~ member(D,A)
    | member(D,C) ),
    file('SET007-1.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ union(A,B,C)
    | ~ member(D,B)
    | member(D,C) ),
    file('SET007-1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ member(g(A,B,C),A)
    | ~ member(g(A,B,C),C)
    | union(A,B,C) ),
    file('SET007-1.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ member(g(A,B,C),B)
    | ~ member(g(A,B,C),C)
    | union(A,B,C) ),
    file('SET007-1.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ intersection(A,B,C)
    | ~ member(D,C)
    | member(D,A) ),
    file('SET007-1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ intersection(A,B,C)
    | ~ member(D,C)
    | member(D,B) ),
    file('SET007-1.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ intersection(A,B,C)
    | ~ member(D,B)
    | ~ member(D,A)
    | member(D,C) ),
    file('SET007-1.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ member(h(A,B,C),C)
    | ~ member(h(A,B,C),B)
    | ~ member(h(A,B,C),A)
    | intersection(A,B,C) ),
    file('SET007-1.p',unknown),
    [] ).

cnf(15,axiom,
    ~ union(aIb,aIc,aI_bUc),
    file('SET007-1.p',unknown),
    [] ).

cnf(21,plain,
    ( ~ member(h(A,B,B),B)
    | ~ member(h(A,B,B),A)
    | intersection(A,B,B) ),
    inference(factor,[status(thm)],[14]),
    [iquote('factor,14.1.2')] ).

cnf(22,plain,
    ( ~ member(h(A,B,A),A)
    | ~ member(h(A,B,A),B)
    | intersection(A,B,A) ),
    inference(factor,[status(thm)],[14]),
    [iquote('factor,14.1.3')] ).

cnf(26,axiom,
    ( union(A,B,C)
    | member(g(A,B,C),A)
    | member(g(A,B,C),B)
    | member(g(A,B,C),C) ),
    file('SET007-1.p',unknown),
    [] ).

cnf(27,axiom,
    ( member(h(A,B,C),C)
    | intersection(A,B,C)
    | member(h(A,B,C),A) ),
    file('SET007-1.p',unknown),
    [] ).

cnf(28,axiom,
    ( member(h(A,B,C),C)
    | intersection(A,B,C)
    | member(h(A,B,C),B) ),
    file('SET007-1.p',unknown),
    [] ).

cnf(29,axiom,
    union(b,c,bUc),
    file('SET007-1.p',unknown),
    [] ).

cnf(30,axiom,
    intersection(a,b,aIb),
    file('SET007-1.p',unknown),
    [] ).

cnf(31,axiom,
    intersection(a,c,aIc),
    file('SET007-1.p',unknown),
    [] ).

cnf(32,axiom,
    intersection(a,bUc,aI_bUc),
    file('SET007-1.p',unknown),
    [] ).

cnf(36,plain,
    ( member(h(A,B,A),A)
    | intersection(A,B,A) ),
    inference(factor,[status(thm)],[27]),
    [iquote('factor,27.1.3')] ).

cnf(37,plain,
    ( member(h(A,B,B),B)
    | intersection(A,B,B) ),
    inference(factor,[status(thm)],[28]),
    [iquote('factor,28.1.3')] ).

cnf(43,plain,
    ( union(aIb,A,B)
    | member(g(aIb,A,B),A)
    | member(g(aIb,A,B),B)
    | member(g(aIb,A,B),b) ),
    inference(hyper,[status(thm)],[26,12,30]),
    [iquote('hyper,26,12,30')] ).

cnf(55,plain,
    ( union(A,aIc,B)
    | member(g(A,aIc,B),A)
    | member(g(A,aIc,B),B)
    | member(g(A,aIc,B),a) ),
    inference(hyper,[status(thm)],[26,11,31]),
    [iquote('hyper,26,11,31')] ).

cnf(218,plain,
    ( intersection(A,B,aI_bUc)
    | member(h(A,B,aI_bUc),A)
    | member(h(A,B,aI_bUc),bUc) ),
    inference(hyper,[status(thm)],[27,12,32]),
    [iquote('hyper,27,12,32')] ).

cnf(219,plain,
    ( intersection(A,B,aIc)
    | member(h(A,B,aIc),A)
    | member(h(A,B,aIc),c) ),
    inference(hyper,[status(thm)],[27,12,31]),
    [iquote('hyper,27,12,31')] ).

cnf(220,plain,
    ( intersection(A,B,aIb)
    | member(h(A,B,aIb),A)
    | member(h(A,B,aIb),b) ),
    inference(hyper,[status(thm)],[27,12,30]),
    [iquote('hyper,27,12,30')] ).

cnf(224,plain,
    ( intersection(A,B,c)
    | member(h(A,B,c),A)
    | member(h(A,B,c),bUc) ),
    inference(hyper,[status(thm)],[27,8,29]),
    [iquote('hyper,27,8,29')] ).

cnf(225,plain,
    ( intersection(A,B,b)
    | member(h(A,B,b),A)
    | member(h(A,B,b),bUc) ),
    inference(hyper,[status(thm)],[27,7,29]),
    [iquote('hyper,27,7,29')] ).

cnf(238,plain,
    ( intersection(bUc,A,aI_bUc)
    | member(h(bUc,A,aI_bUc),bUc) ),
    inference(factor,[status(thm)],[218]),
    [iquote('factor,218.2.3')] ).

cnf(239,plain,
    ( intersection(c,A,aIc)
    | member(h(c,A,aIc),c) ),
    inference(factor,[status(thm)],[219]),
    [iquote('factor,219.2.3')] ).

cnf(240,plain,
    ( intersection(b,A,aIb)
    | member(h(b,A,aIb),b) ),
    inference(factor,[status(thm)],[220]),
    [iquote('factor,220.2.3')] ).

cnf(244,plain,
    ( intersection(bUc,A,c)
    | member(h(bUc,A,c),bUc) ),
    inference(factor,[status(thm)],[224]),
    [iquote('factor,224.2.3')] ).

cnf(245,plain,
    ( intersection(bUc,A,b)
    | member(h(bUc,A,b),bUc) ),
    inference(factor,[status(thm)],[225]),
    [iquote('factor,225.2.3')] ).

cnf(261,plain,
    ( intersection(aI_bUc,A,aI_bUc)
    | member(h(aI_bUc,A,aI_bUc),bUc) ),
    inference(hyper,[status(thm)],[36,12,32]),
    [iquote('hyper,36,12,32')] ).

cnf(262,plain,
    ( intersection(aIc,A,aIc)
    | member(h(aIc,A,aIc),c) ),
    inference(hyper,[status(thm)],[36,12,31]),
    [iquote('hyper,36,12,31')] ).

cnf(263,plain,
    ( intersection(aIb,A,aIb)
    | member(h(aIb,A,aIb),b) ),
    inference(hyper,[status(thm)],[36,12,30]),
    [iquote('hyper,36,12,30')] ).

cnf(265,plain,
    ( intersection(aIc,A,aIc)
    | member(h(aIc,A,aIc),a) ),
    inference(hyper,[status(thm)],[36,11,31]),
    [iquote('hyper,36,11,31')] ).

cnf(266,plain,
    ( intersection(aIb,A,aIb)
    | member(h(aIb,A,aIb),a) ),
    inference(hyper,[status(thm)],[36,11,30]),
    [iquote('hyper,36,11,30')] ).

cnf(285,plain,
    ( intersection(A,B,aI_bUc)
    | member(h(A,B,aI_bUc),B)
    | member(h(A,B,aI_bUc),a) ),
    inference(hyper,[status(thm)],[28,11,32]),
    [iquote('hyper,28,11,32')] ).

cnf(287,plain,
    ( intersection(A,B,aIb)
    | member(h(A,B,aIb),B)
    | member(h(A,B,aIb),a) ),
    inference(hyper,[status(thm)],[28,11,30]),
    [iquote('hyper,28,11,30')] ).

cnf(292,plain,
    ( member(h(bUc,a,A),A)
    | intersection(bUc,a,A)
    | member(h(bUc,a,A),aI_bUc) ),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[28,13,32,27])])]),
    [iquote('hyper,28,13,32,27,factor_simp,factor_simp')] ).

cnf(294,plain,
    ( member(h(b,a,A),A)
    | intersection(b,a,A)
    | member(h(b,a,A),aIb) ),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[28,13,30,27])])]),
    [iquote('hyper,28,13,30,27,factor_simp,factor_simp')] ).

cnf(311,plain,
    ( intersection(A,a,aI_bUc)
    | member(h(A,a,aI_bUc),a) ),
    inference(factor,[status(thm)],[285]),
    [iquote('factor,285.2.3')] ).

cnf(313,plain,
    ( intersection(A,a,aIb)
    | member(h(A,a,aIb),a) ),
    inference(factor,[status(thm)],[287]),
    [iquote('factor,287.2.3')] ).

cnf(319,plain,
    ( member(h(bUc,a,aI_bUc),aI_bUc)
    | intersection(bUc,a,aI_bUc) ),
    inference(factor,[status(thm)],[292]),
    [iquote('factor,292.1.3')] ).

cnf(321,plain,
    ( member(h(b,a,aIb),aIb)
    | intersection(b,a,aIb) ),
    inference(factor,[status(thm)],[294]),
    [iquote('factor,294.1.3')] ).

cnf(851,plain,
    intersection(bUc,c,c),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[244,21,37])])]),
    [iquote('hyper,244,21,37,factor_simp,factor_simp')] ).

cnf(853,plain,
    intersection(bUc,b,b),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[245,21,37])])]),
    [iquote('hyper,245,21,37,factor_simp,factor_simp')] ).

cnf(1256,plain,
    intersection(aI_bUc,bUc,aI_bUc),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[261,22,36])])]),
    [iquote('hyper,261,22,36,factor_simp,factor_simp')] ).

cnf(1260,plain,
    ( intersection(aIc,A,aIc)
    | member(h(aIc,A,aIc),bUc) ),
    inference(hyper,[status(thm)],[262,11,851]),
    [iquote('hyper,262,11,851')] ).

cnf(1296,plain,
    ( intersection(aIb,A,aIb)
    | member(h(aIb,A,aIb),bUc) ),
    inference(hyper,[status(thm)],[263,11,853]),
    [iquote('hyper,263,11,853')] ).

cnf(1776,plain,
    intersection(bUc,a,aI_bUc),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[319,14,311,238])])])]),
    [iquote('hyper,319,14,311,238,factor_simp,factor_simp,factor_simp')] ).

cnf(1794,plain,
    intersection(b,a,aIb),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[321,14,313,240])])])]),
    [iquote('hyper,321,14,313,240,factor_simp,factor_simp,factor_simp')] ).

cnf(2515,plain,
    ( intersection(aIc,A,aIc)
    | member(h(aIc,A,aIc),aI_bUc) ),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[1260,13,1776,265])]),
    [iquote('hyper,1260,13,1776,265,factor_simp')] ).

cnf(2518,plain,
    ( intersection(aIb,A,aIb)
    | member(h(aIb,A,aIb),aI_bUc) ),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[1296,13,1776,266])]),
    [iquote('hyper,1296,13,1776,266,factor_simp')] ).

cnf(2851,plain,
    intersection(aIc,aI_bUc,aIc),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[2515,22,36])])]),
    [iquote('hyper,2515,22,36,factor_simp,factor_simp')] ).

cnf(2892,plain,
    ( member(g(aIb,aIc,A),aI_bUc)
    | union(aIb,aIc,A)
    | member(g(aIb,aIc,A),A)
    | member(g(aIb,aIc,A),b) ),
    inference(hyper,[status(thm)],[2851,12,43]),
    [iquote('hyper,2851,12,43')] ).

cnf(2898,plain,
    ( member(h(A,B,aIc),aI_bUc)
    | intersection(A,B,aIc)
    | member(h(A,B,aIc),B) ),
    inference(hyper,[status(thm)],[2851,12,28]),
    [iquote('hyper,2851,12,28')] ).

cnf(2951,plain,
    ( member(g(aIb,aIc,aI_bUc),aI_bUc)
    | member(g(aIb,aIc,aI_bUc),b) ),
    inference(unit_del,[status(thm)],[inference(factor,[status(thm)],[2892]),15]),
    [iquote('factor,2892.1.3,unit_del,15')] ).

cnf(2955,plain,
    ( member(h(A,aI_bUc,aIc),aI_bUc)
    | intersection(A,aI_bUc,aIc) ),
    inference(factor,[status(thm)],[2898]),
    [iquote('factor,2898.1.3')] ).

cnf(2975,plain,
    intersection(aIb,aI_bUc,aIb),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[2518,22,36])])]),
    [iquote('hyper,2518,22,36,factor_simp,factor_simp')] ).

cnf(3016,plain,
    ( member(h(A,B,aIb),aI_bUc)
    | intersection(A,B,aIb)
    | member(h(A,B,aIb),B) ),
    inference(hyper,[status(thm)],[2975,12,28]),
    [iquote('hyper,2975,12,28')] ).

cnf(3073,plain,
    ( member(h(A,aI_bUc,aIb),aI_bUc)
    | intersection(A,aI_bUc,aIb) ),
    inference(factor,[status(thm)],[3016]),
    [iquote('factor,3016.1.3')] ).

cnf(3128,plain,
    ( intersection(A,aI_bUc,aIc)
    | member(h(A,aI_bUc,aIc),a) ),
    inference(hyper,[status(thm)],[2955,12,1776]),
    [iquote('hyper,2955,12,1776')] ).

cnf(3150,plain,
    ( intersection(A,aI_bUc,aIb)
    | member(h(A,aI_bUc,aIb),a) ),
    inference(hyper,[status(thm)],[3073,12,1776]),
    [iquote('hyper,3073,12,1776')] ).

cnf(3172,plain,
    ( intersection(c,aI_bUc,aIc)
    | member(h(c,aI_bUc,aIc),aIc) ),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[3128,13,31,239])]),
    [iquote('hyper,3128,13,31,239,factor_simp')] ).

cnf(3212,plain,
    ( intersection(b,aI_bUc,aIb)
    | member(h(b,aI_bUc,aIb),aIb) ),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[3150,13,30,240])]),
    [iquote('hyper,3150,13,30,240,factor_simp')] ).

cnf(3297,plain,
    intersection(c,aI_bUc,aIc),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[3172,14,2955,239])])])]),
    [iquote('hyper,3172,14,2955,239,factor_simp,factor_simp,factor_simp')] ).

cnf(3451,plain,
    intersection(b,aI_bUc,aIb),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[3212,14,3073,240])])])]),
    [iquote('hyper,3212,14,3073,240,factor_simp,factor_simp,factor_simp')] ).

cnf(3556,plain,
    ( member(g(aIb,aIc,aI_bUc),b)
    | member(g(aIb,aIc,aI_bUc),bUc) ),
    inference(hyper,[status(thm)],[2951,12,1256]),
    [iquote('hyper,2951,12,1256')] ).

cnf(3569,plain,
    ( member(g(aIb,aIc,aI_bUc),aI_bUc)
    | member(g(aIb,aIc,aI_bUc),aIb) ),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[2951,13,1794,55]),15])])]),
    [iquote('hyper,2951,13,1794,55,unit_del,15,factor_simp,factor_simp')] ).

cnf(3895,plain,
    ( member(g(aIb,aIc,aI_bUc),b)
    | member(g(aIb,aIc,aI_bUc),c) ),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[3556,6,29])]),
    [iquote('hyper,3556,6,29,factor_simp')] ).

cnf(7079,plain,
    member(g(aIb,aIc,aI_bUc),aI_bUc),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[3569,12,3451])]),
    [iquote('hyper,3569,12,3451,factor_simp')] ).

cnf(10543,plain,
    ( member(g(aIb,aIc,aI_bUc),c)
    | member(g(aIb,aIc,aI_bUc),aIb) ),
    inference(hyper,[status(thm)],[3895,13,3451,7079]),
    [iquote('hyper,3895,13,3451,7079')] ).

cnf(10550,plain,
    member(g(aIb,aIc,aI_bUc),c),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[10543,9,7079]),15]),
    [iquote('hyper,10543,9,7079,unit_del,15')] ).

cnf(10555,plain,
    member(g(aIb,aIc,aI_bUc),aIc),
    inference(hyper,[status(thm)],[10550,13,3297,7079]),
    [iquote('hyper,10550,13,3297,7079')] ).

cnf(10561,plain,
    union(aIb,aIc,aI_bUc),
    inference(hyper,[status(thm)],[10555,10,7079]),
    [iquote('hyper,10555,10,7079')] ).

cnf(10562,plain,
    $false,
    inference(binary,[status(thm)],[10561,15]),
    [iquote('binary,10561.1,15.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem  : SET007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.09/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n007.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:15:31 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.69/1.89  ----- Otter 3.3f, August 2004 -----
% 1.69/1.89  The process was started by sandbox on n007.cluster.edu,
% 1.69/1.89  Wed Jul 27 10:15:31 2022
% 1.69/1.89  The command was "./otter".  The process ID is 4838.
% 1.69/1.89  
% 1.69/1.89  set(prolog_style_variables).
% 1.69/1.89  set(auto).
% 1.69/1.89     dependent: set(auto1).
% 1.69/1.89     dependent: set(process_input).
% 1.69/1.89     dependent: clear(print_kept).
% 1.69/1.89     dependent: clear(print_new_demod).
% 1.69/1.89     dependent: clear(print_back_demod).
% 1.69/1.89     dependent: clear(print_back_sub).
% 1.69/1.89     dependent: set(control_memory).
% 1.69/1.89     dependent: assign(max_mem, 12000).
% 1.69/1.89     dependent: assign(pick_given_ratio, 4).
% 1.69/1.89     dependent: assign(stats_level, 1).
% 1.69/1.89     dependent: assign(max_seconds, 10800).
% 1.69/1.89  clear(print_given).
% 1.69/1.89  
% 1.69/1.89  list(usable).
% 1.69/1.89  0 [] -member(Element,Subset)| -subset(Subset,Superset)|member(Element,Superset).
% 1.69/1.89  0 [] subset(Subset,Superset)|member(member_of_1_not_of_2(Subset,Superset),Subset).
% 1.69/1.89  0 [] -member(member_of_1_not_of_2(Subset,Superset),Superset)|subset(Subset,Superset).
% 1.69/1.89  0 [] -e_qual_sets(Subset,Superset)|subset(Subset,Superset).
% 1.69/1.89  0 [] -e_qual_sets(Superset,Subset)|subset(Subset,Superset).
% 1.69/1.89  0 [] -subset(Set1,Set2)| -subset(Set2,Set1)|e_qual_sets(Set2,Set1).
% 1.69/1.89  0 [] -union(Set1,Set2,Union)| -member(Element,Union)|member(Element,Set1)|member(Element,Set2).
% 1.69/1.89  0 [] -union(Set1,Set2,Union)| -member(Element,Set1)|member(Element,Union).
% 1.69/1.89  0 [] -union(Set1,Set2,Union)| -member(Element,Set2)|member(Element,Union).
% 1.69/1.89  0 [] union(Set1,Set2,Union)|member(g(Set1,Set2,Union),Set1)|member(g(Set1,Set2,Union),Set2)|member(g(Set1,Set2,Union),Union).
% 1.69/1.89  0 [] -member(g(Set1,Set2,Union),Set1)| -member(g(Set1,Set2,Union),Union)|union(Set1,Set2,Union).
% 1.69/1.89  0 [] -member(g(Set1,Set2,Union),Set2)| -member(g(Set1,Set2,Union),Union)|union(Set1,Set2,Union).
% 1.69/1.89  0 [] -intersection(Set1,Set2,Intersection)| -member(Element,Intersection)|member(Element,Set1).
% 1.69/1.89  0 [] -intersection(Set1,Set2,Intersection)| -member(Element,Intersection)|member(Element,Set2).
% 1.69/1.89  0 [] -intersection(Set1,Set2,Intersection)| -member(Element,Set2)| -member(Element,Set1)|member(Element,Intersection).
% 1.69/1.89  0 [] member(h(Set1,Set2,Intersection),Intersection)|intersection(Set1,Set2,Intersection)|member(h(Set1,Set2,Intersection),Set1).
% 1.69/1.89  0 [] member(h(Set1,Set2,Intersection),Intersection)|intersection(Set1,Set2,Intersection)|member(h(Set1,Set2,Intersection),Set2).
% 1.69/1.89  0 [] -member(h(Set1,Set2,Intersection),Intersection)| -member(h(Set1,Set2,Intersection),Set2)| -member(h(Set1,Set2,Intersection),Set1)|intersection(Set1,Set2,Intersection).
% 1.69/1.89  0 [] union(b,c,bUc).
% 1.69/1.89  0 [] intersection(a,b,aIb).
% 1.69/1.89  0 [] intersection(a,c,aIc).
% 1.69/1.89  0 [] intersection(a,bUc,aI_bUc).
% 1.69/1.89  0 [] -union(aIb,aIc,aI_bUc).
% 1.69/1.89  end_of_list.
% 1.69/1.89  
% 1.69/1.89  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.69/1.89  
% 1.69/1.89  This is a non-Horn set without equality.  The strategy will
% 1.69/1.89  be ordered hyper_res, unit deletion, and factoring, with
% 1.69/1.89  satellites in sos and with nuclei in usable.
% 1.69/1.89  
% 1.69/1.89     dependent: set(hyper_res).
% 1.69/1.89     dependent: set(factor).
% 1.69/1.89     dependent: set(unit_deletion).
% 1.69/1.89  
% 1.69/1.89  ------------> process usable:
% 1.69/1.89  ** KEPT (pick-wt=9): 1 [] -member(A,B)| -subset(B,C)|member(A,C).
% 1.69/1.89  ** KEPT (pick-wt=8): 2 [] -member(member_of_1_not_of_2(A,B),B)|subset(A,B).
% 1.69/1.89  ** KEPT (pick-wt=6): 3 [] -e_qual_sets(A,B)|subset(A,B).
% 1.69/1.89  ** KEPT (pick-wt=6): 4 [] -e_qual_sets(A,B)|subset(B,A).
% 1.69/1.89  ** KEPT (pick-wt=9): 5 [] -subset(A,B)| -subset(B,A)|e_qual_sets(B,A).
% 1.69/1.89  ** KEPT (pick-wt=13): 6 [] -union(A,B,C)| -member(D,C)|member(D,A)|member(D,B).
% 1.69/1.89  ** KEPT (pick-wt=10): 7 [] -union(A,B,C)| -member(D,A)|member(D,C).
% 1.69/1.89  ** KEPT (pick-wt=10): 8 [] -union(A,B,C)| -member(D,B)|member(D,C).
% 1.69/1.89  ** KEPT (pick-wt=16): 9 [] -member(g(A,B,C),A)| -member(g(A,B,C),C)|union(A,B,C).
% 1.69/1.89  ** KEPT (pick-wt=16): 10 [] -member(g(A,B,C),B)| -member(g(A,B,C),C)|union(A,B,C).
% 1.69/1.89  ** KEPT (pick-wt=10): 11 [] -intersection(A,B,C)| -member(D,C)|member(D,A).
% 1.69/1.89  ** KEPT (pick-wt=10): 12 [] -intersection(A,B,C)| -member(D,C)|member(D,B).
% 1.69/1.89  ** KEPT (pick-wt=13): 13 [] -intersection(A,B,C)| -member(D,B)| -member(D,A)|member(D,C).
% 1.69/1.89  ** KEPT (pick-wt=22): 14 [] -member(h(A,B,C),C)| -member(h(A,B,C),B)| -member(h(A,B,C),A)|intersection(A,B,C).
% 1.69/1.89  ** KEPT (pick-wt=4): 15 [] -union(aIb,aIc,aI_bUc).
% 1.69/1.89  
% 1.69/1.89  ------------> process sos:
% 1.69/1.89  ** KEPT (pick-wt=8): 25 [] subset(A,B)|member(member_of_1_not_of_2(A,B),A).
% 37.43/37.70  ** KEPT (pick-wt=22): 26 [] union(A,B,C)|member(g(A,B,C),A)|member(g(A,B,C),B)|member(g(A,B,C),C).
% 37.43/37.70  ** KEPT (pick-wt=16): 27 [] member(h(A,B,C),C)|intersection(A,B,C)|member(h(A,B,C),A).
% 37.43/37.70  ** KEPT (pick-wt=16): 28 [] member(h(A,B,C),C)|intersection(A,B,C)|member(h(A,B,C),B).
% 37.43/37.70  ** KEPT (pick-wt=4): 29 [] union(b,c,bUc).
% 37.43/37.70  ** KEPT (pick-wt=4): 30 [] intersection(a,b,aIb).
% 37.43/37.70  ** KEPT (pick-wt=4): 31 [] intersection(a,c,aIc).
% 37.43/37.70  ** KEPT (pick-wt=4): 32 [] intersection(a,bUc,aI_bUc).
% 37.43/37.70  
% 37.43/37.70  ======= end of input processing =======
% 37.43/37.70  
% 37.43/37.70  =========== start of search ===========
% 37.43/37.70  
% 37.43/37.70  
% 37.43/37.70  Resetting weight limit to 15.
% 37.43/37.70  
% 37.43/37.70  
% 37.43/37.70  Resetting weight limit to 15.
% 37.43/37.70  
% 37.43/37.70  sos_size=4105
% 37.43/37.70  
% 37.43/37.70  
% 37.43/37.70  Resetting weight limit to 14.
% 37.43/37.70  
% 37.43/37.70  
% 37.43/37.70  Resetting weight limit to 14.
% 37.43/37.70  
% 37.43/37.70  sos_size=3715
% 37.43/37.70  
% 37.43/37.70  
% 37.43/37.70  Resetting weight limit to 13.
% 37.43/37.70  
% 37.43/37.70  
% 37.43/37.70  Resetting weight limit to 13.
% 37.43/37.70  
% 37.43/37.70  sos_size=3745
% 37.43/37.70  
% 37.43/37.70  -- HEY sandbox, WE HAVE A PROOF!! -- 
% 37.43/37.70  
% 37.43/37.70  ----> UNIT CONFLICT at  35.81 sec ----> 10562 [binary,10561.1,15.1] $F.
% 37.43/37.70  
% 37.43/37.70  Length of proof is 60.  Level of proof is 16.
% 37.43/37.70  
% 37.43/37.70  ---------------- PROOF ----------------
% 37.43/37.70  % SZS status Unsatisfiable
% 37.43/37.70  % SZS output start Refutation
% See solution above
% 37.43/37.70  ------------ end of proof -------------
% 37.43/37.70  
% 37.43/37.70  
% 37.43/37.70  Search stopped by max_proofs option.
% 37.43/37.70  
% 37.43/37.70  
% 37.43/37.70  Search stopped by max_proofs option.
% 37.43/37.70  
% 37.43/37.70  ============ end of search ============
% 37.43/37.70  
% 37.43/37.70  -------------- statistics -------------
% 37.43/37.70  clauses given               1968
% 37.43/37.70  clauses generated        2260071
% 37.43/37.70  clauses kept               10561
% 37.43/37.70  clauses forward subsumed  435100
% 37.43/37.70  clauses back subsumed       6717
% 37.43/37.70  Kbytes malloced             5859
% 37.43/37.70  
% 37.43/37.70  ----------- times (seconds) -----------
% 37.43/37.70  user CPU time         35.81          (0 hr, 0 min, 35 sec)
% 37.43/37.70  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 37.43/37.70  wall-clock time       37             (0 hr, 0 min, 37 sec)
% 37.43/37.70  
% 37.43/37.70  That finishes the proof of the theorem.
% 37.43/37.70  
% 37.43/37.70  Process 4838 finished Wed Jul 27 10:16:08 2022
% 37.43/37.70  Otter interrupted
% 37.43/37.70  PROOF FOUND
%------------------------------------------------------------------------------