TSTP Solution File: GRP022-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP022-2 : TPTP v8.1.2. Released v1.0.0.
% 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:39:38 EDT 2023
% Result : Unsatisfiable 2.64s 1.65s
% Output : CNFRefutation 2.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 19 ( 15 unt; 4 typ; 0 def)
% Number of atoms : 15 ( 14 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 : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 18 (; 18 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > #nlpp > inverse > identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(identity,type,
identity: $i ).
tff(f_58,axiom,
! [X] : ( multiply(inverse(X),X) = identity ),
file(unknown,unknown) ).
tff(f_54,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_61,axiom,
! [X,Y,Z] : ( multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X] : ( multiply(X,identity) = X ),
file(unknown,unknown) ).
tff(f_70,axiom,
inverse(inverse(a)) != a,
file(unknown,unknown) ).
tff(c_4,plain,
! [X_2] : ( multiply(inverse(X_2),X_2) = identity ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_86,plain,
! [X_12,Y_13,Z_14] : ( multiply(multiply(X_12,Y_13),Z_14) = multiply(X_12,multiply(Y_13,Z_14)) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_109,plain,
! [X_2,Z_14] : ( multiply(inverse(X_2),multiply(X_2,Z_14)) = multiply(identity,Z_14) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_86]) ).
tff(c_137,plain,
! [X_15,Z_16] : ( multiply(inverse(X_15),multiply(X_15,Z_16)) = Z_16 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_109]) ).
tff(c_178,plain,
! [X_17] : ( multiply(inverse(inverse(X_17)),identity) = X_17 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_137]) ).
tff(c_8,plain,
! [X_6] : ( multiply(X_6,identity) = X_6 ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_190,plain,
! [X_17] : ( inverse(inverse(X_17)) = X_17 ),
inference(superposition,[status(thm),theory(equality)],[c_178,c_8]) ).
tff(c_12,plain,
inverse(inverse(a)) != a,
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_208,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_190,c_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP022-2 : TPTP v8.1.2. Released v1.0.0.
% 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 : n024.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 22:24:45 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.64/1.65 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.64/1.66
% 2.64/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.78/1.69
% 2.78/1.69 Inference rules
% 2.78/1.69 ----------------------
% 2.78/1.69 #Ref : 0
% 2.78/1.69 #Sup : 48
% 2.78/1.69 #Fact : 0
% 2.78/1.69 #Define : 0
% 2.78/1.69 #Split : 0
% 2.78/1.69 #Chain : 0
% 2.78/1.69 #Close : 0
% 2.78/1.69
% 2.78/1.69 Ordering : KBO
% 2.78/1.69
% 2.78/1.69 Simplification rules
% 2.78/1.69 ----------------------
% 2.78/1.69 #Subsume : 0
% 2.78/1.69 #Demod : 31
% 2.78/1.69 #Tautology : 36
% 2.78/1.69 #SimpNegUnit : 0
% 2.78/1.69 #BackRed : 2
% 2.78/1.69
% 2.78/1.69 #Partial instantiations: 0
% 2.78/1.69 #Strategies tried : 1
% 2.78/1.69
% 2.78/1.69 Timing (in seconds)
% 2.78/1.69 ----------------------
% 2.78/1.69 Preprocessing : 0.40
% 2.78/1.69 Parsing : 0.20
% 2.78/1.69 CNF conversion : 0.02
% 2.78/1.69 Main loop : 0.22
% 2.78/1.69 Inferencing : 0.09
% 2.78/1.69 Reduction : 0.07
% 2.78/1.69 Demodulation : 0.05
% 2.78/1.69 BG Simplification : 0.01
% 2.78/1.70 Subsumption : 0.04
% 2.78/1.70 Abstraction : 0.01
% 2.78/1.70 MUC search : 0.00
% 2.78/1.70 Cooper : 0.00
% 2.78/1.70 Total : 0.68
% 2.78/1.70 Index Insertion : 0.00
% 2.78/1.70 Index Deletion : 0.00
% 2.78/1.70 Index Matching : 0.00
% 2.78/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------