↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYN346+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n023.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:17 PM UTC 2025

% Result   : Theorem 2.49s 1.56s
% Output   : CNFRefutation 2.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    5 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   11 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   10 (   4   ~;   2   |;   2   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   11 (   9   !;   2   ?;   0   :)

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

%Foreground sorts:

%Background operators:

%Foreground operators:
tff('#skF_3',type,
    '#skF_3': ( $i * $i ) > $i ).

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

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

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

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

tff(f_39,negated_conjecture,
    ~ ! [X1,X2] :
      ? [Y1,Y2] :
      ! [Z1,Z2] :
        ( big_f(X2,Z1)
       => ( big_f(Y1,Z2)
         => ( ( big_f(Y1,Z1)
              & big_f(Y2,Z1) )
            | ( big_f(X2,Z2)
              & big_f(Y2,Z2) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_17_2) ).

tff(c_8,plain,
    ! [Y1_7,Y2_8] : big_f('#skF_2','#skF_3'(Y1_7,Y2_8)),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_11,plain,
    ! [Y2_15,Y1_16] :
      ( ~ big_f(Y2_15,'#skF_3'(Y1_16,Y2_15))
      | ~ big_f(Y1_16,'#skF_3'(Y1_16,Y2_15)) ),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_16,plain,
    ! [Y1_17] : ~ big_f(Y1_17,'#skF_3'(Y1_17,'#skF_2')),
    inference(resolution,[status(thm)],[c_8,c_11]) ).

tff(c_21,plain,
    $false,
    inference(resolution,[status(thm)],[c_8,c_16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYN346+1 : TPTP v9.0.0. Released v2.0.0.
% 0.03/0.12  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.33  % Computer : n023.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Wed Apr  9 07:19:24 EDT 2025
% 0.13/0.33  % CPUTime  : 
% 2.49/1.56  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.49/1.57  
% 2.49/1.57  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------