TSTP Solution File: GRP175-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP175-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 : n022.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:23 EDT 2023
% Result : Unsatisfiable 50.73s 37.17s
% Output : CNFRefutation 50.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 19
% Syntax : Number of formulae : 44 ( 37 unt; 7 typ; 0 def)
% Number of atoms : 37 ( 36 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 54 (; 54 !; 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_97,axiom,
! [X] : ( least_upper_bound(X,X) = 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_115,axiom,
greatest_lower_bound(identity,b) = identity,
file(unknown,unknown) ).
tff(f_101,axiom,
! [X,Y] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_95,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_91,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_110,axiom,
! [Y,Z,X] : ( multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) ),
file(unknown,unknown) ).
tff(f_103,axiom,
! [X,Y] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_108,axiom,
! [X,Y,Z] : ( multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) ),
file(unknown,unknown) ).
tff(f_117,axiom,
greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) != identity,
file(unknown,unknown) ).
tff(c_4,plain,
! [X_2] : ( multiply(inverse(X_2),X_2) = identity ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_16,plain,
! [X_16] : ( least_upper_bound(X_16,X_16) = X_16 ),
inference(cnfTransformation,[status(thm)],[f_97]) ).
tff(c_90,plain,
! [Y_40,X_41] : ( greatest_lower_bound(Y_40,X_41) = greatest_lower_bound(X_41,Y_40) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_32,plain,
greatest_lower_bound(identity,b) = identity,
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_111,plain,
greatest_lower_bound(b,identity) = identity,
inference(superposition,[status(thm),theory(equality)],[c_90,c_32]) ).
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_144,plain,
least_upper_bound(b,identity) = b,
inference(superposition,[status(thm),theory(equality)],[c_111,c_20]) ).
tff(c_315,plain,
! [X_50,Y_51,Z_52] : ( least_upper_bound(least_upper_bound(X_50,Y_51),Z_52) = least_upper_bound(X_50,least_upper_bound(Y_51,Z_52)) ),
inference(cnfTransformation,[status(thm)],[f_95]) ).
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_91]) ).
tff(c_3356,plain,
! [Z_115,X_116,Y_117] : ( least_upper_bound(Z_115,least_upper_bound(X_116,Y_117)) = least_upper_bound(X_116,least_upper_bound(Y_117,Z_115)) ),
inference(superposition,[status(thm),theory(equality)],[c_315,c_10]) ).
tff(c_3930,plain,
! [X_121,Z_122] : ( least_upper_bound(X_121,least_upper_bound(X_121,Z_122)) = least_upper_bound(Z_122,X_121) ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_3356]) ).
tff(c_4069,plain,
least_upper_bound(identity,b) = least_upper_bound(b,b),
inference(superposition,[status(thm),theory(equality)],[c_144,c_3930]) ).
tff(c_4109,plain,
least_upper_bound(identity,b) = b,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_4069]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_1216,plain,
! [Y_77,X_78,Z_79] : ( least_upper_bound(multiply(Y_77,X_78),multiply(Z_79,X_78)) = multiply(least_upper_bound(Y_77,Z_79),X_78) ),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_5042,plain,
! [Z_131,X_132] : ( multiply(least_upper_bound(identity,Z_131),X_132) = least_upper_bound(X_132,multiply(Z_131,X_132)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1216]) ).
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_103]) ).
tff(c_5562,plain,
! [X_137,Z_138] : ( greatest_lower_bound(X_137,multiply(least_upper_bound(identity,Z_138),X_137)) = X_137 ),
inference(superposition,[status(thm),theory(equality)],[c_5042,c_22]) ).
tff(c_5646,plain,
! [X_137] : ( greatest_lower_bound(X_137,multiply(b,X_137)) = X_137 ),
inference(superposition,[status(thm),theory(equality)],[c_4109,c_5562]) ).
tff(c_1339,plain,
! [X_81,Y_82,Z_83] : ( greatest_lower_bound(multiply(X_81,Y_82),multiply(X_81,Z_83)) = multiply(X_81,greatest_lower_bound(Y_82,Z_83)) ),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_47751,plain,
! [X_346,Z_347] : ( multiply(inverse(X_346),greatest_lower_bound(X_346,Z_347)) = greatest_lower_bound(identity,multiply(inverse(X_346),Z_347)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_1339]) ).
tff(c_48062,plain,
! [X_137] : ( greatest_lower_bound(identity,multiply(inverse(X_137),multiply(b,X_137))) = multiply(inverse(X_137),X_137) ),
inference(superposition,[status(thm),theory(equality)],[c_5646,c_47751]) ).
tff(c_48193,plain,
! [X_137] : ( greatest_lower_bound(identity,multiply(inverse(X_137),multiply(b,X_137))) = identity ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_48062]) ).
tff(c_34,plain,
greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) != identity,
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_228050,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_48193,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GRP175-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.14 % 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.14/0.36 % Computer : n022.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 22:00:48 EDT 2023
% 0.14/0.36 % CPUTime :
% 50.73/37.17 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 50.73/37.18
% 50.73/37.18 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 50.73/37.21
% 50.73/37.21 Inference rules
% 50.73/37.21 ----------------------
% 50.73/37.21 #Ref : 0
% 50.73/37.21 #Sup : 57542
% 50.73/37.21 #Fact : 0
% 50.73/37.21 #Define : 0
% 50.73/37.21 #Split : 0
% 50.73/37.21 #Chain : 0
% 50.73/37.21 #Close : 0
% 50.73/37.21
% 50.73/37.21 Ordering : KBO
% 50.73/37.21
% 50.73/37.21 Simplification rules
% 50.73/37.21 ----------------------
% 50.73/37.21 #Subsume : 1085
% 50.73/37.21 #Demod : 71965
% 50.73/37.21 #Tautology : 33802
% 50.73/37.21 #SimpNegUnit : 0
% 50.73/37.21 #BackRed : 7
% 50.73/37.21
% 50.73/37.21 #Partial instantiations: 0
% 50.73/37.21 #Strategies tried : 1
% 50.73/37.21
% 50.73/37.21 Timing (in seconds)
% 50.73/37.21 ----------------------
% 50.73/37.21 Preprocessing : 0.46
% 50.73/37.21 Parsing : 0.24
% 50.73/37.21 CNF conversion : 0.02
% 50.73/37.21 Main loop : 35.66
% 50.73/37.21 Inferencing : 3.16
% 50.73/37.21 Reduction : 23.22
% 50.73/37.21 Demodulation : 21.71
% 50.73/37.21 BG Simplification : 0.33
% 50.73/37.21 Subsumption : 6.99
% 50.73/37.21 Abstraction : 0.63
% 50.73/37.21 MUC search : 0.00
% 50.73/37.21 Cooper : 0.00
% 50.73/37.21 Total : 36.18
% 50.73/37.21 Index Insertion : 0.00
% 50.73/37.21 Index Deletion : 0.00
% 50.73/37.21 Index Matching : 0.00
% 50.73/37.21 BG Taut test : 0.00
%------------------------------------------------------------------------------