↑ Up

Beagle---0.9.52.THM-CRf.s

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

% Result   : Theorem 2.23s 1.48s
% Output   : CNFRefutation 2.36s
% 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       :    6 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :    4 (   2   ~;   1   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 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  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
%            Number of variables   :    4 (   3   !;   1   ?;   0   :)

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

%Foreground sorts:

%Background operators:

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

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

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

tff(f_33,negated_conjecture,
    ~ ? [X] :
      ! [Y] :
        ( big_p(X)
       => ( big_q(X)
          | big_p(Y) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2137) ).

tff(c_6,plain,
    ! [X_1] : big_p(X_1),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_2,plain,
    ! [X_1] : ~ big_p('#skF_1'(X_1)),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : SYN385+1 : TPTP v9.0.0. Released v2.0.0.
% 0.08/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:50 EDT 2025
% 0.14/0.35  % CPUTime  : 
% 2.23/1.48  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.23/1.49  
% 2.23/1.49  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------