↑ Up

LisaST---0.9.THM-CRf.s

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

% Result   : Theorem 20.18s 3.22s
% Output   : CNFRefutation 20.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   21 (   8 unt;   1 def)
%            Number of atoms       :   52 (  10 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   54 (  23   ~;  18   |;   8   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn   3   !;   3   ?)

% 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(mDefDiv,definition,
    ! [X0,X1] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X0) )
     => ( doDivides0(X0,X1)
      <=> ? [X2] :
            ( X1 = sdtasdt0(X0,X2)
            & aNaturalNumber0(X2) ) ) ) ).

fof(m__1716,hypothesis,
    aNaturalNumber0(xk) ).

fof(m__,conjecture,
    ( isPrime0(xk)
   => ? [X0] :
        ( isPrime0(X0)
        & doDivides0(X0,xk)
        & aNaturalNumber0(X0) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ( isPrime0(xk)
     => ? [X0] :
          ( isPrime0(X0)
          & doDivides0(X0,xk)
          & aNaturalNumber0(X0) ) ),
    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(c49,plain,
    ( X1 != sdtasdt0(X0,X2)
    | ~ aNaturalNumber0(X2)
    | doDivides0(X0,X1)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X0) ),
    inference(clausification,[status(esa)],[mDefDiv]) ).

cnf(c67,plain,
    aNaturalNumber0(xk),
    inference(clausification,[status(esa)],[m__1716]) ).

cnf(c73,plain,
    isPrime0(xk),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c74,plain,
    ( ~ isPrime0(X0)
    | ~ doDivides0(X0,xk)
    | ~ aNaturalNumber0(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    sdtasdt0(xk,sz10) = xk,
    inference(resolution,[status(thm)],[c11,c67]) ).

cnf(d1,plain,
    ( doDivides0(xk,X0)
    | ~ aNaturalNumber0(xk)
    | ~ aNaturalNumber0(X0)
    | ~ aNaturalNumber0(sz10)
    | X0 != xk ),
    inference(superposition,[status(thm)],[d0,c49]) ).

cnf(d2,plain,
    ( doDivides0(xk,X0)
    | ~ aNaturalNumber0(xk)
    | ~ aNaturalNumber0(X0)
    | X0 != xk ),
    inference(resolution,[status(thm)],[c1,d1]) ).

cnf(d3,plain,
    ( doDivides0(xk,X0)
    | ~ aNaturalNumber0(X0)
    | X0 != xk ),
    inference(resolution,[status(thm)],[c67,d2]) ).

cnf(d4,plain,
    ( doDivides0(xk,xk)
    | ~ aNaturalNumber0(xk) ),
    inference(equality_resolution,[status(thm)],[d3]) ).

cnf(d5,plain,
    doDivides0(xk,xk),
    inference(resolution,[status(thm)],[c67,d4]) ).

cnf(d6,plain,
    ( ~ isPrime0(xk)
    | ~ aNaturalNumber0(xk) ),
    inference(resolution,[status(thm)],[d5,c74]) ).

cnf(d7,plain,
    ~ aNaturalNumber0(xk),
    inference(resolution,[status(thm)],[c73,d6]) ).

cnf(d8,plain,
    $false,
    inference(resolution,[status(thm)],[c67,d7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM482+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.08/0.34  % Computer : n010.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Sat Sep 26 02:56:14 UTC 2026
% 0.08/0.34  % CPUTime  : 
% 0.08/0.34  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 20.18/3.22  % SZS status Theorem for theBenchmark.p
% 20.18/3.22  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------