↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : PUZ060+1 : TPTP v9.0.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n021.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Apr  9 08:25:12 PM UTC 2025

% Result   : Theorem 2.97s 2.00s
% Output   : CNFRefutation 2.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   12 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   32 (   0 equ)
%            Maximal formula atoms :   14 (   2 avg)
%            Number of connectives :   30 (  10   ~;   7   |;   8   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   19 (  18   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ not_killed_by > likes > eats > food > alive > #nlpp > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(likes,type,
    likes: ( $i * $i ) > $o ).

tff(food,type,
    food: $i > $o ).

tff('#skF_5',type,
    '#skF_5': $i ).

tff('#skF_6',type,
    '#skF_6': $i ).

tff('#skF_2',type,
    '#skF_2': $i ).

tff('#skF_3',type,
    '#skF_3': $i ).

tff('#skF_1',type,
    '#skF_1': $i ).

tff('#skF_4',type,
    '#skF_4': $i ).

tff(alive,type,
    alive: $i > $o ).

tff(eats,type,
    eats: ( $i * $i ) > $o ).

tff(not_killed_by,type,
    not_killed_by: ( $i * $i ) > $o ).

tff(f_59,negated_conjecture,
    ~ ! [Peanuts,John,Bill,Sue,Apples,Chicken] :
        ( ( ! [X] :
              ( food(X)
             => likes(John,X) )
          & food(Apples)
          & food(Chicken)
          & ! [X] :
              ( ? [Y] :
                  ( eats(Y,X)
                  & not_killed_by(Y,X) )
             => food(X) )
          & eats(Bill,Peanuts)
          & alive(Bill)
          & ! [X] :
              ( eats(Bill,X)
             => eats(Sue,X) )
          & ! [Y] :
              ( alive(Y)
             => ! [X] : not_killed_by(Y,X) ) )
       => likes(John,Peanuts) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

tff(c_19,plain,
    ! [X_17] :
      ( likes('#skF_2',X_17)
      | ~ food(X_17) ),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_2,plain,
    ~ likes('#skF_2','#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_23,plain,
    ~ food('#skF_1'),
    inference(resolution,[status(thm)],[c_19,c_2]) ).

tff(c_8,plain,
    alive('#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_10,plain,
    eats('#skF_3','#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_4,plain,
    ! [Y_14,X_16] :
      ( not_killed_by(Y_14,X_16)
      | ~ alive(Y_14) ),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_30,plain,
    ! [X_21,Y_22] :
      ( food(X_21)
      | ~ not_killed_by(Y_22,X_21)
      | ~ eats(Y_22,X_21) ),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_35,plain,
    ! [X_23,Y_24] :
      ( food(X_23)
      | ~ eats(Y_24,X_23)
      | ~ alive(Y_24) ),
    inference(resolution,[status(thm)],[c_4,c_30]) ).

tff(c_41,plain,
    ( food('#skF_1')
    | ~ alive('#skF_3') ),
    inference(resolution,[status(thm)],[c_10,c_35]) ).

tff(c_47,plain,
    food('#skF_1'),
    inference(demodulation,[status(thm),theory(equality)],[c_8,c_41]) ).

tff(c_49,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_23,c_47]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem  : PUZ060+1 : TPTP v9.0.0. Released v3.1.0.
% 0.02/0.10  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.09/0.30  % Computer : n021.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 300
% 0.09/0.30  % DateTime : Tue Apr  8 17:20:28 EDT 2025
% 0.09/0.30  % CPUTime  : 
% 2.97/2.00  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.97/2.00  
% 2.97/2.00  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------