TSTP Solution File: SEU675^2 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SEU675^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n003.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:29:03 EDT 2024

% Result   : Theorem 0.20s 0.49s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   26
% Syntax   : Number of formulae    :   50 (  18 unt;  19 typ;   0 def)
%            Number of atoms       :  127 (  28 equ;   0 cnn)
%            Maximal formula atoms :    8 (   4 avg)
%            Number of connectives :  472 (  22   ~;  17   |;  22   &; 394   @)
%                                         (   2 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   38 (  38   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   21 (  19 usr;   7 con; 0-4 aty)
%            Number of variables   :  121 (  61   ^  49   !;  11   ?; 121   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_22,type,
    in: $i > $i > $o ).

thf(decl_23,type,
    emptyset: $i ).

thf(decl_24,type,
    setadjoin: $i > $i > $i ).

thf(decl_25,type,
    powerset: $i > $i ).

thf(decl_26,type,
    dsetconstr: $i > ( $i > $o ) > $i ).

thf(decl_27,type,
    dsetconstrER: $o ).

thf(decl_28,type,
    subset: $i > $i > $o ).

thf(decl_29,type,
    kpair: $i > $i > $i ).

thf(decl_30,type,
    cartprod: $i > $i > $i ).

thf(decl_31,type,
    singleton: $i > $o ).

thf(decl_32,type,
    ex1: $i > ( $i > $o ) > $o ).

thf(decl_33,type,
    breln: $i > $i > $i > $o ).

thf(decl_34,type,
    func: $i > $i > $i > $o ).

thf(decl_35,type,
    funcSet: $i > $i > $i ).

thf(decl_36,type,
    esk1_0: $i ).

thf(decl_37,type,
    esk2_0: $i ).

thf(decl_38,type,
    esk3_0: $i ).

thf(decl_39,type,
    esk4_0: $i ).

thf(decl_40,type,
    esk5_4: $i > $i > $i > $i > $i ).

thf(ex1,axiom,
    ( ex1
    = ( ^ [X1: $i,X2: $i > $o] :
          ( singleton
          @ ( dsetconstr @ X1
            @ ^ [X3: $i] : ( X2 @ X3 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ex1) ).

thf(singleton,axiom,
    ( singleton
    = ( ^ [X1: $i] :
        ? [X3: $i] :
          ( ( in @ X3 @ X1 )
          & ( X1
            = ( setadjoin @ X3 @ emptyset ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton) ).

thf(func,axiom,
    ( func
    = ( ^ [X1: $i,X5: $i,X7: $i] :
          ( ( breln @ X1 @ X5 @ X7 )
          & ! [X3: $i] :
              ( ( in @ X3 @ X1 )
             => ( ex1 @ X5
                @ ^ [X4: $i] : ( in @ ( kpair @ X3 @ X4 ) @ X7 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',func) ).

thf(breln,axiom,
    ( breln
    = ( ^ [X1: $i,X5: $i,X6: $i] : ( subset @ X6 @ ( cartprod @ X1 @ X5 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln) ).

thf(dsetconstrER,axiom,
    ( dsetconstrER
  <=> ! [X1: $i,X2: $i > $o,X3: $i] :
        ( ( in @ X3
          @ ( dsetconstr @ X1
            @ ^ [X4: $i] : ( X2 @ X4 ) ) )
       => ( X2 @ X3 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrER) ).

thf(infuncsetfunc,conjecture,
    ( dsetconstrER
   => ! [X1: $i,X5: $i,X8: $i] :
        ( ( in @ X8 @ ( funcSet @ X1 @ X5 ) )
       => ( func @ X1 @ X5 @ X8 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',infuncsetfunc) ).

thf(funcSet,axiom,
    ( funcSet
    = ( ^ [X1: $i,X5: $i] :
          ( dsetconstr @ ( powerset @ ( cartprod @ X1 @ X5 ) )
          @ ^ [X8: $i] : ( func @ X1 @ X5 @ X8 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',funcSet) ).

thf(c_0_7,plain,
    ( ex1
    = ( ^ [Z0: $i,Z1: $i > $o] :
        ? [X15: $i] :
          ( ( in @ X15
            @ ( dsetconstr @ Z0
              @ ^ [Z2: $i] : ( Z1 @ Z2 ) ) )
          & ( ( dsetconstr @ Z0
              @ ^ [Z2: $i] : ( Z1 @ Z2 ) )
            = ( setadjoin @ X15 @ emptyset ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[ex1]) ).

thf(c_0_8,plain,
    ( singleton
    = ( ^ [Z0: $i] :
        ? [X3: $i] :
          ( ( in @ X3 @ Z0 )
          & ( Z0
            = ( setadjoin @ X3 @ emptyset ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[singleton]) ).

thf(c_0_9,plain,
    ( func
    = ( ^ [Z0: $i,Z1: $i,Z2: $i] :
          ( ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) )
          & ! [X3: $i] :
              ( ( in @ X3 @ Z0 )
             => ? [X16: $i] :
                  ( ( in @ X16
                    @ ( dsetconstr @ Z1
                      @ ^ [Z3: $i] : ( in @ ( kpair @ X3 @ Z3 ) @ Z2 ) ) )
                  & ( ( dsetconstr @ Z1
                      @ ^ [Z3: $i] : ( in @ ( kpair @ X3 @ Z3 ) @ Z2 ) )
                    = ( setadjoin @ X16 @ emptyset ) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[func]) ).

thf(c_0_10,plain,
    ( ex1
    = ( ^ [Z0: $i,Z1: $i > $o] :
        ? [X15: $i] :
          ( ( in @ X15
            @ ( dsetconstr @ Z0
              @ ^ [Z2: $i] : ( Z1 @ Z2 ) ) )
          & ( ( dsetconstr @ Z0
              @ ^ [Z2: $i] : ( Z1 @ Z2 ) )
            = ( setadjoin @ X15 @ emptyset ) ) ) ) ),
    inference(apply_def,[status(thm)],[c_0_7,c_0_8]) ).

thf(c_0_11,plain,
    ( breln
    = ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) ) ) ),
    inference(fof_simplification,[status(thm)],[breln]) ).

thf(c_0_12,plain,
    ( dsetconstrER
  <=> ! [X1: $i,X2: $i > $o,X3: $i] :
        ( ( in @ X3
          @ ( dsetconstr @ X1
            @ ^ [Z0: $i] : ( X2 @ Z0 ) ) )
       => ( X2 @ X3 ) ) ),
    inference(fof_simplification,[status(thm)],[dsetconstrER]) ).

thf(c_0_13,plain,
    ( func
    = ( ^ [Z0: $i,Z1: $i,Z2: $i] :
          ( ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) )
          & ! [X3: $i] :
              ( ( in @ X3 @ Z0 )
             => ? [X16: $i] :
                  ( ( in @ X16
                    @ ( dsetconstr @ Z1
                      @ ^ [Z3: $i] : ( in @ ( kpair @ X3 @ Z3 ) @ Z2 ) ) )
                  & ( ( dsetconstr @ Z1
                      @ ^ [Z3: $i] : ( in @ ( kpair @ X3 @ Z3 ) @ Z2 ) )
                    = ( setadjoin @ X16 @ emptyset ) ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

thf(c_0_14,negated_conjecture,
    ~ ( ! [X19: $i,X20: $i > $o,X21: $i] :
          ( ( in @ X21 @ ( dsetconstr @ X19 @ X20 ) )
         => ( X20 @ X21 ) )
     => ! [X1: $i,X5: $i,X8: $i] :
          ( ( in @ X8 @ ( funcSet @ X1 @ X5 ) )
         => ( ( subset @ X8 @ ( cartprod @ X1 @ X5 ) )
            & ! [X22: $i] :
                ( ( in @ X22 @ X1 )
               => ? [X23: $i] :
                    ( ( in @ X23
                      @ ( dsetconstr @ X5
                        @ ^ [Z0: $i] : ( in @ ( kpair @ X22 @ Z0 ) @ X8 ) ) )
                    & ( ( dsetconstr @ X5
                        @ ^ [Z0: $i] : ( in @ ( kpair @ X22 @ Z0 ) @ X8 ) )
                      = ( setadjoin @ X23 @ emptyset ) ) ) ) ) ) ),
    inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[infuncsetfunc]),c_0_12]),c_0_13])]) ).

thf(c_0_15,plain,
    ( funcSet
    = ( ^ [Z0: $i,Z1: $i] :
          ( dsetconstr @ ( powerset @ ( cartprod @ Z0 @ Z1 ) )
          @ ^ [Z2: $i] :
              ( ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) )
              & ! [X17: $i] :
                  ( ( in @ X17 @ Z0 )
                 => ? [X18: $i] :
                      ( ( in @ X18
                        @ ( dsetconstr @ Z1
                          @ ^ [Z3: $i] : ( in @ ( kpair @ X17 @ Z3 ) @ Z2 ) ) )
                      & ( ( dsetconstr @ Z1
                          @ ^ [Z3: $i] : ( in @ ( kpair @ X17 @ Z3 ) @ Z2 ) )
                        = ( setadjoin @ X18 @ emptyset ) ) ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[funcSet]),c_0_13]) ).

thf(c_0_16,negated_conjecture,
    ! [X24: $i,X25: $i > $o,X26: $i,X31: $i] :
      ( ( ~ ( in @ X26 @ ( dsetconstr @ X24 @ X25 ) )
        | ( X25 @ X26 ) )
      & ( in @ esk3_0 @ ( funcSet @ esk1_0 @ esk2_0 ) )
      & ( ( in @ esk4_0 @ esk1_0 )
        | ~ ( subset @ esk3_0 @ ( cartprod @ esk1_0 @ esk2_0 ) ) )
      & ( ~ ( in @ X31
            @ ( dsetconstr @ esk2_0
              @ ^ [Z0: $i] : ( in @ ( kpair @ esk4_0 @ Z0 ) @ esk3_0 ) ) )
        | ( ( dsetconstr @ esk2_0
            @ ^ [Z0: $i] : ( in @ ( kpair @ esk4_0 @ Z0 ) @ esk3_0 ) )
         != ( setadjoin @ X31 @ emptyset ) )
        | ~ ( subset @ esk3_0 @ ( cartprod @ esk1_0 @ esk2_0 ) ) ) ),
    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_14])])])])])]) ).

thf(c_0_17,plain,
    ( funcSet
    = ( ^ [Z0: $i,Z1: $i] :
          ( dsetconstr @ ( powerset @ ( cartprod @ Z0 @ Z1 ) )
          @ ^ [Z2: $i] :
              ( ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) )
              & ! [X42: $i] :
                  ( ( in @ X42 @ Z0 )
                 => ? [X43: $i] :
                      ( ( in @ X43
                        @ ( dsetconstr @ Z1
                          @ ^ [Z3: $i] : ( in @ ( kpair @ X42 @ Z3 ) @ Z2 ) ) )
                      & ( ( dsetconstr @ Z1
                          @ ^ [Z3: $i] : ( in @ ( kpair @ X42 @ Z3 ) @ Z2 ) )
                        = ( setadjoin @ X43 @ emptyset ) ) ) ) ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_18,negated_conjecture,
    ! [X1: $i,X3: $i,X2: $i > $o] :
      ( ( X2 @ X1 )
      | ~ ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

thf(c_0_19,plain,
    ! [X1: $i,X3: $i] :
      ( ( dsetconstr @ ( powerset @ ( cartprod @ X1 @ X3 ) )
        @ ^ [Z0: $i] :
            ( ( subset @ Z0 @ ( cartprod @ X1 @ X3 ) )
            & ! [X44: $i] :
                ( ( in @ X44 @ X1 )
               => ? [X45: $i] :
                    ( ( in @ X45
                      @ ( dsetconstr @ X3
                        @ ^ [Z1: $i] : ( in @ ( kpair @ X44 @ Z1 ) @ Z0 ) ) )
                    & ( ( dsetconstr @ X3
                        @ ^ [Z1: $i] : ( in @ ( kpair @ X44 @ Z1 ) @ Z0 ) )
                      = ( setadjoin @ X45 @ emptyset ) ) ) ) ) )
      = ( funcSet @ X1 @ X3 ) ),
    inference(arg_cong,[status(thm)],[c_0_17]) ).

thf(c_0_20,negated_conjecture,
    ! [X1: $i,X3: $i,X4: $i] :
      ( ( ( subset @ X1 @ ( cartprod @ X3 @ X4 ) )
        & ! [X46: $i] :
            ( ( in @ X46 @ X3 )
           => ? [X47: $i] :
                ( ( in @ X47
                  @ ( dsetconstr @ X4
                    @ ^ [Z0: $i] : ( in @ ( kpair @ X46 @ Z0 ) @ X1 ) ) )
                & ( ( dsetconstr @ X4
                    @ ^ [Z0: $i] : ( in @ ( kpair @ X46 @ Z0 ) @ X1 ) )
                  = ( setadjoin @ X47 @ emptyset ) ) ) ) )
      | ~ ( in @ X1 @ ( funcSet @ X3 @ X4 ) ) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

thf(c_0_21,negated_conjecture,
    ! [X1: $i] :
      ( ~ ( in @ X1
          @ ( dsetconstr @ esk2_0
            @ ^ [Z0: $i] : ( in @ ( kpair @ esk4_0 @ Z0 ) @ esk3_0 ) ) )
      | ( ( dsetconstr @ esk2_0
          @ ^ [Z0: $i] : ( in @ ( kpair @ esk4_0 @ Z0 ) @ esk3_0 ) )
       != ( setadjoin @ X1 @ emptyset ) )
      | ~ ( subset @ esk3_0 @ ( cartprod @ esk1_0 @ esk2_0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

thf(c_0_22,negated_conjecture,
    ! [X1: $i,X5: $i,X4: $i,X3: $i] :
      ( ( in @ ( esk5_4 @ X1 @ X3 @ X4 @ X5 )
        @ ( dsetconstr @ X4
          @ ^ [Z0: $i] : ( in @ ( kpair @ X5 @ Z0 ) @ X1 ) ) )
      | ~ ( in @ X1 @ ( funcSet @ X3 @ X4 ) )
      | ~ ( in @ X5 @ X3 ) ),
    inference(dynamic_cnf,[status(thm)],[c_0_20]) ).

thf(c_0_23,negated_conjecture,
    ! [X1: $i,X5: $i,X4: $i,X3: $i] :
      ( ( ( setadjoin @ ( esk5_4 @ X1 @ X3 @ X4 @ X5 ) @ emptyset )
        = ( dsetconstr @ X4
          @ ^ [Z0: $i] : ( in @ ( kpair @ X5 @ Z0 ) @ X1 ) ) )
      | ~ ( in @ X1 @ ( funcSet @ X3 @ X4 ) )
      | ~ ( in @ X5 @ X3 ) ),
    inference(dynamic_cnf,[status(thm)],[c_0_20]) ).

thf(c_0_24,negated_conjecture,
    ! [X1: $i] :
      ( ~ ( subset @ esk3_0 @ ( cartprod @ esk1_0 @ esk2_0 ) )
      | ~ ( in @ esk3_0 @ ( funcSet @ X1 @ esk2_0 ) )
      | ~ ( in @ esk4_0 @ X1 ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).

thf(c_0_25,negated_conjecture,
    ! [X1: $i,X3: $i,X4: $i] :
      ( ( subset @ X1 @ ( cartprod @ X3 @ X4 ) )
      | ~ ( in @ X1 @ ( funcSet @ X3 @ X4 ) ) ),
    inference(dynamic_cnf,[status(thm)],[c_0_20]) ).

thf(c_0_26,negated_conjecture,
    in @ esk3_0 @ ( funcSet @ esk1_0 @ esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

thf(c_0_27,negated_conjecture,
    ( ( in @ esk4_0 @ esk1_0 )
    | ~ ( subset @ esk3_0 @ ( cartprod @ esk1_0 @ esk2_0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

thf(c_0_28,negated_conjecture,
    ! [X1: $i] :
      ( ~ ( in @ esk3_0 @ ( funcSet @ X1 @ esk2_0 ) )
      | ~ ( in @ esk4_0 @ X1 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).

thf(c_0_29,negated_conjecture,
    in @ esk4_0 @ esk1_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_26])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SEU675^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n003.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sun May 19 15:56:23 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.20/0.47  Running higher-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49  # Version: 3.1.0-ho
% 0.20/0.49  # partial match(1): HSSSSMSSSLMNSFA
% 0.20/0.49  # Preprocessing class: HSSSSMSSSLMNHFA.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49  # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.49  # Starting sh4l with 300s (1) cores
% 0.20/0.49  # Starting lpo8_s with 300s (1) cores
% 0.20/0.49  # ho_unfolding_6 with pid 28587 completed with status 0
% 0.20/0.49  # Result found by ho_unfolding_6
% 0.20/0.49  # partial match(1): HSSSSMSSSLMNSFA
% 0.20/0.49  # Preprocessing class: HSSSSMSSSLMNHFA.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49  # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.49  # No SInE strategy applied
% 0.20/0.49  # Search class: HHHSF-FFSF21-DHFFMSBN
% 0.20/0.49  # partial match(4): HGHSF-FFSF21-SHHFMMBN
% 0.20/0.49  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49  # Starting new_ho_10_cnf2 with 78s (1) cores
% 0.20/0.49  # new_ho_10_cnf2 with pid 28590 completed with status 0
% 0.20/0.49  # Result found by new_ho_10_cnf2
% 0.20/0.49  # partial match(1): HSSSSMSSSLMNSFA
% 0.20/0.49  # Preprocessing class: HSSSSMSSSLMNHFA.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49  # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.49  # No SInE strategy applied
% 0.20/0.49  # Search class: HHHSF-FFSF21-DHFFMSBN
% 0.20/0.49  # partial match(4): HGHSF-FFSF21-SHHFMMBN
% 0.20/0.49  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49  # Starting new_ho_10_cnf2 with 78s (1) cores
% 0.20/0.49  # Preprocessing time       : 0.001 s
% 0.20/0.49  # Presaturation interreduction done
% 0.20/0.49  
% 0.20/0.49  # Proof found!
% 0.20/0.49  # SZS status Theorem
% 0.20/0.49  # SZS output start CNFRefutation
% See solution above
% 0.20/0.49  # Parsed axioms                        : 21
% 0.20/0.49  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.49  # Initial clauses                      : 19
% 0.20/0.49  # Removed in clause preprocessing      : 14
% 0.20/0.49  # Initial clauses in saturation        : 5
% 0.20/0.49  # Processed clauses                    : 20
% 0.20/0.49  # ...of these trivial                  : 0
% 0.20/0.49  # ...subsumed                          : 0
% 0.20/0.49  # ...remaining for further processing  : 20
% 0.20/0.49  # Other redundant clauses eliminated   : 0
% 0.20/0.49  # Clauses deleted for lack of memory   : 0
% 0.20/0.49  # Backward-subsumed                    : 1
% 0.20/0.49  # Backward-rewritten                   : 1
% 0.20/0.49  # Generated clauses                    : 14
% 0.20/0.49  # ...of the previous two non-redundant : 12
% 0.20/0.49  # ...aggressively subsumed             : 0
% 0.20/0.49  # Contextual simplify-reflections      : 1
% 0.20/0.49  # Paramodulations                      : 8
% 0.20/0.49  # Factorizations                       : 0
% 0.20/0.49  # NegExts                              : 0
% 0.20/0.49  # Equation resolutions                 : 0
% 0.20/0.49  # Disequality decompositions           : 0
% 0.20/0.49  # Total rewrite steps                  : 5
% 0.20/0.49  # ...of those cached                   : 2
% 0.20/0.49  # Propositional unsat checks           : 0
% 0.20/0.49  #    Propositional check models        : 0
% 0.20/0.49  #    Propositional check unsatisfiable : 0
% 0.20/0.49  #    Propositional clauses             : 0
% 0.20/0.49  #    Propositional clauses after purity: 0
% 0.20/0.49  #    Propositional unsat core size     : 0
% 0.20/0.49  #    Propositional preprocessing time  : 0.000
% 0.20/0.49  #    Propositional encoding time       : 0.000
% 0.20/0.49  #    Propositional solver time         : 0.000
% 0.20/0.49  #    Success case prop preproc time    : 0.000
% 0.20/0.49  #    Success case prop encoding time   : 0.000
% 0.20/0.49  #    Success case prop solver time     : 0.000
% 0.20/0.49  # Current number of processed clauses  : 12
% 0.20/0.49  #    Positive orientable unit clauses  : 5
% 0.20/0.49  #    Positive unorientable unit clauses: 0
% 0.20/0.49  #    Negative unit clauses             : 0
% 0.20/0.49  #    Non-unit-clauses                  : 7
% 0.20/0.49  # Current number of unprocessed clauses: 2
% 0.20/0.49  # ...number of literals in the above   : 7
% 0.20/0.49  # Current number of archived formulas  : 0
% 0.20/0.49  # Current number of archived clauses   : 8
% 0.20/0.49  # Clause-clause subsumption calls (NU) : 13
% 0.20/0.49  # Rec. Clause-clause subsumption calls : 10
% 0.20/0.49  # Non-unit clause-clause subsumptions  : 2
% 0.20/0.49  # Unit Clause-clause subsumption calls : 0
% 0.20/0.49  # Rewrite failures with RHS unbound    : 0
% 0.20/0.49  # BW rewrite match attempts            : 2
% 0.20/0.49  # BW rewrite match successes           : 1
% 0.20/0.49  # Condensation attempts                : 20
% 0.20/0.49  # Condensation successes               : 0
% 0.20/0.49  # Termbank termtop insertions          : 2180
% 0.20/0.49  # Search garbage collected termcells   : 355
% 0.20/0.49  
% 0.20/0.49  # -------------------------------------------------
% 0.20/0.49  # User time                : 0.007 s
% 0.20/0.49  # System time              : 0.001 s
% 0.20/0.49  # Total time               : 0.008 s
% 0.20/0.49  # Maximum resident set size: 1876 pages
% 0.20/0.49  
% 0.20/0.49  # -------------------------------------------------
% 0.20/0.49  # User time                : 0.009 s
% 0.20/0.49  # System time              : 0.003 s
% 0.20/0.49  # Total time               : 0.012 s
% 0.20/0.49  # Maximum resident set size: 1772 pages
% 0.20/0.49  % E---3.1 exiting
% 0.20/0.49  % E exiting
%------------------------------------------------------------------------------