↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n026.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:21:57 AM UTC 2026

% Result   : Theorem 9.28s 1.52s
% Output   : CNFRefutation 9.28s
% 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 :   15 (   8   ~;   1   |;   2   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   14 (   2 sgn   4   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(x2113,conjecture,
    ( ( ? [X2] :
        ! [X3] :
          ( 'big$up'(X3)
         => ~ 'big$ur'(X2,X3) )
      & ! [X0] :
        ? [X1] : 'big$ur'(X0,X1) )
   => ? [X3] : ~ 'big$up'(X3) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ( ( ? [X2] :
          ! [X3] :
            ( 'big$up'(X3)
           => ~ 'big$ur'(X2,X3) )
        & ! [X0] :
          ? [X1] : 'big$ur'(X0,X1) )
     => ? [X3] : ~ 'big$up'(X3) ),
    inference(negate_conjecture,[status(cth)],[x2113]) ).

cnf(c0,plain,
    'big$ur'(X0,sK1(X0)),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c1,plain,
    ( ~ 'big$ur'(sK2,X0)
    | ~ 'big$up'(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c2,plain,
    'big$up'(X0),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ~ 'big$ur'(sK2,X0),
    inference(resolution,[status(thm)],[c2,c1]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN362+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n026.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.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sat Sep 26 17:40:55 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.28/1.52  % SZS status Theorem for theBenchmark.p
% 9.28/1.52  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------