TSTP Solution File: GRP147-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP147-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 : n027.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 14.96s 5.43s
% Output : CNFRefutation 15.00s
% 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 ( 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 51 (; 51 !; 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,
greatest_lower_bound(b,c) = b,
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_93,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_117,axiom,
greatest_lower_bound(a,c) = a,
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(f_105,axiom,
! [X,Y] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X ),
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,
greatest_lower_bound(b,c) = b,
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_392,plain,
! [X_53,Y_54,Z_55] : ( greatest_lower_bound(greatest_lower_bound(X_53,Y_54),Z_55) = greatest_lower_bound(X_53,greatest_lower_bound(Y_54,Z_55)) ),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_5991,plain,
! [Z_139,X_140,Y_141] : ( greatest_lower_bound(Z_139,greatest_lower_bound(X_140,Y_141)) = greatest_lower_bound(X_140,greatest_lower_bound(Y_141,Z_139)) ),
inference(superposition,[status(thm),theory(equality)],[c_392,c_8]) ).
tff(c_7478,plain,
! [X_149] : ( greatest_lower_bound(c,greatest_lower_bound(X_149,b)) = greatest_lower_bound(X_149,b) ),
inference(superposition,[status(thm),theory(equality)],[c_34,c_5991]) ).
tff(c_7590,plain,
greatest_lower_bound(c,b) = greatest_lower_bound(b,b),
inference(superposition,[status(thm),theory(equality)],[c_18,c_7478]) ).
tff(c_7617,plain,
greatest_lower_bound(c,b) = b,
inference(demodulation,[status(thm),theory(equality)],[c_18,c_7590]) ).
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_32,plain,
greatest_lower_bound(a,c) = a,
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_165,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_239,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_165]) ).
tff(c_274,plain,
least_upper_bound(c,a) = c,
inference(superposition,[status(thm),theory(equality)],[c_32,c_239]) ).
tff(c_305,plain,
least_upper_bound(a,c) = c,
inference(superposition,[status(thm),theory(equality)],[c_10,c_274]) ).
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_539,plain,
! [X_59,Y_60,Z_61] : ( least_upper_bound(least_upper_bound(X_59,Y_60),Z_61) = least_upper_bound(X_59,least_upper_bound(Y_60,Z_61)) ),
inference(cnfTransformation,[status(thm)],[f_97]) ).
tff(c_34995,plain,
! [X_300,Y_301,Y_302] : ( least_upper_bound(X_300,least_upper_bound(Y_301,greatest_lower_bound(least_upper_bound(X_300,Y_301),Y_302))) = least_upper_bound(X_300,Y_301) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_539]) ).
tff(c_35611,plain,
! [Y_302] : ( least_upper_bound(c,least_upper_bound(a,greatest_lower_bound(c,Y_302))) = least_upper_bound(c,a) ),
inference(superposition,[status(thm),theory(equality)],[c_274,c_34995]) ).
tff(c_36113,plain,
! [Y_304] : ( least_upper_bound(c,least_upper_bound(a,greatest_lower_bound(c,Y_304))) = c ),
inference(demodulation,[status(thm),theory(equality)],[c_305,c_10,c_35611]) ).
tff(c_36269,plain,
least_upper_bound(c,least_upper_bound(a,b)) = c,
inference(superposition,[status(thm),theory(equality)],[c_7617,c_36113]) ).
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_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_8676,plain,
! [X_156,Z_157] : ( greatest_lower_bound(X_156,greatest_lower_bound(X_156,Z_157)) = greatest_lower_bound(Z_157,X_156) ),
inference(superposition,[status(thm),theory(equality)],[c_18,c_5991]) ).
tff(c_8939,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_8676]) ).
tff(c_9026,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_8939]) ).
tff(c_36459,plain,
greatest_lower_bound(c,least_upper_bound(a,b)) = least_upper_bound(a,b),
inference(superposition,[status(thm),theory(equality)],[c_36269,c_9026]) ).
tff(c_36562,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_37,c_36459]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP147-1 : 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.16/0.35 % Computer : n027.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Thu Aug 3 22:27:24 EDT 2023
% 0.16/0.35 % CPUTime :
% 14.96/5.43 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.00/5.43
% 15.00/5.43 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 15.00/5.46
% 15.00/5.46 Inference rules
% 15.00/5.46 ----------------------
% 15.00/5.46 #Ref : 0
% 15.00/5.46 #Sup : 8947
% 15.00/5.46 #Fact : 0
% 15.00/5.46 #Define : 0
% 15.00/5.46 #Split : 0
% 15.00/5.46 #Chain : 0
% 15.00/5.46 #Close : 0
% 15.00/5.46
% 15.00/5.46 Ordering : KBO
% 15.00/5.46
% 15.00/5.46 Simplification rules
% 15.00/5.46 ----------------------
% 15.00/5.46 #Subsume : 259
% 15.00/5.46 #Demod : 10065
% 15.00/5.46 #Tautology : 5666
% 15.00/5.46 #SimpNegUnit : 1
% 15.00/5.46 #BackRed : 12
% 15.00/5.46
% 15.00/5.46 #Partial instantiations: 0
% 15.00/5.46 #Strategies tried : 1
% 15.00/5.46
% 15.00/5.46 Timing (in seconds)
% 15.00/5.46 ----------------------
% 15.00/5.46 Preprocessing : 0.45
% 15.00/5.46 Parsing : 0.24
% 15.00/5.46 CNF conversion : 0.02
% 15.00/5.46 Main loop : 3.97
% 15.00/5.46 Inferencing : 0.85
% 15.00/5.46 Reduction : 2.22
% 15.00/5.46 Demodulation : 2.01
% 15.00/5.46 BG Simplification : 0.08
% 15.00/5.46 Subsumption : 0.62
% 15.00/5.46 Abstraction : 0.14
% 15.00/5.46 MUC search : 0.00
% 15.00/5.46 Cooper : 0.00
% 15.00/5.46 Total : 4.46
% 15.00/5.46 Index Insertion : 0.00
% 15.00/5.46 Index Deletion : 0.00
% 15.00/5.46 Index Matching : 0.00
% 15.00/5.46 BG Taut test : 0.00
%------------------------------------------------------------------------------