TSTP Solution File: GRP564-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP564-1 : TPTP v8.1.2. Bugfixed v2.7.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 : 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:31 EDT 2023
% Result : Unsatisfiable 4.08s 2.03s
% Output : CNFRefutation 4.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 24 unt; 5 typ; 0 def)
% Number of atoms : 24 ( 23 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 : 7 ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 57 (; 57 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(divide,type,
divide: ( $i * $i ) > $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(f_26,axiom,
! [A,B] : ( multiply(A,B) = divide(A,inverse(B)) ),
file(unknown,unknown) ).
tff(f_24,axiom,
! [A,B,C] : ( divide(divide(divide(A,inverse(B)),C),divide(A,C)) = B ),
file(unknown,unknown) ).
tff(f_28,axiom,
multiply(a,b) != multiply(b,a),
file(unknown,unknown) ).
tff(c_4,plain,
! [A_4,B_5] : ( divide(A_4,inverse(B_5)) = multiply(A_4,B_5) ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( divide(divide(divide(A_1,inverse(B_2)),C_3),divide(A_1,C_3)) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_7,plain,
! [A_1,B_2,C_3] : ( divide(divide(multiply(A_1,B_2),C_3),divide(A_1,C_3)) = B_2 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_2]) ).
tff(c_17,plain,
! [A_8,B_9,C_10] : ( divide(divide(multiply(A_8,B_9),C_10),divide(A_8,C_10)) = B_9 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_2]) ).
tff(c_57,plain,
! [A_14,B_15,C_16,B_17] : ( divide(divide(multiply(divide(multiply(A_14,B_15),C_16),B_17),divide(A_14,C_16)),B_15) = B_17 ),
inference(superposition,[status(thm),theory(equality)],[c_7,c_17]) ).
tff(c_148,plain,
! [A_25,B_26,C_27,B_28] : ( multiply(divide(multiply(divide(multiply(A_25,inverse(B_26)),C_27),B_28),divide(A_25,C_27)),B_26) = B_28 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_57]) ).
tff(c_26,plain,
! [A_1,B_2,C_3,B_9] : ( divide(divide(multiply(divide(multiply(A_1,B_2),C_3),B_9),divide(A_1,C_3)),B_2) = B_9 ),
inference(superposition,[status(thm),theory(equality)],[c_7,c_17]) ).
tff(c_180,plain,
! [B_28,A_25,B_26,C_27] : ( divide(divide(B_28,divide(divide(multiply(A_25,inverse(B_26)),C_27),divide(A_25,C_27))),B_28) = B_26 ),
inference(superposition,[status(thm),theory(equality)],[c_148,c_26]) ).
tff(c_233,plain,
! [B_28,B_26] : ( divide(multiply(B_28,B_26),B_28) = B_26 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_7,c_180]) ).
tff(c_238,plain,
! [B_29,B_30] : ( divide(multiply(B_29,B_30),B_29) = B_30 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_7,c_180]) ).
tff(c_684,plain,
! [B_43,B_44] : ( multiply(multiply(inverse(B_43),B_44),B_43) = B_44 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_238]) ).
tff(c_1151,plain,
! [B_51,B_52] : ( divide(B_51,multiply(inverse(B_52),B_51)) = B_52 ),
inference(superposition,[status(thm),theory(equality)],[c_684,c_233]) ).
tff(c_33,plain,
! [A_8,B_9,B_5] : ( divide(multiply(multiply(A_8,B_9),B_5),divide(A_8,inverse(B_5))) = B_9 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_17]) ).
tff(c_41,plain,
! [A_11,B_12,B_13] : ( divide(multiply(multiply(A_11,B_12),B_13),multiply(A_11,B_13)) = B_12 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_33]) ).
tff(c_47,plain,
! [B_12,A_11,B_13] : ( divide(B_12,divide(multiply(A_11,B_12),multiply(A_11,B_13))) = B_13 ),
inference(superposition,[status(thm),theory(equality)],[c_41,c_7]) ).
tff(c_1176,plain,
! [B_52,B_12] : ( multiply(inverse(B_52),B_12) = divide(B_12,B_52) ),
inference(superposition,[status(thm),theory(equality)],[c_1151,c_47]) ).
tff(c_282,plain,
! [B_5,B_30] : ( multiply(multiply(inverse(B_5),B_30),B_5) = B_30 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_238]) ).
tff(c_1374,plain,
! [B_57,B_58] : ( multiply(divide(B_57,B_58),B_58) = B_57 ),
inference(demodulation,[status(thm),theory(equality)],[c_1176,c_282]) ).
tff(c_1472,plain,
! [B_28,B_26] : ( multiply(B_28,B_26) = multiply(B_26,B_28) ),
inference(superposition,[status(thm),theory(equality)],[c_233,c_1374]) ).
tff(c_6,plain,
multiply(b,a) != multiply(a,b),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_1749,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1472,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP564-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.00/0.14 % 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.13/0.35 % Computer : n021.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:25:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.08/2.03 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.08/2.04
% 4.08/2.04 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.28/2.07
% 4.28/2.07 Inference rules
% 4.28/2.07 ----------------------
% 4.28/2.07 #Ref : 0
% 4.28/2.07 #Sup : 450
% 4.28/2.07 #Fact : 0
% 4.28/2.07 #Define : 0
% 4.28/2.07 #Split : 0
% 4.28/2.07 #Chain : 0
% 4.28/2.07 #Close : 0
% 4.28/2.07
% 4.28/2.07 Ordering : KBO
% 4.28/2.07
% 4.28/2.07 Simplification rules
% 4.28/2.07 ----------------------
% 4.28/2.07 #Subsume : 22
% 4.28/2.07 #Demod : 176
% 4.28/2.07 #Tautology : 151
% 4.28/2.07 #SimpNegUnit : 0
% 4.28/2.07 #BackRed : 5
% 4.28/2.07
% 4.28/2.07 #Partial instantiations: 0
% 4.28/2.07 #Strategies tried : 1
% 4.28/2.07
% 4.28/2.07 Timing (in seconds)
% 4.28/2.07 ----------------------
% 4.28/2.08 Preprocessing : 0.39
% 4.28/2.08 Parsing : 0.21
% 4.28/2.08 CNF conversion : 0.02
% 4.28/2.08 Main loop : 0.62
% 4.28/2.08 Inferencing : 0.25
% 4.28/2.08 Reduction : 0.19
% 4.28/2.08 Demodulation : 0.15
% 4.28/2.08 BG Simplification : 0.04
% 4.28/2.08 Subsumption : 0.10
% 4.28/2.08 Abstraction : 0.04
% 4.28/2.08 MUC search : 0.00
% 4.28/2.08 Cooper : 0.00
% 4.28/2.08 Total : 1.06
% 4.28/2.08 Index Insertion : 0.00
% 4.28/2.08 Index Deletion : 0.00
% 4.28/2.08 Index Matching : 0.00
% 4.28/2.08 BG Taut test : 0.00
%------------------------------------------------------------------------------