TSTP Solution File: SWC044+1 by PyRes---1.5

View Problem - Process Solution

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

% Computer : n016.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:08 EDT 2024

% Result   : Theorem 7.07s 7.30s
% Output   : Refutation 7.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   33 (  14 unt;   0 def)
%            Number of atoms       :  110 (  57 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :  119 (  42   ~;  36   |;  27   &)
%                                         (   1 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   5 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   :   40 (   0 sgn  16   !;   8   ?)

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

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

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

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

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

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

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

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

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

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

cnf(c542,plain,
    ( X410 != skolem0003
    | X410 = skolem0001 ),
    inference(resolution,[status(thm)],[c518,transitivity]) ).

cnf(c30,negated_conjecture,
    ssList(skolem0003),
    inference(split_conjunct,[status(thm)],[c27]) ).

fof(ax52,axiom,
    ! [U] :
      ( ssList(U)
     => ( rearsegP(nil,U)
      <=> nil = U ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax52) ).

fof(c198,plain,
    ! [U] :
      ( ~ ssList(U)
      | ( ( ~ rearsegP(nil,U)
          | nil = U )
        & ( nil != U
          | rearsegP(nil,U) ) ) ),
    inference(fof_nnf,[status(thm)],[ax52]) ).

fof(c199,plain,
    ! [X73] :
      ( ~ ssList(X73)
      | ( ( ~ rearsegP(nil,X73)
          | nil = X73 )
        & ( nil != X73
          | rearsegP(nil,X73) ) ) ),
    inference(variable_rename,[status(thm)],[c198]) ).

fof(c200,plain,
    ! [X73] :
      ( ( ~ ssList(X73)
        | ~ rearsegP(nil,X73)
        | nil = X73 )
      & ( ~ ssList(X73)
        | nil != X73
        | rearsegP(nil,X73) ) ),
    inference(distribute,[status(thm)],[c199]) ).

cnf(c201,plain,
    ( ~ ssList(X452)
    | ~ rearsegP(nil,X452)
    | nil = X452 ),
    inference(split_conjunct,[status(thm)],[c200]) ).

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

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

cnf(c516,plain,
    ( X386 != skolem0002
    | X386 = skolem0004 ),
    inference(resolution,[status(thm)],[c33,transitivity]) ).

cnf(c751,plain,
    nil = skolem0004,
    inference(resolution,[status(thm)],[c516,c32]) ).

cnf(c764,plain,
    skolem0004 = nil,
    inference(resolution,[status(thm)],[c751,symmetry]) ).

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

cnf(c35,negated_conjecture,
    rearsegP(skolem0004,skolem0003),
    inference(split_conjunct,[status(thm)],[c27]) ).

cnf(c10,axiom,
    ( X298 != X301
    | X299 != X300
    | ~ rearsegP(X298,X299)
    | rearsegP(X301,X300) ),
    theory(equality) ).

cnf(c610,plain,
    ( skolem0004 != X787
    | skolem0003 != X786
    | rearsegP(X787,X786) ),
    inference(resolution,[status(thm)],[c10,c35]) ).

cnf(c15199,plain,
    ( skolem0004 != X863
    | rearsegP(X863,skolem0003) ),
    inference(resolution,[status(thm)],[c610,reflexivity]) ).

cnf(c15685,plain,
    rearsegP(nil,skolem0003),
    inference(resolution,[status(thm)],[c15199,c764]) ).

cnf(c15693,plain,
    ( ~ ssList(skolem0003)
    | nil = skolem0003 ),
    inference(resolution,[status(thm)],[c15685,c201]) ).

cnf(c19578,plain,
    nil = skolem0003,
    inference(resolution,[status(thm)],[c15693,c30]) ).

cnf(c19586,plain,
    nil = skolem0001,
    inference(resolution,[status(thm)],[c19578,c542]) ).

cnf(c19766,plain,
    $false,
    inference(resolution,[status(thm)],[c19586,c36]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem  : SWC044+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.35  % Computer : n016.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:34:23 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 7.07/7.30  % Version:  1.5
% 7.07/7.30  % SZS status Theorem
% 7.07/7.30  % SZS output start CNFRefutation
% See solution above
% 7.07/7.30  
% 7.07/7.30  % Initial clauses    : 225
% 7.07/7.30  % Processed clauses  : 1036
% 7.07/7.30  % Factors computed   : 51
% 7.07/7.30  % Resolvents computed: 19255
% 7.07/7.30  % Tautologies deleted: 23
% 7.07/7.30  % Forward subsumed   : 605
% 7.07/7.30  % Backward subsumed  : 24
% 7.07/7.30  % -------- CPU Time ---------
% 7.07/7.30  % User time          : 6.892 s
% 7.07/7.30  % System time        : 0.057 s
% 7.07/7.30  % Total time         : 6.949 s
%------------------------------------------------------------------------------