TSTP Solution File: GRP190-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP190-1 : 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 : n024.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:26 EDT 2023
% Result : Unsatisfiable 18.55s 8.53s
% Output : CNFRefutation 18.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 20
% Syntax : Number of formulae : 58 ( 51 unt; 7 typ; 0 def)
% Number of atoms : 51 ( 50 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 : 79 (; 79 !; 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_118,axiom,
least_upper_bound(inverse(a),inverse(b)) != inverse(b),
file(unknown,unknown) ).
tff(f_57,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_61,axiom,
! [X] : ( multiply(inverse(X),X) = identity ),
file(unknown,unknown) ).
tff(f_64,axiom,
! [X,Y,Z] : ( multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_116,axiom,
least_upper_bound(a,b) = a,
file(unknown,unknown) ).
tff(f_92,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_104,axiom,
! [X,Y] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_109,axiom,
! [X,Y,Z] : ( multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) ),
file(unknown,unknown) ).
tff(f_113,axiom,
! [Y,Z,X] : ( multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ),
file(unknown,unknown) ).
tff(f_90,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_102,axiom,
! [X,Y] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_98,axiom,
! [X] : ( least_upper_bound(X,X) = X ),
file(unknown,unknown) ).
tff(f_96,axiom,
! [X,Y,Z] : ( least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ),
file(unknown,unknown) ).
tff(c_34,plain,
least_upper_bound(inverse(a),inverse(b)) != inverse(b),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_4,plain,
! [X_2] : ( multiply(inverse(X_2),X_2) = identity ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_311,plain,
! [X_50,Y_51,Z_52] : ( multiply(multiply(X_50,Y_51),Z_52) = multiply(X_50,multiply(Y_51,Z_52)) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_326,plain,
! [X_2,Z_52] : ( multiply(inverse(X_2),multiply(X_2,Z_52)) = multiply(identity,Z_52) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_311]) ).
tff(c_334,plain,
! [X_2,Z_52] : ( multiply(inverse(X_2),multiply(X_2,Z_52)) = Z_52 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_326]) ).
tff(c_422,plain,
! [X_56,Z_57] : ( multiply(inverse(X_56),multiply(X_56,Z_57)) = Z_57 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_326]) ).
tff(c_2159,plain,
! [X_98,Z_99] : ( multiply(inverse(inverse(X_98)),Z_99) = multiply(X_98,Z_99) ),
inference(superposition,[status(thm),theory(equality)],[c_334,c_422]) ).
tff(c_443,plain,
! [X_2] : ( multiply(inverse(inverse(X_2)),identity) = X_2 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_422]) ).
tff(c_2194,plain,
! [X_98] : ( multiply(X_98,identity) = X_98 ),
inference(superposition,[status(thm),theory(equality)],[c_2159,c_443]) ).
tff(c_2208,plain,
! [X_98] : ( multiply(X_98,inverse(X_98)) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_2159,c_4]) ).
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_64]) ).
tff(c_32,plain,
least_upper_bound(a,b) = a,
inference(cnfTransformation,[status(thm)],[f_116]) ).
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_92]) ).
tff(c_158,plain,
! [X_44,Y_45] : ( greatest_lower_bound(X_44,least_upper_bound(X_44,Y_45)) = X_44 ),
inference(cnfTransformation,[status(thm)],[f_104]) ).
tff(c_227,plain,
! [X_48,Y_49] : ( greatest_lower_bound(X_48,least_upper_bound(Y_49,X_48)) = X_48 ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_158]) ).
tff(c_265,plain,
greatest_lower_bound(b,a) = b,
inference(superposition,[status(thm),theory(equality)],[c_32,c_227]) ).
tff(c_907,plain,
! [X_71,Y_72,Z_73] : ( greatest_lower_bound(multiply(X_71,Y_72),multiply(X_71,Z_73)) = multiply(X_71,greatest_lower_bound(Y_72,Z_73)) ),
inference(cnfTransformation,[status(thm)],[f_109]) ).
tff(c_25530,plain,
! [X_259,Z_260] : ( multiply(inverse(X_259),greatest_lower_bound(X_259,Z_260)) = greatest_lower_bound(identity,multiply(inverse(X_259),Z_260)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_907]) ).
tff(c_25746,plain,
greatest_lower_bound(identity,multiply(inverse(b),a)) = multiply(inverse(b),b),
inference(superposition,[status(thm),theory(equality)],[c_265,c_25530]) ).
tff(c_25789,plain,
greatest_lower_bound(identity,multiply(inverse(b),a)) = identity,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_25746]) ).
tff(c_1537,plain,
! [Y_86,X_87,Z_88] : ( greatest_lower_bound(multiply(Y_86,X_87),multiply(Z_88,X_87)) = multiply(greatest_lower_bound(Y_86,Z_88),X_87) ),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_1615,plain,
! [Z_88,X_1] : ( multiply(greatest_lower_bound(identity,Z_88),X_1) = greatest_lower_bound(X_1,multiply(Z_88,X_1)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1537]) ).
tff(c_25805,plain,
! [X_1] : ( greatest_lower_bound(X_1,multiply(multiply(inverse(b),a),X_1)) = multiply(identity,X_1) ),
inference(superposition,[status(thm),theory(equality)],[c_25789,c_1615]) ).
tff(c_54846,plain,
! [X_401] : ( greatest_lower_bound(X_401,multiply(inverse(b),multiply(a,X_401))) = X_401 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_2,c_25805]) ).
tff(c_55099,plain,
greatest_lower_bound(inverse(a),multiply(inverse(b),identity)) = inverse(a),
inference(superposition,[status(thm),theory(equality)],[c_2208,c_54846]) ).
tff(c_55167,plain,
greatest_lower_bound(inverse(a),inverse(b)) = inverse(a),
inference(demodulation,[status(thm),theory(equality)],[c_2194,c_55099]) ).
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_90]) ).
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_102]) ).
tff(c_16,plain,
! [X_16] : ( least_upper_bound(X_16,X_16) = X_16 ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_546,plain,
! [X_61,Y_62,Z_63] : ( least_upper_bound(least_upper_bound(X_61,Y_62),Z_63) = least_upper_bound(X_61,least_upper_bound(Y_62,Z_63)) ),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_2378,plain,
! [X_103,Y_104,X_102] : ( least_upper_bound(X_103,least_upper_bound(Y_104,X_102)) = least_upper_bound(X_102,least_upper_bound(X_103,Y_104)) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_546]) ).
tff(c_3510,plain,
! [X_116,X_117] : ( least_upper_bound(X_116,least_upper_bound(X_117,X_116)) = least_upper_bound(X_117,X_116) ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_2378]) ).
tff(c_3667,plain,
! [X_18,Y_19] : ( least_upper_bound(greatest_lower_bound(X_18,Y_19),X_18) = least_upper_bound(X_18,greatest_lower_bound(X_18,Y_19)) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_3510]) ).
tff(c_3788,plain,
! [X_118,Y_119] : ( least_upper_bound(greatest_lower_bound(X_118,Y_119),X_118) = X_118 ),
inference(demodulation,[status(thm),theory(equality)],[c_20,c_3667]) ).
tff(c_3921,plain,
! [Y_7,X_6] : ( least_upper_bound(greatest_lower_bound(Y_7,X_6),X_6) = X_6 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_3788]) ).
tff(c_55872,plain,
least_upper_bound(inverse(a),inverse(b)) = inverse(b),
inference(superposition,[status(thm),theory(equality)],[c_55167,c_3921]) ).
tff(c_55921,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_34,c_55872]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GRP190-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.11/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.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 22:01:30 EDT 2023
% 0.14/0.36 % CPUTime :
% 18.55/8.53 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 18.55/8.54
% 18.55/8.54 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 18.55/8.57
% 18.55/8.57 Inference rules
% 18.55/8.57 ----------------------
% 18.55/8.57 #Ref : 0
% 18.55/8.57 #Sup : 14012
% 18.55/8.57 #Fact : 0
% 18.55/8.57 #Define : 0
% 18.55/8.57 #Split : 0
% 18.55/8.57 #Chain : 0
% 18.55/8.57 #Close : 0
% 18.55/8.57
% 18.55/8.57 Ordering : KBO
% 18.55/8.57
% 18.55/8.57 Simplification rules
% 18.55/8.57 ----------------------
% 18.55/8.57 #Subsume : 361
% 18.55/8.57 #Demod : 16021
% 18.55/8.57 #Tautology : 7916
% 18.55/8.57 #SimpNegUnit : 1
% 18.55/8.57 #BackRed : 8
% 18.55/8.57
% 18.55/8.57 #Partial instantiations: 0
% 18.55/8.57 #Strategies tried : 1
% 18.55/8.57
% 18.55/8.57 Timing (in seconds)
% 18.55/8.57 ----------------------
% 18.55/8.57 Preprocessing : 0.46
% 18.55/8.57 Parsing : 0.24
% 18.55/8.57 CNF conversion : 0.02
% 18.55/8.57 Main loop : 7.04
% 18.55/8.57 Inferencing : 1.20
% 18.55/8.58 Reduction : 4.22
% 18.55/8.58 Demodulation : 3.89
% 18.55/8.58 BG Simplification : 0.13
% 18.55/8.58 Subsumption : 1.16
% 18.55/8.58 Abstraction : 0.22
% 18.55/8.58 MUC search : 0.00
% 18.55/8.58 Cooper : 0.00
% 18.55/8.58 Total : 7.56
% 18.55/8.58 Index Insertion : 0.00
% 18.55/8.58 Index Deletion : 0.00
% 18.55/8.58 Index Matching : 0.00
% 18.55/8.58 BG Taut test : 0.00
%------------------------------------------------------------------------------