↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SWC351+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 : n001.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:55:04 AM UTC 2026

% Result   : Theorem 16.75s 2.60s
% Output   : CNFRefutation 16.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   19 (  11 unt;   0 def)
%            Number of atoms       :   75 (  23 equ)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :   85 (  29   ~;  28   |;  15   &)
%                                         (   1 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   28 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   27 (   0 sgn  12   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax5,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( frontsegP(X0,X1)
          <=> ? [X2] :
                ( app(X1,X2) = X0
                & ssList(X2) ) ) ) ) ).

fof(co1,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ( nil = X2
                      & nil != X3 )
                    | frontsegP(X1,X0)
                    | ! [X4] :
                        ( ssList(X4)
                       => ( ? [X5] :
                              ( ? [X6] :
                                  ( ? [X7] :
                                      ( ? [X8] :
                                          ( lt(X7,X5)
                                          & app(X8,cons(X7,nil)) = X2
                                          & ssList(X8) )
                                      & ssItem(X7) )
                                  & app(cons(X5,nil),X6) = X4
                                  & ssList(X6) )
                              & ssItem(X5) )
                          | ~ strictorderedP(X2)
                          | app(X2,X4) != X3 ) )
                    | ~ neq(X1,nil)
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ) ).

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

cnf(c14,plain,
    ( ~ ssList(X2)
    | app(X2,X0) != X1
    | ~ ssList(X1)
    | frontsegP(X1,X2)
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[ax5]) ).

cnf(c209,plain,
    ssList(sK254),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c210,plain,
    ssList(sK255),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c212,plain,
    sK254 = sK256,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

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

cnf(c215,plain,
    ssList(sK257),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c216,plain,
    app(sK255,sK257) = sK256,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c219,plain,
    ~ frontsegP(sK254,sK253),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    app(sK255,sK257) = sK254,
    inference(demodulation,[status(thm)],[c216,c212]) ).

cnf(d1,plain,
    ( frontsegP(X0,sK255)
    | ~ ssList(X0)
    | ~ ssList(sK257)
    | ~ ssList(sK255)
    | sK254 != X0 ),
    inference(superposition,[status(thm)],[d0,c14]) ).

cnf(d2,plain,
    ( frontsegP(X0,sK255)
    | ~ ssList(sK257)
    | ~ ssList(X0)
    | sK254 != X0 ),
    inference(resolution,[status(thm)],[c210,d1]) ).

cnf(d3,plain,
    ( frontsegP(X0,sK255)
    | ~ ssList(X0)
    | sK254 != X0 ),
    inference(resolution,[status(thm)],[c215,d2]) ).

cnf(d4,plain,
    ( frontsegP(sK254,sK255)
    | ~ ssList(sK254) ),
    inference(equality_resolution,[status(thm)],[d3]) ).

cnf(d5,plain,
    frontsegP(sK254,sK255),
    inference(resolution,[status(thm)],[c209,d4]) ).

cnf(d6,plain,
    ~ frontsegP(sK254,sK255),
    inference(demodulation,[status(thm)],[c219,c213]) ).

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

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