TSTP Solution File: LAT300+1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : LAT300+1 : TPTP v8.1.0. Released v3.4.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:02:27 EDT 2022

% Result   : Theorem 1.82s 2.05s
% Output   : Refutation 1.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   17 (  10 unt;   4 nHn;  15 RR)
%            Number of literals    :   35 (   0 equ;  16 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-1 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ v3_struct_0(dollar_c2),
    file('LAT300+1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ m1_subset_1(A,u1_struct_0(dollar_c2))
    | ~ r2_hidden(A,dollar_c1) ),
    file('LAT300+1.p',unknown),
    [] ).

cnf(17,axiom,
    ( v3_struct_0(A)
    | ~ v10_lattices(A)
    | ~ l3_lattices(A)
    | ~ m2_filter_2(B,A)
    | ~ v1_xboole_0(B) ),
    file('LAT300+1.p',unknown),
    [] ).

cnf(18,axiom,
    ( v3_struct_0(A)
    | ~ v10_lattices(A)
    | ~ l3_lattices(A)
    | ~ m2_filter_2(B,A)
    | m2_lattice4(B,A) ),
    file('LAT300+1.p',unknown),
    [] ).

cnf(19,axiom,
    ( v3_struct_0(A)
    | ~ v10_lattices(A)
    | ~ l3_lattices(A)
    | ~ m2_lattice4(B,A)
    | m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A))) ),
    file('LAT300+1.p',unknown),
    [] ).

cnf(35,axiom,
    ( ~ m1_subset_1(A,B)
    | v1_xboole_0(B)
    | r2_hidden(A,B) ),
    file('LAT300+1.p',unknown),
    [] ).

cnf(38,axiom,
    ( ~ r2_hidden(A,B)
    | ~ m1_subset_1(B,k1_zfmisc_1(C))
    | m1_subset_1(A,C) ),
    file('LAT300+1.p',unknown),
    [] ).

cnf(47,axiom,
    v10_lattices(dollar_c2),
    file('LAT300+1.p',unknown),
    [] ).

cnf(48,axiom,
    l3_lattices(dollar_c2),
    file('LAT300+1.p',unknown),
    [] ).

cnf(49,axiom,
    m2_filter_2(dollar_c1,dollar_c2),
    file('LAT300+1.p',unknown),
    [] ).

cnf(54,axiom,
    m1_subset_1(dollar_f2(A),A),
    file('LAT300+1.p',unknown),
    [] ).

cnf(83,plain,
    m2_lattice4(dollar_c1,dollar_c2),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[49,18,47,48]),1]),
    [iquote('hyper,49,18,47,48,unit_del,1')] ).

cnf(109,plain,
    ( v1_xboole_0(A)
    | r2_hidden(dollar_f2(A),A) ),
    inference(hyper,[status(thm)],[54,35]),
    [iquote('hyper,54,35')] ).

cnf(176,plain,
    m1_subset_1(dollar_c1,k1_zfmisc_1(u1_struct_0(dollar_c2))),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[83,19,47,48]),1]),
    [iquote('hyper,83,19,47,48,unit_del,1')] ).

cnf(369,plain,
    r2_hidden(dollar_f2(dollar_c1),dollar_c1),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[109,17,47,48,49]),1]),
    [iquote('hyper,109,17,47,48,49,unit_del,1')] ).

cnf(409,plain,
    m1_subset_1(dollar_f2(dollar_c1),u1_struct_0(dollar_c2)),
    inference(hyper,[status(thm)],[176,38,369]),
    [iquote('hyper,176,38,369')] ).

cnf(463,plain,
    $false,
    inference(hyper,[status(thm)],[409,2,369]),
    [iquote('hyper,409,2,369')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LAT300+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12  % Command  : otter-tptp-script %s
% 0.13/0.33  % Computer : n021.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 08:16:23 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 1.82/2.03  ----- Otter 3.3f, August 2004 -----
% 1.82/2.03  The process was started by sandbox on n021.cluster.edu,
% 1.82/2.03  Wed Jul 27 08:16:23 2022
% 1.82/2.03  The command was "./otter".  The process ID is 29912.
% 1.82/2.03  
% 1.82/2.03  set(prolog_style_variables).
% 1.82/2.03  set(auto).
% 1.82/2.03     dependent: set(auto1).
% 1.82/2.03     dependent: set(process_input).
% 1.82/2.03     dependent: clear(print_kept).
% 1.82/2.03     dependent: clear(print_new_demod).
% 1.82/2.03     dependent: clear(print_back_demod).
% 1.82/2.03     dependent: clear(print_back_sub).
% 1.82/2.03     dependent: set(control_memory).
% 1.82/2.03     dependent: assign(max_mem, 12000).
% 1.82/2.03     dependent: assign(pick_given_ratio, 4).
% 1.82/2.03     dependent: assign(stats_level, 1).
% 1.82/2.03     dependent: assign(max_seconds, 10800).
% 1.82/2.03  clear(print_given).
% 1.82/2.03  
% 1.82/2.03  formula_list(usable).
% 1.82/2.03  all A (A=A).
% 1.82/2.03  -(all A (-v3_struct_0(A)&v10_lattices(A)&l3_lattices(A)-> (all B (m2_filter_2(B,A)-> (exists C (m1_subset_1(C,u1_struct_0(A))&r2_hidden(C,B))))))).
% 1.82/2.03  all A B (r2_hidden(A,B)-> -r2_hidden(B,A)).
% 1.82/2.03  all A (v1_xboole_0(A)->v1_funct_1(A)).
% 1.82/2.03  all A (l3_lattices(A)-> (-v3_struct_0(A)&v10_lattices(A)-> -v3_struct_0(A)&v4_lattices(A)&v5_lattices(A)&v6_lattices(A)&v7_lattices(A)&v8_lattices(A)&v9_lattices(A))).
% 1.82/2.03  all A (l3_lattices(A)-> (-v3_struct_0(A)&v4_lattices(A)&v5_lattices(A)&v6_lattices(A)&v7_lattices(A)&v8_lattices(A)&v9_lattices(A)-> -v3_struct_0(A)&v10_lattices(A))).
% 1.82/2.03  $T.
% 1.82/2.03  $T.
% 1.82/2.03  all A (l1_lattices(A)->l1_struct_0(A)).
% 1.82/2.03  $T.
% 1.82/2.03  all A (l2_lattices(A)->l1_struct_0(A)).
% 1.82/2.03  all A (l3_lattices(A)->l1_lattices(A)&l2_lattices(A)).
% 1.82/2.03  all A B (-v3_struct_0(A)&l1_struct_0(A)& -v1_xboole_0(B)&m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A)))-> (all C (m1_struct_0(C,A,B)->m1_subset_1(C,u1_struct_0(A))))).
% 1.82/2.03  $T.
% 1.82/2.03  all A (-v3_struct_0(A)&v10_lattices(A)&l3_lattices(A)-> (all B (m2_filter_2(B,A)-> -v1_xboole_0(B)&m2_lattice4(B,A)))).
% 1.82/2.03  all A (-v3_struct_0(A)&v10_lattices(A)&l3_lattices(A)-> (all B (m2_lattice4(B,A)->m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A)))))).
% 1.82/2.03  $T.
% 1.82/2.03  exists A l1_lattices(A).
% 1.82/2.03  exists A l1_struct_0(A).
% 1.82/2.03  exists A l2_lattices(A).
% 1.82/2.03  exists A l3_lattices(A).
% 1.82/2.03  all A B (-v3_struct_0(A)&l1_struct_0(A)& -v1_xboole_0(B)&m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A)))-> (exists C m1_struct_0(C,A,B))).
% 1.82/2.03  all A exists B m1_subset_1(B,A).
% 1.82/2.03  all A (-v3_struct_0(A)&v10_lattices(A)&l3_lattices(A)-> (exists B m2_filter_2(B,A))).
% 1.82/2.03  all A (-v3_struct_0(A)&v10_lattices(A)&l3_lattices(A)-> (exists B m2_lattice4(B,A))).
% 1.82/2.03  all A (-v3_struct_0(A)&l1_struct_0(A)-> -v1_xboole_0(u1_struct_0(A))).
% 1.82/2.03  all A (-v1_xboole_0(k1_zfmisc_1(A))).
% 1.82/2.03  v1_xboole_0(k1_xboole_0).
% 1.82/2.03  all A (-v3_struct_0(A)&v10_lattices(A)&l3_lattices(A)-> (exists B (m2_lattice4(B,A)& -v1_xboole_0(B)))).
% 1.82/2.03  all A (-v1_xboole_0(A)-> (exists B (m1_subset_1(B,k1_zfmisc_1(A))& -v1_xboole_0(B)))).
% 1.82/2.03  exists A v1_xboole_0(A).
% 1.82/2.03  all A exists B (m1_subset_1(B,k1_zfmisc_1(A))&v1_xboole_0(B)).
% 1.82/2.03  exists A (-v1_xboole_0(A)).
% 1.82/2.03  exists A (l1_struct_0(A)& -v3_struct_0(A)).
% 1.82/2.03  all A (-v3_struct_0(A)&l1_struct_0(A)-> (exists B (m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A)))& -v1_xboole_0(B)))).
% 1.82/2.03  all A B (-v3_struct_0(A)&l1_struct_0(A)& -v1_xboole_0(B)&m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A)))-> (all C (m1_struct_0(C,A,B)<->m1_subset_1(C,B)))).
% 1.82/2.03  all A B r1_tarski(A,A).
% 1.82/2.03  all A B (r2_hidden(A,B)->m1_subset_1(A,B)).
% 1.82/2.03  all A B (m1_subset_1(A,B)->v1_xboole_0(B)|r2_hidden(A,B)).
% 1.82/2.03  all A B (m1_subset_1(A,k1_zfmisc_1(B))<->r1_tarski(A,B)).
% 1.82/2.03  all A B C (r2_hidden(A,B)&m1_subset_1(B,k1_zfmisc_1(C))->m1_subset_1(A,C)).
% 1.82/2.03  all A B C (-(r2_hidden(A,B)&m1_subset_1(B,k1_zfmisc_1(C))&v1_xboole_0(C))).
% 1.82/2.03  all A (v1_xboole_0(A)->A=k1_xboole_0).
% 1.82/2.03  all A B (-(r2_hidden(A,B)&v1_xboole_0(B))).
% 1.82/2.03  all A B (-(v1_xboole_0(A)&A!=B&v1_xboole_0(B))).
% 1.82/2.03  end_of_list.
% 1.82/2.03  
% 1.82/2.03  -------> usable clausifies to:
% 1.82/2.03  
% 1.82/2.03  list(usable).
% 1.82/2.03  0 [] A=A.
% 1.82/2.03  0 [] -v3_struct_0($c2).
% 1.82/2.03  0 [] v10_lattices($c2).
% 1.82/2.03  0 [] l3_lattices($c2).
% 1.82/2.03  0 [] m2_filter_2($c1,$c2).
% 1.82/2.03  0 [] -m1_subset_1(C,u1_struct_0($c2))| -r2_hidden(C,$c1).
% 1.82/2.03  0 [] -r2_hidden(A,B)| -r2_hidden(B,A).
% 1.82/2.03  0 [] -v1_xboole_0(A)|v1_funct_1(A).
% 1.82/2.03  0 [] -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)|v4_lattices(A).
% 1.82/2.03  0 [] -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)|v5_lattices(A).
% 1.82/2.03  0 [] -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)|v6_lattices(A).
% 1.82/2.03  0 [] -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)|v7_lattices(A).
% 1.82/2.03  0 [] -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)|v8_lattices(A).
% 1.82/2.03  0 [] -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)|v9_lattices(A).
% 1.82/2.03  0 [] -l3_lattices(A)|v3_struct_0(A)| -v4_lattices(A)| -v5_lattices(A)| -v6_lattices(A)| -v7_lattices(A)| -v8_lattices(A)| -v9_lattices(A)|v10_lattices(A).
% 1.82/2.03  0 [] $T.
% 1.82/2.03  0 [] $T.
% 1.82/2.03  0 [] -l1_lattices(A)|l1_struct_0(A).
% 1.82/2.03  0 [] $T.
% 1.82/2.03  0 [] -l2_lattices(A)|l1_struct_0(A).
% 1.82/2.03  0 [] -l3_lattices(A)|l1_lattices(A).
% 1.82/2.03  0 [] -l3_lattices(A)|l2_lattices(A).
% 1.82/2.03  0 [] v3_struct_0(A)| -l1_struct_0(A)|v1_xboole_0(B)| -m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A)))| -m1_struct_0(C,A,B)|m1_subset_1(C,u1_struct_0(A)).
% 1.82/2.03  0 [] $T.
% 1.82/2.03  0 [] v3_struct_0(A)| -v10_lattices(A)| -l3_lattices(A)| -m2_filter_2(B,A)| -v1_xboole_0(B).
% 1.82/2.03  0 [] v3_struct_0(A)| -v10_lattices(A)| -l3_lattices(A)| -m2_filter_2(B,A)|m2_lattice4(B,A).
% 1.82/2.03  0 [] v3_struct_0(A)| -v10_lattices(A)| -l3_lattices(A)| -m2_lattice4(B,A)|m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A))).
% 1.82/2.03  0 [] $T.
% 1.82/2.03  0 [] l1_lattices($c3).
% 1.82/2.03  0 [] l1_struct_0($c4).
% 1.82/2.03  0 [] l2_lattices($c5).
% 1.82/2.03  0 [] l3_lattices($c6).
% 1.82/2.03  0 [] v3_struct_0(A)| -l1_struct_0(A)|v1_xboole_0(B)| -m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A)))|m1_struct_0($f1(A,B),A,B).
% 1.82/2.03  0 [] m1_subset_1($f2(A),A).
% 1.82/2.03  0 [] v3_struct_0(A)| -v10_lattices(A)| -l3_lattices(A)|m2_filter_2($f3(A),A).
% 1.82/2.03  0 [] v3_struct_0(A)| -v10_lattices(A)| -l3_lattices(A)|m2_lattice4($f4(A),A).
% 1.82/2.03  0 [] v3_struct_0(A)| -l1_struct_0(A)| -v1_xboole_0(u1_struct_0(A)).
% 1.82/2.03  0 [] -v1_xboole_0(k1_zfmisc_1(A)).
% 1.82/2.03  0 [] v1_xboole_0(k1_xboole_0).
% 1.82/2.03  0 [] v3_struct_0(A)| -v10_lattices(A)| -l3_lattices(A)|m2_lattice4($f5(A),A).
% 1.82/2.03  0 [] v3_struct_0(A)| -v10_lattices(A)| -l3_lattices(A)| -v1_xboole_0($f5(A)).
% 1.82/2.03  0 [] v1_xboole_0(A)|m1_subset_1($f6(A),k1_zfmisc_1(A)).
% 1.82/2.03  0 [] v1_xboole_0(A)| -v1_xboole_0($f6(A)).
% 1.82/2.03  0 [] v1_xboole_0($c7).
% 1.82/2.03  0 [] m1_subset_1($f7(A),k1_zfmisc_1(A)).
% 1.82/2.03  0 [] v1_xboole_0($f7(A)).
% 1.82/2.03  0 [] -v1_xboole_0($c8).
% 1.82/2.03  0 [] l1_struct_0($c9).
% 1.82/2.03  0 [] -v3_struct_0($c9).
% 1.82/2.03  0 [] v3_struct_0(A)| -l1_struct_0(A)|m1_subset_1($f8(A),k1_zfmisc_1(u1_struct_0(A))).
% 1.82/2.03  0 [] v3_struct_0(A)| -l1_struct_0(A)| -v1_xboole_0($f8(A)).
% 1.82/2.03  0 [] v3_struct_0(A)| -l1_struct_0(A)|v1_xboole_0(B)| -m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A)))| -m1_struct_0(C,A,B)|m1_subset_1(C,B).
% 1.82/2.03  0 [] v3_struct_0(A)| -l1_struct_0(A)|v1_xboole_0(B)| -m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A)))|m1_struct_0(C,A,B)| -m1_subset_1(C,B).
% 1.82/2.03  0 [] r1_tarski(A,A).
% 1.82/2.03  0 [] -r2_hidden(A,B)|m1_subset_1(A,B).
% 1.82/2.03  0 [] -m1_subset_1(A,B)|v1_xboole_0(B)|r2_hidden(A,B).
% 1.82/2.03  0 [] -m1_subset_1(A,k1_zfmisc_1(B))|r1_tarski(A,B).
% 1.82/2.03  0 [] m1_subset_1(A,k1_zfmisc_1(B))| -r1_tarski(A,B).
% 1.82/2.03  0 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))|m1_subset_1(A,C).
% 1.82/2.03  0 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))| -v1_xboole_0(C).
% 1.82/2.03  0 [] -v1_xboole_0(A)|A=k1_xboole_0.
% 1.82/2.03  0 [] -r2_hidden(A,B)| -v1_xboole_0(B).
% 1.82/2.03  0 [] -v1_xboole_0(A)|A=B| -v1_xboole_0(B).
% 1.82/2.03  end_of_list.
% 1.82/2.03  
% 1.82/2.03  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 1.82/2.03  
% 1.82/2.03  This ia a non-Horn set with equality.  The strategy will be
% 1.82/2.03  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.82/2.03  deletion, with positive clauses in sos and nonpositive
% 1.82/2.03  clauses in usable.
% 1.82/2.03  
% 1.82/2.03     dependent: set(knuth_bendix).
% 1.82/2.03     dependent: set(anl_eq).
% 1.82/2.03     dependent: set(para_from).
% 1.82/2.04     dependent: set(para_into).
% 1.82/2.04     dependent: clear(para_from_right).
% 1.82/2.04     dependent: clear(para_into_right).
% 1.82/2.04     dependent: set(para_from_vars).
% 1.82/2.04     dependent: set(eq_units_both_ways).
% 1.82/2.04     dependent: set(dynamic_demod_all).
% 1.82/2.04     dependent: set(dynamic_demod).
% 1.82/2.04     dependent: set(order_eq).
% 1.82/2.04     dependent: set(back_demod).
% 1.82/2.04     dependent: set(lrpo).
% 1.82/2.04     dependent: set(hyper_res).
% 1.82/2.04     dependent: set(unit_deletion).
% 1.82/2.04     dependent: set(factor).
% 1.82/2.04  
% 1.82/2.04  ------------> process usable:
% 1.82/2.04  ** KEPT (pick-wt=2): 1 [] -v3_struct_0($c2).
% 1.82/2.04  ** KEPT (pick-wt=7): 2 [] -m1_subset_1(A,u1_struct_0($c2))| -r2_hidden(A,$c1).
% 1.82/2.04  ** KEPT (pick-wt=6): 3 [] -r2_hidden(A,B)| -r2_hidden(B,A).
% 1.82/2.04  ** KEPT (pick-wt=4): 4 [] -v1_xboole_0(A)|v1_funct_1(A).
% 1.82/2.04  ** KEPT (pick-wt=8): 5 [] -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)|v4_lattices(A).
% 1.82/2.04  ** KEPT (pick-wt=8): 6 [] -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)|v5_lattices(A).
% 1.82/2.04  ** KEPT (pick-wt=8): 7 [] -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)|v6_lattices(A).
% 1.82/2.04  ** KEPT (pick-wt=8): 8 [] -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)|v7_lattices(A).
% 1.82/2.04  ** KEPT (pick-wt=8): 9 [] -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)|v8_lattices(A).
% 1.82/2.04  ** KEPT (pick-wt=8): 10 [] -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)|v9_lattices(A).
% 1.82/2.04  ** KEPT (pick-wt=18): 11 [] -l3_lattices(A)|v3_struct_0(A)| -v4_lattices(A)| -v5_lattices(A)| -v6_lattices(A)| -v7_lattices(A)| -v8_lattices(A)| -v9_lattices(A)|v10_lattices(A).
% 1.82/2.04  ** KEPT (pick-wt=4): 12 [] -l1_lattices(A)|l1_struct_0(A).
% 1.82/2.04  ** KEPT (pick-wt=4): 13 [] -l2_lattices(A)|l1_struct_0(A).
% 1.82/2.04  ** KEPT (pick-wt=4): 14 [] -l3_lattices(A)|l1_lattices(A).
% 1.82/2.04  ** KEPT (pick-wt=4): 15 [] -l3_lattices(A)|l2_lattices(A).
% 1.82/2.04  ** KEPT (pick-wt=19): 16 [] v3_struct_0(A)| -l1_struct_0(A)|v1_xboole_0(B)| -m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A)))| -m1_struct_0(C,A,B)|m1_subset_1(C,u1_struct_0(A)).
% 1.82/2.04  ** KEPT (pick-wt=11): 17 [] v3_struct_0(A)| -v10_lattices(A)| -l3_lattices(A)| -m2_filter_2(B,A)| -v1_xboole_0(B).
% 1.82/2.04  ** KEPT (pick-wt=12): 18 [] v3_struct_0(A)| -v10_lattices(A)| -l3_lattices(A)| -m2_filter_2(B,A)|m2_lattice4(B,A).
% 1.82/2.04  ** KEPT (pick-wt=14): 19 [] v3_struct_0(A)| -v10_lattices(A)| -l3_lattices(A)| -m2_lattice4(B,A)|m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A))).
% 1.82/2.04  ** KEPT (pick-wt=17): 20 [] v3_struct_0(A)| -l1_struct_0(A)|v1_xboole_0(B)| -m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A)))|m1_struct_0($f1(A,B),A,B).
% 1.82/2.04  ** KEPT (pick-wt=10): 21 [] v3_struct_0(A)| -v10_lattices(A)| -l3_lattices(A)|m2_filter_2($f3(A),A).
% 1.82/2.04  ** KEPT (pick-wt=10): 22 [] v3_struct_0(A)| -v10_lattices(A)| -l3_lattices(A)|m2_lattice4($f4(A),A).
% 1.82/2.04  ** KEPT (pick-wt=7): 23 [] v3_struct_0(A)| -l1_struct_0(A)| -v1_xboole_0(u1_struct_0(A)).
% 1.82/2.04  ** KEPT (pick-wt=3): 24 [] -v1_xboole_0(k1_zfmisc_1(A)).
% 1.82/2.04  ** KEPT (pick-wt=10): 25 [] v3_struct_0(A)| -v10_lattices(A)| -l3_lattices(A)|m2_lattice4($f5(A),A).
% 1.82/2.04  ** KEPT (pick-wt=9): 26 [] v3_struct_0(A)| -v10_lattices(A)| -l3_lattices(A)| -v1_xboole_0($f5(A)).
% 1.82/2.04  ** KEPT (pick-wt=5): 27 [] v1_xboole_0(A)| -v1_xboole_0($f6(A)).
% 1.82/2.04  ** KEPT (pick-wt=2): 28 [] -v1_xboole_0($c8).
% 1.82/2.04  ** KEPT (pick-wt=2): 29 [] -v3_struct_0($c9).
% 1.82/2.04  ** KEPT (pick-wt=10): 30 [] v3_struct_0(A)| -l1_struct_0(A)|m1_subset_1($f8(A),k1_zfmisc_1(u1_struct_0(A))).
% 1.82/2.04  ** KEPT (pick-wt=7): 31 [] v3_struct_0(A)| -l1_struct_0(A)| -v1_xboole_0($f8(A)).
% 1.82/2.04  ** KEPT (pick-wt=18): 32 [] v3_struct_0(A)| -l1_struct_0(A)|v1_xboole_0(B)| -m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A)))| -m1_struct_0(C,A,B)|m1_subset_1(C,B).
% 1.82/2.04  ** KEPT (pick-wt=18): 33 [] v3_struct_0(A)| -l1_struct_0(A)|v1_xboole_0(B)| -m1_subset_1(B,k1_zfmisc_1(u1_struct_0(A)))|m1_struct_0(C,A,B)| -m1_subset_1(C,B).
% 1.82/2.04  ** KEPT (pick-wt=6): 34 [] -r2_hidden(A,B)|m1_subset_1(A,B).
% 1.82/2.04  ** KEPT (pick-wt=8): 35 [] -m1_subset_1(A,B)|v1_xboole_0(B)|r2_hidden(A,B).
% 1.82/2.04  ** KEPT (pick-wt=7): 36 [] -m1_subset_1(A,k1_zfmisc_1(B))|r1_tarski(A,B).
% 1.82/2.04  ** KEPT (pick-wt=7): 37 [] m1_subset_1(A,k1_zfmisc_1(B))| -r1_tarski(A,B).
% 1.82/2.04  ** KEPT (pick-wt=10): 38 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))|m1_subset_1(A,C).
% 1.82/2.04  ** KEPT (pick-wt=9): 39 [] -r2_hidden(A,B)| -m1_subset_1(B,k1_zfmisc_1(C))| -v1_xboole_0(C).
% 1.82/2.04  ** KEPT (pick-wt=5): 40 [] -v1_xboole_0(A)|A=k1_xboole_0.
% 1.82/2.04  ** KEPT (pick-wt=5): 41 [] -r2_hidden(A,B)| -v1_xboole_0(B).
% 1.82/2.04  ** KEPT (pick-wt=7): 42 [] -v1_xboole_0(A)|A=B| -v1_xboole_0(B).
% 1.82/2.04  
% 1.82/2.04  ------------> process sos:
% 1.82/2.04  ** KEPT (pick-wt=3): 46 [] A=A.
% 1.82/2.04  ** KEPT (pick-wt=2): 47 [] v10_lattices($c2).
% 1.82/2.04  ** KEPT (pick-wt=2): 48 [] l3_lattices($c2).
% 1.82/2.04  ** KEPT (pick-wt=3): 49 [] m2_filter_2($c1,$c2).
% 1.82/2.04  ** KEPT (pick-wt=2): 50 [] l1_lattices($c3).
% 1.82/2.04  ** KEPT (pick-wt=2): 51 [] l1_struct_0($c4).
% 1.82/2.04  ** KEPT (pick-wt=2): 52 [] l2_lattices($c5).
% 1.82/2.04  ** KEPT (pick-wt=2): 53 [] l3_lattices($c6).
% 1.82/2.04  ** KEPT (pick-wt=4): 54 [] m1_subset_1($f2(A),A).
% 1.82/2.04  ** KEPT (pick-wt=2): 55 [] v1_xboole_0(k1_xboole_0).
% 1.82/2.04  ** KEPT (pick-wt=7): 56 [] v1_xboole_0(A)|m1_subset_1($f6(A),k1_zfmisc_1(A)).
% 1.82/2.04  ** KEPT (pick-wt=2): 57 [] v1_xboole_0($c7).
% 1.82/2.04  ** KEPT (pick-wt=5): 58 [] m1_subset_1($f7(A),k1_zfmisc_1(A)).
% 1.82/2.04  ** KEPT (pick-wt=3): 59 [] v1_xboole_0($f7(A)).
% 1.82/2.04  ** KEPT (pick-wt=2): 60 [] l1_struct_0($c9).
% 1.82/2.04  ** KEPT (pick-wt=3): 61 [] r1_tarski(A,A).
% 1.82/2.04    Following clause subsumed by 46 during input processing: 0 [copy,46,flip.1] A=A.
% 1.82/2.05  46 back subsumes 45.
% 1.82/2.05  
% 1.82/2.05  ======= end of input processing =======
% 1.82/2.05  
% 1.82/2.05  =========== start of search ===========
% 1.82/2.05  
% 1.82/2.05  -------- PROOF -------- 
% 1.82/2.05  
% 1.82/2.05  -----> EMPTY CLAUSE at   0.01 sec ----> 463 [hyper,409,2,369] $F.
% 1.82/2.05  
% 1.82/2.05  Length of proof is 5.  Level of proof is 3.
% 1.82/2.05  
% 1.82/2.05  ---------------- PROOF ----------------
% 1.82/2.05  % SZS status Theorem
% 1.82/2.05  % SZS output start Refutation
% See solution above
% 1.82/2.05  ------------ end of proof -------------
% 1.82/2.05  
% 1.82/2.05  
% 1.82/2.05  Search stopped by max_proofs option.
% 1.82/2.05  
% 1.82/2.05  
% 1.82/2.05  Search stopped by max_proofs option.
% 1.82/2.05  
% 1.82/2.05  ============ end of search ============
% 1.82/2.05  
% 1.82/2.05  -------------- statistics -------------
% 1.82/2.05  clauses given                 97
% 1.82/2.05  clauses generated            890
% 1.82/2.05  clauses kept                 460
% 1.82/2.05  clauses forward subsumed     493
% 1.82/2.05  clauses back subsumed          4
% 1.82/2.05  Kbytes malloced             2929
% 1.82/2.05  
% 1.82/2.05  ----------- times (seconds) -----------
% 1.82/2.05  user CPU time          0.01          (0 hr, 0 min, 0 sec)
% 1.82/2.05  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.82/2.05  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.82/2.05  
% 1.82/2.05  That finishes the proof of the theorem.
% 1.82/2.05  
% 1.82/2.05  Process 29912 finished Wed Jul 27 08:16:24 2022
% 1.82/2.05  Otter interrupted
% 1.82/2.05  PROOF FOUND
%------------------------------------------------------------------------------