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

View Problem - Process Solution

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

% Computer : n014.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:28:37 EDT 2022

% Result   : Theorem 0.23s 1.41s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   31 (  12 unt;   0 def)
%            Number of atoms       :  113 (  42 equ)
%            Maximal formula atoms :   22 (   3 avg)
%            Number of connectives :  134 (  52   ~;  46   |;  24   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   38 (   0 sgn  23   !;   6   ?)

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

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

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

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

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

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

fof(c_0_6,negated_conjecture,
    ! [X14,X15,X16] :
      ( ssList(esk1_0)
      & ssList(esk2_0)
      & ssList(esk3_0)
      & ssList(esk4_0)
      & esk2_0 = esk4_0
      & esk1_0 = esk3_0
      & neq(esk2_0,nil)
      & ( ~ ssItem(X14)
        | ~ ssList(X15)
        | ~ ssList(X16)
        | app(app(X15,cons(X14,nil)),X16) != esk2_0
        | app(app(X16,cons(X14,nil)),X15) != esk1_0 )
      & ( nil = esk3_0
        | nil != esk4_0 )
      & ( ssItem(esk5_0)
        | ~ neq(esk4_0,nil) )
      & ( ssList(esk6_0)
        | ~ neq(esk4_0,nil) )
      & ( app(cons(esk5_0,nil),esk6_0) = esk4_0
        | ~ neq(esk4_0,nil) )
      & ( app(esk6_0,cons(esk5_0,nil)) = esk3_0
        | ~ neq(esk4_0,nil) ) ),
    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_5])])])])])])])]) ).

fof(c_0_7,plain,
    ! [X2] :
      ( ~ ssList(X2)
      | app(nil,X2) = X2 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).

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

cnf(c_0_9,plain,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

cnf(c_0_11,negated_conjecture,
    ( app(esk6_0,cons(esk5_0,nil)) = esk3_0
    | ~ neq(esk4_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

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

cnf(c_0_14,negated_conjecture,
    neq(esk2_0,nil),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_15,negated_conjecture,
    ( app(cons(esk5_0,nil),esk6_0) = esk4_0
    | ~ neq(esk4_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_16,negated_conjecture,
    ( ssList(esk6_0)
    | ~ neq(esk4_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

cnf(c_0_18,negated_conjecture,
    ( app(app(X1,cons(X2,nil)),nil) != esk1_0
    | app(cons(X2,nil),X1) != esk2_0
    | ~ ssList(cons(X2,nil))
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).

cnf(c_0_19,negated_conjecture,
    app(esk6_0,cons(esk5_0,nil)) = esk1_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).

cnf(c_0_20,negated_conjecture,
    app(cons(esk5_0,nil),esk6_0) = esk2_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_13]),c_0_13]),c_0_14])]) ).

cnf(c_0_21,negated_conjecture,
    ssList(esk6_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_13]),c_0_14])]) ).

cnf(c_0_22,negated_conjecture,
    ssItem(esk5_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_13]),c_0_14])]) ).

fof(c_0_23,plain,
    ! [X3,X4] :
      ( ~ ssList(X3)
      | ~ ssItem(X4)
      | ssList(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)],[ax16])])])])]) ).

cnf(c_0_24,negated_conjecture,
    ( app(esk1_0,nil) != esk1_0
    | ~ ssList(cons(esk5_0,nil)) ),
    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_19]),c_0_20]),c_0_21]),c_0_22])]) ).

cnf(c_0_25,plain,
    ( ssList(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

fof(c_0_26,plain,
    ! [X2] :
      ( ~ ssList(X2)
      | app(X2,nil) = X2 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).

cnf(c_0_27,negated_conjecture,
    app(esk1_0,nil) != esk1_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_10]),c_0_22])]) ).

cnf(c_0_28,plain,
    ( app(X1,nil) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWC419+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n014.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jun 11 20:58:08 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.23/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41  # Preprocessing time       : 0.019 s
% 0.23/1.41  
% 0.23/1.41  # Proof found!
% 0.23/1.41  # SZS status Theorem
% 0.23/1.41  # SZS output start CNFRefutation
% See solution above
% 0.23/1.41  # Proof object total steps             : 31
% 0.23/1.41  # Proof object clause steps            : 21
% 0.23/1.41  # Proof object formula steps           : 10
% 0.23/1.41  # Proof object conjectures             : 20
% 0.23/1.41  # Proof object clause conjectures      : 17
% 0.23/1.41  # Proof object formula conjectures     : 3
% 0.23/1.41  # Proof object initial clauses used    : 13
% 0.23/1.41  # Proof object initial formulas used   : 5
% 0.23/1.41  # Proof object generating inferences   : 4
% 0.23/1.41  # Proof object simplifying inferences  : 25
% 0.23/1.41  # Training examples: 0 positive, 0 negative
% 0.23/1.41  # Parsed axioms                        : 96
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 77
% 0.23/1.41  # Initial clauses                      : 40
% 0.23/1.41  # Removed in clause preprocessing      : 0
% 0.23/1.41  # Initial clauses in saturation        : 40
% 0.23/1.41  # Processed clauses                    : 71
% 0.23/1.41  # ...of these trivial                  : 2
% 0.23/1.41  # ...subsumed                          : 12
% 0.23/1.41  # ...remaining for further processing  : 57
% 0.23/1.41  # Other redundant clauses eliminated   : 2
% 0.23/1.41  # Clauses deleted for lack of memory   : 0
% 0.23/1.41  # Backward-subsumed                    : 3
% 0.23/1.41  # Backward-rewritten                   : 0
% 0.23/1.41  # Generated clauses                    : 155
% 0.23/1.41  # ...of the previous two non-trivial   : 135
% 0.23/1.41  # Contextual simplify-reflections      : 4
% 0.23/1.41  # Paramodulations                      : 149
% 0.23/1.41  # Factorizations                       : 0
% 0.23/1.41  # Equation resolutions                 : 6
% 0.23/1.41  # Current number of processed clauses  : 52
% 0.23/1.41  #    Positive orientable unit clauses  : 13
% 0.23/1.41  #    Positive unorientable unit clauses: 0
% 0.23/1.41  #    Negative unit clauses             : 6
% 0.23/1.41  #    Non-unit-clauses                  : 33
% 0.23/1.41  # Current number of unprocessed clauses: 104
% 0.23/1.41  # ...number of literals in the above   : 529
% 0.23/1.41  # Current number of archived formulas  : 0
% 0.23/1.41  # Current number of archived clauses   : 3
% 0.23/1.41  # Clause-clause subsumption calls (NU) : 226
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 122
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 9
% 0.23/1.41  # Unit Clause-clause subsumption calls : 60
% 0.23/1.41  # Rewrite failures with RHS unbound    : 0
% 0.23/1.41  # BW rewrite match attempts            : 0
% 0.23/1.41  # BW rewrite match successes           : 0
% 0.23/1.41  # Condensation attempts                : 0
% 0.23/1.41  # Condensation successes               : 0
% 0.23/1.41  # Termbank termtop insertions          : 5817
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.020 s
% 0.23/1.41  # System time              : 0.006 s
% 0.23/1.41  # Total time               : 0.026 s
% 0.23/1.41  # Maximum resident set size: 3160 pages
% 0.23/23.41  eprover: CPU time limit exceeded, terminating
% 0.23/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.42  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.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.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.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48  eprover: No such file or directory
% 0.23/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48  eprover: No such file or directory
%------------------------------------------------------------------------------