TSTP Solution File: GRP403-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP403-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 : n021.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:10 EDT 2023
% Result : Unsatisfiable 13.27s 5.08s
% Output : CNFRefutation 13.27s
% 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)),inverse(multiply(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)),inverse(multiply(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)),inverse(multiply(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),inverse(multiply(B_9,multiply(inverse(B_9),B_9)))))) = inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(A_7,B_9)),B_10)),C_8)),inverse(multiply(B_10,multiply(inverse(B_10),B_10))))) ),
inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).
tff(c_150,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))),inverse(multiply(B_10,multiply(inverse(B_10),B_10))))) = C_3 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_28]) ).
tff(c_228,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))),inverse(multiply(B_16,multiply(inverse(B_16),B_16))))) = C_17 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_28]) ).
tff(c_231,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))),inverse(multiply(B_16,multiply(inverse(B_16),B_16))))),C_3))),inverse(multiply(B_10,multiply(inverse(B_10),B_10))))) = C_3 ),
inference(superposition,[status(thm),theory(equality)],[c_228,c_150]) ).
tff(c_386,plain,
! [C_18,B_19,C_20] : ( inverse(multiply(inverse(multiply(inverse(multiply(C_18,B_19)),multiply(C_18,C_20))),inverse(multiply(B_19,multiply(inverse(B_19),B_19))))) = C_20 ),
inference(demodulation,[status(thm),theory(equality)],[c_150,c_231]) ).
tff(c_4098,plain,
! [C_56,B_57,C_58] : ( multiply(inverse(multiply(C_56,B_57)),inverse(multiply(C_58,inverse(multiply(multiply(C_56,C_58),multiply(inverse(multiply(C_56,C_58)),multiply(C_56,C_58))))))) = inverse(multiply(B_57,multiply(inverse(B_57),B_57))) ),
inference(superposition,[status(thm),theory(equality)],[c_386,c_2]) ).
tff(c_86,plain,
! [A_7,B_9,C_8] : ( multiply(inverse(multiply(A_7,B_9)),multiply(A_7,inverse(multiply(inverse(C_8),inverse(multiply(B_9,multiply(inverse(B_9),B_9))))))) = C_8 ),
inference(superposition,[status(thm),theory(equality)],[c_28,c_2]) ).
tff(c_4394,plain,
! [C_56,B_57,C_8] : ( multiply(inverse(multiply(inverse(multiply(C_56,B_57)),multiply(C_56,inverse(C_8)))),inverse(multiply(B_57,multiply(inverse(B_57),B_57)))) = C_8 ),
inference(superposition,[status(thm),theory(equality)],[c_4098,c_86]) ).
tff(c_371,plain,
! [C_17,B_10,C_3] : ( inverse(multiply(inverse(multiply(inverse(multiply(C_17,B_10)),multiply(C_17,C_3))),inverse(multiply(B_10,multiply(inverse(B_10),B_10))))) = C_3 ),
inference(demodulation,[status(thm),theory(equality)],[c_150,c_231]) ).
tff(c_495,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_386,c_86]) ).
tff(c_7603,plain,
! [C_81,C_78,C_79,B_80,C_77] : ( multiply(inverse(multiply(C_77,inverse(multiply(B_80,multiply(inverse(B_80),B_80))))),multiply(C_77,C_79)) = multiply(C_81,multiply(inverse(multiply(inverse(multiply(C_78,B_80)),multiply(C_78,C_81))),C_79)) ),
inference(superposition,[status(thm),theory(equality)],[c_371,c_495]) ).
tff(c_8611,plain,
! [C_82,B_83,C_84] : ( multiply(inverse(multiply(C_82,inverse(multiply(B_83,multiply(inverse(B_83),B_83))))),multiply(C_82,inverse(multiply(B_83,multiply(inverse(B_83),B_83))))) = multiply(inverse(C_84),C_84) ),
inference(superposition,[status(thm),theory(equality)],[c_4394,c_7603]) ).
tff(c_8280,plain,
! [C_77,B_57,C_8] : ( multiply(inverse(multiply(C_77,inverse(multiply(B_57,multiply(inverse(B_57),B_57))))),multiply(C_77,inverse(multiply(B_57,multiply(inverse(B_57),B_57))))) = multiply(inverse(C_8),C_8) ),
inference(superposition,[status(thm),theory(equality)],[c_4394,c_7603]) ).
tff(c_9635,plain,
! [C_86,C_85] : ( multiply(inverse(C_86),C_86) = multiply(inverse(C_85),C_85) ),
inference(superposition,[status(thm),theory(equality)],[c_8611,c_8280]) ).
tff(c_4,plain,
multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_10459,plain,
! [C_86] : ( multiply(inverse(a1),a1) != multiply(inverse(C_86),C_86) ),
inference(superposition,[status(thm),theory(equality)],[c_9635,c_4]) ).
tff(c_10609,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_10459]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP403-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/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.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu Aug 3 22:24:21 EDT 2023
% 0.13/0.33 % CPUTime :
% 13.27/5.08 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.27/5.09
% 13.27/5.09 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 13.27/5.12
% 13.27/5.12 Inference rules
% 13.27/5.12 ----------------------
% 13.27/5.12 #Ref : 1
% 13.27/5.12 #Sup : 3126
% 13.27/5.12 #Fact : 0
% 13.27/5.12 #Define : 0
% 13.27/5.12 #Split : 0
% 13.27/5.12 #Chain : 0
% 13.27/5.12 #Close : 0
% 13.27/5.12
% 13.27/5.12 Ordering : KBO
% 13.27/5.12
% 13.27/5.12 Simplification rules
% 13.27/5.12 ----------------------
% 13.27/5.12 #Subsume : 185
% 13.27/5.12 #Demod : 730
% 13.27/5.12 #Tautology : 155
% 13.27/5.12 #SimpNegUnit : 0
% 13.27/5.12 #BackRed : 0
% 13.27/5.12
% 13.27/5.12 #Partial instantiations: 0
% 13.27/5.12 #Strategies tried : 1
% 13.27/5.12
% 13.27/5.12 Timing (in seconds)
% 13.27/5.12 ----------------------
% 13.27/5.12 Preprocessing : 0.44
% 13.27/5.12 Parsing : 0.24
% 13.27/5.12 CNF conversion : 0.02
% 13.27/5.12 Main loop : 3.53
% 13.27/5.12 Inferencing : 1.19
% 13.27/5.12 Reduction : 1.83
% 13.27/5.12 Demodulation : 1.70
% 13.27/5.12 BG Simplification : 0.22
% 13.27/5.12 Subsumption : 0.21
% 13.27/5.12 Abstraction : 0.35
% 13.27/5.12 MUC search : 0.00
% 13.27/5.12 Cooper : 0.00
% 13.27/5.12 Total : 4.02
% 13.27/5.12 Index Insertion : 0.00
% 13.27/5.12 Index Deletion : 0.00
% 13.27/5.12 Index Matching : 0.00
% 13.27/5.12 BG Taut test : 0.00
%------------------------------------------------------------------------------