TSTP Solution File: GRP191-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP191-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/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 : n025.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:27 EDT 2023
% Result : Unsatisfiable 15.61s 6.93s
% Output : CNFRefutation 15.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 43 ( 36 unt; 7 typ; 0 def)
% Number of atoms : 36 ( 35 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 : 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 : 50 (; 50 !; 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,
least_upper_bound(inverse(a),inverse(b)) != inverse(b),
file(unknown,unknown) ).
tff(f_93,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_58,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_62,axiom,
! [X] : ( multiply(inverse(X),X) = identity ),
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_117,axiom,
greatest_lower_bound(a,b) = b,
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(c_34,plain,
least_upper_bound(inverse(a),inverse(b)) != inverse(b),
inference(cnfTransformation,[status(thm)],[f_119]) ).
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_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_4,plain,
! [X_2] : ( multiply(inverse(X_2),X_2) = identity ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_520,plain,
! [X_56,Y_57,Z_58] : ( multiply(multiply(X_56,Y_57),Z_58) = multiply(X_56,multiply(Y_57,Z_58)) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_535,plain,
! [X_2,Z_58] : ( multiply(inverse(X_2),multiply(X_2,Z_58)) = multiply(identity,Z_58) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_520]) ).
tff(c_543,plain,
! [X_2,Z_58] : ( multiply(inverse(X_2),multiply(X_2,Z_58)) = Z_58 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_535]) ).
tff(c_545,plain,
! [X_59,Z_60] : ( multiply(inverse(X_59),multiply(X_59,Z_60)) = Z_60 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_535]) ).
tff(c_2410,plain,
! [X_101,Z_102] : ( multiply(inverse(inverse(X_101)),Z_102) = multiply(X_101,Z_102) ),
inference(superposition,[status(thm),theory(equality)],[c_543,c_545]) ).
tff(c_566,plain,
! [X_2] : ( multiply(inverse(inverse(X_2)),identity) = X_2 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_545]) ).
tff(c_2445,plain,
! [X_101] : ( multiply(X_101,identity) = X_101 ),
inference(superposition,[status(thm),theory(equality)],[c_2410,c_566]) ).
tff(c_2459,plain,
! [X_101] : ( multiply(X_101,inverse(X_101)) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_2410,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_65]) ).
tff(c_32,plain,
greatest_lower_bound(a,b) = b,
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_73,plain,
! [X_38,Y_39] : ( least_upper_bound(X_38,greatest_lower_bound(X_38,Y_39)) = X_38 ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_85,plain,
least_upper_bound(a,b) = a,
inference(superposition,[status(thm),theory(equality)],[c_32,c_73]) ).
tff(c_1571,plain,
! [X_85,Y_86,Z_87] : ( least_upper_bound(multiply(X_85,Y_86),multiply(X_85,Z_87)) = multiply(X_85,least_upper_bound(Y_86,Z_87)) ),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_28415,plain,
! [X_275,Z_276] : ( multiply(inverse(X_275),least_upper_bound(X_275,Z_276)) = least_upper_bound(identity,multiply(inverse(X_275),Z_276)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_1571]) ).
tff(c_28664,plain,
least_upper_bound(identity,multiply(inverse(a),b)) = multiply(inverse(a),a),
inference(superposition,[status(thm),theory(equality)],[c_85,c_28415]) ).
tff(c_28704,plain,
least_upper_bound(identity,multiply(inverse(a),b)) = identity,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_28664]) ).
tff(c_2301,plain,
! [Y_98,X_99,Z_100] : ( least_upper_bound(multiply(Y_98,X_99),multiply(Z_100,X_99)) = multiply(least_upper_bound(Y_98,Z_100),X_99) ),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_2392,plain,
! [Z_100,X_1] : ( multiply(least_upper_bound(identity,Z_100),X_1) = least_upper_bound(X_1,multiply(Z_100,X_1)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_2301]) ).
tff(c_28724,plain,
! [X_1] : ( least_upper_bound(X_1,multiply(multiply(inverse(a),b),X_1)) = multiply(identity,X_1) ),
inference(superposition,[status(thm),theory(equality)],[c_28704,c_2392]) ).
tff(c_47709,plain,
! [X_370] : ( least_upper_bound(X_370,multiply(inverse(a),multiply(b,X_370))) = X_370 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_2,c_28724]) ).
tff(c_47933,plain,
least_upper_bound(inverse(b),multiply(inverse(a),identity)) = inverse(b),
inference(superposition,[status(thm),theory(equality)],[c_2459,c_47709]) ).
tff(c_47999,plain,
least_upper_bound(inverse(a),inverse(b)) = inverse(b),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_2445,c_47933]) ).
tff(c_48001,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_34,c_47999]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP191-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.14 % 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.14/0.35 % Computer : n025.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:24:50 EDT 2023
% 0.14/0.36 % CPUTime :
% 15.61/6.93 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.61/6.93
% 15.61/6.93 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 15.75/6.96
% 15.75/6.96 Inference rules
% 15.75/6.96 ----------------------
% 15.75/6.96 #Ref : 0
% 15.75/6.96 #Sup : 11903
% 15.75/6.96 #Fact : 0
% 15.75/6.96 #Define : 0
% 15.75/6.96 #Split : 0
% 15.75/6.96 #Chain : 0
% 15.75/6.96 #Close : 0
% 15.75/6.96
% 15.75/6.96 Ordering : KBO
% 15.75/6.96
% 15.75/6.96 Simplification rules
% 15.75/6.96 ----------------------
% 15.75/6.96 #Subsume : 273
% 15.75/6.96 #Demod : 14061
% 15.75/6.96 #Tautology : 7171
% 15.75/6.96 #SimpNegUnit : 1
% 15.75/6.96 #BackRed : 5
% 15.75/6.96
% 15.75/6.96 #Partial instantiations: 0
% 15.75/6.96 #Strategies tried : 1
% 15.75/6.96
% 15.75/6.96 Timing (in seconds)
% 15.75/6.96 ----------------------
% 15.75/6.97 Preprocessing : 0.44
% 15.75/6.97 Parsing : 0.24
% 15.75/6.97 CNF conversion : 0.02
% 15.75/6.97 Main loop : 5.44
% 15.75/6.97 Inferencing : 0.96
% 15.75/6.97 Reduction : 3.21
% 15.75/6.97 Demodulation : 2.95
% 15.75/6.97 BG Simplification : 0.11
% 15.75/6.97 Subsumption : 0.88
% 15.75/6.97 Abstraction : 0.17
% 15.75/6.97 MUC search : 0.00
% 15.75/6.97 Cooper : 0.00
% 15.75/6.97 Total : 5.93
% 15.75/6.97 Index Insertion : 0.00
% 15.75/6.97 Index Deletion : 0.00
% 15.75/6.97 Index Matching : 0.00
% 15.75/6.97 BG Taut test : 0.00
%------------------------------------------------------------------------------