↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEU395+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 02:24:58 PM UTC 2026

% Result   : Theorem 0.33s 1.10s
% Output   : CNFRefutation 0.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   60 (  13 unt;   0 def)
%            Number of atoms       :  445 (   5 equ)
%            Maximal formula atoms :   50 (   7 avg)
%            Number of connectives :  599 ( 214   ~; 229   |; 122   &)
%                                         (   5 <=>;  29  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   7 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :   18 (  16 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-3 aty)
%            Number of variables   :   84 (   0 sgn  58   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t18_yellow19,conjecture,
    ! [X1] :
      ( ( top_str(X1)
        & topological_space(X1)
        & ~ empty_carrier(X1) )
     => ! [X2] :
          ( ( element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
            & proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
            & upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
            & filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
            & ~ empty(X2) )
         => ! [X3] :
              ( element(X3,the_carrier(X1))
             => ( in(X3,lim_points_of_net(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)))
              <=> is_a_convergence_point_of_set(X1,X2,X3) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t18_yellow19) ).

fof(t15_yellow19,axiom,
    ! [X1] :
      ( ( one_sorted_str(X1)
        & ~ empty_carrier(X1) )
     => ! [X2] :
          ( ( element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
            & proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
            & upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
            & filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
            & ~ empty(X2) )
         => X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_yellow19) ).

fof(dt_l1_pre_topc,axiom,
    ! [X1] :
      ( top_str(X1)
     => one_sorted_str(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_l1_pre_topc) ).

fof(t13_yellow19,axiom,
    ! [X1] :
      ( ( top_str(X1)
        & topological_space(X1)
        & ~ empty_carrier(X1) )
     => ! [X2] :
          ( ( net_str(X2,X1)
            & directed_relstr(X2)
            & transitive_relstr(X2)
            & ~ empty_carrier(X2) )
         => ! [X3] :
              ( element(X3,the_carrier(X1))
             => ( in(X3,lim_points_of_net(X1,X2))
              <=> is_a_convergence_point_of_set(X1,filter_of_net_str(X1,X2),X3) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_yellow19) ).

fof(fc5_yellow19,axiom,
    ! [X1,X2,X3] :
      ( ( element(X3,powerset(the_carrier(boole_POSet(X2))))
        & proper_element(X3,powerset(the_carrier(boole_POSet(X2))))
        & upper_relstr_subset(X3,boole_POSet(X2))
        & filtered_subset(X3,boole_POSet(X2))
        & ~ empty(X3)
        & element(X2,powerset(the_carrier(X1)))
        & ~ empty(X2)
        & one_sorted_str(X1)
        & ~ empty_carrier(X1) )
     => ( directed_relstr(net_of_bool_filter(X1,X2,X3))
        & strict_net_str(net_of_bool_filter(X1,X2,X3),X1)
        & transitive_relstr(net_of_bool_filter(X1,X2,X3))
        & reflexive_relstr(net_of_bool_filter(X1,X2,X3))
        & ~ empty_carrier(net_of_bool_filter(X1,X2,X3)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc5_yellow19) ).

fof(dt_k3_yellow19,axiom,
    ! [X1,X2,X3] :
      ( ( element(X3,powerset(the_carrier(boole_POSet(X2))))
        & upper_relstr_subset(X3,boole_POSet(X2))
        & filtered_subset(X3,boole_POSet(X2))
        & ~ empty(X3)
        & element(X2,powerset(the_carrier(X1)))
        & ~ empty(X2)
        & one_sorted_str(X1)
        & ~ empty_carrier(X1) )
     => ( net_str(net_of_bool_filter(X1,X2,X3),X1)
        & strict_net_str(net_of_bool_filter(X1,X2,X3),X1)
        & ~ empty_carrier(net_of_bool_filter(X1,X2,X3)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k3_yellow19) ).

fof(fc4_yellow19,axiom,
    ! [X1,X2,X3] :
      ( ( element(X3,powerset(the_carrier(boole_POSet(X2))))
        & upper_relstr_subset(X3,boole_POSet(X2))
        & filtered_subset(X3,boole_POSet(X2))
        & ~ empty(X3)
        & element(X2,powerset(the_carrier(X1)))
        & ~ empty(X2)
        & one_sorted_str(X1)
        & ~ empty_carrier(X1) )
     => ( strict_net_str(net_of_bool_filter(X1,X2,X3),X1)
        & transitive_relstr(net_of_bool_filter(X1,X2,X3))
        & reflexive_relstr(net_of_bool_filter(X1,X2,X3))
        & ~ empty_carrier(net_of_bool_filter(X1,X2,X3)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc4_yellow19) ).

fof(fc2_pre_topc,axiom,
    ! [X1] :
      ( ( one_sorted_str(X1)
        & ~ empty_carrier(X1) )
     => ~ empty(cast_as_carrier_subset(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc2_pre_topc) ).

fof(dt_k2_pre_topc,axiom,
    ! [X1] :
      ( one_sorted_str(X1)
     => element(cast_as_carrier_subset(X1),powerset(the_carrier(X1))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_pre_topc) ).

fof(c_0_9,negated_conjecture,
    ~ ! [X1] :
        ( ( top_str(X1)
          & topological_space(X1)
          & ~ empty_carrier(X1) )
       => ! [X2] :
            ( ( element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
              & proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
              & upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
              & filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
              & ~ empty(X2) )
           => ! [X3] :
                ( element(X3,the_carrier(X1))
               => ( in(X3,lim_points_of_net(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)))
                <=> is_a_convergence_point_of_set(X1,X2,X3) ) ) ) ),
    inference(assume_negation,[status(cth)],[t18_yellow19]) ).

fof(c_0_10,negated_conjecture,
    ~ ! [X1] :
        ( ( top_str(X1)
          & topological_space(X1)
          & ~ empty_carrier(X1) )
       => ! [X2] :
            ( ( element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
              & proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
              & upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
              & filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
              & ~ empty(X2) )
           => ! [X3] :
                ( element(X3,the_carrier(X1))
               => ( in(X3,lim_points_of_net(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)))
                <=> is_a_convergence_point_of_set(X1,X2,X3) ) ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_9]) ).

fof(c_0_11,plain,
    ! [X1] :
      ( ( one_sorted_str(X1)
        & ~ empty_carrier(X1) )
     => ! [X2] :
          ( ( element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
            & proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
            & upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
            & filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
            & ~ empty(X2) )
         => X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
    inference(fof_simplification,[status(thm)],[t15_yellow19]) ).

fof(c_0_12,plain,
    ! [X65] :
      ( one_sorted_str(X65)
      | ~ top_str(X65) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])])]) ).

fof(c_0_13,negated_conjecture,
    ( ( is_a_convergence_point_of_set(esk46_0,esk47_0,esk48_0)
      | in(esk48_0,lim_points_of_net(esk46_0,net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))) )
    & ( ~ is_a_convergence_point_of_set(esk46_0,esk47_0,esk48_0)
      | ~ in(esk48_0,lim_points_of_net(esk46_0,net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))) )
    & element(esk48_0,the_carrier(esk46_0))
    & element(esk47_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk46_0)))))
    & proper_element(esk47_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk46_0)))))
    & upper_relstr_subset(esk47_0,boole_POSet(cast_as_carrier_subset(esk46_0)))
    & filtered_subset(esk47_0,boole_POSet(cast_as_carrier_subset(esk46_0)))
    & ~ empty(esk47_0)
    & top_str(esk46_0)
    & topological_space(esk46_0)
    & ~ empty_carrier(esk46_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).

fof(c_0_14,plain,
    ! [X1] :
      ( ( top_str(X1)
        & topological_space(X1)
        & ~ empty_carrier(X1) )
     => ! [X2] :
          ( ( net_str(X2,X1)
            & directed_relstr(X2)
            & transitive_relstr(X2)
            & ~ empty_carrier(X2) )
         => ! [X3] :
              ( element(X3,the_carrier(X1))
             => ( in(X3,lim_points_of_net(X1,X2))
              <=> is_a_convergence_point_of_set(X1,filter_of_net_str(X1,X2),X3) ) ) ) ),
    inference(fof_simplification,[status(thm)],[t13_yellow19]) ).

fof(c_0_15,plain,
    ! [X209,X210] :
      ( X210 = filter_of_net_str(X209,net_of_bool_filter(X209,cast_as_carrier_subset(X209),X210))
      | ~ element(X210,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X209)))))
      | ~ proper_element(X210,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X209)))))
      | ~ upper_relstr_subset(X210,boole_POSet(cast_as_carrier_subset(X209)))
      | ~ filtered_subset(X210,boole_POSet(cast_as_carrier_subset(X209)))
      | empty(X210)
      | ~ one_sorted_str(X209)
      | empty_carrier(X209) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).

cnf(c_0_16,plain,
    ( ~ top_str(X1)
    | one_sorted_str(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,negated_conjecture,
    top_str(esk46_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_18,plain,
    ! [X206,X207,X208] :
      ( ( ~ top_str(X206)
        | ~ topological_space(X206)
        | empty_carrier(X206)
        | ~ net_str(X207,X206)
        | ~ directed_relstr(X207)
        | ~ transitive_relstr(X207)
        | empty_carrier(X207)
        | ~ element(X208,the_carrier(X206))
        | in(X208,lim_points_of_net(X206,X207))
        | ~ is_a_convergence_point_of_set(X206,filter_of_net_str(X206,X207),X208) )
      & ( ~ top_str(X206)
        | ~ topological_space(X206)
        | empty_carrier(X206)
        | ~ net_str(X207,X206)
        | ~ directed_relstr(X207)
        | ~ transitive_relstr(X207)
        | empty_carrier(X207)
        | ~ element(X208,the_carrier(X206))
        | is_a_convergence_point_of_set(X206,filter_of_net_str(X206,X207),X208)
        | ~ in(X208,lim_points_of_net(X206,X207)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])]) ).

cnf(c_0_19,plain,
    ( ~ element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
    | ~ proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
    | ~ upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
    | ~ filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
    | ~ one_sorted_str(X1)
    | X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2))
    | empty(X2)
    | empty_carrier(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    proper_element(esk47_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk46_0))))),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_21,negated_conjecture,
    upper_relstr_subset(esk47_0,boole_POSet(cast_as_carrier_subset(esk46_0))),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_22,negated_conjecture,
    filtered_subset(esk47_0,boole_POSet(cast_as_carrier_subset(esk46_0))),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_23,negated_conjecture,
    element(esk47_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk46_0))))),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_24,negated_conjecture,
    ~ empty(esk47_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_25,negated_conjecture,
    ~ empty_carrier(esk46_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_26,negated_conjecture,
    one_sorted_str(esk46_0),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_27,plain,
    ( ~ top_str(X2)
    | ~ topological_space(X2)
    | ~ net_str(X3,X2)
    | ~ directed_relstr(X3)
    | ~ transitive_relstr(X3)
    | ~ element(X1,the_carrier(X2))
    | ~ in(X1,lim_points_of_net(X2,X3))
    | empty_carrier(X2)
    | empty_carrier(X3)
    | is_a_convergence_point_of_set(X2,filter_of_net_str(X2,X3),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_28,negated_conjecture,
    filter_of_net_str(esk46_0,net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0)) = esk47_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]),c_0_23])]),c_0_24]),c_0_25]),c_0_26])]) ).

cnf(c_0_29,negated_conjecture,
    topological_space(esk46_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_30,plain,
    ! [X1,X2,X3] :
      ( ( element(X3,powerset(the_carrier(boole_POSet(X2))))
        & proper_element(X3,powerset(the_carrier(boole_POSet(X2))))
        & upper_relstr_subset(X3,boole_POSet(X2))
        & filtered_subset(X3,boole_POSet(X2))
        & ~ empty(X3)
        & element(X2,powerset(the_carrier(X1)))
        & ~ empty(X2)
        & one_sorted_str(X1)
        & ~ empty_carrier(X1) )
     => ( directed_relstr(net_of_bool_filter(X1,X2,X3))
        & strict_net_str(net_of_bool_filter(X1,X2,X3),X1)
        & transitive_relstr(net_of_bool_filter(X1,X2,X3))
        & reflexive_relstr(net_of_bool_filter(X1,X2,X3))
        & ~ empty_carrier(net_of_bool_filter(X1,X2,X3)) ) ),
    inference(fof_simplification,[status(thm)],[fc5_yellow19]) ).

cnf(c_0_31,plain,
    ( ~ top_str(X1)
    | ~ topological_space(X1)
    | ~ net_str(X2,X1)
    | ~ directed_relstr(X2)
    | ~ transitive_relstr(X2)
    | ~ element(X3,the_carrier(X1))
    | ~ is_a_convergence_point_of_set(X1,filter_of_net_str(X1,X2),X3)
    | empty_carrier(X1)
    | empty_carrier(X2)
    | in(X3,lim_points_of_net(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ is_a_convergence_point_of_set(esk46_0,esk47_0,esk48_0)
    | ~ in(esk48_0,lim_points_of_net(esk46_0,net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ net_str(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0),esk46_0)
    | ~ in(X1,lim_points_of_net(esk46_0,net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0)))
    | ~ transitive_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
    | ~ element(X1,the_carrier(esk46_0))
    | ~ directed_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
    | empty_carrier(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
    | is_a_convergence_point_of_set(esk46_0,esk47_0,X1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_17]),c_0_29])]),c_0_25]) ).

cnf(c_0_34,negated_conjecture,
    element(esk48_0,the_carrier(esk46_0)),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_35,plain,
    ! [X112,X113,X114] :
      ( ( ~ element(X114,powerset(the_carrier(boole_POSet(X113))))
        | ~ proper_element(X114,powerset(the_carrier(boole_POSet(X113))))
        | ~ upper_relstr_subset(X114,boole_POSet(X113))
        | ~ filtered_subset(X114,boole_POSet(X113))
        | empty(X114)
        | ~ element(X113,powerset(the_carrier(X112)))
        | empty(X113)
        | ~ one_sorted_str(X112)
        | empty_carrier(X112)
        | directed_relstr(net_of_bool_filter(X112,X113,X114)) )
      & ( ~ element(X114,powerset(the_carrier(boole_POSet(X113))))
        | ~ proper_element(X114,powerset(the_carrier(boole_POSet(X113))))
        | ~ upper_relstr_subset(X114,boole_POSet(X113))
        | ~ filtered_subset(X114,boole_POSet(X113))
        | empty(X114)
        | ~ element(X113,powerset(the_carrier(X112)))
        | empty(X113)
        | ~ one_sorted_str(X112)
        | empty_carrier(X112)
        | strict_net_str(net_of_bool_filter(X112,X113,X114),X112) )
      & ( ~ element(X114,powerset(the_carrier(boole_POSet(X113))))
        | ~ proper_element(X114,powerset(the_carrier(boole_POSet(X113))))
        | ~ upper_relstr_subset(X114,boole_POSet(X113))
        | ~ filtered_subset(X114,boole_POSet(X113))
        | empty(X114)
        | ~ element(X113,powerset(the_carrier(X112)))
        | empty(X113)
        | ~ one_sorted_str(X112)
        | empty_carrier(X112)
        | transitive_relstr(net_of_bool_filter(X112,X113,X114)) )
      & ( ~ element(X114,powerset(the_carrier(boole_POSet(X113))))
        | ~ proper_element(X114,powerset(the_carrier(boole_POSet(X113))))
        | ~ upper_relstr_subset(X114,boole_POSet(X113))
        | ~ filtered_subset(X114,boole_POSet(X113))
        | empty(X114)
        | ~ element(X113,powerset(the_carrier(X112)))
        | empty(X113)
        | ~ one_sorted_str(X112)
        | empty_carrier(X112)
        | reflexive_relstr(net_of_bool_filter(X112,X113,X114)) )
      & ( ~ element(X114,powerset(the_carrier(boole_POSet(X113))))
        | ~ proper_element(X114,powerset(the_carrier(boole_POSet(X113))))
        | ~ upper_relstr_subset(X114,boole_POSet(X113))
        | ~ filtered_subset(X114,boole_POSet(X113))
        | empty(X114)
        | ~ element(X113,powerset(the_carrier(X112)))
        | empty(X113)
        | ~ one_sorted_str(X112)
        | empty_carrier(X112)
        | ~ empty_carrier(net_of_bool_filter(X112,X113,X114)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])]) ).

cnf(c_0_36,negated_conjecture,
    ( ~ net_str(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0),esk46_0)
    | ~ transitive_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
    | ~ element(X1,the_carrier(esk46_0))
    | ~ directed_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
    | ~ is_a_convergence_point_of_set(esk46_0,esk47_0,X1)
    | in(X1,lim_points_of_net(esk46_0,net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0)))
    | empty_carrier(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_17]),c_0_29])]),c_0_25]) ).

cnf(c_0_37,negated_conjecture,
    ( is_a_convergence_point_of_set(esk46_0,esk47_0,esk48_0)
    | in(esk48_0,lim_points_of_net(esk46_0,net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_38,negated_conjecture,
    ( ~ net_str(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0),esk46_0)
    | ~ in(esk48_0,lim_points_of_net(esk46_0,net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0)))
    | ~ transitive_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
    | ~ directed_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
    | empty_carrier(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).

cnf(c_0_39,plain,
    ( ~ element(X3,powerset(the_carrier(boole_POSet(X2))))
    | ~ proper_element(X3,powerset(the_carrier(boole_POSet(X2))))
    | ~ upper_relstr_subset(X3,boole_POSet(X2))
    | ~ filtered_subset(X3,boole_POSet(X2))
    | ~ element(X2,powerset(the_carrier(X1)))
    | ~ one_sorted_str(X1)
    | empty(X3)
    | empty(X2)
    | empty_carrier(X1)
    | directed_relstr(net_of_bool_filter(X1,X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

fof(c_0_40,plain,
    ! [X1,X2,X3] :
      ( ( element(X3,powerset(the_carrier(boole_POSet(X2))))
        & upper_relstr_subset(X3,boole_POSet(X2))
        & filtered_subset(X3,boole_POSet(X2))
        & ~ empty(X3)
        & element(X2,powerset(the_carrier(X1)))
        & ~ empty(X2)
        & one_sorted_str(X1)
        & ~ empty_carrier(X1) )
     => ( net_str(net_of_bool_filter(X1,X2,X3),X1)
        & strict_net_str(net_of_bool_filter(X1,X2,X3),X1)
        & ~ empty_carrier(net_of_bool_filter(X1,X2,X3)) ) ),
    inference(fof_simplification,[status(thm)],[dt_k3_yellow19]) ).

cnf(c_0_41,negated_conjecture,
    ( ~ net_str(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0),esk46_0)
    | ~ transitive_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
    | ~ directed_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
    | empty_carrier(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0)) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_34])]),c_0_38]) ).

cnf(c_0_42,negated_conjecture,
    ( ~ one_sorted_str(X1)
    | ~ element(cast_as_carrier_subset(esk46_0),powerset(the_carrier(X1)))
    | empty_carrier(X1)
    | empty(cast_as_carrier_subset(esk46_0))
    | directed_relstr(net_of_bool_filter(X1,cast_as_carrier_subset(esk46_0),esk47_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_20]),c_0_21]),c_0_22]),c_0_23])]),c_0_24]) ).

fof(c_0_43,plain,
    ! [X60,X61,X62] :
      ( ( ~ element(X62,powerset(the_carrier(boole_POSet(X61))))
        | ~ upper_relstr_subset(X62,boole_POSet(X61))
        | ~ filtered_subset(X62,boole_POSet(X61))
        | empty(X62)
        | ~ element(X61,powerset(the_carrier(X60)))
        | empty(X61)
        | ~ one_sorted_str(X60)
        | empty_carrier(X60)
        | net_str(net_of_bool_filter(X60,X61,X62),X60) )
      & ( ~ element(X62,powerset(the_carrier(boole_POSet(X61))))
        | ~ upper_relstr_subset(X62,boole_POSet(X61))
        | ~ filtered_subset(X62,boole_POSet(X61))
        | empty(X62)
        | ~ element(X61,powerset(the_carrier(X60)))
        | empty(X61)
        | ~ one_sorted_str(X60)
        | empty_carrier(X60)
        | strict_net_str(net_of_bool_filter(X60,X61,X62),X60) )
      & ( ~ element(X62,powerset(the_carrier(boole_POSet(X61))))
        | ~ upper_relstr_subset(X62,boole_POSet(X61))
        | ~ filtered_subset(X62,boole_POSet(X61))
        | empty(X62)
        | ~ element(X61,powerset(the_carrier(X60)))
        | empty(X61)
        | ~ one_sorted_str(X60)
        | empty_carrier(X60)
        | ~ empty_carrier(net_of_bool_filter(X60,X61,X62)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])])]) ).

fof(c_0_44,plain,
    ! [X1,X2,X3] :
      ( ( element(X3,powerset(the_carrier(boole_POSet(X2))))
        & upper_relstr_subset(X3,boole_POSet(X2))
        & filtered_subset(X3,boole_POSet(X2))
        & ~ empty(X3)
        & element(X2,powerset(the_carrier(X1)))
        & ~ empty(X2)
        & one_sorted_str(X1)
        & ~ empty_carrier(X1) )
     => ( strict_net_str(net_of_bool_filter(X1,X2,X3),X1)
        & transitive_relstr(net_of_bool_filter(X1,X2,X3))
        & reflexive_relstr(net_of_bool_filter(X1,X2,X3))
        & ~ empty_carrier(net_of_bool_filter(X1,X2,X3)) ) ),
    inference(fof_simplification,[status(thm)],[fc4_yellow19]) ).

cnf(c_0_45,negated_conjecture,
    ( ~ net_str(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0),esk46_0)
    | ~ transitive_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
    | ~ element(cast_as_carrier_subset(esk46_0),powerset(the_carrier(esk46_0)))
    | empty_carrier(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
    | empty(cast_as_carrier_subset(esk46_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_26])]),c_0_25]) ).

cnf(c_0_46,plain,
    ( ~ element(X3,powerset(the_carrier(boole_POSet(X2))))
    | ~ upper_relstr_subset(X3,boole_POSet(X2))
    | ~ filtered_subset(X3,boole_POSet(X2))
    | ~ element(X2,powerset(the_carrier(X1)))
    | ~ one_sorted_str(X1)
    | empty(X3)
    | empty(X2)
    | empty_carrier(X1)
    | net_str(net_of_bool_filter(X1,X2,X3),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

fof(c_0_47,plain,
    ! [X107,X108,X109] :
      ( ( ~ element(X109,powerset(the_carrier(boole_POSet(X108))))
        | ~ upper_relstr_subset(X109,boole_POSet(X108))
        | ~ filtered_subset(X109,boole_POSet(X108))
        | empty(X109)
        | ~ element(X108,powerset(the_carrier(X107)))
        | empty(X108)
        | ~ one_sorted_str(X107)
        | empty_carrier(X107)
        | strict_net_str(net_of_bool_filter(X107,X108,X109),X107) )
      & ( ~ element(X109,powerset(the_carrier(boole_POSet(X108))))
        | ~ upper_relstr_subset(X109,boole_POSet(X108))
        | ~ filtered_subset(X109,boole_POSet(X108))
        | empty(X109)
        | ~ element(X108,powerset(the_carrier(X107)))
        | empty(X108)
        | ~ one_sorted_str(X107)
        | empty_carrier(X107)
        | transitive_relstr(net_of_bool_filter(X107,X108,X109)) )
      & ( ~ element(X109,powerset(the_carrier(boole_POSet(X108))))
        | ~ upper_relstr_subset(X109,boole_POSet(X108))
        | ~ filtered_subset(X109,boole_POSet(X108))
        | empty(X109)
        | ~ element(X108,powerset(the_carrier(X107)))
        | empty(X108)
        | ~ one_sorted_str(X107)
        | empty_carrier(X107)
        | reflexive_relstr(net_of_bool_filter(X107,X108,X109)) )
      & ( ~ element(X109,powerset(the_carrier(boole_POSet(X108))))
        | ~ upper_relstr_subset(X109,boole_POSet(X108))
        | ~ filtered_subset(X109,boole_POSet(X108))
        | empty(X109)
        | ~ element(X108,powerset(the_carrier(X107)))
        | empty(X108)
        | ~ one_sorted_str(X107)
        | empty_carrier(X107)
        | ~ empty_carrier(net_of_bool_filter(X107,X108,X109)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_44])])])]) ).

cnf(c_0_48,negated_conjecture,
    ( ~ transitive_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
    | ~ element(cast_as_carrier_subset(esk46_0),powerset(the_carrier(esk46_0)))
    | empty_carrier(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
    | empty(cast_as_carrier_subset(esk46_0)) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_21]),c_0_22]),c_0_23]),c_0_26])]),c_0_24]),c_0_25]) ).

cnf(c_0_49,plain,
    ( ~ element(X3,powerset(the_carrier(boole_POSet(X2))))
    | ~ upper_relstr_subset(X3,boole_POSet(X2))
    | ~ filtered_subset(X3,boole_POSet(X2))
    | ~ element(X2,powerset(the_carrier(X1)))
    | ~ one_sorted_str(X1)
    | empty(X3)
    | empty(X2)
    | empty_carrier(X1)
    | transitive_relstr(net_of_bool_filter(X1,X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_47]) ).

fof(c_0_50,plain,
    ! [X1] :
      ( ( one_sorted_str(X1)
        & ~ empty_carrier(X1) )
     => ~ empty(cast_as_carrier_subset(X1)) ),
    inference(fof_simplification,[status(thm)],[fc2_pre_topc]) ).

cnf(c_0_51,plain,
    ( ~ element(X3,powerset(the_carrier(boole_POSet(X2))))
    | ~ upper_relstr_subset(X3,boole_POSet(X2))
    | ~ filtered_subset(X3,boole_POSet(X2))
    | ~ element(X2,powerset(the_carrier(X1)))
    | ~ one_sorted_str(X1)
    | ~ empty_carrier(net_of_bool_filter(X1,X2,X3))
    | empty(X3)
    | empty(X2)
    | empty_carrier(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_52,negated_conjecture,
    ( ~ element(cast_as_carrier_subset(esk46_0),powerset(the_carrier(esk46_0)))
    | empty_carrier(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
    | empty(cast_as_carrier_subset(esk46_0)) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_21]),c_0_22]),c_0_23]),c_0_26])]),c_0_24]),c_0_25]) ).

fof(c_0_53,plain,
    ! [X57] :
      ( element(cast_as_carrier_subset(X57),powerset(the_carrier(X57)))
      | ~ one_sorted_str(X57) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_pre_topc])])]) ).

fof(c_0_54,plain,
    ! [X95] :
      ( ~ empty(cast_as_carrier_subset(X95))
      | ~ one_sorted_str(X95)
      | empty_carrier(X95) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_50])])]) ).

cnf(c_0_55,negated_conjecture,
    ( ~ element(cast_as_carrier_subset(esk46_0),powerset(the_carrier(esk46_0)))
    | empty(cast_as_carrier_subset(esk46_0)) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_21]),c_0_22]),c_0_23]),c_0_26])]),c_0_24]),c_0_25]) ).

cnf(c_0_56,plain,
    ( ~ one_sorted_str(X1)
    | element(cast_as_carrier_subset(X1),powerset(the_carrier(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_53]) ).

cnf(c_0_57,plain,
    ( ~ empty(cast_as_carrier_subset(X1))
    | ~ one_sorted_str(X1)
    | empty_carrier(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_54]) ).

cnf(c_0_58,negated_conjecture,
    empty(cast_as_carrier_subset(esk46_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_26])]) ).

cnf(c_0_59,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_26])]),c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SEU395+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46  % Computer : n014.cluster.edu
% 0.19/0.46  % Model    : x86_64 x86_64
% 0.19/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46  % Memory   : 8046.5625MB
% 0.19/0.46  % OS       : Linux 6.8.0-71-generic
% 0.19/0.46  % CPULimit : 300
% 0.19/0.46  % WCLimit  : 300
% 0.19/0.46  % DateTime : Mon Sep 21 06:19:21 UTC 2026
% 0.19/0.46  % CPUTime  : 
% 0.19/0.47  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.54  Running first-order theorem proving
% 0.24/0.54  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.33/1.10  % Version: 3.5.1
% 0.33/1.10  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.33/1.10  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/1.10  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.33/1.10  % Starting new_bool_3 with 300s (1) cores
% 0.33/1.10  % Starting new_bool_1 with 300s (1) cores
% 0.33/1.10  % Starting sh5l with 300s (1) cores
% 0.33/1.10  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3320066 completed with status 0
% 0.33/1.10  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.33/1.10  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.33/1.10  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/1.10  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.33/1.10  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/1.10  % No SInE strategy applied
% 0.33/1.10  % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.33/1.10  % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/1.10  % Starting SubtermCWHack with 136s (1) cores
% 0.33/1.10  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.33/1.10  % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.33/1.10  % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.33/1.10  % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.33/1.10  % G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with pid 3320075 completed with status 0
% 0.33/1.10  % Result found by G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y
% 0.33/1.10  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.33/1.10  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/1.10  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.33/1.10  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/1.10  % No SInE strategy applied
% 0.33/1.10  % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.33/1.10  % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/1.10  % Starting SubtermCWHack with 136s (1) cores
% 0.33/1.10  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.33/1.10  % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.33/1.10  % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.33/1.10  % Preprocessing time       : 0.009 s
% 0.33/1.10  % Presaturation interreduction done
% 0.33/1.10  
% 0.33/1.10  % Proof found!
% 0.33/1.10  % SZS status Theorem
% 0.33/1.10  % SZS output start CNFRefutation
% See solution above
% 0.33/1.10  % Parsed axioms                        : 136
% 0.33/1.10  % Removed by relevancy pruning/SinE    : 0
% 0.33/1.10  % Initial clauses                      : 443
% 0.33/1.10  % Removed in clause preprocessing      : 35
% 0.33/1.10  % Initial clauses in saturation        : 408
% 0.33/1.10  % Processed clauses                    : 2142
% 0.33/1.10  % ...of these trivial                  : 53
% 0.33/1.10  % ...subsumed                          : 898
% 0.33/1.10  % ...remaining for further processing  : 1191
% 0.33/1.10  % Other redundant clauses eliminated   : 4
% 0.33/1.10  % Clauses deleted for lack of memory   : 0
% 0.33/1.10  % Backward-subsumed                    : 58
% 0.33/1.10  % Backward-rewritten                   : 12
% 0.33/1.10  % Generated clauses                    : 4019
% 0.33/1.10  % ...of the previous two non-redundant : 3751
% 0.33/1.10  % ...aggressively subsumed             : 0
% 0.33/1.10  % Contextual simplify-reflections      : 47
% 0.33/1.10  % Paramodulations                      : 4004
% 0.33/1.10  % Factorizations                       : 2
% 0.33/1.10  % NegExts                              : 0
% 0.33/1.10  % Equation resolutions                 : 13
% 0.33/1.10  % Disequality decompositions           : 0
% 0.33/1.10  % Total rewrite steps                  : 584
% 0.33/1.10  % ...of those cached                   : 493
% 0.33/1.10  % Propositional unsat checks           : 0
% 0.33/1.10  %    Propositional check models        : 0
% 0.33/1.10  %    Propositional check unsatisfiable : 0
% 0.33/1.10  %    Propositional clauses             : 0
% 0.33/1.10  %    Propositional clauses after purity: 0
% 0.33/1.10  %    Propositional unsat core size     : 0
% 0.33/1.10  %    Propositional preprocessing time  : 0.000
% 0.33/1.10  %    Propositional encoding time       : 0.000
% 0.33/1.10  %    Propositional solver time         : 0.000
% 0.33/1.10  %    Success case prop preproc time    : 0.000
% 0.33/1.10  %    Success case prop encoding time   : 0.000
% 0.33/1.10  %    Success case prop solver time     : 0.000
% 0.33/1.10  % Current number of processed clauses  : 781
% 0.33/1.10  %    Positive orientable unit clauses  : 147
% 0.33/1.10  %    Positive unorientable unit clauses: 0
% 0.33/1.10  %    Negative unit clauses             : 39
% 0.33/1.10  %    Non-unit-clauses                  : 595
% 0.33/1.10  % Current number of unprocessed clauses: 2251
% 0.33/1.10  % ...number of literals in the above   : 12040
% 0.33/1.10  % Current number of archived formulas  : 0
% 0.33/1.10  % Current number of archived clauses   : 409
% 0.33/1.10  % Clause-clause subsumption calls (NU) : 194229
% 0.33/1.10  % Rec. Clause-clause subsumption calls : 47982
% 0.33/1.10  % Non-unit clause-clause subsumptions  : 900
% 0.33/1.10  % Unit Clause-clause subsumption calls : 5091
% 0.33/1.10  % Rewrite failures with RHS unbound    : 0
% 0.33/1.10  % BW rewrite match attempts            : 46
% 0.33/1.10  % BW rewrite match successes           : 9
% 0.33/1.10  % Condensation attempts                : 0
% 0.33/1.10  % Condensation successes               : 0
% 0.33/1.10  % Termbank termtop insertions          : 89489
% 0.33/1.10  % Search garbage collected termcells   : 3983
% 0.33/1.10  
% 0.33/1.10  % -------------------------------------------------
% 0.33/1.10  % User time                : 0.345 s
% 0.33/1.10  % System time              : 0.021 s
% 0.33/1.10  % Total time               : 0.366 s
% 0.33/1.10  % Maximum resident set size: 4572 pages
% 0.33/1.10  
% 0.33/1.10  % -------------------------------------------------
% 0.33/1.10  % User time                : 1.998 s
% 0.33/1.10  % System time              : 0.101 s
% 0.33/1.10  % Total time               : 2.098 s
% 0.33/1.10  % Maximum resident set size: 4864 pages
% 0.33/1.10  % E exiting
%------------------------------------------------------------------------------