↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYN943+1 : TPTP v9.0.0. Released v3.1.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 : n024.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:08:29 PM UTC 2025

% Result   : Theorem 2.72s 1.86s
% Output   : CNFRefutation 2.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :   14 (   2 avg)
%            Number of connectives :   36 (  12   ~;  14   |;   6   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   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  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   11 (   6   !;   5   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ s > p > g > e > c > #nlpp > f > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

tff(f_54,negated_conjecture,
    ~ ! [A] :
      ? [X,X2,X3,X4,Y] :
        ( ( p(A)
          & e(A)
          & ( e(X)
           => ( g(X)
              | s(X,f(X)) ) )
          & ( e(X2)
           => ( g(X2)
              | c(f(X2)) ) )
          & ( s(A,Y)
           => p(Y) ) )
       => ( ( p(X3)
            & g(X3) )
          | ( p(X4)
            & c(X4) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

tff(c_2,plain,
    p('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_15,plain,
    ! [X3_11] :
      ( ~ g(X3_11)
      | ~ p(X3_11) ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_19,plain,
    ~ g('#skF_1'),
    inference(resolution,[status(thm)],[c_2,c_15]) ).

tff(c_4,plain,
    e('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_8,plain,
    ! [X2_7] :
      ( c(f(X2_7))
      | g(X2_7)
      | ~ e(X2_7) ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_27,plain,
    ! [X_15] :
      ( s(X_15,f(X_15))
      | g(X_15)
      | ~ e(X_15) ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_10,plain,
    ! [Y_10] :
      ( p(Y_10)
      | ~ s('#skF_1',Y_10) ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_31,plain,
    ( p(f('#skF_1'))
    | g('#skF_1')
    | ~ e('#skF_1') ),
    inference(resolution,[status(thm)],[c_27,c_10]) ).

tff(c_34,plain,
    ( p(f('#skF_1'))
    | g('#skF_1') ),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_31]) ).

tff(c_35,plain,
    p(f('#skF_1')),
    inference(negUnitSimplification,[status(thm)],[c_19,c_34]) ).

tff(c_14,plain,
    ! [X4_9] :
      ( ~ c(X4_9)
      | ~ p(X4_9) ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_42,plain,
    ~ c(f('#skF_1')),
    inference(resolution,[status(thm)],[c_35,c_14]) ).

tff(c_46,plain,
    ( g('#skF_1')
    | ~ e('#skF_1') ),
    inference(resolution,[status(thm)],[c_8,c_42]) ).

tff(c_49,plain,
    g('#skF_1'),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_46]) ).

tff(c_51,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_19,c_49]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem  : SYN943+1 : TPTP v9.0.0. Released v3.1.0.
% 0.02/0.10  % 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.09/0.30  % Computer : n024.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 300
% 0.09/0.30  % DateTime : Wed Apr  9 08:42:21 EDT 2025
% 0.09/0.30  % CPUTime  : 
% 2.72/1.86  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.72/1.86  
% 2.72/1.86  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------