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

View Problem - Process Solution

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

% Computer : n021.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:29:22 EDT 2024

% Result   : Theorem 0.20s 0.53s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   31 (  13 unt;   0 def)
%            Number of atoms       :  156 (  30 equ)
%            Maximal formula atoms :   34 (   5 avg)
%            Number of connectives :  197 (  72   ~;  78   |;  27   &)
%                                         (   2 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   5 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   :   38 (   0 sgn  25   !;   2   ?)

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

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(ax36,axiom,
    ! [X1] :
      ( ssItem(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ( memberP(app(X2,X3),X1)
              <=> ( memberP(X2,X1)
                  | memberP(X3,X1) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax36) ).

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

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

fof(c_0_5,negated_conjecture,
    ! [X12] :
      ( ssList(esk1_0)
      & ssList(esk2_0)
      & ssList(esk3_0)
      & ssList(esk4_0)
      & esk2_0 = esk4_0
      & esk1_0 = esk3_0
      & ( neq(esk2_0,nil)
        | neq(esk2_0,nil) )
      & ( ~ neq(esk4_0,nil)
        | neq(esk2_0,nil) )
      & ( neq(esk2_0,nil)
        | ~ ssItem(X12)
        | cons(X12,nil) != esk1_0
        | ~ memberP(esk2_0,X12) )
      & ( ~ neq(esk4_0,nil)
        | ~ ssItem(X12)
        | cons(X12,nil) != esk1_0
        | ~ memberP(esk2_0,X12) )
      & ( neq(esk2_0,nil)
        | ssItem(esk5_0) )
      & ( ~ neq(esk4_0,nil)
        | ssItem(esk5_0) )
      & ( neq(esk2_0,nil)
        | ssList(esk6_0) )
      & ( ~ neq(esk4_0,nil)
        | ssList(esk6_0) )
      & ( neq(esk2_0,nil)
        | cons(esk5_0,nil) = esk3_0 )
      & ( ~ neq(esk4_0,nil)
        | cons(esk5_0,nil) = esk3_0 )
      & ( neq(esk2_0,nil)
        | app(cons(esk5_0,nil),esk6_0) = esk4_0 )
      & ( ~ neq(esk4_0,nil)
        | app(cons(esk5_0,nil),esk6_0) = esk4_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_4])])])])])]) ).

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

cnf(c_0_7,negated_conjecture,
    ( cons(esk5_0,nil) = esk3_0
    | ~ neq(esk4_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    esk1_0 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    esk2_0 = esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    neq(esk2_0,nil),
    inference(cn,[status(thm)],[c_0_6]) ).

fof(c_0_11,plain,
    ! [X63,X64,X65] :
      ( ( ~ memberP(cons(X64,X65),X63)
        | X63 = X64
        | memberP(X65,X63)
        | ~ ssList(X65)
        | ~ ssItem(X64)
        | ~ ssItem(X63) )
      & ( X63 != X64
        | memberP(cons(X64,X65),X63)
        | ~ ssList(X65)
        | ~ ssItem(X64)
        | ~ ssItem(X63) )
      & ( ~ memberP(X65,X63)
        | memberP(cons(X64,X65),X63)
        | ~ ssList(X65)
        | ~ ssItem(X64)
        | ~ ssItem(X63) ) ),
    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_12,plain,
    ! [X60,X61,X62] :
      ( ( ~ memberP(app(X61,X62),X60)
        | memberP(X61,X60)
        | memberP(X62,X60)
        | ~ ssList(X62)
        | ~ ssList(X61)
        | ~ ssItem(X60) )
      & ( ~ memberP(X61,X60)
        | memberP(app(X61,X62),X60)
        | ~ ssList(X62)
        | ~ ssList(X61)
        | ~ ssItem(X60) )
      & ( ~ memberP(X62,X60)
        | memberP(app(X61,X62),X60)
        | ~ ssList(X62)
        | ~ ssList(X61)
        | ~ ssItem(X60) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])])]) ).

cnf(c_0_13,negated_conjecture,
    ( app(cons(esk5_0,nil),esk6_0) = esk4_0
    | ~ neq(esk4_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_14,negated_conjecture,
    cons(esk5_0,nil) = esk1_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10])]) ).

cnf(c_0_15,negated_conjecture,
    ( ssList(esk6_0)
    | ~ neq(esk4_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

cnf(c_0_17,negated_conjecture,
    ( ssItem(esk5_0)
    | ~ neq(esk4_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_18,plain,
    ( memberP(app(X1,X3),X2)
    | ~ memberP(X1,X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_19,negated_conjecture,
    app(esk1_0,esk6_0) = esk2_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_9]),c_0_9]),c_0_10])]) ).

cnf(c_0_20,negated_conjecture,
    ssList(esk6_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_9]),c_0_10])]) ).

cnf(c_0_21,negated_conjecture,
    ssList(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_22,plain,
    ( memberP(cons(X1,X2),X1)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(er,[status(thm)],[c_0_16]) ).

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

cnf(c_0_24,negated_conjecture,
    ssItem(esk5_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_9]),c_0_10])]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ neq(esk4_0,nil)
    | ~ ssItem(X1)
    | cons(X1,nil) != esk1_0
    | ~ memberP(esk2_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_26,negated_conjecture,
    ( memberP(esk2_0,X1)
    | ~ memberP(esk1_0,X1)
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).

cnf(c_0_27,negated_conjecture,
    memberP(esk1_0,esk5_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_14]),c_0_23]),c_0_24])]) ).

cnf(c_0_28,negated_conjecture,
    ( cons(X1,nil) != esk1_0
    | ~ memberP(esk2_0,X1)
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_9]),c_0_10])]) ).

cnf(c_0_29,negated_conjecture,
    memberP(esk2_0,esk5_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24])]) ).

cnf(c_0_30,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_14]),c_0_24])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SWC380+1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n021.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sun May 19 02:48:38 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.20/0.50  Running first-order model finding
% 0.20/0.50  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
% 0.20/0.53  # Version: 3.1.0
% 0.20/0.53  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53  # Starting sh5l with 300s (1) cores
% 0.20/0.53  # new_bool_3 with pid 14051 completed with status 0
% 0.20/0.53  # Result found by new_bool_3
% 0.20/0.53  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.53  # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.20/0.53  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.53  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 14056 completed with status 0
% 0.20/0.53  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.53  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.53  # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.20/0.53  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.53  # Preprocessing time       : 0.002 s
% 0.20/0.53  # Presaturation interreduction done
% 0.20/0.53  
% 0.20/0.53  # Proof found!
% 0.20/0.53  # SZS status Theorem
% 0.20/0.53  # SZS output start CNFRefutation
% See solution above
% 0.20/0.53  # Parsed axioms                        : 96
% 0.20/0.53  # Removed by relevancy pruning/SinE    : 73
% 0.20/0.53  # Initial clauses                      : 56
% 0.20/0.53  # Removed in clause preprocessing      : 0
% 0.20/0.53  # Initial clauses in saturation        : 56
% 0.20/0.53  # Processed clauses                    : 141
% 0.20/0.53  # ...of these trivial                  : 8
% 0.20/0.53  # ...subsumed                          : 7
% 0.20/0.53  # ...remaining for further processing  : 126
% 0.20/0.53  # Other redundant clauses eliminated   : 12
% 0.20/0.53  # Clauses deleted for lack of memory   : 0
% 0.20/0.53  # Backward-subsumed                    : 0
% 0.20/0.53  # Backward-rewritten                   : 0
% 0.20/0.53  # Generated clauses                    : 234
% 0.20/0.53  # ...of the previous two non-redundant : 198
% 0.20/0.53  # ...aggressively subsumed             : 0
% 0.20/0.53  # Contextual simplify-reflections      : 0
% 0.20/0.53  # Paramodulations                      : 219
% 0.20/0.53  # Factorizations                       : 0
% 0.20/0.53  # NegExts                              : 0
% 0.20/0.53  # Equation resolutions                 : 16
% 0.20/0.53  # Disequality decompositions           : 0
% 0.20/0.53  # Total rewrite steps                  : 198
% 0.20/0.53  # ...of those cached                   : 184
% 0.20/0.53  # Propositional unsat checks           : 0
% 0.20/0.53  #    Propositional check models        : 0
% 0.20/0.53  #    Propositional check unsatisfiable : 0
% 0.20/0.53  #    Propositional clauses             : 0
% 0.20/0.53  #    Propositional clauses after purity: 0
% 0.20/0.53  #    Propositional unsat core size     : 0
% 0.20/0.53  #    Propositional preprocessing time  : 0.000
% 0.20/0.53  #    Propositional encoding time       : 0.000
% 0.20/0.53  #    Propositional solver time         : 0.000
% 0.20/0.53  #    Success case prop preproc time    : 0.000
% 0.20/0.53  #    Success case prop encoding time   : 0.000
% 0.20/0.53  #    Success case prop solver time     : 0.000
% 0.20/0.53  # Current number of processed clauses  : 73
% 0.20/0.53  #    Positive orientable unit clauses  : 23
% 0.20/0.53  #    Positive unorientable unit clauses: 0
% 0.20/0.53  #    Negative unit clauses             : 6
% 0.20/0.53  #    Non-unit-clauses                  : 44
% 0.20/0.53  # Current number of unprocessed clauses: 161
% 0.20/0.53  # ...number of literals in the above   : 714
% 0.20/0.53  # Current number of archived formulas  : 0
% 0.20/0.53  # Current number of archived clauses   : 48
% 0.20/0.53  # Clause-clause subsumption calls (NU) : 643
% 0.20/0.53  # Rec. Clause-clause subsumption calls : 167
% 0.20/0.53  # Non-unit clause-clause subsumptions  : 2
% 0.20/0.53  # Unit Clause-clause subsumption calls : 35
% 0.20/0.53  # Rewrite failures with RHS unbound    : 0
% 0.20/0.53  # BW rewrite match attempts            : 0
% 0.20/0.53  # BW rewrite match successes           : 0
% 0.20/0.53  # Condensation attempts                : 0
% 0.20/0.53  # Condensation successes               : 0
% 0.20/0.53  # Termbank termtop insertions          : 8588
% 0.20/0.53  # Search garbage collected termcells   : 1607
% 0.20/0.53  
% 0.20/0.53  # -------------------------------------------------
% 0.20/0.53  # User time                : 0.012 s
% 0.20/0.53  # System time              : 0.005 s
% 0.20/0.53  # Total time               : 0.018 s
% 0.20/0.53  # Maximum resident set size: 1912 pages
% 0.20/0.53  
% 0.20/0.53  # -------------------------------------------------
% 0.20/0.53  # User time                : 0.016 s
% 0.20/0.53  # System time              : 0.007 s
% 0.20/0.53  # Total time               : 0.023 s
% 0.20/0.53  # Maximum resident set size: 1824 pages
% 0.20/0.53  % E---3.1 exiting
%------------------------------------------------------------------------------