TSTP Solution File: GRP166-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP166-4 : 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 : n007.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:20 EDT 2023
% Result : Unsatisfiable 8.72s 3.20s
% Output : CNFRefutation 8.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 26 ( 19 unt; 7 typ; 0 def)
% Number of atoms : 19 ( 18 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 26 (; 26 !; 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_90,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_57,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_64,axiom,
! [X,Y,Z] : ( multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_117,axiom,
greatest_lower_bound(b,identity) = identity,
file(unknown,unknown) ).
tff(f_113,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_119,axiom,
greatest_lower_bound(a,multiply(b,a)) != a,
file(unknown,unknown) ).
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_90]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
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_64]) ).
tff(c_34,plain,
greatest_lower_bound(b,identity) = identity,
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_1062,plain,
! [Y_73,X_74,Z_75] : ( greatest_lower_bound(multiply(Y_73,X_74),multiply(Z_75,X_74)) = multiply(greatest_lower_bound(Y_73,Z_75),X_74) ),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_12198,plain,
! [Y_172,X_173] : ( multiply(greatest_lower_bound(Y_172,identity),X_173) = greatest_lower_bound(multiply(Y_172,X_173),X_173) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1062]) ).
tff(c_12439,plain,
! [X_173] : ( greatest_lower_bound(multiply(b,X_173),X_173) = multiply(identity,X_173) ),
inference(superposition,[status(thm),theory(equality)],[c_34,c_12198]) ).
tff(c_12485,plain,
! [X_174] : ( greatest_lower_bound(multiply(b,X_174),X_174) = X_174 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_12439]) ).
tff(c_1129,plain,
! [Y_73,X_1] : ( multiply(greatest_lower_bound(Y_73,identity),X_1) = greatest_lower_bound(multiply(Y_73,X_1),X_1) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1062]) ).
tff(c_12492,plain,
! [X_1] : ( greatest_lower_bound(multiply(multiply(b,identity),X_1),X_1) = multiply(identity,X_1) ),
inference(superposition,[status(thm),theory(equality)],[c_12485,c_1129]) ).
tff(c_12642,plain,
! [X_1] : ( greatest_lower_bound(X_1,multiply(b,X_1)) = X_1 ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_2,c_6,c_2,c_12492]) ).
tff(c_36,plain,
greatest_lower_bound(a,multiply(b,a)) != a,
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_12672,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_12642,c_36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP166-4 : 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.15/0.36 % Computer : n007.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 21:42:09 EDT 2023
% 0.15/0.36 % CPUTime :
% 8.72/3.20 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.72/3.21
% 8.72/3.21 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.72/3.24
% 8.72/3.24 Inference rules
% 8.72/3.24 ----------------------
% 8.72/3.24 #Ref : 0
% 8.72/3.24 #Sup : 3196
% 8.72/3.24 #Fact : 0
% 8.72/3.24 #Define : 0
% 8.72/3.24 #Split : 0
% 8.72/3.24 #Chain : 0
% 8.72/3.24 #Close : 0
% 8.72/3.24
% 8.72/3.24 Ordering : KBO
% 8.72/3.24
% 8.72/3.24 Simplification rules
% 8.72/3.24 ----------------------
% 8.72/3.24 #Subsume : 89
% 8.72/3.24 #Demod : 2927
% 8.72/3.24 #Tautology : 1891
% 8.72/3.24 #SimpNegUnit : 0
% 8.72/3.24 #BackRed : 5
% 8.72/3.24
% 8.72/3.24 #Partial instantiations: 0
% 8.72/3.24 #Strategies tried : 1
% 8.72/3.24
% 8.72/3.24 Timing (in seconds)
% 8.72/3.24 ----------------------
% 8.72/3.24 Preprocessing : 0.47
% 8.72/3.24 Parsing : 0.25
% 8.72/3.24 CNF conversion : 0.02
% 8.72/3.24 Main loop : 1.69
% 8.72/3.24 Inferencing : 0.49
% 8.72/3.24 Reduction : 0.83
% 9.09/3.24 Demodulation : 0.72
% 9.09/3.25 BG Simplification : 0.05
% 9.09/3.25 Subsumption : 0.23
% 9.09/3.25 Abstraction : 0.07
% 9.09/3.25 MUC search : 0.00
% 9.09/3.25 Cooper : 0.00
% 9.09/3.25 Total : 2.22
% 9.09/3.25 Index Insertion : 0.00
% 9.09/3.25 Index Deletion : 0.00
% 9.09/3.25 Index Matching : 0.00
% 9.09/3.25 BG Taut test : 0.00
%------------------------------------------------------------------------------