↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n010.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:24 AM UTC 2026

% Result   : Theorem 8.42s 1.46s
% Output   : CNFRefutation 8.42s
% 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 :   10 (   3   ~;   1   |;   0   &)
%                                         (   0 <=>;   6  =>;   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   :    8 (   2 sgn   2   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
    ( ? [X0] :
        ( a(X0)
       => b(X0) )
   => ( ! [X0] : a(X0)
     => ? [X0] : b(X0) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ( ? [X0] :
          ( a(X0)
         => b(X0) )
     => ( ! [X0] : a(X0)
       => ? [X0] : b(X0) ) ),
    inference(negate_conjecture,[status(cth)],[prove_this]) ).

cnf(c0,plain,
    ( b(sK0)
    | ~ a(sK0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c1,plain,
    a(X0),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

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

cnf(d0,plain,
    b(sK0),
    inference(resolution,[status(thm)],[c1,c0]) ).

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

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