TSTP Solution File: GRP570-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP570-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 : 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:32 EDT 2023
% Result : Unsatisfiable 3.89s 1.97s
% Output : CNFRefutation 3.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 48 ( 43 unt; 5 typ; 0 def)
% Number of atoms : 43 ( 42 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 : 6 ( 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 : 58 (; 58 !; 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(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(C,identity))),double_divide(identity,identity)) = B ),
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_94,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_125,plain,
! [A_18] : ( inverse(inverse(A_18)) = multiply(identity,A_18) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_94]) ).
tff(c_8,plain,
! [A_7] : ( double_divide(A_7,inverse(A_7)) = identity ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_140,plain,
! [A_18] : ( double_divide(inverse(A_18),multiply(identity,A_18)) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_125,c_8]) ).
tff(c_118,plain,
! [A_6] : ( inverse(inverse(A_6)) = multiply(identity,A_6) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_94]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( double_divide(double_divide(A_1,double_divide(double_divide(B_2,double_divide(A_1,C_3)),double_divide(C_3,identity))),double_divide(identity,identity)) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_65,plain,
! [A_13,B_14,C_15] : ( double_divide(double_divide(A_13,double_divide(double_divide(B_14,double_divide(A_13,C_15)),inverse(C_15))),inverse(identity)) = B_14 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_6,c_2]) ).
tff(c_89,plain,
! [A_7,B_14] : ( double_divide(double_divide(A_7,double_divide(double_divide(B_14,identity),inverse(inverse(A_7)))),inverse(identity)) = B_14 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_65]) ).
tff(c_93,plain,
! [A_7,B_14] : ( double_divide(double_divide(A_7,double_divide(inverse(B_14),inverse(inverse(A_7)))),inverse(identity)) = B_14 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_89]) ).
tff(c_425,plain,
! [A_29,B_30] : ( double_divide(double_divide(A_29,double_divide(inverse(B_30),multiply(identity,A_29))),inverse(identity)) = B_30 ),
inference(demodulation,[status(thm),theory(equality)],[c_118,c_93]) ).
tff(c_458,plain,
! [A_18] : ( double_divide(double_divide(A_18,identity),inverse(identity)) = A_18 ),
inference(superposition,[status(thm),theory(equality)],[c_140,c_425]) ).
tff(c_469,plain,
! [A_18] : ( double_divide(inverse(A_18),inverse(identity)) = A_18 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_458]) ).
tff(c_470,plain,
! [A_31] : ( double_divide(inverse(A_31),inverse(identity)) = A_31 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_458]) ).
tff(c_497,plain,
! [A_6] : ( double_divide(multiply(identity,A_6),inverse(identity)) = inverse(A_6) ),
inference(superposition,[status(thm),theory(equality)],[c_118,c_470]) ).
tff(c_575,plain,
! [A_34,B_35] : ( double_divide(double_divide(A_34,double_divide(double_divide(B_35,inverse(A_34)),inverse(identity))),inverse(identity)) = B_35 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_65]) ).
tff(c_608,plain,
! [A_6] : ( double_divide(double_divide(identity,double_divide(inverse(A_6),inverse(identity))),inverse(identity)) = multiply(identity,A_6) ),
inference(superposition,[status(thm),theory(equality)],[c_497,c_575]) ).
tff(c_1025,plain,
! [A_48] : ( double_divide(double_divide(identity,A_48),inverse(identity)) = multiply(identity,A_48) ),
inference(demodulation,[status(thm),theory(equality)],[c_469,c_608]) ).
tff(c_1109,plain,
double_divide(inverse(identity),inverse(identity)) = multiply(identity,identity),
inference(superposition,[status(thm),theory(equality)],[c_6,c_1025]) ).
tff(c_1125,plain,
multiply(identity,identity) = identity,
inference(demodulation,[status(thm),theory(equality)],[c_469,c_1109]) ).
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_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_106,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_94,c_8]) ).
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_636,plain,
! [B_36,A_37,B_38] : ( double_divide(double_divide(double_divide(B_36,A_37),double_divide(double_divide(B_38,multiply(A_37,B_36)),inverse(identity))),inverse(identity)) = B_38 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_65]) ).
tff(c_702,plain,
! [B_16,A_17] : ( double_divide(double_divide(double_divide(B_16,A_17),double_divide(identity,inverse(identity))),inverse(identity)) = double_divide(B_16,A_17) ),
inference(superposition,[status(thm),theory(equality)],[c_106,c_636]) ).
tff(c_745,plain,
! [A_39,B_40] : ( double_divide(multiply(A_39,B_40),inverse(identity)) = double_divide(B_40,A_39) ),
inference(demodulation,[status(thm),theory(equality)],[c_49,c_6,c_8,c_702]) ).
tff(c_770,plain,
! [A_39,B_40] : ( multiply(inverse(identity),multiply(A_39,B_40)) = inverse(double_divide(B_40,A_39)) ),
inference(superposition,[status(thm),theory(equality)],[c_745,c_49]) ).
tff(c_804,plain,
! [A_39,B_40] : ( multiply(inverse(identity),multiply(A_39,B_40)) = multiply(A_39,B_40) ),
inference(demodulation,[status(thm),theory(equality)],[c_49,c_770]) ).
tff(c_1130,plain,
multiply(inverse(identity),identity) = multiply(identity,identity),
inference(superposition,[status(thm),theory(equality)],[c_1125,c_804]) ).
tff(c_1157,plain,
inverse(identity) = identity,
inference(demodulation,[status(thm),theory(equality)],[c_1125,c_57,c_1130]) ).
tff(c_1174,plain,
! [A_18] : ( double_divide(inverse(A_18),identity) = A_18 ),
inference(demodulation,[status(thm),theory(equality)],[c_1157,c_469]) ).
tff(c_46,plain,
! [A_6] : ( double_divide(inverse(A_6),identity) = multiply(identity,A_6) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_28]) ).
tff(c_1347,plain,
! [A_6] : ( multiply(identity,A_6) = A_6 ),
inference(demodulation,[status(thm),theory(equality)],[c_1174,c_46]) ).
tff(c_10,plain,
multiply(identity,a2) != a2,
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_1400,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1347,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP570-1 : TPTP v8.1.2. Released v2.6.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.34 % Computer : n021.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:10:37 EDT 2023
% 0.20/0.35 % CPUTime :
% 3.89/1.97 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.89/1.98
% 3.89/1.98 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.89/2.01
% 3.89/2.01 Inference rules
% 3.89/2.01 ----------------------
% 3.89/2.01 #Ref : 0
% 3.89/2.01 #Sup : 358
% 3.89/2.01 #Fact : 0
% 3.89/2.01 #Define : 0
% 3.89/2.01 #Split : 0
% 3.89/2.01 #Chain : 0
% 3.89/2.01 #Close : 0
% 3.89/2.01
% 3.89/2.01 Ordering : KBO
% 3.89/2.01
% 3.89/2.01 Simplification rules
% 3.89/2.01 ----------------------
% 3.89/2.01 #Subsume : 0
% 3.89/2.01 #Demod : 403
% 3.89/2.01 #Tautology : 188
% 3.89/2.01 #SimpNegUnit : 0
% 3.89/2.01 #BackRed : 21
% 3.89/2.01
% 3.89/2.01 #Partial instantiations: 0
% 3.89/2.01 #Strategies tried : 1
% 3.89/2.01
% 3.89/2.01 Timing (in seconds)
% 3.89/2.01 ----------------------
% 3.89/2.01 Preprocessing : 0.41
% 3.89/2.01 Parsing : 0.21
% 3.89/2.01 CNF conversion : 0.02
% 3.89/2.01 Main loop : 0.56
% 3.89/2.01 Inferencing : 0.20
% 3.89/2.01 Reduction : 0.20
% 3.89/2.01 Demodulation : 0.16
% 3.89/2.01 BG Simplification : 0.03
% 3.89/2.01 Subsumption : 0.09
% 3.89/2.01 Abstraction : 0.03
% 3.89/2.01 MUC search : 0.00
% 3.89/2.01 Cooper : 0.00
% 3.89/2.01 Total : 1.01
% 3.89/2.01 Index Insertion : 0.00
% 3.89/2.01 Index Deletion : 0.00
% 3.89/2.01 Index Matching : 0.00
% 3.89/2.01 BG Taut test : 0.00
%------------------------------------------------------------------------------