↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYN370+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 : n022.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:22 PM UTC 2025

% Result   : Theorem 2.92s 2.08s
% Output   : CNFRefutation 3.06s
% 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       :    8 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :    5 (   2   ~;   2   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   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-3 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :    7 (   5   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ big_p > #nlpp > h > f > a > #skF_1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(a,type,
    a: $i ).

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

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

tff(f,type,
    f: $i > $i ).

tff(h,type,
    h: $i > $i ).

tff(f_34,negated_conjecture,
    ~ ? [V] :
      ! [Y] :
      ? [Z] :
        ( ( big_p(a,Y,h(Y))
          | big_p(V,Y,f(Y)) )
       => big_p(V,Y,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2121) ).

tff(c_4,plain,
    ! [V_1,Z_6] : ~ big_p(V_1,'#skF_1'(V_1),Z_6),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_2,plain,
    ! [V_1] :
      ( big_p(V_1,'#skF_1'(V_1),f('#skF_1'(V_1)))
      | big_p(a,'#skF_1'(V_1),h('#skF_1'(V_1))) ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_7,plain,
    ! [V_9] : big_p(a,'#skF_1'(V_9),h('#skF_1'(V_9))),
    inference(negUnitSimplification,[status(thm)],[c_4,c_2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem  : SYN370+1 : TPTP v9.0.0. Released v2.0.0.
% 0.09/0.11  % 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.10/0.32  % Computer : n022.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit : 300
% 0.10/0.32  % WCLimit  : 300
% 0.10/0.32  % DateTime : Wed Apr  9 07:20:51 EDT 2025
% 0.10/0.32  % CPUTime  : 
% 2.92/2.08  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.92/2.08  
% 2.92/2.08  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------