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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP586-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 : n003.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.33s 2.10s
% Output   : CNFRefutation 4.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   30 (  25 unt;   5 typ;   0 def)
%            Number of atoms       :   25 (  24 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   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   :   54 (;  54   !;   0   ?;   0   :)

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

%Foreground sorts:

%Background operators:

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

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(f_25,axiom,
    ! [A,B] : ( multiply(A,B) = inverse(double_divide(B,A)) ),
    file(unknown,unknown) ).

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

tff(f_27,axiom,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    file(unknown,unknown) ).

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

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

tff(c_17,plain,
    ! [A_8,B_9,C_10] : ( double_divide(A_8,multiply(B_9,multiply(inverse(C_10),double_divide(A_8,B_9)))) = C_10 ),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_4,c_2]) ).

tff(c_26,plain,
    ! [B_9,C_10,A_8] : ( multiply(multiply(B_9,multiply(inverse(C_10),double_divide(A_8,B_9))),A_8) = inverse(C_10) ),
    inference(superposition,[status(thm),theory(equality)],[c_17,c_4]) ).

tff(c_7,plain,
    ! [A_1,B_2,C_3] : ( double_divide(A_1,multiply(B_2,multiply(inverse(C_3),double_divide(A_1,B_2)))) = C_3 ),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_4,c_2]) ).

tff(c_90,plain,
    ! [A_18,B_19,C_20,C_21] : ( double_divide(A_18,multiply(multiply(B_19,multiply(inverse(C_20),double_divide(A_18,B_19))),multiply(inverse(C_21),C_20))) = C_21 ),
    inference(superposition,[status(thm),theory(equality)],[c_17,c_7]) ).

tff(c_133,plain,
    ! [C_22,C_23] : ( double_divide(multiply(inverse(C_22),C_23),inverse(C_23)) = C_22 ),
    inference(superposition,[status(thm),theory(equality)],[c_26,c_90]) ).

tff(c_306,plain,
    ! [A_32,B_33,C_34] : ( double_divide(multiply(multiply(A_32,B_33),C_34),inverse(C_34)) = double_divide(B_33,A_32) ),
    inference(superposition,[status(thm),theory(equality)],[c_4,c_133]) ).

tff(c_324,plain,
    ! [C_34,A_32,B_33] : ( multiply(inverse(C_34),multiply(multiply(A_32,B_33),C_34)) = inverse(double_divide(B_33,A_32)) ),
    inference(superposition,[status(thm),theory(equality)],[c_306,c_4]) ).

tff(c_419,plain,
    ! [C_38,A_39,B_40] : ( multiply(inverse(C_38),multiply(multiply(A_39,B_40),C_38)) = multiply(A_39,B_40) ),
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_324]) ).

tff(c_163,plain,
    ! [C_24,C_25] : ( multiply(inverse(C_24),multiply(inverse(C_25),C_24)) = inverse(C_25) ),
    inference(superposition,[status(thm),theory(equality)],[c_133,c_4]) ).

tff(c_121,plain,
    ! [C_21,C_10] : ( double_divide(multiply(inverse(C_21),C_10),inverse(C_10)) = C_21 ),
    inference(superposition,[status(thm),theory(equality)],[c_26,c_90]) ).

tff(c_172,plain,
    ! [C_25,C_24] : ( double_divide(inverse(C_25),inverse(multiply(inverse(C_25),C_24))) = C_24 ),
    inference(superposition,[status(thm),theory(equality)],[c_163,c_121]) ).

tff(c_1038,plain,
    ! [C_58,A_59,B_60] : ( double_divide(inverse(C_58),inverse(multiply(A_59,B_60))) = multiply(multiply(A_59,B_60),C_58) ),
    inference(superposition,[status(thm),theory(equality)],[c_419,c_172]) ).

tff(c_1113,plain,
    ! [C_61,B_62] : ( multiply(multiply(inverse(C_61),B_62),C_61) = B_62 ),
    inference(superposition,[status(thm),theory(equality)],[c_1038,c_172]) ).

tff(c_1732,plain,
    ! [C_77,A_78] : ( multiply(inverse(C_77),double_divide(A_78,inverse(A_78))) = inverse(C_77) ),
    inference(superposition,[status(thm),theory(equality)],[c_26,c_1113]) ).

tff(c_1054,plain,
    ! [C_58,B_60] : ( multiply(multiply(inverse(C_58),B_60),C_58) = B_60 ),
    inference(superposition,[status(thm),theory(equality)],[c_1038,c_172]) ).

tff(c_1826,plain,
    ! [C_79,A_80] : ( multiply(inverse(C_79),C_79) = double_divide(A_80,inverse(A_80)) ),
    inference(superposition,[status(thm),theory(equality)],[c_1732,c_1054]) ).

tff(c_1867,plain,
    ! [A_80,C_79] : ( multiply(double_divide(A_80,inverse(A_80)),C_79) = C_79 ),
    inference(superposition,[status(thm),theory(equality)],[c_1826,c_1054]) ).

tff(c_6,plain,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_1937,plain,
    ! [A_80] : ( multiply(double_divide(A_80,inverse(A_80)),a2) != a2 ),
    inference(superposition,[status(thm),theory(equality)],[c_1826,c_6]) ).

tff(c_2036,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_1867,c_1937]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.15  % Problem  : GRP586-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.16  % 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.16/0.38  % Computer : n003.cluster.edu
% 0.16/0.38  % Model    : x86_64 x86_64
% 0.16/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38  % Memory   : 8042.1875MB
% 0.16/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38  % CPULimit : 300
% 0.16/0.38  % WCLimit  : 300
% 0.16/0.38  % DateTime : Thu Aug  3 22:15:08 EDT 2023
% 0.16/0.38  % CPUTime  : 
% 4.33/2.10  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.33/2.11  
% 4.33/2.11  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.47/2.13  
% 4.47/2.13  Inference rules
% 4.47/2.13  ----------------------
% 4.47/2.13  #Ref     : 0
% 4.47/2.13  #Sup     : 552
% 4.47/2.13  #Fact    : 0
% 4.47/2.13  #Define  : 0
% 4.47/2.13  #Split   : 0
% 4.47/2.13  #Chain   : 0
% 4.47/2.13  #Close   : 0
% 4.47/2.13  
% 4.47/2.13  Ordering : KBO
% 4.47/2.13  
% 4.47/2.13  Simplification rules
% 4.47/2.13  ----------------------
% 4.47/2.13  #Subsume      : 1
% 4.47/2.13  #Demod        : 356
% 4.47/2.13  #Tautology    : 242
% 4.47/2.13  #SimpNegUnit  : 0
% 4.47/2.13  #BackRed      : 0
% 4.47/2.13  
% 4.47/2.13  #Partial instantiations: 0
% 4.47/2.13  #Strategies tried      : 1
% 4.47/2.13  
% 4.47/2.13  Timing (in seconds)
% 4.47/2.13  ----------------------
% 4.47/2.14  Preprocessing        : 0.38
% 4.47/2.14  Parsing              : 0.21
% 4.47/2.14  CNF conversion       : 0.02
% 4.47/2.14  Main loop            : 0.68
% 4.47/2.14  Inferencing          : 0.28
% 4.47/2.14  Reduction            : 0.21
% 4.47/2.14  Demodulation         : 0.17
% 4.47/2.14  BG Simplification    : 0.04
% 4.47/2.14  Subsumption          : 0.10
% 4.47/2.14  Abstraction          : 0.05
% 4.47/2.14  MUC search           : 0.00
% 4.47/2.14  Cooper               : 0.00
% 4.47/2.14  Total                : 1.10
% 4.47/2.14  Index Insertion      : 0.00
% 4.47/2.14  Index Deletion       : 0.00
% 4.47/2.14  Index Matching       : 0.00
% 4.47/2.14  BG Taut test         : 0.00
%------------------------------------------------------------------------------