TSTP Solution File: GRP192-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP192-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 : n011.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 4.43s 2.13s
% Output : CNFRefutation 4.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 37 ( 30 unt; 7 typ; 0 def)
% Number of atoms : 30 ( 29 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 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 : 32 (; 32 !; 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_60,axiom,
! [X] : ( multiply(inverse(X),X) = identity ),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_101,axiom,
! [X,Y] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_116,axiom,
! [X] : ( least_upper_bound(identity,X) = X ),
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_89,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_118,axiom,
multiply(a,b) != multiply(b,a),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_2] : ( multiply(inverse(X_2),X_2) = identity ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_121,plain,
! [X_42,Y_43] : ( least_upper_bound(X_42,greatest_lower_bound(X_42,Y_43)) = X_42 ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_32,plain,
! [X_34] : ( least_upper_bound(identity,X_34) = X_34 ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_128,plain,
! [Y_43] : ( greatest_lower_bound(identity,Y_43) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_121,c_32]) ).
tff(c_883,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_947,plain,
! [Z_72,X_1] : ( multiply(greatest_lower_bound(identity,Z_72),X_1) = greatest_lower_bound(X_1,multiply(Z_72,X_1)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_883]) ).
tff(c_965,plain,
! [X_73,Z_74] : ( greatest_lower_bound(X_73,multiply(Z_74,X_73)) = X_73 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_128,c_947]) ).
tff(c_1022,plain,
! [X_75] : ( greatest_lower_bound(X_75,identity) = X_75 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_965]) ).
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_148,plain,
! [Y_44] : ( greatest_lower_bound(identity,Y_44) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_121,c_32]) ).
tff(c_173,plain,
! [X_6] : ( greatest_lower_bound(X_6,identity) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_148]) ).
tff(c_1200,plain,
identity = a,
inference(superposition,[status(thm),theory(equality)],[c_1022,c_173]) ).
tff(c_1091,plain,
! [X_76] : ( identity = X_76 ),
inference(superposition,[status(thm),theory(equality)],[c_1022,c_173]) ).
tff(c_1201,plain,
! [X_76] : ( a = X_76 ),
inference(superposition,[status(thm),theory(equality)],[c_1200,c_1091]) ).
tff(c_1184,plain,
identity = a,
inference(superposition,[status(thm),theory(equality)],[c_1022,c_173]) ).
tff(c_1185,plain,
! [X_1] : ( multiply(a,X_1) = X_1 ),
inference(superposition,[status(thm),theory(equality)],[c_1184,c_2]) ).
tff(c_1187,plain,
identity = b,
inference(superposition,[status(thm),theory(equality)],[c_1022,c_173]) ).
tff(c_1188,plain,
! [X_1] : ( multiply(b,X_1) = X_1 ),
inference(superposition,[status(thm),theory(equality)],[c_1187,c_2]) ).
tff(c_34,plain,
multiply(b,a) != multiply(a,b),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_2285,plain,
multiply(a,b) != a,
inference(demodulation,[status(thm),theory(equality)],[c_1188,c_34]) ).
tff(c_2405,plain,
b != a,
inference(demodulation,[status(thm),theory(equality)],[c_1185,c_2285]) ).
tff(c_2410,plain,
$false,
inference(superposition,[status(thm),theory(equality)],[c_1201,c_2405]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14 % Problem : GRP192-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.14/0.15 % 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.15/0.37 % Computer : n011.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:20:21 EDT 2023
% 0.15/0.37 % CPUTime :
% 4.43/2.13 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.43/2.14
% 4.43/2.14 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.66/2.17
% 4.66/2.17 Inference rules
% 4.66/2.17 ----------------------
% 4.66/2.17 #Ref : 0
% 4.66/2.17 #Sup : 687
% 4.66/2.17 #Fact : 0
% 4.66/2.17 #Define : 0
% 4.66/2.17 #Split : 0
% 4.66/2.17 #Chain : 0
% 4.66/2.17 #Close : 0
% 4.66/2.17
% 4.66/2.17 Ordering : KBO
% 4.66/2.17
% 4.66/2.17 Simplification rules
% 4.66/2.17 ----------------------
% 4.66/2.17 #Subsume : 187
% 4.66/2.17 #Demod : 251
% 4.66/2.17 #Tautology : 264
% 4.66/2.17 #SimpNegUnit : 0
% 4.66/2.17 #BackRed : 3
% 4.66/2.17
% 4.66/2.17 #Partial instantiations: 111
% 4.66/2.17 #Strategies tried : 1
% 4.66/2.17
% 4.66/2.17 Timing (in seconds)
% 4.66/2.17 ----------------------
% 4.66/2.17 Preprocessing : 0.46
% 4.66/2.17 Parsing : 0.24
% 4.66/2.17 CNF conversion : 0.02
% 4.66/2.17 Main loop : 0.62
% 4.66/2.17 Inferencing : 0.24
% 4.66/2.17 Reduction : 0.21
% 4.66/2.17 Demodulation : 0.17
% 4.66/2.17 BG Simplification : 0.03
% 4.66/2.17 Subsumption : 0.10
% 4.66/2.17 Abstraction : 0.03
% 4.66/2.17 MUC search : 0.00
% 4.66/2.17 Cooper : 0.00
% 4.66/2.17 Total : 1.13
% 4.66/2.17 Index Insertion : 0.00
% 4.66/2.17 Index Deletion : 0.00
% 4.66/2.17 Index Matching : 0.00
% 4.66/2.17 BG Taut test : 0.00
%------------------------------------------------------------------------------