TSTP Solution File: GRP169-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP169-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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 : n008.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:40:21 EDT 2023
% Result : Unsatisfiable 15.13s 5.88s
% Output : CNFRefutation 15.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 20
% Syntax : Number of formulae : 63 ( 56 unt; 7 typ; 0 def)
% Number of atoms : 56 ( 55 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 : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 85 (; 85 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(greatest_lower_bound,type,
greatest_lower_bound: ( $i * $i ) > $i ).
tff(least_upper_bound,type,
least_upper_bound: ( $i * $i ) > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(identity,type,
identity: $i ).
tff(f_119,axiom,
greatest_lower_bound(a,b) != b,
file(unknown,unknown) ).
tff(f_62,axiom,
! [X] : ( multiply(inverse(X),X) = identity ),
file(unknown,unknown) ).
tff(f_58,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_65,axiom,
! [X,Y,Z] : ( multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_93,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_117,axiom,
greatest_lower_bound(inverse(a),inverse(b)) = inverse(a),
file(unknown,unknown) ).
tff(f_91,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_103,axiom,
! [X,Y] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_108,axiom,
! [X,Y,Z] : ( multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)) ),
file(unknown,unknown) ).
tff(f_112,axiom,
! [Y,Z,X] : ( multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) ),
file(unknown,unknown) ).
tff(f_101,axiom,
! [X] : ( greatest_lower_bound(X,X) = X ),
file(unknown,unknown) ).
tff(f_105,axiom,
! [X,Y] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_95,axiom,
! [X,Y,Z] : ( greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ),
file(unknown,unknown) ).
tff(c_34,plain,
greatest_lower_bound(a,b) != b,
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_4,plain,
! [X_2] : ( multiply(inverse(X_2),X_2) = identity ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_783,plain,
! [X_64,Y_65,Z_66] : ( multiply(multiply(X_64,Y_65),Z_66) = multiply(X_64,multiply(Y_65,Z_66)) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_798,plain,
! [X_2,Z_66] : ( multiply(inverse(X_2),multiply(X_2,Z_66)) = multiply(identity,Z_66) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_783]) ).
tff(c_808,plain,
! [X_67,Z_68] : ( multiply(inverse(X_67),multiply(X_67,Z_68)) = Z_68 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_798]) ).
tff(c_829,plain,
! [X_2] : ( multiply(inverse(inverse(X_2)),identity) = X_2 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_808]) ).
tff(c_806,plain,
! [X_2,Z_66] : ( multiply(inverse(X_2),multiply(X_2,Z_66)) = Z_66 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_798]) ).
tff(c_1719,plain,
! [X_91,Z_92] : ( multiply(inverse(inverse(X_91)),Z_92) = multiply(X_91,Z_92) ),
inference(superposition,[status(thm),theory(equality)],[c_808,c_806]) ).
tff(c_1795,plain,
! [X_93] : ( multiply(X_93,identity) = X_93 ),
inference(superposition,[status(thm),theory(equality)],[c_1719,c_829]) ).
tff(c_1859,plain,
! [X_2] : ( inverse(inverse(X_2)) = X_2 ),
inference(superposition,[status(thm),theory(equality)],[c_829,c_1795]) ).
tff(c_10,plain,
! [Y_9,X_8] : ( least_upper_bound(Y_9,X_8) = least_upper_bound(X_8,Y_9) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_1748,plain,
! [X_91] : ( multiply(X_91,identity) = X_91 ),
inference(superposition,[status(thm),theory(equality)],[c_1719,c_829]) ).
tff(c_1782,plain,
! [X_91] : ( multiply(X_91,inverse(X_91)) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_1719]) ).
tff(c_6,plain,
! [X_3,Y_4,Z_5] : ( multiply(multiply(X_3,Y_4),Z_5) = multiply(X_3,multiply(Y_4,Z_5)) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_32,plain,
greatest_lower_bound(inverse(a),inverse(b)) = inverse(a),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_82,plain,
! [Y_40,X_41] : ( greatest_lower_bound(Y_40,X_41) = greatest_lower_bound(X_41,Y_40) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_20,plain,
! [X_18,Y_19] : ( least_upper_bound(X_18,greatest_lower_bound(X_18,Y_19)) = X_18 ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_189,plain,
! [X_46,Y_47] : ( least_upper_bound(X_46,greatest_lower_bound(Y_47,X_46)) = X_46 ),
inference(superposition,[status(thm),theory(equality)],[c_82,c_20]) ).
tff(c_205,plain,
least_upper_bound(inverse(b),inverse(a)) = inverse(b),
inference(superposition,[status(thm),theory(equality)],[c_32,c_189]) ).
tff(c_285,plain,
least_upper_bound(inverse(a),inverse(b)) = inverse(b),
inference(superposition,[status(thm),theory(equality)],[c_205,c_10]) ).
tff(c_1080,plain,
! [X_76,Y_77,Z_78] : ( least_upper_bound(multiply(X_76,Y_77),multiply(X_76,Z_78)) = multiply(X_76,least_upper_bound(Y_77,Z_78)) ),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_1155,plain,
! [X_2,Y_77] : ( multiply(inverse(X_2),least_upper_bound(Y_77,X_2)) = least_upper_bound(multiply(inverse(X_2),Y_77),identity) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_1080]) ).
tff(c_28137,plain,
! [X_293,Y_294] : ( multiply(inverse(X_293),least_upper_bound(Y_294,X_293)) = least_upper_bound(identity,multiply(inverse(X_293),Y_294)) ),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_1155]) ).
tff(c_28380,plain,
least_upper_bound(identity,multiply(inverse(inverse(b)),inverse(a))) = multiply(inverse(inverse(b)),inverse(b)),
inference(superposition,[status(thm),theory(equality)],[c_285,c_28137]) ).
tff(c_28437,plain,
least_upper_bound(identity,multiply(b,inverse(a))) = identity,
inference(demodulation,[status(thm),theory(equality)],[c_1859,c_4,c_28380]) ).
tff(c_888,plain,
! [Y_71,X_72,Z_73] : ( least_upper_bound(multiply(Y_71,X_72),multiply(Z_73,X_72)) = multiply(least_upper_bound(Y_71,Z_73),X_72) ),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_962,plain,
! [Z_73,X_1] : ( multiply(least_upper_bound(identity,Z_73),X_1) = least_upper_bound(X_1,multiply(Z_73,X_1)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_888]) ).
tff(c_28501,plain,
! [X_1] : ( least_upper_bound(X_1,multiply(multiply(b,inverse(a)),X_1)) = multiply(identity,X_1) ),
inference(superposition,[status(thm),theory(equality)],[c_28437,c_962]) ).
tff(c_38252,plain,
! [X_340] : ( least_upper_bound(X_340,multiply(b,multiply(inverse(a),X_340))) = X_340 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_2,c_28501]) ).
tff(c_38462,plain,
least_upper_bound(inverse(inverse(a)),multiply(b,identity)) = inverse(inverse(a)),
inference(superposition,[status(thm),theory(equality)],[c_1782,c_38252]) ).
tff(c_38525,plain,
least_upper_bound(a,b) = a,
inference(demodulation,[status(thm),theory(equality)],[c_1859,c_10,c_1859,c_10,c_1748,c_38462]) ).
tff(c_18,plain,
! [X_17] : ( greatest_lower_bound(X_17,X_17) = X_17 ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_154,plain,
! [X_44,Y_45] : ( greatest_lower_bound(X_44,least_upper_bound(X_44,Y_45)) = X_44 ),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_166,plain,
! [X_8,Y_9] : ( greatest_lower_bound(X_8,least_upper_bound(Y_9,X_8)) = X_8 ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_154]) ).
tff(c_300,plain,
! [X_50,Y_51,Z_52] : ( greatest_lower_bound(greatest_lower_bound(X_50,Y_51),Z_52) = greatest_lower_bound(X_50,greatest_lower_bound(Y_51,Z_52)) ),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_8,plain,
! [Y_7,X_6] : ( greatest_lower_bound(Y_7,X_6) = greatest_lower_bound(X_6,Y_7) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_4336,plain,
! [Z_128,X_129,Y_130] : ( greatest_lower_bound(Z_128,greatest_lower_bound(X_129,Y_130)) = greatest_lower_bound(X_129,greatest_lower_bound(Y_130,Z_128)) ),
inference(superposition,[status(thm),theory(equality)],[c_300,c_8]) ).
tff(c_4921,plain,
! [X_134,Z_135] : ( greatest_lower_bound(X_134,greatest_lower_bound(X_134,Z_135)) = greatest_lower_bound(Z_135,X_134) ),
inference(superposition,[status(thm),theory(equality)],[c_18,c_4336]) ).
tff(c_5057,plain,
! [Y_9,X_8] : ( greatest_lower_bound(least_upper_bound(Y_9,X_8),X_8) = greatest_lower_bound(X_8,X_8) ),
inference(superposition,[status(thm),theory(equality)],[c_166,c_4921]) ).
tff(c_5106,plain,
! [Y_9,X_8] : ( greatest_lower_bound(least_upper_bound(Y_9,X_8),X_8) = X_8 ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_5057]) ).
tff(c_39188,plain,
greatest_lower_bound(a,b) = b,
inference(superposition,[status(thm),theory(equality)],[c_38525,c_5106]) ).
tff(c_39247,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_34,c_39188]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP169-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.14/0.14 % 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.14/0.36 % Computer : n008.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 22:03:18 EDT 2023
% 0.14/0.36 % CPUTime :
% 15.13/5.88 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.13/5.89
% 15.13/5.89 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 15.13/5.92
% 15.13/5.92 Inference rules
% 15.13/5.92 ----------------------
% 15.13/5.92 #Ref : 0
% 15.13/5.92 #Sup : 9983
% 15.13/5.92 #Fact : 0
% 15.13/5.92 #Define : 0
% 15.13/5.92 #Split : 0
% 15.13/5.92 #Chain : 0
% 15.13/5.92 #Close : 0
% 15.13/5.92
% 15.13/5.92 Ordering : KBO
% 15.13/5.92
% 15.13/5.92 Simplification rules
% 15.13/5.92 ----------------------
% 15.13/5.92 #Subsume : 173
% 15.13/5.92 #Demod : 11464
% 15.13/5.92 #Tautology : 5755
% 15.13/5.92 #SimpNegUnit : 1
% 15.13/5.92 #BackRed : 11
% 15.13/5.92
% 15.13/5.92 #Partial instantiations: 0
% 15.13/5.92 #Strategies tried : 1
% 15.13/5.92
% 15.13/5.92 Timing (in seconds)
% 15.13/5.92 ----------------------
% 15.13/5.93 Preprocessing : 0.46
% 15.13/5.93 Parsing : 0.24
% 15.13/5.93 CNF conversion : 0.03
% 15.13/5.93 Main loop : 4.40
% 15.13/5.93 Inferencing : 0.89
% 15.13/5.93 Reduction : 2.45
% 15.13/5.93 Demodulation : 2.22
% 15.13/5.93 BG Simplification : 0.10
% 15.13/5.93 Subsumption : 0.71
% 15.13/5.93 Abstraction : 0.16
% 15.13/5.93 MUC search : 0.00
% 15.13/5.93 Cooper : 0.00
% 15.13/5.93 Total : 4.92
% 15.13/5.93 Index Insertion : 0.00
% 15.13/5.93 Index Deletion : 0.00
% 15.13/5.93 Index Matching : 0.00
% 15.13/5.93 BG Taut test : 0.00
%------------------------------------------------------------------------------