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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : SWC348+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:11 EDT 2024

% Result   : Theorem 0.19s 0.48s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   39 (  16 unt;   0 def)
%            Number of atoms       :  120 (  24 equ)
%            Maximal formula atoms :   11 (   3 avg)
%            Number of connectives :  131 (  50   ~;  45   |;  17   &)
%                                         (   4 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   29 (   0 sgn  21   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ~ segmentP(X4,X3)
                    | ( ~ singletonP(X3)
                      & neq(X4,nil) )
                    | ( segmentP(X2,X1)
                      & strictorderedP(X1) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

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

fof(ax68,axiom,
    ! [X1] :
      ( ssItem(X1)
     => strictorderedP(cons(X1,nil)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax68) ).

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

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

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

fof(ax69,axiom,
    strictorderedP(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax69) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ~ segmentP(X4,X3)
                      | ( ~ singletonP(X3)
                        & neq(X4,nil) )
                      | ( segmentP(X2,X1)
                        & strictorderedP(X1) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).

fof(c_0_8,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)
    & ( singletonP(esk50_0)
      | ~ neq(esk51_0,nil) )
    & ( ~ segmentP(esk49_0,esk48_0)
      | ~ strictorderedP(esk48_0) ) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).

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

fof(c_0_10,plain,
    ! [X202] :
      ( ~ ssItem(X202)
      | strictorderedP(cons(X202,nil)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax68])])]) ).

fof(c_0_11,plain,
    ! [X17,X19] :
      ( ( ssItem(esk5_1(X17))
        | ~ singletonP(X17)
        | ~ ssList(X17) )
      & ( cons(esk5_1(X17),nil) = X17
        | ~ singletonP(X17)
        | ~ ssList(X17) )
      & ( ~ ssItem(X19)
        | cons(X19,nil) != X17
        | singletonP(X17)
        | ~ ssList(X17) ) ),
    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])])])])])]) ).

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

cnf(c_0_13,negated_conjecture,
    esk48_0 = esk50_0,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_14,plain,
    ! [X109,X110] :
      ( ( ~ neq(X109,X110)
        | X109 != X110
        | ~ ssList(X110)
        | ~ ssList(X109) )
      & ( X109 = X110
        | neq(X109,X110)
        | ~ ssList(X110)
        | ~ ssList(X109) ) ),
    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_9])])])])]) ).

cnf(c_0_15,negated_conjecture,
    ssList(esk49_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_16,negated_conjecture,
    esk49_0 = esk51_0,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ segmentP(esk49_0,esk48_0)
    | ~ strictorderedP(esk48_0) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_18,negated_conjecture,
    segmentP(esk51_0,esk50_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_19,plain,
    ( strictorderedP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

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

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

cnf(c_0_22,negated_conjecture,
    ( singletonP(esk48_0)
    | ~ neq(esk51_0,nil) ),
    inference(rw,[status(thm)],[c_0_12,c_0_13]) ).

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

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

cnf(c_0_25,negated_conjecture,
    ssList(esk51_0),
    inference(rw,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ strictorderedP(esk48_0)
    | ~ segmentP(esk51_0,esk48_0) ),
    inference(rw,[status(thm)],[c_0_17,c_0_16]) ).

cnf(c_0_27,negated_conjecture,
    segmentP(esk51_0,esk48_0),
    inference(rw,[status(thm)],[c_0_18,c_0_13]) ).

cnf(c_0_28,plain,
    ( strictorderedP(X1)
    | ~ singletonP(X1)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

cnf(c_0_29,negated_conjecture,
    ( esk51_0 = nil
    | singletonP(esk48_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).

cnf(c_0_30,negated_conjecture,
    ssList(esk48_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_31,negated_conjecture,
    ~ strictorderedP(esk48_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).

fof(c_0_32,plain,
    ! [X195] :
      ( ( ~ segmentP(nil,X195)
        | nil = X195
        | ~ ssList(X195) )
      & ( nil != X195
        | segmentP(nil,X195)
        | ~ ssList(X195) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])]) ).

cnf(c_0_33,negated_conjecture,
    esk51_0 = nil,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),c_0_31]) ).

cnf(c_0_34,plain,
    ( nil = X1
    | ~ segmentP(nil,X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_35,negated_conjecture,
    segmentP(nil,esk48_0),
    inference(rw,[status(thm)],[c_0_27,c_0_33]) ).

cnf(c_0_36,negated_conjecture,
    esk48_0 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_30])]) ).

cnf(c_0_37,plain,
    strictorderedP(nil),
    inference(split_conjunct,[status(thm)],[ax69]) ).

cnf(c_0_38,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_36]),c_0_37])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWC348+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n021.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Sun May 19 02:38:07 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.19/0.45  Running first-order model finding
% 0.19/0.45  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.19/0.48  # Version: 3.1.0
% 0.19/0.48  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48  # Starting sh5l with 300s (1) cores
% 0.19/0.48  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 23792 completed with status 0
% 0.19/0.48  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.19/0.48  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.48  # No SInE strategy applied
% 0.19/0.48  # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.19/0.48  # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48  # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.19/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.48  # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.19/0.48  # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 23802 completed with status 0
% 0.19/0.48  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 0.19/0.48  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.48  # No SInE strategy applied
% 0.19/0.48  # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.19/0.48  # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48  # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.19/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.48  # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.19/0.48  # Preprocessing time       : 0.002 s
% 0.19/0.48  # Presaturation interreduction done
% 0.19/0.48  
% 0.19/0.48  # Proof found!
% 0.19/0.48  # SZS status Theorem
% 0.19/0.48  # SZS output start CNFRefutation
% See solution above
% 0.19/0.49  # Parsed axioms                        : 96
% 0.19/0.49  # Removed by relevancy pruning/SinE    : 0
% 0.19/0.49  # Initial clauses                      : 199
% 0.19/0.49  # Removed in clause preprocessing      : 2
% 0.19/0.49  # Initial clauses in saturation        : 197
% 0.19/0.49  # Processed clauses                    : 352
% 0.19/0.49  # ...of these trivial                  : 2
% 0.19/0.49  # ...subsumed                          : 11
% 0.19/0.49  # ...remaining for further processing  : 339
% 0.19/0.49  # Other redundant clauses eliminated   : 27
% 0.19/0.49  # Clauses deleted for lack of memory   : 0
% 0.19/0.49  # Backward-subsumed                    : 1
% 0.19/0.49  # Backward-rewritten                   : 11
% 0.19/0.49  # Generated clauses                    : 55
% 0.19/0.49  # ...of the previous two non-redundant : 49
% 0.19/0.49  # ...aggressively subsumed             : 0
% 0.19/0.49  # Contextual simplify-reflections      : 3
% 0.19/0.49  # Paramodulations                      : 30
% 0.19/0.49  # Factorizations                       : 0
% 0.19/0.49  # NegExts                              : 0
% 0.19/0.49  # Equation resolutions                 : 27
% 0.19/0.49  # Disequality decompositions           : 0
% 0.19/0.49  # Total rewrite steps                  : 41
% 0.19/0.49  # ...of those cached                   : 31
% 0.19/0.49  # Propositional unsat checks           : 0
% 0.19/0.49  #    Propositional check models        : 0
% 0.19/0.49  #    Propositional check unsatisfiable : 0
% 0.19/0.49  #    Propositional clauses             : 0
% 0.19/0.49  #    Propositional clauses after purity: 0
% 0.19/0.49  #    Propositional unsat core size     : 0
% 0.19/0.49  #    Propositional preprocessing time  : 0.000
% 0.19/0.49  #    Propositional encoding time       : 0.000
% 0.19/0.49  #    Propositional solver time         : 0.000
% 0.19/0.49  #    Success case prop preproc time    : 0.000
% 0.19/0.49  #    Success case prop encoding time   : 0.000
% 0.19/0.49  #    Success case prop solver time     : 0.000
% 0.19/0.49  # Current number of processed clauses  : 113
% 0.19/0.49  #    Positive orientable unit clauses  : 17
% 0.19/0.49  #    Positive unorientable unit clauses: 0
% 0.19/0.49  #    Negative unit clauses             : 2
% 0.19/0.49  #    Non-unit-clauses                  : 94
% 0.19/0.49  # Current number of unprocessed clauses: 84
% 0.19/0.49  # ...number of literals in the above   : 401
% 0.19/0.49  # Current number of archived formulas  : 0
% 0.19/0.49  # Current number of archived clauses   : 203
% 0.19/0.49  # Clause-clause subsumption calls (NU) : 11831
% 0.19/0.49  # Rec. Clause-clause subsumption calls : 3125
% 0.19/0.49  # Non-unit clause-clause subsumptions  : 13
% 0.19/0.49  # Unit Clause-clause subsumption calls : 49
% 0.19/0.49  # Rewrite failures with RHS unbound    : 0
% 0.19/0.49  # BW rewrite match attempts            : 3
% 0.19/0.49  # BW rewrite match successes           : 3
% 0.19/0.49  # Condensation attempts                : 0
% 0.19/0.49  # Condensation successes               : 0
% 0.19/0.49  # Termbank termtop insertions          : 19097
% 0.19/0.49  # Search garbage collected termcells   : 4223
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.022 s
% 0.19/0.49  # System time              : 0.002 s
% 0.19/0.49  # Total time               : 0.024 s
% 0.19/0.49  # Maximum resident set size: 2460 pages
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.083 s
% 0.19/0.49  # System time              : 0.014 s
% 0.19/0.49  # Total time               : 0.097 s
% 0.19/0.49  # Maximum resident set size: 1820 pages
% 0.19/0.49  % E---3.1 exiting
%------------------------------------------------------------------------------