TSTP Solution File: SWC213+1 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n016.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:42:03 EDT 2023

% Result   : Theorem 0.20s 0.52s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   23 (  12 unt;   0 def)
%            Number of atoms       :  113 (  39 equ)
%            Maximal formula atoms :   24 (   4 avg)
%            Number of connectives :  136 (  46   ~;  42   |;  33   &)
%                                         (   1 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   28 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   40 (   0 sgn;  22   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ~ neq(X2,nil)
                    | ! [X5] :
                        ( ssList(X5)
                       => ! [X6] :
                            ( ssList(X6)
                           => ( app(app(X5,X3),X6) != X4
                              | ~ equalelemsP(X3)
                              | ? [X7] :
                                  ( ssItem(X7)
                                  & ? [X8] :
                                      ( ssList(X8)
                                      & app(X8,cons(X7,nil)) = X5
                                      & ? [X9] :
                                          ( ssList(X9)
                                          & app(cons(X7,nil),X9) = X3 ) ) )
                              | ? [X10] :
                                  ( ssItem(X10)
                                  & ? [X11] :
                                      ( ssList(X11)
                                      & app(cons(X10,nil),X11) = X6
                                      & ? [X12] :
                                          ( ssList(X12)
                                          & app(X12,cons(X10,nil)) = X3 ) ) ) ) ) )
                    | neq(X1,nil)
                    | ( nil != X4
                      & nil = X3 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.jeo5ENFjyt/E---3.1_6317.p',co1) ).

fof(ax15,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( neq(X1,X2)
          <=> X1 != X2 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.jeo5ENFjyt/E---3.1_6317.p',ax15) ).

fof(ax17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/tmp/tmp.jeo5ENFjyt/E---3.1_6317.p',ax17) ).

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

fof(c_0_4,negated_conjecture,
    ! [X19,X20,X21,X22,X23,X24] :
      ( ssList(esk1_0)
      & ssList(esk2_0)
      & ssList(esk3_0)
      & ssList(esk4_0)
      & esk2_0 = esk4_0
      & esk1_0 = esk3_0
      & neq(esk2_0,nil)
      & ssList(esk5_0)
      & ssList(esk6_0)
      & app(app(esk5_0,esk3_0),esk6_0) = esk4_0
      & equalelemsP(esk3_0)
      & ( ~ ssItem(X19)
        | ~ ssList(X20)
        | app(X20,cons(X19,nil)) != esk5_0
        | ~ ssList(X21)
        | app(cons(X19,nil),X21) != esk3_0 )
      & ( ~ ssItem(X22)
        | ~ ssList(X23)
        | app(cons(X22,nil),X23) != esk6_0
        | ~ ssList(X24)
        | app(X24,cons(X22,nil)) != esk3_0 )
      & ~ neq(esk1_0,nil)
      & ( nil = esk4_0
        | nil != esk3_0 ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).

fof(c_0_5,plain,
    ! [X32,X33] :
      ( ( ~ neq(X32,X33)
        | X32 != X33
        | ~ ssList(X33)
        | ~ ssList(X32) )
      & ( X32 = X33
        | neq(X32,X33)
        | ~ ssList(X33)
        | ~ ssList(X32) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).

cnf(c_0_6,negated_conjecture,
    neq(esk2_0,nil),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    esk2_0 = esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    ( ~ neq(X1,X2)
    | X1 != X2
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    neq(esk4_0,nil),
    inference(rw,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    ( nil = esk4_0
    | nil != esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

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

cnf(c_0_13,negated_conjecture,
    ssList(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

cnf(c_0_15,plain,
    ( ~ ssList(X1)
    | ~ neq(X1,X1) ),
    inference(er,[status(thm)],[c_0_8]) ).

cnf(c_0_16,negated_conjecture,
    ( neq(nil,nil)
    | esk3_0 != nil ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_17,negated_conjecture,
    ~ neq(esk1_0,nil),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_18,plain,
    ( X1 = nil
    | neq(X1,nil)
    | ~ ssList(X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_19,negated_conjecture,
    ssList(esk3_0),
    inference(rw,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_20,negated_conjecture,
    esk3_0 != nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12])]) ).

cnf(c_0_21,negated_conjecture,
    ~ neq(esk3_0,nil),
    inference(rw,[status(thm)],[c_0_17,c_0_14]) ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWC213+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n016.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   : 2400
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Oct  3 02:24:52 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.20/0.48  Running first-order model finding
% 0.20/0.48  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/tmp/tmp.jeo5ENFjyt/E---3.1_6317.p
% 0.20/0.52  # Version: 3.1pre001
% 0.20/0.52  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52  # Starting sh5l with 300s (1) cores
% 0.20/0.52  # new_bool_3 with pid 6444 completed with status 0
% 0.20/0.52  # Result found by new_bool_3
% 0.20/0.52  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52  # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.20/0.52  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.52  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 6449 completed with status 0
% 0.20/0.52  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.52  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52  # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.20/0.52  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.52  # Preprocessing time       : 0.002 s
% 0.20/0.52  # Presaturation interreduction done
% 0.20/0.52  
% 0.20/0.52  # Proof found!
% 0.20/0.52  # SZS status Theorem
% 0.20/0.52  # SZS output start CNFRefutation
% See solution above
% 0.20/0.52  # Parsed axioms                        : 96
% 0.20/0.52  # Removed by relevancy pruning/SinE    : 74
% 0.20/0.52  # Initial clauses                      : 51
% 0.20/0.52  # Removed in clause preprocessing      : 0
% 0.20/0.52  # Initial clauses in saturation        : 51
% 0.20/0.52  # Processed clauses                    : 184
% 0.20/0.52  # ...of these trivial                  : 2
% 0.20/0.52  # ...subsumed                          : 6
% 0.20/0.52  # ...remaining for further processing  : 176
% 0.20/0.52  # Other redundant clauses eliminated   : 9
% 0.20/0.52  # Clauses deleted for lack of memory   : 0
% 0.20/0.52  # Backward-subsumed                    : 8
% 0.20/0.52  # Backward-rewritten                   : 0
% 0.20/0.52  # Generated clauses                    : 437
% 0.20/0.52  # ...of the previous two non-redundant : 399
% 0.20/0.52  # ...aggressively subsumed             : 0
% 0.20/0.52  # Contextual simplify-reflections      : 0
% 0.20/0.52  # Paramodulations                      : 425
% 0.20/0.52  # Factorizations                       : 0
% 0.20/0.52  # NegExts                              : 0
% 0.20/0.52  # Equation resolutions                 : 13
% 0.20/0.52  # Total rewrite steps                  : 144
% 0.20/0.52  # Propositional unsat checks           : 0
% 0.20/0.52  #    Propositional check models        : 0
% 0.20/0.52  #    Propositional check unsatisfiable : 0
% 0.20/0.52  #    Propositional clauses             : 0
% 0.20/0.52  #    Propositional clauses after purity: 0
% 0.20/0.52  #    Propositional unsat core size     : 0
% 0.20/0.52  #    Propositional preprocessing time  : 0.000
% 0.20/0.52  #    Propositional encoding time       : 0.000
% 0.20/0.52  #    Propositional solver time         : 0.000
% 0.20/0.52  #    Success case prop preproc time    : 0.000
% 0.20/0.52  #    Success case prop encoding time   : 0.000
% 0.20/0.52  #    Success case prop solver time     : 0.000
% 0.20/0.52  # Current number of processed clauses  : 115
% 0.20/0.52  #    Positive orientable unit clauses  : 29
% 0.20/0.52  #    Positive unorientable unit clauses: 0
% 0.20/0.52  #    Negative unit clauses             : 7
% 0.20/0.52  #    Non-unit-clauses                  : 79
% 0.20/0.52  # Current number of unprocessed clauses: 295
% 0.20/0.52  # ...number of literals in the above   : 1064
% 0.20/0.52  # Current number of archived formulas  : 0
% 0.20/0.52  # Current number of archived clauses   : 57
% 0.20/0.52  # Clause-clause subsumption calls (NU) : 830
% 0.20/0.52  # Rec. Clause-clause subsumption calls : 352
% 0.20/0.52  # Non-unit clause-clause subsumptions  : 5
% 0.20/0.52  # Unit Clause-clause subsumption calls : 161
% 0.20/0.52  # Rewrite failures with RHS unbound    : 0
% 0.20/0.52  # BW rewrite match attempts            : 0
% 0.20/0.52  # BW rewrite match successes           : 0
% 0.20/0.52  # Condensation attempts                : 0
% 0.20/0.52  # Condensation successes               : 0
% 0.20/0.52  # Termbank termtop insertions          : 10008
% 0.20/0.52  
% 0.20/0.52  # -------------------------------------------------
% 0.20/0.52  # User time                : 0.016 s
% 0.20/0.52  # System time              : 0.003 s
% 0.20/0.52  # Total time               : 0.020 s
% 0.20/0.52  # Maximum resident set size: 1928 pages
% 0.20/0.52  
% 0.20/0.52  # -------------------------------------------------
% 0.20/0.52  # User time                : 0.020 s
% 0.20/0.52  # System time              : 0.006 s
% 0.20/0.52  # Total time               : 0.025 s
% 0.20/0.52  # Maximum resident set size: 1804 pages
% 0.20/0.52  % E---3.1 exiting
%------------------------------------------------------------------------------