↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYN336+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 : n026.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:03:14 PM UTC 2025

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

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

%Foreground sorts:

%Background operators:

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

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

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

tff(f_37,negated_conjecture,
    ~ ! [X] :
      ? [Y1,Y2] :
      ! [Z] :
        ( big_f(X,Z)
       => ( big_f(Y1,Z)
         => ( big_f(Y2,Z)
           => ( big_f(Y1,X)
             => big_f(Z,Y2) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_15_1) ).

tff(c_4,plain,
    ! [Y1_5] : big_f(Y1_5,'#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_12,plain,
    ! [Y1_9,Y2_10] : ~ big_f('#skF_2'(Y1_9,Y2_10),Y2_10),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_17,plain,
    $false,
    inference(resolution,[status(thm)],[c_4,c_12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SYN336+1 : TPTP v9.0.0. Released v2.0.0.
% 0.12/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 : n026.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 07:18:38 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 2.41/1.51  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.41/1.52  
% 2.41/1.52  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------