TSTP Solution File: GRP406-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP406-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 : n023.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.07s 6.27s
% Output : CNFRefutation 15.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 21 unt; 4 typ; 0 def)
% Number of atoms : 21 ( 20 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 : 14 ( 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 : 60 (; 60 !; 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(inverse(multiply(inverse(multiply(A,B)),C)),multiply(inverse(B),multiply(inverse(B),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(inverse(multiply(inverse(multiply(A_1,B_2)),C_3)),multiply(inverse(B_2),multiply(inverse(B_2),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(inverse(multiply(inverse(multiply(A_4,B_5)),C_6)),multiply(inverse(B_5),multiply(inverse(B_5),B_5))))) = C_6 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_28,plain,
! [A_7,C_8,B_9,B_10] : ( multiply(A_7,inverse(multiply(inverse(C_8),multiply(inverse(B_9),multiply(inverse(B_9),B_9))))) = inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(A_7,B_9)),B_10)),C_8)),multiply(inverse(B_10),multiply(inverse(B_10),B_10)))) ),
inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).
tff(c_165,plain,
! [A_1,B_2,B_10,C_3] : ( inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(A_1,B_2)),B_10)),multiply(inverse(multiply(A_1,B_2)),C_3))),multiply(inverse(B_10),multiply(inverse(B_10),B_10)))) = C_3 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_28]) ).
tff(c_246,plain,
! [A_14,B_15,B_16,C_17] : ( inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(A_14,B_15)),B_16)),multiply(inverse(multiply(A_14,B_15)),C_17))),multiply(inverse(B_16),multiply(inverse(B_16),B_16)))) = C_17 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_28]) ).
tff(c_249,plain,
! [B_16,C_3,B_10,A_14,C_17,B_15] : ( inverse(multiply(inverse(multiply(inverse(multiply(C_17,B_10)),multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(A_14,B_15)),B_16)),multiply(inverse(multiply(A_14,B_15)),C_17))),multiply(inverse(B_16),multiply(inverse(B_16),B_16)))),C_3))),multiply(inverse(B_10),multiply(inverse(B_10),B_10)))) = C_3 ),
inference(superposition,[status(thm),theory(equality)],[c_246,c_165]) ).
tff(c_437,plain,
! [C_18,B_19,C_20] : ( inverse(multiply(inverse(multiply(inverse(multiply(C_18,B_19)),multiply(C_18,C_20))),multiply(inverse(B_19),multiply(inverse(B_19),B_19)))) = C_20 ),
inference(demodulation,[status(thm),theory(equality)],[c_165,c_249]) ).
tff(c_8536,plain,
! [C_77,B_78,C_79] : ( multiply(inverse(multiply(C_77,B_78)),inverse(multiply(C_79,multiply(inverse(multiply(C_77,C_79)),multiply(inverse(multiply(C_77,C_79)),multiply(C_77,C_79)))))) = multiply(inverse(B_78),multiply(inverse(B_78),B_78)) ),
inference(superposition,[status(thm),theory(equality)],[c_437,c_2]) ).
tff(c_95,plain,
! [A_7,B_9,C_8] : ( multiply(inverse(multiply(A_7,B_9)),multiply(A_7,inverse(multiply(inverse(C_8),multiply(inverse(B_9),multiply(inverse(B_9),B_9)))))) = C_8 ),
inference(superposition,[status(thm),theory(equality)],[c_28,c_2]) ).
tff(c_8977,plain,
! [C_77,B_78,C_8] : ( multiply(inverse(multiply(inverse(multiply(C_77,B_78)),multiply(C_77,inverse(C_8)))),multiply(inverse(B_78),multiply(inverse(B_78),B_78))) = C_8 ),
inference(superposition,[status(thm),theory(equality)],[c_8536,c_95]) ).
tff(c_410,plain,
! [C_17,B_10,C_3] : ( inverse(multiply(inverse(multiply(inverse(multiply(C_17,B_10)),multiply(C_17,C_3))),multiply(inverse(B_10),multiply(inverse(B_10),B_10)))) = C_3 ),
inference(demodulation,[status(thm),theory(equality)],[c_165,c_249]) ).
tff(c_579,plain,
! [C_21,B_22,C_23,A_24] : ( multiply(inverse(multiply(C_21,B_22)),multiply(C_21,C_23)) = multiply(inverse(multiply(A_24,B_22)),multiply(A_24,C_23)) ),
inference(superposition,[status(thm),theory(equality)],[c_437,c_95]) ).
tff(c_11943,plain,
! [C_95,C_94,C_97,B_96,C_93] : ( multiply(inverse(multiply(C_93,multiply(inverse(B_96),multiply(inverse(B_96),B_96)))),multiply(C_93,C_95)) = multiply(C_97,multiply(inverse(multiply(inverse(multiply(C_94,B_96)),multiply(C_94,C_97))),C_95)) ),
inference(superposition,[status(thm),theory(equality)],[c_410,c_579]) ).
tff(c_13322,plain,
! [C_98,B_99,C_100] : ( multiply(inverse(multiply(C_98,multiply(inverse(B_99),multiply(inverse(B_99),B_99)))),multiply(C_98,multiply(inverse(B_99),multiply(inverse(B_99),B_99)))) = multiply(inverse(C_100),C_100) ),
inference(superposition,[status(thm),theory(equality)],[c_8977,c_11943]) ).
tff(c_12822,plain,
! [C_93,B_78,C_8] : ( multiply(inverse(multiply(C_93,multiply(inverse(B_78),multiply(inverse(B_78),B_78)))),multiply(C_93,multiply(inverse(B_78),multiply(inverse(B_78),B_78)))) = multiply(inverse(C_8),C_8) ),
inference(superposition,[status(thm),theory(equality)],[c_8977,c_11943]) ).
tff(c_14670,plain,
! [C_102,C_101] : ( multiply(inverse(C_102),C_102) = multiply(inverse(C_101),C_101) ),
inference(superposition,[status(thm),theory(equality)],[c_13322,c_12822]) ).
tff(c_4,plain,
multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_15636,plain,
! [C_101] : ( multiply(inverse(a1),a1) != multiply(inverse(C_101),C_101) ),
inference(superposition,[status(thm),theory(equality)],[c_14670,c_4]) ).
tff(c_15784,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_15636]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP406-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.13 % 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 : n023.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:32:07 EDT 2023
% 0.15/0.35 % CPUTime :
% 15.07/6.27 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.07/6.28
% 15.07/6.28 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 15.48/6.30
% 15.48/6.30 Inference rules
% 15.48/6.30 ----------------------
% 15.48/6.30 #Ref : 1
% 15.48/6.30 #Sup : 4595
% 15.48/6.30 #Fact : 0
% 15.48/6.30 #Define : 0
% 15.48/6.30 #Split : 0
% 15.48/6.30 #Chain : 0
% 15.48/6.30 #Close : 0
% 15.48/6.30
% 15.48/6.30 Ordering : KBO
% 15.48/6.30
% 15.48/6.30 Simplification rules
% 15.48/6.30 ----------------------
% 15.48/6.30 #Subsume : 236
% 15.48/6.30 #Demod : 1179
% 15.48/6.30 #Tautology : 222
% 15.48/6.30 #SimpNegUnit : 0
% 15.48/6.30 #BackRed : 0
% 15.48/6.30
% 15.48/6.30 #Partial instantiations: 0
% 15.48/6.30 #Strategies tried : 1
% 15.48/6.30
% 15.48/6.30 Timing (in seconds)
% 15.48/6.30 ----------------------
% 15.48/6.31 Preprocessing : 0.40
% 15.48/6.31 Parsing : 0.20
% 15.48/6.31 CNF conversion : 0.02
% 15.48/6.31 Main loop : 4.84
% 15.48/6.31 Inferencing : 1.42
% 15.48/6.31 Reduction : 2.75
% 15.48/6.31 Demodulation : 2.58
% 15.48/6.31 BG Simplification : 0.28
% 15.48/6.31 Subsumption : 0.27
% 15.48/6.31 Abstraction : 0.47
% 15.48/6.31 MUC search : 0.00
% 15.48/6.31 Cooper : 0.00
% 15.48/6.31 Total : 5.29
% 15.48/6.31 Index Insertion : 0.00
% 15.48/6.31 Index Deletion : 0.00
% 15.48/6.31 Index Matching : 0.00
% 15.48/6.31 BG Taut test : 0.00
%------------------------------------------------------------------------------