TSTP Solution File: GRP173-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP173-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/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 : 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:23 EDT 2023
% Result : Unsatisfiable 6.44s 2.72s
% Output : CNFRefutation 6.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 20
% Syntax : Number of formulae : 61 ( 55 unt; 6 typ; 0 def)
% Number of atoms : 55 ( 54 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 ( 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 78 (; 78 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > 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(identity,type,
identity: $i ).
tff(f_122,axiom,
identity != a,
file(unknown,unknown) ).
tff(f_60,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_64,axiom,
! [X] : ( multiply(inverse(X),X) = identity ),
file(unknown,unknown) ).
tff(f_67,axiom,
! [X,Y,Z] : ( multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_120,axiom,
least_upper_bound(identity,inverse(a)) = identity,
file(unknown,unknown) ).
tff(f_95,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_101,axiom,
! [X] : ( least_upper_bound(X,X) = X ),
file(unknown,unknown) ).
tff(f_119,axiom,
least_upper_bound(identity,a) = identity,
file(unknown,unknown) ).
tff(f_103,axiom,
! [X] : ( greatest_lower_bound(X,X) = X ),
file(unknown,unknown) ).
tff(f_97,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_93,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_107,axiom,
! [X,Y] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_116,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_105,axiom,
! [X,Y] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(c_36,plain,
identity != a,
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_4,plain,
! [X_2] : ( multiply(inverse(X_2),X_2) = identity ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_355,plain,
! [X_51,Y_52,Z_53] : ( multiply(multiply(X_51,Y_52),Z_53) = multiply(X_51,multiply(Y_52,Z_53)) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_370,plain,
! [X_2,Z_53] : ( multiply(inverse(X_2),multiply(X_2,Z_53)) = multiply(identity,Z_53) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_355]) ).
tff(c_562,plain,
! [X_59,Z_60] : ( multiply(inverse(X_59),multiply(X_59,Z_60)) = Z_60 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_370]) ).
tff(c_378,plain,
! [X_2,Z_53] : ( multiply(inverse(X_2),multiply(X_2,Z_53)) = Z_53 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_370]) ).
tff(c_2399,plain,
! [X_97,Z_98] : ( multiply(inverse(inverse(X_97)),Z_98) = multiply(X_97,Z_98) ),
inference(superposition,[status(thm),theory(equality)],[c_562,c_378]) ).
tff(c_583,plain,
! [X_2] : ( multiply(inverse(inverse(X_2)),identity) = X_2 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_562]) ).
tff(c_2428,plain,
! [X_97] : ( multiply(X_97,identity) = X_97 ),
inference(superposition,[status(thm),theory(equality)],[c_2399,c_583]) ).
tff(c_34,plain,
least_upper_bound(identity,inverse(a)) = identity,
inference(cnfTransformation,[status(thm)],[f_120]) ).
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_95]) ).
tff(c_16,plain,
! [X_16] : ( least_upper_bound(X_16,X_16) = X_16 ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_2448,plain,
! [X_97] : ( multiply(X_97,inverse(X_97)) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_2399,c_4]) ).
tff(c_79,plain,
! [Y_38,X_39] : ( least_upper_bound(Y_38,X_39) = least_upper_bound(X_39,Y_38) ),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_32,plain,
least_upper_bound(identity,a) = identity,
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_94,plain,
least_upper_bound(a,identity) = identity,
inference(superposition,[status(thm),theory(equality)],[c_79,c_32]) ).
tff(c_18,plain,
! [X_17] : ( greatest_lower_bound(X_17,X_17) = X_17 ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_221,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_97]) ).
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_93]) ).
tff(c_2617,plain,
! [Z_101,X_102,Y_103] : ( greatest_lower_bound(Z_101,greatest_lower_bound(X_102,Y_103)) = greatest_lower_bound(X_102,greatest_lower_bound(Y_103,Z_101)) ),
inference(superposition,[status(thm),theory(equality)],[c_221,c_8]) ).
tff(c_3300,plain,
! [X_110,X_111] : ( greatest_lower_bound(X_110,greatest_lower_bound(X_111,X_110)) = greatest_lower_bound(X_111,X_110) ),
inference(superposition,[status(thm),theory(equality)],[c_18,c_2617]) ).
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_107]) ).
tff(c_253,plain,
! [X_20,Y_21,Z_48] : ( greatest_lower_bound(X_20,greatest_lower_bound(least_upper_bound(X_20,Y_21),Z_48)) = greatest_lower_bound(X_20,Z_48) ),
inference(superposition,[status(thm),theory(equality)],[c_22,c_221]) ).
tff(c_3314,plain,
! [X_110,Y_21] : ( greatest_lower_bound(least_upper_bound(X_110,Y_21),X_110) = greatest_lower_bound(X_110,X_110) ),
inference(superposition,[status(thm),theory(equality)],[c_3300,c_253]) ).
tff(c_3477,plain,
! [X_112,Y_113] : ( greatest_lower_bound(least_upper_bound(X_112,Y_113),X_112) = X_112 ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_3314]) ).
tff(c_3599,plain,
greatest_lower_bound(identity,a) = a,
inference(superposition,[status(thm),theory(equality)],[c_94,c_3477]) ).
tff(c_955,plain,
! [Y_72,X_73,Z_74] : ( greatest_lower_bound(multiply(Y_72,X_73),multiply(Z_74,X_73)) = multiply(greatest_lower_bound(Y_72,Z_74),X_73) ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_5376,plain,
! [Z_132,X_133] : ( multiply(greatest_lower_bound(identity,Z_132),X_133) = greatest_lower_bound(X_133,multiply(Z_132,X_133)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_955]) ).
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_105]) ).
tff(c_6499,plain,
! [X_143,Z_144] : ( least_upper_bound(X_143,multiply(greatest_lower_bound(identity,Z_144),X_143)) = X_143 ),
inference(superposition,[status(thm),theory(equality)],[c_5376,c_20]) ).
tff(c_6691,plain,
! [X_145] : ( least_upper_bound(X_145,multiply(a,X_145)) = X_145 ),
inference(superposition,[status(thm),theory(equality)],[c_3599,c_6499]) ).
tff(c_6770,plain,
least_upper_bound(inverse(a),identity) = inverse(a),
inference(superposition,[status(thm),theory(equality)],[c_2448,c_6691]) ).
tff(c_144,plain,
! [Y_42,X_43] : ( greatest_lower_bound(Y_42,X_43) = greatest_lower_bound(X_43,Y_42) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_380,plain,
! [Y_54,X_55] : ( least_upper_bound(Y_54,greatest_lower_bound(X_55,Y_54)) = Y_54 ),
inference(superposition,[status(thm),theory(equality)],[c_144,c_20]) ).
tff(c_408,plain,
! [X_20,Y_21] : ( least_upper_bound(least_upper_bound(X_20,Y_21),X_20) = least_upper_bound(X_20,Y_21) ),
inference(superposition,[status(thm),theory(equality)],[c_22,c_380]) ).
tff(c_6886,plain,
least_upper_bound(inverse(a),inverse(a)) = least_upper_bound(inverse(a),identity),
inference(superposition,[status(thm),theory(equality)],[c_6770,c_408]) ).
tff(c_6920,plain,
inverse(a) = identity,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_10,c_16,c_6886]) ).
tff(c_6949,plain,
multiply(a,identity) = identity,
inference(superposition,[status(thm),theory(equality)],[c_6920,c_2448]) ).
tff(c_6962,plain,
identity = a,
inference(demodulation,[status(thm),theory(equality)],[c_2428,c_6949]) ).
tff(c_6964,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_36,c_6962]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GRP173-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/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.16/0.37 % Computer : n011.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 3 22:09:36 EDT 2023
% 0.16/0.37 % CPUTime :
% 6.44/2.72 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.44/2.73
% 6.44/2.73 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.84/2.77
% 6.84/2.77 Inference rules
% 6.84/2.77 ----------------------
% 6.84/2.77 #Ref : 0
% 6.84/2.77 #Sup : 1742
% 6.84/2.77 #Fact : 0
% 6.84/2.77 #Define : 0
% 6.84/2.77 #Split : 0
% 6.84/2.77 #Chain : 0
% 6.84/2.77 #Close : 0
% 6.84/2.77
% 6.84/2.77 Ordering : KBO
% 6.84/2.77
% 6.84/2.77 Simplification rules
% 6.84/2.77 ----------------------
% 6.84/2.77 #Subsume : 31
% 6.84/2.77 #Demod : 1470
% 6.84/2.77 #Tautology : 1070
% 6.84/2.77 #SimpNegUnit : 1
% 6.84/2.77 #BackRed : 11
% 6.84/2.77
% 6.84/2.77 #Partial instantiations: 0
% 6.84/2.77 #Strategies tried : 1
% 6.84/2.77
% 6.84/2.77 Timing (in seconds)
% 6.84/2.77 ----------------------
% 6.84/2.77 Preprocessing : 0.49
% 6.84/2.77 Parsing : 0.25
% 6.84/2.77 CNF conversion : 0.02
% 6.84/2.77 Main loop : 1.14
% 6.84/2.77 Inferencing : 0.36
% 6.84/2.77 Reduction : 0.51
% 6.84/2.77 Demodulation : 0.43
% 6.84/2.77 BG Simplification : 0.04
% 6.84/2.77 Subsumption : 0.16
% 6.84/2.77 Abstraction : 0.05
% 6.84/2.77 MUC search : 0.00
% 6.84/2.77 Cooper : 0.00
% 6.84/2.77 Total : 1.69
% 6.84/2.77 Index Insertion : 0.00
% 6.84/2.77 Index Deletion : 0.00
% 6.84/2.77 Index Matching : 0.00
% 6.84/2.77 BG Taut test : 0.00
%------------------------------------------------------------------------------