↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : NUM464+2 : 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 : n013.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:12:49 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(mSortsC,axiom,
    aNaturalNumber0(sz00) ).

fof(mSortsC_01,axiom,
    ( sz10 != sz00
    & aNaturalNumber0(sz10) ) ).

fof(m_AddZero,axiom,
    ! [X0] :
      ( aNaturalNumber0(X0)
     => ( X0 = sdtpldt0(sz00,X0)
        & sdtpldt0(X0,sz00) = X0 ) ) ).

fof(mLENTr,axiom,
    ! [X0] :
      ( aNaturalNumber0(X0)
     => ( ( sdtlseqdt0(sz10,X0)
          & sz10 != X0 )
        | X0 = sz10
        | X0 = sz00 ) ) ).

fof(m__987,hypothesis,
    ( aNaturalNumber0(xn)
    & aNaturalNumber0(xm) ) ).

fof(m__,conjecture,
    ( xm != sz00
   => ( sdtlseqdt0(sz10,xm)
      | ? [X0] :
          ( sdtpldt0(sz10,X0) = xm
          & aNaturalNumber0(X0) ) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ( xm != sz00
     => ( sdtlseqdt0(sz10,xm)
        | ? [X0] :
            ( sdtpldt0(sz10,X0) = xm
            & aNaturalNumber0(X0) ) ) ),
    inference(negate_conjecture,[status(cth)],[m__]) ).

cnf(c0,plain,
    aNaturalNumber0(sz00),
    inference(clausification,[status(esa)],[mSortsC]) ).

cnf(c1,plain,
    aNaturalNumber0(sz10),
    inference(clausification,[status(esa)],[mSortsC_01]) ).

cnf(c7,plain,
    ( sdtpldt0(X0,sz00) = X0
    | ~ aNaturalNumber0(X0) ),
    inference(clausification,[status(esa)],[m_AddZero]) ).

cnf(c44,plain,
    ( sdtlseqdt0(sz10,X0)
    | X0 = sz10
    | X0 = sz00
    | ~ aNaturalNumber0(X0) ),
    inference(clausification,[status(esa)],[mLENTr]) ).

cnf(c45,plain,
    aNaturalNumber0(xm),
    inference(clausification,[status(esa)],[m__987]) ).

cnf(c47,plain,
    xm != sz00,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c48,plain,
    ( sdtpldt0(sz10,X0) != xm
    | ~ aNaturalNumber0(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c49,plain,
    ~ sdtlseqdt0(sz10,xm),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ aNaturalNumber0(xm)
    | xm = sz10
    | xm = sz00 ),
    inference(resolution,[status(thm)],[c44,c49]) ).

cnf(d1,plain,
    ( ~ aNaturalNumber0(xm)
    | xm = sz10 ),
    inference(resolution,[status(thm)],[c47,d0]) ).

cnf(d2,plain,
    xm = sz10,
    inference(resolution,[status(thm)],[c45,d1]) ).

cnf(d3,plain,
    sdtpldt0(sz10,sz00) = sz10,
    inference(resolution,[status(thm)],[c7,c1]) ).

cnf(d4,plain,
    ( ~ aNaturalNumber0(sz00)
    | sz10 != xm ),
    inference(superposition,[status(thm)],[d3,c48]) ).

cnf(d5,plain,
    sz10 != xm,
    inference(resolution,[status(thm)],[c0,d4]) ).

cnf(d6,plain,
    sz10 != sz10,
    inference(demodulation,[status(thm)],[d5,d2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM464+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.57  % Computer : n013.cluster.edu
% 0.09/0.57  % Model    : x86_64 x86_64
% 0.09/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.57  % Memory   : 8046.5625MB
% 0.09/0.57  % OS       : Linux 6.8.0-71-generic
% 0.09/0.57  % CPULimit : 300
% 0.09/0.57  % WCLimit  : 300
% 0.09/0.57  % DateTime : Sat Sep 26 02:50:44 UTC 2026
% 0.09/0.58  % CPUTime  : 
% 0.09/0.58  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.15/2.61  % SZS status Theorem for theBenchmark.p
% 9.15/2.61  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------