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

View Problem - Process Solution

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

% Computer : n023.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 0.90s 1.09s
% Output   : Refutation 0.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   9 unt;   0 def)
%            Number of atoms       :  113 (  67 equ)
%            Maximal formula atoms :   18 (   5 avg)
%            Number of connectives :  128 (  35   ~;  29   |;  52   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   7 avg)
%            Maximal term depth    :    3 (   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   :   31 (   0 sgn  12   !;  12   ?)

% 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 )
                    | ( ! [Y] :
                          ( ssItem(Y)
                         => ! [Z] :
                              ( ssList(Z)
                             => ( app(cons(Y,nil),Z) != W
                                | app(Z,cons(Y,nil)) != X ) ) )
                      & neq(X,nil) ) ) ) ) ) ),
    file('/export/starexec/sandbox/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
                      | nil = U
                      | ( nil != W
                        & nil = X )
                      | ( ! [Y] :
                            ( ssItem(Y)
                           => ! [Z] :
                                ( ssList(Z)
                               => ( app(cons(Y,nil),Z) != W
                                  | app(Z,cons(Y,nil)) != X ) ) )
                        & 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)
                  & nil = V
                  & V = X
                  & U = W
                  & nil != U
                  & ( nil = W
                    | nil != X )
                  & ( ? [Y] :
                        ( ssItem(Y)
                        & ? [Z] :
                            ( ssList(Z)
                            & app(cons(Y,nil),Z) = W
                            & app(Z,cons(Y,nil)) = X ) )
                    | ~ neq(X,nil) ) ) ) ) ),
    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 )
                  & ( ? [X6] :
                        ( ssItem(X6)
                        & ? [X7] :
                            ( ssList(X7)
                            & app(cons(X6,nil),X7) = X4
                            & app(X7,cons(X6,nil)) = X5 ) )
                    | ~ neq(X5,nil) ) ) ) ) ),
    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 )
    & ( ( ssItem(skolem0005)
        & ssList(skolem0006)
        & app(cons(skolem0005,nil),skolem0006) = skolem0003
        & app(skolem0006,cons(skolem0005,nil)) = skolem0004 )
      | ~ neq(skolem0004,nil) ) ),
    inference(skolemize,[status(esa)],[c25]) ).

fof(c27,negated_conjecture,
    ( ssList(skolem0001)
    & ssList(skolem0002)
    & ssList(skolem0003)
    & ssList(skolem0004)
    & nil = skolem0002
    & skolem0002 = skolem0004
    & skolem0001 = skolem0003
    & nil != skolem0001
    & ( nil = skolem0003
      | nil != skolem0004 )
    & ( ssItem(skolem0005)
      | ~ neq(skolem0004,nil) )
    & ( ssList(skolem0006)
      | ~ neq(skolem0004,nil) )
    & ( app(cons(skolem0005,nil),skolem0006) = skolem0003
      | ~ neq(skolem0004,nil) )
    & ( app(skolem0006,cons(skolem0005,nil)) = skolem0004
      | ~ neq(skolem0004,nil) ) ),
    inference(distribute,[status(thm)],[c26]) ).

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

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

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

cnf(transitivity,axiom,
    ( X257 != X255
    | X255 != X256
    | X257 = X256 ),
    theory(equality) ).

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

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

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

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

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

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

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

cnf(c537,plain,
    ( X428 != skolem0003
    | X428 = skolem0001 ),
    inference(resolution,[status(thm)],[c523,transitivity]) ).

cnf(c974,plain,
    nil = skolem0001,
    inference(resolution,[status(thm)],[c537,c739]) ).

cnf(c1019,plain,
    $false,
    inference(resolution,[status(thm)],[c974,c35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SWC040+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34  % Computer : n023.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Thu May  9 02:25:38 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.90/1.09  % Version:  1.5
% 0.90/1.09  % SZS status Theorem
% 0.90/1.09  % SZS output start CNFRefutation
% See solution above
% 0.90/1.09  
% 0.90/1.09  % Initial clauses    : 229
% 0.90/1.09  % Processed clauses  : 251
% 0.90/1.09  % Factors computed   : 12
% 0.90/1.09  % Resolvents computed: 513
% 0.90/1.09  % Tautologies deleted: 14
% 0.90/1.09  % Forward subsumed   : 111
% 0.90/1.09  % Backward subsumed  : 36
% 0.90/1.09  % -------- CPU Time ---------
% 0.90/1.09  % User time          : 0.728 s
% 0.90/1.09  % System time        : 0.017 s
% 0.90/1.09  % Total time         : 0.745 s
%------------------------------------------------------------------------------