TSTP Solution File: GRP421-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP421-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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/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:12 EDT 2023
% Result : Unsatisfiable 15.46s 6.27s
% Output : CNFRefutation 15.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 17 unt; 4 typ; 0 def)
% Number of atoms : 17 ( 16 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 11 ( 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 : 46 (; 46 !; 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] : ( inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),multiply(inverse(C),inverse(multiply(inverse(C),C))))))),multiply(A,C))) = B ),
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] : ( inverse(multiply(inverse(multiply(A_1,inverse(multiply(inverse(B_2),multiply(inverse(C_3),inverse(multiply(inverse(C_3),C_3))))))),multiply(A_1,C_3))) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_5,plain,
! [A_4,B_5,C_6] : ( inverse(multiply(inverse(multiply(A_4,inverse(multiply(inverse(B_5),multiply(inverse(C_6),inverse(multiply(inverse(C_6),C_6))))))),multiply(A_4,C_6))) = B_5 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_1412,plain,
! [A_35,B_33,A_36,C_34,C_32] : ( multiply(inverse(multiply(A_35,inverse(multiply(inverse(B_33),multiply(inverse(C_34),inverse(multiply(inverse(C_34),C_34))))))),multiply(A_35,C_34)) = inverse(multiply(inverse(multiply(A_36,inverse(multiply(B_33,multiply(inverse(C_32),inverse(multiply(inverse(C_32),C_32))))))),multiply(A_36,C_32))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_5]) ).
tff(c_1668,plain,
! [A_35,B_2,C_34] : ( multiply(inverse(multiply(A_35,inverse(multiply(inverse(inverse(B_2)),multiply(inverse(C_34),inverse(multiply(inverse(C_34),C_34))))))),multiply(A_35,C_34)) = B_2 ),
inference(superposition,[status(thm),theory(equality)],[c_1412,c_2]) ).
tff(c_44,plain,
! [C_7,B_8,A_9] : ( multiply(inverse(C_7),inverse(multiply(inverse(B_8),multiply(inverse(inverse(multiply(inverse(C_7),C_7))),inverse(multiply(inverse(inverse(multiply(inverse(C_7),C_7))),inverse(multiply(inverse(C_7),C_7)))))))) = inverse(multiply(inverse(multiply(A_9,B_8)),multiply(A_9,C_7))) ),
inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).
tff(c_103,plain,
! [A_9,B_8,C_7] : ( inverse(multiply(inverse(inverse(multiply(inverse(multiply(A_9,B_8)),multiply(A_9,C_7)))),multiply(inverse(C_7),inverse(multiply(inverse(C_7),C_7))))) = B_8 ),
inference(superposition,[status(thm),theory(equality)],[c_44,c_2]) ).
tff(c_2025,plain,
! [A_37,B_38,C_39] : ( multiply(inverse(multiply(A_37,inverse(multiply(inverse(inverse(B_38)),multiply(inverse(C_39),inverse(multiply(inverse(C_39),C_39))))))),multiply(A_37,C_39)) = B_38 ),
inference(superposition,[status(thm),theory(equality)],[c_1412,c_2]) ).
tff(c_2321,plain,
! [A_43,B_41,C_42,A_40] : ( multiply(inverse(multiply(A_43,B_41)),multiply(A_43,C_42)) = multiply(inverse(multiply(A_40,B_41)),multiply(A_40,C_42)) ),
inference(superposition,[status(thm),theory(equality)],[c_103,c_2025]) ).
tff(c_7963,plain,
! [C_78,A_77,C_80,A_81,B_79] : ( multiply(inverse(multiply(A_77,multiply(A_81,C_80))),multiply(A_77,C_78)) = multiply(B_79,multiply(inverse(multiply(A_81,inverse(multiply(inverse(B_79),multiply(inverse(C_80),inverse(multiply(inverse(C_80),C_80))))))),C_78)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_2321]) ).
tff(c_9070,plain,
! [A_82,A_83,C_84,B_85] : ( multiply(inverse(multiply(A_82,multiply(A_83,C_84))),multiply(A_82,multiply(A_83,C_84))) = multiply(inverse(B_85),B_85) ),
inference(superposition,[status(thm),theory(equality)],[c_1668,c_7963]) ).
tff(c_8842,plain,
! [A_77,A_35,C_34,B_2] : ( multiply(inverse(multiply(A_77,multiply(A_35,C_34))),multiply(A_77,multiply(A_35,C_34))) = multiply(inverse(B_2),B_2) ),
inference(superposition,[status(thm),theory(equality)],[c_1668,c_7963]) ).
tff(c_10190,plain,
! [B_87,B_86] : ( multiply(inverse(B_87),B_87) = multiply(inverse(B_86),B_86) ),
inference(superposition,[status(thm),theory(equality)],[c_9070,c_8842]) ).
tff(c_4,plain,
multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_11066,plain,
! [B_86] : ( multiply(inverse(a1),a1) != multiply(inverse(B_86),B_86) ),
inference(superposition,[status(thm),theory(equality)],[c_10190,c_4]) ).
tff(c_12485,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_11066]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP421-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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.17/0.35 % Computer : n008.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 22:23:34 EDT 2023
% 0.17/0.35 % CPUTime :
% 15.46/6.27 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.46/6.27
% 15.46/6.27 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 15.46/6.30
% 15.46/6.30 Inference rules
% 15.46/6.30 ----------------------
% 15.46/6.30 #Ref : 1
% 15.46/6.30 #Sup : 3610
% 15.46/6.30 #Fact : 0
% 15.46/6.30 #Define : 0
% 15.46/6.30 #Split : 0
% 15.46/6.30 #Chain : 0
% 15.46/6.30 #Close : 0
% 15.46/6.30
% 15.46/6.30 Ordering : KBO
% 15.46/6.30
% 15.46/6.30 Simplification rules
% 15.46/6.30 ----------------------
% 15.46/6.30 #Subsume : 293
% 15.46/6.30 #Demod : 996
% 15.46/6.30 #Tautology : 204
% 15.46/6.30 #SimpNegUnit : 0
% 15.46/6.30 #BackRed : 0
% 15.46/6.30
% 15.46/6.30 #Partial instantiations: 0
% 15.46/6.30 #Strategies tried : 1
% 15.46/6.30
% 15.46/6.30 Timing (in seconds)
% 15.46/6.30 ----------------------
% 15.46/6.30 Preprocessing : 0.39
% 15.46/6.30 Parsing : 0.20
% 15.46/6.30 CNF conversion : 0.02
% 15.46/6.30 Main loop : 4.86
% 15.46/6.30 Inferencing : 1.33
% 15.46/6.30 Reduction : 2.96
% 15.46/6.30 Demodulation : 2.79
% 15.46/6.30 BG Simplification : 0.27
% 15.46/6.30 Subsumption : 0.21
% 15.46/6.30 Abstraction : 0.45
% 15.46/6.30 MUC search : 0.00
% 15.46/6.30 Cooper : 0.00
% 15.46/6.30 Total : 5.30
% 15.46/6.30 Index Insertion : 0.00
% 15.46/6.30 Index Deletion : 0.00
% 15.46/6.30 Index Matching : 0.00
% 15.46/6.30 BG Taut test : 0.00
%------------------------------------------------------------------------------