↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : NUM910_1 : TPTP v9.0.0. Released v5.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 07:57:29 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ #nlpp

%Foreground sorts:

%Background operators:
tff('#skF_1',type,
    '#skF_1': $real ).

%Foreground operators:

tff(f_30,negated_conjecture,
    ~ ! [Xa: $real] : ( $uminus($uminus(Xa)) = Xa ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',real_uminus_problem_7) ).

tff(c_1,plain,
    $uminus($uminus('#skF_1')) != '#skF_1',
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_2,plain,
    $false,
    inference(close,[status(thm),theory('LFA')],[c_1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM910_1 : TPTP v9.0.0. Released v5.0.0.
% 0.13/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.13/0.33  % Computer : n026.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 : Tue Apr  8 15:40:23 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 2.47/1.63  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.47/1.63  
% 2.47/1.63  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------