↑ Up

Beagle---0.9.52.UNS-CRf.s

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

% Result   : Unsatisfiable 4.15s 2.06s
% Output   : CNFRefutation 4.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   21 (  21 unt;   0 typ;   0 def)
%            Number of atoms       :   21 (  20 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    5 (   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 > d > 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(d,type,
    d: $i ).

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

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

tff(f_77,axiom,
    divide(divide(a,d),b) != zero,
    file(unknown,unknown) ).

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

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

tff(f_75,axiom,
    divide(divide(a,b),d) = 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(c_16,plain,
    divide(divide(a,d),b) != zero,
    inference(cnfTransformation,[status(thm)],[f_77]) ).

tff(c_12,plain,
    ! [X_10] : ( divide(X_10,zero) = X_10 ),
    inference(cnfTransformation,[status(thm)],[f_74]) ).

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

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

tff(c_188,plain,
    ! [X_20,Z_21,Y_22] : ( divide(divide(divide(X_20,Z_21),divide(Y_22,Z_21)),divide(divide(X_20,Y_22),Z_21)) = zero ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_233,plain,
    divide(divide(divide(a,d),divide(b,d)),zero) = zero,
    inference(superposition,[status(thm),theory(equality)],[c_14,c_188]) ).

tff(c_4,plain,
    ! [X_3,Z_4,Y_5] : ( divide(divide(divide(X_3,Z_4),divide(Y_5,Z_4)),divide(divide(X_3,Y_5),Z_4)) = zero ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_770,plain,
    divide(divide(divide(divide(a,d),zero),divide(divide(b,d),zero)),zero) = zero,
    inference(superposition,[status(thm),theory(equality)],[c_233,c_4]) ).

tff(c_792,plain,
    divide(divide(a,d),divide(b,d)) = zero,
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_12,c_12,c_770]) ).

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_256,plain,
    ! [X_20,X_1,Y_2] : ( divide(divide(divide(X_20,X_1),zero),divide(divide(X_20,divide(X_1,Y_2)),X_1)) = zero ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_188]) ).

tff(c_2047,plain,
    ! [X_45,X_46,Y_47] : ( divide(divide(X_45,X_46),divide(divide(X_45,divide(X_46,Y_47)),X_46)) = zero ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_256]) ).

tff(c_2175,plain,
    divide(divide(divide(a,d),b),divide(zero,b)) = zero,
    inference(superposition,[status(thm),theory(equality)],[c_792,c_2047]) ).

tff(c_2310,plain,
    divide(divide(a,d),b) = zero,
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_6,c_2175]) ).

tff(c_2312,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_16,c_2310]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : HEN006-5 : TPTP v9.0.0. Released v1.0.0.
% 0.11/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 : n007.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:23 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 4.15/2.06  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.15/2.07  
% 4.15/2.07  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------