TSTP Solution File: GRP412-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP412-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/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 : n008.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:11 EDT 2023
% Result : Unsatisfiable 15.71s 7.09s
% Output : CNFRefutation 15.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 27 unt; 4 typ; 0 def)
% Number of atoms : 27 ( 26 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 17 ( 3 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 90 (; 90 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > #nlpp > inverse > b1 > a1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a1,type,
a1: $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b1,type,
b1: $i ).
tff(f_24,axiom,
! [A,B,C] : ( multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B))) = C ),
file(unknown,unknown) ).
tff(f_26,axiom,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( multiply(A_1,inverse(multiply(multiply(multiply(inverse(B_2),B_2),inverse(multiply(inverse(multiply(A_1,inverse(B_2))),C_3))),B_2))) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_5,plain,
! [A_4,B_5,C_6] : ( multiply(A_4,inverse(multiply(multiply(multiply(inverse(B_5),B_5),inverse(multiply(inverse(multiply(A_4,inverse(B_5))),C_6))),B_5))) = C_6 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_28,plain,
! [A_7,B_8,C_9,B_10] : ( multiply(A_7,inverse(multiply(multiply(multiply(inverse(B_8),B_8),inverse(C_9)),B_8))) = inverse(multiply(multiply(multiply(inverse(B_10),B_10),inverse(multiply(inverse(multiply(inverse(multiply(A_7,inverse(B_8))),inverse(B_10))),C_9))),B_10)) ),
inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).
tff(c_185,plain,
! [B_10,A_1,B_2,C_3] : ( inverse(multiply(multiply(multiply(inverse(B_10),B_10),inverse(multiply(inverse(multiply(inverse(multiply(A_1,inverse(B_2))),inverse(B_10))),multiply(inverse(multiply(A_1,inverse(B_2))),C_3)))),B_10)) = C_3 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_28]) ).
tff(c_264,plain,
! [B_14,A_15,B_16,C_17] : ( inverse(multiply(multiply(multiply(inverse(B_14),B_14),inverse(multiply(inverse(multiply(inverse(multiply(A_15,inverse(B_16))),inverse(B_14))),multiply(inverse(multiply(A_15,inverse(B_16))),C_17)))),B_14)) = C_17 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_28]) ).
tff(c_274,plain,
! [B_16,A_15,B_2,C_3,B_10,C_17] : ( inverse(multiply(multiply(multiply(inverse(B_10),B_10),inverse(multiply(inverse(multiply(C_17,inverse(B_10))),multiply(inverse(multiply(multiply(multiply(inverse(inverse(B_2)),inverse(B_2)),inverse(multiply(inverse(multiply(inverse(multiply(A_15,inverse(B_16))),inverse(inverse(B_2)))),multiply(inverse(multiply(A_15,inverse(B_16))),C_17)))),inverse(B_2))),C_3)))),B_10)) = C_3 ),
inference(superposition,[status(thm),theory(equality)],[c_264,c_185]) ).
tff(c_434,plain,
! [B_10,C_17,C_3] : ( inverse(multiply(multiply(multiply(inverse(B_10),B_10),inverse(multiply(inverse(multiply(C_17,inverse(B_10))),multiply(C_17,C_3)))),B_10)) = C_3 ),
inference(demodulation,[status(thm),theory(equality)],[c_185,c_274]) ).
tff(c_461,plain,
! [B_18,C_19,C_20] : ( inverse(multiply(multiply(multiply(inverse(B_18),B_18),inverse(multiply(inverse(multiply(C_19,inverse(B_18))),multiply(C_19,C_20)))),B_18)) = C_20 ),
inference(demodulation,[status(thm),theory(equality)],[c_185,c_274]) ).
tff(c_100,plain,
! [A_7,B_8,C_9] : ( multiply(inverse(multiply(A_7,inverse(B_8))),multiply(A_7,inverse(multiply(multiply(multiply(inverse(B_8),B_8),inverse(C_9)),B_8)))) = C_9 ),
inference(superposition,[status(thm),theory(equality)],[c_28,c_2]) ).
tff(c_601,plain,
! [C_21,B_22,C_23,A_24] : ( multiply(inverse(multiply(C_21,inverse(B_22))),multiply(C_21,C_23)) = multiply(inverse(multiply(A_24,inverse(B_22))),multiply(A_24,C_23)) ),
inference(superposition,[status(thm),theory(equality)],[c_461,c_100]) ).
tff(c_726,plain,
! [A_24,C_23,C_3,B_10,C_21,C_17] : ( multiply(inverse(multiply(C_21,C_3)),multiply(C_21,C_23)) = multiply(inverse(multiply(A_24,inverse(multiply(multiply(multiply(inverse(B_10),B_10),inverse(multiply(inverse(multiply(C_17,inverse(B_10))),multiply(C_17,C_3)))),B_10)))),multiply(A_24,C_23)) ),
inference(superposition,[status(thm),theory(equality)],[c_434,c_601]) ).
tff(c_800,plain,
! [C_25,C_26,C_27,A_28] : ( multiply(inverse(multiply(C_25,C_26)),multiply(C_25,C_27)) = multiply(inverse(multiply(A_28,C_26)),multiply(A_28,C_27)) ),
inference(demodulation,[status(thm),theory(equality)],[c_434,c_726]) ).
tff(c_870,plain,
! [A_7,C_25,A_28,C_27,C_9] : ( multiply(inverse(multiply(A_7,inverse(multiply(C_25,C_27)))),multiply(A_7,inverse(multiply(multiply(multiply(inverse(multiply(A_28,C_27)),multiply(A_28,C_27)),inverse(C_9)),multiply(C_25,C_27))))) = C_9 ),
inference(superposition,[status(thm),theory(equality)],[c_800,c_100]) ).
tff(c_956,plain,
! [C_3,B_10,C_25,C_27,C_17] : ( multiply(inverse(multiply(C_25,B_10)),multiply(C_25,C_27)) = multiply(C_3,multiply(multiply(multiply(inverse(B_10),B_10),inverse(multiply(inverse(multiply(C_17,inverse(B_10))),multiply(C_17,C_3)))),C_27)) ),
inference(superposition,[status(thm),theory(equality)],[c_434,c_800]) ).
tff(c_7930,plain,
! [C_95,A_92,B_94,B_93,B_91] : ( inverse(multiply(multiply(multiply(inverse(B_93),B_93),inverse(multiply(inverse(multiply(inverse(multiply(A_92,inverse(B_91))),inverse(B_93))),multiply(multiply(multiply(inverse(B_94),B_94),inverse(multiply(inverse(multiply(multiply(inverse(B_91),B_91),inverse(B_94))),C_95))),B_94)))),B_93)) = multiply(A_92,inverse(multiply(C_95,B_91))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_28]) ).
tff(c_8246,plain,
! [A_92,B_93,B_91,C_25,C_27] : ( multiply(A_92,inverse(multiply(multiply(multiply(inverse(B_91),B_91),inverse(multiply(inverse(multiply(A_92,inverse(B_91))),inverse(B_93)))),B_91))) = inverse(multiply(multiply(multiply(inverse(B_93),B_93),inverse(multiply(inverse(multiply(C_25,C_27)),multiply(C_25,C_27)))),B_93)) ),
inference(superposition,[status(thm),theory(equality)],[c_956,c_7930]) ).
tff(c_8661,plain,
! [B_96,C_97,C_98] : ( inverse(multiply(multiply(multiply(inverse(B_96),B_96),inverse(multiply(inverse(multiply(C_97,C_98)),multiply(C_97,C_98)))),B_96)) = inverse(B_96) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_8246]) ).
tff(c_9018,plain,
! [A_7,B_96,C_25,A_28,C_27,C_9] : ( inverse(multiply(multiply(multiply(inverse(B_96),B_96),inverse(multiply(inverse(C_9),multiply(inverse(multiply(A_7,inverse(multiply(C_25,C_27)))),multiply(A_7,inverse(multiply(multiply(multiply(inverse(multiply(A_28,C_27)),multiply(A_28,C_27)),inverse(C_9)),multiply(C_25,C_27)))))))),B_96)) = inverse(B_96) ),
inference(superposition,[status(thm),theory(equality)],[c_870,c_8661]) ).
tff(c_9313,plain,
! [B_99,C_100] : ( inverse(multiply(multiply(multiply(inverse(B_99),B_99),inverse(multiply(inverse(C_100),C_100))),B_99)) = inverse(B_99) ),
inference(demodulation,[status(thm),theory(equality)],[c_870,c_9018]) ).
tff(c_11236,plain,
! [A_108,B_109,C_110] : ( multiply(inverse(multiply(A_108,inverse(B_109))),multiply(A_108,inverse(B_109))) = multiply(inverse(C_110),C_110) ),
inference(superposition,[status(thm),theory(equality)],[c_9313,c_100]) ).
tff(c_9568,plain,
! [A_7,B_99,C_100] : ( multiply(inverse(multiply(A_7,inverse(B_99))),multiply(A_7,inverse(B_99))) = multiply(inverse(C_100),C_100) ),
inference(superposition,[status(thm),theory(equality)],[c_9313,c_100]) ).
tff(c_12040,plain,
! [C_112,C_111] : ( multiply(inverse(C_112),C_112) = multiply(inverse(C_111),C_111) ),
inference(superposition,[status(thm),theory(equality)],[c_11236,c_9568]) ).
tff(c_4,plain,
multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_12644,plain,
! [C_111] : ( multiply(inverse(a1),a1) != multiply(inverse(C_111),C_111) ),
inference(superposition,[status(thm),theory(equality)],[c_12040,c_4]) ).
tff(c_14043,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_12644]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP412-1 : TPTP v8.1.2. Released v2.6.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.15/0.35 % Computer : n008.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 22:21:18 EDT 2023
% 0.15/0.35 % CPUTime :
% 15.71/7.09 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.71/7.09
% 15.71/7.09 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 15.71/7.12
% 15.71/7.12 Inference rules
% 15.71/7.12 ----------------------
% 15.71/7.12 #Ref : 1
% 15.71/7.12 #Sup : 3847
% 15.71/7.12 #Fact : 0
% 15.71/7.12 #Define : 0
% 15.71/7.12 #Split : 0
% 15.71/7.12 #Chain : 0
% 15.71/7.12 #Close : 0
% 15.71/7.12
% 15.71/7.12 Ordering : KBO
% 15.71/7.12
% 15.71/7.12 Simplification rules
% 15.71/7.12 ----------------------
% 15.71/7.12 #Subsume : 264
% 15.71/7.12 #Demod : 1327
% 15.71/7.12 #Tautology : 341
% 15.71/7.12 #SimpNegUnit : 0
% 15.71/7.12 #BackRed : 4
% 15.71/7.12
% 15.71/7.12 #Partial instantiations: 0
% 15.71/7.12 #Strategies tried : 1
% 15.71/7.12
% 15.71/7.12 Timing (in seconds)
% 15.71/7.12 ----------------------
% 15.71/7.13 Preprocessing : 0.39
% 15.71/7.13 Parsing : 0.20
% 15.71/7.13 CNF conversion : 0.02
% 15.71/7.13 Main loop : 5.59
% 15.71/7.13 Inferencing : 1.75
% 15.71/7.13 Reduction : 3.09
% 15.71/7.13 Demodulation : 2.86
% 15.71/7.13 BG Simplification : 0.38
% 15.71/7.13 Subsumption : 0.25
% 15.71/7.13 Abstraction : 0.64
% 15.71/7.13 MUC search : 0.00
% 15.71/7.13 Cooper : 0.00
% 15.71/7.13 Total : 6.03
% 15.71/7.13 Index Insertion : 0.00
% 15.71/7.13 Index Deletion : 0.00
% 15.71/7.13 Index Matching : 0.00
% 15.71/7.13 BG Taut test : 0.00
%------------------------------------------------------------------------------