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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP582-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n016.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:34 EDT 2023

% Result   : Unsatisfiable 4.40s 2.22s
% Output   : CNFRefutation 4.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   48 (  43 unt;   5 typ;   0 def)
%            Number of atoms       :   43 (  42 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    7 (   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   :   64 (;  64   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > double_divide > #nlpp > inverse > identity > a2

%Foreground sorts:

%Background operators:

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

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

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

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

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

tff(f_29,axiom,
    ! [A] : ( identity = double_divide(A,inverse(A)) ),
    file(unknown,unknown) ).

tff(f_27,axiom,
    ! [A] : ( inverse(A) = double_divide(A,identity) ),
    file(unknown,unknown) ).

tff(f_25,axiom,
    ! [A,B] : ( multiply(A,B) = double_divide(double_divide(B,A),identity) ),
    file(unknown,unknown) ).

tff(f_23,axiom,
    ! [A,B,C] : ( double_divide(double_divide(A,double_divide(double_divide(identity,B),double_divide(C,double_divide(B,A)))),double_divide(identity,identity)) = C ),
    file(unknown,unknown) ).

tff(f_31,axiom,
    multiply(identity,a2) != a2,
    file(unknown,unknown) ).

tff(c_8,plain,
    ! [A_7] : ( double_divide(A_7,inverse(A_7)) = identity ),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_6,plain,
    ! [A_6] : ( double_divide(A_6,identity) = inverse(A_6) ),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_28,plain,
    ! [B_10,A_11] : ( double_divide(double_divide(B_10,A_11),identity) = multiply(A_11,B_10) ),
    inference(cnfTransformation,[status(thm)],[f_25]) ).

tff(c_52,plain,
    ! [A_7] : ( multiply(inverse(A_7),A_7) = double_divide(identity,identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_28]) ).

tff(c_57,plain,
    ! [A_7] : ( multiply(inverse(A_7),A_7) = inverse(identity) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_52]) ).

tff(c_49,plain,
    ! [B_10,A_11] : ( inverse(double_divide(B_10,A_11)) = multiply(A_11,B_10) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_28]) ).

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

tff(c_65,plain,
    ! [A_13,B_14,C_15] : ( double_divide(double_divide(A_13,double_divide(double_divide(identity,B_14),double_divide(C_15,double_divide(B_14,A_13)))),inverse(identity)) = C_15 ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_2]) ).

tff(c_551,plain,
    ! [A_33,C_34] : ( double_divide(double_divide(identity,double_divide(double_divide(identity,A_33),double_divide(C_34,inverse(A_33)))),inverse(identity)) = C_34 ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_65]) ).

tff(c_610,plain,
    ! [A_7] : ( double_divide(double_divide(identity,double_divide(double_divide(identity,A_7),identity)),inverse(identity)) = A_7 ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_551]) ).

tff(c_622,plain,
    ! [A_35] : ( double_divide(double_divide(identity,multiply(A_35,identity)),inverse(identity)) = A_35 ),
    inference(demodulation,[status(thm),theory(equality)],[c_49,c_6,c_610]) ).

tff(c_656,plain,
    double_divide(double_divide(identity,inverse(identity)),inverse(identity)) = inverse(identity),
    inference(superposition,[status(thm),theory(equality)],[c_57,c_622]) ).

tff(c_661,plain,
    inverse(identity) = identity,
    inference(demodulation,[status(thm),theory(equality)],[c_8,c_8,c_656]) ).

tff(c_621,plain,
    ! [A_7] : ( double_divide(double_divide(identity,multiply(A_7,identity)),inverse(identity)) = A_7 ),
    inference(demodulation,[status(thm),theory(equality)],[c_49,c_6,c_610]) ).

tff(c_849,plain,
    ! [A_41] : ( double_divide(double_divide(identity,multiply(A_41,identity)),identity) = A_41 ),
    inference(demodulation,[status(thm),theory(equality)],[c_661,c_621]) ).

tff(c_4,plain,
    ! [B_5,A_4] : ( double_divide(double_divide(B_5,A_4),identity) = multiply(A_4,B_5) ),
    inference(cnfTransformation,[status(thm)],[f_25]) ).

tff(c_867,plain,
    ! [A_41] : ( multiply(multiply(A_41,identity),identity) = A_41 ),
    inference(superposition,[status(thm),theory(equality)],[c_849,c_4]) ).

tff(c_102,plain,
    ! [B_16,A_17] : ( inverse(double_divide(B_16,A_17)) = multiply(A_17,B_16) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_28]) ).

tff(c_108,plain,
    ! [A_17,B_16] : ( multiply(multiply(A_17,B_16),double_divide(B_16,A_17)) = inverse(identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_102,c_57]) ).

tff(c_1144,plain,
    ! [A_46,B_47] : ( multiply(multiply(A_46,B_47),double_divide(B_47,A_46)) = identity ),
    inference(demodulation,[status(thm),theory(equality)],[c_661,c_108]) ).

tff(c_1166,plain,
    ! [A_41] : ( multiply(A_41,double_divide(identity,multiply(A_41,identity))) = identity ),
    inference(superposition,[status(thm),theory(equality)],[c_867,c_1144]) ).

tff(c_945,plain,
    ! [A_43] : ( inverse(double_divide(identity,multiply(A_43,identity))) = A_43 ),
    inference(superposition,[status(thm),theory(equality)],[c_849,c_6]) ).

tff(c_975,plain,
    ! [A_43] : ( double_divide(double_divide(identity,multiply(A_43,identity)),A_43) = identity ),
    inference(superposition,[status(thm),theory(equality)],[c_945,c_8]) ).

tff(c_31,plain,
    ! [B_10,A_11] : ( multiply(identity,double_divide(B_10,A_11)) = double_divide(multiply(A_11,B_10),identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_28,c_4]) ).

tff(c_53,plain,
    ! [B_10,A_11] : ( multiply(identity,double_divide(B_10,A_11)) = inverse(multiply(A_11,B_10)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_31]) ).

tff(c_74,plain,
    ! [A_13,B_14,C_15] : ( multiply(inverse(identity),double_divide(A_13,double_divide(double_divide(identity,B_14),double_divide(C_15,double_divide(B_14,A_13))))) = double_divide(C_15,identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_65,c_4]) ).

tff(c_99,plain,
    ! [A_13,B_14,C_15] : ( multiply(inverse(identity),double_divide(A_13,double_divide(double_divide(identity,B_14),double_divide(C_15,double_divide(B_14,A_13))))) = inverse(C_15) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_74]) ).

tff(c_1228,plain,
    ! [B_48,C_49,A_50] : ( inverse(multiply(double_divide(double_divide(identity,B_48),double_divide(C_49,double_divide(B_48,A_50))),A_50)) = inverse(C_49) ),
    inference(demodulation,[status(thm),theory(equality)],[c_53,c_661,c_99]) ).

tff(c_1265,plain,
    ! [B_48,A_50] : ( inverse(multiply(double_divide(double_divide(identity,B_48),identity),A_50)) = inverse(double_divide(identity,multiply(double_divide(B_48,A_50),identity))) ),
    inference(superposition,[status(thm),theory(equality)],[c_975,c_1228]) ).

tff(c_2820,plain,
    ! [B_76,A_77] : ( inverse(multiply(multiply(B_76,identity),A_77)) = double_divide(B_76,A_77) ),
    inference(demodulation,[status(thm),theory(equality)],[c_867,c_49,c_49,c_6,c_1265]) ).

tff(c_2885,plain,
    ! [B_76] : ( double_divide(B_76,double_divide(identity,multiply(multiply(B_76,identity),identity))) = inverse(identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_1166,c_2820]) ).

tff(c_3094,plain,
    ! [B_80] : ( double_divide(B_80,double_divide(identity,B_80)) = identity ),
    inference(demodulation,[status(thm),theory(equality)],[c_867,c_661,c_2885]) ).

tff(c_94,plain,
    ! [A_13,C_15] : ( double_divide(double_divide(A_13,double_divide(identity,double_divide(C_15,double_divide(inverse(identity),A_13)))),inverse(identity)) = C_15 ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_65]) ).

tff(c_791,plain,
    ! [C_15,A_13] : ( multiply(double_divide(identity,double_divide(C_15,double_divide(identity,A_13))),A_13) = C_15 ),
    inference(demodulation,[status(thm),theory(equality)],[c_49,c_6,c_661,c_661,c_94]) ).

tff(c_3181,plain,
    ! [B_80] : ( multiply(double_divide(identity,identity),B_80) = B_80 ),
    inference(superposition,[status(thm),theory(equality)],[c_3094,c_791]) ).

tff(c_3240,plain,
    ! [B_80] : ( multiply(identity,B_80) = B_80 ),
    inference(demodulation,[status(thm),theory(equality)],[c_661,c_6,c_3181]) ).

tff(c_10,plain,
    multiply(identity,a2) != a2,
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_3266,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_3240,c_10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : GRP582-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.12  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.12/0.33  % Computer : n016.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.34  % DateTime : Thu Aug  3 22:29:08 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 4.40/2.22  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.40/2.23  
% 4.40/2.23  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.40/2.26  
% 4.40/2.26  Inference rules
% 4.40/2.26  ----------------------
% 4.40/2.26  #Ref     : 0
% 4.40/2.26  #Sup     : 821
% 4.40/2.26  #Fact    : 0
% 4.40/2.26  #Define  : 0
% 4.40/2.26  #Split   : 0
% 4.40/2.26  #Chain   : 0
% 4.40/2.26  #Close   : 0
% 4.40/2.26  
% 4.40/2.26  Ordering : KBO
% 4.40/2.26  
% 4.40/2.26  Simplification rules
% 4.40/2.26  ----------------------
% 4.40/2.26  #Subsume      : 0
% 4.40/2.26  #Demod        : 1283
% 4.40/2.26  #Tautology    : 453
% 4.40/2.26  #SimpNegUnit  : 0
% 4.40/2.26  #BackRed      : 24
% 4.40/2.26  
% 4.40/2.26  #Partial instantiations: 0
% 4.40/2.26  #Strategies tried      : 1
% 4.40/2.26  
% 4.40/2.26  Timing (in seconds)
% 4.40/2.26  ----------------------
% 4.40/2.26  Preprocessing        : 0.41
% 4.40/2.26  Parsing              : 0.21
% 4.40/2.26  CNF conversion       : 0.02
% 4.40/2.26  Main loop            : 0.79
% 4.40/2.26  Inferencing          : 0.27
% 4.40/2.26  Reduction            : 0.32
% 4.40/2.26  Demodulation         : 0.26
% 4.40/2.26  BG Simplification    : 0.03
% 4.40/2.26  Subsumption          : 0.12
% 4.40/2.26  Abstraction          : 0.05
% 4.40/2.26  MUC search           : 0.00
% 4.40/2.26  Cooper               : 0.00
% 4.40/2.26  Total                : 1.26
% 4.40/2.26  Index Insertion      : 0.00
% 4.40/2.26  Index Deletion       : 0.00
% 4.40/2.26  Index Matching       : 0.00
% 4.40/2.26  BG Taut test         : 0.00
%------------------------------------------------------------------------------