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

View Problem - Process Solution

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

% Computer : n026.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:32 EDT 2022

% Result   : Theorem 0.23s 1.42s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   30 (  11 unt;   0 def)
%            Number of atoms       :  155 (  49 equ)
%            Maximal formula atoms :   28 (   5 avg)
%            Number of connectives :  191 (  66   ~;  63   |;  41   &)
%                                         (   1 <=>;  20  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   28 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   58 (   0 sgn  33   !;  14   ?)

% 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) )
                    | ! [X6] :
                        ( ssList(X6)
                       => ! [X7] :
                            ( ssList(X7)
                           => ( app(app(X6,X3),X7) != X4
                              | ~ equalelemsP(X3)
                              | ? [X8] :
                                  ( ssItem(X8)
                                  & ? [X9] :
                                      ( ssList(X9)
                                      & app(X9,cons(X8,nil)) = X6
                                      & ? [X10] :
                                          ( ssList(X10)
                                          & app(cons(X8,nil),X10) = X3 ) ) )
                              | ? [X11] :
                                  ( ssItem(X11)
                                  & ? [X12] :
                                      ( ssList(X12)
                                      & app(cons(X11,nil),X12) = X7
                                      & ? [X13] :
                                          ( ssList(X13)
                                          & app(X13,cons(X11,nil)) = X3 ) ) ) ) ) )
                    | ( nil != X4
                      & nil = X3 )
                    | ( nil = X2
                      & nil = X1 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).

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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).

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

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

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

fof(c_0_5,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) )
                      | ! [X6] :
                          ( ssList(X6)
                         => ! [X7] :
                              ( ssList(X7)
                             => ( app(app(X6,X3),X7) != X4
                                | ~ equalelemsP(X3)
                                | ? [X8] :
                                    ( ssItem(X8)
                                    & ? [X9] :
                                        ( ssList(X9)
                                        & app(X9,cons(X8,nil)) = X6
                                        & ? [X10] :
                                            ( ssList(X10)
                                            & app(cons(X8,nil),X10) = X3 ) ) )
                                | ? [X11] :
                                    ( ssItem(X11)
                                    & ? [X12] :
                                        ( ssList(X12)
                                        & app(cons(X11,nil),X12) = X7
                                        & ? [X13] :
                                            ( ssList(X13)
                                            & app(X13,cons(X11,nil)) = X3 ) ) ) ) ) )
                      | ( nil != X4
                        & nil = X3 )
                      | ( nil = X2
                        & nil = X1 ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_6,negated_conjecture,
    ! [X18,X21,X22,X23,X24,X25,X26] :
      ( ssList(esk1_0)
      & ssList(esk2_0)
      & ssList(esk3_0)
      & ssList(esk4_0)
      & esk2_0 = esk4_0
      & esk1_0 = esk3_0
      & ( ~ ssList(X18)
        | ~ neq(X18,nil)
        | ~ segmentP(esk2_0,X18)
        | ~ segmentP(esk1_0,X18) )
      & ssList(esk5_0)
      & ssList(esk6_0)
      & app(app(esk5_0,esk3_0),esk6_0) = esk4_0
      & equalelemsP(esk3_0)
      & ( ~ ssItem(X21)
        | ~ ssList(X22)
        | app(X22,cons(X21,nil)) != esk5_0
        | ~ ssList(X23)
        | app(cons(X21,nil),X23) != esk3_0 )
      & ( ~ ssItem(X24)
        | ~ ssList(X25)
        | app(cons(X24,nil),X25) != esk6_0
        | ~ ssList(X26)
        | app(X26,cons(X24,nil)) != esk3_0 )
      & ( nil = esk4_0
        | nil != esk3_0 )
      & ( nil != esk2_0
        | nil != esk1_0 ) ),
    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_5])])])])])])]) ).

fof(c_0_7,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_8,negated_conjecture,
    app(app(esk5_0,esk3_0),esk6_0) = esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

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

cnf(c_0_11,negated_conjecture,
    esk2_0 = esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_12,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])])])])])]) ).

cnf(c_0_13,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_7]) ).

cnf(c_0_14,negated_conjecture,
    app(app(esk5_0,esk1_0),esk6_0) = esk4_0,
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_15,negated_conjecture,
    ssList(esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_16,negated_conjecture,
    ssList(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_17,negated_conjecture,
    ssList(esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_18,negated_conjecture,
    ( nil = esk4_0
    | nil != esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ segmentP(esk1_0,X1)
    | ~ segmentP(esk4_0,X1)
    | ~ ssList(X1)
    | ~ neq(X1,nil) ),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

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

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

cnf(c_0_22,negated_conjecture,
    ( segmentP(esk4_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_13,c_0_14]),c_0_15]),c_0_16]),c_0_17])]) ).

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

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

cnf(c_0_25,negated_conjecture,
    ( nil = esk4_0
    | nil != esk1_0 ),
    inference(rw,[status(thm)],[c_0_18,c_0_9]) ).

cnf(c_0_26,negated_conjecture,
    ( X1 = nil
    | ~ segmentP(esk1_0,X1)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22]) ).

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

cnf(c_0_28,negated_conjecture,
    nil != esk1_0,
    inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_11]),c_0_25]) ).

cnf(c_0_29,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_16])]),c_0_28]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWC076+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n026.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  : 600
% 0.12/0.34  % DateTime : Sun Jun 12 03:50:20 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.23/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42  # Preprocessing time       : 0.021 s
% 0.23/1.42  
% 0.23/1.42  # Proof found!
% 0.23/1.42  # SZS status Theorem
% 0.23/1.42  # SZS output start CNFRefutation
% See solution above
% 0.23/1.42  # Proof object total steps             : 30
% 0.23/1.42  # Proof object clause steps            : 20
% 0.23/1.42  # Proof object formula steps           : 10
% 0.23/1.42  # Proof object conjectures             : 19
% 0.23/1.42  # Proof object clause conjectures      : 16
% 0.23/1.42  # Proof object formula conjectures     : 3
% 0.23/1.42  # Proof object initial clauses used    : 13
% 0.23/1.42  # Proof object initial formulas used   : 5
% 0.23/1.42  # Proof object generating inferences   : 3
% 0.23/1.42  # Proof object simplifying inferences  : 15
% 0.23/1.42  # Training examples: 0 positive, 0 negative
% 0.23/1.42  # Parsed axioms                        : 96
% 0.23/1.42  # Removed by relevancy pruning/SinE    : 67
% 0.23/1.42  # Initial clauses                      : 62
% 0.23/1.42  # Removed in clause preprocessing      : 0
% 0.23/1.42  # Initial clauses in saturation        : 62
% 0.23/1.42  # Processed clauses                    : 115
% 0.23/1.42  # ...of these trivial                  : 2
% 0.23/1.42  # ...subsumed                          : 19
% 0.23/1.42  # ...remaining for further processing  : 94
% 0.23/1.42  # Other redundant clauses eliminated   : 4
% 0.23/1.42  # Clauses deleted for lack of memory   : 0
% 0.23/1.42  # Backward-subsumed                    : 5
% 0.23/1.42  # Backward-rewritten                   : 0
% 0.23/1.42  # Generated clauses                    : 272
% 0.23/1.42  # ...of the previous two non-trivial   : 236
% 0.23/1.42  # Contextual simplify-reflections      : 7
% 0.23/1.42  # Paramodulations                      : 260
% 0.23/1.42  # Factorizations                       : 0
% 0.23/1.42  # Equation resolutions                 : 12
% 0.23/1.42  # Current number of processed clauses  : 87
% 0.23/1.42  #    Positive orientable unit clauses  : 13
% 0.23/1.42  #    Positive unorientable unit clauses: 0
% 0.23/1.42  #    Negative unit clauses             : 3
% 0.23/1.42  #    Non-unit-clauses                  : 71
% 0.23/1.42  # Current number of unprocessed clauses: 179
% 0.23/1.42  # ...number of literals in the above   : 1062
% 0.23/1.42  # Current number of archived formulas  : 0
% 0.23/1.42  # Current number of archived clauses   : 5
% 0.23/1.42  # Clause-clause subsumption calls (NU) : 648
% 0.23/1.42  # Rec. Clause-clause subsumption calls : 260
% 0.23/1.42  # Non-unit clause-clause subsumptions  : 20
% 0.23/1.42  # Unit Clause-clause subsumption calls : 4
% 0.23/1.42  # Rewrite failures with RHS unbound    : 0
% 0.23/1.42  # BW rewrite match attempts            : 0
% 0.23/1.42  # BW rewrite match successes           : 0
% 0.23/1.42  # Condensation attempts                : 0
% 0.23/1.42  # Condensation successes               : 0
% 0.23/1.42  # Termbank termtop insertions          : 9996
% 0.23/1.42  
% 0.23/1.42  # -------------------------------------------------
% 0.23/1.42  # User time                : 0.034 s
% 0.23/1.42  # System time              : 0.003 s
% 0.23/1.42  # Total time               : 0.037 s
% 0.23/1.42  # Maximum resident set size: 3472 pages
% 0.23/23.41  eprover: CPU time limit exceeded, terminating
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47  eprover: No such file or directory
%------------------------------------------------------------------------------