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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP433-1 : TPTP v8.1.2. Released v2.6.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 : n019.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:41:14 EDT 2023

% Result   : Unsatisfiable 10.02s 3.39s
% Output   : CNFRefutation 10.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   48 (  44 unt;   4 typ;   0 def)
%            Number of atoms       :   44 (  43 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :   10 (   3 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    3 (   2   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :  112 (; 112   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > #nlpp > inverse > b1 > a1

%Foreground sorts:

%Background operators:

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

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

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

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

tff(f_23,axiom,
    ! [A,B,C,D] : ( inverse(multiply(multiply(multiply(inverse(multiply(multiply(A,B),C)),A),B),multiply(D,inverse(D)))) = C ),
    file(unknown,unknown) ).

tff(f_25,axiom,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file(unknown,unknown) ).

tff(c_5,plain,
    ! [A_5,B_6,C_7,D_8] : ( inverse(multiply(multiply(multiply(inverse(multiply(multiply(A_5,B_6),C_7)),A_5),B_6),multiply(D_8,inverse(D_8)))) = C_7 ),
    inference(cnfTransformation,[status(thm)],[f_23]) ).

tff(c_2,plain,
    ! [A_1,B_2,C_3,D_4] : ( inverse(multiply(multiply(multiply(inverse(multiply(multiply(A_1,B_2),C_3)),A_1),B_2),multiply(D_4,inverse(D_4)))) = C_3 ),
    inference(cnfTransformation,[status(thm)],[f_23]) ).

tff(c_26,plain,
    ! [D_9,D_11,C_12,A_13,B_10] : ( multiply(D_9,inverse(D_9)) = inverse(multiply(multiply(multiply(C_12,multiply(inverse(multiply(multiply(A_13,B_10),C_12)),A_13)),B_10),multiply(D_11,inverse(D_11)))) ),
    inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).

tff(c_8,plain,
    ! [B_6,C_7,D_8,D_4,A_5] : ( multiply(D_8,inverse(D_8)) = inverse(multiply(multiply(multiply(C_7,multiply(inverse(multiply(multiply(A_5,B_6),C_7)),A_5)),B_6),multiply(D_4,inverse(D_4)))) ),
    inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).

tff(c_95,plain,
    ! [D_15,D_14] : ( multiply(D_15,inverse(D_15)) = multiply(D_14,inverse(D_14)) ),
    inference(superposition,[status(thm),theory(equality)],[c_26,c_8]) ).

tff(c_286,plain,
    ! [D_20,A_21,B_22,D_23] : ( inverse(multiply(multiply(multiply(inverse(multiply(D_20,inverse(D_20))),A_21),B_22),multiply(D_23,inverse(D_23)))) = inverse(multiply(A_21,B_22)) ),
    inference(superposition,[status(thm),theory(equality)],[c_95,c_2]) ).

tff(c_128,plain,
    ! [D_15,C_3,D_14,D_4] : ( inverse(multiply(multiply(multiply(inverse(multiply(multiply(D_15,inverse(D_15)),C_3)),D_14),inverse(D_14)),multiply(D_4,inverse(D_4)))) = C_3 ),
    inference(superposition,[status(thm),theory(equality)],[c_95,c_2]) ).

tff(c_425,plain,
    ! [D_24,A_25] : ( inverse(multiply(D_24,inverse(D_24))) = inverse(multiply(A_25,inverse(A_25))) ),
    inference(superposition,[status(thm),theory(equality)],[c_286,c_128]) ).

tff(c_37,plain,
    ! [D_9,D_8] : ( multiply(D_9,inverse(D_9)) = multiply(D_8,inverse(D_8)) ),
    inference(superposition,[status(thm),theory(equality)],[c_26,c_8]) ).

tff(c_499,plain,
    ! [D_24,A_25,D_9] : ( multiply(multiply(D_24,inverse(D_24)),inverse(multiply(A_25,inverse(A_25)))) = multiply(D_9,inverse(D_9)) ),
    inference(superposition,[status(thm),theory(equality)],[c_425,c_37]) ).

tff(c_312,plain,
    ! [D_15,A_21] : ( inverse(multiply(D_15,inverse(D_15))) = inverse(multiply(A_21,inverse(A_21))) ),
    inference(superposition,[status(thm),theory(equality)],[c_286,c_128]) ).

tff(c_1399,plain,
    ! [D_39,A_40,B_41,D_42] : ( multiply(D_39,inverse(D_39)) = inverse(multiply(multiply(inverse(multiply(multiply(A_40,B_41),inverse(multiply(D_42,inverse(D_42))))),A_40),B_41)) ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_286]) ).

tff(c_2075,plain,
    ! [D_48,D_49,A_50] : ( multiply(D_48,inverse(D_48)) = inverse(multiply(multiply(inverse(multiply(D_49,inverse(D_49))),A_50),inverse(A_50))) ),
    inference(superposition,[status(thm),theory(equality)],[c_312,c_1399]) ).

tff(c_3449,plain,
    ! [D_60,D_61,A_62,D_63] : ( inverse(multiply(multiply(multiply(multiply(D_60,inverse(D_60)),inverse(multiply(D_61,inverse(D_61)))),A_62),multiply(D_63,inverse(D_63)))) = inverse(A_62) ),
    inference(superposition,[status(thm),theory(equality)],[c_2075,c_2]) ).

tff(c_3740,plain,
    ! [D_9,D_61,A_62,D_63] : ( inverse(multiply(multiply(multiply(multiply(D_9,inverse(D_9)),inverse(multiply(D_61,inverse(D_61)))),A_62),multiply(D_63,inverse(D_63)))) = inverse(A_62) ),
    inference(superposition,[status(thm),theory(equality)],[c_499,c_3449]) ).

tff(c_3869,plain,
    ! [D_64,A_65,D_66] : ( inverse(multiply(multiply(multiply(D_64,inverse(D_64)),A_65),multiply(D_66,inverse(D_66)))) = inverse(A_65) ),
    inference(demodulation,[status(thm),theory(equality)],[c_499,c_3740]) ).

tff(c_141,plain,
    ! [D_14,A_1,B_2,D_4] : ( inverse(multiply(multiply(multiply(inverse(multiply(D_14,inverse(D_14))),A_1),B_2),multiply(D_4,inverse(D_4)))) = inverse(multiply(A_1,B_2)) ),
    inference(superposition,[status(thm),theory(equality)],[c_95,c_2]) ).

tff(c_3979,plain,
    ! [D_14,A_65] : ( inverse(multiply(inverse(inverse(multiply(D_14,inverse(D_14)))),A_65)) = inverse(A_65) ),
    inference(superposition,[status(thm),theory(equality)],[c_3869,c_141]) ).

tff(c_3996,plain,
    ! [D_15,C_3] : ( inverse(inverse(inverse(inverse(multiply(multiply(D_15,inverse(D_15)),C_3))))) = C_3 ),
    inference(superposition,[status(thm),theory(equality)],[c_3869,c_128]) ).

tff(c_2285,plain,
    ! [D_48,D_49,A_50,D_4] : ( inverse(multiply(multiply(multiply(multiply(D_48,inverse(D_48)),inverse(multiply(D_49,inverse(D_49)))),A_50),multiply(D_4,inverse(D_4)))) = inverse(A_50) ),
    inference(superposition,[status(thm),theory(equality)],[c_2075,c_2]) ).

tff(c_4525,plain,
    ! [D_69,C_70] : ( inverse(inverse(inverse(inverse(multiply(multiply(D_69,inverse(D_69)),C_70))))) = C_70 ),
    inference(superposition,[status(thm),theory(equality)],[c_3869,c_128]) ).

tff(c_4668,plain,
    ! [D_4,D_48,D_49] : ( multiply(D_4,inverse(D_4)) = inverse(inverse(inverse(inverse(inverse(multiply(multiply(D_48,inverse(D_48)),inverse(multiply(D_49,inverse(D_49))))))))) ),
    inference(superposition,[status(thm),theory(equality)],[c_2285,c_4525]) ).

tff(c_4801,plain,
    ! [D_71,D_72] : ( multiply(D_71,inverse(D_71)) = inverse(inverse(multiply(D_72,inverse(D_72)))) ),
    inference(demodulation,[status(thm),theory(equality)],[c_3996,c_4668]) ).

tff(c_4822,plain,
    ! [D_72,C_3] : ( inverse(inverse(inverse(inverse(multiply(inverse(inverse(multiply(D_72,inverse(D_72)))),C_3))))) = C_3 ),
    inference(superposition,[status(thm),theory(equality)],[c_4801,c_3996]) ).

tff(c_5291,plain,
    ! [C_73] : ( inverse(inverse(inverse(inverse(C_73)))) = C_73 ),
    inference(demodulation,[status(thm),theory(equality)],[c_3979,c_4822]) ).

tff(c_5315,plain,
    ! [D_15,C_3] : ( multiply(multiply(D_15,inverse(D_15)),C_3) = C_3 ),
    inference(superposition,[status(thm),theory(equality)],[c_5291,c_3996]) ).

tff(c_5276,plain,
    ! [C_3] : ( inverse(inverse(inverse(inverse(C_3)))) = C_3 ),
    inference(demodulation,[status(thm),theory(equality)],[c_3979,c_4822]) ).

tff(c_3856,plain,
    ! [D_9,A_62,D_63] : ( inverse(multiply(multiply(multiply(D_9,inverse(D_9)),A_62),multiply(D_63,inverse(D_63)))) = inverse(A_62) ),
    inference(demodulation,[status(thm),theory(equality)],[c_499,c_3740]) ).

tff(c_6602,plain,
    ! [A_87,D_88] : ( inverse(multiply(A_87,multiply(D_88,inverse(D_88)))) = inverse(A_87) ),
    inference(demodulation,[status(thm),theory(equality)],[c_5315,c_3856]) ).

tff(c_6629,plain,
    ! [A_87,D_88] : ( multiply(A_87,multiply(D_88,inverse(D_88))) = inverse(inverse(inverse(inverse(A_87)))) ),
    inference(superposition,[status(thm),theory(equality)],[c_6602,c_5276]) ).

tff(c_6826,plain,
    ! [A_89,D_90] : ( multiply(A_89,multiply(D_90,inverse(D_90))) = A_89 ),
    inference(demodulation,[status(thm),theory(equality)],[c_5276,c_6629]) ).

tff(c_6900,plain,
    ! [A_89,D_15] : ( multiply(A_89,inverse(multiply(D_15,inverse(D_15)))) = A_89 ),
    inference(superposition,[status(thm),theory(equality)],[c_5315,c_6826]) ).

tff(c_6809,plain,
    ! [A_87,D_88] : ( multiply(A_87,multiply(D_88,inverse(D_88))) = A_87 ),
    inference(demodulation,[status(thm),theory(equality)],[c_5276,c_6629]) ).

tff(c_7167,plain,
    ! [A_93,B_94,C_95] : ( inverse(multiply(multiply(inverse(multiply(multiply(A_93,B_94),C_95)),A_93),B_94)) = C_95 ),
    inference(superposition,[status(thm),theory(equality)],[c_6602,c_2]) ).

tff(c_7293,plain,
    ! [D_9,C_95,D_24,A_25] : ( inverse(multiply(multiply(inverse(multiply(multiply(D_9,inverse(D_9)),C_95)),multiply(D_24,inverse(D_24))),inverse(multiply(A_25,inverse(A_25))))) = C_95 ),
    inference(superposition,[status(thm),theory(equality)],[c_499,c_7167]) ).

tff(c_7344,plain,
    ! [C_96] : ( inverse(inverse(C_96)) = C_96 ),
    inference(demodulation,[status(thm),theory(equality)],[c_6900,c_6809,c_5315,c_7293]) ).

tff(c_7392,plain,
    ! [C_96,D_9] : ( multiply(inverse(C_96),C_96) = multiply(D_9,inverse(D_9)) ),
    inference(superposition,[status(thm),theory(equality)],[c_7344,c_37]) ).

tff(c_8823,plain,
    ! [A_113,C_114] : ( multiply(A_113,inverse(multiply(inverse(C_114),C_114))) = A_113 ),
    inference(superposition,[status(thm),theory(equality)],[c_7344,c_6900]) ).

tff(c_10084,plain,
    ! [C_125,C_124] : ( multiply(inverse(C_125),C_125) = multiply(inverse(C_124),C_124) ),
    inference(superposition,[status(thm),theory(equality)],[c_7392,c_8823]) ).

tff(c_4,plain,
    multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
    inference(cnfTransformation,[status(thm)],[f_25]) ).

tff(c_10204,plain,
    ! [C_125] : ( multiply(inverse(a1),a1) != multiply(inverse(C_125),C_125) ),
    inference(superposition,[status(thm),theory(equality)],[c_10084,c_4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : GRP433-1 : TPTP v8.1.2. Released v2.6.0.
% 0.14/0.15  % 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.36  % Computer : n019.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 22:04:46 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 10.02/3.39  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.02/3.40  
% 10.02/3.40  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 10.21/3.43  
% 10.21/3.43  Inference rules
% 10.21/3.43  ----------------------
% 10.21/3.43  #Ref     : 1
% 10.21/3.43  #Sup     : 3298
% 10.21/3.43  #Fact    : 0
% 10.21/3.43  #Define  : 0
% 10.21/3.43  #Split   : 0
% 10.21/3.43  #Chain   : 0
% 10.21/3.43  #Close   : 0
% 10.21/3.43  
% 10.21/3.43  Ordering : KBO
% 10.21/3.43  
% 10.21/3.43  Simplification rules
% 10.21/3.43  ----------------------
% 10.21/3.43  #Subsume      : 336
% 10.21/3.43  #Demod        : 1116
% 10.21/3.43  #Tautology    : 397
% 10.21/3.43  #SimpNegUnit  : 0
% 10.21/3.43  #BackRed      : 17
% 10.21/3.43  
% 10.21/3.43  #Partial instantiations: 0
% 10.21/3.43  #Strategies tried      : 1
% 10.21/3.43  
% 10.21/3.43  Timing (in seconds)
% 10.21/3.43  ----------------------
% 10.21/3.43  Preprocessing        : 0.38
% 10.21/3.43  Parsing              : 0.19
% 10.21/3.43  CNF conversion       : 0.02
% 10.21/3.43  Main loop            : 1.97
% 10.21/3.43  Inferencing          : 0.72
% 10.21/3.44  Reduction            : 0.78
% 10.21/3.44  Demodulation         : 0.69
% 10.21/3.44  BG Simplification    : 0.12
% 10.21/3.44  Subsumption          : 0.22
% 10.21/3.44  Abstraction          : 0.16
% 10.21/3.44  MUC search           : 0.00
% 10.21/3.44  Cooper               : 0.00
% 10.21/3.44  Total                : 2.41
% 10.21/3.44  Index Insertion      : 0.00
% 10.21/3.44  Index Deletion       : 0.00
% 10.21/3.44  Index Matching       : 0.00
% 10.21/3.44  BG Taut test         : 0.00
%------------------------------------------------------------------------------