TSTP Solution File: BOO029-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : BOO029-1 : TPTP v8.1.2. Released v2.2.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 : n008.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:34:28 EDT 2023

% Result   : Unsatisfiable 53.58s 40.20s
% Output   : CNFRefutation 53.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   39 (  34 unt;   5 typ;   0 def)
%            Number of atoms       :   34 (  33 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    5 (   3   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   78 (;  78   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > add > #nlpp > inverse > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

tff(f_40,axiom,
    ! [X,Y] : ( add(X,Y) = add(Y,X) ),
    file(unknown,unknown) ).

tff(f_26,axiom,
    ! [X,Y,Z] : ( add(X,multiply(Y,multiply(X,Z))) = X ),
    file(unknown,unknown) ).

tff(f_28,axiom,
    ! [X,Y,Z] : ( add(add(multiply(X,Y),multiply(Y,Z)),Y) = Y ),
    file(unknown,unknown) ).

tff(f_37,axiom,
    ! [X,Y] : ( add(multiply(X,Y),multiply(X,inverse(Y))) = X ),
    file(unknown,unknown) ).

tff(f_44,axiom,
    ! [X,Y,Z] : ( add(add(X,Y),Z) = add(X,add(Y,Z)) ),
    file(unknown,unknown) ).

tff(f_33,axiom,
    ! [X,Y,Z] : ( multiply(X,add(Y,add(X,Z))) = X ),
    file(unknown,unknown) ).

tff(f_35,axiom,
    ! [X,Y,Z] : ( multiply(multiply(add(X,Y),add(Y,Z)),Y) = Y ),
    file(unknown,unknown) ).

tff(f_49,axiom,
    add(b,inverse(b)) != add(a,inverse(a)),
    file(unknown,unknown) ).

tff(c_14,plain,
    ! [Y_18,X_17] : ( add(Y_18,X_17) = add(X_17,Y_18) ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_2,plain,
    ! [X_1,Y_2,Z_3] : ( add(X_1,multiply(Y_2,multiply(X_1,Z_3))) = X_1 ),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_1518,plain,
    ! [X_75,Y_76,Z_77] : ( add(add(multiply(X_75,Y_76),multiply(Y_76,Z_77)),Y_76) = Y_76 ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_1662,plain,
    ! [X_75,Y_2] : ( add(multiply(X_75,Y_2),Y_2) = Y_2 ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_1518]) ).

tff(c_12,plain,
    ! [X_15,Y_16] : ( add(multiply(X_15,Y_16),multiply(X_15,inverse(Y_16))) = X_15 ),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_566,plain,
    ! [X_54,Y_55,Z_56] : ( add(add(X_54,Y_55),Z_56) = add(X_54,add(Y_55,Z_56)) ),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_33455,plain,
    ! [X_275,Y_276,Z_277] : ( add(multiply(X_275,Y_276),add(multiply(X_275,inverse(Y_276)),Z_277)) = add(X_275,Z_277) ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_566]) ).

tff(c_79780,plain,
    ! [X_413,Y_414] : ( add(multiply(X_413,Y_414),inverse(Y_414)) = add(X_413,inverse(Y_414)) ),
    inference(superposition,[status(thm),theory(equality)],[c_1662,c_33455]) ).

tff(c_112,plain,
    ! [X_34,Y_35,Z_36] : ( multiply(X_34,add(Y_35,add(X_34,Z_36))) = X_34 ),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_118,plain,
    ! [X_34,Y_2] : ( add(X_34,multiply(Y_2,X_34)) = X_34 ),
    inference(superposition,[status(thm),theory(equality)],[c_112,c_2]) ).

tff(c_10401,plain,
    ! [X_160,X_158,Y_159] : ( add(X_160,add(X_158,Y_159)) = add(X_158,add(Y_159,X_160)) ),
    inference(superposition,[status(thm),theory(equality)],[c_14,c_566]) ).

tff(c_11088,plain,
    ! [X_34,Y_2,X_160] : ( add(X_34,add(multiply(Y_2,X_34),X_160)) = add(X_160,X_34) ),
    inference(superposition,[status(thm),theory(equality)],[c_118,c_10401]) ).

tff(c_79840,plain,
    ! [Y_414,X_413] : ( add(Y_414,add(X_413,inverse(Y_414))) = add(inverse(Y_414),Y_414) ),
    inference(superposition,[status(thm),theory(equality)],[c_79780,c_11088]) ).

tff(c_161757,plain,
    ! [Y_583,X_584] : ( add(Y_583,add(X_584,inverse(Y_583))) = add(Y_583,inverse(Y_583)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_14,c_79840]) ).

tff(c_18,plain,
    ! [X_21,Y_22,Z_23] : ( add(add(X_21,Y_22),Z_23) = add(X_21,add(Y_22,Z_23)) ),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_8,plain,
    ! [X_9,Y_10,Z_11] : ( multiply(X_9,add(Y_10,add(X_9,Z_11))) = X_9 ),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_1138,plain,
    ! [X_68,Y_69,Z_70] : ( multiply(multiply(add(X_68,Y_69),add(Y_69,Z_70)),Y_69) = Y_69 ),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_1303,plain,
    ! [X_71,Y_72] : ( multiply(add(X_71,Y_72),Y_72) = Y_72 ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_1138]) ).

tff(c_2279,plain,
    ! [X_87,Y_88,Z_89] : ( multiply(add(X_87,add(Y_88,Z_89)),Z_89) = Z_89 ),
    inference(superposition,[status(thm),theory(equality)],[c_18,c_1303]) ).

tff(c_2421,plain,
    ! [X_87,Y_18,X_17] : ( multiply(add(X_87,add(Y_18,X_17)),Y_18) = Y_18 ),
    inference(superposition,[status(thm),theory(equality)],[c_14,c_2279]) ).

tff(c_162280,plain,
    ! [Y_583,X_584] : ( multiply(add(Y_583,inverse(Y_583)),X_584) = X_584 ),
    inference(superposition,[status(thm),theory(equality)],[c_161757,c_2421]) ).

tff(c_165994,plain,
    ! [X_590,Y_591] : ( multiply(X_590,add(Y_591,inverse(Y_591))) = X_590 ),
    inference(superposition,[status(thm),theory(equality)],[c_161757,c_8]) ).

tff(c_170069,plain,
    ! [Y_599,Y_598] : ( add(Y_599,inverse(Y_599)) = add(Y_598,inverse(Y_598)) ),
    inference(superposition,[status(thm),theory(equality)],[c_162280,c_165994]) ).

tff(c_22,plain,
    add(b,inverse(b)) != add(a,inverse(a)),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_171113,plain,
    ! [Y_599] : ( add(a,inverse(a)) != add(Y_599,inverse(Y_599)) ),
    inference(superposition,[status(thm),theory(equality)],[c_170069,c_22]) ).

tff(c_172331,plain,
    $false,
    inference(reflexivity,[status(thm),theory(equality)],[c_171113]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : BOO029-1 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.14  % 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.14/0.35  % Computer : n008.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 18:38:04 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 53.58/40.20  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 53.58/40.21  
% 53.58/40.21  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 53.58/40.24  
% 53.58/40.24  Inference rules
% 53.58/40.24  ----------------------
% 53.58/40.24  #Ref     : 1
% 53.58/40.24  #Sup     : 43598
% 53.58/40.24  #Fact    : 0
% 53.58/40.24  #Define  : 0
% 53.58/40.24  #Split   : 0
% 53.58/40.24  #Chain   : 0
% 53.58/40.24  #Close   : 0
% 53.58/40.24  
% 53.58/40.24  Ordering : KBO
% 53.58/40.24  
% 53.58/40.24  Simplification rules
% 53.58/40.24  ----------------------
% 53.58/40.24  #Subsume      : 1744
% 53.58/40.24  #Demod        : 74719
% 53.58/40.24  #Tautology    : 17447
% 53.58/40.24  #SimpNegUnit  : 0
% 53.58/40.24  #BackRed      : 3
% 53.58/40.24  
% 53.58/40.24  #Partial instantiations: 0
% 53.58/40.24  #Strategies tried      : 1
% 53.58/40.24  
% 53.58/40.24  Timing (in seconds)
% 53.58/40.24  ----------------------
% 53.58/40.24  Preprocessing        : 0.45
% 53.58/40.24  Parsing              : 0.23
% 53.58/40.24  CNF conversion       : 0.02
% 53.58/40.24  Main loop            : 38.72
% 53.58/40.24  Inferencing          : 3.49
% 53.58/40.24  Reduction            : 29.59
% 53.58/40.24  Demodulation         : 28.58
% 53.58/40.24  BG Simplification    : 0.49
% 53.58/40.24  Subsumption          : 4.13
% 53.58/40.24  Abstraction          : 1.15
% 53.58/40.24  MUC search           : 0.00
% 53.58/40.24  Cooper               : 0.00
% 53.58/40.24  Total                : 39.21
% 53.58/40.24  Index Insertion      : 0.00
% 53.58/40.24  Index Deletion       : 0.00
% 53.58/40.24  Index Matching       : 0.00
% 53.58/40.24  BG Taut test         : 0.00
%------------------------------------------------------------------------------