↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n002.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:13:13 AM UTC 2026

% Result   : Theorem 18.59s 3.85s
% Output   : CNFRefutation 18.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   19 (  11 unt;   0 def)
%            Number of atoms       :   40 (   3 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   35 (  14   ~;  10   |;   6   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-2 aty)
%            Number of variables   :    9 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mZeroNum,axiom,
    aElementOf0(sz00,szNzAzT0) ).

fof(mZeroLess,axiom,
    ! [X0] :
      ( aElementOf0(X0,szNzAzT0)
     => sdtlseqdt0(sz00,X0) ) ).

fof(m__3623,hypothesis,
    ( ! [X0] :
        ( aElementOf0(X0,szNzAzT0)
       => ( ( isCountable0(sdtlpdtrp0(xN,X0))
            & aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) )
         => ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0)))
            & aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) ) ) )
    & sdtlpdtrp0(xN,sz00) = xS
    & szDzozmdt0(xN) = szNzAzT0
    & aFunction0(xN) ) ).

fof(m__3754,hypothesis,
    ! [X0,X1] :
      ( ( aElementOf0(X1,szNzAzT0)
        & aElementOf0(X0,szNzAzT0) )
     => ( sdtlseqdt0(X1,X0)
       => aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1)) ) ) ).

fof(m__3989,hypothesis,
    aElementOf0(xi,szNzAzT0) ).

fof(m__,conjecture,
    aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ).

fof(negated_conjecture,negated_conjecture,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    inference(negate_conjecture,[status(cth)],[m__]) ).

cnf(c54,plain,
    aElementOf0(sz00,szNzAzT0),
    inference(clausification,[status(esa)],[mZeroNum]) ).

cnf(c61,plain,
    ( sdtlseqdt0(sz00,X0)
    | ~ aElementOf0(X0,szNzAzT0) ),
    inference(clausification,[status(esa)],[mZeroLess]) ).

cnf(c190,plain,
    sdtlpdtrp0(xN,sz00) = xS,
    inference(clausification,[status(esa)],[m__3623]) ).

cnf(c195,plain,
    ( aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1))
    | ~ sdtlseqdt0(X1,X0)
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ aElementOf0(X0,szNzAzT0) ),
    inference(clausification,[status(esa)],[m__3754]) ).

cnf(c197,plain,
    aElementOf0(xi,szNzAzT0),
    inference(clausification,[status(esa)],[m__3989]) ).

cnf(c200,plain,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ sdtlseqdt0(sz00,X0)
    | ~ aElementOf0(X0,szNzAzT0)
    | ~ aElementOf0(sz00,szNzAzT0)
    | aSubsetOf0(sdtlpdtrp0(xN,X0),xS) ),
    inference(superposition,[status(thm)],[c190,c195]) ).

cnf(d1,plain,
    ( ~ sdtlseqdt0(sz00,X0)
    | aSubsetOf0(sdtlpdtrp0(xN,X0),xS)
    | ~ aElementOf0(X0,szNzAzT0) ),
    inference(resolution,[status(thm)],[c54,d0]) ).

cnf(d2,plain,
    ( ~ sdtlseqdt0(sz00,xi)
    | ~ aElementOf0(xi,szNzAzT0) ),
    inference(resolution,[status(thm)],[d1,c200]) ).

cnf(d3,plain,
    ~ sdtlseqdt0(sz00,xi),
    inference(resolution,[status(thm)],[c197,d2]) ).

cnf(d4,plain,
    sdtlseqdt0(sz00,xi),
    inference(resolution,[status(thm)],[c61,c197]) ).

cnf(d5,plain,
    $false,
    inference(resolution,[status(thm)],[d4,d3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM582+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.36  % Computer : n002.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sat Sep 26 03:22:05 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.59/3.85  % SZS status Theorem for theBenchmark.p
% 18.59/3.85  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------