↑ Up

LisaST---0.9.THM-CRf.s

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

% Result   : Theorem 24.06s 3.69s
% Output   : CNFRefutation 24.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   32 (  12 unt;   0 def)
%            Number of atoms       :  100 (  29 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  125 (  57   ~;  51   |;   8   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   19 (   0 sgn   9   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax17,axiom,
    ssList(nil) ).

fof(ax49,axiom,
    ! [X0] :
      ( ssList(X0)
     => rearsegP(X0,X0) ) ).

fof(co1,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ( ( ? [X4] :
                            ( rearsegP(X0,X4)
                            & rearsegP(X1,X4)
                            & neq(X4,nil)
                            & ssList(X4) )
                        | ~ neq(X1,nil) )
                      & ( nil = X0
                        | nil != X1 ) )
                    | X3 != X2
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ( ( ? [X4] :
                              ( rearsegP(X0,X4)
                              & rearsegP(X1,X4)
                              & neq(X4,nil)
                              & ssList(X4) )
                          | ~ neq(X1,nil) )
                        & ( nil = X0
                          | nil != X1 ) )
                      | X3 != X2
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negate_conjecture,[status(cth)],[co1]) ).

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

cnf(c141,plain,
    ( rearsegP(X0,X0)
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[ax49]) ).

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,
    sK256 = sK255,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

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

cnf(c216,plain,
    ( ~ neq(X0,nil)
    | ~ rearsegP(sK253,X0)
    | nil = sK254
    | ~ rearsegP(sK254,X0)
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

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

cnf(c218,plain,
    ( nil != sK253
    | ~ neq(X0,nil)
    | ~ rearsegP(sK253,X0)
    | ~ rearsegP(sK254,X0)
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

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

cnf(d1,plain,
    sK253 = sK254,
    inference(demodulation,[status(thm)],[c213,d0]) ).

cnf(d2,plain,
    ( ~ rearsegP(sK254,X0)
    | ~ rearsegP(sK254,X0)
    | ~ ssList(X0)
    | ~ neq(X0,nil)
    | nil = sK254 ),
    inference(demodulation,[status(thm)],[c216,d1]) ).

cnf(d3,plain,
    ( ~ rearsegP(sK254,sK254)
    | ~ ssList(sK254)
    | ~ neq(sK254,nil)
    | nil = sK254
    | ~ ssList(sK254) ),
    inference(resolution,[status(thm)],[c141,d2]) ).

cnf(d4,plain,
    ( ~ rearsegP(sK254,sK254)
    | ~ neq(sK254,nil)
    | nil = sK254 ),
    inference(resolution,[status(thm)],[c209,d3]) ).

cnf(d5,plain,
    ( ~ ssList(sK254)
    | ~ neq(sK254,nil)
    | nil = sK254 ),
    inference(resolution,[status(thm)],[d4,c141]) ).

cnf(d6,plain,
    ( ~ neq(sK254,nil)
    | nil = sK254 ),
    inference(resolution,[status(thm)],[c209,d5]) ).

cnf(d7,plain,
    ( nil = sK254
    | nil = sK254 ),
    inference(resolution,[status(thm)],[d6,c215]) ).

cnf(d8,plain,
    ( ~ rearsegP(sK254,X0)
    | ~ rearsegP(sK253,X0)
    | ~ ssList(X0)
    | ~ neq(X0,nil)
    | nil != sK254 ),
    inference(demodulation,[status(thm)],[c218,d1]) ).

cnf(d9,plain,
    ( ~ rearsegP(sK254,X0)
    | ~ rearsegP(sK254,X0)
    | ~ ssList(X0)
    | ~ neq(X0,nil)
    | nil != sK254 ),
    inference(demodulation,[status(thm)],[d8,d1]) ).

cnf(d10,plain,
    ( ~ rearsegP(sK254,X0)
    | ~ rearsegP(sK254,X0)
    | ~ ssList(X0)
    | ~ neq(X0,nil) ),
    inference(resolution,[status(thm)],[d7,d9]) ).

cnf(d11,plain,
    ( ~ rearsegP(nil,X0)
    | ~ ssList(X0)
    | ~ neq(X0,nil) ),
    inference(demodulation,[status(thm)],[d10,d7]) ).

cnf(d12,plain,
    ( ~ ssList(nil)
    | ~ ssList(nil)
    | ~ neq(nil,nil) ),
    inference(resolution,[status(thm)],[d11,c141]) ).

cnf(d13,plain,
    ~ neq(nil,nil),
    inference(resolution,[status(thm)],[c97,d12]) ).

cnf(d14,plain,
    ( neq(sK254,nil)
    | nil != sK254 ),
    inference(demodulation,[status(thm)],[c217,d1]) ).

cnf(d15,plain,
    neq(sK254,nil),
    inference(resolution,[status(thm)],[d7,d14]) ).

cnf(d16,plain,
    neq(nil,nil),
    inference(demodulation,[status(thm)],[d15,d7]) ).

cnf(d17,plain,
    $false,
    inference(resolution,[status(thm)],[d16,d13]) ).

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