TSTP Solution File: GRP465-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP465-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 : n014.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:18 EDT 2023
% Result : Unsatisfiable 5.21s 2.41s
% Output : CNFRefutation 5.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 12
% Syntax : Number of formulae : 57 ( 50 unt; 7 typ; 0 def)
% Number of atoms : 50 ( 49 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 91 (; 91 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > identity > c3 > b3 > a3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a3,type,
a3: $i ).
tff(c3,type,
c3: $i ).
tff(divide,type,
divide: ( $i * $i ) > $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b3,type,
b3: $i ).
tff(identity,type,
identity: $i ).
tff(f_27,axiom,
! [A] : ( inverse(A) = divide(identity,A) ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [A,B] : ( multiply(A,B) = divide(A,divide(identity,B)) ),
file(unknown,unknown) ).
tff(f_29,axiom,
! [A] : ( identity = divide(A,A) ),
file(unknown,unknown) ).
tff(f_23,axiom,
! [A,B,C] : ( divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(identity,A),C))) = B ),
file(unknown,unknown) ).
tff(f_31,axiom,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file(unknown,unknown) ).
tff(c_6,plain,
! [A_6] : ( divide(identity,A_6) = inverse(A_6) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_4,plain,
! [A_4,B_5] : ( divide(A_4,divide(identity,B_5)) = multiply(A_4,B_5) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_11,plain,
! [A_4,B_5] : ( divide(A_4,inverse(B_5)) = multiply(A_4,B_5) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).
tff(c_8,plain,
! [A_7] : ( divide(A_7,A_7) = identity ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( divide(A_1,divide(divide(divide(divide(A_1,A_1),B_2),C_3),divide(divide(identity,A_1),C_3))) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_183,plain,
! [A_17,B_18,C_19] : ( divide(A_17,divide(divide(inverse(B_18),C_19),divide(inverse(A_17),C_19))) = B_18 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_6,c_8,c_2]) ).
tff(c_245,plain,
! [B_18] : ( divide(B_18,identity) = B_18 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_183]) ).
tff(c_20,plain,
! [A_9] : ( divide(identity,A_9) = inverse(A_9) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_27,plain,
inverse(identity) = identity,
inference(superposition,[status(thm),theory(equality)],[c_20,c_8]) ).
tff(c_42,plain,
! [A_10,B_11] : ( divide(A_10,inverse(B_11)) = multiply(A_10,B_11) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).
tff(c_59,plain,
! [A_10] : ( multiply(A_10,identity) = divide(A_10,identity) ),
inference(superposition,[status(thm),theory(equality)],[c_27,c_42]) ).
tff(c_260,plain,
! [A_10] : ( multiply(A_10,identity) = A_10 ),
inference(demodulation,[status(thm),theory(equality)],[c_245,c_59]) ).
tff(c_237,plain,
! [A_17,B_18] : ( divide(A_17,divide(identity,divide(inverse(A_17),inverse(B_18)))) = B_18 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_183]) ).
tff(c_325,plain,
! [A_22,B_23] : ( multiply(A_22,multiply(inverse(A_22),B_23)) = B_23 ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_11,c_6,c_237]) ).
tff(c_396,plain,
! [A_25] : ( multiply(A_25,inverse(A_25)) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_260,c_325]) ).
tff(c_258,plain,
! [A_17,B_18] : ( multiply(A_17,multiply(inverse(A_17),B_18)) = B_18 ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_11,c_6,c_237]) ).
tff(c_406,plain,
! [A_17] : ( inverse(inverse(A_17)) = multiply(A_17,identity) ),
inference(superposition,[status(thm),theory(equality)],[c_396,c_258]) ).
tff(c_436,plain,
! [A_26] : ( inverse(inverse(A_26)) = A_26 ),
inference(demodulation,[status(thm),theory(equality)],[c_260,c_406]) ).
tff(c_466,plain,
! [A_4,A_26] : ( multiply(A_4,inverse(A_26)) = divide(A_4,A_26) ),
inference(superposition,[status(thm),theory(equality)],[c_436,c_11]) ).
tff(c_429,plain,
! [A_17] : ( inverse(inverse(A_17)) = A_17 ),
inference(demodulation,[status(thm),theory(equality)],[c_260,c_406]) ).
tff(c_261,plain,
! [B_20] : ( divide(B_20,identity) = B_20 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_183]) ).
tff(c_12,plain,
! [A_1,B_2,C_3] : ( divide(A_1,divide(divide(inverse(B_2),C_3),divide(inverse(A_1),C_3))) = B_2 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_6,c_8,c_2]) ).
tff(c_268,plain,
! [A_1,B_2] : ( divide(A_1,divide(inverse(B_2),divide(inverse(A_1),identity))) = B_2 ),
inference(superposition,[status(thm),theory(equality)],[c_261,c_12]) ).
tff(c_528,plain,
! [A_28,B_29] : ( divide(A_28,multiply(inverse(B_29),A_28)) = B_29 ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_245,c_268]) ).
tff(c_557,plain,
! [B_29,B_18] : ( divide(multiply(inverse(inverse(B_29)),B_18),B_18) = B_29 ),
inference(superposition,[status(thm),theory(equality)],[c_258,c_528]) ).
tff(c_693,plain,
! [B_33,B_34] : ( divide(multiply(B_33,B_34),B_34) = B_33 ),
inference(demodulation,[status(thm),theory(equality)],[c_429,c_557]) ).
tff(c_730,plain,
! [B_33,B_5] : ( multiply(multiply(B_33,inverse(B_5)),B_5) = B_33 ),
inference(superposition,[status(thm),theory(equality)],[c_11,c_693]) ).
tff(c_945,plain,
! [B_41,B_42] : ( multiply(divide(B_41,B_42),B_42) = B_41 ),
inference(demodulation,[status(thm),theory(equality)],[c_466,c_730]) ).
tff(c_549,plain,
! [A_28,A_17] : ( divide(A_28,multiply(A_17,A_28)) = inverse(A_17) ),
inference(superposition,[status(thm),theory(equality)],[c_429,c_528]) ).
tff(c_1253,plain,
! [B_49,B_50] : ( inverse(divide(B_49,B_50)) = divide(B_50,B_49) ),
inference(superposition,[status(thm),theory(equality)],[c_945,c_549]) ).
tff(c_1322,plain,
! [B_5,A_4] : ( divide(inverse(B_5),A_4) = inverse(multiply(A_4,B_5)) ),
inference(superposition,[status(thm),theory(equality)],[c_11,c_1253]) ).
tff(c_448,plain,
! [A_26,B_18] : ( multiply(inverse(A_26),multiply(A_26,B_18)) = B_18 ),
inference(superposition,[status(thm),theory(equality)],[c_436,c_258]) ).
tff(c_1164,plain,
! [B_47,B_48] : ( multiply(inverse(divide(B_47,B_48)),B_47) = B_48 ),
inference(superposition,[status(thm),theory(equality)],[c_945,c_448]) ).
tff(c_1228,plain,
! [A_4,B_5] : ( multiply(inverse(multiply(A_4,B_5)),A_4) = inverse(B_5) ),
inference(superposition,[status(thm),theory(equality)],[c_11,c_1164]) ).
tff(c_49,plain,
! [B_11] : ( inverse(inverse(B_11)) = multiply(identity,B_11) ),
inference(superposition,[status(thm),theory(equality)],[c_42,c_6]) ).
tff(c_435,plain,
! [B_11] : ( multiply(identity,B_11) = B_11 ),
inference(demodulation,[status(thm),theory(equality)],[c_429,c_49]) ).
tff(c_206,plain,
! [A_17,B_18,B_2,C_3] : ( divide(A_17,divide(divide(inverse(B_18),divide(divide(inverse(B_2),C_3),divide(inverse(inverse(A_17)),C_3))),B_2)) = B_18 ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_183]) ).
tff(c_251,plain,
! [A_17,B_18,B_2,C_3] : ( divide(A_17,divide(divide(inverse(B_18),divide(divide(inverse(B_2),C_3),divide(multiply(identity,A_17),C_3))),B_2)) = B_18 ),
inference(demodulation,[status(thm),theory(equality)],[c_49,c_206]) ).
tff(c_2588,plain,
! [A_74,B_75,C_76,B_77] : ( divide(A_74,divide(multiply(inverse(B_75),multiply(divide(A_74,C_76),multiply(C_76,B_77))),B_77)) = B_75 ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_1322,c_1322,c_435,c_251]) ).
tff(c_2766,plain,
! [A_7,B_75,B_77] : ( divide(A_7,divide(multiply(inverse(B_75),multiply(identity,multiply(A_7,B_77))),B_77)) = B_75 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_2588]) ).
tff(c_5383,plain,
! [A_114,B_115,B_116] : ( divide(A_114,divide(multiply(inverse(B_115),multiply(A_114,B_116)),B_116)) = B_115 ),
inference(demodulation,[status(thm),theory(equality)],[c_435,c_2766]) ).
tff(c_5499,plain,
! [A_114,B_5,B_116] : ( divide(A_114,divide(inverse(B_5),B_116)) = multiply(multiply(A_114,B_116),B_5) ),
inference(superposition,[status(thm),theory(equality)],[c_1228,c_5383]) ).
tff(c_5577,plain,
! [A_114,B_116,B_5] : ( multiply(multiply(A_114,B_116),B_5) = multiply(A_114,multiply(B_116,B_5)) ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_1322,c_5499]) ).
tff(c_10,plain,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_6521,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_5577,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP465-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.13/0.35 % Computer : n014.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:18 EDT 2023
% 0.13/0.35 % CPUTime :
% 5.21/2.41 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.21/2.42
% 5.21/2.42 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.72/2.45
% 5.72/2.45 Inference rules
% 5.72/2.45 ----------------------
% 5.72/2.45 #Ref : 0
% 5.72/2.45 #Sup : 1612
% 5.72/2.45 #Fact : 0
% 5.72/2.45 #Define : 0
% 5.72/2.45 #Split : 0
% 5.72/2.45 #Chain : 0
% 5.72/2.45 #Close : 0
% 5.72/2.45
% 5.72/2.45 Ordering : KBO
% 5.72/2.45
% 5.72/2.45 Simplification rules
% 5.72/2.45 ----------------------
% 5.72/2.45 #Subsume : 0
% 5.72/2.45 #Demod : 2321
% 5.72/2.45 #Tautology : 1046
% 5.72/2.45 #SimpNegUnit : 0
% 5.72/2.45 #BackRed : 15
% 5.72/2.45
% 5.72/2.45 #Partial instantiations: 0
% 5.72/2.45 #Strategies tried : 1
% 5.72/2.45
% 5.72/2.45 Timing (in seconds)
% 5.72/2.45 ----------------------
% 5.72/2.46 Preprocessing : 0.40
% 5.72/2.46 Parsing : 0.21
% 5.72/2.46 CNF conversion : 0.02
% 5.72/2.46 Main loop : 0.99
% 5.72/2.46 Inferencing : 0.37
% 5.72/2.46 Reduction : 0.39
% 5.72/2.46 Demodulation : 0.32
% 5.72/2.46 BG Simplification : 0.04
% 5.72/2.46 Subsumption : 0.13
% 5.72/2.46 Abstraction : 0.06
% 5.72/2.46 MUC search : 0.00
% 5.72/2.46 Cooper : 0.00
% 5.72/2.46 Total : 1.45
% 5.72/2.46 Index Insertion : 0.00
% 5.72/2.46 Index Deletion : 0.00
% 5.72/2.46 Index Matching : 0.00
% 5.72/2.46 BG Taut test : 0.00
%------------------------------------------------------------------------------