↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SWC112+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 : n019.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:18 AM UTC 2026

% Result   : Theorem 31.72s 19.50s
% Output   : CNFRefutation 31.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   50 (  17 unt;   0 def)
%            Number of atoms       :  171 (  70 equ)
%            Maximal formula atoms :   31 (   3 avg)
%            Number of connectives :  187 (  66   ~;  69   |;  32   &)
%                                         (   3 <=>;  17  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   30 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   46 (   0 sgn  17   !;  18   ?)

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

fof(ax15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ) ).

fof(ax17,axiom,
    ssList(nil) ).

fof(ax58,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( segmentP(nil,X0)
      <=> nil = X0 ) ) ).

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

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

cnf(c21,plain,
    ( ~ ssList(X2)
    | ~ ssList(X0)
    | ~ ssList(X3)
    | app(app(X2,X1),X3) != X0
    | ~ ssList(X1)
    | segmentP(X0,X1) ),
    inference(clausification,[status(esa)],[ax7]) ).

cnf(c95,plain,
    ( X0 = X1
    | neq(X0,X1)
    | ~ ssList(X1)
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[ax15]) ).

cnf(c97,plain,
    ssList(nil),
    inference(clausification,[status(esa)],[ax17]) ).

cnf(c151,plain,
    ( nil = X0
    | ~ segmentP(nil,X0)
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[ax58]) ).

cnf(c208,plain,
    ssList(sK253),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c209,plain,
    ssList(sK254),
    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(c214,plain,
    ssList(sK257),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

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

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

cnf(c220,plain,
    ( nil != sK255
    | nil = sK256 ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c222,plain,
    ( ~ segmentP(sK254,sK253)
    | ~ neq(sK253,nil)
    | nil = sK254 ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c223,plain,
    ( neq(sK254,nil)
    | nil != sK253 ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c224,plain,
    ( ~ segmentP(sK254,sK253)
    | ~ neq(sK253,nil)
    | nil != sK253 ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    app(app(sK257,sK253),sK258) = sK256,
    inference(demodulation,[status(thm)],[c216,c213]) ).

cnf(d1,plain,
    app(app(sK257,sK253),sK258) = sK254,
    inference(demodulation,[status(thm)],[d0,c212]) ).

cnf(d2,plain,
    ( segmentP(X0,sK253)
    | ~ ssList(sK257)
    | ~ ssList(sK253)
    | ~ ssList(sK258)
    | ~ ssList(X0)
    | sK254 != X0 ),
    inference(superposition,[status(thm)],[d1,c21]) ).

cnf(d3,plain,
    ( segmentP(X0,sK253)
    | ~ ssList(sK258)
    | ~ ssList(sK257)
    | ~ ssList(X0)
    | sK254 != X0 ),
    inference(resolution,[status(thm)],[c208,d2]) ).

cnf(d4,plain,
    ( segmentP(X0,sK253)
    | ~ ssList(sK257)
    | ~ ssList(X0)
    | sK254 != X0 ),
    inference(resolution,[status(thm)],[c215,d3]) ).

cnf(d5,plain,
    ( segmentP(X0,sK253)
    | ~ ssList(X0)
    | sK254 != X0 ),
    inference(resolution,[status(thm)],[c214,d4]) ).

cnf(d6,plain,
    ( segmentP(sK254,sK253)
    | ~ ssList(sK254) ),
    inference(equality_resolution,[status(thm)],[d5]) ).

cnf(d7,plain,
    segmentP(sK254,sK253),
    inference(resolution,[status(thm)],[c209,d6]) ).

cnf(d8,plain,
    ( ~ neq(sK253,nil)
    | nil = sK254 ),
    inference(resolution,[status(thm)],[d7,c222]) ).

cnf(d9,plain,
    ( nil = sK254
    | ~ ssList(sK253)
    | ~ ssList(nil)
    | sK253 = nil ),
    inference(resolution,[status(thm)],[c95,d8]) ).

cnf(d10,plain,
    ( ~ ssList(nil)
    | sK253 = nil
    | nil = sK254 ),
    inference(resolution,[status(thm)],[c208,d9]) ).

cnf(d11,plain,
    ( sK253 = nil
    | nil = sK254 ),
    inference(resolution,[status(thm)],[c97,d10]) ).

cnf(d12,plain,
    ( sK253 = nil
    | segmentP(nil,sK253) ),
    inference(superposition,[status(thm)],[d11,d7]) ).

cnf(d13,plain,
    ( sK253 = nil
    | ~ ssList(sK253)
    | nil = sK253 ),
    inference(resolution,[status(thm)],[c151,d12]) ).

cnf(d14,plain,
    ( sK253 = nil
    | nil = sK253 ),
    inference(resolution,[status(thm)],[c208,d13]) ).

cnf(d15,plain,
    ( sK253 = nil
    | nil != nil ),
    inference(equality_factoring,[status(thm)],[d14]) ).

cnf(d16,plain,
    sK253 = nil,
    inference(equality_resolution,[status(thm)],[d15]) ).

cnf(d17,plain,
    ( nil = sK256
    | nil != sK253 ),
    inference(demodulation,[status(thm)],[c220,c213]) ).

cnf(d18,plain,
    ( nil = sK254
    | nil != sK253 ),
    inference(demodulation,[status(thm)],[d17,c212]) ).

cnf(d19,plain,
    ( nil = sK254
    | nil != nil ),
    inference(demodulation,[status(thm)],[d18,d16]) ).

cnf(d20,plain,
    nil = sK254,
    inference(equality_resolution,[status(thm)],[d19]) ).

cnf(d21,plain,
    ( neq(sK254,nil)
    | nil != nil ),
    inference(demodulation,[status(thm)],[c223,d16]) ).

cnf(d22,plain,
    ( neq(nil,nil)
    | nil != nil ),
    inference(demodulation,[status(thm)],[d21,d20]) ).

cnf(d23,plain,
    ( ~ neq(sK253,nil)
    | nil != sK253 ),
    inference(resolution,[status(thm)],[d7,c224]) ).

cnf(d24,plain,
    ( ~ neq(sK253,nil)
    | nil != nil ),
    inference(demodulation,[status(thm)],[d23,d16]) ).

cnf(d25,plain,
    ( ~ neq(nil,nil)
    | nil != nil ),
    inference(demodulation,[status(thm)],[d24,d16]) ).

cnf(d26,plain,
    ~ neq(nil,nil),
    inference(equality_resolution,[status(thm)],[d25]) ).

cnf(d27,plain,
    nil != nil,
    inference(resolution,[status(thm)],[d26,d22]) ).

cnf(d28,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d27]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC112+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.11/15.40  % Computer : n019.cluster.edu
% 0.11/15.40  % Model    : x86_64 x86_64
% 0.11/15.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/15.40  % Memory   : 8046.5625MB
% 0.11/15.40  % OS       : Linux 6.8.0-71-generic
% 0.11/15.40  % CPULimit : 300
% 0.11/15.40  % WCLimit  : 300
% 0.11/15.40  % DateTime : Sat Sep 26 12:17:06 UTC 2026
% 0.11/15.40  % CPUTime  : 
% 0.11/15.40  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 31.72/19.50  % SZS status Theorem for theBenchmark.p
% 31.72/19.50  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------