↑ Up

Beagle---0.9.52.THM-CRf.s

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

% Result   : Theorem 2.25s 1.51s
% Output   : CNFRefutation 2.42s
% 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       :    7 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :    7 (   4   ~;   0   |;   1   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   10 (   9   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ big_q > big_p > #nlpp

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(big_q,type,
    big_q: ( $i * $i * $i ) > $o ).

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

tff(f_39,negated_conjecture,
    ~ ( ! [X] : big_p(X)
     => ? [Y] :
          ( ! [X,Z] : big_q(X,Y,Z)
         => ~ ! [Z] :
                ( big_p(Z)
                & ~ big_q(Y,Y,Z) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2131) ).

tff(c_2,plain,
    ! [X_7,Y_2,Z_8] : big_q(X_7,Y_2,Z_8),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_6,plain,
    ! [Y_2,Z_6] : ~ big_q(Y_2,Y_2,Z_6),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_11,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_6]) ).

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