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

% Computer : n028.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:31 EDT 2022

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

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

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

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

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

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

cnf(c34,negated_conjecture,
    nil != skolem0001,
    inference(split_conjunct,status(thm),[c26]) ).

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

cnf(c31,negated_conjecture,
    nil = skolem0002,
    inference(split_conjunct,status(thm),[c26]) ).

cnf(transitivity,axiom,
    ( X253 != X255
    | X255 != X254
    | X253 = X254 ),
    eq_axiom ).

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

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

cnf(c731,plain,
    nil = skolem0004,
    inference(resolution,status(thm),[c513,c31]) ).

cnf(c741,plain,
    nil = skolem0003,
    inference(resolution,status(thm),[c731,c35]) ).

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

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

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

cnf(c529,plain,
    ( X432 != skolem0003
    | X432 = skolem0001 ),
    inference(resolution,status(thm),[c515,transitivity]) ).

cnf(c963,plain,
    nil = skolem0001,
    inference(resolution,status(thm),[c529,c741]) ).

cnf(c985,plain,
    $false,
    inference(resolution,status(thm),[c963,c34]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SWC036+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.33  % Computer : n028.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 : Sun Jun 12 12:03:36 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.79/1.00  # Version:  1.3
% 0.79/1.00  # SZS status Theorem
% 0.79/1.00  # SZS output start CNFRefutation
% See solution above
% 0.79/1.00  
% 0.79/1.00  # Initial clauses    : 225
% 0.79/1.00  # Processed clauses  : 256
% 0.79/1.00  # Factors computed   : 0
% 0.79/1.00  # Resolvents computed: 503
% 0.79/1.00  # Tautologies deleted: 13
% 0.79/1.00  # Forward subsumed   : 103
% 0.79/1.00  # Backward subsumed  : 43
% 0.79/1.00  # -------- CPU Time ---------
% 0.79/1.00  # User time          : 0.648 s
% 0.79/1.00  # System time        : 0.020 s
% 0.79/1.00  # Total time         : 0.668 s
%------------------------------------------------------------------------------