↑ 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  : SEU998^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n026.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 : Wed Sep 30 08:28:13 AM UTC 2026

% Result   : Theorem 0.21s 0.28s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :  167 ( 166 equ;   0 cnn)
%            Maximal formula atoms :   39 (  11 avg)
%            Number of connectives :  578 (  46   ~;   0   |; 146   &; 380   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   58 (  13 avg)
%            Number of types       :    1 (   1 usr)
%            Number of type conns  :   12 (  12   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :  106 (   0   ^;  91   !;  15   ?; 106   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    a: $tType ).

thf(decl_23,type,
    esk1_0: a > a > a ).

thf(decl_24,type,
    esk2_0: a > a > a ).

thf(decl_25,type,
    esk3_0: a ).

thf(decl_26,type,
    esk4_0: a ).

thf(decl_27,type,
    esk5_0: a ).

thf(decl_28,type,
    esk6_0: a ).

thf(decl_29,type,
    esk7_0: a ).

thf(c3_DIAMOND_THM_pme,conjecture,
    ! [X1: a > a > a,X2: a > a > a] :
      ( ( ! [X3: a] :
            ( ( X1 @ X3 @ X3 )
            = X3 )
        & ! [X3: a] :
            ( ( X2 @ X3 @ X3 )
            = X3 )
        & ! [X3: a,X4: a,X5: a] :
            ( ( X1 @ ( X1 @ X3 @ X4 ) @ X5 )
            = ( X1 @ X3 @ ( X1 @ X4 @ X5 ) ) )
        & ! [X3: a,X4: a,X5: a] :
            ( ( X2 @ ( X2 @ X3 @ X4 ) @ X5 )
            = ( X2 @ X3 @ ( X2 @ X4 @ X5 ) ) )
        & ! [X3: a,X4: a] :
            ( ( X1 @ X3 @ X4 )
            = ( X1 @ X4 @ X3 ) )
        & ! [X3: a,X4: a] :
            ( ( X2 @ X3 @ X4 )
            = ( X2 @ X4 @ X3 ) )
        & ! [X3: a,X4: a] :
            ( ( X1 @ ( X2 @ X3 @ X4 ) @ X4 )
            = X4 )
        & ! [X3: a,X4: a] :
            ( ( X2 @ ( X1 @ X3 @ X4 ) @ X4 )
            = X4 ) )
     => ( ? [X3: a,X4: a,X6: a,X7: a,X8: a] :
            ( ( X6 != X7 )
            & ( X6 != X8 )
            & ( X6 != X3 )
            & ( X6 != X4 )
            & ( X7 != X8 )
            & ( X7 != X3 )
            & ( X7 != X4 )
            & ( X8 != X3 )
            & ( X8 != X4 )
            & ( X3 != X4 )
            & ( ( X2 @ X3 @ X4 )
              = X4 )
            & ( ( X1 @ X3 @ X4 )
              = X3 )
            & ( ( X2 @ X3 @ X6 )
              = X6 )
            & ( ( X1 @ X3 @ X6 )
              = X3 )
            & ( ( X2 @ X3 @ X7 )
              = X7 )
            & ( ( X1 @ X3 @ X7 )
              = X3 )
            & ( ( X2 @ X3 @ X8 )
              = X8 )
            & ( ( X1 @ X3 @ X8 )
              = X3 )
            & ( ( X2 @ X6 @ X7 )
              = X4 )
            & ( ( X1 @ X6 @ X7 )
              = X3 )
            & ( ( X2 @ X6 @ X8 )
              = X4 )
            & ( ( X1 @ X6 @ X8 )
              = X3 )
            & ( ( X2 @ X6 @ X4 )
              = X4 )
            & ( ( X1 @ X6 @ X4 )
              = X6 )
            & ( ( X2 @ X7 @ X8 )
              = X4 )
            & ( ( X1 @ X7 @ X8 )
              = X3 )
            & ( ( X2 @ X7 @ X4 )
              = X4 )
            & ( ( X1 @ X7 @ X4 )
              = X7 )
            & ( ( X2 @ X8 @ X4 )
              = X4 )
            & ( ( X1 @ X8 @ X4 )
              = X8 ) )
       => ~ ! [X3: a,X4: a,X5: a] :
              ( ( X2 @ X3 @ ( X1 @ X4 @ X5 ) )
              = ( X1 @ ( X2 @ X3 @ X4 ) @ ( X2 @ X3 @ X5 ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.uiWx9rrBLa/E---3.1_706631.p',c3_DIAMOND_THM_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ! [X1: a > a > a,X2: a > a > a] :
        ( ( ! [X3: a] :
              ( ( X1 @ X3 @ X3 )
              = X3 )
          & ! [X3: a] :
              ( ( X2 @ X3 @ X3 )
              = X3 )
          & ! [X3: a,X4: a,X5: a] :
              ( ( X1 @ ( X1 @ X3 @ X4 ) @ X5 )
              = ( X1 @ X3 @ ( X1 @ X4 @ X5 ) ) )
          & ! [X3: a,X4: a,X5: a] :
              ( ( X2 @ ( X2 @ X3 @ X4 ) @ X5 )
              = ( X2 @ X3 @ ( X2 @ X4 @ X5 ) ) )
          & ! [X3: a,X4: a] :
              ( ( X1 @ X3 @ X4 )
              = ( X1 @ X4 @ X3 ) )
          & ! [X3: a,X4: a] :
              ( ( X2 @ X3 @ X4 )
              = ( X2 @ X4 @ X3 ) )
          & ! [X3: a,X4: a] :
              ( ( X1 @ ( X2 @ X3 @ X4 ) @ X4 )
              = X4 )
          & ! [X3: a,X4: a] :
              ( ( X2 @ ( X1 @ X3 @ X4 ) @ X4 )
              = X4 ) )
       => ( ? [X3: a,X4: a,X6: a,X7: a,X8: a] :
              ( ( X6 != X7 )
              & ( X6 != X8 )
              & ( X6 != X3 )
              & ( X6 != X4 )
              & ( X7 != X8 )
              & ( X7 != X3 )
              & ( X7 != X4 )
              & ( X8 != X3 )
              & ( X8 != X4 )
              & ( X3 != X4 )
              & ( ( X2 @ X3 @ X4 )
                = X4 )
              & ( ( X1 @ X3 @ X4 )
                = X3 )
              & ( ( X2 @ X3 @ X6 )
                = X6 )
              & ( ( X1 @ X3 @ X6 )
                = X3 )
              & ( ( X2 @ X3 @ X7 )
                = X7 )
              & ( ( X1 @ X3 @ X7 )
                = X3 )
              & ( ( X2 @ X3 @ X8 )
                = X8 )
              & ( ( X1 @ X3 @ X8 )
                = X3 )
              & ( ( X2 @ X6 @ X7 )
                = X4 )
              & ( ( X1 @ X6 @ X7 )
                = X3 )
              & ( ( X2 @ X6 @ X8 )
                = X4 )
              & ( ( X1 @ X6 @ X8 )
                = X3 )
              & ( ( X2 @ X6 @ X4 )
                = X4 )
              & ( ( X1 @ X6 @ X4 )
                = X6 )
              & ( ( X2 @ X7 @ X8 )
                = X4 )
              & ( ( X1 @ X7 @ X8 )
                = X3 )
              & ( ( X2 @ X7 @ X4 )
                = X4 )
              & ( ( X1 @ X7 @ X4 )
                = X7 )
              & ( ( X2 @ X8 @ X4 )
                = X4 )
              & ( ( X1 @ X8 @ X4 )
                = X8 ) )
         => ~ ! [X3: a,X4: a,X5: a] :
                ( ( X2 @ X3 @ ( X1 @ X4 @ X5 ) )
                = ( X1 @ ( X2 @ X3 @ X4 ) @ ( X2 @ X3 @ X5 ) ) ) ) ),
    inference(assume_negation,[status(cth)],[c3_DIAMOND_THM_pme]) ).

thf(c_0_2,negated_conjecture,
    ~ ! [X1: a > a > a,X2: a > a > a] :
        ( ( ! [X3: a] :
              ( ( X1 @ X3 @ X3 )
              = X3 )
          & ! [X3: a] :
              ( ( X2 @ X3 @ X3 )
              = X3 )
          & ! [X3: a,X4: a,X5: a] :
              ( ( X1 @ ( X1 @ X3 @ X4 ) @ X5 )
              = ( X1 @ X3 @ ( X1 @ X4 @ X5 ) ) )
          & ! [X3: a,X4: a,X5: a] :
              ( ( X2 @ ( X2 @ X3 @ X4 ) @ X5 )
              = ( X2 @ X3 @ ( X2 @ X4 @ X5 ) ) )
          & ! [X3: a,X4: a] :
              ( ( X1 @ X3 @ X4 )
              = ( X1 @ X4 @ X3 ) )
          & ! [X3: a,X4: a] :
              ( ( X2 @ X3 @ X4 )
              = ( X2 @ X4 @ X3 ) )
          & ! [X3: a,X4: a] :
              ( ( X1 @ ( X2 @ X3 @ X4 ) @ X4 )
              = X4 )
          & ! [X3: a,X4: a] :
              ( ( X2 @ ( X1 @ X3 @ X4 ) @ X4 )
              = X4 ) )
       => ( ? [X3: a,X4: a,X6: a,X7: a,X8: a] :
              ( ( X6 != X7 )
              & ( X6 != X8 )
              & ( X6 != X3 )
              & ( X6 != X4 )
              & ( X7 != X8 )
              & ( X7 != X3 )
              & ( X7 != X4 )
              & ( X8 != X3 )
              & ( X8 != X4 )
              & ( X3 != X4 )
              & ( ( X2 @ X3 @ X4 )
                = X4 )
              & ( ( X1 @ X3 @ X4 )
                = X3 )
              & ( ( X2 @ X3 @ X6 )
                = X6 )
              & ( ( X1 @ X3 @ X6 )
                = X3 )
              & ( ( X2 @ X3 @ X7 )
                = X7 )
              & ( ( X1 @ X3 @ X7 )
                = X3 )
              & ( ( X2 @ X3 @ X8 )
                = X8 )
              & ( ( X1 @ X3 @ X8 )
                = X3 )
              & ( ( X2 @ X6 @ X7 )
                = X4 )
              & ( ( X1 @ X6 @ X7 )
                = X3 )
              & ( ( X2 @ X6 @ X8 )
                = X4 )
              & ( ( X1 @ X6 @ X8 )
                = X3 )
              & ( ( X2 @ X6 @ X4 )
                = X4 )
              & ( ( X1 @ X6 @ X4 )
                = X6 )
              & ( ( X2 @ X7 @ X8 )
                = X4 )
              & ( ( X1 @ X7 @ X8 )
                = X3 )
              & ( ( X2 @ X7 @ X4 )
                = X4 )
              & ( ( X1 @ X7 @ X4 )
                = X7 )
              & ( ( X2 @ X8 @ X4 )
                = X4 )
              & ( ( X1 @ X8 @ X4 )
                = X8 ) )
         => ~ ! [X3: a,X4: a,X5: a] :
                ( ( X2 @ X3 @ ( X1 @ X4 @ X5 ) )
                = ( X1 @ ( X2 @ X3 @ X4 ) @ ( X2 @ X3 @ X5 ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_1]) ).

thf(c_0_3,negated_conjecture,
    ! [X37: a,X38: a,X39: a,X40: a,X41: a,X42: a,X43: a,X44: a,X45: a,X46: a,X47: a,X48: a,X49: a,X50: a,X51: a,X52: a,X58: a,X59: a,X60: a] :
      ( ( ( esk1_0 @ X37 @ X37 )
        = X37 )
      & ( ( esk2_0 @ X38 @ X38 )
        = X38 )
      & ( ( esk1_0 @ ( esk1_0 @ X39 @ X40 ) @ X41 )
        = ( esk1_0 @ X39 @ ( esk1_0 @ X40 @ X41 ) ) )
      & ( ( esk2_0 @ ( esk2_0 @ X42 @ X43 ) @ X44 )
        = ( esk2_0 @ X42 @ ( esk2_0 @ X43 @ X44 ) ) )
      & ( ( esk1_0 @ X45 @ X46 )
        = ( esk1_0 @ X46 @ X45 ) )
      & ( ( esk2_0 @ X47 @ X48 )
        = ( esk2_0 @ X48 @ X47 ) )
      & ( ( esk1_0 @ ( esk2_0 @ X49 @ X50 ) @ X50 )
        = X50 )
      & ( ( esk2_0 @ ( esk1_0 @ X51 @ X52 ) @ X52 )
        = X52 )
      & ( esk5_0 != esk6_0 )
      & ( esk5_0 != esk7_0 )
      & ( esk5_0 != esk3_0 )
      & ( esk5_0 != esk4_0 )
      & ( esk6_0 != esk7_0 )
      & ( esk6_0 != esk3_0 )
      & ( esk6_0 != esk4_0 )
      & ( esk7_0 != esk3_0 )
      & ( esk7_0 != esk4_0 )
      & ( esk3_0 != esk4_0 )
      & ( ( esk2_0 @ esk3_0 @ esk4_0 )
        = esk4_0 )
      & ( ( esk1_0 @ esk3_0 @ esk4_0 )
        = esk3_0 )
      & ( ( esk2_0 @ esk3_0 @ esk5_0 )
        = esk5_0 )
      & ( ( esk1_0 @ esk3_0 @ esk5_0 )
        = esk3_0 )
      & ( ( esk2_0 @ esk3_0 @ esk6_0 )
        = esk6_0 )
      & ( ( esk1_0 @ esk3_0 @ esk6_0 )
        = esk3_0 )
      & ( ( esk2_0 @ esk3_0 @ esk7_0 )
        = esk7_0 )
      & ( ( esk1_0 @ esk3_0 @ esk7_0 )
        = esk3_0 )
      & ( ( esk2_0 @ esk5_0 @ esk6_0 )
        = esk4_0 )
      & ( ( esk1_0 @ esk5_0 @ esk6_0 )
        = esk3_0 )
      & ( ( esk2_0 @ esk5_0 @ esk7_0 )
        = esk4_0 )
      & ( ( esk1_0 @ esk5_0 @ esk7_0 )
        = esk3_0 )
      & ( ( esk2_0 @ esk5_0 @ esk4_0 )
        = esk4_0 )
      & ( ( esk1_0 @ esk5_0 @ esk4_0 )
        = esk5_0 )
      & ( ( esk2_0 @ esk6_0 @ esk7_0 )
        = esk4_0 )
      & ( ( esk1_0 @ esk6_0 @ esk7_0 )
        = esk3_0 )
      & ( ( esk2_0 @ esk6_0 @ esk4_0 )
        = esk4_0 )
      & ( ( esk1_0 @ esk6_0 @ esk4_0 )
        = esk6_0 )
      & ( ( esk2_0 @ esk7_0 @ esk4_0 )
        = esk4_0 )
      & ( ( esk1_0 @ esk7_0 @ esk4_0 )
        = esk7_0 )
      & ( ( esk2_0 @ X58 @ ( esk1_0 @ X59 @ X60 ) )
        = ( esk1_0 @ ( esk2_0 @ X58 @ X59 ) @ ( esk2_0 @ X58 @ X60 ) ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).

thf(c_0_4,negated_conjecture,
    ! [X3: a,X4: a,X5: a] :
      ( ( esk2_0 @ X3 @ ( esk1_0 @ X4 @ X5 ) )
      = ( esk1_0 @ ( esk2_0 @ X3 @ X4 ) @ ( esk2_0 @ X3 @ X5 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ( ( esk2_0 @ esk5_0 @ esk7_0 )
    = esk4_0 ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_6,negated_conjecture,
    ! [X4: a,X3: a] :
      ( ( esk1_0 @ X3 @ X4 )
      = ( esk1_0 @ X4 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_7,negated_conjecture,
    ! [X3: a] :
      ( ( esk1_0 @ esk4_0 @ ( esk2_0 @ esk5_0 @ X3 ) )
      = ( esk2_0 @ esk5_0 @ ( esk1_0 @ X3 @ esk7_0 ) ) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).

thf(c_0_8,negated_conjecture,
    ( ( esk2_0 @ esk5_0 @ esk6_0 )
    = esk4_0 ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_9,negated_conjecture,
    ! [X3: a] :
      ( ( esk1_0 @ X3 @ X3 )
      = X3 ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_10,negated_conjecture,
    ( ( esk1_0 @ esk6_0 @ esk7_0 )
    = esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_11,negated_conjecture,
    ! [X4: a,X3: a] :
      ( ( esk2_0 @ X3 @ X4 )
      = ( esk2_0 @ X4 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_12,negated_conjecture,
    ( ( esk2_0 @ esk3_0 @ esk5_0 )
    = esk5_0 ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_13,negated_conjecture,
    esk5_0 != esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_14,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10]),c_0_11]),c_0_12]),c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU998^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18  % Computer : n026.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Tue Sep 29 15:00:12 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22  Running higher-order theorem proving
% 0.07/0.24  Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.uiWx9rrBLa/E---3.1_706631.p
% 0.21/0.28  % Version: 3.5.1-ho
% 0.21/0.28  % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.21/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28  % Starting post_as_ho1 with 1500s (5) cores
% 0.21/0.28  % Starting post_as_ho12 with 300s (1) cores
% 0.21/0.28  % Starting new_ho_3 with 300s (1) cores
% 0.21/0.28  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.28  % post_as_ho1 with pid 706660 completed with status 0
% 0.21/0.28  % Result found by post_as_ho1
% 0.21/0.28  % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.21/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28  % Starting post_as_ho1 with 1500s (5) cores
% 0.21/0.28  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.28  % No SInE strategy applied
% 0.21/0.28  % Search class: HUUPM-FFMM00-SSSFFFNN
% 0.21/0.28  % partial match(3): HUUPF-FFSF00-SSSFFFNN
% 0.21/0.28  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.28  % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.28  % Starting post_as_ho1 with 151s (1) cores
% 0.21/0.28  % Starting sh5l with 136s (1) cores
% 0.21/0.28  % Starting new_bool_1 with 136s (1) cores
% 0.21/0.28  % Starting new_bool_2 with 136s (1) cores
% 0.21/0.28  % post_as_ho1 with pid 706668 completed with status 0
% 0.21/0.28  % Result found by post_as_ho1
% 0.21/0.28  % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.21/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28  % Starting post_as_ho1 with 1500s (5) cores
% 0.21/0.28  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.28  % No SInE strategy applied
% 0.21/0.28  % Search class: HUUPM-FFMM00-SSSFFFNN
% 0.21/0.28  % partial match(3): HUUPF-FFSF00-SSSFFFNN
% 0.21/0.28  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.28  % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.28  % Starting post_as_ho1 with 151s (1) cores
% 0.21/0.28  % Preprocessing time       : 0.001 s
% 0.21/0.28  % Presaturation interreduction done
% 0.21/0.28  
% 0.21/0.28  % Proof found!
% 0.21/0.28  % SZS status Theorem
% 0.21/0.28  % SZS output start CNFRefutation
% See solution above
% 0.21/0.28  % Parsed axioms                        : 2
% 0.21/0.28  % Removed by relevancy pruning/SinE    : 0
% 0.21/0.28  % Initial clauses                      : 40
% 0.21/0.28  % Removed in clause preprocessing      : 1
% 0.21/0.28  % Initial clauses in saturation        : 39
% 0.21/0.28  % Processed clauses                    : 281
% 0.21/0.28  % ...of these trivial                  : 69
% 0.21/0.28  % ...subsumed                          : 62
% 0.21/0.28  % ...remaining for further processing  : 150
% 0.21/0.28  % Other redundant clauses eliminated   : 0
% 0.21/0.28  % Clauses deleted for lack of memory   : 0
% 0.21/0.28  % Backward-subsumed                    : 0
% 0.21/0.28  % Backward-rewritten                   : 9
% 0.21/0.28  % Generated clauses                    : 2116
% 0.21/0.28  % ...of the previous two non-redundant : 1260
% 0.21/0.28  % ...aggressively subsumed             : 0
% 0.21/0.28  % Contextual simplify-reflections      : 0
% 0.21/0.28  % Paramodulations                      : 2116
% 0.21/0.28  % Factorizations                       : 0
% 0.21/0.28  % NegExts                              : 0
% 0.21/0.28  % Equation resolutions                 : 0
% 0.21/0.28  % Disequality decompositions           : 0
% 0.21/0.28  % Total rewrite steps                  : 1974
% 0.21/0.28  % ...of those cached                   : 1466
% 0.21/0.28  % Propositional unsat checks           : 0
% 0.21/0.28  %    Propositional check models        : 0
% 0.21/0.28  %    Propositional check unsatisfiable : 0
% 0.21/0.28  %    Propositional clauses             : 0
% 0.21/0.28  %    Propositional clauses after purity: 0
% 0.21/0.28  %    Propositional unsat core size     : 0
% 0.21/0.28  %    Propositional preprocessing time  : 0.000
% 0.21/0.28  %    Propositional encoding time       : 0.000
% 0.21/0.28  %    Propositional solver time         : 0.000
% 0.21/0.28  %    Success case prop preproc time    : 0.000
% 0.21/0.28  %    Success case prop encoding time   : 0.000
% 0.21/0.28  %    Success case prop solver time     : 0.000
% 0.21/0.28  % Current number of processed clauses  : 102
% 0.21/0.28  %    Positive orientable unit clauses  : 86
% 0.21/0.28  %    Positive unorientable unit clauses: 6
% 0.21/0.28  %    Negative unit clauses             : 10
% 0.21/0.28  %    Non-unit-clauses                  : 0
% 0.21/0.28  % Current number of unprocessed clauses: 1038
% 0.21/0.28  % ...number of literals in the above   : 1038
% 0.21/0.28  % Current number of archived formulas  : 0
% 0.21/0.28  % Current number of archived clauses   : 48
% 0.21/0.28  % Clause-clause subsumption calls (NU) : 0
% 0.21/0.28  % Rec. Clause-clause subsumption calls : 0
% 0.21/0.28  % Non-unit clause-clause subsumptions  : 0
% 0.21/0.28  % Unit Clause-clause subsumption calls : 6
% 0.21/0.28  % Rewrite failures with RHS unbound    : 0
% 0.21/0.28  % BW rewrite match attempts            : 175
% 0.21/0.28  % BW rewrite match successes           : 141
% 0.21/0.28  % Condensation attempts                : 0
% 0.21/0.28  % Condensation successes               : 0
% 0.21/0.28  % Termbank termtop insertions          : 17216
% 0.21/0.28  % Search garbage collected termcells   : 948
% 0.21/0.28  
% 0.21/0.28  % -------------------------------------------------
% 0.21/0.28  % User time                : 0.027 s
% 0.21/0.28  % System time              : 0.005 s
% 0.21/0.28  % Total time               : 0.031 s
% 0.21/0.28  % Maximum resident set size: 3648 pages
% 0.21/0.28  
% 0.21/0.28  % -------------------------------------------------
% 0.21/0.28  % User time                : 0.101 s
% 0.21/0.28  % System time              : 0.021 s
% 0.21/0.28  % Total time               : 0.123 s
% 0.21/0.28  % Maximum resident set size: 4864 pages
% 0.21/0.28  % E exiting
%------------------------------------------------------------------------------