TSTP Solution File: GRP658-10 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP658-10 : TPTP v8.1.2. Released v8.1.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 : n004.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:50 EDT 2023
% Result : Unsatisfiable 12.40s 4.17s
% Output : CNFRefutation 12.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 38 ( 32 unt; 6 typ; 0 def)
% Number of atoms : 32 ( 31 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 10 ( 6 >; 4 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 0 con; 1-2 aty)
% Number of variables : 74 (; 74 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ tuple > rd > mult > ld > #nlpp > x1_2 > x1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(ld,type,
ld: ( $i * $i ) > $i ).
tff(rd,type,
rd: ( $i * $i ) > $i ).
tff(tuple,type,
tuple: ( $i * $i ) > $i ).
tff(x1,type,
x1: $i > $i ).
tff(x1_2,type,
x1_2: $i > $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(f_25,axiom,
! [A,B] : ( mult(A,ld(A,B)) = B ),
file(unknown,unknown) ).
tff(f_29,axiom,
! [A,B] : ( mult(rd(A,B),B) = A ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [A,B,C] : ( mult(mult(A,mult(B,B)),C) = mult(mult(A,B),mult(B,C)) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [A,B] : ( rd(mult(A,B),B) = A ),
file(unknown,unknown) ).
tff(f_27,axiom,
! [A,B] : ( ld(A,mult(A,B)) = B ),
file(unknown,unknown) ).
tff(f_36,axiom,
! [X0] : ( tuple(mult(X0,x1(X0)),mult(x1_2(X0),X0)) != tuple(x1(X0),x1_2(X0)) ),
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1,B_2] : ( mult(A_1,ld(A_1,B_2)) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_6,plain,
! [A_5,B_6] : ( mult(rd(A_5,B_6),B_6) = A_5 ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_88,plain,
! [A_23,B_24,C_25] : ( mult(mult(A_23,mult(B_24,B_24)),C_25) = mult(mult(A_23,B_24),mult(B_24,C_25)) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_165,plain,
! [A_29,B_30,B_31] : ( mult(mult(A_29,B_30),mult(B_30,ld(mult(A_29,mult(B_30,B_30)),B_31))) = B_31 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_88]) ).
tff(c_519,plain,
! [A_44,B_45,B_46] : ( mult(mult(rd(A_44,mult(B_45,B_45)),B_45),mult(B_45,ld(A_44,B_46))) = B_46 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_165]) ).
tff(c_842,plain,
! [A_51,B_52] : ( mult(mult(rd(A_51,mult(A_51,A_51)),A_51),B_52) = B_52 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_519]) ).
tff(c_8,plain,
! [A_7,B_8] : ( rd(mult(A_7,B_8),B_8) = A_7 ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_1249,plain,
! [B_59,A_60] : ( rd(B_59,B_59) = mult(rd(A_60,mult(A_60,A_60)),A_60) ),
inference(superposition,[status(thm),theory(equality)],[c_842,c_8]) ).
tff(c_603,plain,
! [A_1,B_2] : ( mult(mult(rd(A_1,mult(A_1,A_1)),A_1),B_2) = B_2 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_519]) ).
tff(c_1260,plain,
! [B_59,B_2] : ( mult(rd(B_59,B_59),B_2) = B_2 ),
inference(superposition,[status(thm),theory(equality)],[c_1249,c_603]) ).
tff(c_228,plain,
! [A_32,B_33,C_34] : ( mult(mult(rd(A_32,mult(B_33,B_33)),B_33),mult(B_33,C_34)) = mult(A_32,C_34) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_88]) ).
tff(c_259,plain,
! [A_32,C_34,B_33] : ( rd(mult(A_32,C_34),mult(B_33,C_34)) = mult(rd(A_32,mult(B_33,B_33)),B_33) ),
inference(superposition,[status(thm),theory(equality)],[c_228,c_8]) ).
tff(c_4,plain,
! [A_3,B_4] : ( ld(A_3,mult(A_3,B_4)) = B_4 ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_366,plain,
! [A_38,B_39,C_40] : ( ld(mult(A_38,mult(B_39,B_39)),mult(mult(A_38,B_39),mult(B_39,C_40))) = C_40 ),
inference(superposition,[status(thm),theory(equality)],[c_88,c_4]) ).
tff(c_8220,plain,
! [A_142,A_143,B_144] : ( ld(mult(A_142,mult(A_143,A_143)),mult(mult(A_142,A_143),B_144)) = ld(A_143,B_144) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_366]) ).
tff(c_8272,plain,
! [A_32,B_33,C_34,B_144] : ( ld(mult(rd(A_32,mult(B_33,B_33)),mult(B_33,B_33)),mult(rd(mult(A_32,C_34),mult(B_33,C_34)),B_144)) = ld(B_33,B_144) ),
inference(superposition,[status(thm),theory(equality)],[c_259,c_8220]) ).
tff(c_14643,plain,
! [A_185,C_186,B_187,B_188] : ( ld(A_185,mult(rd(mult(A_185,C_186),mult(B_187,C_186)),B_188)) = ld(B_187,B_188) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_8272]) ).
tff(c_947,plain,
! [A_51,B_2] : ( ld(mult(rd(A_51,mult(A_51,A_51)),A_51),B_2) = B_2 ),
inference(superposition,[status(thm),theory(equality)],[c_842,c_2]) ).
tff(c_14686,plain,
! [A_51,C_186,B_187,B_188] : ( mult(rd(mult(mult(rd(A_51,mult(A_51,A_51)),A_51),C_186),mult(B_187,C_186)),B_188) = ld(B_187,B_188) ),
inference(superposition,[status(thm),theory(equality)],[c_14643,c_947]) ).
tff(c_14986,plain,
! [C_189,B_190,B_191] : ( mult(rd(C_189,mult(B_190,C_189)),B_191) = ld(B_190,B_191) ),
inference(demodulation,[status(thm),theory(equality)],[c_603,c_14686]) ).
tff(c_953,plain,
! [B_52,A_51] : ( rd(B_52,B_52) = mult(rd(A_51,mult(A_51,A_51)),A_51) ),
inference(superposition,[status(thm),theory(equality)],[c_842,c_8]) ).
tff(c_16579,plain,
! [B_199,B_200] : ( rd(B_199,B_199) = ld(B_200,B_200) ),
inference(superposition,[status(thm),theory(equality)],[c_14986,c_953]) ).
tff(c_18010,plain,
! [B_208,B_209] : ( mult(B_208,rd(B_209,B_209)) = B_208 ),
inference(superposition,[status(thm),theory(equality)],[c_16579,c_2]) ).
tff(c_12,plain,
! [X0_12] : ( tuple(mult(X0_12,x1(X0_12)),mult(x1_2(X0_12),X0_12)) != tuple(x1(X0_12),x1_2(X0_12)) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_18263,plain,
! [B_209] : ( tuple(mult(rd(B_209,B_209),x1(rd(B_209,B_209))),x1_2(rd(B_209,B_209))) != tuple(x1(rd(B_209,B_209)),x1_2(rd(B_209,B_209))) ),
inference(superposition,[status(thm),theory(equality)],[c_18010,c_12]) ).
tff(c_18423,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1260,c_18263]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP658-10 : TPTP v8.1.2. Released v8.1.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.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 22:09:56 EDT 2023
% 0.13/0.34 % CPUTime :
% 12.40/4.17 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.40/4.18
% 12.40/4.18 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 12.47/4.21
% 12.47/4.21 Inference rules
% 12.47/4.21 ----------------------
% 12.47/4.21 #Ref : 0
% 12.47/4.21 #Sup : 4668
% 12.47/4.21 #Fact : 0
% 12.47/4.21 #Define : 0
% 12.47/4.21 #Split : 0
% 12.47/4.21 #Chain : 0
% 12.47/4.21 #Close : 0
% 12.47/4.21
% 12.47/4.21 Ordering : KBO
% 12.47/4.21
% 12.47/4.21 Simplification rules
% 12.47/4.21 ----------------------
% 12.47/4.21 #Subsume : 798
% 12.47/4.21 #Demod : 5295
% 12.47/4.21 #Tautology : 1359
% 12.47/4.21 #SimpNegUnit : 0
% 12.47/4.21 #BackRed : 12
% 12.47/4.21
% 12.47/4.21 #Partial instantiations: 0
% 12.47/4.21 #Strategies tried : 1
% 12.47/4.21
% 12.47/4.21 Timing (in seconds)
% 12.47/4.21 ----------------------
% 12.47/4.21 Preprocessing : 0.41
% 12.47/4.21 Parsing : 0.22
% 12.47/4.21 CNF conversion : 0.02
% 12.47/4.21 Main loop : 2.76
% 12.47/4.21 Inferencing : 0.81
% 12.47/4.21 Reduction : 1.43
% 12.47/4.21 Demodulation : 1.26
% 12.47/4.21 BG Simplification : 0.11
% 12.47/4.21 Subsumption : 0.29
% 12.47/4.21 Abstraction : 0.20
% 12.47/4.21 MUC search : 0.00
% 12.47/4.21 Cooper : 0.00
% 12.47/4.21 Total : 3.22
% 12.47/4.21 Index Insertion : 0.00
% 12.47/4.21 Index Deletion : 0.00
% 12.47/4.21 Index Matching : 0.00
% 12.47/4.21 BG Taut test : 0.00
%------------------------------------------------------------------------------