TSTP Solution File: GRP148-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP148-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/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 : 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:17 EDT 2023
% Result : Unsatisfiable 16.12s 6.00s
% Output : CNFRefutation 16.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of formulae : 47 ( 39 unt; 8 typ; 0 def)
% Number of atoms : 39 ( 38 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 1 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 50 (; 50 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > 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(identity,type,
identity: $i ).
tff(c,type,
c: $i ).
tff(f_91,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_120,axiom,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
file(unknown,unknown) ).
tff(f_101,axiom,
! [X] : ( greatest_lower_bound(X,X) = X ),
file(unknown,unknown) ).
tff(f_118,axiom,
least_upper_bound(b,c) = c,
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(f_117,axiom,
least_upper_bound(a,c) = c,
file(unknown,unknown) ).
tff(f_93,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_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_97,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_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_36,plain,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_37,plain,
greatest_lower_bound(c,least_upper_bound(a,b)) != least_upper_bound(a,b),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_36]) ).
tff(c_18,plain,
! [X_17] : ( greatest_lower_bound(X_17,X_17) = X_17 ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_34,plain,
least_upper_bound(b,c) = c,
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_146,plain,
! [X_42,Y_43] : ( greatest_lower_bound(X_42,least_upper_bound(X_42,Y_43)) = X_42 ),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_167,plain,
greatest_lower_bound(b,c) = b,
inference(superposition,[status(thm),theory(equality)],[c_34,c_146]) ).
tff(c_368,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_2820,plain,
! [X_106,Y_107,X_105] : ( greatest_lower_bound(X_106,greatest_lower_bound(Y_107,X_105)) = greatest_lower_bound(X_105,greatest_lower_bound(X_106,Y_107)) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_368]) ).
tff(c_5185,plain,
! [X_129,X_130] : ( greatest_lower_bound(X_129,greatest_lower_bound(X_129,X_130)) = greatest_lower_bound(X_130,X_129) ),
inference(superposition,[status(thm),theory(equality)],[c_18,c_2820]) ).
tff(c_5366,plain,
greatest_lower_bound(c,b) = greatest_lower_bound(b,b),
inference(superposition,[status(thm),theory(equality)],[c_167,c_5185]) ).
tff(c_5427,plain,
greatest_lower_bound(c,b) = b,
inference(demodulation,[status(thm),theory(equality)],[c_18,c_5366]) ).
tff(c_32,plain,
least_upper_bound(a,c) = c,
inference(cnfTransformation,[status(thm)],[f_117]) ).
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_161,plain,
greatest_lower_bound(a,c) = a,
inference(superposition,[status(thm),theory(equality)],[c_32,c_146]) ).
tff(c_171,plain,
! [X_44,Y_45] : ( least_upper_bound(X_44,greatest_lower_bound(X_44,Y_45)) = X_44 ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_261,plain,
! [X_48,Y_49] : ( least_upper_bound(X_48,greatest_lower_bound(Y_49,X_48)) = X_48 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_171]) ).
tff(c_286,plain,
least_upper_bound(c,a) = c,
inference(superposition,[status(thm),theory(equality)],[c_161,c_261]) ).
tff(c_778,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_97]) ).
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_35731,plain,
! [X_296,Y_297,Y_298] : ( least_upper_bound(X_296,least_upper_bound(Y_297,greatest_lower_bound(least_upper_bound(X_296,Y_297),Y_298))) = least_upper_bound(X_296,Y_297) ),
inference(superposition,[status(thm),theory(equality)],[c_778,c_20]) ).
tff(c_36366,plain,
! [Y_298] : ( least_upper_bound(c,least_upper_bound(a,greatest_lower_bound(c,Y_298))) = least_upper_bound(c,a) ),
inference(superposition,[status(thm),theory(equality)],[c_286,c_35731]) ).
tff(c_37714,plain,
! [Y_303] : ( least_upper_bound(c,least_upper_bound(a,greatest_lower_bound(c,Y_303))) = c ),
inference(demodulation,[status(thm),theory(equality)],[c_32,c_10,c_36366]) ).
tff(c_37888,plain,
least_upper_bound(c,least_upper_bound(a,b)) = c,
inference(superposition,[status(thm),theory(equality)],[c_5427,c_37714]) ).
tff(c_158,plain,
! [Y_9,X_8] : ( greatest_lower_bound(Y_9,least_upper_bound(X_8,Y_9)) = Y_9 ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_146]) ).
tff(c_5363,plain,
! [X_8,Y_9] : ( greatest_lower_bound(least_upper_bound(X_8,Y_9),Y_9) = greatest_lower_bound(Y_9,Y_9) ),
inference(superposition,[status(thm),theory(equality)],[c_158,c_5185]) ).
tff(c_5426,plain,
! [X_8,Y_9] : ( greatest_lower_bound(least_upper_bound(X_8,Y_9),Y_9) = Y_9 ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_5363]) ).
tff(c_38089,plain,
greatest_lower_bound(c,least_upper_bound(a,b)) = least_upper_bound(a,b),
inference(superposition,[status(thm),theory(equality)],[c_37888,c_5426]) ).
tff(c_38177,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_37,c_38089]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP148-1 : 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.17/0.35 % Computer : n008.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 21:57:49 EDT 2023
% 0.17/0.35 % CPUTime :
% 16.12/6.00 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.12/6.01
% 16.12/6.01 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 16.12/6.04
% 16.12/6.04 Inference rules
% 16.12/6.04 ----------------------
% 16.12/6.04 #Ref : 0
% 16.12/6.04 #Sup : 9325
% 16.12/6.04 #Fact : 0
% 16.12/6.04 #Define : 0
% 16.12/6.04 #Split : 0
% 16.12/6.04 #Chain : 0
% 16.12/6.04 #Close : 0
% 16.12/6.04
% 16.12/6.04 Ordering : KBO
% 16.12/6.04
% 16.12/6.04 Simplification rules
% 16.12/6.04 ----------------------
% 16.12/6.04 #Subsume : 276
% 16.12/6.04 #Demod : 11004
% 16.12/6.04 #Tautology : 5954
% 16.12/6.04 #SimpNegUnit : 1
% 16.12/6.04 #BackRed : 7
% 16.12/6.04
% 16.12/6.04 #Partial instantiations: 0
% 16.12/6.04 #Strategies tried : 1
% 16.12/6.04
% 16.12/6.04 Timing (in seconds)
% 16.12/6.04 ----------------------
% 16.12/6.04 Preprocessing : 0.55
% 16.12/6.04 Parsing : 0.28
% 16.12/6.04 CNF conversion : 0.02
% 16.12/6.04 Main loop : 4.32
% 16.12/6.04 Inferencing : 0.89
% 16.12/6.04 Reduction : 2.50
% 16.12/6.04 Demodulation : 2.28
% 16.12/6.04 BG Simplification : 0.09
% 16.12/6.04 Subsumption : 0.64
% 16.12/6.04 Abstraction : 0.14
% 16.12/6.04 MUC search : 0.00
% 16.12/6.04 Cooper : 0.00
% 16.12/6.04 Total : 4.93
% 16.12/6.04 Index Insertion : 0.00
% 16.12/6.04 Index Deletion : 0.00
% 16.12/6.04 Index Matching : 0.00
% 16.12/6.04 BG Taut test : 0.00
%------------------------------------------------------------------------------