↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n018.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:11 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__3435,hypothesis,
    ( isCountable0(xS)
    & aSubsetOf0(xS,szNzAzT0) ) ).

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__3702_02,hypothesis,
    ( xi != sz00
   => ( isCountable0(sdtlpdtrp0(xN,xi))
      & aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
      & ? [X0] :
          ( szszuzczcdt0(X0) = xi
          & aElementOf0(X0,szNzAzT0) ) ) ) ).

fof(m__,conjecture,
    ( isCountable0(sdtlpdtrp0(xN,xi))
    & aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ) ).

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

cnf(c175,plain,
    aSubsetOf0(xS,szNzAzT0),
    inference(clausification,[status(esa)],[m__3435]) ).

cnf(c176,plain,
    isCountable0(xS),
    inference(clausification,[status(esa)],[m__3435]) ).

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

cnf(c198,plain,
    ( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
    | xi = sz00 ),
    inference(clausification,[status(esa)],[m__3702_02]) ).

cnf(c199,plain,
    ( isCountable0(sdtlpdtrp0(xN,xi))
    | xi = sz00 ),
    inference(clausification,[status(esa)],[m__3702_02]) ).

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

cnf(d0,plain,
    ( ~ isCountable0(sdtlpdtrp0(xN,xi))
    | xi = sz00 ),
    inference(resolution,[status(thm)],[c198,c200]) ).

cnf(d1,plain,
    ( xi = sz00
    | xi = sz00 ),
    inference(resolution,[status(thm)],[d0,c199]) ).

cnf(d2,plain,
    ( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
    | ~ isCountable0(sdtlpdtrp0(xN,sz00)) ),
    inference(demodulation,[status(thm)],[c200,d1]) ).

cnf(d3,plain,
    ( ~ aSubsetOf0(sdtlpdtrp0(xN,sz00),szNzAzT0)
    | ~ isCountable0(sdtlpdtrp0(xN,sz00)) ),
    inference(demodulation,[status(thm)],[d2,d1]) ).

cnf(d4,plain,
    ( ~ aSubsetOf0(sdtlpdtrp0(xN,sz00),szNzAzT0)
    | ~ isCountable0(xS) ),
    inference(demodulation,[status(thm)],[d3,c190]) ).

cnf(d5,plain,
    ( ~ aSubsetOf0(xS,szNzAzT0)
    | ~ isCountable0(xS) ),
    inference(demodulation,[status(thm)],[d4,c190]) ).

cnf(d6,plain,
    ~ aSubsetOf0(xS,szNzAzT0),
    inference(resolution,[status(thm)],[c176,d5]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM571+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n018.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 03:18:52 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.59/2.56  % SZS status Theorem for theBenchmark.p
% 10.59/2.56  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------