↑ Up

LisaST---0.9.THM-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__1883,hypothesis,
    ( xr = sdtmndt0(xn,xp)
    & sdtpldt0(xp,xr) = xn
    & aNaturalNumber0(xr) ) ).

fof(m__,conjecture,
    xn = sdtpldt0(xp,xr) ).

fof(negated_conjecture,negated_conjecture,
    xn != sdtpldt0(xp,xr),
    inference(negate_conjecture,[status(cth)],[m__]) ).

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

cnf(c107,plain,
    xn != sdtpldt0(xp,xr),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    xn != xn,
    inference(demodulation,[status(thm)],[c107,c101]) ).

cnf(d1,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM489+3 : 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.11/0.38  % Computer : n001.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sat Sep 26 03:03:42 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.13/2.79  % SZS status Theorem for theBenchmark.p
% 14.13/2.79  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------