↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n016.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 09:22:04 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(kalish239,conjecture,
    ( ( ? [X1] : g(X1)
      & ! [X0] : f(X0) )
   => ? [X2] :
        ( g(X2)
        & f(X2) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ( ( ? [X1] : g(X1)
        & ! [X0] : f(X0) )
     => ? [X2] :
          ( g(X2)
          & f(X2) ) ),
    inference(negate_conjecture,[status(cth)],[kalish239]) ).

cnf(c0,plain,
    f(X0),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c1,plain,
    g(sK1),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c2,plain,
    ( ~ g(X0)
    | ~ f(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ~ g(X0),
    inference(resolution,[status(thm)],[c0,c2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYN405+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.07  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.43  % Computer : n016.cluster.edu
% 0.18/0.43  % Model    : x86_64 x86_64
% 0.18/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43  % Memory   : 8046.5625MB
% 0.18/0.43  % OS       : Linux 6.8.0-71-generic
% 0.18/0.43  % CPULimit : 300
% 0.18/0.43  % WCLimit  : 300
% 0.18/0.43  % DateTime : Sat Sep 26 17:46:01 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.44  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.98/2.28  % SZS status Theorem for theBenchmark.p
% 12.98/2.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------