↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SYN950+1 : TPTP v9.3.1. Released v3.1.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 09:34:23 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
    ! [X0,X1] :
      ( ! [X2] :
          ( q(X2)
         => p(X2) )
     => ? [X3] :
          ( ( q(X3)
           => p(X1) )
          & ( p(X3)
           => p(X0) ) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1] :
        ( ! [X2] :
            ( q(X2)
           => p(X2) )
       => ? [X3] :
            ( ( q(X3)
             => p(X1) )
            & ( p(X3)
             => p(X0) ) ) ),
    inference(negate_conjecture,[status(cth)],[prove_this]) ).

cnf(c0,plain,
    ( p(X0)
    | ~ q(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c1,plain,
    ( q(X0)
    | p(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c4,plain,
    ( ~ p(sK1)
    | ~ p(sK0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( p(X0)
    | p(X0) ),
    inference(resolution,[status(thm)],[c1,c0]) ).

cnf(d1,plain,
    ~ p(sK0),
    inference(resolution,[status(thm)],[d0,c4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYN950+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.07  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45  % Computer : n006.cluster.edu
% 0.20/0.45  % Model    : x86_64 x86_64
% 0.20/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45  % Memory   : 8046.5625MB
% 0.20/0.45  % OS       : Linux 6.8.0-71-generic
% 0.20/0.45  % CPULimit : 300
% 0.20/0.45  % WCLimit  : 300
% 0.20/0.45  % DateTime : Sat Sep 26 18:51:11 UTC 2026
% 0.20/0.45  % CPUTime  : 
% 0.20/0.45  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.91/2.18  % SZS status Theorem for theBenchmark.p
% 12.91/2.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------