↑ Up

E-SAT---3.5.1.THM-CRf.s

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

% Computer : n018.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 12:44:31 PM UTC 2026

% Result   : Theorem 0.18s 10.58s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   33 (  15 unt;   0 def)
%            Number of atoms       :  175 (   0 equ)
%            Maximal formula atoms :   18 (   5 avg)
%            Number of connectives :  210 (  68   ~;  59   |;  48   &)
%                                         (   2 <=>;  33  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   10 (   9 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-3 aty)
%            Number of variables   :   55 (   0 sgn  42   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t21_latsubgr,conjecture,
    ! [X1] :
      ( ( l1_group_1(X1)
        & v4_group_1(X1)
        & v3_group_1(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( ( m1_group_2(X2,X1)
            & v1_group_1(X2) )
         => ! [X3] :
              ( m1_subset_1(X3,u1_struct_0(X1))
             => ! [X4] :
                  ( m1_subset_1(X4,u1_struct_0(X1))
                 => ( ( r2_hidden(X4,k1_funct_1(k1_latsubgr(X1),X2))
                      & r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2)) )
                   => r2_hidden(k1_group_1(X1,X3,X4),k1_funct_1(k1_latsubgr(X1),X2)) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_latsubgr) ).

fof(t18_latsubgr,axiom,
    ! [X1] :
      ( ( l1_group_1(X1)
        & v4_group_1(X1)
        & v3_group_1(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( ( m1_group_2(X2,X1)
            & v1_group_1(X2) )
         => ! [X3] :
              ( m1_subset_1(X3,u1_struct_0(X1))
             => ( r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2))
              <=> r1_rlvect_1(X2,X3) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t18_latsubgr) ).

fof(t59_group_2,axiom,
    ! [X1] :
      ( ( l1_group_1(X1)
        & v4_group_1(X1)
        & v3_group_1(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m1_subset_1(X2,u1_struct_0(X1))
         => ! [X3] :
              ( m1_subset_1(X3,u1_struct_0(X1))
             => ! [X4] :
                  ( m1_group_2(X4,X1)
                 => ( ( r1_rlvect_1(X4,X3)
                      & r1_rlvect_1(X4,X2) )
                   => r1_rlvect_1(X4,k1_group_1(X1,X2,X3)) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t59_group_2) ).

fof(dt_k1_group_1,axiom,
    ! [X1,X2,X3] :
      ( ( m1_subset_1(X3,u1_struct_0(X1))
        & m1_subset_1(X2,u1_struct_0(X1))
        & l1_group_1(X1)
        & ~ v3_struct_0(X1) )
     => m1_subset_1(k1_group_1(X1,X2,X3),u1_struct_0(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_group_1) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1] :
        ( ( l1_group_1(X1)
          & v4_group_1(X1)
          & v3_group_1(X1)
          & ~ v3_struct_0(X1) )
       => ! [X2] :
            ( ( m1_group_2(X2,X1)
              & v1_group_1(X2) )
           => ! [X3] :
                ( m1_subset_1(X3,u1_struct_0(X1))
               => ! [X4] :
                    ( m1_subset_1(X4,u1_struct_0(X1))
                   => ( ( r2_hidden(X4,k1_funct_1(k1_latsubgr(X1),X2))
                        & r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2)) )
                     => r2_hidden(k1_group_1(X1,X3,X4),k1_funct_1(k1_latsubgr(X1),X2)) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[t21_latsubgr]) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1] :
        ( ( l1_group_1(X1)
          & v4_group_1(X1)
          & v3_group_1(X1)
          & ~ v3_struct_0(X1) )
       => ! [X2] :
            ( ( m1_group_2(X2,X1)
              & v1_group_1(X2) )
           => ! [X3] :
                ( m1_subset_1(X3,u1_struct_0(X1))
               => ! [X4] :
                    ( m1_subset_1(X4,u1_struct_0(X1))
                   => ( ( r2_hidden(X4,k1_funct_1(k1_latsubgr(X1),X2))
                        & r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2)) )
                     => r2_hidden(k1_group_1(X1,X3,X4),k1_funct_1(k1_latsubgr(X1),X2)) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

fof(c_0_6,plain,
    ! [X1] :
      ( ( l1_group_1(X1)
        & v4_group_1(X1)
        & v3_group_1(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( ( m1_group_2(X2,X1)
            & v1_group_1(X2) )
         => ! [X3] :
              ( m1_subset_1(X3,u1_struct_0(X1))
             => ( r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2))
              <=> r1_rlvect_1(X2,X3) ) ) ) ),
    inference(fof_simplification,[status(thm)],[t18_latsubgr]) ).

fof(c_0_7,negated_conjecture,
    ( ~ r2_hidden(k1_group_1(esk1_0,esk3_0,esk4_0),k1_funct_1(k1_latsubgr(esk1_0),esk2_0))
    & r2_hidden(esk4_0,k1_funct_1(k1_latsubgr(esk1_0),esk2_0))
    & r2_hidden(esk3_0,k1_funct_1(k1_latsubgr(esk1_0),esk2_0))
    & m1_subset_1(esk4_0,u1_struct_0(esk1_0))
    & m1_subset_1(esk3_0,u1_struct_0(esk1_0))
    & m1_group_2(esk2_0,esk1_0)
    & v1_group_1(esk2_0)
    & l1_group_1(esk1_0)
    & v4_group_1(esk1_0)
    & v3_group_1(esk1_0)
    & ~ v3_struct_0(esk1_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

fof(c_0_8,plain,
    ! [X11,X12,X13] :
      ( ( ~ l1_group_1(X11)
        | ~ v4_group_1(X11)
        | ~ v3_group_1(X11)
        | v3_struct_0(X11)
        | ~ m1_group_2(X12,X11)
        | ~ v1_group_1(X12)
        | ~ m1_subset_1(X13,u1_struct_0(X11))
        | r2_hidden(X13,k1_funct_1(k1_latsubgr(X11),X12))
        | ~ r1_rlvect_1(X12,X13) )
      & ( ~ l1_group_1(X11)
        | ~ v4_group_1(X11)
        | ~ v3_group_1(X11)
        | v3_struct_0(X11)
        | ~ m1_group_2(X12,X11)
        | ~ v1_group_1(X12)
        | ~ m1_subset_1(X13,u1_struct_0(X11))
        | r1_rlvect_1(X12,X13)
        | ~ r2_hidden(X13,k1_funct_1(k1_latsubgr(X11),X12)) ) ),
    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_6])])])])]) ).

fof(c_0_9,plain,
    ! [X1] :
      ( ( l1_group_1(X1)
        & v4_group_1(X1)
        & v3_group_1(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m1_subset_1(X2,u1_struct_0(X1))
         => ! [X3] :
              ( m1_subset_1(X3,u1_struct_0(X1))
             => ! [X4] :
                  ( m1_group_2(X4,X1)
                 => ( ( r1_rlvect_1(X4,X3)
                      & r1_rlvect_1(X4,X2) )
                   => r1_rlvect_1(X4,k1_group_1(X1,X2,X3)) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[t59_group_2]) ).

cnf(c_0_10,negated_conjecture,
    ~ r2_hidden(k1_group_1(esk1_0,esk3_0,esk4_0),k1_funct_1(k1_latsubgr(esk1_0),esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( ~ l1_group_1(X3)
    | ~ v4_group_1(X3)
    | ~ v3_group_1(X3)
    | ~ m1_group_2(X1,X3)
    | ~ v1_group_1(X1)
    | ~ m1_subset_1(X2,u1_struct_0(X3))
    | ~ r1_rlvect_1(X1,X2)
    | v3_struct_0(X3)
    | r2_hidden(X2,k1_funct_1(k1_latsubgr(X3),X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    m1_group_2(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,negated_conjecture,
    v1_group_1(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_14,negated_conjecture,
    l1_group_1(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_15,negated_conjecture,
    v4_group_1(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_16,negated_conjecture,
    v3_group_1(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_17,negated_conjecture,
    ~ v3_struct_0(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_18,plain,
    ! [X30,X31,X32,X33] :
      ( r1_rlvect_1(X33,k1_group_1(X30,X31,X32))
      | ~ r1_rlvect_1(X33,X32)
      | ~ r1_rlvect_1(X33,X31)
      | ~ m1_group_2(X33,X30)
      | ~ m1_subset_1(X32,u1_struct_0(X30))
      | ~ m1_subset_1(X31,u1_struct_0(X30))
      | ~ l1_group_1(X30)
      | ~ v4_group_1(X30)
      | ~ v3_group_1(X30)
      | v3_struct_0(X30) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).

cnf(c_0_19,plain,
    ( ~ l1_group_1(X2)
    | ~ v4_group_1(X2)
    | ~ v3_group_1(X2)
    | ~ m1_group_2(X3,X2)
    | ~ v1_group_1(X3)
    | ~ m1_subset_1(X1,u1_struct_0(X2))
    | ~ r2_hidden(X1,k1_funct_1(k1_latsubgr(X2),X3))
    | v3_struct_0(X2)
    | r1_rlvect_1(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_20,negated_conjecture,
    r2_hidden(esk4_0,k1_funct_1(k1_latsubgr(esk1_0),esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_21,negated_conjecture,
    m1_subset_1(esk4_0,u1_struct_0(esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_22,negated_conjecture,
    r2_hidden(esk3_0,k1_funct_1(k1_latsubgr(esk1_0),esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_23,negated_conjecture,
    m1_subset_1(esk3_0,u1_struct_0(esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_24,plain,
    ! [X1,X2,X3] :
      ( ( m1_subset_1(X3,u1_struct_0(X1))
        & m1_subset_1(X2,u1_struct_0(X1))
        & l1_group_1(X1)
        & ~ v3_struct_0(X1) )
     => m1_subset_1(k1_group_1(X1,X2,X3),u1_struct_0(X1)) ),
    inference(fof_simplification,[status(thm)],[dt_k1_group_1]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ m1_subset_1(k1_group_1(esk1_0,esk3_0,esk4_0),u1_struct_0(esk1_0))
    | ~ r1_rlvect_1(esk2_0,k1_group_1(esk1_0,esk3_0,esk4_0)) ),
    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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).

cnf(c_0_26,plain,
    ( ~ r1_rlvect_1(X4,X3)
    | ~ r1_rlvect_1(X4,X2)
    | ~ m1_group_2(X4,X1)
    | ~ m1_subset_1(X3,u1_struct_0(X1))
    | ~ m1_subset_1(X2,u1_struct_0(X1))
    | ~ l1_group_1(X1)
    | ~ v4_group_1(X1)
    | ~ v3_group_1(X1)
    | r1_rlvect_1(X4,k1_group_1(X1,X2,X3))
    | v3_struct_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_27,negated_conjecture,
    r1_rlvect_1(esk2_0,esk4_0),
    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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).

cnf(c_0_28,negated_conjecture,
    r1_rlvect_1(esk2_0,esk3_0),
    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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_22]),c_0_23]),c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).

fof(c_0_29,plain,
    ! [X27,X28,X29] :
      ( m1_subset_1(k1_group_1(X27,X28,X29),u1_struct_0(X27))
      | ~ m1_subset_1(X29,u1_struct_0(X27))
      | ~ m1_subset_1(X28,u1_struct_0(X27))
      | ~ l1_group_1(X27)
      | v3_struct_0(X27) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).

cnf(c_0_30,negated_conjecture,
    ~ m1_subset_1(k1_group_1(esk1_0,esk3_0,esk4_0),u1_struct_0(esk1_0)),
    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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]),c_0_21]),c_0_23]),c_0_12]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).

cnf(c_0_31,plain,
    ( ~ m1_subset_1(X3,u1_struct_0(X1))
    | ~ m1_subset_1(X2,u1_struct_0(X1))
    | ~ l1_group_1(X1)
    | m1_subset_1(k1_group_1(X1,X2,X3),u1_struct_0(X1))
    | v3_struct_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    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_30,c_0_31]),c_0_21]),c_0_23]),c_0_14])]),c_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP643+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/10.40  % Computer : n018.cluster.edu
% 0.14/10.40  % Model    : x86_64 x86_64
% 0.14/10.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/10.40  % Memory   : 8046.5625MB
% 0.14/10.40  % OS       : Linux 6.8.0-71-generic
% 0.14/10.41  % CPULimit : 300
% 0.14/10.41  % WCLimit  : 300
% 0.14/10.41  % DateTime : Sun Sep 20 20:27:24 UTC 2026
% 0.14/10.41  % CPUTime  : 
% 0.14/10.41  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/10.48  Running first-order theorem proving
% 0.14/10.48  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.18/10.58  % Version: 3.5.1
% 0.18/10.58  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/10.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/10.58  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/10.58  % Starting new_bool_3 with 300s (1) cores
% 0.18/10.58  % Starting new_bool_1 with 300s (1) cores
% 0.18/10.58  % Starting sh5l with 300s (1) cores
% 0.18/10.58  % sh5l with pid 131478 completed with status 0
% 0.18/10.58  % Result found by sh5l
% 0.18/10.58  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/10.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/10.58  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/10.58  % Starting new_bool_3 with 300s (1) cores
% 0.18/10.58  % Starting new_bool_1 with 300s (1) cores
% 0.18/10.58  % Starting sh5l with 300s (1) cores
% 0.18/10.58  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.18/10.58  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/10.58  % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.18/10.58  % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.18/10.58  % Starting SubtermCWHack with 28s (1) cores
% 0.18/10.58  % SubtermCWHack with pid 131486 completed with status 0
% 0.18/10.58  % Result found by SubtermCWHack
% 0.18/10.58  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/10.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/10.58  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/10.58  % Starting new_bool_3 with 300s (1) cores
% 0.18/10.58  % Starting new_bool_1 with 300s (1) cores
% 0.18/10.58  % Starting sh5l with 300s (1) cores
% 0.18/10.58  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.18/10.58  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/10.58  % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.18/10.58  % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.18/10.58  % Starting SubtermCWHack with 28s (1) cores
% 0.18/10.58  % Preprocessing time       : 0.003 s
% 0.18/10.58  
% 0.18/10.58  % Proof found!
% 0.18/10.58  % SZS status Theorem
% 0.18/10.58  % SZS output start CNFRefutation
% See solution above
% 0.18/10.58  % Parsed axioms                        : 55
% 0.18/10.58  % Removed by relevancy pruning/SinE    : 11
% 0.18/10.58  % Initial clauses                      : 80
% 0.18/10.58  % Removed in clause preprocessing      : 5
% 0.18/10.58  % Initial clauses in saturation        : 75
% 0.18/10.58  % Processed clauses                    : 247
% 0.18/10.58  % ...of these trivial                  : 0
% 0.18/10.58  % ...subsumed                          : 59
% 0.18/10.58  % ...remaining for further processing  : 188
% 0.18/10.58  % Other redundant clauses eliminated   : 0
% 0.18/10.58  % Clauses deleted for lack of memory   : 0
% 0.18/10.58  % Backward-subsumed                    : 6
% 0.18/10.58  % Backward-rewritten                   : 2
% 0.18/10.58  % Generated clauses                    : 319
% 0.18/10.58  % ...of the previous two non-redundant : 287
% 0.18/10.58  % ...aggressively subsumed             : 0
% 0.18/10.58  % Contextual simplify-reflections      : 6
% 0.18/10.58  % Paramodulations                      : 319
% 0.18/10.58  % Factorizations                       : 0
% 0.18/10.58  % NegExts                              : 0
% 0.18/10.58  % Equation resolutions                 : 0
% 0.18/10.58  % Disequality decompositions           : 0
% 0.18/10.58  % Total rewrite steps                  : 70
% 0.18/10.58  % ...of those cached                   : 48
% 0.18/10.58  % Propositional unsat checks           : 0
% 0.18/10.58  %    Propositional check models        : 0
% 0.18/10.58  %    Propositional check unsatisfiable : 0
% 0.18/10.58  %    Propositional clauses             : 0
% 0.18/10.58  %    Propositional clauses after purity: 0
% 0.18/10.58  %    Propositional unsat core size     : 0
% 0.18/10.58  %    Propositional preprocessing time  : 0.000
% 0.18/10.58  %    Propositional encoding time       : 0.000
% 0.18/10.58  %    Propositional solver time         : 0.000
% 0.18/10.58  %    Success case prop preproc time    : 0.000
% 0.18/10.58  %    Success case prop encoding time   : 0.000
% 0.18/10.58  %    Success case prop solver time     : 0.000
% 0.18/10.58  % Current number of processed clauses  : 180
% 0.18/10.58  %    Positive orientable unit clauses  : 43
% 0.18/10.58  %    Positive unorientable unit clauses: 0
% 0.18/10.58  %    Negative unit clauses             : 16
% 0.18/10.58  %    Non-unit-clauses                  : 121
% 0.18/10.58  % Current number of unprocessed clauses: 102
% 0.18/10.58  % ...number of literals in the above   : 380
% 0.18/10.58  % Current number of archived formulas  : 0
% 0.18/10.58  % Current number of archived clauses   : 8
% 0.18/10.58  % Clause-clause subsumption calls (NU) : 2353
% 0.18/10.58  % Rec. Clause-clause subsumption calls : 1230
% 0.18/10.58  % Non-unit clause-clause subsumptions  : 67
% 0.18/10.58  % Unit Clause-clause subsumption calls : 195
% 0.18/10.58  % Rewrite failures with RHS unbound    : 0
% 0.18/10.58  % BW rewrite match attempts            : 7
% 0.18/10.58  % BW rewrite match successes           : 1
% 0.18/10.58  % Condensation attempts                : 0
% 0.18/10.58  % Condensation successes               : 0
% 0.18/10.58  % Termbank termtop insertions          : 10236
% 0.18/10.58  % Search garbage collected termcells   : 1049
% 0.18/10.58  
% 0.18/10.58  % -------------------------------------------------
% 0.18/10.58  % User time                : 0.037 s
% 0.18/10.58  % System time              : 0.003 s
% 0.18/10.58  % Total time               : 0.040 s
% 0.18/10.58  % Maximum resident set size: 3944 pages
% 0.18/10.58  
% 0.18/10.58  % -------------------------------------------------
% 0.18/10.58  % User time                : 0.039 s
% 0.18/10.58  % System time              : 0.012 s
% 0.18/10.58  % Total time               : 0.050 s
% 0.18/10.58  % Maximum resident set size: 4864 pages
% 0.18/10.58  % E exiting
%------------------------------------------------------------------------------