↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n013.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:33 AM UTC 2026

% Result   : Theorem 16.58s 4.57s
% Output   : CNFRefutation 16.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   18 (   9 unt;   0 def)
%            Number of atoms       :   77 (  30 equ)
%            Maximal formula atoms :   18 (   4 avg)
%            Number of connectives :   95 (  36   ~;  33   |;  10   &)
%                                         (   0 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   5 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   32 (   0 sgn  16   !;   8   ?)

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

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ! [X8] :
                          ( ssItem(X8)
                         => ! [X9] :
                              ( ssItem(X9)
                             => ! [X10] :
                                  ( ssList(X10)
                                 => ! [X11] :
                                      ( ssList(X11)
                                     => ( X8 = X9
                                        | app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != X0 ) ) ) ) )
                      | ? [X4] :
                          ( ? [X5] :
                              ( ? [X6] :
                                  ( ? [X7] :
                                      ( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X2
                                      & X4 != X5
                                      & ssList(X7) )
                                  & ssList(X6) )
                              & ssItem(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)
    | ~ ssItem(X1)
    | ~ ssItem(X0)
    | ~ ssList(X3)
    | app(app(app(X2,cons(X0,nil)),cons(X1,nil)),X3) != sK255
    | X0 = X1 ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c215,plain,
    ssItem(sK261),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

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

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

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

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

cnf(c220,plain,
    sK261 != sK262,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssItem(X0)
    | ~ ssItem(X1)
    | app(app(app(X2,cons(X0,nil)),cons(X1,nil)),X3) != sK253
    | X0 = X1 ),
    inference(demodulation,[status(thm)],[c214,c213]) ).

cnf(d1,plain,
    ( ~ ssList(sK263)
    | ~ ssList(sK264)
    | ~ ssItem(sK261)
    | ~ ssItem(sK262)
    | sK261 = sK262
    | sK253 != sK253 ),
    inference(superposition,[status(thm)],[c219,d0]) ).

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

cnf(d3,plain,
    ( ~ ssList(sK263)
    | ~ ssItem(sK262)
    | sK261 = sK262
    | sK253 != sK253 ),
    inference(resolution,[status(thm)],[c215,d2]) ).

cnf(d4,plain,
    ( ~ ssList(sK263)
    | sK261 = sK262
    | sK253 != sK253 ),
    inference(resolution,[status(thm)],[c216,d3]) ).

cnf(d5,plain,
    ( sK261 = sK262
    | sK253 != sK253 ),
    inference(resolution,[status(thm)],[c217,d4]) ).

cnf(d6,plain,
    sK253 != sK253,
    inference(resolution,[status(thm)],[c220,d5]) ).

cnf(d7,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d6]) ).

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