↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : NUM914_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 : n007.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:30 PM UTC 2025

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

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

%Foreground sorts:

%Background operators:

%Foreground operators:

tff(f_34,negated_conjecture,
    ~ ? [Xa: $real,Ya: $real,Za: $real] :
        ( ( $sum(Xa,Ya) = Za )
      <=> ( ( $difference(Za,Ya) = Xa )
          & ( $difference(Za,Xa) = Ya ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',real_combined_problem_2) ).

tff(c_12,plain,
    ! [X_1a: $real,Z_3a: $real,Y_2a: $real] :
      ( ( X_1a = $difference(Z_3a,Y_2a) )
      | ( Z_3a = $sum(X_1a,Y_2a) ) ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_15,plain,
    $false,
    inference(quantifierElimination,[status(thm),theory('LFA')],[c_12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM914_1 : TPTP v9.0.0. Released v5.0.0.
% 0.11/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.14/0.35  % Computer : n007.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Tue Apr  8 15:41:09 EDT 2025
% 0.14/0.35  % CPUTime  : 
% 2.60/1.63  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.60/1.64  
% 2.60/1.64  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------