↑ Up

LisaST---0.9.THM-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(mSortsB,axiom,
    ! [X0,X1] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X0) )
     => aNaturalNumber0(sdtpldt0(X0,X1)) ) ).

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

fof(m__773,hypothesis,
    ( aNaturalNumber0(xl)
    & aNaturalNumber0(xn)
    & aNaturalNumber0(xm) ) ).

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

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

cnf(c3,plain,
    ( aNaturalNumber0(sdtpldt0(X0,X1))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X0) ),
    inference(clausification,[status(esa)],[mSortsB]) ).

cnf(c6,plain,
    ( sdtpldt0(sdtpldt0(X0,X1),X2) = sdtpldt0(X0,sdtpldt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X0) ),
    inference(clausification,[status(esa)],[mAddAsso]) ).

cnf(c32,plain,
    aNaturalNumber0(xm),
    inference(clausification,[status(esa)],[m__773]) ).

cnf(c35,plain,
    aNaturalNumber0(sK41),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c36,plain,
    sdtpldt0(xm,sK41) = xn,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c38,plain,
    aNaturalNumber0(sK42),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c39,plain,
    sdtpldt0(xn,sK42) = xl,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

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

cnf(d0,plain,
    ( ~ aNaturalNumber0(X0)
    | ~ aNaturalNumber0(X1)
    | sdtpldt0(sdtpldt0(X0,sK41),X1) = sdtpldt0(X0,sdtpldt0(sK41,X1)) ),
    inference(resolution,[status(thm)],[c6,c35]) ).

cnf(d1,plain,
    ( ~ aNaturalNumber0(X0)
    | sdtpldt0(sdtpldt0(xm,sK41),X0) = sdtpldt0(xm,sdtpldt0(sK41,X0)) ),
    inference(resolution,[status(thm)],[d0,c32]) ).

cnf(d2,plain,
    ( ~ aNaturalNumber0(X0)
    | sdtpldt0(xn,X0) = sdtpldt0(xm,sdtpldt0(sK41,X0)) ),
    inference(demodulation,[status(thm)],[d1,c36]) ).

cnf(d3,plain,
    sdtpldt0(xn,sK42) = sdtpldt0(xm,sdtpldt0(sK41,sK42)),
    inference(resolution,[status(thm)],[d2,c38]) ).

cnf(d4,plain,
    xl = sdtpldt0(xm,sdtpldt0(sK41,sK42)),
    inference(demodulation,[status(thm)],[d3,c39]) ).

cnf(d5,plain,
    ( ~ aNaturalNumber0(sdtpldt0(sK41,sK42))
    | xl != xl ),
    inference(superposition,[status(thm)],[d4,c41]) ).

cnf(d6,plain,
    ~ aNaturalNumber0(sdtpldt0(sK41,sK42)),
    inference(equality_resolution,[status(thm)],[d5]) ).

cnf(d7,plain,
    ( ~ aNaturalNumber0(sK41)
    | ~ aNaturalNumber0(sK42) ),
    inference(resolution,[status(thm)],[d6,c3]) ).

cnf(d8,plain,
    ~ aNaturalNumber0(sK42),
    inference(resolution,[status(thm)],[c35,d7]) ).

cnf(d9,plain,
    $false,
    inference(resolution,[status(thm)],[c38,d8]) ).

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