TSTP Solution File: GRP140-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP140-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 : n005.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:16 EDT 2023
% Result : Unsatisfiable 14.20s 5.68s
% Output : CNFRefutation 14.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of formulae : 49 ( 41 unt; 8 typ; 0 def)
% Number of atoms : 41 ( 40 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 : 54 (; 54 !; 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_93,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_120,axiom,
least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b),
file(unknown,unknown) ).
tff(f_99,axiom,
! [X] : ( least_upper_bound(X,X) = X ),
file(unknown,unknown) ).
tff(f_118,axiom,
greatest_lower_bound(b,c) = c,
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_117,axiom,
greatest_lower_bound(a,c) = c,
file(unknown,unknown) ).
tff(f_91,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
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(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_36,plain,
least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b),
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_37,plain,
least_upper_bound(c,greatest_lower_bound(a,b)) != greatest_lower_bound(a,b),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_36]) ).
tff(c_16,plain,
! [X_16] : ( least_upper_bound(X_16,X_16) = X_16 ),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_34,plain,
greatest_lower_bound(b,c) = c,
inference(cnfTransformation,[status(thm)],[f_118]) ).
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_192,plain,
least_upper_bound(b,c) = b,
inference(superposition,[status(thm),theory(equality)],[c_34,c_165]) ).
tff(c_655,plain,
! [X_62,Y_63,Z_64] : ( least_upper_bound(least_upper_bound(X_62,Y_63),Z_64) = least_upper_bound(X_62,least_upper_bound(Y_63,Z_64)) ),
inference(cnfTransformation,[status(thm)],[f_97]) ).
tff(c_5793,plain,
! [Y_139,X_140,Z_141] : ( least_upper_bound(least_upper_bound(Y_139,X_140),Z_141) = least_upper_bound(X_140,least_upper_bound(Y_139,Z_141)) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_655]) ).
tff(c_6040,plain,
! [Z_142] : ( least_upper_bound(c,least_upper_bound(b,Z_142)) = least_upper_bound(b,Z_142) ),
inference(superposition,[status(thm),theory(equality)],[c_192,c_5793]) ).
tff(c_6142,plain,
least_upper_bound(c,b) = least_upper_bound(b,b),
inference(superposition,[status(thm),theory(equality)],[c_16,c_6040]) ).
tff(c_6170,plain,
least_upper_bound(c,b) = b,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_6142]) ).
tff(c_32,plain,
greatest_lower_bound(a,c) = 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_91]) ).
tff(c_186,plain,
least_upper_bound(a,c) = a,
inference(superposition,[status(thm),theory(equality)],[c_32,c_165]) ).
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_214,plain,
! [X_46,Y_47] : ( greatest_lower_bound(X_46,least_upper_bound(Y_47,X_46)) = X_46 ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_146]) ).
tff(c_233,plain,
greatest_lower_bound(c,a) = c,
inference(superposition,[status(thm),theory(equality)],[c_186,c_214]) ).
tff(c_537,plain,
! [X_58,Y_59,Z_60] : ( greatest_lower_bound(greatest_lower_bound(X_58,Y_59),Z_60) = greatest_lower_bound(X_58,greatest_lower_bound(Y_59,Z_60)) ),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_22,plain,
! [X_20,Y_21] : ( greatest_lower_bound(X_20,least_upper_bound(X_20,Y_21)) = X_20 ),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_40747,plain,
! [X_322,Y_323,Y_324] : ( greatest_lower_bound(X_322,greatest_lower_bound(Y_323,least_upper_bound(greatest_lower_bound(X_322,Y_323),Y_324))) = greatest_lower_bound(X_322,Y_323) ),
inference(superposition,[status(thm),theory(equality)],[c_537,c_22]) ).
tff(c_41452,plain,
! [Y_324] : ( greatest_lower_bound(c,greatest_lower_bound(a,least_upper_bound(c,Y_324))) = greatest_lower_bound(c,a) ),
inference(superposition,[status(thm),theory(equality)],[c_233,c_40747]) ).
tff(c_41698,plain,
! [Y_325] : ( greatest_lower_bound(c,greatest_lower_bound(a,least_upper_bound(c,Y_325))) = c ),
inference(demodulation,[status(thm),theory(equality)],[c_32,c_8,c_41452]) ).
tff(c_41895,plain,
greatest_lower_bound(c,greatest_lower_bound(a,b)) = c,
inference(superposition,[status(thm),theory(equality)],[c_6170,c_41698]) ).
tff(c_180,plain,
! [X_6,Y_7] : ( least_upper_bound(X_6,greatest_lower_bound(Y_7,X_6)) = X_6 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_165]) ).
tff(c_8304,plain,
! [X_157,Y_158,X_156] : ( least_upper_bound(X_157,least_upper_bound(Y_158,X_156)) = least_upper_bound(X_156,least_upper_bound(X_157,Y_158)) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_655]) ).
tff(c_9279,plain,
! [X_161,X_162] : ( least_upper_bound(X_161,least_upper_bound(X_161,X_162)) = least_upper_bound(X_162,X_161) ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_8304]) ).
tff(c_9497,plain,
! [Y_7,X_6] : ( least_upper_bound(greatest_lower_bound(Y_7,X_6),X_6) = least_upper_bound(X_6,X_6) ),
inference(superposition,[status(thm),theory(equality)],[c_180,c_9279]) ).
tff(c_9572,plain,
! [Y_7,X_6] : ( least_upper_bound(greatest_lower_bound(Y_7,X_6),X_6) = X_6 ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_9497]) ).
tff(c_42082,plain,
least_upper_bound(c,greatest_lower_bound(a,b)) = greatest_lower_bound(a,b),
inference(superposition,[status(thm),theory(equality)],[c_41895,c_9572]) ).
tff(c_42199,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_37,c_42082]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP140-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.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 21:57:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 14.20/5.68 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.20/5.69
% 14.20/5.69 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 14.20/5.71
% 14.20/5.71 Inference rules
% 14.20/5.71 ----------------------
% 14.20/5.71 #Ref : 0
% 14.20/5.71 #Sup : 10337
% 14.20/5.71 #Fact : 0
% 14.20/5.71 #Define : 0
% 14.20/5.71 #Split : 0
% 14.20/5.71 #Chain : 0
% 14.20/5.71 #Close : 0
% 14.20/5.71
% 14.20/5.71 Ordering : KBO
% 14.20/5.71
% 14.20/5.71 Simplification rules
% 14.20/5.71 ----------------------
% 14.20/5.71 #Subsume : 291
% 14.20/5.71 #Demod : 11969
% 14.20/5.71 #Tautology : 6567
% 14.20/5.71 #SimpNegUnit : 1
% 14.20/5.71 #BackRed : 4
% 14.20/5.71
% 14.20/5.71 #Partial instantiations: 0
% 14.20/5.71 #Strategies tried : 1
% 14.20/5.71
% 14.20/5.71 Timing (in seconds)
% 14.20/5.72 ----------------------
% 14.20/5.72 Preprocessing : 0.42
% 14.20/5.72 Parsing : 0.22
% 14.20/5.72 CNF conversion : 0.02
% 14.20/5.72 Main loop : 4.25
% 14.20/5.72 Inferencing : 0.85
% 14.20/5.72 Reduction : 2.47
% 14.20/5.72 Demodulation : 2.25
% 14.20/5.72 BG Simplification : 0.09
% 14.20/5.72 Subsumption : 0.64
% 14.20/5.72 Abstraction : 0.14
% 14.20/5.72 MUC search : 0.00
% 14.20/5.72 Cooper : 0.00
% 14.20/5.72 Total : 4.72
% 14.20/5.72 Index Insertion : 0.00
% 14.20/5.72 Index Deletion : 0.00
% 14.20/5.72 Index Matching : 0.00
% 14.20/5.72 BG Taut test : 0.00
%------------------------------------------------------------------------------