TSTP Solution File: SWC197+1 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n007.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 04:28:16 EDT 2024

% Result   : Theorem 2.07s 0.81s
% Output   : CNFRefutation 2.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   33
%            Number of leaves      :   16
% Syntax   : Number of formulae    :  120 (  34 unt;   0 def)
%            Number of atoms       :  387 ( 119 equ)
%            Maximal formula atoms :   18 (   3 avg)
%            Number of connectives :  451 ( 184   ~; 178   |;  31   &)
%                                         (   6 <=>;  52  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   26 (   4 avg)
%            Maximal term depth    :    6 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;  10 con; 0-2 aty)
%            Number of variables   :  121 (   0 sgn  82   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ~ segmentP(X4,X3)
                    | ! [X5] :
                        ( ssItem(X5)
                       => ! [X6] :
                            ( ssItem(X6)
                           => ! [X7] :
                                ( ssList(X7)
                               => ! [X8] :
                                    ( ssList(X8)
                                   => ! [X9] :
                                        ( ssList(X9)
                                       => ( app(app(app(app(X7,cons(X5,nil)),X9),cons(X6,nil)),X8) != X1
                                          | X5 = X6 ) ) ) ) ) )
                    | ( ~ singletonP(X3)
                      & neq(X4,nil) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(ax82,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).

fof(ax16,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssItem(X2)
         => ssList(cons(X2,X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).

fof(ax17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).

fof(ax81,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssItem(X2)
         => cons(X2,X1) = app(cons(X2,nil),X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).

fof(ax26,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ssList(app(X1,X2)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).

fof(ax27,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssItem(X3)
             => cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax27) ).

fof(ax3,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssItem(X2)
         => ( memberP(X1,X2)
          <=> ? [X3] :
                ( ssList(X3)
                & ? [X4] :
                    ( ssList(X4)
                    & app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax3) ).

fof(ax38,axiom,
    ! [X1] :
      ( ssItem(X1)
     => ~ memberP(nil,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).

fof(ax83,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( nil = app(X1,X2)
          <=> ( nil = X2
              & nil = X1 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).

fof(ax37,axiom,
    ! [X1] :
      ( ssItem(X1)
     => ! [X2] :
          ( ssItem(X2)
         => ! [X3] :
              ( ssList(X3)
             => ( memberP(cons(X2,X3),X1)
              <=> ( X1 = X2
                  | memberP(X3,X1) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax37) ).

fof(ax4,axiom,
    ! [X1] :
      ( ssList(X1)
     => ( singletonP(X1)
      <=> ? [X2] :
            ( ssItem(X2)
            & cons(X2,nil) = X1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).

fof(ax15,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( neq(X1,X2)
          <=> X1 != X2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).

fof(ax54,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( ( segmentP(X1,X2)
              & segmentP(X2,X1) )
           => X1 = X2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax54) ).

fof(ax57,axiom,
    ! [X1] :
      ( ssList(X1)
     => segmentP(X1,nil) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).

fof(ax18,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssItem(X2)
         => cons(X2,X1) != X1 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).

fof(c_0_16,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ~ segmentP(X4,X3)
                      | ! [X5] :
                          ( ssItem(X5)
                         => ! [X6] :
                              ( ssItem(X6)
                             => ! [X7] :
                                  ( ssList(X7)
                                 => ! [X8] :
                                      ( ssList(X8)
                                     => ! [X9] :
                                          ( ssList(X9)
                                         => ( app(app(app(app(X7,cons(X5,nil)),X9),cons(X6,nil)),X8) != X1
                                            | X5 = X6 ) ) ) ) ) )
                      | ( ~ singletonP(X3)
                        & neq(X4,nil) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).

fof(c_0_17,negated_conjecture,
    ( ssList(esk48_0)
    & ssList(esk49_0)
    & ssList(esk50_0)
    & ssList(esk51_0)
    & esk49_0 = esk51_0
    & esk48_0 = esk50_0
    & segmentP(esk51_0,esk50_0)
    & ssItem(esk52_0)
    & ssItem(esk53_0)
    & ssList(esk54_0)
    & ssList(esk55_0)
    & ssList(esk56_0)
    & app(app(app(app(esk54_0,cons(esk52_0,nil)),esk56_0),cons(esk53_0,nil)),esk55_0) = esk48_0
    & esk52_0 != esk53_0
    & ( singletonP(esk50_0)
      | ~ neq(esk51_0,nil) ) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).

cnf(c_0_18,negated_conjecture,
    app(app(app(app(esk54_0,cons(esk52_0,nil)),esk56_0),cons(esk53_0,nil)),esk55_0) = esk48_0,
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_19,negated_conjecture,
    esk48_0 = esk50_0,
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

fof(c_0_20,plain,
    ! [X225,X226,X227] :
      ( ~ ssList(X225)
      | ~ ssList(X226)
      | ~ ssList(X227)
      | app(app(X225,X226),X227) = app(X225,app(X226,X227)) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).

cnf(c_0_21,negated_conjecture,
    app(app(app(app(esk54_0,cons(esk52_0,nil)),esk56_0),cons(esk53_0,nil)),esk55_0) = esk50_0,
    inference(rw,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,plain,
    ( app(app(X1,X2),X3) = app(X1,app(X2,X3))
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    ssList(esk56_0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_24,negated_conjecture,
    ssList(esk54_0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

fof(c_0_25,plain,
    ! [X114,X115] :
      ( ~ ssList(X114)
      | ~ ssItem(X115)
      | ssList(cons(X115,X114)) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).

cnf(c_0_26,negated_conjecture,
    ( app(app(app(esk54_0,app(cons(esk52_0,nil),esk56_0)),cons(esk53_0,nil)),esk55_0) = esk50_0
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).

cnf(c_0_27,plain,
    ( ssList(cons(X2,X1))
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_28,plain,
    ssList(nil),
    inference(split_conjunct,[status(thm)],[ax17]) ).

cnf(c_0_29,negated_conjecture,
    ssItem(esk52_0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

fof(c_0_30,plain,
    ! [X223,X224] :
      ( ~ ssList(X223)
      | ~ ssItem(X224)
      | cons(X224,X223) = app(cons(X224,nil),X223) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).

cnf(c_0_31,negated_conjecture,
    app(app(app(esk54_0,app(cons(esk52_0,nil),esk56_0)),cons(esk53_0,nil)),esk55_0) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]) ).

cnf(c_0_32,plain,
    ( cons(X2,X1) = app(cons(X2,nil),X1)
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_33,negated_conjecture,
    app(app(app(esk54_0,cons(esk52_0,esk56_0)),cons(esk53_0,nil)),esk55_0) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_23]),c_0_29])]) ).

cnf(c_0_34,negated_conjecture,
    ( app(app(esk54_0,app(cons(esk52_0,esk56_0),cons(esk53_0,nil))),esk55_0) = esk50_0
    | ~ ssList(cons(esk53_0,nil))
    | ~ ssList(cons(esk52_0,esk56_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_22]),c_0_24])]) ).

cnf(c_0_35,negated_conjecture,
    ssItem(esk53_0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_36,negated_conjecture,
    ( app(app(esk54_0,app(cons(esk52_0,esk56_0),cons(esk53_0,nil))),esk55_0) = esk50_0
    | ~ ssList(cons(esk52_0,esk56_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_27]),c_0_28]),c_0_35])]) ).

cnf(c_0_37,negated_conjecture,
    app(app(esk54_0,app(cons(esk52_0,esk56_0),cons(esk53_0,nil))),esk55_0) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_27]),c_0_23]),c_0_29])]) ).

cnf(c_0_38,negated_conjecture,
    ssList(esk55_0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

fof(c_0_39,plain,
    ! [X133,X134] :
      ( ~ ssList(X133)
      | ~ ssList(X134)
      | ssList(app(X133,X134)) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).

cnf(c_0_40,negated_conjecture,
    ( app(esk54_0,app(app(cons(esk52_0,esk56_0),cons(esk53_0,nil)),esk55_0)) = esk50_0
    | ~ ssList(app(cons(esk52_0,esk56_0),cons(esk53_0,nil))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_37]),c_0_38]),c_0_24])]) ).

cnf(c_0_41,plain,
    ( ssList(app(X1,X2))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_42,negated_conjecture,
    ( app(esk54_0,app(app(cons(esk52_0,esk56_0),cons(esk53_0,nil)),esk55_0)) = esk50_0
    | ~ ssList(cons(esk53_0,nil))
    | ~ ssList(cons(esk52_0,esk56_0)) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_43,negated_conjecture,
    ( app(esk54_0,app(app(cons(esk52_0,esk56_0),cons(esk53_0,nil)),esk55_0)) = esk50_0
    | ~ ssList(cons(esk52_0,esk56_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_27]),c_0_28]),c_0_35])]) ).

fof(c_0_44,plain,
    ! [X135,X136,X137] :
      ( ~ ssList(X135)
      | ~ ssList(X136)
      | ~ ssItem(X137)
      | cons(X137,app(X136,X135)) = app(cons(X137,X136),X135) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).

cnf(c_0_45,negated_conjecture,
    app(esk54_0,app(app(cons(esk52_0,esk56_0),cons(esk53_0,nil)),esk55_0)) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_27]),c_0_23]),c_0_29])]) ).

cnf(c_0_46,plain,
    ( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssItem(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_44]) ).

cnf(c_0_47,negated_conjecture,
    ( app(esk54_0,app(cons(esk52_0,app(esk56_0,cons(esk53_0,nil))),esk55_0)) = esk50_0
    | ~ ssList(cons(esk53_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_23]),c_0_29])]) ).

cnf(c_0_48,negated_conjecture,
    app(esk54_0,app(cons(esk52_0,app(esk56_0,cons(esk53_0,nil))),esk55_0)) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_27]),c_0_28]),c_0_35])]) ).

cnf(c_0_49,negated_conjecture,
    ( app(esk54_0,cons(esk52_0,app(app(esk56_0,cons(esk53_0,nil)),esk55_0))) = esk50_0
    | ~ ssList(app(esk56_0,cons(esk53_0,nil))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_46]),c_0_38]),c_0_29])]) ).

cnf(c_0_50,negated_conjecture,
    ( app(app(esk54_0,cons(esk52_0,esk56_0)),app(cons(esk53_0,nil),esk55_0)) = esk50_0
    | ~ ssList(app(esk54_0,cons(esk52_0,esk56_0)))
    | ~ ssList(cons(esk53_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_33]),c_0_38])]) ).

cnf(c_0_51,negated_conjecture,
    ( app(esk54_0,cons(esk52_0,app(app(esk56_0,cons(esk53_0,nil)),esk55_0))) = esk50_0
    | ~ ssList(cons(esk53_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_41]),c_0_23])]) ).

cnf(c_0_52,negated_conjecture,
    ( app(app(esk54_0,cons(esk52_0,esk56_0)),app(cons(esk53_0,nil),esk55_0)) = esk50_0
    | ~ ssList(app(esk54_0,cons(esk52_0,esk56_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_27]),c_0_28]),c_0_35])]) ).

cnf(c_0_53,negated_conjecture,
    app(esk54_0,cons(esk52_0,app(app(esk56_0,cons(esk53_0,nil)),esk55_0))) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_27]),c_0_28]),c_0_35])]) ).

fof(c_0_54,plain,
    ! [X14,X15,X18,X19] :
      ( ( ssList(esk3_2(X14,X15))
        | ~ memberP(X14,X15)
        | ~ ssItem(X15)
        | ~ ssList(X14) )
      & ( ssList(esk4_2(X14,X15))
        | ~ memberP(X14,X15)
        | ~ ssItem(X15)
        | ~ ssList(X14) )
      & ( app(esk3_2(X14,X15),cons(X15,esk4_2(X14,X15))) = X14
        | ~ memberP(X14,X15)
        | ~ ssItem(X15)
        | ~ ssList(X14) )
      & ( ~ ssList(X18)
        | ~ ssList(X19)
        | app(X18,cons(X15,X19)) != X14
        | memberP(X14,X15)
        | ~ ssItem(X15)
        | ~ ssList(X14) ) ),
    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)],[ax3])])])])])]) ).

cnf(c_0_55,negated_conjecture,
    ( app(app(esk54_0,cons(esk52_0,esk56_0)),app(cons(esk53_0,nil),esk55_0)) = esk50_0
    | ~ ssList(cons(esk52_0,esk56_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_41]),c_0_24])]) ).

cnf(c_0_56,negated_conjecture,
    ( app(esk54_0,cons(esk52_0,app(esk56_0,app(cons(esk53_0,nil),esk55_0)))) = esk50_0
    | ~ ssList(cons(esk53_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_22]),c_0_38]),c_0_23])]) ).

cnf(c_0_57,plain,
    ( memberP(X4,X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | app(X1,cons(X3,X2)) != X4
    | ~ ssItem(X3)
    | ~ ssList(X4) ),
    inference(split_conjunct,[status(thm)],[c_0_54]) ).

cnf(c_0_58,negated_conjecture,
    app(app(esk54_0,cons(esk52_0,esk56_0)),app(cons(esk53_0,nil),esk55_0)) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_27]),c_0_23]),c_0_29])]) ).

cnf(c_0_59,negated_conjecture,
    ssList(esk48_0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_60,negated_conjecture,
    app(esk54_0,cons(esk52_0,app(esk56_0,app(cons(esk53_0,nil),esk55_0)))) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_27]),c_0_28]),c_0_35])]) ).

fof(c_0_61,plain,
    ! [X1] :
      ( ssItem(X1)
     => ~ memberP(nil,X1) ),
    inference(fof_simplification,[status(thm)],[ax38]) ).

cnf(c_0_62,plain,
    ( memberP(app(X1,cons(X2,X3)),X2)
    | ~ ssList(app(X1,cons(X2,X3)))
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    inference(er,[status(thm)],[c_0_57]) ).

cnf(c_0_63,negated_conjecture,
    app(app(esk54_0,cons(esk52_0,esk56_0)),cons(esk53_0,esk55_0)) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_32]),c_0_38]),c_0_35])]) ).

cnf(c_0_64,negated_conjecture,
    ssList(esk50_0),
    inference(rw,[status(thm)],[c_0_59,c_0_19]) ).

cnf(c_0_65,negated_conjecture,
    app(esk54_0,cons(esk52_0,app(esk56_0,cons(esk53_0,esk55_0)))) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_32]),c_0_38]),c_0_35])]) ).

fof(c_0_66,plain,
    ! [X228,X229] :
      ( ( nil = X229
        | nil != app(X228,X229)
        | ~ ssList(X229)
        | ~ ssList(X228) )
      & ( nil = X228
        | nil != app(X228,X229)
        | ~ ssList(X229)
        | ~ ssList(X228) )
      & ( nil != X229
        | nil != X228
        | nil = app(X228,X229)
        | ~ ssList(X229)
        | ~ ssList(X228) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).

fof(c_0_67,plain,
    ! [X157,X158,X159] :
      ( ( ~ memberP(cons(X158,X159),X157)
        | X157 = X158
        | memberP(X159,X157)
        | ~ ssList(X159)
        | ~ ssItem(X158)
        | ~ ssItem(X157) )
      & ( X157 != X158
        | memberP(cons(X158,X159),X157)
        | ~ ssList(X159)
        | ~ ssItem(X158)
        | ~ ssItem(X157) )
      & ( ~ memberP(X159,X157)
        | memberP(cons(X158,X159),X157)
        | ~ ssList(X159)
        | ~ ssItem(X158)
        | ~ ssItem(X157) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])])]) ).

fof(c_0_68,plain,
    ! [X20,X22] :
      ( ( ssItem(esk5_1(X20))
        | ~ singletonP(X20)
        | ~ ssList(X20) )
      & ( cons(esk5_1(X20),nil) = X20
        | ~ singletonP(X20)
        | ~ ssList(X20) )
      & ( ~ ssItem(X22)
        | cons(X22,nil) != X20
        | singletonP(X20)
        | ~ ssList(X20) ) ),
    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)],[ax4])])])])])]) ).

fof(c_0_69,plain,
    ! [X160] :
      ( ~ ssItem(X160)
      | ~ memberP(nil,X160) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_61])])]) ).

cnf(c_0_70,negated_conjecture,
    ( memberP(esk50_0,esk53_0)
    | ~ ssList(app(esk54_0,cons(esk52_0,esk56_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_38]),c_0_35])]) ).

fof(c_0_71,plain,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( neq(X1,X2)
          <=> X1 != X2 ) ) ),
    inference(fof_simplification,[status(thm)],[ax15]) ).

cnf(c_0_72,negated_conjecture,
    ( memberP(esk50_0,esk52_0)
    | ~ ssList(app(esk56_0,cons(esk53_0,esk55_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_65]),c_0_64]),c_0_24]),c_0_29])]) ).

cnf(c_0_73,plain,
    ( nil = X1
    | nil != app(X2,X1)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_66]) ).

cnf(c_0_74,plain,
    ( X3 = X1
    | memberP(X2,X3)
    | ~ memberP(cons(X1,X2),X3)
    | ~ ssList(X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_67]) ).

cnf(c_0_75,plain,
    ( cons(esk5_1(X1),nil) = X1
    | ~ singletonP(X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_68]) ).

cnf(c_0_76,plain,
    ( ssItem(esk5_1(X1))
    | ~ singletonP(X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_68]) ).

cnf(c_0_77,plain,
    ( ~ ssItem(X1)
    | ~ memberP(nil,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_69]) ).

cnf(c_0_78,negated_conjecture,
    ( memberP(esk50_0,esk53_0)
    | ~ ssList(cons(esk52_0,esk56_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_41]),c_0_24])]) ).

fof(c_0_79,plain,
    ! [X112,X113] :
      ( ( ~ neq(X112,X113)
        | X112 != X113
        | ~ ssList(X113)
        | ~ ssList(X112) )
      & ( X112 = X113
        | neq(X112,X113)
        | ~ ssList(X113)
        | ~ ssList(X112) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_71])])])])]) ).

cnf(c_0_80,negated_conjecture,
    ssList(esk49_0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_81,negated_conjecture,
    esk49_0 = esk51_0,
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_82,negated_conjecture,
    ( memberP(esk50_0,esk52_0)
    | ~ ssList(cons(esk53_0,esk55_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_41]),c_0_23])]) ).

cnf(c_0_83,negated_conjecture,
    ( esk55_0 = nil
    | esk50_0 != nil
    | ~ ssList(app(app(app(esk54_0,cons(esk52_0,nil)),esk56_0),cons(esk53_0,nil))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_21]),c_0_38])]) ).

cnf(c_0_84,plain,
    ( esk5_1(X1) = X2
    | ~ singletonP(X1)
    | ~ memberP(X1,X2)
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_28])]),c_0_76]),c_0_77]) ).

cnf(c_0_85,negated_conjecture,
    memberP(esk50_0,esk53_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_27]),c_0_23]),c_0_29])]) ).

cnf(c_0_86,negated_conjecture,
    ( singletonP(esk50_0)
    | ~ neq(esk51_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_87,plain,
    ( X1 = X2
    | neq(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_79]) ).

cnf(c_0_88,negated_conjecture,
    ssList(esk51_0),
    inference(rw,[status(thm)],[c_0_80,c_0_81]) ).

cnf(c_0_89,negated_conjecture,
    memberP(esk50_0,esk52_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_27]),c_0_38]),c_0_35])]) ).

cnf(c_0_90,negated_conjecture,
    ( esk55_0 = nil
    | esk50_0 != nil
    | ~ ssList(app(app(esk54_0,cons(esk52_0,nil)),esk56_0))
    | ~ ssList(cons(esk53_0,nil)) ),
    inference(spm,[status(thm)],[c_0_83,c_0_41]) ).

fof(c_0_91,plain,
    ! [X190,X191] :
      ( ~ ssList(X190)
      | ~ ssList(X191)
      | ~ segmentP(X190,X191)
      | ~ segmentP(X191,X190)
      | X190 = X191 ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax54])])])]) ).

cnf(c_0_92,negated_conjecture,
    ( esk5_1(esk50_0) = esk53_0
    | ~ singletonP(esk50_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_64]),c_0_35])]) ).

cnf(c_0_93,negated_conjecture,
    ( esk51_0 = nil
    | singletonP(esk50_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_28]),c_0_88])]) ).

cnf(c_0_94,negated_conjecture,
    ( esk5_1(esk50_0) = esk52_0
    | ~ singletonP(esk50_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_89]),c_0_64]),c_0_29])]) ).

cnf(c_0_95,negated_conjecture,
    ( esk55_0 = nil
    | esk50_0 != nil
    | ~ ssList(app(app(esk54_0,cons(esk52_0,nil)),esk56_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_27]),c_0_28]),c_0_35])]) ).

cnf(c_0_96,plain,
    ( X1 = X2
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ segmentP(X1,X2)
    | ~ segmentP(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_91]) ).

cnf(c_0_97,negated_conjecture,
    segmentP(esk51_0,esk50_0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_98,negated_conjecture,
    ( esk5_1(esk50_0) = esk53_0
    | esk51_0 = nil ),
    inference(spm,[status(thm)],[c_0_92,c_0_93]) ).

cnf(c_0_99,negated_conjecture,
    ( esk5_1(esk50_0) = esk52_0
    | esk51_0 = nil ),
    inference(spm,[status(thm)],[c_0_94,c_0_93]) ).

cnf(c_0_100,negated_conjecture,
    esk52_0 != esk53_0,
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_101,negated_conjecture,
    ( cons(esk53_0,esk55_0) = nil
    | esk50_0 != nil
    | ~ ssList(app(esk54_0,cons(esk52_0,esk56_0)))
    | ~ ssList(cons(esk53_0,esk55_0)) ),
    inference(spm,[status(thm)],[c_0_73,c_0_63]) ).

cnf(c_0_102,negated_conjecture,
    ( esk55_0 = nil
    | esk50_0 != nil
    | ~ ssList(app(esk54_0,cons(esk52_0,nil))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_41]),c_0_23])]) ).

cnf(c_0_103,negated_conjecture,
    ( esk50_0 = esk51_0
    | ~ segmentP(esk50_0,esk51_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_88]),c_0_64])]) ).

cnf(c_0_104,negated_conjecture,
    esk51_0 = nil,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]) ).

fof(c_0_105,plain,
    ! [X197] :
      ( ~ ssList(X197)
      | segmentP(X197,nil) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).

cnf(c_0_106,negated_conjecture,
    ( cons(esk53_0,esk55_0) = nil
    | esk50_0 != nil
    | ~ ssList(app(esk54_0,cons(esk52_0,esk56_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_27]),c_0_38]),c_0_35])]) ).

cnf(c_0_107,negated_conjecture,
    ( esk55_0 = nil
    | esk50_0 != nil
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_41]),c_0_24])]) ).

cnf(c_0_108,negated_conjecture,
    ( esk50_0 = nil
    | ~ segmentP(esk50_0,nil) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_104]),c_0_104]) ).

cnf(c_0_109,plain,
    ( segmentP(X1,nil)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_105]) ).

fof(c_0_110,plain,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssItem(X2)
         => cons(X2,X1) != X1 ) ),
    inference(fof_simplification,[status(thm)],[ax18]) ).

cnf(c_0_111,negated_conjecture,
    ( cons(esk53_0,esk55_0) = nil
    | esk50_0 != nil
    | ~ ssList(cons(esk52_0,esk56_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_41]),c_0_24])]) ).

cnf(c_0_112,negated_conjecture,
    ( esk55_0 = nil
    | esk50_0 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_27]),c_0_28]),c_0_29])]) ).

cnf(c_0_113,negated_conjecture,
    esk50_0 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_64])]) ).

fof(c_0_114,plain,
    ! [X116,X117] :
      ( ~ ssList(X116)
      | ~ ssItem(X117)
      | cons(X117,X116) != X116 ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_110])])])]) ).

cnf(c_0_115,negated_conjecture,
    ( cons(esk53_0,esk55_0) = nil
    | esk50_0 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_27]),c_0_23]),c_0_29])]) ).

cnf(c_0_116,negated_conjecture,
    esk55_0 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_112,c_0_113])]) ).

cnf(c_0_117,plain,
    ( ~ ssList(X1)
    | ~ ssItem(X2)
    | cons(X2,X1) != X1 ),
    inference(split_conjunct,[status(thm)],[c_0_114]) ).

cnf(c_0_118,negated_conjecture,
    cons(esk53_0,nil) = nil,
    inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_115,c_0_113])]),c_0_116]) ).

cnf(c_0_119,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_28]),c_0_35])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SWC197+1 : TPTP v8.2.0. Released v2.4.0.
% 0.15/0.15  % Command    : run_E %s %d THM
% 0.15/0.39  % Computer : n007.cluster.edu
% 0.15/0.39  % Model    : x86_64 x86_64
% 0.15/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39  % Memory   : 8042.1875MB
% 0.15/0.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.39  % CPULimit   : 300
% 0.15/0.39  % WCLimit    : 300
% 0.15/0.39  % DateTime   : Sun May 19 03:19:38 EDT 2024
% 0.15/0.40  % CPUTime    : 
% 0.25/0.51  Running first-order model finding
% 0.25/0.51  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.07/0.81  # Version: 3.1.0
% 2.07/0.81  # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.07/0.81  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.07/0.81  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.07/0.81  # Starting new_bool_3 with 300s (1) cores
% 2.07/0.81  # Starting new_bool_1 with 300s (1) cores
% 2.07/0.81  # Starting sh5l with 300s (1) cores
% 2.07/0.81  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 22561 completed with status 0
% 2.07/0.81  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 2.07/0.81  # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.07/0.81  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.07/0.81  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.07/0.81  # No SInE strategy applied
% 2.07/0.81  # Search class: FGHSF-FSLM21-MFFFFFNN
% 2.07/0.81  # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 2.07/0.81  # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 2.07/0.81  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.07/0.81  # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 2.07/0.81  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 2.07/0.81  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 2.07/0.81  # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 22568 completed with status 0
% 2.07/0.81  # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 2.07/0.81  # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.07/0.81  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.07/0.81  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.07/0.81  # No SInE strategy applied
% 2.07/0.81  # Search class: FGHSF-FSLM21-MFFFFFNN
% 2.07/0.81  # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 2.07/0.81  # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 2.07/0.81  # Preprocessing time       : 0.004 s
% 2.07/0.81  # Presaturation interreduction done
% 2.07/0.81  
% 2.07/0.81  # Proof found!
% 2.07/0.81  # SZS status Theorem
% 2.07/0.81  # SZS output start CNFRefutation
% See solution above
% 2.07/0.81  # Parsed axioms                        : 96
% 2.07/0.81  # Removed by relevancy pruning/SinE    : 0
% 2.07/0.81  # Initial clauses                      : 205
% 2.07/0.81  # Removed in clause preprocessing      : 2
% 2.07/0.81  # Initial clauses in saturation        : 203
% 2.07/0.81  # Processed clauses                    : 1962
% 2.07/0.81  # ...of these trivial                  : 30
% 2.07/0.81  # ...subsumed                          : 688
% 2.07/0.81  # ...remaining for further processing  : 1244
% 2.07/0.81  # Other redundant clauses eliminated   : 109
% 2.07/0.81  # Clauses deleted for lack of memory   : 0
% 2.07/0.81  # Backward-subsumed                    : 236
% 2.07/0.81  # Backward-rewritten                   : 380
% 2.07/0.81  # Generated clauses                    : 7904
% 2.07/0.81  # ...of the previous two non-redundant : 7242
% 2.07/0.81  # ...aggressively subsumed             : 0
% 2.07/0.81  # Contextual simplify-reflections      : 200
% 2.07/0.81  # Paramodulations                      : 7789
% 2.07/0.81  # Factorizations                       : 0
% 2.07/0.81  # NegExts                              : 0
% 2.07/0.81  # Equation resolutions                 : 117
% 2.07/0.81  # Disequality decompositions           : 0
% 2.07/0.81  # Total rewrite steps                  : 6959
% 2.07/0.81  # ...of those cached                   : 6851
% 2.07/0.81  # Propositional unsat checks           : 0
% 2.07/0.81  #    Propositional check models        : 0
% 2.07/0.81  #    Propositional check unsatisfiable : 0
% 2.07/0.81  #    Propositional clauses             : 0
% 2.07/0.81  #    Propositional clauses after purity: 0
% 2.07/0.81  #    Propositional unsat core size     : 0
% 2.07/0.81  #    Propositional preprocessing time  : 0.000
% 2.07/0.81  #    Propositional encoding time       : 0.000
% 2.07/0.81  #    Propositional solver time         : 0.000
% 2.07/0.81  #    Success case prop preproc time    : 0.000
% 2.07/0.81  #    Success case prop encoding time   : 0.000
% 2.07/0.81  #    Success case prop solver time     : 0.000
% 2.07/0.81  # Current number of processed clauses  : 408
% 2.07/0.81  #    Positive orientable unit clauses  : 44
% 2.07/0.81  #    Positive unorientable unit clauses: 0
% 2.07/0.81  #    Negative unit clauses             : 5
% 2.07/0.81  #    Non-unit-clauses                  : 359
% 2.07/0.81  # Current number of unprocessed clauses: 5463
% 2.07/0.81  # ...number of literals in the above   : 28745
% 2.07/0.81  # Current number of archived formulas  : 0
% 2.07/0.81  # Current number of archived clauses   : 813
% 2.07/0.81  # Clause-clause subsumption calls (NU) : 95645
% 2.07/0.81  # Rec. Clause-clause subsumption calls : 43889
% 2.07/0.81  # Non-unit clause-clause subsumptions  : 1026
% 2.07/0.81  # Unit Clause-clause subsumption calls : 2861
% 2.07/0.81  # Rewrite failures with RHS unbound    : 0
% 2.07/0.81  # BW rewrite match attempts            : 62
% 2.07/0.81  # BW rewrite match successes           : 41
% 2.07/0.81  # Condensation attempts                : 0
% 2.07/0.81  # Condensation successes               : 0
% 2.07/0.81  # Termbank termtop insertions          : 169020
% 2.07/0.81  # Search garbage collected termcells   : 4327
% 2.07/0.81  
% 2.07/0.81  # -------------------------------------------------
% 2.07/0.81  # User time                : 0.272 s
% 2.07/0.81  # System time              : 0.011 s
% 2.07/0.81  # Total time               : 0.284 s
% 2.07/0.81  # Maximum resident set size: 2484 pages
% 2.07/0.81  
% 2.07/0.81  # -------------------------------------------------
% 2.07/0.81  # User time                : 1.334 s
% 2.07/0.81  # System time              : 0.047 s
% 2.07/0.81  # Total time               : 1.381 s
% 2.07/0.81  # Maximum resident set size: 1824 pages
% 2.07/0.81  % E---3.1 exiting
%------------------------------------------------------------------------------