↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : LAT388+1 : 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 : n006.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 07:48:35 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__1330,hypothesis,
    ( aSupremumOfIn0(xp,xT,xS)
    & aFixedPointOf0(xp,xf) ) ).

fof(m__,conjecture,
    ? [X0] : aSupremumOfIn0(X0,xT,xS) ).

fof(negated_conjecture,negated_conjecture,
    ~ ? [X0] : aSupremumOfIn0(X0,xT,xS),
    inference(negate_conjecture,[status(cth)],[m__]) ).

cnf(c68,plain,
    aSupremumOfIn0(xp,xT,xS),
    inference(clausification,[status(esa)],[m__1330]) ).

cnf(c69,plain,
    ~ aSupremumOfIn0(X0,xT,xS),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    $false,
    inference(resolution,[status(thm)],[c69,c68]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LAT388+1 : 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.09/5.37  % Computer : n006.cluster.edu
% 0.09/5.37  % Model    : x86_64 x86_64
% 0.09/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37  % Memory   : 8046.5625MB
% 0.09/5.37  % OS       : Linux 6.8.0-71-generic
% 0.09/5.37  % CPULimit : 300
% 0.09/5.37  % WCLimit  : 300
% 0.09/5.37  % DateTime : Fri Sep 25 21:39:21 UTC 2026
% 0.09/5.37  % CPUTime  : 
% 0.09/5.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.00/7.01  % SZS status Theorem for theBenchmark.p
% 12.00/7.01  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------