TSTP Solution File: GRP171-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP171-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 : n006.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 8.34s 3.15s
% Output : CNFRefutation 8.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 19
% Syntax : Number of formulae : 52 ( 45 unt; 7 typ; 0 def)
% Number of atoms : 45 ( 44 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 64 (; 64 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > 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(f_117,axiom,
least_upper_bound(identity,multiply(a,b)) != multiply(a,b),
file(unknown,unknown) ).
tff(f_115,axiom,
least_upper_bound(identity,b) = b,
file(unknown,unknown) ).
tff(f_102,axiom,
! [X,Y] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_88,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_55,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_114,axiom,
least_upper_bound(identity,a) = a,
file(unknown,unknown) ).
tff(f_111,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_92,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_96,axiom,
! [X] : ( least_upper_bound(X,X) = X ),
file(unknown,unknown) ).
tff(f_94,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_90,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_100,axiom,
! [X,Y] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(c_36,plain,
least_upper_bound(identity,multiply(a,b)) != multiply(a,b),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_34,plain,
least_upper_bound(identity,b) = b,
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_144,plain,
! [X_40,Y_41] : ( greatest_lower_bound(X_40,least_upper_bound(X_40,Y_41)) = X_40 ),
inference(cnfTransformation,[status(thm)],[f_102]) ).
tff(c_171,plain,
greatest_lower_bound(identity,b) = identity,
inference(superposition,[status(thm),theory(equality)],[c_34,c_144]) ).
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_88]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_188,plain,
! [Y_42,X_43] : ( greatest_lower_bound(Y_42,X_43) = greatest_lower_bound(X_43,Y_42) ),
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_32,plain,
least_upper_bound(identity,a) = a,
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_165,plain,
greatest_lower_bound(identity,a) = identity,
inference(superposition,[status(thm),theory(equality)],[c_32,c_144]) ).
tff(c_212,plain,
greatest_lower_bound(a,identity) = identity,
inference(superposition,[status(thm),theory(equality)],[c_188,c_165]) ).
tff(c_1401,plain,
! [Y_79,X_80,Z_81] : ( greatest_lower_bound(multiply(Y_79,X_80),multiply(Z_81,X_80)) = multiply(greatest_lower_bound(Y_79,Z_81),X_80) ),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_7438,plain,
! [Y_143,X_144] : ( multiply(greatest_lower_bound(Y_143,identity),X_144) = greatest_lower_bound(multiply(Y_143,X_144),X_144) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1401]) ).
tff(c_7611,plain,
! [X_144] : ( greatest_lower_bound(multiply(a,X_144),X_144) = multiply(identity,X_144) ),
inference(superposition,[status(thm),theory(equality)],[c_212,c_7438]) ).
tff(c_7821,plain,
! [X_146] : ( greatest_lower_bound(multiply(a,X_146),X_146) = X_146 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_7611]) ).
tff(c_7934,plain,
! [X_6] : ( greatest_lower_bound(X_6,multiply(a,X_6)) = X_6 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_7821]) ).
tff(c_556,plain,
! [X_54,Y_55,Z_56] : ( greatest_lower_bound(greatest_lower_bound(X_54,Y_55),Z_56) = greatest_lower_bound(X_54,greatest_lower_bound(Y_55,Z_56)) ),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_12772,plain,
! [Z_170] : ( greatest_lower_bound(identity,greatest_lower_bound(b,Z_170)) = greatest_lower_bound(identity,Z_170) ),
inference(superposition,[status(thm),theory(equality)],[c_171,c_556]) ).
tff(c_12867,plain,
greatest_lower_bound(identity,multiply(a,b)) = greatest_lower_bound(identity,b),
inference(superposition,[status(thm),theory(equality)],[c_7934,c_12772]) ).
tff(c_12952,plain,
greatest_lower_bound(identity,multiply(a,b)) = identity,
inference(demodulation,[status(thm),theory(equality)],[c_171,c_12867]) ).
tff(c_16,plain,
! [X_16] : ( least_upper_bound(X_16,X_16) = X_16 ),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_305,plain,
! [X_46,Y_47,Z_48] : ( least_upper_bound(least_upper_bound(X_46,Y_47),Z_48) = least_upper_bound(X_46,least_upper_bound(Y_47,Z_48)) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_367,plain,
! [X_16,Z_48] : ( least_upper_bound(X_16,least_upper_bound(X_16,Z_48)) = least_upper_bound(X_16,Z_48) ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_305]) ).
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_90]) ).
tff(c_2125,plain,
! [Z_94,X_95,Y_96] : ( least_upper_bound(Z_94,least_upper_bound(X_95,Y_96)) = least_upper_bound(X_95,least_upper_bound(Y_96,Z_94)) ),
inference(superposition,[status(thm),theory(equality)],[c_305,c_10]) ).
tff(c_2448,plain,
! [Z_94,Y_96] : ( least_upper_bound(Z_94,least_upper_bound(least_upper_bound(Y_96,Z_94),Y_96)) = least_upper_bound(Y_96,Z_94) ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_2125]) ).
tff(c_2484,plain,
! [Z_94,Y_96] : ( least_upper_bound(Z_94,least_upper_bound(Y_96,Z_94)) = least_upper_bound(Y_96,Z_94) ),
inference(demodulation,[status(thm),theory(equality)],[c_367,c_10,c_2448]) ).
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_100]) ).
tff(c_8567,plain,
! [X_149,Y_150,Z_151] : ( least_upper_bound(X_149,least_upper_bound(greatest_lower_bound(X_149,Y_150),Z_151)) = least_upper_bound(X_149,Z_151) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_305]) ).
tff(c_8771,plain,
! [Z_94,Y_150] : ( least_upper_bound(greatest_lower_bound(Z_94,Y_150),Z_94) = least_upper_bound(Z_94,Z_94) ),
inference(superposition,[status(thm),theory(equality)],[c_2484,c_8567]) ).
tff(c_9208,plain,
! [Z_153,Y_154] : ( least_upper_bound(greatest_lower_bound(Z_153,Y_154),Z_153) = Z_153 ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_8771]) ).
tff(c_9433,plain,
! [X_6,Y_7] : ( least_upper_bound(greatest_lower_bound(X_6,Y_7),Y_7) = Y_7 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_9208]) ).
tff(c_12972,plain,
least_upper_bound(identity,multiply(a,b)) = multiply(a,b),
inference(superposition,[status(thm),theory(equality)],[c_12952,c_9433]) ).
tff(c_13022,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_36,c_12972]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP171-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.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 22:07:59 EDT 2023
% 0.13/0.35 % CPUTime :
% 8.34/3.15 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.34/3.16
% 8.34/3.16 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.34/3.18
% 8.34/3.18 Inference rules
% 8.34/3.18 ----------------------
% 8.34/3.18 #Ref : 0
% 8.34/3.18 #Sup : 3351
% 8.34/3.18 #Fact : 0
% 8.34/3.18 #Define : 0
% 8.34/3.18 #Split : 0
% 8.34/3.18 #Chain : 0
% 8.34/3.18 #Close : 0
% 8.34/3.18
% 8.34/3.18 Ordering : KBO
% 8.34/3.18
% 8.34/3.18 Simplification rules
% 8.34/3.18 ----------------------
% 8.34/3.18 #Subsume : 54
% 8.34/3.18 #Demod : 2740
% 8.34/3.18 #Tautology : 1921
% 8.34/3.18 #SimpNegUnit : 1
% 8.34/3.18 #BackRed : 4
% 8.34/3.18
% 8.34/3.18 #Partial instantiations: 0
% 8.34/3.18 #Strategies tried : 1
% 8.34/3.18
% 8.34/3.18 Timing (in seconds)
% 8.34/3.18 ----------------------
% 8.34/3.19 Preprocessing : 0.47
% 8.34/3.19 Parsing : 0.24
% 8.34/3.19 CNF conversion : 0.02
% 8.34/3.19 Main loop : 1.64
% 8.34/3.19 Inferencing : 0.47
% 8.34/3.19 Reduction : 0.76
% 8.34/3.19 Demodulation : 0.65
% 8.34/3.19 BG Simplification : 0.05
% 8.34/3.19 Subsumption : 0.26
% 8.34/3.19 Abstraction : 0.08
% 8.34/3.19 MUC search : 0.00
% 8.34/3.19 Cooper : 0.00
% 8.34/3.19 Total : 2.16
% 8.34/3.19 Index Insertion : 0.00
% 8.34/3.19 Index Deletion : 0.00
% 8.34/3.19 Index Matching : 0.00
% 8.34/3.19 BG Taut test : 0.00
%------------------------------------------------------------------------------