↑ Up

Beagle---0.9.52.THM-CRf.s

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

% Result   : Theorem 2.91s 1.75s
% Output   : CNFRefutation 3.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   21 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   50 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   54 (  25   ~;  22   |;   0   &)
%                                         (   3 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 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-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   36 (  34   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ big_g > big_f > #nlpp > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

tff(f_42,negated_conjecture,
    ~ ? [X,Y] :
      ! [Z] :
        ( ( big_f(X,Y)
         => ( big_f(X,Z)
          <=> big_g(Y,Z) ) )
       => ( ( big_f(X,Y)
          <=> ( big_f(Z,Z)
             => big_g(Z,Z) ) )
         => ( big_g(X,Y)
          <=> big_g(Z,Z) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_14_6) ).

tff(c_21,plain,
    ! [X_8,Y_9] :
      ( big_g(X_8,Y_9)
      | big_g('#skF_1'(X_8,Y_9),'#skF_1'(X_8,Y_9)) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_12,plain,
    ! [X_1,Y_2] :
      ( ~ big_g('#skF_1'(X_1,Y_2),'#skF_1'(X_1,Y_2))
      | big_f(X_1,Y_2) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_25,plain,
    ! [X_8,Y_9] :
      ( big_f(X_8,Y_9)
      | big_g(X_8,Y_9) ),
    inference(resolution,[status(thm)],[c_21,c_12]) ).

tff(c_42,plain,
    ! [X_18,Y_19] :
      ( big_f(X_18,'#skF_1'(X_18,Y_19))
      | ~ big_g(Y_19,'#skF_1'(X_18,Y_19))
      | ~ big_f(X_18,Y_19) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_46,plain,
    ! [X_18,X_8] :
      ( big_f(X_18,'#skF_1'(X_18,X_8))
      | ~ big_f(X_18,X_8)
      | big_f(X_8,'#skF_1'(X_18,X_8)) ),
    inference(resolution,[status(thm)],[c_25,c_42]) ).

tff(c_59,plain,
    ! [X_18] :
      ( ~ big_f(X_18,X_18)
      | big_f(X_18,'#skF_1'(X_18,X_18)) ),
    inference(factorization,[status(thm),theory(equality)],[c_46]) ).

tff(c_75,plain,
    ! [X_24] :
      ( ~ big_f(X_24,X_24)
      | big_f(X_24,'#skF_1'(X_24,X_24)) ),
    inference(factorization,[status(thm),theory(equality)],[c_46]) ).

tff(c_18,plain,
    ! [Y_2,X_1] :
      ( big_g(Y_2,'#skF_1'(X_1,Y_2))
      | ~ big_f(X_1,'#skF_1'(X_1,Y_2))
      | ~ big_f(X_1,Y_2) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_78,plain,
    ! [X_24] :
      ( big_g(X_24,'#skF_1'(X_24,X_24))
      | ~ big_f(X_24,X_24) ),
    inference(resolution,[status(thm)],[c_75,c_18]) ).

tff(c_31,plain,
    ! [X_12,Y_13] :
      ( ~ big_g('#skF_1'(X_12,Y_13),'#skF_1'(X_12,Y_13))
      | ~ big_g(X_12,Y_13) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_38,plain,
    ! [X_12,Y_13] :
      ( ~ big_g(X_12,Y_13)
      | big_f('#skF_1'(X_12,Y_13),'#skF_1'(X_12,Y_13)) ),
    inference(resolution,[status(thm)],[c_25,c_31]) ).

tff(c_66,plain,
    ! [X_22,Y_23] :
      ( big_g('#skF_1'(X_22,Y_23),'#skF_1'(X_22,Y_23))
      | ~ big_f('#skF_1'(X_22,Y_23),'#skF_1'(X_22,Y_23))
      | ~ big_f(X_22,Y_23) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_4,plain,
    ! [X_1,Y_2] :
      ( ~ big_g('#skF_1'(X_1,Y_2),'#skF_1'(X_1,Y_2))
      | ~ big_g(X_1,Y_2) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_83,plain,
    ! [X_26,Y_27] :
      ( ~ big_g(X_26,Y_27)
      | ~ big_f('#skF_1'(X_26,Y_27),'#skF_1'(X_26,Y_27))
      | ~ big_f(X_26,Y_27) ),
    inference(resolution,[status(thm)],[c_66,c_4]) ).

tff(c_92,plain,
    ! [X_28,Y_29] :
      ( ~ big_f(X_28,Y_29)
      | ~ big_g(X_28,Y_29) ),
    inference(resolution,[status(thm)],[c_38,c_83]) ).

tff(c_118,plain,
    ! [X_32] :
      ( ~ big_f(X_32,'#skF_1'(X_32,X_32))
      | ~ big_f(X_32,X_32) ),
    inference(resolution,[status(thm)],[c_78,c_92]) ).

tff(c_126,plain,
    ! [X_18] : ~ big_f(X_18,X_18),
    inference(resolution,[status(thm)],[c_59,c_118]) ).

tff(c_14,plain,
    ! [X_1,Y_2] :
      ( big_f('#skF_1'(X_1,Y_2),'#skF_1'(X_1,Y_2))
      | big_f(X_1,Y_2) ),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_128,plain,
    ! [X_1,Y_2] : big_f(X_1,Y_2),
    inference(negUnitSimplification,[status(thm)],[c_126,c_14]) ).

tff(c_142,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_128,c_126]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN334+1 : TPTP v9.0.0. Released v2.0.0.
% 0.12/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.12/0.33  % Computer : n011.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Apr  9 07:18:48 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 2.91/1.75  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.91/1.76  
% 2.91/1.76  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------