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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP756-1 : TPTP v8.1.2. Released v4.0.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 : n006.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:42:04 EDT 2023

% Result   : Unsatisfiable 16.33s 6.49s
% Output   : CNFRefutation 16.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   46 (  40 unt;   6 typ;   0 def)
%            Number of atoms       :   40 (  39 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    6 (   3   >;   3   *;   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   :  101 (; 101   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > c > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(f_26,axiom,
    ! [A,B] : ( ld(A,mult(A,B)) = B ),
    file(unknown,unknown) ).

tff(f_30,axiom,
    ! [A,B] : ( rd(mult(A,B),B) = A ),
    file(unknown,unknown) ).

tff(f_34,axiom,
    mult(mult(a,b),c) != mult(a,mult(b,c)),
    file(unknown,unknown) ).

tff(c_6,plain,
    ! [A_5,B_6] : ( mult(rd(A_5,B_6),B_6) = A_5 ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

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

tff(c_113,plain,
    ! [A_24,B_25,C_26] : ( mult(mult(A_24,B_25),mult(B_25,C_26)) = mult(A_24,mult(mult(B_25,B_25),C_26)) ),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_4,plain,
    ! [A_3,B_4] : ( ld(A_3,mult(A_3,B_4)) = B_4 ),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_152,plain,
    ! [A_27,B_28,C_29] : ( ld(mult(A_27,B_28),mult(A_27,mult(mult(B_28,B_28),C_29))) = mult(B_28,C_29) ),
    inference(superposition,[status(thm),theory(equality)],[c_113,c_4]) ).

tff(c_1331,plain,
    ! [A_60,B_61,C_62] : ( ld(mult(rd(A_60,mult(mult(B_61,B_61),C_62)),B_61),A_60) = mult(B_61,C_62) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_152]) ).

tff(c_1932,plain,
    ! [B_72,B_73,A_74] : ( mult(B_72,ld(mult(B_72,B_72),B_73)) = ld(mult(rd(A_74,B_73),B_72),A_74) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_1331]) ).

tff(c_2134,plain,
    ! [B_75,A_76] : ( mult(B_75,ld(mult(B_75,B_75),B_75)) = ld(A_76,A_76) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_1932]) ).

tff(c_245,plain,
    ! [A_33,B_34,C_35] : ( mult(rd(A_33,B_34),mult(mult(B_34,B_34),C_35)) = mult(A_33,mult(B_34,C_35)) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_113]) ).

tff(c_293,plain,
    ! [A_33,B_34,B_2] : ( mult(A_33,mult(B_34,ld(mult(B_34,B_34),B_2))) = mult(rd(A_33,B_34),B_2) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_245]) ).

tff(c_2207,plain,
    ! [A_33,B_75,A_76] : ( mult(rd(A_33,B_75),B_75) = mult(A_33,ld(A_76,A_76)) ),
    inference(superposition,[status(thm),theory(equality)],[c_2134,c_293]) ).

tff(c_2298,plain,
    ! [A_33,A_76] : ( mult(A_33,ld(A_76,A_76)) = A_33 ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_2207]) ).

tff(c_3592,plain,
    ! [B_91,A_92] : ( ld(mult(B_91,B_91),B_91) = ld(B_91,ld(A_92,A_92)) ),
    inference(superposition,[status(thm),theory(equality)],[c_2134,c_4]) ).

tff(c_1415,plain,
    ! [B_61,B_2,A_60] : ( mult(B_61,ld(mult(B_61,B_61),B_2)) = ld(mult(rd(A_60,B_2),B_61),A_60) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_1331]) ).

tff(c_3611,plain,
    ! [B_91,A_92,A_60] : ( mult(B_91,ld(B_91,ld(A_92,A_92))) = ld(mult(rd(A_60,B_91),B_91),A_60) ),
    inference(superposition,[status(thm),theory(equality)],[c_3592,c_1415]) ).

tff(c_3722,plain,
    ! [B_91,A_92,A_60] : ( mult(B_91,ld(B_91,ld(A_92,A_92))) = ld(A_60,A_60) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_3611]) ).

tff(c_10,plain,
    ! [A_9,B_10,C_11] : ( mult(mult(A_9,B_10),mult(B_10,C_11)) = mult(A_9,mult(mult(B_10,B_10),C_11)) ),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_13208,plain,
    ! [A_177,B_178,C_179] : ( mult(rd(A_177,B_178),mult(B_178,mult(mult(B_178,B_178),C_179))) = mult(A_177,mult(B_178,mult(B_178,C_179))) ),
    inference(superposition,[status(thm),theory(equality)],[c_10,c_245]) ).

tff(c_13349,plain,
    ! [A_177,B_178,A_60,A_92] : ( mult(rd(A_177,B_178),mult(B_178,ld(A_60,A_60))) = mult(A_177,mult(B_178,mult(B_178,ld(mult(B_178,B_178),ld(A_92,A_92))))) ),
    inference(superposition,[status(thm),theory(equality)],[c_3722,c_13208]) ).

tff(c_13559,plain,
    ! [A_180,B_181] : ( mult(A_180,rd(B_181,B_181)) = A_180 ),
    inference(demodulation,[status(thm),theory(equality)],[c_2298,c_6,c_2298,c_293,c_13349]) ).

tff(c_14209,plain,
    ! [B_184,A_185] : ( rd(B_184,B_184) = ld(A_185,A_185) ),
    inference(superposition,[status(thm),theory(equality)],[c_13559,c_4]) ).

tff(c_14472,plain,
    ! [A_185,B_184] : ( mult(ld(A_185,A_185),B_184) = B_184 ),
    inference(superposition,[status(thm),theory(equality)],[c_14209,c_6]) ).

tff(c_3674,plain,
    ! [B_91,A_92] : ( mult(mult(B_91,B_91),ld(B_91,ld(A_92,A_92))) = B_91 ),
    inference(superposition,[status(thm),theory(equality)],[c_3592,c_2]) ).

tff(c_143,plain,
    ! [A_24,A_1,B_2] : ( mult(A_24,mult(mult(A_1,A_1),ld(A_1,B_2))) = mult(mult(A_24,A_1),B_2) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_113]) ).

tff(c_302,plain,
    ! [A_36,A_37,B_38] : ( mult(A_36,mult(mult(A_37,A_37),ld(A_37,B_38))) = mult(mult(A_36,A_37),B_38) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_113]) ).

tff(c_8,plain,
    ! [A_7,B_8] : ( rd(mult(A_7,B_8),B_8) = A_7 ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_128,plain,
    ! [A_24,B_25,C_26] : ( rd(mult(A_24,mult(mult(B_25,B_25),C_26)),mult(B_25,C_26)) = mult(A_24,B_25) ),
    inference(superposition,[status(thm),theory(equality)],[c_113,c_8]) ).

tff(c_329,plain,
    ! [A_24,B_25,A_37,B_38] : ( rd(mult(A_24,mult(mult(mult(B_25,B_25),A_37),B_38)),mult(B_25,mult(mult(A_37,A_37),ld(A_37,B_38)))) = mult(A_24,B_25) ),
    inference(superposition,[status(thm),theory(equality)],[c_302,c_128]) ).

tff(c_20348,plain,
    ! [A_215,B_216,A_217,B_218] : ( rd(mult(A_215,mult(mult(mult(B_216,B_216),A_217),B_218)),mult(mult(B_216,A_217),B_218)) = mult(A_215,B_216) ),
    inference(demodulation,[status(thm),theory(equality)],[c_143,c_329]) ).

tff(c_20538,plain,
    ! [A_60,A_92,A_215,B_91,B_218] : ( rd(mult(A_215,mult(mult(mult(B_91,B_91),ld(B_91,ld(A_92,A_92))),B_218)),mult(ld(A_60,A_60),B_218)) = mult(A_215,B_91) ),
    inference(superposition,[status(thm),theory(equality)],[c_3722,c_20348]) ).

tff(c_23425,plain,
    ! [A_235,B_236,B_237] : ( rd(mult(A_235,mult(B_236,B_237)),B_237) = mult(A_235,B_236) ),
    inference(demodulation,[status(thm),theory(equality)],[c_14472,c_3674,c_20538]) ).

tff(c_23509,plain,
    ! [A_235,B_236,B_237] : ( mult(mult(A_235,B_236),B_237) = mult(A_235,mult(B_236,B_237)) ),
    inference(superposition,[status(thm),theory(equality)],[c_23425,c_6]) ).

tff(c_12,plain,
    mult(mult(a,b),c) != mult(a,mult(b,c)),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_33312,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_23509,c_12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GRP756-1 : TPTP v8.1.2. Released v4.0.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 : n006.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 22:17:43 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 16.33/6.49  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.33/6.50  
% 16.33/6.50  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 16.33/6.53  
% 16.33/6.53  Inference rules
% 16.33/6.53  ----------------------
% 16.33/6.53  #Ref     : 0
% 16.33/6.53  #Sup     : 8429
% 16.33/6.53  #Fact    : 0
% 16.33/6.53  #Define  : 0
% 16.33/6.53  #Split   : 0
% 16.33/6.53  #Chain   : 0
% 16.33/6.53  #Close   : 0
% 16.33/6.53  
% 16.33/6.53  Ordering : KBO
% 16.33/6.53  
% 16.33/6.53  Simplification rules
% 16.33/6.53  ----------------------
% 16.33/6.53  #Subsume      : 1352
% 16.33/6.53  #Demod        : 11804
% 16.33/6.53  #Tautology    : 2535
% 16.33/6.53  #SimpNegUnit  : 0
% 16.33/6.53  #BackRed      : 29
% 16.33/6.53  
% 16.33/6.53  #Partial instantiations: 0
% 16.33/6.53  #Strategies tried      : 1
% 16.33/6.53  
% 16.33/6.53  Timing (in seconds)
% 16.33/6.53  ----------------------
% 16.33/6.53  Preprocessing        : 0.39
% 16.33/6.54  Parsing              : 0.21
% 16.33/6.54  CNF conversion       : 0.02
% 16.33/6.54  Main loop            : 5.07
% 16.33/6.54  Inferencing          : 1.20
% 16.33/6.54  Reduction            : 3.01
% 16.33/6.54  Demodulation         : 2.77
% 16.33/6.54  BG Simplification    : 0.19
% 16.33/6.54  Subsumption          : 0.47
% 16.33/6.54  Abstraction          : 0.36
% 16.33/6.54  MUC search           : 0.00
% 16.33/6.54  Cooper               : 0.00
% 16.33/6.54  Total                : 5.51
% 16.33/6.54  Index Insertion      : 0.00
% 16.33/6.54  Index Deletion       : 0.00
% 16.33/6.54  Index Matching       : 0.00
% 16.33/6.54  BG Taut test         : 0.00
%------------------------------------------------------------------------------