↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : HEN008-5 : TPTP v9.0.0. Released v1.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 06:45:55 PM UTC 2025

% Result   : Unsatisfiable 2.83s 1.68s
% Output   : CNFRefutation 2.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   19 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :   25 (  24 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   14 (   8   ~;   6   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   23 (  23   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ divide > #nlpp > zero > identity > c > b > a

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(a,type,
    a: $i ).

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

tff(b,type,
    b: $i ).

tff(identity,type,
    identity: $i ).

tff(zero,type,
    zero: $i ).

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

tff(f_57,axiom,
    ! [X] : ( divide(zero,X) = zero ),
    file(unknown,unknown) ).

tff(f_73,axiom,
    divide(a,b) = zero,
    file(unknown,unknown) ).

tff(f_54,axiom,
    ! [X,Z,Y] : ( divide(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)) = zero ),
    file(unknown,unknown) ).

tff(f_51,axiom,
    ! [X,Y] : ( divide(divide(X,Y),X) = zero ),
    file(unknown,unknown) ).

tff(f_66,axiom,
    ! [X,Y] :
      ( ( divide(X,Y) != zero )
      | ( divide(Y,X) != zero )
      | ( X = Y ) ),
    file(unknown,unknown) ).

tff(f_75,axiom,
    divide(divide(a,c),divide(b,c)) != zero,
    file(unknown,unknown) ).

tff(c_6,plain,
    ! [X_6] : ( divide(zero,X_6) = zero ),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_12,plain,
    divide(a,b) = zero,
    inference(cnfTransformation,[status(thm)],[f_73]) ).

tff(c_97,plain,
    ! [X_17,Z_18,Y_19] : ( divide(divide(divide(X_17,Z_18),divide(Y_19,Z_18)),divide(divide(X_17,Y_19),Z_18)) = zero ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_177,plain,
    ! [Z_18] : ( divide(divide(divide(a,Z_18),divide(b,Z_18)),divide(zero,Z_18)) = zero ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_97]) ).

tff(c_196,plain,
    ! [Z_18] : ( divide(divide(divide(a,Z_18),divide(b,Z_18)),zero) = zero ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_177]) ).

tff(c_238,plain,
    ! [Z_23] : ( divide(divide(divide(a,Z_23),divide(b,Z_23)),zero) = zero ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_177]) ).

tff(c_2,plain,
    ! [X_1,Y_2] : ( divide(divide(X_1,Y_2),X_1) = zero ),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_76,plain,
    ! [Y_14,X_15] :
      ( ( Y_14 = X_15 )
      | ( divide(Y_14,X_15) != zero )
      | ( divide(X_15,Y_14) != zero ) ),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_85,plain,
    ! [X_1,Y_2] :
      ( ( divide(X_1,Y_2) = X_1 )
      | ( divide(X_1,divide(X_1,Y_2)) != zero ) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_76]) ).

tff(c_243,plain,
    ! [Z_23] :
      ( ( divide(divide(divide(a,Z_23),divide(b,Z_23)),zero) = divide(divide(a,Z_23),divide(b,Z_23)) )
      | ( divide(divide(divide(a,Z_23),divide(b,Z_23)),zero) != zero ) ),
    inference(superposition,[status(thm),theory(equality)],[c_238,c_85]) ).

tff(c_279,plain,
    ! [Z_23] : ( divide(divide(a,Z_23),divide(b,Z_23)) = zero ),
    inference(demodulation,[status(thm),theory(equality)],[c_196,c_196,c_243]) ).

tff(c_14,plain,
    divide(divide(a,c),divide(b,c)) != zero,
    inference(cnfTransformation,[status(thm)],[f_75]) ).

tff(c_295,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_279,c_14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : HEN008-5 : TPTP v9.0.0. Released v1.0.0.
% 0.04/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.13/0.34  % Computer : n011.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Mon Apr  7 22:51:33 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 2.83/1.68  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.83/1.68  
% 2.83/1.68  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------