TSTP Solution File: GRP660-14 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GRP660-14 : TPTP v8.1.2. Released v8.1.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 : n018.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:51 EDT 2023

% Result   : Unsatisfiable 63.59s 34.84s
% Output   : CNFRefutation 63.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   56 (  51 unt;   5 typ;   0 def)
%            Number of atoms       :   51 (  50 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    :    6 (   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    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :  100 (; 100   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > x1 > x0

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

tff(f_35,axiom,
    mult(ld(x1,x1),x0) != x0,
    file(unknown,unknown) ).

tff(c_39,plain,
    ! [A_16,B_17] : ( mult(rd(A_16,B_17),B_17) = A_16 ),
    inference(cnfTransformation,[status(thm)],[f_29]) ).

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

tff(c_45,plain,
    ! [A_16,B_17] : ( ld(rd(A_16,B_17),A_16) = B_17 ),
    inference(superposition,[status(thm),theory(equality)],[c_39,c_4]) ).

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

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

tff(c_71,plain,
    ! [A_20,B_21,C_22] : ( mult(mult(mult(A_20,B_21),C_22),A_20) = mult(A_20,mult(B_21,mult(C_22,A_20))) ),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_343,plain,
    ! [A_36,B_37,C_38] : ( rd(mult(A_36,mult(B_37,mult(C_38,A_36))),A_36) = mult(mult(A_36,B_37),C_38) ),
    inference(superposition,[status(thm),theory(equality)],[c_71,c_8]) ).

tff(c_1227,plain,
    ! [A_66,A_67,C_68] : ( mult(mult(A_66,rd(A_67,mult(C_68,A_66))),C_68) = rd(mult(A_66,A_67),A_66) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_343]) ).

tff(c_1657,plain,
    ! [A_75,A_76,C_77] : ( ld(mult(A_75,rd(A_76,mult(C_77,A_75))),rd(mult(A_75,A_76),A_75)) = C_77 ),
    inference(superposition,[status(thm),theory(equality)],[c_1227,c_4]) ).

tff(c_1766,plain,
    ! [B_78,C_79] : ( ld(mult(B_78,rd(B_78,mult(C_79,B_78))),B_78) = C_79 ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_1657]) ).

tff(c_1941,plain,
    ! [B_82,A_83] : ( ld(mult(B_82,rd(B_82,A_83)),B_82) = rd(A_83,B_82) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_1766]) ).

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

tff(c_1956,plain,
    ! [B_82,A_83] : ( mult(mult(B_82,rd(B_82,A_83)),rd(A_83,B_82)) = B_82 ),
    inference(superposition,[status(thm),theory(equality)],[c_1941,c_2]) ).

tff(c_616,plain,
    ! [A_48,B_49,C_50] : ( mult(rd(A_48,B_49),mult(B_49,mult(C_50,rd(A_48,B_49)))) = mult(mult(A_48,C_50),rd(A_48,B_49)) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_71]) ).

tff(c_6215,plain,
    ! [A_147,B_148,C_149] : ( ld(rd(A_147,B_148),mult(mult(A_147,C_149),rd(A_147,B_148))) = mult(B_148,mult(C_149,rd(A_147,B_148))) ),
    inference(superposition,[status(thm),theory(equality)],[c_616,c_4]) ).

tff(c_6352,plain,
    ! [A_83] : ( mult(A_83,mult(rd(A_83,A_83),rd(A_83,A_83))) = ld(rd(A_83,A_83),A_83) ),
    inference(superposition,[status(thm),theory(equality)],[c_1956,c_6215]) ).

tff(c_6472,plain,
    ! [A_150] : ( mult(A_150,mult(rd(A_150,A_150),rd(A_150,A_150))) = A_150 ),
    inference(demodulation,[status(thm),theory(equality)],[c_45,c_6352]) ).

tff(c_6621,plain,
    ! [A_150] : ( mult(rd(A_150,A_150),rd(A_150,A_150)) = ld(A_150,A_150) ),
    inference(superposition,[status(thm),theory(equality)],[c_6472,c_4]) ).

tff(c_51,plain,
    ! [A_18,B_19] : ( rd(mult(A_18,B_19),B_19) = A_18 ),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_66,plain,
    ! [B_2,A_1] : ( rd(B_2,ld(A_1,B_2)) = A_1 ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_51]) ).

tff(c_1971,plain,
    ! [A_1,B_2] : ( rd(ld(A_1,B_2),B_2) = ld(mult(B_2,A_1),B_2) ),
    inference(superposition,[status(thm),theory(equality)],[c_66,c_1941]) ).

tff(c_3785,plain,
    ! [A_115,A_116,C_117] : ( rd(rd(mult(A_115,A_116),A_115),C_117) = mult(A_115,rd(A_116,mult(C_117,A_115))) ),
    inference(superposition,[status(thm),theory(equality)],[c_1227,c_8]) ).

tff(c_11522,plain,
    ! [A_199,B_200,C_201] : ( mult(A_199,rd(ld(A_199,B_200),mult(C_201,A_199))) = rd(rd(B_200,A_199),C_201) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_3785]) ).

tff(c_11846,plain,
    ! [A_1,C_201] : ( mult(A_1,ld(mult(mult(C_201,A_1),A_1),mult(C_201,A_1))) = rd(rd(mult(C_201,A_1),A_1),C_201) ),
    inference(superposition,[status(thm),theory(equality)],[c_1971,c_11522]) ).

tff(c_26155,plain,
    ! [A_304,C_305] : ( mult(A_304,ld(mult(mult(C_305,A_304),A_304),mult(C_305,A_304))) = rd(C_305,C_305) ),
    inference(demodulation,[status(thm),theory(equality)],[c_8,c_11846]) ).

tff(c_26581,plain,
    ! [A_83] : ( mult(rd(A_83,A_83),ld(A_83,mult(A_83,rd(A_83,A_83)))) = rd(A_83,A_83) ),
    inference(superposition,[status(thm),theory(equality)],[c_1956,c_26155]) ).

tff(c_26719,plain,
    ! [A_83] : ( rd(A_83,A_83) = ld(A_83,A_83) ),
    inference(demodulation,[status(thm),theory(equality)],[c_6621,c_4,c_26581]) ).

tff(c_26743,plain,
    ! [A_150] : ( mult(ld(A_150,A_150),ld(A_150,A_150)) = ld(A_150,A_150) ),
    inference(demodulation,[status(thm),theory(equality)],[c_26719,c_26719,c_6621]) ).

tff(c_6772,plain,
    ! [A_152] : ( mult(rd(A_152,A_152),rd(A_152,A_152)) = ld(A_152,A_152) ),
    inference(superposition,[status(thm),theory(equality)],[c_6472,c_4]) ).

tff(c_6880,plain,
    ! [A_152] : ( ld(rd(A_152,A_152),ld(A_152,A_152)) = rd(A_152,A_152) ),
    inference(superposition,[status(thm),theory(equality)],[c_6772,c_4]) ).

tff(c_26741,plain,
    ! [A_152] : ( ld(ld(A_152,A_152),ld(A_152,A_152)) = ld(A_152,A_152) ),
    inference(demodulation,[status(thm),theory(equality)],[c_26719,c_26719,c_6880]) ).

tff(c_383,plain,
    ! [B_6,B_37,A_5] : ( rd(mult(B_6,mult(B_37,A_5)),B_6) = mult(mult(B_6,B_37),rd(A_5,B_6)) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_343]) ).

tff(c_101,plain,
    ! [A_1,B_2,C_22] : ( mult(A_1,mult(ld(A_1,B_2),mult(C_22,A_1))) = mult(mult(B_2,C_22),A_1) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_71]) ).

tff(c_28571,plain,
    ! [C_313,A_314,B_315] : ( rd(mult(mult(C_313,A_314),mult(mult(B_315,C_313),A_314)),mult(C_313,A_314)) = mult(mult(mult(C_313,A_314),A_314),ld(A_314,B_315)) ),
    inference(superposition,[status(thm),theory(equality)],[c_101,c_343]) ).

tff(c_28751,plain,
    ! [A_150,B_315] : ( rd(mult(mult(ld(A_150,A_150),ld(A_150,A_150)),mult(mult(B_315,ld(A_150,A_150)),ld(A_150,A_150))),ld(A_150,A_150)) = mult(mult(mult(ld(A_150,A_150),ld(A_150,A_150)),ld(A_150,A_150)),ld(ld(A_150,A_150),B_315)) ),
    inference(superposition,[status(thm),theory(equality)],[c_26743,c_28571]) ).

tff(c_61078,plain,
    ! [A_432,B_433] : ( mult(mult(ld(A_432,A_432),mult(B_433,ld(A_432,A_432))),ld(A_432,A_432)) = B_433 ),
    inference(demodulation,[status(thm),theory(equality)],[c_26741,c_2,c_26743,c_26743,c_26719,c_383,c_26743,c_28751]) ).

tff(c_115929,plain,
    ! [A_577,A_578] : ( mult(mult(ld(A_577,A_577),A_578),ld(A_577,A_577)) = rd(A_578,ld(A_577,A_577)) ),
    inference(superposition,[status(thm),theory(equality)],[c_6,c_61078]) ).

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

tff(c_116502,plain,
    ! [A_577,A_578] : ( mult(ld(A_577,A_577),mult(A_578,mult(ld(A_577,A_577),ld(A_577,A_577)))) = mult(rd(A_578,ld(A_577,A_577)),ld(A_577,A_577)) ),
    inference(superposition,[status(thm),theory(equality)],[c_115929,c_10]) ).

tff(c_116761,plain,
    ! [A_577,A_578] : ( mult(ld(A_577,A_577),mult(A_578,ld(A_577,A_577))) = A_578 ),
    inference(demodulation,[status(thm),theory(equality)],[c_26743,c_6,c_116502]) ).

tff(c_29113,plain,
    ! [A_150,B_315] : ( mult(mult(ld(A_150,A_150),mult(B_315,ld(A_150,A_150))),ld(A_150,A_150)) = B_315 ),
    inference(demodulation,[status(thm),theory(equality)],[c_26741,c_2,c_26743,c_26743,c_26719,c_383,c_26743,c_28751]) ).

tff(c_116791,plain,
    ! [B_315,A_150] : ( mult(B_315,ld(A_150,A_150)) = B_315 ),
    inference(demodulation,[status(thm),theory(equality)],[c_116761,c_29113]) ).

tff(c_117699,plain,
    ! [A_577,A_578] : ( mult(ld(A_577,A_577),A_578) = A_578 ),
    inference(demodulation,[status(thm),theory(equality)],[c_116791,c_116761]) ).

tff(c_12,plain,
    mult(ld(x1,x1),x0) != x0,
    inference(cnfTransformation,[status(thm)],[f_35]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : GRP660-14 : TPTP v8.1.2. Released v8.1.0.
% 0.00/0.15  % 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.16/0.37  % Computer : n018.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Thu Aug  3 22:20:20 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 63.59/34.84  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 63.59/34.85  
% 63.59/34.85  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 63.72/34.88  
% 63.72/34.88  Inference rules
% 63.72/34.88  ----------------------
% 63.72/34.88  #Ref     : 0
% 63.72/34.88  #Sup     : 32366
% 63.72/34.88  #Fact    : 0
% 63.72/34.88  #Define  : 0
% 63.72/34.88  #Split   : 0
% 63.72/34.88  #Chain   : 0
% 63.72/34.88  #Close   : 0
% 63.72/34.88  
% 63.72/34.88  Ordering : KBO
% 63.72/34.88  
% 63.72/34.88  Simplification rules
% 63.72/34.88  ----------------------
% 63.72/34.88  #Subsume      : 8
% 63.72/34.88  #Demod        : 54256
% 63.72/34.88  #Tautology    : 5288
% 63.72/34.88  #SimpNegUnit  : 0
% 63.72/34.88  #BackRed      : 54
% 63.72/34.88  
% 63.72/34.88  #Partial instantiations: 0
% 63.72/34.88  #Strategies tried      : 1
% 63.72/34.88  
% 63.72/34.88  Timing (in seconds)
% 63.72/34.88  ----------------------
% 63.72/34.89  Preprocessing        : 0.40
% 63.72/34.89  Parsing              : 0.22
% 63.72/34.89  CNF conversion       : 0.02
% 63.72/34.89  Main loop            : 33.39
% 63.72/34.89  Inferencing          : 4.48
% 63.72/34.89  Reduction            : 23.22
% 63.72/34.89  Demodulation         : 22.04
% 63.72/34.89  BG Simplification    : 0.84
% 63.72/34.89  Subsumption          : 3.71
% 63.72/34.89  Abstraction          : 1.98
% 63.72/34.89  MUC search           : 0.00
% 63.72/34.89  Cooper               : 0.00
% 63.72/34.89  Total                : 33.85
% 63.72/34.89  Index Insertion      : 0.00
% 63.72/34.89  Index Deletion       : 0.00
% 63.72/34.89  Index Matching       : 0.00
% 63.72/34.89  BG Taut test         : 0.00
%------------------------------------------------------------------------------