TSTP Solution File: GRP193-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP193-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 : 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:27 EDT 2023
% Result : Unsatisfiable 11.95s 4.14s
% Output : CNFRefutation 12.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of formulae : 43 ( 35 unt; 8 typ; 0 def)
% Number of atoms : 35 ( 34 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 : 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 39 (; 39 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > least_upper_bound > greatest_lower_bound > #nlpp > inverse > identity > 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(identity,type,
identity: $i ).
tff(c,type,
c: $i ).
tff(f_120,axiom,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
file(unknown,unknown) ).
tff(f_88,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_55,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_115,axiom,
least_upper_bound(identity,b) = b,
file(unknown,unknown) ).
tff(f_102,axiom,
! [X,Y] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X ),
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_98,axiom,
! [X] : ( greatest_lower_bound(X,X) = 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_117,axiom,
greatest_lower_bound(a,b) = identity,
file(unknown,unknown) ).
tff(f_118,axiom,
least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)),
file(unknown,unknown) ).
tff(c_42,plain,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
inference(cnfTransformation,[status(thm)],[f_120]) ).
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_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_34,plain,
least_upper_bound(identity,b) = b,
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_194,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_230,plain,
greatest_lower_bound(identity,b) = identity,
inference(superposition,[status(thm),theory(equality)],[c_34,c_194]) ).
tff(c_317,plain,
greatest_lower_bound(b,identity) = identity,
inference(superposition,[status(thm),theory(equality)],[c_8,c_230]) ).
tff(c_987,plain,
! [Y_67,X_68,Z_69] : ( greatest_lower_bound(multiply(Y_67,X_68),multiply(Z_69,X_68)) = multiply(greatest_lower_bound(Y_67,Z_69),X_68) ),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_4834,plain,
! [Y_119,X_120] : ( multiply(greatest_lower_bound(Y_119,identity),X_120) = greatest_lower_bound(multiply(Y_119,X_120),X_120) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_987]) ).
tff(c_4937,plain,
! [X_120] : ( greatest_lower_bound(multiply(b,X_120),X_120) = multiply(identity,X_120) ),
inference(superposition,[status(thm),theory(equality)],[c_317,c_4834]) ).
tff(c_5203,plain,
! [X_123] : ( greatest_lower_bound(multiply(b,X_123),X_123) = X_123 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_4937]) ).
tff(c_5288,plain,
! [X_6] : ( greatest_lower_bound(X_6,multiply(b,X_6)) = X_6 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_5203]) ).
tff(c_18,plain,
! [X_17] : ( greatest_lower_bound(X_17,X_17) = X_17 ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_393,plain,
! [X_49,Y_50,Z_51] : ( greatest_lower_bound(greatest_lower_bound(X_49,Y_50),Z_51) = greatest_lower_bound(X_49,greatest_lower_bound(Y_50,Z_51)) ),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_461,plain,
! [X_17,Z_51] : ( greatest_lower_bound(X_17,greatest_lower_bound(X_17,Z_51)) = greatest_lower_bound(X_17,Z_51) ),
inference(superposition,[status(thm),theory(equality)],[c_18,c_393]) ).
tff(c_12,plain,
! [X_10,Y_11,Z_12] : ( greatest_lower_bound(greatest_lower_bound(X_10,Y_11),Z_12) = greatest_lower_bound(X_10,greatest_lower_bound(Y_11,Z_12)) ),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_38,plain,
greatest_lower_bound(a,b) = identity,
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_40,plain,
least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_43,plain,
least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(identity,greatest_lower_bound(a,c))) = multiply(identity,greatest_lower_bound(a,c)),
inference(demodulation,[status(thm),theory(equality)],[c_38,c_38,c_40]) ).
tff(c_44,plain,
least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c)) = greatest_lower_bound(a,c),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_43]) ).
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_102]) ).
tff(c_20160,plain,
! [X_211,Y_212,Y_213] : ( greatest_lower_bound(X_211,greatest_lower_bound(Y_212,least_upper_bound(greatest_lower_bound(X_211,Y_212),Y_213))) = greatest_lower_bound(X_211,Y_212) ),
inference(superposition,[status(thm),theory(equality)],[c_393,c_22]) ).
tff(c_20695,plain,
greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),greatest_lower_bound(a,c))) = greatest_lower_bound(a,multiply(b,c)),
inference(superposition,[status(thm),theory(equality)],[c_44,c_20160]) ).
tff(c_20904,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c),
inference(demodulation,[status(thm),theory(equality)],[c_5288,c_461,c_12,c_8,c_20695]) ).
tff(c_20906,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_42,c_20904]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP193-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.13 % 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.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 21:53:33 EDT 2023
% 0.13/0.35 % CPUTime :
% 11.95/4.14 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.95/4.15
% 11.95/4.15 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 12.12/4.18
% 12.12/4.18 Inference rules
% 12.12/4.18 ----------------------
% 12.12/4.18 #Ref : 0
% 12.12/4.18 #Sup : 5397
% 12.12/4.18 #Fact : 0
% 12.12/4.18 #Define : 0
% 12.12/4.18 #Split : 0
% 12.12/4.18 #Chain : 0
% 12.12/4.18 #Close : 0
% 12.12/4.18
% 12.12/4.18 Ordering : KBO
% 12.12/4.18
% 12.12/4.18 Simplification rules
% 12.12/4.18 ----------------------
% 12.12/4.18 #Subsume : 90
% 12.12/4.18 #Demod : 4319
% 12.12/4.18 #Tautology : 3142
% 12.12/4.18 #SimpNegUnit : 1
% 12.12/4.18 #BackRed : 4
% 12.12/4.18
% 12.12/4.18 #Partial instantiations: 0
% 12.12/4.18 #Strategies tried : 1
% 12.12/4.18
% 12.12/4.18 Timing (in seconds)
% 12.12/4.18 ----------------------
% 12.12/4.18 Preprocessing : 0.47
% 12.12/4.18 Parsing : 0.24
% 12.12/4.18 CNF conversion : 0.02
% 12.12/4.18 Main loop : 2.66
% 12.12/4.18 Inferencing : 0.67
% 12.12/4.18 Reduction : 1.36
% 12.12/4.18 Demodulation : 1.19
% 12.12/4.18 BG Simplification : 0.07
% 12.12/4.18 Subsumption : 0.42
% 12.12/4.18 Abstraction : 0.08
% 12.12/4.18 MUC search : 0.00
% 12.12/4.18 Cooper : 0.00
% 12.12/4.18 Total : 3.17
% 12.12/4.18 Index Insertion : 0.00
% 12.12/4.18 Index Deletion : 0.00
% 12.12/4.18 Index Matching : 0.00
% 12.12/4.18 BG Taut test : 0.00
%------------------------------------------------------------------------------