↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GRP641+3 : 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 : n011.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:40:31 PM UTC 2026

% Result   : Theorem 0.76s 1.35s
% Output   : CNFRefutation 0.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   38 (  11 unt;   0 def)
%            Number of atoms       :  182 (  10 equ)
%            Maximal formula atoms :   18 (   4 avg)
%            Number of connectives :  217 (  73   ~;  65   |;  47   &)
%                                         (   2 <=>;  30  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   57 (   0 sgn  42   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t19_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) )
         => r2_hidden(k2_group_1(X1),k1_funct_1(k1_latsubgr(X1),X2)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_latsubgr) ).

fof(t53_group_2,axiom,
    ! [X1] :
      ( ( l1_group_1(X1)
        & v4_group_1(X1)
        & v3_group_1(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m1_group_2(X2,X1)
         => k2_group_1(X2) = k2_group_1(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+246.ax',t53_group_2) ).

fof(t54_group_2,axiom,
    ! [X1] :
      ( ( l1_group_1(X1)
        & v4_group_1(X1)
        & v3_group_1(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m1_group_2(X2,X1)
         => ! [X3] :
              ( m1_group_2(X3,X1)
             => k2_group_1(X2) = k2_group_1(X3) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+246.ax',t54_group_2) ).

fof(t56_group_2,axiom,
    ! [X1] :
      ( ( l1_group_1(X1)
        & v4_group_1(X1)
        & v3_group_1(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m1_group_2(X2,X1)
         => ! [X3] :
              ( m1_group_2(X3,X1)
             => r1_rlvect_1(X3,k2_group_1(X2)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+246.ax',t56_group_2) ).

fof(dt_k2_group_1,axiom,
    ! [X1] :
      ( ( l1_group_1(X1)
        & ~ v3_struct_0(X1) )
     => m1_subset_1(k2_group_1(X1),u1_struct_0(X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+212.ax',dt_k2_group_1) ).

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(c_0_6,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) )
           => r2_hidden(k2_group_1(X1),k1_funct_1(k1_latsubgr(X1),X2)) ) ),
    inference(assume_negation,[status(cth)],[t19_latsubgr]) ).

fof(c_0_7,plain,
    ! [X1] :
      ( ( l1_group_1(X1)
        & v4_group_1(X1)
        & v3_group_1(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m1_group_2(X2,X1)
         => k2_group_1(X2) = k2_group_1(X1) ) ),
    inference(fof_simplification,[status(thm)],[t53_group_2]) ).

fof(c_0_8,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) )
           => r2_hidden(k2_group_1(X1),k1_funct_1(k1_latsubgr(X1),X2)) ) ),
    inference(fof_simplification,[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_group_2(X2,X1)
         => ! [X3] :
              ( m1_group_2(X3,X1)
             => k2_group_1(X2) = k2_group_1(X3) ) ) ),
    inference(fof_simplification,[status(thm)],[t54_group_2]) ).

fof(c_0_10,plain,
    ! [X127,X128] :
      ( k2_group_1(X128) = k2_group_1(X127)
      | ~ m1_group_2(X128,X127)
      | ~ l1_group_1(X127)
      | ~ v4_group_1(X127)
      | ~ v3_group_1(X127)
      | v3_struct_0(X127) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).

fof(c_0_11,negated_conjecture,
    ( ~ r2_hidden(k2_group_1(esk1_0),k1_funct_1(k1_latsubgr(esk1_0),esk2_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_8])])])]) ).

fof(c_0_12,plain,
    ! [X1] :
      ( ( l1_group_1(X1)
        & v4_group_1(X1)
        & v3_group_1(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( m1_group_2(X2,X1)
         => ! [X3] :
              ( m1_group_2(X3,X1)
             => r1_rlvect_1(X3,k2_group_1(X2)) ) ) ),
    inference(fof_simplification,[status(thm)],[t56_group_2]) ).

fof(c_0_13,plain,
    ! [X1] :
      ( ( l1_group_1(X1)
        & ~ v3_struct_0(X1) )
     => m1_subset_1(k2_group_1(X1),u1_struct_0(X1)) ),
    inference(fof_simplification,[status(thm)],[dt_k2_group_1]) ).

fof(c_0_14,plain,
    ! [X129,X130,X131] :
      ( k2_group_1(X130) = k2_group_1(X131)
      | ~ m1_group_2(X131,X129)
      | ~ m1_group_2(X130,X129)
      | ~ l1_group_1(X129)
      | ~ v4_group_1(X129)
      | ~ v3_group_1(X129)
      | v3_struct_0(X129) ),
    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_15,plain,
    ( ~ m1_group_2(X2,X1)
    | ~ l1_group_1(X1)
    | ~ v4_group_1(X1)
    | ~ v3_group_1(X1)
    | k2_group_1(X2) = k2_group_1(X1)
    | v3_struct_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    m1_group_2(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,negated_conjecture,
    v4_group_1(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,negated_conjecture,
    v3_group_1(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_19,negated_conjecture,
    l1_group_1(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_20,negated_conjecture,
    ~ v3_struct_0(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_21,plain,
    ! [X134,X135,X136] :
      ( r1_rlvect_1(X136,k2_group_1(X135))
      | ~ m1_group_2(X136,X134)
      | ~ m1_group_2(X135,X134)
      | ~ l1_group_1(X134)
      | ~ v4_group_1(X134)
      | ~ v3_group_1(X134)
      | v3_struct_0(X134) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).

fof(c_0_22,plain,
    ! [X123] :
      ( m1_subset_1(k2_group_1(X123),u1_struct_0(X123))
      | ~ l1_group_1(X123)
      | v3_struct_0(X123) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).

cnf(c_0_23,plain,
    ( ~ m1_group_2(X3,X1)
    | ~ m1_group_2(X2,X1)
    | ~ l1_group_1(X1)
    | ~ v4_group_1(X1)
    | ~ v3_group_1(X1)
    | k2_group_1(X2) = k2_group_1(X3)
    | v3_struct_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_24,negated_conjecture,
    k2_group_1(esk2_0) = k2_group_1(esk1_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_15,c_0_16]),c_0_17]),c_0_18]),c_0_19])]),c_0_20]) ).

fof(c_0_25,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]) ).

cnf(c_0_26,plain,
    ( ~ m1_group_2(X3,X1)
    | ~ m1_group_2(X2,X1)
    | ~ l1_group_1(X1)
    | ~ v4_group_1(X1)
    | ~ v3_group_1(X1)
    | r1_rlvect_1(X3,k2_group_1(X2))
    | v3_struct_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_27,plain,
    ( ~ l1_group_1(X1)
    | m1_subset_1(k2_group_1(X1),u1_struct_0(X1))
    | v3_struct_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ m1_group_2(X1,esk1_0)
    | k2_group_1(X1) = k2_group_1(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(spm,[status(thm)],[c_0_23,c_0_16]),c_0_24]),c_0_17]),c_0_18]),c_0_19])]),c_0_20]) ).

fof(c_0_29,plain,
    ! [X110,X111,X112] :
      ( ( ~ l1_group_1(X110)
        | ~ v4_group_1(X110)
        | ~ v3_group_1(X110)
        | v3_struct_0(X110)
        | ~ m1_group_2(X111,X110)
        | ~ v1_group_1(X111)
        | ~ m1_subset_1(X112,u1_struct_0(X110))
        | r2_hidden(X112,k1_funct_1(k1_latsubgr(X110),X111))
        | ~ r1_rlvect_1(X111,X112) )
      & ( ~ l1_group_1(X110)
        | ~ v4_group_1(X110)
        | ~ v3_group_1(X110)
        | v3_struct_0(X110)
        | ~ m1_group_2(X111,X110)
        | ~ v1_group_1(X111)
        | ~ m1_subset_1(X112,u1_struct_0(X110))
        | r1_rlvect_1(X111,X112)
        | ~ r2_hidden(X112,k1_funct_1(k1_latsubgr(X110),X111)) ) ),
    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_25])])])])]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ m1_group_2(X1,esk1_0)
    | r1_rlvect_1(esk2_0,k2_group_1(X1)) ),
    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_26,c_0_16]),c_0_17]),c_0_18]),c_0_19])]),c_0_20]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ m1_group_2(X1,esk1_0)
    | m1_subset_1(k2_group_1(X1),u1_struct_0(esk1_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_19])]),c_0_20]) ).

cnf(c_0_32,negated_conjecture,
    ~ r2_hidden(k2_group_1(esk1_0),k1_funct_1(k1_latsubgr(esk1_0),esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_33,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_29]) ).

cnf(c_0_34,negated_conjecture,
    v1_group_1(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_35,negated_conjecture,
    r1_rlvect_1(esk2_0,k2_group_1(esk1_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_24]),c_0_16])]) ).

cnf(c_0_36,negated_conjecture,
    m1_subset_1(k2_group_1(esk1_0),u1_struct_0(esk1_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_24]),c_0_16])]) ).

cnf(c_0_37,negated_conjecture,
    $false,
    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(spm,[status(thm)],[c_0_32,c_0_33]),c_0_16]),c_0_17]),c_0_18]),c_0_34]),c_0_19]),c_0_35]),c_0_36])]),c_0_20]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP641+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.38  % Computer : n011.cluster.edu
% 0.13/0.38  % Model    : x86_64 x86_64
% 0.13/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38  % Memory   : 8046.5625MB
% 0.13/0.38  % OS       : Linux 6.8.0-71-generic
% 0.13/0.38  % CPULimit : 300
% 0.13/0.38  % WCLimit  : 300
% 0.13/0.38  % DateTime : Sun Sep 20 20:24:43 UTC 2026
% 0.13/0.38  % CPUTime  : 
% 0.13/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42  Running first-order theorem proving
% 0.13/0.42  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.76/1.35  % Version: 3.5.1
% 0.76/1.35  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.76/1.35  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.76/1.35  % Starting new_bool_3 with 900s (3) cores
% 0.76/1.35  % Starting new_bool_1 with 900s (3) cores
% 0.76/1.35  % Starting sh5l with 300s (1) cores
% 0.76/1.35  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 0.76/1.35  % G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 109898 completed with status 0
% 0.76/1.35  % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.76/1.35  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.76/1.35  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.76/1.35  % Starting new_bool_3 with 900s (3) cores
% 0.76/1.35  % Starting new_bool_1 with 900s (3) cores
% 0.76/1.35  % Starting sh5l with 300s (1) cores
% 0.76/1.35  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 0.76/1.35  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.76/1.35  % SinE strategy is gf120_gu_R02_F100_L20000
% 0.76/1.35  % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.76/1.35  % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.76/1.35  % Starting SubtermCWHack with 28s (1) cores
% 0.76/1.35  % SubtermCWHack with pid 109899 completed with status 0
% 0.76/1.35  % Result found by SubtermCWHack
% 0.76/1.35  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.76/1.35  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.76/1.35  % Starting new_bool_3 with 900s (3) cores
% 0.76/1.35  % Starting new_bool_1 with 900s (3) cores
% 0.76/1.35  % Starting sh5l with 300s (1) cores
% 0.76/1.35  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 0.76/1.35  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.76/1.35  % SinE strategy is gf120_gu_R02_F100_L20000
% 0.76/1.35  % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.76/1.35  % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.76/1.35  % Starting SubtermCWHack with 28s (1) cores
% 0.76/1.35  % Preprocessing time       : 0.015 s
% 0.76/1.35  
% 0.76/1.35  % Proof found!
% 0.76/1.35  % SZS status Theorem
% 0.76/1.35  % SZS output start CNFRefutation
% See solution above
% 0.76/1.35  % Parsed axioms                        : 13983
% 0.76/1.35  % Removed by relevancy pruning/SinE    : 13816
% 0.76/1.35  % Initial clauses                      : 417
% 0.76/1.35  % Removed in clause preprocessing      : 57
% 0.76/1.35  % Initial clauses in saturation        : 360
% 0.76/1.35  % Processed clauses                    : 1529
% 0.76/1.35  % ...of these trivial                  : 12
% 0.76/1.35  % ...subsumed                          : 904
% 0.76/1.35  % ...remaining for further processing  : 613
% 0.76/1.35  % Other redundant clauses eliminated   : 26
% 0.76/1.35  % Clauses deleted for lack of memory   : 0
% 0.76/1.35  % Backward-subsumed                    : 5
% 0.76/1.35  % Backward-rewritten                   : 26
% 0.76/1.35  % Generated clauses                    : 5612
% 0.76/1.35  % ...of the previous two non-redundant : 4457
% 0.76/1.35  % ...aggressively subsumed             : 0
% 0.76/1.35  % Contextual simplify-reflections      : 14
% 0.76/1.35  % Paramodulations                      : 5581
% 0.76/1.35  % Factorizations                       : 2
% 0.76/1.35  % NegExts                              : 0
% 0.76/1.35  % Equation resolutions                 : 29
% 0.76/1.35  % Disequality decompositions           : 0
% 0.76/1.35  % Total rewrite steps                  : 1747
% 0.76/1.35  % ...of those cached                   : 1638
% 0.76/1.35  % Propositional unsat checks           : 0
% 0.76/1.35  %    Propositional check models        : 0
% 0.76/1.35  %    Propositional check unsatisfiable : 0
% 0.76/1.35  %    Propositional clauses             : 0
% 0.76/1.35  %    Propositional clauses after purity: 0
% 0.76/1.35  %    Propositional unsat core size     : 0
% 0.76/1.35  %    Propositional preprocessing time  : 0.000
% 0.76/1.35  %    Propositional encoding time       : 0.000
% 0.76/1.35  %    Propositional solver time         : 0.000
% 0.76/1.35  %    Success case prop preproc time    : 0.000
% 0.76/1.35  %    Success case prop encoding time   : 0.000
% 0.76/1.35  %    Success case prop solver time     : 0.000
% 0.76/1.35  % Current number of processed clauses  : 568
% 0.76/1.35  %    Positive orientable unit clauses  : 71
% 0.76/1.35  %    Positive unorientable unit clauses: 0
% 0.76/1.35  %    Negative unit clauses             : 29
% 0.76/1.35  %    Non-unit-clauses                  : 468
% 0.76/1.35  % Current number of unprocessed clauses: 3220
% 0.76/1.35  % ...number of literals in the above   : 13299
% 0.76/1.35  % Current number of archived formulas  : 0
% 0.76/1.35  % Current number of archived clauses   : 31
% 0.76/1.35  % Clause-clause subsumption calls (NU) : 90452
% 0.76/1.35  % Rec. Clause-clause subsumption calls : 35520
% 0.76/1.35  % Non-unit clause-clause subsumptions  : 663
% 0.76/1.35  % Unit Clause-clause subsumption calls : 5540
% 0.76/1.35  % Rewrite failures with RHS unbound    : 0
% 0.76/1.35  % BW rewrite match attempts            : 25
% 0.76/1.35  % BW rewrite match successes           : 12
% 0.76/1.35  % Condensation attempts                : 0
% 0.76/1.35  % Condensation successes               : 0
% 0.76/1.35  % Termbank termtop insertions          : 442896
% 0.76/1.35  % Search garbage collected termcells   : 127629
% 0.76/1.35  
% 0.76/1.35  % -------------------------------------------------
% 0.76/1.35  % User time                : 0.217 s
% 0.76/1.35  % System time              : 0.060 s
% 0.76/1.35  % Total time               : 0.277 s
% 0.76/1.35  % Maximum resident set size: 28868 pages
% 0.76/1.35  
% 0.76/1.35  % -------------------------------------------------
% 0.76/1.35  % User time                : 0.785 s
% 0.76/1.35  % System time              : 0.095 s
% 0.76/1.35  % Total time               : 0.880 s
% 0.76/1.35  % Maximum resident set size: 23552 pages
% 0.76/1.35  % E exiting
%------------------------------------------------------------------------------