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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP523-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 : n009.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:26 EDT 2023

% Result   : Unsatisfiable 14.85s 5.74s
% Output   : CNFRefutation 14.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   49 (  43 unt;   6 typ;   0 def)
%            Number of atoms       :   43 (  42 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    6 (   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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   98 (;  98   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > c3 > b3 > a3

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_28,axiom,
    ! [A,B] : ( inverse(A) = divide(divide(B,B),A) ),
    file(unknown,unknown) ).

tff(f_26,axiom,
    ! [A,B,C] : ( multiply(A,B) = divide(A,divide(divide(C,C),B)) ),
    file(unknown,unknown) ).

tff(f_24,axiom,
    ! [A,B,C] : ( divide(A,divide(B,divide(C,divide(A,B)))) = C ),
    file(unknown,unknown) ).

tff(f_30,axiom,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    file(unknown,unknown) ).

tff(c_6,plain,
    ! [B_8,A_7] : ( divide(divide(B_8,B_8),A_7) = inverse(A_7) ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_4,plain,
    ! [A_4,C_6,B_5] : ( divide(A_4,divide(divide(C_6,C_6),B_5)) = multiply(A_4,B_5) ),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_9,plain,
    ! [A_4,B_5] : ( divide(A_4,inverse(B_5)) = multiply(A_4,B_5) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).

tff(c_146,plain,
    ! [A_21,B_22,C_23] : ( divide(A_21,divide(B_22,divide(C_23,divide(A_21,B_22)))) = C_23 ),
    inference(cnfTransformation,[status(thm)],[f_24]) ).

tff(c_167,plain,
    ! [B_22,C_23,B_8] : ( inverse(divide(B_22,divide(C_23,divide(divide(B_8,B_8),B_22)))) = C_23 ),
    inference(superposition,[status(thm),theory(equality)],[c_146,c_6]) ).

tff(c_228,plain,
    ! [B_22,C_23] : ( inverse(divide(B_22,multiply(C_23,B_22))) = C_23 ),
    inference(demodulation,[status(thm),theory(equality)],[c_9,c_6,c_167]) ).

tff(c_2,plain,
    ! [A_1,B_2,C_3] : ( divide(A_1,divide(B_2,divide(C_3,divide(A_1,B_2)))) = C_3 ),
    inference(cnfTransformation,[status(thm)],[f_24]) ).

tff(c_647,plain,
    ! [B_33,C_34,A_35] : ( divide(B_33,divide(divide(C_34,divide(A_35,B_33)),C_34)) = A_35 ),
    inference(superposition,[status(thm),theory(equality)],[c_146,c_2]) ).

tff(c_915,plain,
    ! [B_40,A_41] : ( divide(B_40,inverse(divide(A_41,B_40))) = A_41 ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_647]) ).

tff(c_969,plain,
    ! [C_23,B_22] : ( divide(multiply(C_23,B_22),C_23) = B_22 ),
    inference(superposition,[status(thm),theory(equality)],[c_228,c_915]) ).

tff(c_216,plain,
    ! [B_8,A_21,B_22] : ( divide(B_8,B_8) = divide(A_21,divide(B_22,inverse(divide(A_21,B_22)))) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_146]) ).

tff(c_282,plain,
    ! [B_26,A_27,B_28] : ( divide(B_26,B_26) = divide(A_27,multiply(B_28,divide(A_27,B_28))) ),
    inference(demodulation,[status(thm),theory(equality)],[c_9,c_216]) ).

tff(c_238,plain,
    ! [B_8,A_21,B_22] : ( divide(B_8,B_8) = divide(A_21,multiply(B_22,divide(A_21,B_22))) ),
    inference(demodulation,[status(thm),theory(equality)],[c_9,c_216]) ).

tff(c_404,plain,
    ! [B_30,B_29] : ( divide(B_30,B_30) = divide(B_29,B_29) ),
    inference(superposition,[status(thm),theory(equality)],[c_282,c_238]) ).

tff(c_474,plain,
    ! [B_8,B_30] : ( inverse(divide(B_8,B_8)) = divide(B_30,B_30) ),
    inference(superposition,[status(thm),theory(equality)],[c_404,c_6]) ).

tff(c_1098,plain,
    ! [B_45,B_46] : ( divide(B_45,divide(B_46,B_46)) = B_45 ),
    inference(superposition,[status(thm),theory(equality)],[c_474,c_915]) ).

tff(c_1312,plain,
    ! [B_49,B_50] : ( divide(B_49,divide(B_49,B_50)) = B_50 ),
    inference(superposition,[status(thm),theory(equality)],[c_1098,c_2]) ).

tff(c_287,plain,
    ! [B_8,B_26] : ( divide(B_8,B_8) = divide(B_26,B_26) ),
    inference(superposition,[status(thm),theory(equality)],[c_282,c_238]) ).

tff(c_704,plain,
    ! [B_33,B_8,A_35] : ( divide(B_33,divide(divide(B_8,B_8),divide(A_35,B_33))) = A_35 ),
    inference(superposition,[status(thm),theory(equality)],[c_287,c_647]) ).

tff(c_779,plain,
    ! [B_33,A_35] : ( multiply(B_33,divide(A_35,B_33)) = A_35 ),
    inference(demodulation,[status(thm),theory(equality)],[c_9,c_6,c_704]) ).

tff(c_1445,plain,
    ! [B_51,B_52] : ( multiply(divide(B_51,B_52),B_52) = B_51 ),
    inference(superposition,[status(thm),theory(equality)],[c_1312,c_779]) ).

tff(c_1478,plain,
    ! [C_23,B_22] : ( multiply(C_23,B_22) = multiply(B_22,C_23) ),
    inference(superposition,[status(thm),theory(equality)],[c_969,c_1445]) ).

tff(c_468,plain,
    ! [B_5,B_29] : ( multiply(inverse(B_5),B_5) = divide(B_29,B_29) ),
    inference(superposition,[status(thm),theory(equality)],[c_404,c_9]) ).

tff(c_152,plain,
    ! [B_22,C_23,A_21] : ( divide(B_22,divide(divide(C_23,divide(A_21,B_22)),C_23)) = A_21 ),
    inference(superposition,[status(thm),theory(equality)],[c_146,c_2]) ).

tff(c_1614,plain,
    ! [A_55,B_56,C_57] : ( divide(A_55,divide(inverse(B_56),divide(C_57,multiply(A_55,B_56)))) = C_57 ),
    inference(superposition,[status(thm),theory(equality)],[c_9,c_146]) ).

tff(c_1699,plain,
    ! [A_55,B_56,A_21] : ( divide(multiply(A_55,B_56),divide(A_21,inverse(B_56))) = divide(A_55,A_21) ),
    inference(superposition,[status(thm),theory(equality)],[c_152,c_1614]) ).

tff(c_7886,plain,
    ! [A_133,B_134,A_135] : ( divide(multiply(A_133,B_134),multiply(A_135,B_134)) = divide(A_133,A_135) ),
    inference(demodulation,[status(thm),theory(equality)],[c_9,c_1699]) ).

tff(c_8100,plain,
    ! [B_29,A_135,B_5] : ( divide(divide(B_29,B_29),multiply(A_135,B_5)) = divide(inverse(B_5),A_135) ),
    inference(superposition,[status(thm),theory(equality)],[c_468,c_7886]) ).

tff(c_8203,plain,
    ! [B_5,A_135] : ( divide(inverse(B_5),A_135) = inverse(multiply(A_135,B_5)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_8100]) ).

tff(c_669,plain,
    ! [A_1,B_33,A_35] : ( divide(divide(A_1,B_33),divide(A_35,B_33)) = divide(A_1,A_35) ),
    inference(superposition,[status(thm),theory(equality)],[c_647,c_2]) ).

tff(c_8691,plain,
    ! [A_140,B_141,A_142] : ( divide(divide(A_140,B_141),divide(A_142,B_141)) = divide(A_140,A_142) ),
    inference(superposition,[status(thm),theory(equality)],[c_647,c_2]) ).

tff(c_10172,plain,
    ! [A_151,B_152,A_153] : ( divide(A_151,divide(B_152,divide(A_153,A_151))) = divide(A_153,B_152) ),
    inference(superposition,[status(thm),theory(equality)],[c_8691,c_2]) ).

tff(c_19713,plain,
    ! [B_213,A_214,A_215] : ( divide(B_213,divide(A_214,A_215)) = divide(A_215,divide(A_214,B_213)) ),
    inference(superposition,[status(thm),theory(equality)],[c_669,c_10172]) ).

tff(c_20499,plain,
    ! [A_215,A_135,B_5] : ( divide(A_215,inverse(multiply(A_135,B_5))) = divide(A_135,divide(inverse(B_5),A_215)) ),
    inference(superposition,[status(thm),theory(equality)],[c_8203,c_19713]) ).

tff(c_20876,plain,
    ! [A_215,A_135,B_5] : ( multiply(A_215,multiply(A_135,B_5)) = multiply(A_135,multiply(A_215,B_5)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_9,c_8203,c_9,c_20499]) ).

tff(c_8,plain,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_1762,plain,
    multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
    inference(demodulation,[status(thm),theory(equality)],[c_1478,c_8]) ).

tff(c_41803,plain,
    multiply(a3,multiply(c3,b3)) != multiply(a3,multiply(b3,c3)),
    inference(demodulation,[status(thm),theory(equality)],[c_20876,c_1762]) ).

tff(c_41806,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_1478,c_41803]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP523-1 : TPTP v8.1.2. Released v2.6.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.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Thu Aug  3 22:17:54 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 14.85/5.74  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.85/5.75  
% 14.85/5.75  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 14.94/5.78  
% 14.94/5.78  Inference rules
% 14.94/5.78  ----------------------
% 14.94/5.78  #Ref     : 0
% 14.94/5.78  #Sup     : 10500
% 14.94/5.78  #Fact    : 0
% 14.94/5.78  #Define  : 0
% 14.94/5.78  #Split   : 0
% 14.94/5.78  #Chain   : 0
% 14.94/5.78  #Close   : 0
% 14.94/5.78  
% 14.94/5.78  Ordering : KBO
% 14.94/5.78  
% 14.94/5.78  Simplification rules
% 14.94/5.78  ----------------------
% 14.94/5.78  #Subsume      : 2226
% 14.94/5.78  #Demod        : 20472
% 14.94/5.78  #Tautology    : 5255
% 14.94/5.78  #SimpNegUnit  : 0
% 14.94/5.78  #BackRed      : 31
% 14.94/5.78  
% 14.94/5.78  #Partial instantiations: 0
% 14.94/5.78  #Strategies tried      : 1
% 14.94/5.78  
% 14.94/5.78  Timing (in seconds)
% 14.94/5.78  ----------------------
% 14.94/5.78  Preprocessing        : 0.43
% 14.94/5.78  Parsing              : 0.23
% 14.94/5.78  CNF conversion       : 0.02
% 14.94/5.78  Main loop            : 4.24
% 14.94/5.78  Inferencing          : 0.93
% 14.94/5.78  Reduction            : 2.49
% 14.94/5.78  Demodulation         : 2.30
% 14.94/5.79  BG Simplification    : 0.11
% 14.94/5.79  Subsumption          : 0.51
% 14.94/5.79  Abstraction          : 0.19
% 14.94/5.79  MUC search           : 0.00
% 14.94/5.79  Cooper               : 0.00
% 14.94/5.79  Total                : 4.73
% 14.94/5.79  Index Insertion      : 0.00
% 14.94/5.79  Index Deletion       : 0.00
% 14.94/5.79  Index Matching       : 0.00
% 14.94/5.79  BG Taut test         : 0.00
%------------------------------------------------------------------------------