↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SWC185+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 08:54:32 AM UTC 2026

% Result   : Theorem 16.13s 4.48s
% Output   : CNFRefutation 16.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   23 (  10 unt;   0 def)
%            Number of atoms       :   86 (  22 equ)
%            Maximal formula atoms :   18 (   3 avg)
%            Number of connectives :  114 (  51   ~;  39   |;  10   &)
%                                         (   0 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   26 (   0 sgn  14   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ! [X7] :
                        ( ssItem(X7)
                       => ! [X8] :
                            ( ssList(X8)
                           => ! [X9] :
                                ( ssList(X9)
                               => ( ( ~ memberP(X9,X7)
                                    & ~ memberP(X8,X7) )
                                  | app(app(X8,cons(X7,nil)),X9) != X0 ) ) ) )
                    | ? [X4] :
                        ( ? [X5] :
                            ( ? [X6] :
                                ( ( memberP(X6,X4)
                                  | memberP(X5,X4) )
                                & app(app(X5,cons(X4,nil)),X6) = X2
                                & ssList(X6) )
                            & ssList(X5) )
                        & ssItem(X4) )
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ! [X7] :
                          ( ssItem(X7)
                         => ! [X8] :
                              ( ssList(X8)
                             => ! [X9] :
                                  ( ssList(X9)
                                 => ( ( ~ memberP(X9,X7)
                                      & ~ memberP(X8,X7) )
                                    | app(app(X8,cons(X7,nil)),X9) != X0 ) ) ) )
                      | ? [X4] :
                          ( ? [X5] :
                              ( ? [X6] :
                                  ( ( memberP(X6,X4)
                                    | memberP(X5,X4) )
                                  & app(app(X5,cons(X4,nil)),X6) = X2
                                  & ssList(X6) )
                              & ssList(X5) )
                          & ssItem(X4) )
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negate_conjecture,[status(cth)],[co1]) ).

cnf(c213,plain,
    sK253 = sK255,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c214,plain,
    ( ~ ssList(X2)
    | ~ memberP(X0,X1)
    | ~ ssItem(X1)
    | app(app(X0,cons(X1,nil)),X2) != sK255
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c215,plain,
    ( ~ ssList(X1)
    | ~ ssItem(X2)
    | app(app(X0,cons(X2,nil)),X1) != sK255
    | ~ memberP(X1,X2)
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c216,plain,
    ssItem(sK260),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c217,plain,
    ssList(sK261),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c218,plain,
    ssList(sK262),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c219,plain,
    app(app(sK261,cons(sK260,nil)),sK262) = sK253,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c220,plain,
    ( memberP(sK262,sK260)
    | memberP(sK261,sK260) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    app(app(sK261,cons(sK260,nil)),sK262) = sK255,
    inference(demodulation,[status(thm)],[c219,c213]) ).

cnf(d1,plain,
    ( ~ ssList(sK262)
    | ~ ssList(sK261)
    | ~ memberP(sK262,sK260)
    | ~ ssItem(sK260)
    | sK255 != sK255 ),
    inference(superposition,[status(thm)],[d0,c215]) ).

cnf(d2,plain,
    ( ~ ssList(sK261)
    | ~ memberP(sK262,sK260)
    | ~ ssItem(sK260)
    | sK255 != sK255 ),
    inference(resolution,[status(thm)],[c218,d1]) ).

cnf(d3,plain,
    ( ~ ssList(sK261)
    | ~ memberP(sK262,sK260)
    | sK255 != sK255 ),
    inference(resolution,[status(thm)],[c216,d2]) ).

cnf(d4,plain,
    ( ~ memberP(sK262,sK260)
    | sK255 != sK255 ),
    inference(resolution,[status(thm)],[c217,d3]) ).

cnf(d5,plain,
    ( ~ ssList(sK262)
    | ~ ssList(sK261)
    | ~ memberP(sK261,sK260)
    | ~ ssItem(sK260)
    | sK255 != sK255 ),
    inference(superposition,[status(thm)],[d0,c214]) ).

cnf(d6,plain,
    ( ~ ssList(sK261)
    | ~ memberP(sK261,sK260)
    | ~ ssItem(sK260)
    | sK255 != sK255 ),
    inference(resolution,[status(thm)],[c218,d5]) ).

cnf(d7,plain,
    ( ~ ssList(sK261)
    | ~ memberP(sK261,sK260)
    | sK255 != sK255 ),
    inference(resolution,[status(thm)],[c216,d6]) ).

cnf(d8,plain,
    ( ~ memberP(sK261,sK260)
    | sK255 != sK255 ),
    inference(resolution,[status(thm)],[c217,d7]) ).

cnf(d9,plain,
    ~ memberP(sK261,sK260),
    inference(equality_resolution,[status(thm)],[d8]) ).

cnf(d10,plain,
    memberP(sK262,sK260),
    inference(resolution,[status(thm)],[d9,c220]) ).

cnf(d11,plain,
    sK255 != sK255,
    inference(resolution,[status(thm)],[d10,d4]) ).

cnf(d12,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWC185+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.65  % Computer : n014.cluster.edu
% 0.18/0.65  % Model    : x86_64 x86_64
% 0.18/0.65  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.65  % Memory   : 8046.5625MB
% 0.18/0.65  % OS       : Linux 6.8.0-71-generic
% 0.18/0.65  % CPULimit : 300
% 0.18/0.65  % WCLimit  : 300
% 0.18/0.65  % DateTime : Sat Sep 26 12:27:18 UTC 2026
% 0.21/0.65  % CPUTime  : 
% 0.21/0.65  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.13/4.48  % SZS status Theorem for theBenchmark.p
% 16.13/4.48  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------