TSTP Solution File: GRP491-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP491-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 : n019.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:22 EDT 2023
% Result : Unsatisfiable 3.16s 2.23s
% Output : CNFRefutation 3.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 10
% Syntax : Number of formulae : 58 ( 53 unt; 5 typ; 0 def)
% Number of atoms : 53 ( 52 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 65 (; 65 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > double_divide > #nlpp > inverse > identity > a2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(inverse,type,
inverse: $i > $i ).
tff(double_divide,type,
double_divide: ( $i * $i ) > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(a2,type,
a2: $i ).
tff(identity,type,
identity: $i ).
tff(f_27,axiom,
! [A] : ( inverse(A) = double_divide(A,identity) ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [A,B] : ( multiply(A,B) = double_divide(double_divide(B,A),identity) ),
file(unknown,unknown) ).
tff(f_29,axiom,
! [A] : ( identity = double_divide(A,inverse(A)) ),
file(unknown,unknown) ).
tff(f_23,axiom,
! [A,B,C] : ( double_divide(double_divide(identity,A),double_divide(identity,double_divide(double_divide(double_divide(A,B),identity),double_divide(C,B)))) = C ),
file(unknown,unknown) ).
tff(f_31,axiom,
multiply(identity,a2) != a2,
file(unknown,unknown) ).
tff(c_6,plain,
! [A_6] : ( double_divide(A_6,identity) = inverse(A_6) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_28,plain,
! [B_10,A_11] : ( double_divide(double_divide(B_10,A_11),identity) = multiply(A_11,B_10) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_49,plain,
! [B_10,A_11] : ( inverse(double_divide(B_10,A_11)) = multiply(A_11,B_10) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_28]) ).
tff(c_8,plain,
! [A_7] : ( double_divide(A_7,inverse(A_7)) = identity ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_172,plain,
! [A_19] : ( double_divide(inverse(A_19),identity) = multiply(identity,A_19) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_28]) ).
tff(c_178,plain,
! [A_19] : ( multiply(identity,inverse(A_19)) = inverse(multiply(identity,A_19)) ),
inference(superposition,[status(thm),theory(equality)],[c_172,c_49]) ).
tff(c_122,plain,
! [B_16,A_17] : ( inverse(double_divide(B_16,A_17)) = multiply(A_17,B_16) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_28]) ).
tff(c_140,plain,
! [A_6] : ( inverse(inverse(A_6)) = multiply(identity,A_6) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_122]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( double_divide(double_divide(identity,A_1),double_divide(identity,double_divide(double_divide(double_divide(A_1,B_2),identity),double_divide(C_3,B_2)))) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_65,plain,
! [A_13,B_14,C_15] : ( double_divide(double_divide(identity,A_13),double_divide(identity,double_divide(inverse(double_divide(A_13,B_14)),double_divide(C_15,B_14)))) = C_15 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_2]) ).
tff(c_99,plain,
! [A_6,C_15] : ( double_divide(double_divide(identity,A_6),double_divide(identity,double_divide(inverse(inverse(A_6)),double_divide(C_15,identity)))) = C_15 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_65]) ).
tff(c_118,plain,
! [A_6,C_15] : ( double_divide(double_divide(identity,A_6),double_divide(identity,double_divide(inverse(inverse(A_6)),inverse(C_15)))) = C_15 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_99]) ).
tff(c_424,plain,
! [A_29,C_30] : ( double_divide(double_divide(identity,A_29),double_divide(identity,double_divide(multiply(identity,A_29),inverse(C_30)))) = C_30 ),
inference(demodulation,[status(thm),theory(equality)],[c_140,c_118]) ).
tff(c_469,plain,
! [A_29] : ( double_divide(double_divide(identity,A_29),double_divide(identity,identity)) = multiply(identity,A_29) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_424]) ).
tff(c_476,plain,
! [A_31] : ( double_divide(double_divide(identity,A_31),inverse(identity)) = multiply(identity,A_31) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_469]) ).
tff(c_505,plain,
multiply(identity,inverse(identity)) = double_divide(identity,inverse(identity)),
inference(superposition,[status(thm),theory(equality)],[c_8,c_476]) ).
tff(c_509,plain,
inverse(multiply(identity,identity)) = identity,
inference(demodulation,[status(thm),theory(equality)],[c_178,c_8,c_505]) ).
tff(c_501,plain,
double_divide(inverse(identity),inverse(identity)) = multiply(identity,identity),
inference(superposition,[status(thm),theory(equality)],[c_6,c_476]) ).
tff(c_654,plain,
multiply(inverse(identity),inverse(identity)) = inverse(multiply(identity,identity)),
inference(superposition,[status(thm),theory(equality)],[c_501,c_49]) ).
tff(c_661,plain,
multiply(inverse(identity),inverse(identity)) = identity,
inference(demodulation,[status(thm),theory(equality)],[c_509,c_654]) ).
tff(c_112,plain,
! [A_13,A_7] : ( double_divide(double_divide(identity,A_13),double_divide(identity,double_divide(inverse(double_divide(A_13,inverse(A_7))),identity))) = A_7 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_65]) ).
tff(c_120,plain,
! [A_13,A_7] : ( double_divide(double_divide(identity,A_13),double_divide(identity,inverse(inverse(double_divide(A_13,inverse(A_7)))))) = A_7 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_112]) ).
tff(c_595,plain,
! [A_13,A_7] : ( double_divide(double_divide(identity,A_13),double_divide(identity,inverse(multiply(inverse(A_7),A_13)))) = A_7 ),
inference(demodulation,[status(thm),theory(equality)],[c_49,c_120]) ).
tff(c_667,plain,
double_divide(double_divide(identity,inverse(identity)),double_divide(identity,inverse(identity))) = identity,
inference(superposition,[status(thm),theory(equality)],[c_661,c_595]) ).
tff(c_676,plain,
inverse(identity) = identity,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_8,c_8,c_667]) ).
tff(c_52,plain,
! [A_7] : ( multiply(inverse(A_7),A_7) = double_divide(identity,identity) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_28]) ).
tff(c_57,plain,
! [A_7] : ( multiply(inverse(A_7),A_7) = inverse(identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_52]) ).
tff(c_779,plain,
! [A_34] : ( multiply(inverse(A_34),A_34) = identity ),
inference(demodulation,[status(thm),theory(equality)],[c_676,c_57]) ).
tff(c_784,plain,
! [A_34] : ( double_divide(double_divide(identity,A_34),double_divide(identity,inverse(identity))) = A_34 ),
inference(superposition,[status(thm),theory(equality)],[c_779,c_595]) ).
tff(c_800,plain,
! [A_34] : ( multiply(A_34,identity) = A_34 ),
inference(demodulation,[status(thm),theory(equality)],[c_49,c_6,c_8,c_784]) ).
tff(c_805,plain,
! [A_35] : ( multiply(A_35,identity) = A_35 ),
inference(demodulation,[status(thm),theory(equality)],[c_49,c_6,c_8,c_784]) ).
tff(c_131,plain,
! [B_16,A_17] : ( double_divide(double_divide(B_16,A_17),multiply(A_17,B_16)) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_122,c_8]) ).
tff(c_915,plain,
! [A_38] : ( double_divide(double_divide(identity,A_38),A_38) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_805,c_131]) ).
tff(c_929,plain,
! [A_38] : ( multiply(A_38,double_divide(identity,A_38)) = inverse(identity) ),
inference(superposition,[status(thm),theory(equality)],[c_915,c_49]) ).
tff(c_978,plain,
! [A_39] : ( multiply(A_39,double_divide(identity,A_39)) = identity ),
inference(demodulation,[status(thm),theory(equality)],[c_676,c_929]) ).
tff(c_984,plain,
! [A_7] : ( double_divide(double_divide(identity,double_divide(identity,inverse(A_7))),double_divide(identity,inverse(identity))) = A_7 ),
inference(superposition,[status(thm),theory(equality)],[c_978,c_595]) ).
tff(c_1021,plain,
! [A_7] : ( double_divide(identity,inverse(A_7)) = A_7 ),
inference(demodulation,[status(thm),theory(equality)],[c_800,c_49,c_6,c_8,c_984]) ).
tff(c_96,plain,
! [B_14,C_15] : ( double_divide(inverse(identity),double_divide(identity,double_divide(inverse(double_divide(identity,B_14)),double_divide(C_15,B_14)))) = C_15 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_65]) ).
tff(c_846,plain,
! [B_36,C_37] : ( double_divide(identity,double_divide(identity,double_divide(B_36,double_divide(C_37,B_36)))) = C_37 ),
inference(demodulation,[status(thm),theory(equality)],[c_800,c_676,c_49,c_96]) ).
tff(c_900,plain,
! [A_6] : ( double_divide(identity,double_divide(identity,double_divide(identity,inverse(A_6)))) = A_6 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_846]) ).
tff(c_1149,plain,
! [A_42] : ( double_divide(identity,double_divide(identity,A_42)) = A_42 ),
inference(demodulation,[status(thm),theory(equality)],[c_1021,c_900]) ).
tff(c_4,plain,
! [B_5,A_4] : ( double_divide(double_divide(B_5,A_4),identity) = multiply(A_4,B_5) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_31,plain,
! [B_10,A_11] : ( multiply(identity,double_divide(B_10,A_11)) = double_divide(multiply(A_11,B_10),identity) ),
inference(superposition,[status(thm),theory(equality)],[c_28,c_4]) ).
tff(c_53,plain,
! [B_10,A_11] : ( multiply(identity,double_divide(B_10,A_11)) = inverse(multiply(A_11,B_10)) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_31]) ).
tff(c_1181,plain,
! [A_42] : ( inverse(multiply(double_divide(identity,A_42),identity)) = multiply(identity,A_42) ),
inference(superposition,[status(thm),theory(equality)],[c_1149,c_53]) ).
tff(c_1223,plain,
! [A_42] : ( multiply(identity,A_42) = A_42 ),
inference(demodulation,[status(thm),theory(equality)],[c_800,c_49,c_800,c_1181]) ).
tff(c_10,plain,
multiply(identity,a2) != a2,
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_1239,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1223,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP491-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.12 % 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.12/0.32 % Computer : n019.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Thu Aug 3 22:05:16 EDT 2023
% 0.12/0.32 % CPUTime :
% 3.16/2.23 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.16/2.24
% 3.16/2.24 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.16/2.27
% 3.16/2.27 Inference rules
% 3.16/2.27 ----------------------
% 3.16/2.27 #Ref : 0
% 3.16/2.27 #Sup : 317
% 3.16/2.27 #Fact : 0
% 3.16/2.27 #Define : 0
% 3.16/2.27 #Split : 0
% 3.16/2.27 #Chain : 0
% 3.16/2.27 #Close : 0
% 3.16/2.27
% 3.16/2.27 Ordering : KBO
% 3.16/2.27
% 3.16/2.27 Simplification rules
% 3.16/2.27 ----------------------
% 3.16/2.27 #Subsume : 0
% 3.16/2.27 #Demod : 322
% 3.16/2.27 #Tautology : 183
% 3.16/2.27 #SimpNegUnit : 0
% 3.16/2.27 #BackRed : 18
% 3.16/2.27
% 3.16/2.27 #Partial instantiations: 0
% 3.16/2.27 #Strategies tried : 1
% 3.16/2.27
% 3.16/2.27 Timing (in seconds)
% 3.16/2.27 ----------------------
% 3.16/2.28 Preprocessing : 0.59
% 3.16/2.28 Parsing : 0.31
% 3.16/2.28 CNF conversion : 0.03
% 3.16/2.28 Main loop : 0.57
% 3.16/2.28 Inferencing : 0.21
% 3.16/2.28 Reduction : 0.19
% 3.16/2.28 Demodulation : 0.15
% 3.16/2.28 BG Simplification : 0.03
% 3.16/2.28 Subsumption : 0.09
% 3.16/2.28 Abstraction : 0.03
% 3.16/2.28 MUC search : 0.00
% 3.16/2.28 Cooper : 0.00
% 3.16/2.28 Total : 1.22
% 3.16/2.28 Index Insertion : 0.00
% 3.16/2.28 Index Deletion : 0.00
% 3.16/2.28 Index Matching : 0.00
% 3.16/2.28 BG Taut test : 0.00
%------------------------------------------------------------------------------