TSTP Solution File: GRP170-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP170-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 : 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:22 EDT 2023
% Result : Unsatisfiable 56.40s 44.44s
% Output : CNFRefutation 56.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 22
% Syntax : Number of formulae : 64 ( 55 unt; 9 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 ( 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 : 81 (; 81 !; 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_117,axiom,
least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d),
file(unknown,unknown) ).
tff(f_90,axiom,
! [X,Y] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_55,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_59,axiom,
! [X] : ( multiply(inverse(X),X) = identity ),
file(unknown,unknown) ).
tff(f_62,axiom,
! [X,Y,Z] : ( multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_115,axiom,
least_upper_bound(c,d) = d,
file(unknown,unknown) ).
tff(f_102,axiom,
! [X,Y] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(f_114,axiom,
least_upper_bound(a,b) = b,
file(unknown,unknown) ).
tff(f_107,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_111,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_92,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_88,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_100,axiom,
! [X,Y] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ),
file(unknown,unknown) ).
tff(c_36,plain,
least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d),
inference(cnfTransformation,[status(thm)],[f_117]) ).
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_90]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_4,plain,
! [X_2] : ( multiply(inverse(X_2),X_2) = identity ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
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_62]) ).
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_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_102]) ).
tff(c_166,plain,
greatest_lower_bound(c,d) = c,
inference(superposition,[status(thm),theory(equality)],[c_34,c_145]) ).
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_62]) ).
tff(c_32,plain,
least_upper_bound(a,b) = b,
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_160,plain,
greatest_lower_bound(a,b) = a,
inference(superposition,[status(thm),theory(equality)],[c_32,c_145]) ).
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_107]) ).
tff(c_39485,plain,
! [X_328,Z_329] : ( multiply(inverse(X_328),greatest_lower_bound(X_328,Z_329)) = greatest_lower_bound(identity,multiply(inverse(X_328),Z_329)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_971]) ).
tff(c_39806,plain,
greatest_lower_bound(identity,multiply(inverse(a),b)) = multiply(inverse(a),a),
inference(superposition,[status(thm),theory(equality)],[c_160,c_39485]) ).
tff(c_39858,plain,
greatest_lower_bound(identity,multiply(inverse(a),b)) = identity,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_39806]) ).
tff(c_1266,plain,
! [Y_77,X_78,Z_79] : ( greatest_lower_bound(multiply(Y_77,X_78),multiply(Z_79,X_78)) = multiply(greatest_lower_bound(Y_77,Z_79),X_78) ),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_1341,plain,
! [Z_79,X_1] : ( multiply(greatest_lower_bound(identity,Z_79),X_1) = greatest_lower_bound(X_1,multiply(Z_79,X_1)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1266]) ).
tff(c_39989,plain,
! [X_1] : ( greatest_lower_bound(X_1,multiply(multiply(inverse(a),b),X_1)) = multiply(identity,X_1) ),
inference(superposition,[status(thm),theory(equality)],[c_39858,c_1341]) ).
tff(c_92425,plain,
! [X_509] : ( greatest_lower_bound(X_509,multiply(inverse(a),multiply(b,X_509))) = X_509 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_2,c_39989]) ).
tff(c_536,plain,
! [X_58,Y_59,Z_60] : ( greatest_lower_bound(greatest_lower_bound(X_58,Y_59),Z_60) = greatest_lower_bound(X_58,greatest_lower_bound(Y_59,Z_60)) ),
inference(cnfTransformation,[status(thm)],[f_92]) ).
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_88]) ).
tff(c_10977,plain,
! [Z_176,X_177,Y_178] : ( greatest_lower_bound(Z_176,greatest_lower_bound(X_177,Y_178)) = greatest_lower_bound(X_177,greatest_lower_bound(Y_178,Z_176)) ),
inference(superposition,[status(thm),theory(equality)],[c_536,c_8]) ).
tff(c_11597,plain,
! [Z_176] : ( greatest_lower_bound(c,greatest_lower_bound(d,Z_176)) = greatest_lower_bound(Z_176,c) ),
inference(superposition,[status(thm),theory(equality)],[c_166,c_10977]) ).
tff(c_92642,plain,
greatest_lower_bound(multiply(inverse(a),multiply(b,d)),c) = greatest_lower_bound(c,d),
inference(superposition,[status(thm),theory(equality)],[c_92425,c_11597]) ).
tff(c_92824,plain,
greatest_lower_bound(multiply(inverse(a),multiply(b,d)),c) = c,
inference(demodulation,[status(thm),theory(equality)],[c_166,c_92642]) ).
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_100]) ).
tff(c_46407,plain,
! [X_357,Y_358,Z_359] : ( least_upper_bound(multiply(X_357,Y_358),multiply(X_357,greatest_lower_bound(Y_358,Z_359))) = multiply(X_357,Y_358) ),
inference(superposition,[status(thm),theory(equality)],[c_971,c_20]) ).
tff(c_46812,plain,
! [Z_52,X_2,Z_359] : ( least_upper_bound(Z_52,multiply(inverse(X_2),greatest_lower_bound(multiply(X_2,Z_52),Z_359))) = multiply(inverse(X_2),multiply(X_2,Z_52)) ),
inference(superposition,[status(thm),theory(equality)],[c_390,c_46407]) ).
tff(c_240057,plain,
! [Z_786,X_787,Z_788] : ( least_upper_bound(Z_786,multiply(inverse(X_787),greatest_lower_bound(multiply(X_787,Z_786),Z_788))) = Z_786 ),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_46812]) ).
tff(c_240644,plain,
least_upper_bound(multiply(b,d),multiply(inverse(inverse(a)),c)) = multiply(b,d),
inference(superposition,[status(thm),theory(equality)],[c_92824,c_240057]) ).
tff(c_241290,plain,
least_upper_bound(multiply(a,c),multiply(b,d)) = multiply(b,d),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_4298,c_240644]) ).
tff(c_241292,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_36,c_241290]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GRP170-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.13/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.36 % Computer : n018.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 3 22:25:21 EDT 2023
% 0.16/0.36 % CPUTime :
% 56.40/44.44 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 56.40/44.45
% 56.40/44.45 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 56.58/44.49
% 56.58/44.49 Inference rules
% 56.58/44.49 ----------------------
% 56.58/44.49 #Ref : 0
% 56.58/44.49 #Sup : 61318
% 56.58/44.49 #Fact : 0
% 56.58/44.49 #Define : 0
% 56.58/44.49 #Split : 0
% 56.58/44.49 #Chain : 0
% 56.58/44.49 #Close : 0
% 56.58/44.49
% 56.58/44.49 Ordering : KBO
% 56.58/44.49
% 56.58/44.49 Simplification rules
% 56.58/44.49 ----------------------
% 56.58/44.49 #Subsume : 1322
% 56.58/44.49 #Demod : 76699
% 56.58/44.49 #Tautology : 35295
% 56.58/44.49 #SimpNegUnit : 1
% 56.58/44.49 #BackRed : 9
% 56.58/44.49
% 56.58/44.49 #Partial instantiations: 0
% 56.58/44.49 #Strategies tried : 1
% 56.58/44.49
% 56.58/44.49 Timing (in seconds)
% 56.58/44.49 ----------------------
% 56.58/44.49 Preprocessing : 0.46
% 56.58/44.49 Parsing : 0.24
% 56.58/44.49 CNF conversion : 0.02
% 56.58/44.49 Main loop : 42.94
% 56.58/44.49 Inferencing : 3.45
% 56.58/44.49 Reduction : 28.50
% 56.58/44.49 Demodulation : 26.72
% 56.58/44.49 BG Simplification : 0.35
% 56.58/44.49 Subsumption : 8.15
% 56.58/44.49 Abstraction : 0.64
% 56.58/44.49 MUC search : 0.00
% 56.58/44.49 Cooper : 0.00
% 56.58/44.49 Total : 43.46
% 56.58/44.49 Index Insertion : 0.00
% 56.58/44.49 Index Deletion : 0.00
% 56.58/44.49 Index Matching : 0.00
% 56.58/44.49 BG Taut test : 0.00
%------------------------------------------------------------------------------