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

View Problem - Process Solution

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

% Computer : n032.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:53 EDT 2023

% Result   : Theorem 0.16s 0.44s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   7 unt;   0 def)
%            Number of atoms       :   82 (  20 equ)
%            Maximal formula atoms :   30 (   5 avg)
%            Number of connectives :  100 (  34   ~;  35   |;  21   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   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-2 aty)
%            Number of variables   :   15 (   0 sgn;  11   !;   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)
                           => ( cons(X6,nil) != X3
                              | ~ memberP(X4,X6) ) ) )
                      & ( ~ neq(X2,nil)
                        | neq(X4,nil) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.A7wbHbPmMS/E---3.1_8158.p',co1) ).

fof(c_0_1,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)
                             => ( cons(X6,nil) != X3
                                | ~ memberP(X4,X6) ) ) )
                        & ( ~ neq(X2,nil)
                          | neq(X4,nil) ) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).

fof(c_0_2,negated_conjecture,
    ! [X11] :
      ( 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(X11)
        | cons(X11,nil) != esk1_0
        | ~ memberP(esk2_0,X11) )
      & ( ~ neq(esk4_0,nil)
        | ~ ssItem(X11)
        | cons(X11,nil) != esk1_0
        | ~ memberP(esk2_0,X11) )
      & ( neq(esk2_0,nil)
        | ssItem(esk5_0) )
      & ( ~ neq(esk4_0,nil)
        | ssItem(esk5_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)
        | memberP(esk4_0,esk5_0) )
      & ( ~ neq(esk4_0,nil)
        | memberP(esk4_0,esk5_0) ) ),
    inference(distribute,[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,
    ( neq(esk2_0,nil)
    | neq(esk2_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

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

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

cnf(c_0_7,negated_conjecture,
    ( memberP(esk4_0,esk5_0)
    | ~ neq(esk4_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

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

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

cnf(c_0_11,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_4,c_0_5]),c_0_6])]) ).

cnf(c_0_12,negated_conjecture,
    memberP(esk2_0,esk5_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_5]),c_0_5]),c_0_6])]) ).

cnf(c_0_13,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_8,c_0_9]),c_0_5]),c_0_6])]) ).

cnf(c_0_14,negated_conjecture,
    ssItem(esk5_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_5]),c_0_6])]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem    : SWC381+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.11  % Command    : run_E %s %d THM
% 0.12/0.31  % Computer : n032.cluster.edu
% 0.12/0.31  % Model    : x86_64 x86_64
% 0.12/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31  % Memory   : 8042.1875MB
% 0.12/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31  % CPULimit   : 2400
% 0.12/0.31  % WCLimit    : 300
% 0.12/0.31  % DateTime   : Tue Oct  3 01:46:50 EDT 2023
% 0.12/0.31  % CPUTime    : 
% 0.16/0.41  Running first-order model finding
% 0.16/0.41  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/tmp/tmp.A7wbHbPmMS/E---3.1_8158.p
% 0.16/0.44  # Version: 3.1pre001
% 0.16/0.44  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.44  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.44  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44  # Starting sh5l with 300s (1) cores
% 0.16/0.44  # new_bool_3 with pid 8236 completed with status 0
% 0.16/0.44  # Result found by new_bool_3
% 0.16/0.44  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.44  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.44  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44  # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.44  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.44  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8240 completed with status 0
% 0.16/0.44  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.44  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.44  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.44  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44  # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.44  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.44  # Preprocessing time       : 0.001 s
% 0.16/0.44  # Presaturation interreduction done
% 0.16/0.44  
% 0.16/0.44  # Proof found!
% 0.16/0.44  # SZS status Theorem
% 0.16/0.44  # SZS output start CNFRefutation
% See solution above
% 0.16/0.44  # Parsed axioms                        : 96
% 0.16/0.44  # Removed by relevancy pruning/SinE    : 73
% 0.16/0.44  # Initial clauses                      : 54
% 0.16/0.44  # Removed in clause preprocessing      : 0
% 0.16/0.44  # Initial clauses in saturation        : 54
% 0.16/0.44  # Processed clauses                    : 83
% 0.16/0.44  # ...of these trivial                  : 7
% 0.16/0.44  # ...subsumed                          : 1
% 0.16/0.44  # ...remaining for further processing  : 75
% 0.16/0.44  # Other redundant clauses eliminated   : 6
% 0.16/0.44  # Clauses deleted for lack of memory   : 0
% 0.16/0.44  # Backward-subsumed                    : 0
% 0.16/0.44  # Backward-rewritten                   : 0
% 0.16/0.44  # Generated clauses                    : 10
% 0.16/0.44  # ...of the previous two non-redundant : 9
% 0.16/0.44  # ...aggressively subsumed             : 0
% 0.16/0.44  # Contextual simplify-reflections      : 0
% 0.16/0.44  # Paramodulations                      : 5
% 0.16/0.44  # Factorizations                       : 0
% 0.16/0.44  # NegExts                              : 0
% 0.16/0.44  # Equation resolutions                 : 6
% 0.16/0.44  # Total rewrite steps                  : 33
% 0.16/0.44  # Propositional unsat checks           : 0
% 0.16/0.44  #    Propositional check models        : 0
% 0.16/0.44  #    Propositional check unsatisfiable : 0
% 0.16/0.44  #    Propositional clauses             : 0
% 0.16/0.44  #    Propositional clauses after purity: 0
% 0.16/0.44  #    Propositional unsat core size     : 0
% 0.16/0.44  #    Propositional preprocessing time  : 0.000
% 0.16/0.44  #    Propositional encoding time       : 0.000
% 0.16/0.44  #    Propositional solver time         : 0.000
% 0.16/0.44  #    Success case prop preproc time    : 0.000
% 0.16/0.44  #    Success case prop encoding time   : 0.000
% 0.16/0.44  #    Success case prop solver time     : 0.000
% 0.16/0.44  # Current number of processed clauses  : 23
% 0.16/0.44  #    Positive orientable unit clauses  : 12
% 0.16/0.44  #    Positive unorientable unit clauses: 0
% 0.16/0.44  #    Negative unit clauses             : 2
% 0.16/0.44  #    Non-unit-clauses                  : 9
% 0.16/0.44  # Current number of unprocessed clauses: 27
% 0.16/0.44  # ...number of literals in the above   : 112
% 0.16/0.44  # Current number of archived formulas  : 0
% 0.16/0.44  # Current number of archived clauses   : 47
% 0.16/0.44  # Clause-clause subsumption calls (NU) : 336
% 0.16/0.44  # Rec. Clause-clause subsumption calls : 73
% 0.16/0.44  # Non-unit clause-clause subsumptions  : 0
% 0.16/0.44  # Unit Clause-clause subsumption calls : 0
% 0.16/0.44  # Rewrite failures with RHS unbound    : 0
% 0.16/0.44  # BW rewrite match attempts            : 0
% 0.16/0.44  # BW rewrite match successes           : 0
% 0.16/0.44  # Condensation attempts                : 0
% 0.16/0.44  # Condensation successes               : 0
% 0.16/0.44  # Termbank termtop insertions          : 4641
% 0.16/0.44  
% 0.16/0.44  # -------------------------------------------------
% 0.16/0.44  # User time                : 0.004 s
% 0.16/0.44  # System time              : 0.003 s
% 0.16/0.44  # Total time               : 0.007 s
% 0.16/0.44  # Maximum resident set size: 1916 pages
% 0.16/0.44  
% 0.16/0.44  # -------------------------------------------------
% 0.16/0.44  # User time                : 0.006 s
% 0.16/0.44  # System time              : 0.004 s
% 0.16/0.44  # Total time               : 0.010 s
% 0.16/0.44  # Maximum resident set size: 1800 pages
% 0.16/0.44  % E---3.1 exiting
%------------------------------------------------------------------------------