↑ Up

LisaST---0.9.THM-CRf.s

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

% Result   : Theorem 46.40s 19.99s
% Output   : CNFRefutation 46.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   48 (  16 unt;   2 def)
%            Number of atoms       :  134 (  30 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  154 (  68   ~;  67   |;  11   &)
%                                         (   2 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   37 (   0 sgn   9   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mSortsC_01,axiom,
    ( sz10 != sz00
    & aNaturalNumber0(sz10) ) ).

fof(m_MulUnit,axiom,
    ! [X0] :
      ( aNaturalNumber0(X0)
     => ( X0 = sdtasdt0(sz10,X0)
        & sdtasdt0(X0,sz10) = X0 ) ) ).

fof(mDefDiff,definition,
    ! [X0,X1] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X0) )
     => ( sdtlseqdt0(X0,X1)
       => ! [X2] :
            ( X2 = sdtmndt0(X1,X0)
          <=> ( sdtpldt0(X0,X2) = X1
              & aNaturalNumber0(X2) ) ) ) ) ).

fof(mDefDiv,definition,
    ! [X0,X1] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X0) )
     => ( doDivides0(X0,X1)
      <=> ? [X2] :
            ( X1 = sdtasdt0(X0,X2)
            & aNaturalNumber0(X2) ) ) ) ).

fof(mDivSum,axiom,
    ! [X0,X1,X2] :
      ( ( aNaturalNumber0(X2)
        & aNaturalNumber0(X1)
        & aNaturalNumber0(X0) )
     => ( ( doDivides0(X0,X2)
          & doDivides0(X0,X1) )
       => doDivides0(X0,sdtpldt0(X1,X2)) ) ) ).

fof(m__1837,hypothesis,
    ( aNaturalNumber0(xp)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xn) ) ).

fof(m__1870,hypothesis,
    sdtlseqdt0(xp,xn) ).

fof(m__1883,hypothesis,
    xr = sdtmndt0(xn,xp) ).

fof(m__2027,hypothesis,
    ( doDivides0(xp,xm)
    | doDivides0(xp,xr) ) ).

fof(m__,conjecture,
    ( doDivides0(xp,xm)
    | doDivides0(xp,xn) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ( doDivides0(xp,xm)
      | doDivides0(xp,xn) ),
    inference(negate_conjecture,[status(cth)],[m__]) ).

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

cnf(c11,plain,
    ( sdtasdt0(X0,sz10) = X0
    | ~ aNaturalNumber0(X0) ),
    inference(clausification,[status(esa)],[m_MulUnit]) ).

cnf(c27,plain,
    ( ~ sdtlseqdt0(X0,X1)
    | sdtmndt0(X1,X0) != X2
    | aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X0) ),
    inference(clausification,[status(esa)],[mDefDiff]) ).

cnf(c28,plain,
    ( ~ sdtlseqdt0(X0,X2)
    | sdtmndt0(X2,X0) != X1
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X0)
    | sdtpldt0(X0,X1) = X2 ),
    inference(clausification,[status(esa)],[mDefDiff]) ).

cnf(c49,plain,
    ( doDivides0(X0,X2)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X0)
    | sdtasdt0(X0,X1) != X2 ),
    inference(clausification,[status(esa)],[mDefDiv]) ).

cnf(c54,plain,
    ( ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1)
    | doDivides0(X0,sdtpldt0(X1,X2))
    | ~ aNaturalNumber0(X0)
    | ~ doDivides0(X0,X2)
    | ~ doDivides0(X0,X1) ),
    inference(clausification,[status(esa)],[mDivSum]) ).

cnf(c69,plain,
    aNaturalNumber0(xn),
    inference(clausification,[status(esa)],[m__1837]) ).

cnf(c70,plain,
    aNaturalNumber0(xp),
    inference(clausification,[status(esa)],[m__1837]) ).

cnf(c75,plain,
    sdtlseqdt0(xp,xn),
    inference(clausification,[status(esa)],[m__1870]) ).

cnf(c76,plain,
    sdtmndt0(xn,xp) = xr,
    inference(clausification,[status(esa)],[m__1883]) ).

cnf(c80,plain,
    ( doDivides0(xp,xm)
    | doDivides0(xp,xr) ),
    inference(clausification,[status(esa)],[m__2027]) ).

cnf(c81,plain,
    ~ doDivides0(xp,xn),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c82,plain,
    ~ doDivides0(xp,xm),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    doDivides0(xp,xr),
    inference(resolution,[status(thm)],[c82,c80]) ).

cnf(d1,plain,
    ( ~ sdtlseqdt0(xp,xn)
    | ~ aNaturalNumber0(xp)
    | ~ aNaturalNumber0(xn)
    | sdtpldt0(xp,X0) = xn
    | xr != X0 ),
    inference(superposition,[status(thm)],[c76,c28]) ).

cnf(d2,plain,
    ( ~ sdtlseqdt0(xp,xn)
    | ~ aNaturalNumber0(xp)
    | xr != X0
    | sdtpldt0(xp,X0) = xn ),
    inference(resolution,[status(thm)],[c69,d1]) ).

cnf(d3,plain,
    ( ~ sdtlseqdt0(xp,xn)
    | xr != X0
    | sdtpldt0(xp,X0) = xn ),
    inference(resolution,[status(thm)],[c70,d2]) ).

cnf(d4,plain,
    ( xr != X0
    | sdtpldt0(xp,X0) = xn ),
    inference(resolution,[status(thm)],[c75,d3]) ).

cnf(d5,plain,
    sdtpldt0(xp,xr) = xn,
    inference(equality_resolution,[status(thm)],[d4]) ).

cnf(d6,plain,
    ( ~ doDivides0(X0,xr)
    | ~ doDivides0(X0,xp)
    | ~ aNaturalNumber0(xr)
    | ~ aNaturalNumber0(X0)
    | ~ aNaturalNumber0(xp)
    | doDivides0(X0,xn) ),
    inference(superposition,[status(thm)],[d5,c54]) ).

cnf(d7,plain,
    ( ~ doDivides0(X0,xr)
    | ~ doDivides0(X0,xp)
    | doDivides0(X0,xn)
    | ~ aNaturalNumber0(xr)
    | ~ aNaturalNumber0(X0) ),
    inference(resolution,[status(thm)],[c70,d6]) ).

cnf(d8,plain,
    ( ~ sdtlseqdt0(xp,xn)
    | ~ aNaturalNumber0(xp)
    | ~ aNaturalNumber0(xn)
    | aNaturalNumber0(X0)
    | xr != X0 ),
    inference(superposition,[status(thm)],[c76,c27]) ).

cnf(d9,plain,
    ( ~ sdtlseqdt0(xp,xn)
    | ~ aNaturalNumber0(xp)
    | aNaturalNumber0(X0)
    | xr != X0 ),
    inference(resolution,[status(thm)],[c69,d8]) ).

cnf(d10,plain,
    ( ~ sdtlseqdt0(xp,xn)
    | aNaturalNumber0(X0)
    | xr != X0 ),
    inference(resolution,[status(thm)],[c70,d9]) ).

cnf(d11,plain,
    ( aNaturalNumber0(X0)
    | xr != X0 ),
    inference(resolution,[status(thm)],[c75,d10]) ).

cnf(d12,plain,
    aNaturalNumber0(xr),
    inference(equality_resolution,[status(thm)],[d11]) ).

cnf(d13,plain,
    ( ~ doDivides0(X0,xr)
    | ~ doDivides0(X0,xp)
    | doDivides0(X0,xn)
    | ~ aNaturalNumber0(X0) ),
    inference(resolution,[status(thm)],[d12,d7]) ).

cnf(d14,plain,
    ( ~ doDivides0(xp,xp)
    | doDivides0(xp,xn)
    | ~ aNaturalNumber0(xp) ),
    inference(resolution,[status(thm)],[d13,d0]) ).

cnf(d15,plain,
    ( ~ doDivides0(xp,xp)
    | doDivides0(xp,xn) ),
    inference(resolution,[status(thm)],[c70,d14]) ).

cnf(d16,plain,
    ~ doDivides0(xp,xp),
    inference(resolution,[status(thm)],[c81,d15]) ).

cnf(d17,plain,
    sdtasdt0(xp,sz10) = xp,
    inference(resolution,[status(thm)],[c70,c11]) ).

cnf(d18,plain,
    ( doDivides0(xp,X0)
    | ~ aNaturalNumber0(xp)
    | ~ aNaturalNumber0(sz10)
    | ~ aNaturalNumber0(X0)
    | xp != X0 ),
    inference(superposition,[status(thm)],[d17,c49]) ).

cnf(d19,plain,
    ( doDivides0(xp,X0)
    | ~ aNaturalNumber0(xp)
    | ~ aNaturalNumber0(X0)
    | xp != X0 ),
    inference(resolution,[status(thm)],[c1,d18]) ).

cnf(d20,plain,
    ( doDivides0(xp,X0)
    | ~ aNaturalNumber0(X0)
    | xp != X0 ),
    inference(resolution,[status(thm)],[c70,d19]) ).

cnf(d21,plain,
    ( doDivides0(xp,xp)
    | ~ aNaturalNumber0(xp) ),
    inference(equality_resolution,[status(thm)],[d20]) ).

cnf(d22,plain,
    doDivides0(xp,xp),
    inference(resolution,[status(thm)],[c70,d21]) ).

cnf(d23,plain,
    $false,
    inference(resolution,[status(thm)],[d22,d16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM496+1 : 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.10/0.37  % Computer : n013.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep 26 02:58:36 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 46.40/19.99  % SZS status Theorem for theBenchmark.p
% 46.40/19.99  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------