TSTP Solution File: GRP172-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP172-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 : n006.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 4.66s 2.33s
% Output : CNFRefutation 5.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of formulae : 31 ( 24 unt; 7 typ; 0 def)
% Number of atoms : 24 ( 23 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 : 3 ( 1 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_117,axiom,
greatest_lower_bound(identity,multiply(a,b)) != identity,
file(unknown,unknown) ).
tff(f_115,axiom,
greatest_lower_bound(identity,b) = identity,
file(unknown,unknown) ).
tff(f_55,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_88,axiom,
! [X,Y] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file(unknown,unknown) ).
tff(f_114,axiom,
greatest_lower_bound(identity,a) = identity,
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(c_36,plain,
greatest_lower_bound(identity,multiply(a,b)) != identity,
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_34,plain,
greatest_lower_bound(identity,b) = identity,
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_112,plain,
! [Y_40,X_41] : ( greatest_lower_bound(Y_40,X_41) = greatest_lower_bound(X_41,Y_40) ),
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_32,plain,
greatest_lower_bound(identity,a) = identity,
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_127,plain,
greatest_lower_bound(a,identity) = identity,
inference(superposition,[status(thm),theory(equality)],[c_112,c_32]) ).
tff(c_1224,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_2939,plain,
! [Y_103,X_104] : ( multiply(greatest_lower_bound(Y_103,identity),X_104) = greatest_lower_bound(multiply(Y_103,X_104),X_104) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1224]) ).
tff(c_3052,plain,
! [X_104] : ( greatest_lower_bound(multiply(a,X_104),X_104) = multiply(identity,X_104) ),
inference(superposition,[status(thm),theory(equality)],[c_127,c_2939]) ).
tff(c_3199,plain,
! [X_106] : ( greatest_lower_bound(multiply(a,X_106),X_106) = X_106 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_3052]) ).
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_243,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_92]) ).
tff(c_537,plain,
! [Z_56] : ( greatest_lower_bound(identity,greatest_lower_bound(b,Z_56)) = greatest_lower_bound(identity,Z_56) ),
inference(superposition,[status(thm),theory(equality)],[c_34,c_243]) ).
tff(c_571,plain,
! [X_6] : ( greatest_lower_bound(identity,greatest_lower_bound(X_6,b)) = greatest_lower_bound(identity,X_6) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_537]) ).
tff(c_3233,plain,
greatest_lower_bound(identity,multiply(a,b)) = greatest_lower_bound(identity,b),
inference(superposition,[status(thm),theory(equality)],[c_3199,c_571]) ).
tff(c_3283,plain,
greatest_lower_bound(identity,multiply(a,b)) = identity,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_3233]) ).
tff(c_3285,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_36,c_3283]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP172-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.13/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.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % 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 22:21:28 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.66/2.33 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.66/2.33
% 4.66/2.33 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.38/2.36
% 5.38/2.36 Inference rules
% 5.38/2.36 ----------------------
% 5.38/2.36 #Ref : 0
% 5.38/2.36 #Sup : 819
% 5.38/2.36 #Fact : 0
% 5.38/2.36 #Define : 0
% 5.38/2.36 #Split : 0
% 5.38/2.36 #Chain : 0
% 5.38/2.36 #Close : 0
% 5.38/2.36
% 5.38/2.36 Ordering : KBO
% 5.38/2.36
% 5.38/2.36 Simplification rules
% 5.38/2.36 ----------------------
% 5.38/2.36 #Subsume : 7
% 5.38/2.36 #Demod : 704
% 5.38/2.36 #Tautology : 473
% 5.38/2.36 #SimpNegUnit : 1
% 5.38/2.36 #BackRed : 2
% 5.38/2.36
% 5.38/2.36 #Partial instantiations: 0
% 5.38/2.36 #Strategies tried : 1
% 5.38/2.36
% 5.38/2.36 Timing (in seconds)
% 5.38/2.36 ----------------------
% 5.38/2.36 Preprocessing : 0.47
% 5.38/2.36 Parsing : 0.25
% 5.38/2.36 CNF conversion : 0.03
% 5.38/2.37 Main loop : 0.80
% 5.38/2.37 Inferencing : 0.25
% 5.38/2.37 Reduction : 0.34
% 5.38/2.37 Demodulation : 0.29
% 5.38/2.37 BG Simplification : 0.04
% 5.38/2.37 Subsumption : 0.12
% 5.38/2.37 Abstraction : 0.04
% 5.43/2.37 MUC search : 0.00
% 5.43/2.37 Cooper : 0.00
% 5.43/2.37 Total : 1.32
% 5.43/2.37 Index Insertion : 0.00
% 5.43/2.37 Index Deletion : 0.00
% 5.43/2.37 Index Matching : 0.00
% 5.43/2.37 BG Taut test : 0.00
%------------------------------------------------------------------------------