↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYO902_8 : TPTP v9.0.0. Released v8.2.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 : n010.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 10:38:32 PM UTC 2025

% Result   : Theorem 2.90s 1.74s
% Output   : CNFRefutation 2.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   30 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   25 (  12   ~;   7   |;   4   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of FOOLs       :    6 (   6 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   1 usr;   2 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   13 (   9   !;   4   ?;  13   :)

% Comments : 
%------------------------------------------------------------------------------
%$ p > #nlpp > #skF_2 > #skF_1

%Foreground sorts:
tff($ki_world,type,
    $ki_world: $tType ).

%Background operators:

%Foreground operators:
tff(p,type,
    p: $ki_world > $o ).

tff('#skF_2',type,
    '#skF_2': $ki_world > $ki_world ).

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

tff(f_30,axiom,
    ! [W: $ki_world] : $ki_accessible(W,W),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_reflexive) ).

tff(f_49,negated_conjecture,
    ~ ( ? [W: $ki_world] :
          ( $ki_accessible($ki_local_world,W)
          & ! [W0: $ki_world] :
              ( $ki_accessible(W,W0)
             => ? [W1: $ki_world] :
                  ( $ki_accessible(W0,W1)
                  & p(W1) ) ) )
     => ? [W: $ki_world] :
          ( $ki_accessible($ki_local_world,W)
          & ? [W0: $ki_world] :
              ( $ki_accessible(W,W0)
              & p(W0) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).

tff(c_2,plain,
    ! [W_1: $ki_world] : $ki_accessible(W_1,W_1),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_6,plain,
    $ki_accessible($ki_local_world,'#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_8,plain,
    ! [W0_5: $ki_world] :
      ( p('#skF_2'(W0_5))
      | ~ $ki_accessible('#skF_1',W0_5) ),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_10,plain,
    ! [W0_5: $ki_world] :
      ( $ki_accessible(W0_5,'#skF_2'(W0_5))
      | ~ $ki_accessible('#skF_1',W0_5) ),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_14,plain,
    ! [W0_13: $ki_world,W_14: $ki_world] :
      ( ~ p(W0_13)
      | ~ $ki_accessible(W_14,W0_13)
      | ~ $ki_accessible($ki_local_world,W_14) ),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_42,plain,
    ! [W0_16: $ki_world] :
      ( ~ p('#skF_2'(W0_16))
      | ~ $ki_accessible($ki_local_world,W0_16)
      | ~ $ki_accessible('#skF_1',W0_16) ),
    inference(resolution,[status(thm)],[c_10,c_14]) ).

tff(c_47,plain,
    ! [W0_17: $ki_world] :
      ( ~ $ki_accessible($ki_local_world,W0_17)
      | ~ $ki_accessible('#skF_1',W0_17) ),
    inference(resolution,[status(thm)],[c_8,c_42]) ).

tff(c_58,plain,
    ~ $ki_accessible('#skF_1','#skF_1'),
    inference(resolution,[status(thm)],[c_6,c_47]) ).

tff(c_64,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_58]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SYO902_8 : TPTP v9.0.0. Released v8.2.0.
% 0.10/0.13  % 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.12/0.34  % Computer : n010.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Apr  9 10:24:49 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 2.90/1.74  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.90/1.74  
% 2.90/1.74  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------