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

View Problem - Process Solution

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

% Computer : n019.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:26:30 EDT 2022

% Result   : Theorem 0.24s 1.42s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   40 (  10 unt;   0 def)
%            Number of atoms       :  193 (  67 equ)
%            Maximal formula atoms :   48 (   4 avg)
%            Number of connectives :  226 (  73   ~;  88   |;  40   &)
%                                         (   1 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   29 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   54 (   0 sgn  35   !;   6   ?)

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

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

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

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

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

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

fof(c_0_7,negated_conjecture,
    ! [X15,X19,X20] :
      ( ssList(esk1_0)
      & ssList(esk2_0)
      & ssList(esk3_0)
      & ssList(esk4_0)
      & esk2_0 = esk4_0
      & esk1_0 = esk3_0
      & ( ~ ssList(X15)
        | ~ neq(X15,nil)
        | ~ segmentP(esk2_0,X15)
        | ~ segmentP(esk1_0,X15) )
      & ( nil != esk2_0
        | nil != esk1_0 )
      & ( nil = esk4_0
        | ssItem(esk5_0) )
      & ( nil = esk3_0
        | ssItem(esk5_0) )
      & ( nil = esk4_0
        | ssList(esk6_0) )
      & ( nil = esk3_0
        | ssList(esk6_0) )
      & ( nil = esk4_0
        | ssList(esk7_0) )
      & ( nil = esk3_0
        | ssList(esk7_0) )
      & ( nil = esk4_0
        | cons(esk5_0,nil) = esk3_0 )
      & ( nil = esk3_0
        | cons(esk5_0,nil) = esk3_0 )
      & ( nil = esk4_0
        | app(app(esk6_0,esk3_0),esk7_0) = esk4_0 )
      & ( nil = esk3_0
        | app(app(esk6_0,esk3_0),esk7_0) = esk4_0 )
      & ( nil = esk4_0
        | ~ ssItem(X19)
        | ~ memberP(esk6_0,X19)
        | ~ lt(esk5_0,X19) )
      & ( nil = esk3_0
        | ~ ssItem(X19)
        | ~ memberP(esk6_0,X19)
        | ~ lt(esk5_0,X19) )
      & ( nil = esk4_0
        | ~ ssItem(X20)
        | ~ memberP(esk7_0,X20)
        | ~ lt(X20,esk5_0) )
      & ( nil = esk3_0
        | ~ ssItem(X20)
        | ~ memberP(esk7_0,X20)
        | ~ lt(X20,esk5_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)],[c_0_6])])])])])])]) ).

fof(c_0_8,plain,
    ! [X3,X4] :
      ( ~ ssList(X3)
      | ~ ssItem(X4)
      | nil != cons(X4,X3) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])])])]) ).

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

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

cnf(c_0_11,negated_conjecture,
    esk1_0 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    ( ssItem(esk5_0)
    | nil = esk4_0 ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,negated_conjecture,
    ( app(app(esk6_0,esk3_0),esk7_0) = esk4_0
    | nil = esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_14,plain,
    ( nil != cons(X1,X2)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_15,negated_conjecture,
    ( cons(esk5_0,nil) = esk1_0
    | nil = esk2_0 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

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

cnf(c_0_17,negated_conjecture,
    ( nil = esk2_0
    | ssItem(esk5_0) ),
    inference(rw,[status(thm)],[c_0_12,c_0_10]) ).

cnf(c_0_18,negated_conjecture,
    ( nil != esk1_0
    | nil != esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

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

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

fof(c_0_22,plain,
    ! [X5,X6,X7,X8] :
      ( ~ ssList(X5)
      | ~ ssList(X6)
      | ~ ssList(X7)
      | ~ ssList(X8)
      | ~ segmentP(X5,X6)
      | segmentP(app(app(X7,X5),X8),X6) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])])]) ).

cnf(c_0_23,negated_conjecture,
    ( app(app(esk6_0,esk1_0),esk7_0) = esk2_0
    | nil = esk1_0 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11]),c_0_11]),c_0_10]) ).

cnf(c_0_24,negated_conjecture,
    nil != esk1_0,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]),c_0_18]) ).

cnf(c_0_25,negated_conjecture,
    ( nil = esk1_0
    | ssList(esk7_0) ),
    inference(rw,[status(thm)],[c_0_19,c_0_11]) ).

cnf(c_0_26,negated_conjecture,
    ( nil = esk1_0
    | ssList(esk6_0) ),
    inference(rw,[status(thm)],[c_0_20,c_0_11]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ segmentP(esk1_0,X1)
    | ~ segmentP(esk2_0,X1)
    | ~ neq(X1,nil)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

cnf(c_0_29,plain,
    ( segmentP(app(app(X1,X2),X3),X4)
    | ~ segmentP(X2,X4)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssList(X4)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_30,negated_conjecture,
    app(app(esk6_0,esk1_0),esk7_0) = esk2_0,
    inference(sr,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_31,negated_conjecture,
    ssList(esk7_0),
    inference(sr,[status(thm)],[c_0_25,c_0_24]) ).

cnf(c_0_32,negated_conjecture,
    ssList(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_33,negated_conjecture,
    ssList(esk6_0),
    inference(sr,[status(thm)],[c_0_26,c_0_24]) ).

cnf(c_0_34,negated_conjecture,
    ( X1 = nil
    | ~ segmentP(esk1_0,X1)
    | ~ segmentP(esk2_0,X1)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_16])]) ).

cnf(c_0_35,negated_conjecture,
    ( segmentP(esk2_0,X1)
    | ~ segmentP(esk1_0,X1)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_33])]) ).

fof(c_0_36,plain,
    ! [X2] :
      ( ~ ssList(X2)
      | segmentP(X2,X2) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).

cnf(c_0_37,negated_conjecture,
    ( X1 = nil
    | ~ segmentP(esk1_0,X1)
    | ~ ssList(X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_38,plain,
    ( segmentP(X1,X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_39,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_32])]),c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWC071+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.13/0.33  % Computer : n019.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jun 12 11:14:40 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.24/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42  # Preprocessing time       : 0.023 s
% 0.24/1.42  
% 0.24/1.42  # Proof found!
% 0.24/1.42  # SZS status Theorem
% 0.24/1.42  # SZS output start CNFRefutation
% See solution above
% 0.24/1.42  # Proof object total steps             : 40
% 0.24/1.42  # Proof object clause steps            : 28
% 0.24/1.42  # Proof object formula steps           : 12
% 0.24/1.42  # Proof object conjectures             : 26
% 0.24/1.42  # Proof object clause conjectures      : 23
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 15
% 0.24/1.42  # Proof object initial formulas used   : 6
% 0.24/1.42  # Proof object generating inferences   : 5
% 0.24/1.42  # Proof object simplifying inferences  : 24
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 96
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 57
% 0.24/1.42  # Initial clauses                      : 82
% 0.24/1.42  # Removed in clause preprocessing      : 0
% 0.24/1.42  # Initial clauses in saturation        : 82
% 0.24/1.42  # Processed clauses                    : 153
% 0.24/1.42  # ...of these trivial                  : 2
% 0.24/1.42  # ...subsumed                          : 32
% 0.24/1.42  # ...remaining for further processing  : 119
% 0.24/1.42  # Other redundant clauses eliminated   : 6
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 13
% 0.24/1.42  # Backward-rewritten                   : 0
% 0.24/1.42  # Generated clauses                    : 438
% 0.24/1.42  # ...of the previous two non-trivial   : 359
% 0.24/1.42  # Contextual simplify-reflections      : 18
% 0.24/1.42  # Paramodulations                      : 421
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 12
% 0.24/1.42  # Current number of processed clauses  : 97
% 0.24/1.42  #    Positive orientable unit clauses  : 16
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 3
% 0.24/1.42  #    Non-unit-clauses                  : 78
% 0.24/1.42  # Current number of unprocessed clauses: 233
% 0.24/1.42  # ...number of literals in the above   : 1318
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 18
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 1155
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 483
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 38
% 0.24/1.42  # Unit Clause-clause subsumption calls : 113
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 5
% 0.24/1.42  # BW rewrite match successes           : 5
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 13300
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.048 s
% 0.24/1.42  # System time              : 0.003 s
% 0.24/1.42  # Total time               : 0.051 s
% 0.24/1.42  # Maximum resident set size: 3480 pages
% 0.24/23.41  eprover: CPU time limit exceeded, terminating
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 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.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.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.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
%------------------------------------------------------------------------------