TSTP Solution File: SEU425+2 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SEU425+2 : TPTP v8.1.2. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n015.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:26:28 EDT 2023

% Result   : Theorem 203.02s 27.21s
% Output   : CNFRefutation 203.02s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   37 (   8 unt;   0 def)
%            Number of atoms       :  126 (  15 equ)
%            Maximal formula atoms :   23 (   3 avg)
%            Number of connectives :  153 (  64   ~;  59   |;  17   &)
%                                         (   1 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   3 con; 0-3 aty)
%            Number of variables   :   57 (   5 sgn;  38   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t21_relset_2,conjecture,
    ! [X1,X2,X3] :
      ( m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
     => ( v1_funct_1(k5_relset_2(X1,X3))
        & v1_funct_2(k5_relset_2(X1,X3),k1_zfmisc_1(X1),k1_zfmisc_1(k2_relat_1(X3)))
        & m2_relset_1(k5_relset_2(X1,X3),k1_zfmisc_1(X1),k1_zfmisc_1(k2_relat_1(X3))) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.W1QHnxnSot/E---3.1_18499.p',t21_relset_2) ).

fof(t20_relset_2,axiom,
    ! [X1,X2,X3] :
      ( m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
     => r1_tarski(k2_relat_1(k5_relset_2(X1,X3)),k1_zfmisc_1(k2_relat_1(X3))) ),
    file('/export/starexec/sandbox2/tmp/tmp.W1QHnxnSot/E---3.1_18499.p',t20_relset_2) ).

fof(t10_relset_1,axiom,
    ! [X1,X2] :
      ( v1_relat_1(X2)
     => ( r1_tarski(k2_relat_1(X2),X1)
       => m2_relset_1(X2,k1_relat_1(X2),X1) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.W1QHnxnSot/E---3.1_18499.p',t10_relset_1) ).

fof(cc1_relset_1,axiom,
    ! [X1,X2,X3] :
      ( m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
     => v1_relat_1(X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.W1QHnxnSot/E---3.1_18499.p',cc1_relset_1) ).

fof(t4_funct_2,axiom,
    ! [X1,X2] :
      ( ( v1_relat_1(X2)
        & v1_funct_1(X2) )
     => ( r1_tarski(k2_relat_1(X2),X1)
       => ( v1_funct_1(X2)
          & v1_funct_2(X2,k1_relat_1(X2),X1)
          & m2_relset_1(X2,k1_relat_1(X2),X1) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.W1QHnxnSot/E---3.1_18499.p',t4_funct_2) ).

fof(dt_k5_relset_2,axiom,
    ! [X1,X2] :
      ( v1_relat_1(X2)
     => ( v1_relat_1(k5_relset_2(X1,X2))
        & v1_funct_1(k5_relset_2(X1,X2)) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.W1QHnxnSot/E---3.1_18499.p',dt_k5_relset_2) ).

fof(d3_relset_2,axiom,
    ! [X1,X2] :
      ( v1_relat_1(X2)
     => ! [X3] :
          ( ( v1_relat_1(X3)
            & v1_funct_1(X3) )
         => ( X3 = k5_relset_2(X1,X2)
          <=> ( k1_relat_1(X3) = k1_zfmisc_1(X1)
              & ! [X4] :
                  ( r1_tarski(X4,X1)
                 => k1_funct_1(X3,X4) = k9_relat_1(X2,X4) ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.W1QHnxnSot/E---3.1_18499.p',d3_relset_2) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
       => ( v1_funct_1(k5_relset_2(X1,X3))
          & v1_funct_2(k5_relset_2(X1,X3),k1_zfmisc_1(X1),k1_zfmisc_1(k2_relat_1(X3)))
          & m2_relset_1(k5_relset_2(X1,X3),k1_zfmisc_1(X1),k1_zfmisc_1(k2_relat_1(X3))) ) ),
    inference(assume_negation,[status(cth)],[t21_relset_2]) ).

fof(c_0_8,plain,
    ! [X220,X221,X222] :
      ( ~ m1_subset_1(X222,k1_zfmisc_1(k2_zfmisc_1(X220,X221)))
      | r1_tarski(k2_relat_1(k5_relset_2(X220,X222)),k1_zfmisc_1(k2_relat_1(X222))) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t20_relset_2])]) ).

fof(c_0_9,negated_conjecture,
    ( m1_subset_1(esk3_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0)))
    & ( ~ v1_funct_1(k5_relset_2(esk1_0,esk3_0))
      | ~ v1_funct_2(k5_relset_2(esk1_0,esk3_0),k1_zfmisc_1(esk1_0),k1_zfmisc_1(k2_relat_1(esk3_0)))
      | ~ m2_relset_1(k5_relset_2(esk1_0,esk3_0),k1_zfmisc_1(esk1_0),k1_zfmisc_1(k2_relat_1(esk3_0))) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

fof(c_0_10,plain,
    ! [X147,X148] :
      ( ~ v1_relat_1(X148)
      | ~ r1_tarski(k2_relat_1(X148),X147)
      | m2_relset_1(X148,k1_relat_1(X148),X147) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t10_relset_1])]) ).

cnf(c_0_11,plain,
    ( r1_tarski(k2_relat_1(k5_relset_2(X2,X1)),k1_zfmisc_1(k2_relat_1(X1)))
    | ~ m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    m1_subset_1(esk3_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0))),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_13,plain,
    ! [X99,X100,X101] :
      ( ~ m1_subset_1(X101,k1_zfmisc_1(k2_zfmisc_1(X99,X100)))
      | v1_relat_1(X101) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])]) ).

fof(c_0_14,plain,
    ! [X170,X171] :
      ( ( v1_funct_1(X171)
        | ~ r1_tarski(k2_relat_1(X171),X170)
        | ~ v1_relat_1(X171)
        | ~ v1_funct_1(X171) )
      & ( v1_funct_2(X171,k1_relat_1(X171),X170)
        | ~ r1_tarski(k2_relat_1(X171),X170)
        | ~ v1_relat_1(X171)
        | ~ v1_funct_1(X171) )
      & ( m2_relset_1(X171,k1_relat_1(X171),X170)
        | ~ r1_tarski(k2_relat_1(X171),X170)
        | ~ v1_relat_1(X171)
        | ~ v1_funct_1(X171) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_funct_2])])]) ).

fof(c_0_15,plain,
    ! [X209,X210] :
      ( ( v1_relat_1(k5_relset_2(X209,X210))
        | ~ v1_relat_1(X210) )
      & ( v1_funct_1(k5_relset_2(X209,X210))
        | ~ v1_relat_1(X210) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k5_relset_2])])]) ).

cnf(c_0_16,plain,
    ( m2_relset_1(X1,k1_relat_1(X1),X2)
    | ~ v1_relat_1(X1)
    | ~ r1_tarski(k2_relat_1(X1),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_17,negated_conjecture,
    r1_tarski(k2_relat_1(k5_relset_2(esk1_0,esk3_0)),k1_zfmisc_1(k2_relat_1(esk3_0))),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_18,plain,
    ( v1_relat_1(X1)
    | ~ m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_19,plain,
    ! [X211,X212,X213,X214] :
      ( ( k1_relat_1(X213) = k1_zfmisc_1(X211)
        | X213 != k5_relset_2(X211,X212)
        | ~ v1_relat_1(X213)
        | ~ v1_funct_1(X213)
        | ~ v1_relat_1(X212) )
      & ( ~ r1_tarski(X214,X211)
        | k1_funct_1(X213,X214) = k9_relat_1(X212,X214)
        | X213 != k5_relset_2(X211,X212)
        | ~ v1_relat_1(X213)
        | ~ v1_funct_1(X213)
        | ~ v1_relat_1(X212) )
      & ( r1_tarski(esk26_3(X211,X212,X213),X211)
        | k1_relat_1(X213) != k1_zfmisc_1(X211)
        | X213 = k5_relset_2(X211,X212)
        | ~ v1_relat_1(X213)
        | ~ v1_funct_1(X213)
        | ~ v1_relat_1(X212) )
      & ( k1_funct_1(X213,esk26_3(X211,X212,X213)) != k9_relat_1(X212,esk26_3(X211,X212,X213))
        | k1_relat_1(X213) != k1_zfmisc_1(X211)
        | X213 = k5_relset_2(X211,X212)
        | ~ v1_relat_1(X213)
        | ~ v1_funct_1(X213)
        | ~ v1_relat_1(X212) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_relset_2])])])])]) ).

cnf(c_0_20,plain,
    ( v1_funct_2(X1,k1_relat_1(X1),X2)
    | ~ r1_tarski(k2_relat_1(X1),X2)
    | ~ v1_relat_1(X1)
    | ~ v1_funct_1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_21,negated_conjecture,
    ( ~ v1_funct_1(k5_relset_2(esk1_0,esk3_0))
    | ~ v1_funct_2(k5_relset_2(esk1_0,esk3_0),k1_zfmisc_1(esk1_0),k1_zfmisc_1(k2_relat_1(esk3_0)))
    | ~ m2_relset_1(k5_relset_2(esk1_0,esk3_0),k1_zfmisc_1(esk1_0),k1_zfmisc_1(k2_relat_1(esk3_0))) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_22,plain,
    ( v1_funct_1(k5_relset_2(X1,X2))
    | ~ v1_relat_1(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_23,negated_conjecture,
    ( m2_relset_1(k5_relset_2(esk1_0,esk3_0),k1_relat_1(k5_relset_2(esk1_0,esk3_0)),k1_zfmisc_1(k2_relat_1(esk3_0)))
    | ~ v1_relat_1(k5_relset_2(esk1_0,esk3_0)) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_24,plain,
    ( v1_relat_1(k5_relset_2(X1,X2))
    | ~ v1_relat_1(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_25,negated_conjecture,
    v1_relat_1(esk3_0),
    inference(spm,[status(thm)],[c_0_18,c_0_12]) ).

cnf(c_0_26,plain,
    ( k1_relat_1(X1) = k1_zfmisc_1(X2)
    | X1 != k5_relset_2(X2,X3)
    | ~ v1_relat_1(X1)
    | ~ v1_funct_1(X1)
    | ~ v1_relat_1(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_27,negated_conjecture,
    ( v1_funct_2(k5_relset_2(esk1_0,esk3_0),k1_relat_1(k5_relset_2(esk1_0,esk3_0)),k1_zfmisc_1(k2_relat_1(esk3_0)))
    | ~ v1_funct_1(k5_relset_2(esk1_0,esk3_0))
    | ~ v1_relat_1(k5_relset_2(esk1_0,esk3_0)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_17]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ v1_funct_2(k5_relset_2(esk1_0,esk3_0),k1_zfmisc_1(esk1_0),k1_zfmisc_1(k2_relat_1(esk3_0)))
    | ~ m2_relset_1(k5_relset_2(esk1_0,esk3_0),k1_zfmisc_1(esk1_0),k1_zfmisc_1(k2_relat_1(esk3_0)))
    | ~ v1_relat_1(esk3_0) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_29,negated_conjecture,
    m2_relset_1(k5_relset_2(esk1_0,esk3_0),k1_relat_1(k5_relset_2(esk1_0,esk3_0)),k1_zfmisc_1(k2_relat_1(esk3_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).

cnf(c_0_30,plain,
    ( k1_relat_1(k5_relset_2(X1,X2)) = k1_zfmisc_1(X1)
    | ~ v1_relat_1(X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_26]),c_0_24]),c_0_22]) ).

cnf(c_0_31,negated_conjecture,
    ( v1_funct_2(k5_relset_2(esk1_0,esk3_0),k1_relat_1(k5_relset_2(esk1_0,esk3_0)),k1_zfmisc_1(k2_relat_1(esk3_0)))
    | ~ v1_relat_1(k5_relset_2(esk1_0,esk3_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_22]),c_0_25])]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ v1_funct_2(k5_relset_2(esk1_0,esk3_0),k1_zfmisc_1(esk1_0),k1_zfmisc_1(k2_relat_1(esk3_0)))
    | ~ m2_relset_1(k5_relset_2(esk1_0,esk3_0),k1_zfmisc_1(esk1_0),k1_zfmisc_1(k2_relat_1(esk3_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_25])]) ).

cnf(c_0_33,negated_conjecture,
    m2_relset_1(k5_relset_2(esk1_0,esk3_0),k1_zfmisc_1(esk1_0),k1_zfmisc_1(k2_relat_1(esk3_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_25])]) ).

cnf(c_0_34,negated_conjecture,
    v1_funct_2(k5_relset_2(esk1_0,esk3_0),k1_relat_1(k5_relset_2(esk1_0,esk3_0)),k1_zfmisc_1(k2_relat_1(esk3_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_24]),c_0_25])]) ).

cnf(c_0_35,negated_conjecture,
    ~ v1_funct_2(k5_relset_2(esk1_0,esk3_0),k1_zfmisc_1(esk1_0),k1_zfmisc_1(k2_relat_1(esk3_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).

cnf(c_0_36,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30]),c_0_25])]),c_0_35]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.42  % Problem    : SEU425+2 : TPTP v8.1.2. Released v3.4.0.
% 0.09/0.43  % Command    : run_E %s %d THM
% 0.46/0.64  % Computer : n015.cluster.edu
% 0.46/0.64  % Model    : x86_64 x86_64
% 0.46/0.64  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.46/0.64  % Memory   : 8042.1875MB
% 0.46/0.64  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.46/0.64  % CPULimit   : 2400
% 0.46/0.64  % WCLimit    : 300
% 0.46/0.64  % DateTime   : Mon Oct  2 09:48:46 EDT 2023
% 0.46/0.64  % CPUTime    : 
% 0.48/1.22  Running first-order theorem proving
% 0.48/1.22  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/tmp/tmp.W1QHnxnSot/E---3.1_18499.p
% 203.02/27.21  # Version: 3.1pre001
% 203.02/27.21  # Preprocessing class: FMLMSMLLSSSNFFN.
% 203.02/27.21  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 203.02/27.21  # Starting new_bool_3 with 900s (3) cores
% 203.02/27.21  # Starting new_bool_1 with 900s (3) cores
% 203.02/27.21  # Starting sh5l with 300s (1) cores
% 203.02/27.21  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 203.02/27.21  # G-E--_208_C18_F1_SE_CS_SP_PS_S2p with pid 18583 completed with status 0
% 203.02/27.21  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2p
% 203.02/27.21  # Preprocessing class: FMLMSMLLSSSNFFN.
% 203.02/27.21  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 203.02/27.21  # Starting new_bool_3 with 900s (3) cores
% 203.02/27.21  # Starting new_bool_1 with 900s (3) cores
% 203.02/27.21  # Starting sh5l with 300s (1) cores
% 203.02/27.21  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 203.02/27.21  # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 203.02/27.21  # Search class: FGHSM-FSLM32-MFFFFFNN
% 203.02/27.21  # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 203.02/27.21  # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 203.02/27.21  # G-E--_303_C18_F1_URBAN_S0Y with pid 18584 completed with status 7
% 203.02/27.21  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 31s (1) cores
% 203.02/27.21  # G-E--_208_C18_F1_SE_CS_SP_PS_S2p with pid 18596 completed with status 0
% 203.02/27.21  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2p
% 203.02/27.21  # Preprocessing class: FMLMSMLLSSSNFFN.
% 203.02/27.21  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 203.02/27.21  # Starting new_bool_3 with 900s (3) cores
% 203.02/27.21  # Starting new_bool_1 with 900s (3) cores
% 203.02/27.21  # Starting sh5l with 300s (1) cores
% 203.02/27.21  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 203.02/27.21  # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 203.02/27.21  # Search class: FGHSM-FSLM32-MFFFFFNN
% 203.02/27.21  # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 203.02/27.21  # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 203.02/27.21  # G-E--_303_C18_F1_URBAN_S0Y with pid 18584 completed with status 7
% 203.02/27.21  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 31s (1) cores
% 203.02/27.21  # Preprocessing time       : 0.014 s
% 203.02/27.21  # Presaturation interreduction done
% 203.02/27.21  
% 203.02/27.21  # Proof found!
% 203.02/27.21  # SZS status Theorem
% 203.02/27.21  # SZS output start CNFRefutation
% See solution above
% 203.02/27.21  # Parsed axioms                        : 4492
% 203.02/27.21  # Removed by relevancy pruning/SinE    : 3991
% 203.02/27.21  # Initial clauses                      : 850
% 203.02/27.21  # Removed in clause preprocessing      : 25
% 203.02/27.21  # Initial clauses in saturation        : 825
% 203.02/27.21  # Processed clauses                    : 3799
% 203.02/27.21  # ...of these trivial                  : 44
% 203.02/27.21  # ...subsumed                          : 1871
% 203.02/27.21  # ...remaining for further processing  : 1883
% 203.02/27.21  # Other redundant clauses eliminated   : 287
% 203.02/27.21  # Clauses deleted for lack of memory   : 0
% 203.02/27.21  # Backward-subsumed                    : 10
% 203.02/27.21  # Backward-rewritten                   : 47
% 203.02/27.21  # Generated clauses                    : 15584
% 203.02/27.21  # ...of the previous two non-redundant : 13309
% 203.02/27.21  # ...aggressively subsumed             : 0
% 203.02/27.21  # Contextual simplify-reflections      : 27
% 203.02/27.21  # Paramodulations                      : 15298
% 203.02/27.21  # Factorizations                       : 1
% 203.02/27.21  # NegExts                              : 0
% 203.02/27.21  # Equation resolutions                 : 292
% 203.02/27.21  # Total rewrite steps                  : 6185
% 203.02/27.21  # Propositional unsat checks           : 0
% 203.02/27.21  #    Propositional check models        : 0
% 203.02/27.21  #    Propositional check unsatisfiable : 0
% 203.02/27.21  #    Propositional clauses             : 0
% 203.02/27.21  #    Propositional clauses after purity: 0
% 203.02/27.21  #    Propositional unsat core size     : 0
% 203.02/27.21  #    Propositional preprocessing time  : 0.000
% 203.02/27.21  #    Propositional encoding time       : 0.000
% 203.02/27.21  #    Propositional solver time         : 0.000
% 203.02/27.21  #    Success case prop preproc time    : 0.000
% 203.02/27.21  #    Success case prop encoding time   : 0.000
% 203.02/27.21  #    Success case prop solver time     : 0.000
% 203.02/27.21  # Current number of processed clauses  : 1012
% 203.02/27.21  #    Positive orientable unit clauses  : 202
% 203.02/27.21  #    Positive unorientable unit clauses: 4
% 203.02/27.21  #    Negative unit clauses             : 233
% 203.02/27.21  #    Non-unit-clauses                  : 573
% 203.02/27.21  # Current number of unprocessed clauses: 11021
% 203.02/27.21  # ...number of literals in the above   : 28836
% 203.02/27.21  # Current number of archived formulas  : 0
% 203.02/27.21  # Current number of archived clauses   : 788
% 203.02/27.21  # Clause-clause subsumption calls (NU) : 171737
% 203.02/27.21  # Rec. Clause-clause subsumption calls : 73074
% 203.02/27.21  # Non-unit clause-clause subsumptions  : 491
% 203.02/27.21  # Unit Clause-clause subsumption calls : 15080
% 203.02/27.21  # Rewrite failures with RHS unbound    : 0
% 203.02/27.21  # BW rewrite match attempts            : 299
% 203.02/27.21  # BW rewrite match successes           : 179
% 203.02/27.21  # Condensation attempts                : 0
% 203.02/27.21  # Condensation successes               : 0
% 203.02/27.21  # Termbank termtop insertions          : 291421
% 203.02/27.21  
% 203.02/27.21  # -------------------------------------------------
% 203.02/27.21  # User time                : 24.829 s
% 203.02/27.21  # System time              : 0.679 s
% 203.02/27.21  # Total time               : 25.508 s
% 203.02/27.21  # Maximum resident set size: 9836 pages
% 203.02/27.21  
% 203.02/27.21  # -------------------------------------------------
% 203.02/27.21  # User time                : 24.946 s
% 203.02/27.21  # System time              : 0.687 s
% 203.02/27.21  # Total time               : 25.633 s
% 203.02/27.21  # Maximum resident set size: 7156 pages
% 203.02/27.21  % E---3.1 exiting
% 203.02/27.21  % E---3.1 exiting
%------------------------------------------------------------------------------