TSTP Solution File: NUM824^5 by E-SAT---2.6.X

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---2.6.X
% Problem  : NUM824^5 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n014.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  : 600s
% DateTime : Mon Jul 18 09:28:30 EDT 2022

% Result   : Theorem 0.18s 0.50s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   39 (   1 unt;   0 typ;   0 def)
%            Number of atoms       :  269 (   0 equ;   0 cnn)
%            Maximal formula atoms :   51 (   6 avg)
%            Number of connectives :  608 (  90   ~; 130   |;  21   &; 351   @)
%                                         (   0 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   9 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   34 (  34   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   8 usr;   9 con; 0-0 aty)
%            Number of variables   :   78 (   0   ^  78   !;   0   ?;  78   :)

% Comments : 
%------------------------------------------------------------------------------
thf(cTHM623_pme,conjecture,
    ( ( ! [X1: $i > $o,X2: $i > $o] :
          ( ( ( X1 @ c0 )
            & ! [X3: $i] :
                ( ( X1 @ X3 )
               => ( X2 @ ( cS @ X3 ) ) )
            & ! [X4: $i] :
                ( ( X2 @ X4 )
               => ( X1 @ ( cS @ X4 ) ) ) )
         => ( ! [X5: $i] :
                ( ( cEVEN @ X5 )
               => ( X1 @ X5 ) )
            & ! [X5: $i] :
                ( ( cODD @ X5 )
               => ( X2 @ X5 ) ) ) )
      & ( cN @ c0 )
      & ! [X6: $i] :
          ( ( cN @ X6 )
         => ( cN @ ( cS @ X6 ) ) ) )
   => ! [X7: $i] :
        ( ( ( cEVEN @ X7 )
          | ( cODD @ X7 ) )
       => ( cN @ X7 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM623_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ( ( ! [X1: $i > $o,X2: $i > $o] :
            ( ( ( X1 @ c0 )
              & ! [X3: $i] :
                  ( ( X1 @ X3 )
                 => ( X2 @ ( cS @ X3 ) ) )
              & ! [X4: $i] :
                  ( ( X2 @ X4 )
                 => ( X1 @ ( cS @ X4 ) ) ) )
           => ( ! [X5: $i] :
                  ( ( cEVEN @ X5 )
                 => ( X1 @ X5 ) )
              & ! [X5: $i] :
                  ( ( cODD @ X5 )
                 => ( X2 @ X5 ) ) ) )
        & ( cN @ c0 )
        & ! [X6: $i] :
            ( ( cN @ X6 )
           => ( cN @ ( cS @ X6 ) ) ) )
     => ! [X7: $i] :
          ( ( ( cEVEN @ X7 )
            | ( cODD @ X7 ) )
         => ( cN @ X7 ) ) ),
    inference(assume_negation,[status(cth)],[cTHM623_pme]) ).

thf(c_0_2,negated_conjecture,
    ! [X16: $i > $o,X17: $i > $o,X20: $i,X21: $i,X22: $i] :
      ( ( ~ ( cEVEN @ X20 )
        | ( X16 @ X20 )
        | ( X17 @ ( esk2_2 @ X16 @ X17 ) )
        | ( X16 @ ( esk1_2 @ X16 @ X17 ) )
        | ~ ( X16 @ c0 ) )
      & ( ~ ( cODD @ X21 )
        | ( X17 @ X21 )
        | ( X17 @ ( esk2_2 @ X16 @ X17 ) )
        | ( X16 @ ( esk1_2 @ X16 @ X17 ) )
        | ~ ( X16 @ c0 ) )
      & ( ~ ( cEVEN @ X20 )
        | ( X16 @ X20 )
        | ~ ( X16 @ ( cS @ ( esk2_2 @ X16 @ X17 ) ) )
        | ( X16 @ ( esk1_2 @ X16 @ X17 ) )
        | ~ ( X16 @ c0 ) )
      & ( ~ ( cODD @ X21 )
        | ( X17 @ X21 )
        | ~ ( X16 @ ( cS @ ( esk2_2 @ X16 @ X17 ) ) )
        | ( X16 @ ( esk1_2 @ X16 @ X17 ) )
        | ~ ( X16 @ c0 ) )
      & ( ~ ( cEVEN @ X20 )
        | ( X16 @ X20 )
        | ( X17 @ ( esk2_2 @ X16 @ X17 ) )
        | ~ ( X17 @ ( cS @ ( esk1_2 @ X16 @ X17 ) ) )
        | ~ ( X16 @ c0 ) )
      & ( ~ ( cODD @ X21 )
        | ( X17 @ X21 )
        | ( X17 @ ( esk2_2 @ X16 @ X17 ) )
        | ~ ( X17 @ ( cS @ ( esk1_2 @ X16 @ X17 ) ) )
        | ~ ( X16 @ c0 ) )
      & ( ~ ( cEVEN @ X20 )
        | ( X16 @ X20 )
        | ~ ( X16 @ ( cS @ ( esk2_2 @ X16 @ X17 ) ) )
        | ~ ( X17 @ ( cS @ ( esk1_2 @ X16 @ X17 ) ) )
        | ~ ( X16 @ c0 ) )
      & ( ~ ( cODD @ X21 )
        | ( X17 @ X21 )
        | ~ ( X16 @ ( cS @ ( esk2_2 @ X16 @ X17 ) ) )
        | ~ ( X17 @ ( cS @ ( esk1_2 @ X16 @ X17 ) ) )
        | ~ ( X16 @ c0 ) )
      & ( cN @ c0 )
      & ( ~ ( cN @ X22 )
        | ( cN @ ( cS @ X22 ) ) )
      & ( ( cEVEN @ esk3_0 )
        | ( cODD @ esk3_0 ) )
      & ~ ( cN @ esk3_0 ) ),
    inference(distribute,[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,
    ! [X3: $i,X2: $i > $o,X1: $i > $o] :
      ( ( X1 @ X3 )
      | ~ ( cEVEN @ X3 )
      | ~ ( X1 @ ( cS @ ( esk2_2 @ X1 @ X2 ) ) )
      | ~ ( X2 @ ( cS @ ( esk1_2 @ X1 @ X2 ) ) )
      | ~ ( X1 @ c0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X3: $i] :
      ( ( cN @ ( cS @ X3 ) )
      | ~ ( cN @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ! [X3: $i,X2: $i > $o,X1: $i > $o] :
      ( ( X1 @ X3 )
      | ( X1 @ ( esk1_2 @ X1 @ X2 ) )
      | ~ ( cEVEN @ X3 )
      | ~ ( X1 @ ( cS @ ( esk2_2 @ X1 @ X2 ) ) )
      | ~ ( X1 @ c0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    cN @ c0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_7,negated_conjecture,
    ! [X3: $i,X2: $i > $o,X1: $i > $o] :
      ( ( X1 @ X3 )
      | ( X2 @ ( esk2_2 @ X1 @ X2 ) )
      | ( X1 @ ( esk1_2 @ X1 @ X2 ) )
      | ~ ( cEVEN @ X3 )
      | ~ ( X1 @ c0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_8,negated_conjecture,
    ( ( cEVEN @ esk3_0 )
    | ( cODD @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_9,negated_conjecture,
    ! [X3: $i,X1: $i > $o] :
      ( ( X1 @ X3 )
      | ~ ( X1 @ ( cS @ ( esk2_2 @ X1 @ cN ) ) )
      | ~ ( cN @ ( esk1_2 @ X1 @ cN ) )
      | ~ ( cEVEN @ X3 )
      | ~ ( X1 @ c0 ) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

thf(c_0_10,negated_conjecture,
    ! [X1: $i > $o,X3: $i] :
      ( ( cN @ ( esk1_2 @ cN @ X1 ) )
      | ( cN @ X3 )
      | ~ ( cN @ ( esk2_2 @ cN @ X1 ) )
      | ~ ( cEVEN @ X3 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_4]),c_0_6])]) ).

thf(c_0_11,negated_conjecture,
    ! [X2: $i > $o,X1: $i > $o] :
      ( ( X1 @ ( esk1_2 @ X1 @ X2 ) )
      | ( X2 @ ( esk2_2 @ X1 @ X2 ) )
      | ( cODD @ esk3_0 )
      | ( X1 @ esk3_0 )
      | ~ ( X1 @ c0 ) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

thf(c_0_12,negated_conjecture,
    ~ ( cN @ esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_13,negated_conjecture,
    ! [X3: $i,X2: $i > $o,X1: $i > $o] :
      ( ( X1 @ X3 )
      | ( X2 @ ( esk2_2 @ X1 @ X2 ) )
      | ~ ( cEVEN @ X3 )
      | ~ ( X2 @ ( cS @ ( esk1_2 @ X1 @ X2 ) ) )
      | ~ ( X1 @ c0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_14,negated_conjecture,
    ! [X3: $i] :
      ( ( cN @ X3 )
      | ~ ( cN @ ( esk2_2 @ cN @ cN ) )
      | ~ ( cEVEN @ X3 ) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_4]),c_0_6])]),c_0_10]) ).

thf(c_0_15,negated_conjecture,
    ! [X1: $i > $o] :
      ( ( cN @ ( esk1_2 @ cN @ X1 ) )
      | ( X1 @ ( esk2_2 @ cN @ X1 ) )
      | ( cODD @ esk3_0 ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_6]),c_0_12]) ).

thf(c_0_16,negated_conjecture,
    ! [X3: $i,X1: $i > $o] :
      ( ( cN @ ( esk2_2 @ X1 @ cN ) )
      | ( X1 @ X3 )
      | ~ ( cN @ ( esk1_2 @ X1 @ cN ) )
      | ~ ( cEVEN @ X3 )
      | ~ ( X1 @ c0 ) ),
    inference(spm,[status(thm)],[c_0_13,c_0_4]) ).

thf(c_0_17,negated_conjecture,
    ! [X3: $i] :
      ( ( cN @ ( esk1_2 @ cN @ cN ) )
      | ( cODD @ esk3_0 )
      | ( cN @ X3 )
      | ~ ( cEVEN @ X3 ) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

thf(c_0_18,plain,
    ! [X4: $i,X3: $i] :
      ( ( cN @ X3 )
      | ( cN @ X4 )
      | ~ ( cN @ ( esk1_2 @ cN @ cN ) )
      | ~ ( cEVEN @ X4 )
      | ~ ( cEVEN @ X3 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_14,c_0_16])]),c_0_6])]) ).

thf(c_0_19,negated_conjecture,
    ( ( cN @ ( esk1_2 @ cN @ cN ) )
    | ( cODD @ esk3_0 ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_8]),c_0_12]) ).

thf(c_0_20,plain,
    ! [X3: $i,X4: $i] :
      ( ( cODD @ esk3_0 )
      | ( cN @ X3 )
      | ( cN @ X4 )
      | ~ ( cEVEN @ X3 )
      | ~ ( cEVEN @ X4 ) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

thf(c_0_21,negated_conjecture,
    ! [X3: $i] :
      ( ( cODD @ esk3_0 )
      | ( cN @ X3 )
      | ~ ( cEVEN @ X3 ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_8]),c_0_12]) ).

thf(c_0_22,negated_conjecture,
    ! [X1: $i > $o,X3: $i,X2: $i > $o] :
      ( ( X1 @ X3 )
      | ~ ( cODD @ X3 )
      | ~ ( X2 @ ( cS @ ( esk2_2 @ X2 @ X1 ) ) )
      | ~ ( X1 @ ( cS @ ( esk1_2 @ X2 @ X1 ) ) )
      | ~ ( X2 @ c0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_23,negated_conjecture,
    ! [X1: $i > $o,X3: $i,X2: $i > $o] :
      ( ( X1 @ X3 )
      | ( X2 @ ( esk1_2 @ X2 @ X1 ) )
      | ~ ( cODD @ X3 )
      | ~ ( X2 @ ( cS @ ( esk2_2 @ X2 @ X1 ) ) )
      | ~ ( X2 @ c0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_24,negated_conjecture,
    ! [X1: $i > $o,X3: $i,X2: $i > $o] :
      ( ( X1 @ X3 )
      | ( X1 @ ( esk2_2 @ X2 @ X1 ) )
      | ( X2 @ ( esk1_2 @ X2 @ X1 ) )
      | ~ ( cODD @ X3 )
      | ~ ( X2 @ c0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_25,negated_conjecture,
    cODD @ esk3_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_21]),c_0_8]) ).

thf(c_0_26,negated_conjecture,
    ! [X1: $i > $o,X3: $i] :
      ( ( X1 @ X3 )
      | ~ ( X1 @ ( cS @ ( esk1_2 @ cN @ X1 ) ) )
      | ~ ( cN @ ( esk2_2 @ cN @ X1 ) )
      | ~ ( cODD @ X3 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_4]),c_0_6])]) ).

thf(c_0_27,negated_conjecture,
    ! [X1: $i > $o,X3: $i] :
      ( ( cN @ ( esk1_2 @ cN @ X1 ) )
      | ( X1 @ X3 )
      | ~ ( cN @ ( esk2_2 @ cN @ X1 ) )
      | ~ ( cODD @ X3 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_4]),c_0_6])]) ).

thf(c_0_28,negated_conjecture,
    ! [X1: $i > $o,X2: $i > $o] :
      ( ( X1 @ ( esk2_2 @ X2 @ X1 ) )
      | ( X2 @ ( esk1_2 @ X2 @ X1 ) )
      | ( X1 @ esk3_0 )
      | ~ ( X2 @ c0 ) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

thf(c_0_29,negated_conjecture,
    ! [X1: $i > $o,X3: $i,X2: $i > $o] :
      ( ( X1 @ X3 )
      | ( X1 @ ( esk2_2 @ X2 @ X1 ) )
      | ~ ( cODD @ X3 )
      | ~ ( X1 @ ( cS @ ( esk1_2 @ X2 @ X1 ) ) )
      | ~ ( X2 @ c0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_30,negated_conjecture,
    ! [X3: $i] :
      ( ( cN @ X3 )
      | ~ ( cN @ ( esk2_2 @ cN @ cN ) )
      | ~ ( cODD @ X3 ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_4]),c_0_27]) ).

thf(c_0_31,negated_conjecture,
    ! [X1: $i > $o] :
      ( ( cN @ ( esk1_2 @ cN @ X1 ) )
      | ( X1 @ ( esk2_2 @ cN @ X1 ) )
      | ( X1 @ esk3_0 ) ),
    inference(spm,[status(thm)],[c_0_28,c_0_6]) ).

thf(c_0_32,negated_conjecture,
    ! [X3: $i,X1: $i > $o] :
      ( ( cN @ ( esk2_2 @ X1 @ cN ) )
      | ( cN @ X3 )
      | ~ ( cN @ ( esk1_2 @ X1 @ cN ) )
      | ~ ( cODD @ X3 )
      | ~ ( X1 @ c0 ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_4]) ).

thf(c_0_33,negated_conjecture,
    ! [X3: $i] :
      ( ( cN @ ( esk1_2 @ cN @ cN ) )
      | ( cN @ X3 )
      | ~ ( cODD @ X3 ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_12]) ).

thf(c_0_34,plain,
    ! [X4: $i,X3: $i] :
      ( ( cN @ X3 )
      | ( cN @ X4 )
      | ~ ( cN @ ( esk1_2 @ cN @ cN ) )
      | ~ ( cODD @ X4 )
      | ~ ( cODD @ X3 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_30,c_0_32])]),c_0_6])]) ).

thf(c_0_35,negated_conjecture,
    cN @ ( esk1_2 @ cN @ cN ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_25]),c_0_12]) ).

thf(c_0_36,plain,
    ! [X3: $i,X4: $i] :
      ( ( cN @ X3 )
      | ( cN @ X4 )
      | ~ ( cODD @ X3 )
      | ~ ( cODD @ X4 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).

thf(c_0_37,negated_conjecture,
    ! [X3: $i] :
      ( ( cN @ X3 )
      | ~ ( cODD @ X3 ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_25]),c_0_12]) ).

thf(c_0_38,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_37]),c_0_25])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUM824^5 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n014.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 600
% 0.13/0.34  % DateTime   : Tue Jul  5 02:20:23 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.18/0.46  Running higher-order model finding
% 0.18/0.46  Running: /export/starexec/sandbox/solver/bin/eprover-ho --pos-ext=all --neg-ext=all --ext-sup-max-depth=2 --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers --proof-object --satauto-schedule --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46  # Version: 2.6-ho
% 0.18/0.46  # Trying AutoSched0 for 149 seconds
% 0.18/0.50  # AutoSched0-Mode selected heuristic MinMin_rr
% 0.18/0.50  # and selection function SelectMaxLComplexAvoidPosPred.
% 0.18/0.50  #
% 0.18/0.50  # Preprocessing time       : 0.028 s
% 0.18/0.50  # Presaturation interreduction done
% 0.18/0.50  
% 0.18/0.50  # Proof found!
% 0.18/0.50  # SZS status Theorem
% 0.18/0.50  # SZS output start CNFRefutation
% See solution above
% 0.18/0.50  # Proof object total steps             : 39
% 0.18/0.50  # Proof object clause steps            : 36
% 0.18/0.50  # Proof object formula steps           : 3
% 0.18/0.50  # Proof object conjectures             : 35
% 0.18/0.50  # Proof object clause conjectures      : 32
% 0.18/0.50  # Proof object formula conjectures     : 3
% 0.18/0.50  # Proof object initial clauses used    : 12
% 0.18/0.50  # Proof object initial formulas used   : 1
% 0.18/0.50  # Proof object generating inferences   : 21
% 0.18/0.50  # Proof object simplifying inferences  : 27
% 0.18/0.50  # Parsed axioms                        : 6
% 0.18/0.50  # Removed by relevancy pruning/SinE    : 0
% 0.18/0.50  # Initial clauses                      : 17
% 0.18/0.50  # Removed in clause preprocessing      : 5
% 0.18/0.50  # Initial clauses in saturation        : 12
% 0.18/0.50  # Processed clauses                    : 62
% 0.18/0.50  # ...of these trivial                  : 8
% 0.18/0.50  # ...subsumed                          : 5
% 0.18/0.50  # ...remaining for further processing  : 49
% 0.18/0.50  # Other redundant clauses eliminated   : 37
% 0.18/0.50  # Clauses deleted for lack of memory   : 0
% 0.18/0.50  # Backward-subsumed                    : 5
% 0.18/0.50  # Backward-rewritten                   : 10
% 0.18/0.50  # Generated clauses                    : 138
% 0.18/0.50  # ...of the previous two non-trivial   : 74
% 0.18/0.50  # Contextual simplify-reflections      : 3
% 0.18/0.50  # Paramodulations                      : 61
% 0.18/0.50  # Factorizations                       : 0
% 0.18/0.50  # NegExts                              : 0
% 0.18/0.50  # Equation resolutions                 : 37
% 0.18/0.50  # Propositional unsat checks           : 0
% 0.18/0.50  #    Propositional check models        : 0
% 0.18/0.50  #    Propositional check unsatisfiable : 0
% 0.18/0.50  #    Propositional clauses             : 0
% 0.18/0.50  #    Propositional clauses after purity: 0
% 0.18/0.50  #    Propositional unsat core size     : 0
% 0.18/0.50  #    Propositional preprocessing time  : 0.000
% 0.18/0.50  #    Propositional encoding time       : 0.000
% 0.18/0.50  #    Propositional solver time         : 0.000
% 0.18/0.50  #    Success case prop preproc time    : 0.000
% 0.18/0.50  #    Success case prop encoding time   : 0.000
% 0.18/0.50  #    Success case prop solver time     : 0.000
% 0.18/0.50  # Current number of processed clauses  : 22
% 0.18/0.50  #    Positive orientable unit clauses  : 3
% 0.18/0.50  #    Positive unorientable unit clauses: 0
% 0.18/0.50  #    Negative unit clauses             : 1
% 0.18/0.50  #    Non-unit-clauses                  : 18
% 0.18/0.50  # Current number of unprocessed clauses: 4
% 0.18/0.50  # ...number of literals in the above   : 17
% 0.18/0.50  # Current number of archived formulas  : 0
% 0.18/0.50  # Current number of archived clauses   : 27
% 0.18/0.50  # Clause-clause subsumption calls (NU) : 89
% 0.18/0.50  # Rec. Clause-clause subsumption calls : 34
% 0.18/0.50  # Non-unit clause-clause subsumptions  : 13
% 0.18/0.50  # Unit Clause-clause subsumption calls : 2
% 0.18/0.50  # Rewrite failures with RHS unbound    : 0
% 0.18/0.50  # BW rewrite match attempts            : 2
% 0.18/0.50  # BW rewrite match successes           : 2
% 0.18/0.50  # Condensation attempts                : 0
% 0.18/0.50  # Condensation successes               : 0
% 0.18/0.50  # Termbank termtop insertions          : 3691
% 0.18/0.50  
% 0.18/0.50  # -------------------------------------------------
% 0.18/0.50  # User time                : 0.031 s
% 0.18/0.50  # System time              : 0.005 s
% 0.18/0.50  # Total time               : 0.036 s
% 0.18/0.50  # Maximum resident set size: 1588 pages
%------------------------------------------------------------------------------