↑ Up

Beagle---0.9.52.THM-CRf.s

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

% Result   : Theorem 2.44s 1.59s
% Output   : CNFRefutation 2.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   13 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   26 (   0 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :   23 (  10   ~;   6   |;   4   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   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  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   21 (  18   !;   3   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ big_p > big_q > big_m > f > #nlpp > g > #skF_2 > #skF_1 > #skF_3

%Foreground sorts:

%Background operators:

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

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

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

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

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

tff('#skF_3',type,
    '#skF_3': $i ).

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

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

tff(f_52,negated_conjecture,
    ~ ( ( ! [X] :
            ( ? [Y] : big_p(X,Y)
           => ! [Z] : big_p(Z,Z) )
        & ! [U] :
          ? [V] :
            ( big_p(U,V)
            | ( big_m(U)
              & big_q(f(U,V)) ) )
        & ! [W] :
            ( big_q(W)
           => ~ big_m(g(W)) ) )
     => ! [U] :
        ? [V] :
          ( big_p(g(U),V)
          & big_p(U,U) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2115) ).

tff(c_6,plain,
    ! [Z_5,X_1,Y_4] :
      ( big_p(Z_5,Z_5)
      | ~ big_p(X_1,Y_4) ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_13,plain,
    ! [X_1,Y_4] : ~ big_p(X_1,Y_4),
    inference(splitLeft,[status(thm)],[c_6]) ).

tff(c_10,plain,
    ! [U_6] :
      ( big_m(U_6)
      | big_p(U_6,'#skF_2'(U_6)) ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_14,plain,
    ! [U_6] : big_m(U_6),
    inference(negUnitSimplification,[status(thm)],[c_13,c_10]) ).

tff(c_4,plain,
    ! [W_8] :
      ( ~ big_m(g(W_8))
      | ~ big_q(W_8) ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_17,plain,
    ! [W_8] : ~ big_q(W_8),
    inference(demodulation,[status(thm),theory(equality)],[c_14,c_4]) ).

tff(c_8,plain,
    ! [U_6] :
      ( big_q(f(U_6,'#skF_1'(U_6)))
      | big_p(U_6,'#skF_2'(U_6)) ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_20,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_13,c_17,c_8]) ).

tff(c_21,plain,
    ! [Z_5] : big_p(Z_5,Z_5),
    inference(splitRight,[status(thm)],[c_6]) ).

tff(c_2,plain,
    ! [V_10] :
      ( ~ big_p('#skF_3','#skF_3')
      | ~ big_p(g('#skF_3'),V_10) ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_25,plain,
    ! [V_18] : ~ big_p(g('#skF_3'),V_18),
    inference(demodulation,[status(thm),theory(equality)],[c_21,c_2]) ).

tff(c_34,plain,
    $false,
    inference(resolution,[status(thm)],[c_21,c_25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN364+1 : TPTP v9.0.0. Released v2.0.0.
% 0.03/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 : n016.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:20:53 EDT 2025
% 0.14/0.34  % CPUTime  : 
% 2.44/1.59  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.44/1.59  
% 2.44/1.59  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------