TSTP Solution File: GRP011-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP011-4 : 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/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 : n019.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:36 EDT 2023
% Result : Unsatisfiable 2.99s 1.80s
% Output : CNFRefutation 2.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 30 ( 24 unt; 6 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 : 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 27 (; 27 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > #nlpp > inverse > identity > d > c > b
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(inverse,type,
inverse: $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_34,axiom,
b != d,
file(unknown,unknown) ).
tff(f_29,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X] : ( multiply(inverse(X),X) = identity ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [X,Y,Z] : ( multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_32,axiom,
multiply(b,c) = multiply(d,c),
file(unknown,unknown) ).
tff(c_10,plain,
d != b,
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_4,plain,
! [X_4] : ( multiply(identity,X_4) = X_4 ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_6,plain,
! [X_5] : ( multiply(inverse(X_5),X_5) = identity ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_31,plain,
! [X_8,Y_9,Z_10] : ( multiply(multiply(X_8,Y_9),Z_10) = multiply(X_8,multiply(Y_9,Z_10)) ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_49,plain,
! [X_5,Z_10] : ( multiply(inverse(X_5),multiply(X_5,Z_10)) = multiply(identity,Z_10) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_31]) ).
tff(c_58,plain,
! [X_5,Z_10] : ( multiply(inverse(X_5),multiply(X_5,Z_10)) = Z_10 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_49]) ).
tff(c_60,plain,
! [X_11,Z_12] : ( multiply(inverse(X_11),multiply(X_11,Z_12)) = Z_12 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_49]) ).
tff(c_248,plain,
! [X_17,Z_18] : ( multiply(inverse(inverse(X_17)),Z_18) = multiply(X_17,Z_18) ),
inference(superposition,[status(thm),theory(equality)],[c_58,c_60]) ).
tff(c_84,plain,
! [X_5] : ( multiply(inverse(inverse(X_5)),identity) = X_5 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_60]) ).
tff(c_259,plain,
! [X_17] : ( multiply(X_17,identity) = X_17 ),
inference(superposition,[status(thm),theory(equality)],[c_248,c_84]) ).
tff(c_273,plain,
! [X_17] : ( multiply(X_17,inverse(X_17)) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_248,c_6]) ).
tff(c_427,plain,
! [X_22] : ( multiply(X_22,inverse(X_22)) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_248,c_6]) ).
tff(c_2,plain,
! [X_1,Y_2,Z_3] : ( multiply(multiply(X_1,Y_2),Z_3) = multiply(X_1,multiply(Y_2,Z_3)) ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_8,plain,
multiply(d,c) = multiply(b,c),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_46,plain,
! [Z_10] : ( multiply(multiply(b,c),Z_10) = multiply(d,multiply(c,Z_10)) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_31]) ).
tff(c_57,plain,
! [Z_10] : ( multiply(d,multiply(c,Z_10)) = multiply(b,multiply(c,Z_10)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_46]) ).
tff(c_433,plain,
multiply(b,multiply(c,inverse(c))) = multiply(d,identity),
inference(superposition,[status(thm),theory(equality)],[c_427,c_57]) ).
tff(c_465,plain,
d = b,
inference(demodulation,[status(thm),theory(equality)],[c_259,c_273,c_259,c_433]) ).
tff(c_467,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_10,c_465]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP011-4 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14 % 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.14/0.35 % Computer : n019.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:19:47 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.99/1.80 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.99/1.81
% 2.99/1.81 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.99/1.84
% 2.99/1.84 Inference rules
% 2.99/1.84 ----------------------
% 2.99/1.84 #Ref : 0
% 2.99/1.84 #Sup : 112
% 2.99/1.84 #Fact : 0
% 2.99/1.84 #Define : 0
% 2.99/1.84 #Split : 0
% 2.99/1.84 #Chain : 0
% 2.99/1.84 #Close : 0
% 2.99/1.84
% 2.99/1.84 Ordering : KBO
% 2.99/1.84
% 2.99/1.84 Simplification rules
% 2.99/1.84 ----------------------
% 2.99/1.84 #Subsume : 0
% 2.99/1.84 #Demod : 74
% 2.99/1.84 #Tautology : 78
% 2.99/1.84 #SimpNegUnit : 1
% 2.99/1.84 #BackRed : 4
% 2.99/1.84
% 2.99/1.84 #Partial instantiations: 0
% 2.99/1.84 #Strategies tried : 1
% 2.99/1.84
% 2.99/1.84 Timing (in seconds)
% 2.99/1.84 ----------------------
% 2.99/1.84 Preprocessing : 0.43
% 2.99/1.84 Parsing : 0.22
% 2.99/1.84 CNF conversion : 0.02
% 2.99/1.84 Main loop : 0.32
% 2.99/1.84 Inferencing : 0.13
% 2.99/1.84 Reduction : 0.11
% 2.99/1.84 Demodulation : 0.08
% 2.99/1.84 BG Simplification : 0.01
% 2.99/1.84 Subsumption : 0.05
% 2.99/1.84 Abstraction : 0.02
% 2.99/1.84 MUC search : 0.00
% 2.99/1.84 Cooper : 0.00
% 2.99/1.84 Total : 0.80
% 2.99/1.84 Index Insertion : 0.00
% 2.99/1.84 Index Deletion : 0.00
% 2.99/1.84 Index Matching : 0.00
% 2.99/1.84 BG Taut test : 0.00
%------------------------------------------------------------------------------