TSTP Solution File: GRP170-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP170-4 : 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 : n004.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:22 EDT 2023
% Result : Unsatisfiable 56.17s 45.05s
% Output : CNFRefutation 56.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 22
% Syntax : Number of formulae : 64 ( 55 unt; 9 typ; 0 def)
% Number of atoms : 55 ( 54 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 : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 83 (; 83 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > d > c > 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(d,type,
d: $i ).
tff(identity,type,
identity: $i ).
tff(c,type,
c: $i ).
tff(f_119,axiom,
least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d),
file(unknown,unknown) ).
tff(f_92,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
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_117,axiom,
greatest_lower_bound(c,d) = c,
file(unknown,unknown) ).
tff(f_90,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_116,axiom,
least_upper_bound(a,b) = b,
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_94,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(f_102,axiom,
! [X,Y] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(c_36,plain,
least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d),
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_92]) ).
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_364,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_379,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_364]) ).
tff(c_392,plain,
! [X_53,Z_54] : ( multiply(inverse(X_53),multiply(X_53,Z_54)) = Z_54 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_379]) ).
tff(c_387,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_379]) ).
tff(c_2376,plain,
! [X_99,Z_100] : ( multiply(inverse(inverse(X_99)),Z_100) = multiply(X_99,Z_100) ),
inference(superposition,[status(thm),theory(equality)],[c_392,c_387]) ).
tff(c_413,plain,
! [X_2] : ( multiply(inverse(inverse(X_2)),identity) = X_2 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_392]) ).
tff(c_2411,plain,
! [X_99] : ( multiply(X_99,identity) = X_99 ),
inference(superposition,[status(thm),theory(equality)],[c_2376,c_413]) ).
tff(c_2629,plain,
! [X_104] : ( multiply(X_104,identity) = X_104 ),
inference(superposition,[status(thm),theory(equality)],[c_2376,c_413]) ).
tff(c_395,plain,
! [X_53,Z_54] : ( multiply(inverse(inverse(X_53)),Z_54) = multiply(X_53,Z_54) ),
inference(superposition,[status(thm),theory(equality)],[c_392,c_387]) ).
tff(c_2636,plain,
! [X_53] : ( inverse(inverse(X_53)) = multiply(X_53,identity) ),
inference(superposition,[status(thm),theory(equality)],[c_2629,c_395]) ).
tff(c_2713,plain,
! [X_53] : ( inverse(inverse(X_53)) = X_53 ),
inference(demodulation,[status(thm),theory(equality)],[c_2411,c_2636]) ).
tff(c_34,plain,
greatest_lower_bound(c,d) = c,
inference(cnfTransformation,[status(thm)],[f_117]) ).
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_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) = b,
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_145,plain,
! [X_42,Y_43] : ( greatest_lower_bound(X_42,least_upper_bound(X_42,Y_43)) = X_42 ),
inference(cnfTransformation,[status(thm)],[f_104]) ).
tff(c_160,plain,
greatest_lower_bound(a,b) = a,
inference(superposition,[status(thm),theory(equality)],[c_32,c_145]) ).
tff(c_1780,plain,
! [X_89,Y_90,Z_91] : ( greatest_lower_bound(multiply(X_89,Y_90),multiply(X_89,Z_91)) = multiply(X_89,greatest_lower_bound(Y_90,Z_91)) ),
inference(cnfTransformation,[status(thm)],[f_109]) ).
tff(c_32067,plain,
! [X_290,Z_291] : ( multiply(inverse(X_290),greatest_lower_bound(X_290,Z_291)) = greatest_lower_bound(identity,multiply(inverse(X_290),Z_291)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_1780]) ).
tff(c_32334,plain,
greatest_lower_bound(identity,multiply(inverse(a),b)) = multiply(inverse(a),a),
inference(superposition,[status(thm),theory(equality)],[c_160,c_32067]) ).
tff(c_32382,plain,
greatest_lower_bound(identity,multiply(inverse(a),b)) = identity,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_32334]) ).
tff(c_973,plain,
! [Y_71,X_72,Z_73] : ( greatest_lower_bound(multiply(Y_71,X_72),multiply(Z_73,X_72)) = multiply(greatest_lower_bound(Y_71,Z_73),X_72) ),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_28128,plain,
! [Y_265,X_266] : ( multiply(greatest_lower_bound(Y_265,identity),X_266) = greatest_lower_bound(multiply(Y_265,X_266),X_266) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_973]) ).
tff(c_83442,plain,
! [X_488,X_489] : ( multiply(greatest_lower_bound(identity,X_488),X_489) = greatest_lower_bound(multiply(X_488,X_489),X_489) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_28128]) ).
tff(c_83939,plain,
! [X_489] : ( greatest_lower_bound(multiply(multiply(inverse(a),b),X_489),X_489) = multiply(identity,X_489) ),
inference(superposition,[status(thm),theory(equality)],[c_32382,c_83442]) ).
tff(c_95176,plain,
! [X_509] : ( greatest_lower_bound(X_509,multiply(inverse(a),multiply(b,X_509))) = X_509 ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_6,c_2,c_83939]) ).
tff(c_456,plain,
! [X_56,Y_57,Z_58] : ( greatest_lower_bound(greatest_lower_bound(X_56,Y_57),Z_58) = greatest_lower_bound(X_56,greatest_lower_bound(Y_57,Z_58)) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_4550,plain,
! [Z_129,X_130,Y_131] : ( greatest_lower_bound(Z_129,greatest_lower_bound(X_130,Y_131)) = greatest_lower_bound(X_130,greatest_lower_bound(Y_131,Z_129)) ),
inference(superposition,[status(thm),theory(equality)],[c_456,c_8]) ).
tff(c_4994,plain,
! [Z_129] : ( greatest_lower_bound(c,greatest_lower_bound(d,Z_129)) = greatest_lower_bound(Z_129,c) ),
inference(superposition,[status(thm),theory(equality)],[c_34,c_4550]) ).
tff(c_95428,plain,
greatest_lower_bound(multiply(inverse(a),multiply(b,d)),c) = greatest_lower_bound(c,d),
inference(superposition,[status(thm),theory(equality)],[c_95176,c_4994]) ).
tff(c_95588,plain,
greatest_lower_bound(multiply(inverse(a),multiply(b,d)),c) = c,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_95428]) ).
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_48775,plain,
! [X_360,Y_361,Z_362] : ( least_upper_bound(multiply(X_360,Y_361),multiply(X_360,greatest_lower_bound(Y_361,Z_362))) = multiply(X_360,Y_361) ),
inference(superposition,[status(thm),theory(equality)],[c_1780,c_20]) ).
tff(c_49201,plain,
! [Z_52,X_2,Z_362] : ( least_upper_bound(Z_52,multiply(inverse(X_2),greatest_lower_bound(multiply(X_2,Z_52),Z_362))) = multiply(inverse(X_2),multiply(X_2,Z_52)) ),
inference(superposition,[status(thm),theory(equality)],[c_387,c_48775]) ).
tff(c_239194,plain,
! [Z_783,X_784,Z_785] : ( least_upper_bound(Z_783,multiply(inverse(X_784),greatest_lower_bound(multiply(X_784,Z_783),Z_785))) = Z_783 ),
inference(demodulation,[status(thm),theory(equality)],[c_387,c_49201]) ).
tff(c_239879,plain,
least_upper_bound(multiply(b,d),multiply(inverse(inverse(a)),c)) = multiply(b,d),
inference(superposition,[status(thm),theory(equality)],[c_95588,c_239194]) ).
tff(c_240454,plain,
least_upper_bound(multiply(a,c),multiply(b,d)) = multiply(b,d),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_2713,c_239879]) ).
tff(c_240456,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_36,c_240454]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP170-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.13 % 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.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 22:04:56 EDT 2023
% 0.14/0.34 % CPUTime :
% 56.17/45.05 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 56.17/45.06
% 56.17/45.06 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 56.17/45.09
% 56.17/45.09 Inference rules
% 56.17/45.09 ----------------------
% 56.17/45.09 #Ref : 0
% 56.17/45.09 #Sup : 61204
% 56.17/45.09 #Fact : 0
% 56.17/45.09 #Define : 0
% 56.17/45.09 #Split : 0
% 56.17/45.09 #Chain : 0
% 56.17/45.09 #Close : 0
% 56.17/45.09
% 56.17/45.09 Ordering : KBO
% 56.17/45.09
% 56.17/45.09 Simplification rules
% 56.17/45.09 ----------------------
% 56.17/45.09 #Subsume : 1274
% 56.17/45.09 #Demod : 76443
% 56.17/45.09 #Tautology : 34964
% 56.17/45.09 #SimpNegUnit : 1
% 56.17/45.09 #BackRed : 8
% 56.17/45.09
% 56.17/45.09 #Partial instantiations: 0
% 56.17/45.09 #Strategies tried : 1
% 56.17/45.09
% 56.17/45.09 Timing (in seconds)
% 56.17/45.09 ----------------------
% 56.17/45.09 Preprocessing : 0.46
% 56.17/45.09 Parsing : 0.24
% 56.17/45.09 CNF conversion : 0.02
% 56.17/45.09 Main loop : 43.55
% 56.17/45.09 Inferencing : 3.32
% 56.17/45.09 Reduction : 29.32
% 56.17/45.09 Demodulation : 27.48
% 56.17/45.09 BG Simplification : 0.34
% 56.17/45.09 Subsumption : 8.21
% 56.17/45.09 Abstraction : 0.64
% 56.17/45.09 MUC search : 0.00
% 56.17/45.09 Cooper : 0.00
% 56.17/45.09 Total : 44.06
% 56.17/45.09 Index Insertion : 0.00
% 56.17/45.09 Index Deletion : 0.00
% 56.17/45.09 Index Matching : 0.00
% 56.17/45.09 BG Taut test : 0.00
%------------------------------------------------------------------------------