↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : MGT070+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n007.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:01:26 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(h_inf_lb,hypothesis,
    ! [X0] : leq(ninf,X0) ).

fof(h_sup_ub,hypothesis,
    ! [X0] : leq(X0,nsup) ).

fof(completion_compat,axiom,
    ! [X0,X1,X2] :
      ( ( leq(X0,X2)
        & leq(X1,X0) )
     => 'completion$ucompatible'(X0,X1,X2) ) ).

fof(unknown_sound_compatible,conjecture,
    ? [X0] :
      ( 'completion$ucompatible'(X0,ninf,nsup)
      & leq(X0,nsup)
      & leq(ninf,X0) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ? [X0] :
        ( 'completion$ucompatible'(X0,ninf,nsup)
        & leq(X0,nsup)
        & leq(ninf,X0) ),
    inference(negate_conjecture,[status(cth)],[unknown_sound_compatible]) ).

cnf(c2,plain,
    leq(ninf,X0),
    inference(clausification,[status(esa)],[h_inf_lb]) ).

cnf(c3,plain,
    leq(X0,nsup),
    inference(clausification,[status(esa)],[h_sup_ub]) ).

cnf(c52,plain,
    ( 'completion$ucompatible'(X1,X0,X2)
    | ~ leq(X1,X2)
    | ~ leq(X0,X1) ),
    inference(clausification,[status(esa)],[completion_compat]) ).

cnf(c58,plain,
    ( ~ 'completion$ucompatible'(X0,ninf,nsup)
    | ~ leq(X0,nsup)
    | ~ leq(ninf,X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ 'completion$ucompatible'(X0,ninf,nsup)
    | ~ leq(X0,nsup) ),
    inference(resolution,[status(thm)],[c2,c58]) ).

cnf(d1,plain,
    ~ 'completion$ucompatible'(X0,ninf,nsup),
    inference(resolution,[status(thm)],[c3,d0]) ).

cnf(d2,plain,
    ( ~ leq(X0,nsup)
    | ~ leq(ninf,X0) ),
    inference(resolution,[status(thm)],[c52,d1]) ).

cnf(d3,plain,
    ~ leq(X0,nsup),
    inference(resolution,[status(thm)],[c2,d2]) ).

cnf(d4,plain,
    $false,
    inference(resolution,[status(thm)],[c3,d3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : MGT070+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.44  % Computer : n007.cluster.edu
% 0.17/0.44  % Model    : x86_64 x86_64
% 0.17/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44  % Memory   : 8046.5625MB
% 0.17/0.44  % OS       : Linux 6.8.0-71-generic
% 0.17/0.44  % CPULimit : 300
% 0.17/0.44  % WCLimit  : 300
% 0.17/0.44  % DateTime : Sat Sep 26 00:09:23 UTC 2026
% 0.17/0.44  % CPUTime  : 
% 0.17/0.44  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.78/3.39  % SZS status Theorem for theBenchmark.p
% 13.78/3.39  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------