TSTP Solution File: GRP711+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP711+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/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 : n002.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:00 EDT 2023
% Result : Theorem 6.29s 2.53s
% Output : CNFRefutation 6.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 78 ( 64 unt; 9 typ; 0 def)
% Number of atoms : 76 ( 72 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 15 ( 8 ~; 4 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 82 (; 82 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ mult > #nlpp > i > unit > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(i,type,
i: $i > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(unit,type,
unit: $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(f_45,negated_conjecture,
~ ! [X6,X7,X8] :
( ( ( mult(X6,X7) = mult(X6,X8) )
=> ( X7 = X8 ) )
& ( ( mult(X7,X6) = mult(X8,X6) )
=> ( X7 = X8 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tff(f_30,axiom,
! [A] : ( mult(unit,A) = A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
tff(f_36,axiom,
! [A] : ( mult(i(A),A) = unit ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
tff(f_28,axiom,
! [A] : ( mult(A,unit) = A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
tff(f_32,axiom,
! [C,B,A] : ( mult(A,mult(B,mult(B,C))) = mult(mult(mult(A,B),B),C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
tff(f_34,axiom,
! [A] : ( mult(A,i(A)) = unit ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
tff(c_12,plain,
( ( '#skF_2' != '#skF_3' )
| ( '#skF_5' != '#skF_6' ) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_19,plain,
'#skF_5' != '#skF_6',
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_4,plain,
! [A_2] : ( mult(unit,A_2) = A_2 ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_10,plain,
! [A_7] : ( mult(i(A_7),A_7) = unit ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_2,plain,
! [A_1] : ( mult(A_1,unit) = A_1 ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_2627,plain,
! [A_61,B_62,C_63] : ( mult(mult(mult(A_61,B_62),B_62),C_63) = mult(A_61,mult(B_62,mult(B_62,C_63))) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_2645,plain,
! [A_61,B_62] : ( mult(A_61,mult(B_62,mult(B_62,unit))) = mult(mult(A_61,B_62),B_62) ),
inference(superposition,[status(thm),theory(equality)],[c_2627,c_2]) ).
tff(c_2685,plain,
! [A_61,B_62] : ( mult(mult(A_61,B_62),B_62) = mult(A_61,mult(B_62,B_62)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2645]) ).
tff(c_6,plain,
! [A_5,B_4,C_3] : ( mult(mult(mult(A_5,B_4),B_4),C_3) = mult(A_5,mult(B_4,mult(B_4,C_3))) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_3717,plain,
! [A_83,B_84,C_85] : ( mult(mult(A_83,mult(B_84,B_84)),C_85) = mult(A_83,mult(B_84,mult(B_84,C_85))) ),
inference(demodulation,[status(thm),theory(equality)],[c_2685,c_6]) ).
tff(c_3890,plain,
! [B_84,C_85] : ( mult(i(mult(B_84,B_84)),mult(B_84,mult(B_84,C_85))) = mult(unit,C_85) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_3717]) ).
tff(c_3944,plain,
! [B_84,C_85] : ( mult(i(mult(B_84,B_84)),mult(B_84,mult(B_84,C_85))) = C_85 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_3890]) ).
tff(c_16,plain,
( ( '#skF_2' != '#skF_3' )
| ( mult('#skF_4','#skF_5') = mult('#skF_4','#skF_6') ) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_92,plain,
'#skF_2' != '#skF_3',
inference(splitLeft,[status(thm)],[c_16]) ).
tff(c_1569,plain,
! [A_39,B_40,C_41] : ( mult(mult(mult(A_39,B_40),B_40),C_41) = mult(A_39,mult(B_40,mult(B_40,C_41))) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_1587,plain,
! [A_39,B_40] : ( mult(A_39,mult(B_40,mult(B_40,unit))) = mult(mult(A_39,B_40),B_40) ),
inference(superposition,[status(thm),theory(equality)],[c_1569,c_2]) ).
tff(c_1627,plain,
! [A_39,B_40] : ( mult(mult(A_39,B_40),B_40) = mult(A_39,mult(B_40,B_40)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_1587]) ).
tff(c_8,plain,
! [A_6] : ( mult(A_6,i(A_6)) = unit ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_1583,plain,
! [A_39,B_40] : ( mult(A_39,mult(B_40,mult(B_40,i(mult(mult(A_39,B_40),B_40))))) = unit ),
inference(superposition,[status(thm),theory(equality)],[c_1569,c_8]) ).
tff(c_2302,plain,
! [A_39,B_40] : ( mult(A_39,mult(B_40,mult(B_40,i(mult(A_39,mult(B_40,B_40)))))) = unit ),
inference(demodulation,[status(thm),theory(equality)],[c_1627,c_1583]) ).
tff(c_2303,plain,
! [A_57,B_58] : ( mult(A_57,mult(B_58,mult(B_58,i(mult(A_57,mult(B_58,B_58)))))) = unit ),
inference(demodulation,[status(thm),theory(equality)],[c_1627,c_1583]) ).
tff(c_1610,plain,
! [A_7,C_41] : ( mult(i(A_7),mult(A_7,mult(A_7,C_41))) = mult(mult(unit,A_7),C_41) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_1569]) ).
tff(c_1632,plain,
! [A_7,C_41] : ( mult(i(A_7),mult(A_7,mult(A_7,C_41))) = mult(A_7,C_41) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_1610]) ).
tff(c_2331,plain,
! [B_58] : ( mult(B_58,mult(B_58,i(mult(B_58,mult(B_58,B_58))))) = mult(i(B_58),unit) ),
inference(superposition,[status(thm),theory(equality)],[c_2303,c_1632]) ).
tff(c_2425,plain,
! [B_58] : ( mult(B_58,mult(B_58,i(mult(B_58,mult(B_58,B_58))))) = i(B_58) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2331]) ).
tff(c_99,plain,
! [A_12,B_13,C_14] : ( mult(mult(mult(A_12,B_13),B_13),C_14) = mult(A_12,mult(B_13,mult(B_13,C_14))) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_117,plain,
! [A_12,B_13] : ( mult(A_12,mult(B_13,mult(B_13,unit))) = mult(mult(A_12,B_13),B_13) ),
inference(superposition,[status(thm),theory(equality)],[c_99,c_2]) ).
tff(c_157,plain,
! [A_12,B_13] : ( mult(mult(A_12,B_13),B_13) = mult(A_12,mult(B_13,B_13)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_117]) ).
tff(c_1189,plain,
! [A_34,B_35,C_36] : ( mult(mult(A_34,mult(B_35,B_35)),C_36) = mult(A_34,mult(B_35,mult(B_35,C_36))) ),
inference(demodulation,[status(thm),theory(equality)],[c_157,c_6]) ).
tff(c_1362,plain,
! [B_35,C_36] : ( mult(i(mult(B_35,B_35)),mult(B_35,mult(B_35,C_36))) = mult(unit,C_36) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_1189]) ).
tff(c_1416,plain,
! [B_35,C_36] : ( mult(i(mult(B_35,B_35)),mult(B_35,mult(B_35,C_36))) = C_36 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_1362]) ).
tff(c_18,plain,
( ( mult('#skF_2','#skF_1') = mult('#skF_3','#skF_1') )
| ( mult('#skF_4','#skF_5') = mult('#skF_4','#skF_6') ) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_94,plain,
mult('#skF_4','#skF_5') = mult('#skF_4','#skF_6'),
inference(splitLeft,[status(thm)],[c_18]) ).
tff(c_1421,plain,
! [B_37,C_38] : ( mult(i(mult(B_37,B_37)),mult(B_37,mult(B_37,C_38))) = C_38 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_1362]) ).
tff(c_1515,plain,
mult(i(mult('#skF_4','#skF_4')),mult('#skF_4',mult('#skF_4','#skF_6'))) = '#skF_5',
inference(superposition,[status(thm),theory(equality)],[c_94,c_1421]) ).
tff(c_1560,plain,
'#skF_5' = '#skF_6',
inference(demodulation,[status(thm),theory(equality)],[c_1416,c_1515]) ).
tff(c_1562,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_19,c_1560]) ).
tff(c_1563,plain,
mult('#skF_2','#skF_1') = mult('#skF_3','#skF_1'),
inference(splitRight,[status(thm)],[c_18]) ).
tff(c_1600,plain,
! [C_41] : ( mult(mult(mult('#skF_3','#skF_1'),'#skF_1'),C_41) = mult('#skF_2',mult('#skF_1',mult('#skF_1',C_41))) ),
inference(superposition,[status(thm),theory(equality)],[c_1563,c_1569]) ).
tff(c_2541,plain,
! [C_60] : ( mult('#skF_2',mult('#skF_1',mult('#skF_1',C_60))) = mult('#skF_3',mult('#skF_1',mult('#skF_1',C_60))) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_1600]) ).
tff(c_2564,plain,
mult('#skF_3',mult('#skF_1',mult('#skF_1',mult('#skF_1',i(mult('#skF_1',mult('#skF_1','#skF_1'))))))) = mult('#skF_2',mult('#skF_1',i('#skF_1'))),
inference(superposition,[status(thm),theory(equality)],[c_2425,c_2541]) ).
tff(c_2611,plain,
'#skF_2' = '#skF_3',
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2302,c_2,c_8,c_2564]) ).
tff(c_2613,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_92,c_2611]) ).
tff(c_2614,plain,
mult('#skF_4','#skF_5') = mult('#skF_4','#skF_6'),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_3949,plain,
! [B_86,C_87] : ( mult(i(mult(B_86,B_86)),mult(B_86,mult(B_86,C_87))) = C_87 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_3890]) ).
tff(c_4043,plain,
mult(i(mult('#skF_4','#skF_4')),mult('#skF_4',mult('#skF_4','#skF_6'))) = '#skF_5',
inference(superposition,[status(thm),theory(equality)],[c_2614,c_3949]) ).
tff(c_4088,plain,
'#skF_5' = '#skF_6',
inference(demodulation,[status(thm),theory(equality)],[c_3944,c_4043]) ).
tff(c_4090,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_19,c_4088]) ).
tff(c_4091,plain,
'#skF_2' != '#skF_3',
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_4178,plain,
! [A_92,B_93,C_94] : ( mult(mult(mult(A_92,B_93),B_93),C_94) = mult(A_92,mult(B_93,mult(B_93,C_94))) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_4196,plain,
! [A_92,B_93] : ( mult(A_92,mult(B_93,mult(B_93,unit))) = mult(mult(A_92,B_93),B_93) ),
inference(superposition,[status(thm),theory(equality)],[c_4178,c_2]) ).
tff(c_4270,plain,
! [A_96,B_97] : ( mult(mult(A_96,B_97),B_97) = mult(A_96,mult(B_97,B_97)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_4196]) ).
tff(c_4298,plain,
! [A_6] : ( mult(A_6,mult(i(A_6),i(A_6))) = mult(unit,i(A_6)) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_4270]) ).
tff(c_4315,plain,
! [A_6] : ( mult(A_6,mult(i(A_6),i(A_6))) = i(A_6) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_4298]) ).
tff(c_4345,plain,
! [A_99] : ( mult(A_99,mult(i(A_99),i(A_99))) = i(A_99) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_4298]) ).
tff(c_4092,plain,
'#skF_5' = '#skF_6',
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_14,plain,
( ( mult('#skF_2','#skF_1') = mult('#skF_3','#skF_1') )
| ( '#skF_5' != '#skF_6' ) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_4172,plain,
mult('#skF_2','#skF_1') = mult('#skF_3','#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_4092,c_14]) ).
tff(c_4209,plain,
! [C_94] : ( mult(mult(mult('#skF_3','#skF_1'),'#skF_1'),C_94) = mult('#skF_2',mult('#skF_1',mult('#skF_1',C_94))) ),
inference(superposition,[status(thm),theory(equality)],[c_4172,c_4178]) ).
tff(c_4239,plain,
! [C_94] : ( mult('#skF_2',mult('#skF_1',mult('#skF_1',C_94))) = mult('#skF_3',mult('#skF_1',mult('#skF_1',C_94))) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_4209]) ).
tff(c_4355,plain,
mult('#skF_3',mult('#skF_1',mult('#skF_1',mult(i('#skF_1'),i('#skF_1'))))) = mult('#skF_2',mult('#skF_1',i('#skF_1'))),
inference(superposition,[status(thm),theory(equality)],[c_4345,c_4239]) ).
tff(c_4374,plain,
'#skF_2' = '#skF_3',
inference(demodulation,[status(thm),theory(equality)],[c_2,c_8,c_4315,c_2,c_8,c_4355]) ).
tff(c_4376,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4091,c_4374]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP711+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/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.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 22:13:31 EDT 2023
% 0.13/0.35 % CPUTime :
% 6.29/2.53 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.29/2.54
% 6.29/2.54 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.42/2.57
% 6.42/2.57 Inference rules
% 6.42/2.57 ----------------------
% 6.42/2.57 #Ref : 0
% 6.42/2.57 #Sup : 999
% 6.42/2.57 #Fact : 0
% 6.42/2.57 #Define : 0
% 6.42/2.57 #Split : 3
% 6.42/2.57 #Chain : 0
% 6.42/2.57 #Close : 0
% 6.42/2.57
% 6.42/2.57 Ordering : KBO
% 6.42/2.57
% 6.42/2.57 Simplification rules
% 6.42/2.57 ----------------------
% 6.42/2.57 #Subsume : 3
% 6.42/2.57 #Demod : 1428
% 6.42/2.57 #Tautology : 552
% 6.42/2.57 #SimpNegUnit : 4
% 6.42/2.57 #BackRed : 7
% 6.42/2.57
% 6.42/2.57 #Partial instantiations: 0
% 6.42/2.57 #Strategies tried : 1
% 6.42/2.57
% 6.42/2.57 Timing (in seconds)
% 6.42/2.57 ----------------------
% 6.42/2.58 Preprocessing : 0.45
% 6.42/2.58 Parsing : 0.24
% 6.42/2.58 CNF conversion : 0.03
% 6.42/2.58 Main loop : 1.04
% 6.42/2.58 Inferencing : 0.31
% 6.42/2.58 Reduction : 0.51
% 6.42/2.58 Demodulation : 0.44
% 6.42/2.58 BG Simplification : 0.03
% 6.42/2.58 Subsumption : 0.12
% 6.42/2.58 Abstraction : 0.05
% 6.42/2.58 MUC search : 0.00
% 6.42/2.58 Cooper : 0.00
% 6.42/2.58 Total : 1.55
% 6.42/2.58 Index Insertion : 0.00
% 6.42/2.58 Index Deletion : 0.00
% 6.42/2.58 Index Matching : 0.00
% 6.42/2.58 BG Taut test : 0.00
%------------------------------------------------------------------------------