TSTP Solution File: SEU861^5 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SEU861^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n010.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 : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 03:30:42 EDT 2024

% Result   : Theorem 0.21s 0.51s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   41 (   2 unt;  10 typ;   0 def)
%            Number of atoms       :  169 (  15 equ;   0 cnn)
%            Maximal formula atoms :   34 (   5 avg)
%            Number of connectives :  443 (  55   ~;  87   |;  21   &; 260   @)
%                                         (   0 <=>;  20  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (   8 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   91 (  91   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   9 usr;   1 con; 0-3 aty)
%            Number of variables   :   78 (   0   ^  74   !;   4   ?;  78   :)

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

thf(decl_22,type,
    cB: a > $o ).

thf(decl_23,type,
    cC: a > $o ).

thf(decl_24,type,
    epred1_1: ( ( a > $o ) > $o ) > a > $o ).

thf(decl_25,type,
    epred2_1: ( ( a > $o ) > $o ) > a > $o ).

thf(decl_26,type,
    esk1_1: ( ( a > $o ) > $o ) > a ).

thf(decl_27,type,
    epred3_1: ( ( a > $o ) > $o ) > a > $o ).

thf(decl_28,type,
    epred4_0: ( a > $o ) > $o ).

thf(decl_29,type,
    esk2_1: ( a > $o ) > a ).

thf(decl_30,type,
    esk3_3: ( a > $o ) > a > ( a > $o ) > a ).

thf(cTHM531E_pme,conjecture,
    ( ( ! [X1: ( a > $o ) > $o] :
          ( ( ! [X2: a > $o] :
                ( ~ ? [X3: a] : ( X2 @ X3 )
               => ( X1 @ X2 ) )
            & ! [X4: a > $o,X5: a,X6: a > $o] :
                ( ( ( X1 @ X4 )
                  & ! [X7: a] :
                      ( ( X6 @ X7 )
                     => ( ( X4 @ X7 )
                        | ( X7 = X5 ) ) ) )
               => ( X1 @ X6 ) ) )
         => ( X1 @ cC ) )
      & ! [X5: a] :
          ( ( cB @ X5 )
         => ( cC @ X5 ) ) )
   => ! [X1: ( a > $o ) > $o] :
        ( ( ! [X2: a > $o] :
              ( ~ ? [X3: a] : ( X2 @ X3 )
             => ( X1 @ X2 ) )
          & ! [X4: a > $o,X5: a,X6: a > $o] :
              ( ( ( X1 @ X4 )
                & ! [X8: a] :
                    ( ( X6 @ X8 )
                   => ( ( X4 @ X8 )
                      | ( X8 = X5 ) ) ) )
             => ( X1 @ X6 ) ) )
       => ( X1 @ cB ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM531E_pme) ).

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

thf(c_0_2,negated_conjecture,
    ! [X24: ( a > $o ) > $o,X26: a,X30: a,X31: a,X33: a > $o,X35: a > $o,X36: a,X37: a > $o] :
      ( ( ( X24 @ ( epred2_1 @ X24 ) )
        | ~ ( epred1_1 @ X24 @ X26 )
        | ( X24 @ cC ) )
      & ( ~ ( epred3_1 @ X24 @ X30 )
        | ( epred2_1 @ X24 @ X30 )
        | ( X30
          = ( esk1_1 @ X24 ) )
        | ~ ( epred1_1 @ X24 @ X26 )
        | ( X24 @ cC ) )
      & ( ~ ( X24 @ ( epred3_1 @ X24 ) )
        | ~ ( epred1_1 @ X24 @ X26 )
        | ( X24 @ cC ) )
      & ( ( X24 @ ( epred2_1 @ X24 ) )
        | ~ ( X24 @ ( epred1_1 @ X24 ) )
        | ( X24 @ cC ) )
      & ( ~ ( epred3_1 @ X24 @ X30 )
        | ( epred2_1 @ X24 @ X30 )
        | ( X30
          = ( esk1_1 @ X24 ) )
        | ~ ( X24 @ ( epred1_1 @ X24 ) )
        | ( X24 @ cC ) )
      & ( ~ ( X24 @ ( epred3_1 @ X24 ) )
        | ~ ( X24 @ ( epred1_1 @ X24 ) )
        | ( X24 @ cC ) )
      & ( ~ ( cB @ X31 )
        | ( cC @ X31 ) )
      & ( ( X33 @ ( esk2_1 @ X33 ) )
        | ( epred4_0 @ X33 ) )
      & ( ( X37 @ ( esk3_3 @ X35 @ X36 @ X37 ) )
        | ~ ( epred4_0 @ X35 )
        | ( epred4_0 @ X37 ) )
      & ( ~ ( X35 @ ( esk3_3 @ X35 @ X36 @ X37 ) )
        | ~ ( epred4_0 @ X35 )
        | ( epred4_0 @ X37 ) )
      & ( ( ( esk3_3 @ X35 @ X36 @ X37 )
         != X36 )
        | ~ ( epred4_0 @ X35 )
        | ( epred4_0 @ X37 ) )
      & ~ ( epred4_0 @ cB ) ),
    inference(distribute,[status(thm)],[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_1])])])])])]) ).

thf(c_0_3,negated_conjecture,
    ! [X1: ( a > $o ) > $o,X3: a,X5: a] :
      ( ( epred2_1 @ X1 @ X3 )
      | ( X3
        = ( esk1_1 @ X1 ) )
      | ( X1 @ cC )
      | ~ ( epred3_1 @ X1 @ X3 )
      | ~ ( epred1_1 @ X1 @ X5 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X2: a > $o] :
      ( ( X2 @ ( esk2_1 @ X2 ) )
      | ( epred4_0 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ! [X1: ( a > $o ) > $o,X3: a] :
      ( ( X3
        = ( esk1_1 @ X1 ) )
      | ( epred4_0 @ ( epred1_1 @ X1 ) )
      | ( epred2_1 @ X1 @ X3 )
      | ( X1 @ cC )
      | ~ ( epred3_1 @ X1 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

thf(c_0_6,negated_conjecture,
    ! [X2: a > $o,X3: a,X4: a > $o] :
      ( ( X2 @ ( esk3_3 @ X4 @ X3 @ X2 ) )
      | ( epred4_0 @ X2 )
      | ~ ( epred4_0 @ X4 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_7,negated_conjecture,
    ! [X4: a > $o,X3: a,X2: a > $o] :
      ( ( epred4_0 @ X4 )
      | ~ ( X2 @ ( esk3_3 @ X2 @ X3 @ X4 ) )
      | ~ ( epred4_0 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_8,negated_conjecture,
    ! [X1: ( a > $o ) > $o,X3: a,X2: a > $o] :
      ( ( ( esk3_3 @ X2 @ X3 @ ( epred3_1 @ X1 ) )
        = ( esk1_1 @ X1 ) )
      | ( epred2_1 @ X1 @ ( esk3_3 @ X2 @ X3 @ ( epred3_1 @ X1 ) ) )
      | ( epred4_0 @ ( epred3_1 @ X1 ) )
      | ( epred4_0 @ ( epred1_1 @ X1 ) )
      | ( X1 @ cC )
      | ~ ( epred4_0 @ X2 ) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

thf(c_0_9,negated_conjecture,
    ! [X3: a] :
      ( ( cC @ X3 )
      | ~ ( cB @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_10,negated_conjecture,
    ~ ( epred4_0 @ cB ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_11,negated_conjecture,
    ! [X3: a,X1: ( a > $o ) > $o] :
      ( ( epred2_1 @ X1 @ X3 )
      | ( X3
        = ( esk1_1 @ X1 ) )
      | ( X1 @ cC )
      | ~ ( epred3_1 @ X1 @ X3 )
      | ~ ( X1 @ ( epred1_1 @ X1 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_12,negated_conjecture,
    ! [X1: ( a > $o ) > $o,X3: a] :
      ( ( X1 @ cC )
      | ~ ( X1 @ ( epred3_1 @ X1 ) )
      | ~ ( epred1_1 @ X1 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_13,negated_conjecture,
    ! [X4: a > $o,X3: a,X2: a > $o] :
      ( ( epred4_0 @ X4 )
      | ( ( esk3_3 @ X2 @ X3 @ X4 )
       != X3 )
      | ~ ( epred4_0 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_14,negated_conjecture,
    ! [X3: a,X1: ( a > $o ) > $o] :
      ( ( ( esk3_3 @ ( epred2_1 @ X1 ) @ X3 @ ( epred3_1 @ X1 ) )
        = ( esk1_1 @ X1 ) )
      | ( epred4_0 @ ( epred1_1 @ X1 ) )
      | ( epred4_0 @ ( epred3_1 @ X1 ) )
      | ( X1 @ cC )
      | ~ ( epred4_0 @ ( epred2_1 @ X1 ) ) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

thf(c_0_15,negated_conjecture,
    ! [X3: a,X2: a > $o] :
      ( ( cC @ ( esk3_3 @ X2 @ X3 @ cB ) )
      | ~ ( epred4_0 @ X2 ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_6]),c_0_10]) ).

thf(c_0_16,negated_conjecture,
    ! [X1: ( a > $o ) > $o,X3: a,X2: a > $o] :
      ( ( ( esk3_3 @ X2 @ X3 @ ( epred3_1 @ X1 ) )
        = ( esk1_1 @ X1 ) )
      | ( epred2_1 @ X1 @ ( esk3_3 @ X2 @ X3 @ ( epred3_1 @ X1 ) ) )
      | ( epred4_0 @ ( epred3_1 @ X1 ) )
      | ( X1 @ cC )
      | ~ ( X1 @ ( epred1_1 @ X1 ) )
      | ~ ( epred4_0 @ X2 ) ),
    inference(spm,[status(thm)],[c_0_11,c_0_6]) ).

thf(c_0_17,negated_conjecture,
    ! [X1: ( a > $o ) > $o] :
      ( ( epred4_0 @ ( epred1_1 @ X1 ) )
      | ( X1 @ cC )
      | ~ ( X1 @ ( epred3_1 @ X1 ) ) ),
    inference(spm,[status(thm)],[c_0_12,c_0_4]) ).

thf(c_0_18,negated_conjecture,
    ! [X1: ( a > $o ) > $o] :
      ( ( epred4_0 @ ( epred1_1 @ X1 ) )
      | ( epred4_0 @ ( epred3_1 @ X1 ) )
      | ( X1 @ cC )
      | ~ ( epred4_0 @ ( epred2_1 @ X1 ) ) ),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14])]) ).

thf(c_0_19,negated_conjecture,
    ~ ( epred4_0 @ cC ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_15]),c_0_10]) ).

thf(c_0_20,negated_conjecture,
    ! [X1: ( a > $o ) > $o,X3: a] :
      ( ( X1 @ ( epred2_1 @ X1 ) )
      | ( X1 @ cC )
      | ~ ( epred1_1 @ X1 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_21,negated_conjecture,
    ! [X3: a,X1: ( a > $o ) > $o] :
      ( ( ( esk3_3 @ ( epred2_1 @ X1 ) @ X3 @ ( epred3_1 @ X1 ) )
        = ( esk1_1 @ X1 ) )
      | ( epred4_0 @ ( epred3_1 @ X1 ) )
      | ( X1 @ cC )
      | ~ ( epred4_0 @ ( epred2_1 @ X1 ) )
      | ~ ( X1 @ ( epred1_1 @ X1 ) ) ),
    inference(spm,[status(thm)],[c_0_7,c_0_16]) ).

thf(c_0_22,negated_conjecture,
    ( ( epred4_0 @ ( epred1_1 @ epred4_0 ) )
    | ~ ( epred4_0 @ ( epred2_1 @ epred4_0 ) ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

thf(c_0_23,negated_conjecture,
    ! [X1: ( a > $o ) > $o] :
      ( ( epred4_0 @ ( epred1_1 @ X1 ) )
      | ( X1 @ ( epred2_1 @ X1 ) )
      | ( X1 @ cC ) ),
    inference(spm,[status(thm)],[c_0_20,c_0_4]) ).

thf(c_0_24,negated_conjecture,
    ! [X1: ( a > $o ) > $o] :
      ( ( epred4_0 @ ( epred3_1 @ X1 ) )
      | ( X1 @ cC )
      | ~ ( epred4_0 @ ( epred2_1 @ X1 ) )
      | ~ ( X1 @ ( epred1_1 @ X1 ) ) ),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_21])]) ).

thf(c_0_25,negated_conjecture,
    epred4_0 @ ( epred1_1 @ epred4_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19]) ).

thf(c_0_26,negated_conjecture,
    ! [X1: ( a > $o ) > $o] :
      ( ( X1 @ cC )
      | ~ ( X1 @ ( epred3_1 @ X1 ) )
      | ~ ( X1 @ ( epred1_1 @ X1 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_27,negated_conjecture,
    ( ( epred4_0 @ ( epred3_1 @ epred4_0 ) )
    | ~ ( epred4_0 @ ( epred2_1 @ epred4_0 ) ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_19]) ).

thf(c_0_28,negated_conjecture,
    ~ ( epred4_0 @ ( epred2_1 @ epred4_0 ) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25])]),c_0_19]) ).

thf(c_0_29,negated_conjecture,
    ! [X1: ( a > $o ) > $o] :
      ( ( X1 @ ( epred2_1 @ X1 ) )
      | ( X1 @ cC )
      | ~ ( X1 @ ( epred1_1 @ X1 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_30,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_25])]),c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SEU861^5 : TPTP v8.2.0. Released v4.0.0.
% 0.14/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n010.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 19 17:12:38 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.21/0.48  Running higher-order theorem proving
% 0.21/0.49  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/benchmark/theBenchmark.p
% 0.21/0.51  # Version: 3.1.0-ho
% 0.21/0.51  # Preprocessing class: HSMSSMSSSSSNHHA.
% 0.21/0.51  # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting full_lambda_6 with 900s (3) cores
% 0.21/0.51  # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.51  # Starting lpo6_lambda_fix with 300s (1) cores
% 0.21/0.51  # Starting ho_unfolding_1 with 300s (1) cores
% 0.21/0.51  # Starting new_ho_10_unif with 300s (1) cores
% 0.21/0.51  # Starting ho_unfolding_2 with 300s (1) cores
% 0.21/0.51  # full_lambda_6 with pid 28895 completed with status 0
% 0.21/0.51  # Result found by full_lambda_6
% 0.21/0.51  # Preprocessing class: HSMSSMSSSSSNHHA.
% 0.21/0.51  # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting full_lambda_6 with 900s (3) cores
% 0.21/0.51  # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.21/0.51  # Search class: HGUSF-FFSF31-SHHFFMBN
% 0.21/0.51  # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 0.21/0.51  # Starting new_ho_10 with 487s (1) cores
% 0.21/0.51  # Starting full_lambda_6 with 91s (1) cores
% 0.21/0.51  # Starting sh2lt with 82s (1) cores
% 0.21/0.51  # new_ho_10 with pid 28901 completed with status 0
% 0.21/0.51  # Result found by new_ho_10
% 0.21/0.51  # Preprocessing class: HSMSSMSSSSSNHHA.
% 0.21/0.51  # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting full_lambda_6 with 900s (3) cores
% 0.21/0.51  # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.21/0.51  # Search class: HGUSF-FFSF31-SHHFFMBN
% 0.21/0.51  # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 0.21/0.51  # Starting new_ho_10 with 487s (1) cores
% 0.21/0.51  # Preprocessing time       : 0.002 s
% 0.21/0.51  # Presaturation interreduction done
% 0.21/0.51  
% 0.21/0.51  # Proof found!
% 0.21/0.51  # SZS status Theorem
% 0.21/0.51  # SZS output start CNFRefutation
% See solution above
% 0.21/0.51  # Parsed axioms                        : 4
% 0.21/0.51  # Removed by relevancy pruning/SinE    : 3
% 0.21/0.51  # Initial clauses                      : 12
% 0.21/0.51  # Removed in clause preprocessing      : 0
% 0.21/0.51  # Initial clauses in saturation        : 12
% 0.21/0.51  # Processed clauses                    : 47
% 0.21/0.51  # ...of these trivial                  : 0
% 0.21/0.51  # ...subsumed                          : 2
% 0.21/0.51  # ...remaining for further processing  : 45
% 0.21/0.51  # Other redundant clauses eliminated   : 2
% 0.21/0.51  # Clauses deleted for lack of memory   : 0
% 0.21/0.51  # Backward-subsumed                    : 6
% 0.21/0.51  # Backward-rewritten                   : 1
% 0.21/0.51  # Generated clauses                    : 34
% 0.21/0.51  # ...of the previous two non-redundant : 26
% 0.21/0.51  # ...aggressively subsumed             : 0
% 0.21/0.51  # Contextual simplify-reflections      : 0
% 0.21/0.51  # Paramodulations                      : 32
% 0.21/0.51  # Factorizations                       : 0
% 0.21/0.51  # NegExts                              : 0
% 0.21/0.51  # Equation resolutions                 : 2
% 0.21/0.51  # Disequality decompositions           : 0
% 0.21/0.51  # Total rewrite steps                  : 5
% 0.21/0.51  # ...of those cached                   : 4
% 0.21/0.51  # Propositional unsat checks           : 0
% 0.21/0.51  #    Propositional check models        : 0
% 0.21/0.51  #    Propositional check unsatisfiable : 0
% 0.21/0.51  #    Propositional clauses             : 0
% 0.21/0.51  #    Propositional clauses after purity: 0
% 0.21/0.51  #    Propositional unsat core size     : 0
% 0.21/0.51  #    Propositional preprocessing time  : 0.000
% 0.21/0.51  #    Propositional encoding time       : 0.000
% 0.21/0.51  #    Propositional solver time         : 0.000
% 0.21/0.51  #    Success case prop preproc time    : 0.000
% 0.21/0.51  #    Success case prop encoding time   : 0.000
% 0.21/0.51  #    Success case prop solver time     : 0.000
% 0.21/0.51  # Current number of processed clauses  : 26
% 0.21/0.51  #    Positive orientable unit clauses  : 2
% 0.21/0.51  #    Positive unorientable unit clauses: 0
% 0.21/0.51  #    Negative unit clauses             : 3
% 0.21/0.51  #    Non-unit-clauses                  : 21
% 0.21/0.51  # Current number of unprocessed clauses: 0
% 0.21/0.51  # ...number of literals in the above   : 0
% 0.21/0.51  # Current number of archived formulas  : 0
% 0.21/0.51  # Current number of archived clauses   : 19
% 0.21/0.51  # Clause-clause subsumption calls (NU) : 250
% 0.21/0.51  # Rec. Clause-clause subsumption calls : 30
% 0.21/0.51  # Non-unit clause-clause subsumptions  : 7
% 0.21/0.51  # Unit Clause-clause subsumption calls : 9
% 0.21/0.51  # Rewrite failures with RHS unbound    : 0
% 0.21/0.51  # BW rewrite match attempts            : 1
% 0.21/0.51  # BW rewrite match successes           : 1
% 0.21/0.51  # Condensation attempts                : 47
% 0.21/0.51  # Condensation successes               : 0
% 0.21/0.51  # Termbank termtop insertions          : 2818
% 0.21/0.51  # Search garbage collected termcells   : 498
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.008 s
% 0.21/0.51  # System time              : 0.006 s
% 0.21/0.51  # Total time               : 0.014 s
% 0.21/0.51  # Maximum resident set size: 1896 pages
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.027 s
% 0.21/0.51  # System time              : 0.013 s
% 0.21/0.51  # Total time               : 0.040 s
% 0.21/0.51  # Maximum resident set size: 1728 pages
% 0.21/0.51  % E---3.1 exiting
% 0.21/0.51  % E exiting
%------------------------------------------------------------------------------