TSTP Solution File: SWC220+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWC220+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n005.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  : 600s
% DateTime : Tue Jul 19 20:27:25 EDT 2022

% Result   : Theorem 0.24s 1.43s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   26 (  12 unt;   0 def)
%            Number of atoms       :  154 (  40 equ)
%            Maximal formula atoms :   46 (   5 avg)
%            Number of connectives :  202 (  74   ~;  78   |;  34   &)
%                                         (   0 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   27 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-3 aty)
%            Number of variables   :   45 (   0 sgn  20   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | nil = X1
                    | ? [X5] :
                        ( ssItem(X5)
                        & ? [X6] :
                            ( ssList(X6)
                            & ? [X7] :
                                ( ssList(X7)
                                & app(app(X6,cons(X5,nil)),X7) = X1
                                & ! [X8] :
                                    ( ssItem(X8)
                                   => ( ~ memberP(X6,X8)
                                      | ~ memberP(X7,X8)
                                      | ~ leq(X5,X8)
                                      | leq(X8,X5) ) ) ) ) )
                    | ( nil != X3
                      & ! [X9] :
                          ( ssItem(X9)
                         => ! [X10] :
                              ( ssList(X10)
                             => ! [X11] :
                                  ( ssList(X11)
                                 => ( app(app(X10,cons(X9,nil)),X11) != X3
                                    | ? [X12] :
                                        ( ssItem(X12)
                                        & ~ leq(X12,X9)
                                        & memberP(X10,X12)
                                        & memberP(X11,X12)
                                        & leq(X9,X12) ) ) ) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',co1) ).

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

fof(c_0_2,negated_conjecture,
    ! [X17,X18,X19,X24] :
      ( ssList(esk1_0)
      & ssList(esk2_0)
      & ssList(esk3_0)
      & ssList(esk4_0)
      & esk2_0 = esk4_0
      & esk1_0 = esk3_0
      & nil != esk1_0
      & ( ssItem(esk5_3(X17,X18,X19))
        | ~ ssList(X19)
        | app(app(X18,cons(X17,nil)),X19) != esk1_0
        | ~ ssList(X18)
        | ~ ssItem(X17) )
      & ( memberP(X18,esk5_3(X17,X18,X19))
        | ~ ssList(X19)
        | app(app(X18,cons(X17,nil)),X19) != esk1_0
        | ~ ssList(X18)
        | ~ ssItem(X17) )
      & ( memberP(X19,esk5_3(X17,X18,X19))
        | ~ ssList(X19)
        | app(app(X18,cons(X17,nil)),X19) != esk1_0
        | ~ ssList(X18)
        | ~ ssItem(X17) )
      & ( leq(X17,esk5_3(X17,X18,X19))
        | ~ ssList(X19)
        | app(app(X18,cons(X17,nil)),X19) != esk1_0
        | ~ ssList(X18)
        | ~ ssItem(X17) )
      & ( ~ leq(esk5_3(X17,X18,X19),X17)
        | ~ ssList(X19)
        | app(app(X18,cons(X17,nil)),X19) != esk1_0
        | ~ ssList(X18)
        | ~ ssItem(X17) )
      & ( ssItem(esk6_0)
        | nil = esk3_0 )
      & ( ssList(esk7_0)
        | nil = esk3_0 )
      & ( ssList(esk8_0)
        | nil = esk3_0 )
      & ( app(app(esk7_0,cons(esk6_0,nil)),esk8_0) = esk3_0
        | nil = esk3_0 )
      & ( ~ ssItem(X24)
        | leq(X24,esk6_0)
        | ~ memberP(esk7_0,X24)
        | ~ memberP(esk8_0,X24)
        | ~ leq(esk6_0,X24)
        | nil = esk3_0 ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])])])])])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( nil = esk3_0
    | app(app(esk7_0,cons(esk6_0,nil)),esk8_0) = esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

cnf(c_0_5,negated_conjecture,
    nil != esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    ( nil = esk3_0
    | ssList(esk8_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_7,negated_conjecture,
    ( nil = esk3_0
    | ssList(esk7_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_8,negated_conjecture,
    ( nil = esk3_0
    | ssItem(esk6_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_9,negated_conjecture,
    ( nil = esk3_0
    | leq(X1,esk6_0)
    | ~ leq(esk6_0,X1)
    | ~ memberP(esk8_0,X1)
    | ~ memberP(esk7_0,X1)
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_10,negated_conjecture,
    ( leq(X1,esk5_3(X1,X2,X3))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | app(app(X2,cons(X1,nil)),X3) != esk1_0
    | ~ ssList(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_11,negated_conjecture,
    app(app(esk7_0,cons(esk6_0,nil)),esk8_0) = esk1_0,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_4]),c_0_5]) ).

cnf(c_0_12,negated_conjecture,
    ssList(esk8_0),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_4]),c_0_5]) ).

cnf(c_0_13,negated_conjecture,
    ssList(esk7_0),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_4]),c_0_5]) ).

cnf(c_0_14,negated_conjecture,
    ssItem(esk6_0),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_4]),c_0_5]) ).

cnf(c_0_15,negated_conjecture,
    ( memberP(X2,esk5_3(X1,X2,X3))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | app(app(X2,cons(X1,nil)),X3) != esk1_0
    | ~ ssList(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_16,negated_conjecture,
    ( memberP(X3,esk5_3(X1,X2,X3))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | app(app(X2,cons(X1,nil)),X3) != esk1_0
    | ~ ssList(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_17,negated_conjecture,
    ( ssItem(esk5_3(X1,X2,X3))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | app(app(X2,cons(X1,nil)),X3) != esk1_0
    | ~ ssList(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ ssItem(X1)
    | ~ ssList(X2)
    | app(app(X2,cons(X1,nil)),X3) != esk1_0
    | ~ ssList(X3)
    | ~ leq(esk5_3(X1,X2,X3),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_19,negated_conjecture,
    ( leq(X1,esk6_0)
    | ~ leq(esk6_0,X1)
    | ~ memberP(esk7_0,X1)
    | ~ memberP(esk8_0,X1)
    | ~ ssItem(X1) ),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_4]),c_0_5]) ).

cnf(c_0_20,negated_conjecture,
    leq(esk6_0,esk5_3(esk6_0,esk7_0,esk8_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_14])]) ).

cnf(c_0_21,negated_conjecture,
    memberP(esk7_0,esk5_3(esk6_0,esk7_0,esk8_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_12]),c_0_13]),c_0_14])]) ).

cnf(c_0_22,negated_conjecture,
    memberP(esk8_0,esk5_3(esk6_0,esk7_0,esk8_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_11]),c_0_12]),c_0_13]),c_0_14])]) ).

cnf(c_0_23,negated_conjecture,
    ssItem(esk5_3(esk6_0,esk7_0,esk8_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_11]),c_0_12]),c_0_13]),c_0_14])]) ).

cnf(c_0_24,negated_conjecture,
    ~ leq(esk5_3(esk6_0,esk7_0,esk8_0),esk6_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_11]),c_0_12]),c_0_13]),c_0_14])]) ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]),c_0_23])]),c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SWC220+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13  % Command  : run_ET %s %d
% 0.13/0.35  % Computer : n005.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  : 600
% 0.13/0.35  % DateTime : Sun Jun 12 03:30:24 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.24/1.43  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.24/1.43  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.24/1.43  # Preprocessing time       : 0.020 s
% 0.24/1.43  
% 0.24/1.43  # Proof found!
% 0.24/1.43  # SZS status Theorem
% 0.24/1.43  # SZS output start CNFRefutation
% See solution above
% 0.24/1.43  # Proof object total steps             : 26
% 0.24/1.43  # Proof object clause steps            : 23
% 0.24/1.43  # Proof object formula steps           : 3
% 0.24/1.43  # Proof object conjectures             : 26
% 0.24/1.43  # Proof object clause conjectures      : 23
% 0.24/1.43  # Proof object formula conjectures     : 3
% 0.24/1.43  # Proof object initial clauses used    : 12
% 0.24/1.43  # Proof object initial formulas used   : 1
% 0.24/1.43  # Proof object generating inferences   : 6
% 0.24/1.43  # Proof object simplifying inferences  : 36
% 0.24/1.43  # Training examples: 0 positive, 0 negative
% 0.24/1.43  # Parsed axioms                        : 96
% 0.24/1.43  # Removed by relevancy pruning/SinE    : 72
% 0.24/1.43  # Initial clauses                      : 54
% 0.24/1.43  # Removed in clause preprocessing      : 0
% 0.24/1.43  # Initial clauses in saturation        : 54
% 0.24/1.43  # Processed clauses                    : 91
% 0.24/1.43  # ...of these trivial                  : 3
% 0.24/1.43  # ...subsumed                          : 3
% 0.24/1.43  # ...remaining for further processing  : 85
% 0.24/1.43  # Other redundant clauses eliminated   : 1
% 0.24/1.43  # Clauses deleted for lack of memory   : 0
% 0.24/1.43  # Backward-subsumed                    : 0
% 0.24/1.43  # Backward-rewritten                   : 0
% 0.24/1.43  # Generated clauses                    : 227
% 0.24/1.43  # ...of the previous two non-trivial   : 202
% 0.24/1.43  # Contextual simplify-reflections      : 0
% 0.24/1.43  # Paramodulations                      : 225
% 0.24/1.43  # Factorizations                       : 0
% 0.24/1.43  # Equation resolutions                 : 2
% 0.24/1.43  # Current number of processed clauses  : 84
% 0.24/1.43  #    Positive orientable unit clauses  : 30
% 0.24/1.43  #    Positive unorientable unit clauses: 0
% 0.24/1.43  #    Negative unit clauses             : 4
% 0.24/1.43  #    Non-unit-clauses                  : 50
% 0.24/1.43  # Current number of unprocessed clauses: 165
% 0.24/1.43  # ...number of literals in the above   : 524
% 0.24/1.43  # Current number of archived formulas  : 0
% 0.24/1.43  # Current number of archived clauses   : 0
% 0.24/1.43  # Clause-clause subsumption calls (NU) : 202
% 0.24/1.43  # Rec. Clause-clause subsumption calls : 52
% 0.24/1.43  # Non-unit clause-clause subsumptions  : 0
% 0.24/1.43  # Unit Clause-clause subsumption calls : 79
% 0.24/1.43  # Rewrite failures with RHS unbound    : 0
% 0.24/1.43  # BW rewrite match attempts            : 0
% 0.24/1.43  # BW rewrite match successes           : 0
% 0.24/1.43  # Condensation attempts                : 0
% 0.24/1.43  # Condensation successes               : 0
% 0.24/1.43  # Termbank termtop insertions          : 8177
% 0.24/1.43  
% 0.24/1.43  # -------------------------------------------------
% 0.24/1.43  # User time                : 0.024 s
% 0.24/1.43  # System time              : 0.002 s
% 0.24/1.43  # Total time               : 0.026 s
% 0.24/1.43  # Maximum resident set size: 3204 pages
% 0.24/23.42  eprover: CPU time limit exceeded, terminating
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.49  eprover: No such file or directory
% 0.24/23.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.50  eprover: No such file or directory
% 0.24/23.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.50  eprover: No such file or directory
%------------------------------------------------------------------------------