↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYN061+1 : TPTP v9.0.0. Released v2.0.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 : n014.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:02:21 PM UTC 2025

% Result   : Theorem 2.71s 1.63s
% Output   : CNFRefutation 2.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   13 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   22 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   18 (   9   ~;   5   |;   3   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 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-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    8 (   5   !;   3   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ big_j > big_i > big_h > big_g > big_f > #nlpp > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_37,axiom,
    ? [X] :
      ( big_i(X)
      & big_f(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel31_2) ).

tff(f_42,axiom,
    ! [X] :
      ( ~ big_h(X)
     => big_j(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel31_3) ).

tff(f_47,negated_conjecture,
    ~ ? [X] :
        ( big_i(X)
        & big_j(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel31) ).

tff(f_33,axiom,
    ~ ? [X] :
        ( big_f(X)
        & ( big_g(X)
          | big_h(X) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel31_1) ).

tff(c_6,plain,
    big_f('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_8,plain,
    big_i('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_10,plain,
    ! [X_2] :
      ( big_j(X_2)
      | big_h(X_2) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_15,plain,
    ! [X_6] :
      ( ~ big_j(X_6)
      | ~ big_i(X_6) ),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_21,plain,
    ! [X_8] :
      ( ~ big_i(X_8)
      | big_h(X_8) ),
    inference(resolution,[status(thm)],[c_10,c_15]) ).

tff(c_25,plain,
    big_h('#skF_1'),
    inference(resolution,[status(thm)],[c_8,c_21]) ).

tff(c_2,plain,
    ! [X_1] :
      ( ~ big_h(X_1)
      | ~ big_f(X_1) ),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_28,plain,
    ~ big_f('#skF_1'),
    inference(resolution,[status(thm)],[c_25,c_2]) ).

tff(c_32,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN061+1 : TPTP v9.0.0. Released v2.0.0.
% 0.11/0.12  % 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.33  % Computer : n014.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Wed Apr  9 06:54:49 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 2.71/1.63  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.71/1.63  
% 2.71/1.63  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------