TSTP Solution File: HEN003-5 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : HEN003-5 : TPTP v8.1.2. 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 : n021.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 : Tue Aug 22 10:42:12 EDT 2023

% Result   : Unsatisfiable 2.84s 1.70s
% Output   : CNFRefutation 2.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   20 (  12 unt;   4 typ;   0 def)
%            Number of atoms       :   22 (  21 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  :    2 (   1   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   26 (;  26   !;   0   ?;   0   :)

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

%Foreground sorts:

%Background operators:

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

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

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

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

tff(f_51,axiom,
    ! [X,Y] : ( divide(divide(X,Y),X) = 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_66,axiom,
    ! [X,Y] :
      ( ( divide(X,Y) != zero )
      | ( divide(Y,X) != zero )
      | ( X = Y ) ),
    file(unknown,unknown) ).

tff(f_74,axiom,
    divide(a,a) != zero,
    file(unknown,unknown) ).

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,
    ! [X_16,Z_17,Y_18] : ( divide(divide(divide(X_16,Z_17),divide(Y_18,Z_17)),divide(divide(X_16,Y_18),Z_17)) = zero ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

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

tff(c_209,plain,
    ! [X_23,Y_24] : ( divide(divide(divide(X_23,X_23),divide(Y_24,X_23)),zero) = zero ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_76]) ).

tff(c_66,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_73,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_66]) ).

tff(c_217,plain,
    ! [X_23,Y_24] :
      ( ( divide(divide(divide(X_23,X_23),divide(Y_24,X_23)),zero) = divide(divide(X_23,X_23),divide(Y_24,X_23)) )
      | ( divide(divide(divide(X_23,X_23),divide(Y_24,X_23)),zero) != zero ) ),
    inference(superposition,[status(thm),theory(equality)],[c_209,c_73]) ).

tff(c_281,plain,
    ! [X_25,Y_26] : ( divide(divide(X_25,X_25),divide(Y_26,X_25)) = zero ),
    inference(demodulation,[status(thm),theory(equality)],[c_125,c_125,c_217]) ).

tff(c_297,plain,
    ! [X_25] : ( divide(divide(X_25,X_25),X_25) = divide(X_25,X_25) ),
    inference(superposition,[status(thm),theory(equality)],[c_281,c_73]) ).

tff(c_351,plain,
    ! [X_25] : ( divide(X_25,X_25) = zero ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_297]) ).

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

tff(c_366,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_351,c_12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : HEN003-5 : TPTP v8.1.2. Released v1.0.0.
% 0.00/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.18/0.35  % Computer : n021.cluster.edu
% 0.18/0.35  % Model    : x86_64 x86_64
% 0.18/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35  % Memory   : 8042.1875MB
% 0.18/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35  % CPULimit : 300
% 0.18/0.35  % WCLimit  : 300
% 0.18/0.35  % DateTime : Thu Aug  3 13:10:21 EDT 2023
% 0.18/0.35  % CPUTime  : 
% 2.84/1.70  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.84/1.70  
% 2.84/1.70  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.84/1.74  
% 2.84/1.74  Inference rules
% 2.84/1.74  ----------------------
% 2.84/1.74  #Ref     : 0
% 2.84/1.74  #Sup     : 88
% 2.84/1.74  #Fact    : 0
% 2.84/1.74  #Define  : 0
% 2.84/1.74  #Split   : 0
% 2.84/1.74  #Chain   : 0
% 2.84/1.74  #Close   : 0
% 2.84/1.74  
% 2.84/1.74  Ordering : KBO
% 2.84/1.74  
% 2.84/1.74  Simplification rules
% 2.84/1.74  ----------------------
% 2.84/1.74  #Subsume      : 4
% 2.84/1.74  #Demod        : 84
% 2.84/1.74  #Tautology    : 52
% 2.84/1.74  #SimpNegUnit  : 0
% 2.84/1.74  #BackRed      : 3
% 2.84/1.74  
% 2.84/1.74  #Partial instantiations: 0
% 2.84/1.74  #Strategies tried      : 1
% 2.84/1.74  
% 2.84/1.74  Timing (in seconds)
% 2.84/1.74  ----------------------
% 2.84/1.74  Preprocessing        : 0.39
% 2.84/1.74  Parsing              : 0.22
% 2.84/1.74  CNF conversion       : 0.02
% 2.84/1.74  Main loop            : 0.29
% 2.84/1.74  Inferencing          : 0.11
% 2.84/1.74  Reduction            : 0.09
% 2.84/1.74  Demodulation         : 0.07
% 2.84/1.74  BG Simplification    : 0.01
% 2.84/1.74  Subsumption          : 0.05
% 2.84/1.74  Abstraction          : 0.01
% 2.84/1.74  MUC search           : 0.00
% 2.84/1.74  Cooper               : 0.00
% 2.84/1.74  Total                : 0.73
% 2.84/1.74  Index Insertion      : 0.00
% 2.84/1.74  Index Deletion       : 0.00
% 2.84/1.74  Index Matching       : 0.00
% 2.84/1.74  BG Taut test         : 0.00
%------------------------------------------------------------------------------