TSTP Solution File: GRP193-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP193-2 : 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 : n018.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:27 EDT 2023
% Result : Unsatisfiable 13.90s 4.73s
% Output : CNFRefutation 14.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of formulae : 43 ( 35 unt; 8 typ; 0 def)
% Number of atoms : 35 ( 34 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 : 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 : 43 (; 43 !; 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_121,axiom,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
file(unknown,unknown) ).
tff(f_89,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_116,axiom,
greatest_lower_bound(identity,b) = identity,
file(unknown,unknown) ).
tff(f_112,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_99,axiom,
! [X] : ( greatest_lower_bound(X,X) = X ),
file(unknown,unknown) ).
tff(f_93,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_101,axiom,
! [X,Y] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_118,axiom,
greatest_lower_bound(a,b) = identity,
file(unknown,unknown) ).
tff(f_119,axiom,
greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = greatest_lower_bound(a,multiply(b,c)),
file(unknown,unknown) ).
tff(c_42,plain,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
inference(cnfTransformation,[status(thm)],[f_121]) ).
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_89]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_160,plain,
! [Y_42,X_43] : ( greatest_lower_bound(Y_42,X_43) = greatest_lower_bound(X_43,Y_42) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_34,plain,
greatest_lower_bound(identity,b) = identity,
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_190,plain,
greatest_lower_bound(b,identity) = identity,
inference(superposition,[status(thm),theory(equality)],[c_160,c_34]) ).
tff(c_1011,plain,
! [Y_70,X_71,Z_72] : ( greatest_lower_bound(multiply(Y_70,X_71),multiply(Z_72,X_71)) = multiply(greatest_lower_bound(Y_70,Z_72),X_71) ),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_15305,plain,
! [Y_187,X_188] : ( multiply(greatest_lower_bound(Y_187,identity),X_188) = greatest_lower_bound(multiply(Y_187,X_188),X_188) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1011]) ).
tff(c_15503,plain,
! [X_188] : ( greatest_lower_bound(multiply(b,X_188),X_188) = multiply(identity,X_188) ),
inference(superposition,[status(thm),theory(equality)],[c_190,c_15305]) ).
tff(c_15793,plain,
! [X_190] : ( greatest_lower_bound(multiply(b,X_190),X_190) = X_190 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_15503]) ).
tff(c_15976,plain,
! [X_6] : ( greatest_lower_bound(X_6,multiply(b,X_6)) = X_6 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_15793]) ).
tff(c_18,plain,
! [X_17] : ( greatest_lower_bound(X_17,X_17) = X_17 ),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_296,plain,
! [X_46,Y_47,Z_48] : ( greatest_lower_bound(greatest_lower_bound(X_46,Y_47),Z_48) = greatest_lower_bound(X_46,greatest_lower_bound(Y_47,Z_48)) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_358,plain,
! [X_17,Z_48] : ( greatest_lower_bound(X_17,greatest_lower_bound(X_17,Z_48)) = greatest_lower_bound(X_17,Z_48) ),
inference(superposition,[status(thm),theory(equality)],[c_18,c_296]) ).
tff(c_348,plain,
! [Y_7,X_46,Y_47] : ( greatest_lower_bound(Y_7,greatest_lower_bound(X_46,Y_47)) = greatest_lower_bound(X_46,greatest_lower_bound(Y_47,Y_7)) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_296]) ).
tff(c_12,plain,
! [X_10,Y_11,Z_12] : ( greatest_lower_bound(greatest_lower_bound(X_10,Y_11),Z_12) = greatest_lower_bound(X_10,greatest_lower_bound(Y_11,Z_12)) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
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_101]) ).
tff(c_38,plain,
greatest_lower_bound(a,b) = identity,
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_40,plain,
greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = greatest_lower_bound(a,multiply(b,c)),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_43,plain,
greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(identity,greatest_lower_bound(a,c))) = greatest_lower_bound(a,multiply(b,c)),
inference(demodulation,[status(thm),theory(equality)],[c_38,c_40]) ).
tff(c_44,plain,
greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c)) = greatest_lower_bound(a,multiply(b,c)),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_43]) ).
tff(c_24815,plain,
! [X_225,Y_226,Z_227] : ( least_upper_bound(greatest_lower_bound(X_225,Y_226),greatest_lower_bound(X_225,greatest_lower_bound(Y_226,Z_227))) = greatest_lower_bound(X_225,Y_226) ),
inference(superposition,[status(thm),theory(equality)],[c_296,c_20]) ).
tff(c_25387,plain,
! [Z_227] : ( least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(greatest_lower_bound(a,c),Z_227))) = greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c)) ),
inference(superposition,[status(thm),theory(equality)],[c_44,c_24815]) ).
tff(c_25704,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c),
inference(demodulation,[status(thm),theory(equality)],[c_15976,c_358,c_8,c_348,c_12,c_8,c_20,c_25387]) ).
tff(c_25706,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_42,c_25704]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14 % Problem : GRP193-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.14/0.15 % 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.15/0.37 % Computer : n018.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 22:30:35 EDT 2023
% 0.15/0.37 % CPUTime :
% 13.90/4.73 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.90/4.73
% 13.90/4.73 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 14.06/4.76
% 14.06/4.76 Inference rules
% 14.06/4.76 ----------------------
% 14.06/4.76 #Ref : 0
% 14.06/4.76 #Sup : 6627
% 14.06/4.76 #Fact : 0
% 14.06/4.76 #Define : 0
% 14.06/4.76 #Split : 0
% 14.06/4.76 #Chain : 0
% 14.06/4.76 #Close : 0
% 14.06/4.76
% 14.06/4.76 Ordering : KBO
% 14.06/4.76
% 14.06/4.76 Simplification rules
% 14.06/4.76 ----------------------
% 14.06/4.76 #Subsume : 148
% 14.06/4.76 #Demod : 6263
% 14.06/4.76 #Tautology : 3842
% 14.06/4.76 #SimpNegUnit : 1
% 14.06/4.76 #BackRed : 4
% 14.06/4.76
% 14.06/4.76 #Partial instantiations: 0
% 14.06/4.76 #Strategies tried : 1
% 14.06/4.76
% 14.06/4.76 Timing (in seconds)
% 14.06/4.76 ----------------------
% 14.06/4.76 Preprocessing : 0.48
% 14.06/4.76 Parsing : 0.24
% 14.06/4.76 CNF conversion : 0.02
% 14.06/4.76 Main loop : 3.16
% 14.06/4.76 Inferencing : 0.73
% 14.06/4.76 Reduction : 1.70
% 14.06/4.76 Demodulation : 1.51
% 14.06/4.77 BG Simplification : 0.08
% 14.06/4.77 Subsumption : 0.48
% 14.06/4.77 Abstraction : 0.10
% 14.06/4.77 MUC search : 0.00
% 14.06/4.77 Cooper : 0.00
% 14.06/4.77 Total : 3.69
% 14.06/4.77 Index Insertion : 0.00
% 14.06/4.77 Index Deletion : 0.00
% 14.06/4.77 Index Matching : 0.00
% 14.06/4.77 BG Taut test : 0.00
%------------------------------------------------------------------------------