TSTP Solution File: SWC379+1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SWC379+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n002.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 : Sat May  4 09:40:04 EDT 2024

% Result   : Theorem 0.17s 0.46s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   45 (  10 unt;   0 def)
%            Number of atoms       :  229 (  31 equ)
%            Maximal formula atoms :   51 (   5 avg)
%            Number of connectives :  299 ( 115   ~; 126   |;  44   &)
%                                         (   0 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-1 aty)
%            Number of variables   :   39 (   0 sgn  17   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ? [X5] :
                        ( ssItem(X5)
                        & ( ( ~ memberP(X3,X5)
                            & ! [X6] :
                                ( ssItem(X6)
                               => ( ~ memberP(X4,X6)
                                  | ~ leq(X6,X5)
                                  | X5 = X6 ) )
                            & memberP(X4,X5) )
                          | ( memberP(X3,X5)
                            & ( ~ memberP(X4,X5)
                              | ? [X6] :
                                  ( ssItem(X6)
                                  & X5 != X6
                                  & memberP(X4,X6)
                                  & leq(X6,X5) ) ) ) ) )
                    | ! [X7] :
                        ( ssItem(X7)
                       => ( ( ~ memberP(X1,X7)
                            & ( ~ memberP(X2,X7)
                              | ? [X8] :
                                  ( ssItem(X8)
                                  & X7 != X8
                                  & memberP(X2,X8)
                                  & leq(X8,X7) ) ) )
                          | ( ! [X8] :
                                ( ssItem(X8)
                               => ( ~ memberP(X2,X8)
                                  | ~ leq(X8,X7)
                                  | X7 = X8 ) )
                            & memberP(X2,X7)
                            & memberP(X1,X7) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.N4u8wNCaHw/E---3.1_18652.p',co1) ).

fof(c_0_1,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ? [X5] :
                          ( ssItem(X5)
                          & ( ( ~ memberP(X3,X5)
                              & ! [X6] :
                                  ( ssItem(X6)
                                 => ( ~ memberP(X4,X6)
                                    | ~ leq(X6,X5)
                                    | X5 = X6 ) )
                              & memberP(X4,X5) )
                            | ( memberP(X3,X5)
                              & ( ~ memberP(X4,X5)
                                | ? [X6] :
                                    ( ssItem(X6)
                                    & X5 != X6
                                    & memberP(X4,X6)
                                    & leq(X6,X5) ) ) ) ) )
                      | ! [X7] :
                          ( ssItem(X7)
                         => ( ( ~ memberP(X1,X7)
                              & ( ~ memberP(X2,X7)
                                | ? [X8] :
                                    ( ssItem(X8)
                                    & X7 != X8
                                    & memberP(X2,X8)
                                    & leq(X8,X7) ) ) )
                            | ( ! [X8] :
                                  ( ssItem(X8)
                                 => ( ~ memberP(X2,X8)
                                    | ~ leq(X8,X7)
                                    | X7 = X8 ) )
                              & memberP(X2,X7)
                              & memberP(X1,X7) ) ) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).

fof(c_0_2,negated_conjecture,
    ! [X13,X15,X17] :
      ( ssList(esk1_0)
      & ssList(esk2_0)
      & ssList(esk3_0)
      & ssList(esk4_0)
      & esk2_0 = esk4_0
      & esk1_0 = esk3_0
      & ( ssItem(esk5_1(X13))
        | memberP(esk3_0,X13)
        | ~ memberP(esk4_0,X13)
        | ~ ssItem(X13) )
      & ( memberP(esk4_0,esk5_1(X13))
        | memberP(esk3_0,X13)
        | ~ memberP(esk4_0,X13)
        | ~ ssItem(X13) )
      & ( leq(esk5_1(X13),X13)
        | memberP(esk3_0,X13)
        | ~ memberP(esk4_0,X13)
        | ~ ssItem(X13) )
      & ( X13 != esk5_1(X13)
        | memberP(esk3_0,X13)
        | ~ memberP(esk4_0,X13)
        | ~ ssItem(X13) )
      & ( memberP(esk4_0,X13)
        | ~ memberP(esk3_0,X13)
        | ~ ssItem(X13) )
      & ( ~ ssItem(X15)
        | X13 = X15
        | ~ memberP(esk4_0,X15)
        | ~ leq(X15,X13)
        | ~ memberP(esk3_0,X13)
        | ~ ssItem(X13) )
      & ssItem(esk6_0)
      & ( memberP(esk2_0,esk6_0)
        | memberP(esk1_0,esk6_0) )
      & ( ~ ssItem(X17)
        | esk6_0 = X17
        | ~ memberP(esk2_0,X17)
        | ~ leq(X17,esk6_0)
        | memberP(esk1_0,esk6_0) )
      & ( ssItem(esk7_0)
        | ~ memberP(esk2_0,esk6_0)
        | ~ memberP(esk1_0,esk6_0) )
      & ( memberP(esk2_0,esk7_0)
        | ~ memberP(esk2_0,esk6_0)
        | ~ memberP(esk1_0,esk6_0) )
      & ( leq(esk7_0,esk6_0)
        | ~ memberP(esk2_0,esk6_0)
        | ~ memberP(esk1_0,esk6_0) )
      & ( esk6_0 != esk7_0
        | ~ memberP(esk2_0,esk6_0)
        | ~ memberP(esk1_0,esk6_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_1])])])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( memberP(esk4_0,X1)
    | ~ memberP(esk3_0,X1)
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    esk1_0 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ( memberP(esk2_0,esk6_0)
    | memberP(esk1_0,esk6_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    esk2_0 = esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_7,negated_conjecture,
    ( leq(esk5_1(X1),X1)
    | memberP(esk3_0,X1)
    | ~ memberP(esk4_0,X1)
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_8,negated_conjecture,
    ( memberP(esk4_0,X1)
    | ~ memberP(esk1_0,X1)
    | ~ ssItem(X1) ),
    inference(rw,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_9,negated_conjecture,
    ( memberP(esk4_0,esk6_0)
    | memberP(esk1_0,esk6_0) ),
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    ssItem(esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_11,negated_conjecture,
    ( ssItem(esk5_1(X1))
    | memberP(esk3_0,X1)
    | ~ memberP(esk4_0,X1)
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_12,negated_conjecture,
    ( memberP(esk4_0,esk5_1(X1))
    | memberP(esk3_0,X1)
    | ~ memberP(esk4_0,X1)
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_13,negated_conjecture,
    ( esk6_0 = X1
    | memberP(esk1_0,esk6_0)
    | ~ ssItem(X1)
    | ~ memberP(esk2_0,X1)
    | ~ leq(X1,esk6_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_14,negated_conjecture,
    ( leq(esk5_1(X1),X1)
    | memberP(esk1_0,X1)
    | ~ memberP(esk4_0,X1)
    | ~ ssItem(X1) ),
    inference(rw,[status(thm)],[c_0_7,c_0_4]) ).

cnf(c_0_15,negated_conjecture,
    memberP(esk4_0,esk6_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).

cnf(c_0_16,negated_conjecture,
    ( memberP(esk1_0,X1)
    | ssItem(esk5_1(X1))
    | ~ memberP(esk4_0,X1)
    | ~ ssItem(X1) ),
    inference(rw,[status(thm)],[c_0_11,c_0_4]) ).

cnf(c_0_17,negated_conjecture,
    ( memberP(esk4_0,esk5_1(X1))
    | memberP(esk1_0,X1)
    | ~ memberP(esk4_0,X1)
    | ~ ssItem(X1) ),
    inference(rw,[status(thm)],[c_0_12,c_0_4]) ).

cnf(c_0_18,negated_conjecture,
    ( leq(esk7_0,esk6_0)
    | ~ memberP(esk2_0,esk6_0)
    | ~ memberP(esk1_0,esk6_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_19,negated_conjecture,
    ( memberP(esk3_0,X1)
    | X1 != esk5_1(X1)
    | ~ memberP(esk4_0,X1)
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_20,negated_conjecture,
    ( esk6_0 = X1
    | memberP(esk1_0,esk6_0)
    | ~ leq(X1,esk6_0)
    | ~ memberP(esk4_0,X1)
    | ~ ssItem(X1) ),
    inference(rw,[status(thm)],[c_0_13,c_0_6]) ).

cnf(c_0_21,negated_conjecture,
    ( leq(esk5_1(esk6_0),esk6_0)
    | memberP(esk1_0,esk6_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_10])]) ).

cnf(c_0_22,negated_conjecture,
    ( memberP(esk1_0,esk6_0)
    | ssItem(esk5_1(esk6_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_10])]) ).

cnf(c_0_23,negated_conjecture,
    ( memberP(esk4_0,esk5_1(esk6_0))
    | memberP(esk1_0,esk6_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_10])]) ).

cnf(c_0_24,negated_conjecture,
    ( memberP(esk2_0,esk7_0)
    | ~ memberP(esk2_0,esk6_0)
    | ~ memberP(esk1_0,esk6_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_25,negated_conjecture,
    ( ssItem(esk7_0)
    | ~ memberP(esk2_0,esk6_0)
    | ~ memberP(esk1_0,esk6_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_26,negated_conjecture,
    ( esk6_0 != esk7_0
    | ~ memberP(esk2_0,esk6_0)
    | ~ memberP(esk1_0,esk6_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_27,negated_conjecture,
    ( leq(esk7_0,esk6_0)
    | ~ memberP(esk1_0,esk6_0)
    | ~ memberP(esk4_0,esk6_0) ),
    inference(rw,[status(thm)],[c_0_18,c_0_6]) ).

cnf(c_0_28,negated_conjecture,
    ( memberP(esk1_0,X1)
    | esk5_1(X1) != X1
    | ~ memberP(esk4_0,X1)
    | ~ ssItem(X1) ),
    inference(rw,[status(thm)],[c_0_19,c_0_4]) ).

cnf(c_0_29,negated_conjecture,
    ( esk5_1(esk6_0) = esk6_0
    | memberP(esk1_0,esk6_0) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]) ).

cnf(c_0_30,negated_conjecture,
    ( memberP(esk4_0,esk7_0)
    | ~ memberP(esk1_0,esk6_0)
    | ~ memberP(esk4_0,esk6_0) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_6]),c_0_6]) ).

cnf(c_0_31,negated_conjecture,
    ( ssItem(esk7_0)
    | ~ memberP(esk1_0,esk6_0)
    | ~ memberP(esk4_0,esk6_0) ),
    inference(rw,[status(thm)],[c_0_25,c_0_6]) ).

cnf(c_0_32,negated_conjecture,
    ( esk7_0 != esk6_0
    | ~ memberP(esk1_0,esk6_0)
    | ~ memberP(esk4_0,esk6_0) ),
    inference(rw,[status(thm)],[c_0_26,c_0_6]) ).

cnf(c_0_33,negated_conjecture,
    ( X2 = X1
    | ~ ssItem(X1)
    | ~ memberP(esk4_0,X1)
    | ~ leq(X1,X2)
    | ~ memberP(esk3_0,X2)
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_34,negated_conjecture,
    ( leq(esk7_0,esk6_0)
    | ~ memberP(esk1_0,esk6_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_15])]) ).

cnf(c_0_35,negated_conjecture,
    memberP(esk1_0,esk6_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_15]),c_0_10])]) ).

cnf(c_0_36,negated_conjecture,
    ( memberP(esk4_0,esk7_0)
    | ~ memberP(esk1_0,esk6_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_15])]) ).

cnf(c_0_37,negated_conjecture,
    ( ssItem(esk7_0)
    | ~ memberP(esk1_0,esk6_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_15])]) ).

cnf(c_0_38,negated_conjecture,
    ( esk7_0 != esk6_0
    | ~ memberP(esk1_0,esk6_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_15])]) ).

cnf(c_0_39,negated_conjecture,
    ( X1 = X2
    | ~ leq(X1,X2)
    | ~ memberP(esk1_0,X2)
    | ~ memberP(esk4_0,X1)
    | ~ ssItem(X2)
    | ~ ssItem(X1) ),
    inference(rw,[status(thm)],[c_0_33,c_0_4]) ).

cnf(c_0_40,negated_conjecture,
    leq(esk7_0,esk6_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).

cnf(c_0_41,negated_conjecture,
    memberP(esk4_0,esk7_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_35])]) ).

cnf(c_0_42,negated_conjecture,
    ssItem(esk7_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_35])]) ).

cnf(c_0_43,negated_conjecture,
    esk7_0 != esk6_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_35])]) ).

cnf(c_0_44,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(spm,[status(thm)],[c_0_39,c_0_40]),c_0_35]),c_0_41]),c_0_10]),c_0_42])]),c_0_43]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem    : SWC379+1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.12  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n002.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Fri May  3 15:43:23 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.17/0.44  Running first-order theorem proving
% 0.17/0.44  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/tmp/tmp.N4u8wNCaHw/E---3.1_18652.p
% 0.17/0.46  # Version: 3.1.0
% 0.17/0.46  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46  # Starting sh5l with 300s (1) cores
% 0.17/0.46  # new_bool_3 with pid 18733 completed with status 0
% 0.17/0.46  # Result found by new_bool_3
% 0.17/0.46  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46  # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.17/0.46  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.46  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18736 completed with status 0
% 0.17/0.46  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.46  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46  # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.17/0.46  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.46  # Preprocessing time       : 0.002 s
% 0.17/0.46  # Presaturation interreduction done
% 0.17/0.46  
% 0.17/0.46  # Proof found!
% 0.17/0.46  # SZS status Theorem
% 0.17/0.46  # SZS output start CNFRefutation
% See solution above
% 0.17/0.46  # Parsed axioms                        : 96
% 0.17/0.46  # Removed by relevancy pruning/SinE    : 66
% 0.17/0.46  # Initial clauses                      : 64
% 0.17/0.46  # Removed in clause preprocessing      : 0
% 0.17/0.46  # Initial clauses in saturation        : 64
% 0.17/0.46  # Processed clauses                    : 148
% 0.17/0.46  # ...of these trivial                  : 2
% 0.17/0.46  # ...subsumed                          : 3
% 0.17/0.46  # ...remaining for further processing  : 143
% 0.17/0.46  # Other redundant clauses eliminated   : 9
% 0.17/0.46  # Clauses deleted for lack of memory   : 0
% 0.17/0.46  # Backward-subsumed                    : 1
% 0.17/0.46  # Backward-rewritten                   : 18
% 0.17/0.46  # Generated clauses                    : 108
% 0.17/0.46  # ...of the previous two non-redundant : 89
% 0.17/0.46  # ...aggressively subsumed             : 0
% 0.17/0.46  # Contextual simplify-reflections      : 9
% 0.17/0.46  # Paramodulations                      : 96
% 0.17/0.46  # Factorizations                       : 0
% 0.17/0.46  # NegExts                              : 0
% 0.17/0.46  # Equation resolutions                 : 13
% 0.17/0.46  # Disequality decompositions           : 0
% 0.17/0.46  # Total rewrite steps                  : 88
% 0.17/0.46  # ...of those cached                   : 78
% 0.17/0.46  # Propositional unsat checks           : 0
% 0.17/0.46  #    Propositional check models        : 0
% 0.17/0.46  #    Propositional check unsatisfiable : 0
% 0.17/0.46  #    Propositional clauses             : 0
% 0.17/0.46  #    Propositional clauses after purity: 0
% 0.17/0.46  #    Propositional unsat core size     : 0
% 0.17/0.46  #    Propositional preprocessing time  : 0.000
% 0.17/0.46  #    Propositional encoding time       : 0.000
% 0.17/0.46  #    Propositional solver time         : 0.000
% 0.17/0.46  #    Success case prop preproc time    : 0.000
% 0.17/0.46  #    Success case prop encoding time   : 0.000
% 0.17/0.46  #    Success case prop solver time     : 0.000
% 0.17/0.46  # Current number of processed clauses  : 60
% 0.17/0.46  #    Positive orientable unit clauses  : 14
% 0.17/0.46  #    Positive unorientable unit clauses: 0
% 0.17/0.46  #    Negative unit clauses             : 3
% 0.17/0.46  #    Non-unit-clauses                  : 43
% 0.17/0.46  # Current number of unprocessed clauses: 64
% 0.17/0.46  # ...number of literals in the above   : 251
% 0.17/0.46  # Current number of archived formulas  : 0
% 0.17/0.46  # Current number of archived clauses   : 79
% 0.17/0.46  # Clause-clause subsumption calls (NU) : 1097
% 0.17/0.46  # Rec. Clause-clause subsumption calls : 278
% 0.17/0.46  # Non-unit clause-clause subsumptions  : 13
% 0.17/0.46  # Unit Clause-clause subsumption calls : 21
% 0.17/0.46  # Rewrite failures with RHS unbound    : 0
% 0.17/0.46  # BW rewrite match attempts            : 2
% 0.17/0.46  # BW rewrite match successes           : 2
% 0.17/0.46  # Condensation attempts                : 0
% 0.17/0.46  # Condensation successes               : 0
% 0.17/0.46  # Termbank termtop insertions          : 8408
% 0.17/0.46  # Search garbage collected termcells   : 1950
% 0.17/0.46  
% 0.17/0.46  # -------------------------------------------------
% 0.17/0.46  # User time                : 0.013 s
% 0.17/0.46  # System time              : 0.001 s
% 0.17/0.46  # Total time               : 0.015 s
% 0.17/0.46  # Maximum resident set size: 2044 pages
% 0.17/0.46  
% 0.17/0.46  # -------------------------------------------------
% 0.17/0.46  # User time                : 0.017 s
% 0.17/0.46  # System time              : 0.003 s
% 0.17/0.46  # Total time               : 0.019 s
% 0.17/0.46  # Maximum resident set size: 1816 pages
% 0.17/0.46  % E---3.1 exiting
% 0.17/0.46  % E exiting
%------------------------------------------------------------------------------