TSTP Solution File: GRP170-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP170-3 : 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 : n024.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 53.70s 42.80s
% Output : CNFRefutation 53.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 23
% Syntax : Number of formulae : 69 ( 60 unt; 9 typ; 0 def)
% Number of atoms : 60 ( 59 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 : 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 : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 96 (; 96 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > d > 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(d,type,
d: $i ).
tff(identity,type,
identity: $i ).
tff(c,type,
c: $i ).
tff(f_118,axiom,
greatest_lower_bound(multiply(a,c),multiply(b,d)) != multiply(a,c),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_60,axiom,
! [X] : ( multiply(inverse(X),X) = identity ),
file(unknown,unknown) ).
tff(f_63,axiom,
! [X,Y,Z] : ( multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_116,axiom,
least_upper_bound(c,d) = d,
file(unknown,unknown) ).
tff(f_91,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_115,axiom,
least_upper_bound(a,b) = b,
file(unknown,unknown) ).
tff(f_103,axiom,
! [X,Y] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = 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_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_101,axiom,
! [X,Y] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = 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_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_106,axiom,
! [X,Y,Z] : ( multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)) ),
file(unknown,unknown) ).
tff(c_36,plain,
greatest_lower_bound(multiply(a,c),multiply(b,d)) != multiply(a,c),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_4,plain,
! [X_2] : ( multiply(inverse(X_2),X_2) = identity ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_367,plain,
! [X_50,Y_51,Z_52] : ( multiply(multiply(X_50,Y_51),Z_52) = multiply(X_50,multiply(Y_51,Z_52)) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_382,plain,
! [X_2,Z_52] : ( multiply(inverse(X_2),multiply(X_2,Z_52)) = multiply(identity,Z_52) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_367]) ).
tff(c_392,plain,
! [X_53,Z_54] : ( multiply(inverse(X_53),multiply(X_53,Z_54)) = Z_54 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_382]) ).
tff(c_390,plain,
! [X_2,Z_52] : ( multiply(inverse(X_2),multiply(X_2,Z_52)) = Z_52 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_382]) ).
tff(c_4130,plain,
! [X_117,Z_118] : ( multiply(inverse(inverse(X_117)),Z_118) = multiply(X_117,Z_118) ),
inference(superposition,[status(thm),theory(equality)],[c_392,c_390]) ).
tff(c_413,plain,
! [X_2] : ( multiply(inverse(inverse(X_2)),identity) = X_2 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_392]) ).
tff(c_4165,plain,
! [X_117] : ( multiply(X_117,identity) = X_117 ),
inference(superposition,[status(thm),theory(equality)],[c_4130,c_413]) ).
tff(c_4214,plain,
! [X_119] : ( multiply(X_119,identity) = X_119 ),
inference(superposition,[status(thm),theory(equality)],[c_4130,c_413]) ).
tff(c_395,plain,
! [X_53,Z_54] : ( multiply(inverse(inverse(X_53)),Z_54) = multiply(X_53,Z_54) ),
inference(superposition,[status(thm),theory(equality)],[c_392,c_390]) ).
tff(c_4221,plain,
! [X_53] : ( inverse(inverse(X_53)) = multiply(X_53,identity) ),
inference(superposition,[status(thm),theory(equality)],[c_4214,c_395]) ).
tff(c_4298,plain,
! [X_53] : ( inverse(inverse(X_53)) = X_53 ),
inference(demodulation,[status(thm),theory(equality)],[c_4165,c_4221]) ).
tff(c_34,plain,
least_upper_bound(c,d) = d,
inference(cnfTransformation,[status(thm)],[f_116]) ).
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_6,plain,
! [X_3,Y_4,Z_5] : ( multiply(multiply(X_3,Y_4),Z_5) = multiply(X_3,multiply(Y_4,Z_5)) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_32,plain,
least_upper_bound(a,b) = b,
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_145,plain,
! [X_42,Y_43] : ( greatest_lower_bound(X_42,least_upper_bound(X_42,Y_43)) = X_42 ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_160,plain,
greatest_lower_bound(a,b) = a,
inference(superposition,[status(thm),theory(equality)],[c_32,c_145]) ).
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_971,plain,
! [X_70,Y_71,Z_72] : ( greatest_lower_bound(multiply(X_70,Y_71),multiply(X_70,Z_72)) = multiply(X_70,greatest_lower_bound(Y_71,Z_72)) ),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_1035,plain,
! [X_2,Y_71] : ( multiply(inverse(X_2),greatest_lower_bound(Y_71,X_2)) = greatest_lower_bound(multiply(inverse(X_2),Y_71),identity) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_971]) ).
tff(c_45974,plain,
! [X_355,Y_356] : ( multiply(inverse(X_355),greatest_lower_bound(Y_356,X_355)) = greatest_lower_bound(identity,multiply(inverse(X_355),Y_356)) ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_1035]) ).
tff(c_46330,plain,
greatest_lower_bound(identity,multiply(inverse(b),a)) = multiply(inverse(b),a),
inference(superposition,[status(thm),theory(equality)],[c_160,c_45974]) ).
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_1938,plain,
! [Y_91,X_92,Z_93] : ( least_upper_bound(multiply(Y_91,X_92),multiply(Z_93,X_92)) = multiply(least_upper_bound(Y_91,Z_93),X_92) ),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_5541,plain,
! [Z_134,X_135] : ( multiply(least_upper_bound(identity,Z_134),X_135) = least_upper_bound(X_135,multiply(Z_134,X_135)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1938]) ).
tff(c_5700,plain,
! [X_135,Y_19] : ( least_upper_bound(X_135,multiply(greatest_lower_bound(identity,Y_19),X_135)) = multiply(identity,X_135) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_5541]) ).
tff(c_5736,plain,
! [X_135,Y_19] : ( least_upper_bound(X_135,multiply(greatest_lower_bound(identity,Y_19),X_135)) = X_135 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_5700]) ).
tff(c_93923,plain,
! [X_135] : ( least_upper_bound(X_135,multiply(multiply(inverse(b),a),X_135)) = X_135 ),
inference(superposition,[status(thm),theory(equality)],[c_46330,c_5736]) ).
tff(c_96155,plain,
! [X_514] : ( least_upper_bound(X_514,multiply(inverse(b),multiply(a,X_514))) = X_514 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_93923]) ).
tff(c_648,plain,
! [X_62,Y_63,Z_64] : ( least_upper_bound(least_upper_bound(X_62,Y_63),Z_64) = least_upper_bound(X_62,least_upper_bound(Y_63,Z_64)) ),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_2534,plain,
! [X_102,Y_103,X_101] : ( least_upper_bound(X_102,least_upper_bound(Y_103,X_101)) = least_upper_bound(X_101,least_upper_bound(X_102,Y_103)) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_648]) ).
tff(c_6828,plain,
! [X_146] : ( least_upper_bound(d,least_upper_bound(X_146,c)) = least_upper_bound(X_146,d) ),
inference(superposition,[status(thm),theory(equality)],[c_34,c_2534]) ).
tff(c_6919,plain,
! [Y_9] : ( least_upper_bound(d,least_upper_bound(c,Y_9)) = least_upper_bound(Y_9,d) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_6828]) ).
tff(c_96315,plain,
least_upper_bound(multiply(inverse(b),multiply(a,c)),d) = least_upper_bound(d,c),
inference(superposition,[status(thm),theory(equality)],[c_96155,c_6919]) ).
tff(c_96543,plain,
least_upper_bound(multiply(inverse(b),multiply(a,c)),d) = d,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_10,c_96315]) ).
tff(c_1661,plain,
! [X_86,Y_87,Z_88] : ( least_upper_bound(multiply(X_86,Y_87),multiply(X_86,Z_88)) = multiply(X_86,least_upper_bound(Y_87,Z_88)) ),
inference(cnfTransformation,[status(thm)],[f_106]) ).
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_40729,plain,
! [X_332,Y_333,Z_334] : ( greatest_lower_bound(multiply(X_332,Y_333),multiply(X_332,least_upper_bound(Y_333,Z_334))) = multiply(X_332,Y_333) ),
inference(superposition,[status(thm),theory(equality)],[c_1661,c_22]) ).
tff(c_41077,plain,
! [Z_52,X_2,Z_334] : ( greatest_lower_bound(Z_52,multiply(inverse(X_2),least_upper_bound(multiply(X_2,Z_52),Z_334))) = multiply(inverse(X_2),multiply(X_2,Z_52)) ),
inference(superposition,[status(thm),theory(equality)],[c_390,c_40729]) ).
tff(c_231971,plain,
! [Z_767,X_768,Z_769] : ( greatest_lower_bound(Z_767,multiply(inverse(X_768),least_upper_bound(multiply(X_768,Z_767),Z_769))) = Z_767 ),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_41077]) ).
tff(c_232650,plain,
greatest_lower_bound(multiply(a,c),multiply(inverse(inverse(b)),d)) = multiply(a,c),
inference(superposition,[status(thm),theory(equality)],[c_96543,c_231971]) ).
tff(c_233167,plain,
greatest_lower_bound(multiply(a,c),multiply(b,d)) = multiply(a,c),
inference(demodulation,[status(thm),theory(equality)],[c_4298,c_232650]) ).
tff(c_233169,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_36,c_233167]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP170-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/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 : n024.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 21:58:30 EDT 2023
% 0.14/0.36 % CPUTime :
% 53.70/42.80 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 53.70/42.81
% 53.70/42.81 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 53.81/42.84
% 53.81/42.84 Inference rules
% 53.81/42.84 ----------------------
% 53.81/42.84 #Ref : 0
% 53.81/42.84 #Sup : 59304
% 53.81/42.84 #Fact : 0
% 53.81/42.84 #Define : 0
% 53.81/42.84 #Split : 0
% 53.81/42.84 #Chain : 0
% 53.81/42.84 #Close : 0
% 53.81/42.84
% 53.81/42.84 Ordering : KBO
% 53.81/42.84
% 53.81/42.84 Simplification rules
% 53.81/42.84 ----------------------
% 53.81/42.84 #Subsume : 1318
% 53.81/42.84 #Demod : 74142
% 53.81/42.84 #Tautology : 34163
% 53.81/42.84 #SimpNegUnit : 1
% 53.81/42.84 #BackRed : 9
% 53.81/42.84
% 53.81/42.84 #Partial instantiations: 0
% 53.81/42.84 #Strategies tried : 1
% 53.81/42.84
% 53.81/42.84 Timing (in seconds)
% 53.81/42.84 ----------------------
% 53.81/42.84 Preprocessing : 0.47
% 53.81/42.84 Parsing : 0.26
% 53.81/42.84 CNF conversion : 0.02
% 53.81/42.84 Main loop : 41.25
% 53.81/42.84 Inferencing : 3.19
% 53.81/42.84 Reduction : 27.65
% 53.81/42.84 Demodulation : 25.94
% 53.81/42.84 BG Simplification : 0.32
% 53.81/42.84 Subsumption : 7.83
% 53.81/42.84 Abstraction : 0.61
% 53.81/42.84 MUC search : 0.00
% 53.81/42.84 Cooper : 0.00
% 53.81/42.84 Total : 41.78
% 53.81/42.84 Index Insertion : 0.00
% 53.81/42.84 Index Deletion : 0.00
% 53.81/42.84 Index Matching : 0.00
% 53.81/42.84 BG Taut test : 0.00
%------------------------------------------------------------------------------