↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SYN944+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 : n003.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 8.84s 1.52s
% Output   : CNFRefutation 8.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   11 (   6 unt;   0 def)
%            Number of atoms       :   30 (   0 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :   25 (   6   ~;   3   |;  10   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   21 (   1 sgn  12   !;   4   ?)

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

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

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

cnf(c2,plain,
    r(sK1,sK2),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

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

cnf(c4,plain,
    ( q(X0,X1)
    | ~ r(X0,X1) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

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

cnf(d0,plain,
    q(sK1,sK2),
    inference(resolution,[status(thm)],[c4,c2]) ).

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

cnf(d2,plain,
    p(sK1),
    inference(resolution,[status(thm)],[c3,c1]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN944+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n003.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep 26 18:52:54 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.13/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.84/1.52  % SZS status Theorem for theBenchmark.p
% 8.84/1.52  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------