TSTP Solution File: GRP138-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP138-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:16 EDT 2023
% Result : Unsatisfiable 15.08s 5.64s
% Output : CNFRefutation 15.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of formulae : 50 ( 42 unt; 8 typ; 0 def)
% Number of atoms : 42 ( 41 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 : 58 (; 58 !; 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_118,axiom,
least_upper_bound(b,c) = b,
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_99,axiom,
! [X] : ( least_upper_bound(X,X) = X ),
file(unknown,unknown) ).
tff(f_91,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_117,axiom,
least_upper_bound(a,c) = a,
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_103,axiom,
! [X,Y] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ),
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_34,plain,
least_upper_bound(b,c) = b,
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_545,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_3135,plain,
! [X_106,Y_107,Z_108] : ( least_upper_bound(least_upper_bound(X_106,Y_107),Z_108) = least_upper_bound(Y_107,least_upper_bound(X_106,Z_108)) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_545]) ).
tff(c_6603,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_34,c_3135]) ).
tff(c_16,plain,
! [X_16] : ( least_upper_bound(X_16,X_16) = X_16 ),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_815,plain,
! [X_68,Z_69] : ( least_upper_bound(X_68,least_upper_bound(X_68,Z_69)) = least_upper_bound(X_68,Z_69) ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_545]) ).
tff(c_856,plain,
! [X_8,Y_9] : ( least_upper_bound(X_8,least_upper_bound(Y_9,X_8)) = least_upper_bound(X_8,Y_9) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_815]) ).
tff(c_6649,plain,
least_upper_bound(c,b) = least_upper_bound(b,c),
inference(superposition,[status(thm),theory(equality)],[c_6603,c_856]) ).
tff(c_6753,plain,
least_upper_bound(c,b) = b,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_6649]) ).
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_32,plain,
least_upper_bound(a,c) = a,
inference(cnfTransformation,[status(thm)],[f_117]) ).
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_200,plain,
! [Y_46,X_47] : ( greatest_lower_bound(Y_46,least_upper_bound(X_47,Y_46)) = Y_46 ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_146]) ).
tff(c_229,plain,
greatest_lower_bound(c,a) = c,
inference(superposition,[status(thm),theory(equality)],[c_32,c_200]) ).
tff(c_257,plain,
greatest_lower_bound(a,c) = c,
inference(superposition,[status(thm),theory(equality)],[c_8,c_229]) ).
tff(c_303,plain,
! [X_48,Y_49,Z_50] : ( greatest_lower_bound(greatest_lower_bound(X_48,Y_49),Z_50) = greatest_lower_bound(X_48,greatest_lower_bound(Y_49,Z_50)) ),
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_34460,plain,
! [X_298,Y_299,Y_300] : ( greatest_lower_bound(X_298,greatest_lower_bound(Y_299,least_upper_bound(greatest_lower_bound(X_298,Y_299),Y_300))) = greatest_lower_bound(X_298,Y_299) ),
inference(superposition,[status(thm),theory(equality)],[c_303,c_22]) ).
tff(c_35105,plain,
! [Y_300] : ( greatest_lower_bound(c,greatest_lower_bound(a,least_upper_bound(c,Y_300))) = greatest_lower_bound(c,a) ),
inference(superposition,[status(thm),theory(equality)],[c_229,c_34460]) ).
tff(c_35622,plain,
! [Y_302] : ( greatest_lower_bound(c,greatest_lower_bound(a,least_upper_bound(c,Y_302))) = c ),
inference(demodulation,[status(thm),theory(equality)],[c_257,c_8,c_35105]) ).
tff(c_35801,plain,
greatest_lower_bound(c,greatest_lower_bound(a,b)) = c,
inference(superposition,[status(thm),theory(equality)],[c_6753,c_35622]) ).
tff(c_173,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_191,plain,
! [Y_7,X_6] : ( least_upper_bound(Y_7,greatest_lower_bound(X_6,Y_7)) = Y_7 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_173]) ).
tff(c_5389,plain,
! [Y_133,X_134,Y_135] : ( least_upper_bound(Y_133,least_upper_bound(X_134,Y_135)) = least_upper_bound(X_134,least_upper_bound(Y_135,Y_133)) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_545]) ).
tff(c_7469,plain,
! [X_147,Y_148] : ( least_upper_bound(X_147,least_upper_bound(X_147,Y_148)) = least_upper_bound(Y_148,X_147) ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_5389]) ).
tff(c_7696,plain,
! [X_6,Y_7] : ( least_upper_bound(greatest_lower_bound(X_6,Y_7),Y_7) = least_upper_bound(Y_7,Y_7) ),
inference(superposition,[status(thm),theory(equality)],[c_191,c_7469]) ).
tff(c_7773,plain,
! [X_6,Y_7] : ( least_upper_bound(greatest_lower_bound(X_6,Y_7),Y_7) = Y_7 ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_7696]) ).
tff(c_35997,plain,
least_upper_bound(c,greatest_lower_bound(a,b)) = greatest_lower_bound(a,b),
inference(superposition,[status(thm),theory(equality)],[c_35801,c_7773]) ).
tff(c_36103,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_37,c_35997]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP138-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/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.34 % Computer : n008.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:11:49 EDT 2023
% 0.14/0.35 % CPUTime :
% 15.08/5.64 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.08/5.65
% 15.08/5.65 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 15.08/5.68
% 15.08/5.68 Inference rules
% 15.08/5.68 ----------------------
% 15.08/5.68 #Ref : 0
% 15.08/5.68 #Sup : 8809
% 15.08/5.68 #Fact : 0
% 15.08/5.68 #Define : 0
% 15.08/5.68 #Split : 0
% 15.08/5.68 #Chain : 0
% 15.08/5.68 #Close : 0
% 15.08/5.68
% 15.08/5.68 Ordering : KBO
% 15.08/5.68
% 15.08/5.68 Simplification rules
% 15.08/5.68 ----------------------
% 15.08/5.68 #Subsume : 307
% 15.08/5.68 #Demod : 10154
% 15.08/5.68 #Tautology : 5621
% 15.08/5.68 #SimpNegUnit : 1
% 15.08/5.68 #BackRed : 4
% 15.08/5.68
% 15.08/5.68 #Partial instantiations: 0
% 15.08/5.68 #Strategies tried : 1
% 15.08/5.68
% 15.08/5.68 Timing (in seconds)
% 15.08/5.68 ----------------------
% 15.08/5.68 Preprocessing : 0.47
% 15.08/5.68 Parsing : 0.25
% 15.08/5.68 CNF conversion : 0.02
% 15.08/5.68 Main loop : 4.13
% 15.08/5.68 Inferencing : 0.85
% 15.08/5.68 Reduction : 2.36
% 15.30/5.68 Demodulation : 2.12
% 15.30/5.68 BG Simplification : 0.09
% 15.30/5.68 Subsumption : 0.62
% 15.30/5.68 Abstraction : 0.13
% 15.30/5.68 MUC search : 0.00
% 15.30/5.68 Cooper : 0.00
% 15.30/5.68 Total : 4.64
% 15.30/5.68 Index Insertion : 0.00
% 15.30/5.68 Index Deletion : 0.00
% 15.30/5.68 Index Matching : 0.00
% 15.30/5.68 BG Taut test : 0.00
%------------------------------------------------------------------------------