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

% Computer : n006.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  : 300s
% DateTime : Thu May  9 17:43:24 EDT 2024

% Result   : Theorem 5.08s 5.32s
% Output   : Refutation 5.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   6 unt;   0 def)
%            Number of atoms       :   63 (  19 equ)
%            Maximal formula atoms :    8 (   4 avg)
%            Number of connectives :   69 (  21   ~;  15   |;  21   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   28 (   0 sgn  12   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ! [X] :
                  ( ssList(X)
                 => ( V != X
                    | U != W
                    | ~ neq(V,nil)
                    | neq(X,nil) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(c23,negated_conjecture,
    ~ ! [U] :
        ( ssList(U)
       => ! [V] :
            ( ssList(V)
           => ! [W] :
                ( ssList(W)
               => ! [X] :
                    ( ssList(X)
                   => ( V != X
                      | U != W
                      | ~ neq(V,nil)
                      | neq(X,nil) ) ) ) ) ),
    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
                      | ~ neq(V,nil)
                      | neq(X,nil) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[c23]) ).

fof(c25,negated_conjecture,
    ? [U] :
      ( ssList(U)
      & ? [V] :
          ( ssList(V)
          & ? [W] :
              ( ssList(W)
              & ? [X] :
                  ( ssList(X)
                  & V = X
                  & U = W
                  & neq(V,nil)
                  & ~ neq(X,nil) ) ) ) ),
    inference(fof_nnf,[status(thm)],[c24]) ).

fof(c26,negated_conjecture,
    ? [X2] :
      ( ssList(X2)
      & ? [X3] :
          ( ssList(X3)
          & ? [X4] :
              ( ssList(X4)
              & ? [X5] :
                  ( ssList(X5)
                  & X3 = X5
                  & X2 = X4
                  & neq(X3,nil)
                  & ~ neq(X5,nil) ) ) ) ),
    inference(variable_rename,[status(thm)],[c25]) ).

fof(c27,negated_conjecture,
    ( ssList(skolem0001)
    & ssList(skolem0002)
    & ssList(skolem0003)
    & ssList(skolem0004)
    & skolem0002 = skolem0004
    & skolem0001 = skolem0003
    & neq(skolem0002,nil)
    & ~ neq(skolem0004,nil) ),
    inference(skolemize,[status(esa)],[c26]) ).

cnf(c35,negated_conjecture,
    ~ neq(skolem0004,nil),
    inference(split_conjunct,[status(thm)],[c27]) ).

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

cnf(reflexivity,axiom,
    X250 = X250,
    theory(equality) ).

cnf(c34,negated_conjecture,
    neq(skolem0002,nil),
    inference(split_conjunct,[status(thm)],[c27]) ).

cnf(c5,axiom,
    ( X278 != X276
    | X279 != X277
    | ~ neq(X278,X279)
    | neq(X276,X277) ),
    theory(equality) ).

cnf(c555,plain,
    ( skolem0002 != X745
    | nil != X744
    | neq(X745,X744) ),
    inference(resolution,[status(thm)],[c5,c34]) ).

cnf(c20020,plain,
    ( skolem0002 != X746
    | neq(X746,nil) ),
    inference(resolution,[status(thm)],[c555,reflexivity]) ).

cnf(c20024,plain,
    neq(skolem0004,nil),
    inference(resolution,[status(thm)],[c20020,c32]) ).

cnf(c20028,plain,
    $false,
    inference(resolution,[status(thm)],[c20024,c35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SWC139+1 : TPTP v8.1.2. Released v2.4.0.
% 0.04/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.35  % Computer : n006.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu May  9 02:52:23 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 5.08/5.32  % Version:  1.5
% 5.08/5.32  % SZS status Theorem
% 5.08/5.32  % SZS output start CNFRefutation
% See solution above
% 5.08/5.32  
% 5.08/5.32  % Initial clauses    : 224
% 5.08/5.32  % Processed clauses  : 806
% 5.08/5.32  % Factors computed   : 25
% 5.08/5.32  % Resolvents computed: 19499
% 5.08/5.32  % Tautologies deleted: 21
% 5.08/5.32  % Forward subsumed   : 261
% 5.08/5.32  % Backward subsumed  : 0
% 5.08/5.32  % -------- CPU Time ---------
% 5.08/5.32  % User time          : 4.912 s
% 5.08/5.32  % System time        : 0.055 s
% 5.08/5.32  % Total time         : 4.967 s
%------------------------------------------------------------------------------