TSTP Solution File: GRP548-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP548-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 : n009.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:29 EDT 2023
% Result : Unsatisfiable 3.32s 1.89s
% Output : CNFRefutation 3.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 46 ( 40 unt; 6 typ; 0 def)
% Number of atoms : 40 ( 39 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 61 (; 61 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > identity > 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(identity,type,
identity: $i ).
tff(f_28,axiom,
! [A] : ( inverse(A) = divide(identity,A) ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [A,B] : ( multiply(A,B) = divide(A,divide(identity,B)) ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [A] : ( identity = divide(A,A) ),
file(unknown,unknown) ).
tff(f_24,axiom,
! [A,B,C] : ( divide(divide(identity,divide(A,B)),divide(divide(B,C),A)) = C ),
file(unknown,unknown) ).
tff(f_32,axiom,
multiply(a,b) != multiply(b,a),
file(unknown,unknown) ).
tff(c_6,plain,
! [A_6] : ( divide(identity,A_6) = inverse(A_6) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
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_26]) ).
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_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_63,plain,
! [B_11] : ( inverse(inverse(B_11)) = multiply(identity,B_11) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_42]) ).
tff(c_8,plain,
! [A_7] : ( divide(A_7,A_7) = identity ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_20,plain,
! [A_9] : ( divide(identity,A_9) = inverse(A_9) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_27,plain,
inverse(identity) = identity,
inference(superposition,[status(thm),theory(equality)],[c_20,c_8]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( divide(divide(identity,divide(A_1,B_2)),divide(divide(B_2,C_3),A_1)) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_183,plain,
! [A_17,B_18,C_19] : ( divide(inverse(divide(A_17,B_18)),divide(divide(B_18,C_19),A_17)) = C_19 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_2]) ).
tff(c_220,plain,
! [A_7,C_19] : ( divide(inverse(identity),divide(divide(A_7,C_19),A_7)) = C_19 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_183]) ).
tff(c_237,plain,
! [A_20,C_21] : ( inverse(divide(divide(A_20,C_21),A_20)) = C_21 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_27,c_220]) ).
tff(c_277,plain,
! [A_7] : ( inverse(divide(identity,A_7)) = A_7 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_237]) ).
tff(c_281,plain,
! [A_7] : ( multiply(identity,A_7) = A_7 ),
inference(demodulation,[status(thm),theory(equality)],[c_63,c_6,c_277]) ).
tff(c_305,plain,
! [B_23] : ( inverse(inverse(B_23)) = B_23 ),
inference(demodulation,[status(thm),theory(equality)],[c_281,c_63]) ).
tff(c_942,plain,
! [A_42,B_43] : ( multiply(A_42,inverse(B_43)) = divide(A_42,B_43) ),
inference(superposition,[status(thm),theory(equality)],[c_305,c_11]) ).
tff(c_284,plain,
! [B_11] : ( inverse(inverse(B_11)) = B_11 ),
inference(demodulation,[status(thm),theory(equality)],[c_281,c_63]) ).
tff(c_274,plain,
! [A_6] : ( inverse(divide(inverse(A_6),identity)) = A_6 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_237]) ).
tff(c_335,plain,
! [A_24] : ( inverse(divide(inverse(A_24),identity)) = A_24 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_237]) ).
tff(c_405,plain,
! [B_26] : ( inverse(divide(B_26,identity)) = inverse(B_26) ),
inference(superposition,[status(thm),theory(equality)],[c_284,c_335]) ).
tff(c_414,plain,
! [B_26] : ( inverse(divide(inverse(B_26),identity)) = divide(B_26,identity) ),
inference(superposition,[status(thm),theory(equality)],[c_405,c_274]) ).
tff(c_468,plain,
! [B_27] : ( divide(B_27,identity) = B_27 ),
inference(demodulation,[status(thm),theory(equality)],[c_274,c_414]) ).
tff(c_12,plain,
! [A_1,B_2,C_3] : ( divide(inverse(divide(A_1,B_2)),divide(divide(B_2,C_3),A_1)) = C_3 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_2]) ).
tff(c_488,plain,
! [B_2,C_3] : ( divide(inverse(divide(identity,B_2)),divide(B_2,C_3)) = C_3 ),
inference(superposition,[status(thm),theory(equality)],[c_468,c_12]) ).
tff(c_628,plain,
! [B_33,C_34] : ( divide(B_33,divide(B_33,C_34)) = C_34 ),
inference(demodulation,[status(thm),theory(equality)],[c_284,c_6,c_488]) ).
tff(c_235,plain,
! [A_7,C_19] : ( inverse(divide(divide(A_7,C_19),A_7)) = C_19 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_27,c_220]) ).
tff(c_223,plain,
! [A_17,A_7] : ( divide(inverse(divide(A_17,A_7)),divide(identity,A_17)) = A_7 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_183]) ).
tff(c_519,plain,
! [A_28,A_29] : ( multiply(inverse(divide(A_28,A_29)),A_28) = A_29 ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_6,c_223]) ).
tff(c_531,plain,
! [C_19,A_7] : ( multiply(C_19,divide(A_7,C_19)) = A_7 ),
inference(superposition,[status(thm),theory(equality)],[c_235,c_519]) ).
tff(c_637,plain,
! [B_33,C_34] : ( multiply(divide(B_33,C_34),C_34) = B_33 ),
inference(superposition,[status(thm),theory(equality)],[c_628,c_531]) ).
tff(c_952,plain,
! [B_33,B_43] : ( divide(divide(B_33,inverse(B_43)),B_43) = B_33 ),
inference(superposition,[status(thm),theory(equality)],[c_942,c_637]) ).
tff(c_1013,plain,
! [B_44,B_45] : ( divide(multiply(B_44,B_45),B_45) = B_44 ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_952]) ).
tff(c_1025,plain,
! [B_45,B_44] : ( multiply(B_45,B_44) = multiply(B_44,B_45) ),
inference(superposition,[status(thm),theory(equality)],[c_1013,c_531]) ).
tff(c_10,plain,
multiply(b,a) != multiply(a,b),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_1196,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1025,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP548-1 : TPTP v8.1.2. Bugfixed v2.7.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.13/0.35 % Computer : n009.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.19/0.35 % CPULimit : 300
% 0.19/0.35 % WCLimit : 300
% 0.19/0.35 % DateTime : Thu Aug 3 22:16:53 EDT 2023
% 0.19/0.35 % CPUTime :
% 3.32/1.89 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.32/1.89
% 3.32/1.89 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.49/1.92
% 3.49/1.92 Inference rules
% 3.49/1.92 ----------------------
% 3.49/1.92 #Ref : 0
% 3.49/1.92 #Sup : 295
% 3.49/1.92 #Fact : 0
% 3.49/1.92 #Define : 0
% 3.49/1.92 #Split : 0
% 3.49/1.92 #Chain : 0
% 3.49/1.92 #Close : 0
% 3.49/1.92
% 3.49/1.92 Ordering : KBO
% 3.49/1.92
% 3.49/1.92 Simplification rules
% 3.49/1.92 ----------------------
% 3.49/1.92 #Subsume : 0
% 3.49/1.92 #Demod : 195
% 3.49/1.92 #Tautology : 189
% 3.49/1.92 #SimpNegUnit : 0
% 3.49/1.92 #BackRed : 5
% 3.49/1.92
% 3.49/1.92 #Partial instantiations: 0
% 3.49/1.92 #Strategies tried : 1
% 3.49/1.92
% 3.49/1.92 Timing (in seconds)
% 3.49/1.92 ----------------------
% 3.49/1.92 Preprocessing : 0.41
% 3.49/1.93 Parsing : 0.21
% 3.49/1.93 CNF conversion : 0.02
% 3.49/1.93 Main loop : 0.46
% 3.49/1.93 Inferencing : 0.18
% 3.49/1.93 Reduction : 0.15
% 3.49/1.93 Demodulation : 0.11
% 3.49/1.93 BG Simplification : 0.02
% 3.49/1.93 Subsumption : 0.07
% 3.49/1.93 Abstraction : 0.03
% 3.49/1.93 MUC search : 0.00
% 3.49/1.93 Cooper : 0.00
% 3.49/1.93 Total : 0.92
% 3.49/1.93 Index Insertion : 0.00
% 3.49/1.93 Index Deletion : 0.00
% 3.49/1.93 Index Matching : 0.00
% 3.49/1.93 BG Taut test : 0.00
%------------------------------------------------------------------------------