TSTP Solution File: SWC026+1 by PyRes---1.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : PyRes---1.3
% Problem  : SWC026+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n021.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 21:47:28 EDT 2022

% Result   : Theorem 70.80s 71.08s
% Output   : Refutation 70.80s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named input)

% Comments : 
%------------------------------------------------------------------------------
cnf(transitivity,axiom,
    ( X255 != X253
    | X253 != X254
    | X255 = X254 ),
    eq_axiom ).

cnf(symmetry,axiom,
    ( X252 != X251
    | X251 = X252 ),
    eq_axiom ).

fof(co1,conjecture,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ! [X] :
                  ( ssList(X)
                 => ( V != X
                    | U != W
                    | ( nil != X
                      & nil = W )
                    | ( nil != W
                      & nil = X )
                    | ( ( nil != V
                        | nil = U )
                      & ( nil != U
                        | nil = V ) ) ) ) ) ) ),
    input ).

fof(c23,negated_conjecture,
    ~ ! [U] :
        ( ssList(U)
       => ! [V] :
            ( ssList(V)
           => ! [W] :
                ( ssList(W)
               => ! [X] :
                    ( ssList(X)
                   => ( V != X
                      | U != W
                      | ( nil != X
                        & nil = W )
                      | ( nil != W
                        & nil = X )
                      | ( ( nil != V
                          | nil = U )
                        & ( nil != U
                          | nil = V ) ) ) ) ) ) ),
    inference(assume_negation,status(cth),[co1]) ).

fof(c24,negated_conjecture,
    ? [U] :
      ( ssList(U)
      & ? [V] :
          ( ssList(V)
          & ? [W] :
              ( ssList(W)
              & ? [X] :
                  ( ssList(X)
                  & V = X
                  & U = W
                  & ( nil = X
                    | nil != W )
                  & ( nil = W
                    | nil != X )
                  & ( ( nil = V
                      & nil != U )
                    | ( nil = U
                      & nil != V ) ) ) ) ) ),
    inference(fof_nnf,status(thm),[c23]) ).

fof(c25,negated_conjecture,
    ? [X2] :
      ( ssList(X2)
      & ? [X3] :
          ( ssList(X3)
          & ? [X4] :
              ( ssList(X4)
              & ? [X5] :
                  ( ssList(X5)
                  & X3 = X5
                  & X2 = X4
                  & ( nil = X5
                    | nil != X4 )
                  & ( nil = X4
                    | nil != X5 )
                  & ( ( nil = X3
                      & nil != X2 )
                    | ( nil = X2
                      & nil != X3 ) ) ) ) ) ),
    inference(variable_rename,status(thm),[c24]) ).

fof(c26,negated_conjecture,
    ( ssList(skolem0001)
    & ssList(skolem0002)
    & ssList(skolem0003)
    & ssList(skolem0004)
    & skolem0002 = skolem0004
    & skolem0001 = skolem0003
    & ( nil = skolem0004
      | nil != skolem0003 )
    & ( nil = skolem0003
      | nil != skolem0004 )
    & ( ( nil = skolem0002
        & nil != skolem0001 )
      | ( nil = skolem0001
        & nil != skolem0002 ) ) ),
    inference(skolemize,status(esa),[c25]) ).

fof(c27,negated_conjecture,
    ( ssList(skolem0001)
    & ssList(skolem0002)
    & ssList(skolem0003)
    & ssList(skolem0004)
    & skolem0002 = skolem0004
    & skolem0001 = skolem0003
    & ( nil = skolem0004
      | nil != skolem0003 )
    & ( nil = skolem0003
      | nil != skolem0004 )
    & ( nil = skolem0002
      | nil = skolem0001 )
    & ( nil = skolem0002
      | nil != skolem0002 )
    & ( nil != skolem0001
      | nil = skolem0001 )
    & ( nil != skolem0001
      | nil != skolem0002 ) ),
    inference(distribute,status(thm),[c26]) ).

cnf(c33,negated_conjecture,
    skolem0001 = skolem0003,
    inference(split_conjunct,status(thm),[c27]) ).

cnf(c516,plain,
    skolem0003 = skolem0001,
    inference(resolution,status(thm),[c33,symmetry]) ).

cnf(c527,plain,
    ( X359 != skolem0003
    | X359 = skolem0001 ),
    inference(resolution,status(thm),[c516,transitivity]) ).

cnf(c35,negated_conjecture,
    ( nil = skolem0003
    | nil != skolem0004 ),
    inference(split_conjunct,status(thm),[c27]) ).

cnf(c36,negated_conjecture,
    ( nil = skolem0002
    | nil = skolem0001 ),
    inference(split_conjunct,status(thm),[c27]) ).

cnf(c32,negated_conjecture,
    skolem0002 = skolem0004,
    inference(split_conjunct,status(thm),[c27]) ).

cnf(c514,plain,
    ( X356 != skolem0002
    | X356 = skolem0004 ),
    inference(resolution,status(thm),[c32,transitivity]) ).

cnf(c701,plain,
    ( nil = skolem0004
    | nil = skolem0001 ),
    inference(resolution,status(thm),[c514,c36]) ).

cnf(c19399,plain,
    ( nil = skolem0001
    | nil = skolem0003 ),
    inference(resolution,status(thm),[c701,c35]) ).

cnf(c83056,plain,
    nil = skolem0001,
    inference(resolution,status(thm),[c19399,c527]) ).

cnf(c39,negated_conjecture,
    ( nil != skolem0001
    | nil != skolem0002 ),
    inference(split_conjunct,status(thm),[c27]) ).

cnf(c513,plain,
    skolem0004 = skolem0002,
    inference(resolution,status(thm),[c32,symmetry]) ).

cnf(c523,plain,
    ( X358 != skolem0004
    | X358 = skolem0002 ),
    inference(resolution,status(thm),[c513,transitivity]) ).

cnf(c34,negated_conjecture,
    ( nil = skolem0004
    | nil != skolem0003 ),
    inference(split_conjunct,status(thm),[c27]) ).

cnf(c517,plain,
    ( X357 != skolem0001
    | X357 = skolem0003 ),
    inference(resolution,status(thm),[c33,transitivity]) ).

cnf(c82881,plain,
    nil = skolem0003,
    inference(resolution,status(thm),[c19399,c517]) ).

cnf(c83187,plain,
    nil = skolem0004,
    inference(resolution,status(thm),[c82881,c34]) ).

cnf(c83536,plain,
    nil = skolem0002,
    inference(resolution,status(thm),[c83187,c523]) ).

cnf(c83949,plain,
    nil != skolem0001,
    inference(resolution,status(thm),[c83536,c39]) ).

cnf(c84196,plain,
    $false,
    inference(resolution,status(thm),[c83949,c83056]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWC026+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.35  % Computer : n021.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Sat Jun 11 23:36:40 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 70.80/71.08  # Version:  1.3
% 70.80/71.08  # SZS status Theorem
% 70.80/71.08  # SZS output start CNFRefutation
% See solution above
% 70.80/71.08  
% 70.80/71.08  # Initial clauses    : 228
% 70.80/71.08  # Processed clauses  : 2371
% 70.80/71.08  # Factors computed   : 1
% 70.80/71.08  # Resolvents computed: 83687
% 70.80/71.08  # Tautologies deleted: 18
% 70.80/71.08  # Forward subsumed   : 2550
% 70.80/71.08  # Backward subsumed  : 906
% 70.80/71.08  # -------- CPU Time ---------
% 70.80/71.08  # User time          : 70.468 s
% 70.80/71.08  # System time        : 0.210 s
% 70.80/71.08  # Total time         : 70.678 s
%------------------------------------------------------------------------------