TSTP Solution File: GRP512-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP512-1 : TPTP v8.1.2. Bugfixed v2.7.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 : n009.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:41:25 EDT 2023
% Result : Unsatisfiable 3.89s 1.96s
% Output : CNFRefutation 3.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 27 unt; 4 typ; 0 def)
% Number of atoms : 27 ( 26 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 7 ( 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 : 57 (; 57 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > #nlpp > inverse > b > 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(b,type,
b: $i ).
tff(f_25,axiom,
! [A,B,C] : ( multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B ),
file(unknown,unknown) ).
tff(f_27,axiom,
multiply(a,b) != multiply(b,a),
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( multiply(multiply(multiply(A_1,B_2),C_3),inverse(multiply(A_1,C_3))) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_5,plain,
! [A_4,B_5,C_6] : ( multiply(multiply(multiply(A_4,B_5),C_6),inverse(multiply(A_4,C_6))) = B_5 ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_26,plain,
! [A_1,B_2,C_3,B_5] : ( multiply(multiply(multiply(multiply(multiply(A_1,B_2),C_3),B_5),inverse(multiply(A_1,C_3))),inverse(B_2)) = B_5 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_5]) ).
tff(c_70,plain,
! [A_10,B_11,C_12,B_13] : ( multiply(multiply(multiply(multiply(multiply(A_10,B_11),C_12),B_13),inverse(multiply(A_10,C_12))),inverse(B_11)) = B_13 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_5]) ).
tff(c_109,plain,
! [B_5,A_1,B_2,C_3] : ( multiply(multiply(B_5,inverse(multiply(multiply(multiply(A_1,B_2),C_3),inverse(multiply(A_1,C_3))))),inverse(B_5)) = inverse(B_2) ),
inference(superposition,[status(thm),theory(equality)],[c_26,c_70]) ).
tff(c_256,plain,
! [B_18,B_19] : ( multiply(multiply(B_18,inverse(B_19)),inverse(B_18)) = inverse(B_19) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_109]) ).
tff(c_144,plain,
! [B_5,B_2] : ( multiply(multiply(B_5,inverse(B_2)),inverse(B_5)) = inverse(B_2) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_109]) ).
tff(c_382,plain,
! [B_22,B_23] : ( multiply(inverse(B_22),inverse(multiply(B_23,inverse(B_22)))) = inverse(B_23) ),
inference(superposition,[status(thm),theory(equality)],[c_256,c_144]) ).
tff(c_11,plain,
! [B_5,A_4,C_6] : ( multiply(B_5,inverse(multiply(multiply(A_4,B_5),inverse(multiply(A_4,C_6))))) = C_6 ),
inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).
tff(c_417,plain,
! [A_4,C_6] : ( inverse(multiply(A_4,inverse(multiply(A_4,C_6)))) = C_6 ),
inference(superposition,[status(thm),theory(equality)],[c_382,c_11]) ).
tff(c_259,plain,
! [B_19,B_18] : ( multiply(inverse(B_19),inverse(multiply(B_18,inverse(B_19)))) = inverse(B_18) ),
inference(superposition,[status(thm),theory(equality)],[c_256,c_144]) ).
tff(c_460,plain,
! [A_24,C_25] : ( inverse(multiply(A_24,inverse(multiply(A_24,C_25)))) = C_25 ),
inference(superposition,[status(thm),theory(equality)],[c_382,c_11]) ).
tff(c_548,plain,
! [B_26] : ( inverse(inverse(inverse(B_26))) = inverse(B_26) ),
inference(superposition,[status(thm),theory(equality)],[c_259,c_460]) ).
tff(c_590,plain,
! [A_4,C_6] : ( inverse(multiply(A_4,inverse(multiply(A_4,C_6)))) = inverse(inverse(C_6)) ),
inference(superposition,[status(thm),theory(equality)],[c_417,c_548]) ).
tff(c_601,plain,
! [C_6] : ( inverse(inverse(C_6)) = C_6 ),
inference(demodulation,[status(thm),theory(equality)],[c_417,c_590]) ).
tff(c_484,plain,
! [B_5,C_25,A_24] : ( multiply(multiply(B_5,C_25),inverse(B_5)) = inverse(multiply(A_24,inverse(multiply(A_24,C_25)))) ),
inference(superposition,[status(thm),theory(equality)],[c_460,c_144]) ).
tff(c_649,plain,
! [B_28,C_29] : ( multiply(multiply(B_28,C_29),inverse(B_28)) = C_29 ),
inference(demodulation,[status(thm),theory(equality)],[c_417,c_484]) ).
tff(c_822,plain,
! [C_32,B_33] : ( multiply(C_32,inverse(multiply(B_33,inverse(B_33)))) = C_32 ),
inference(superposition,[status(thm),theory(equality)],[c_649,c_2]) ).
tff(c_544,plain,
! [B_5,C_25] : ( multiply(multiply(B_5,C_25),inverse(B_5)) = C_25 ),
inference(demodulation,[status(thm),theory(equality)],[c_417,c_484]) ).
tff(c_993,plain,
! [B_34,C_35] : ( multiply(multiply(B_34,inverse(B_34)),C_35) = C_35 ),
inference(superposition,[status(thm),theory(equality)],[c_822,c_544]) ).
tff(c_1553,plain,
! [C_42,B_43] : ( multiply(C_42,inverse(multiply(B_43,C_42))) = inverse(B_43) ),
inference(superposition,[status(thm),theory(equality)],[c_993,c_2]) ).
tff(c_1623,plain,
! [B_5,B_43] : ( multiply(B_5,inverse(inverse(B_43))) = multiply(B_43,B_5) ),
inference(superposition,[status(thm),theory(equality)],[c_1553,c_11]) ).
tff(c_1707,plain,
! [B_5,B_43] : ( multiply(B_5,B_43) = multiply(B_43,B_5) ),
inference(demodulation,[status(thm),theory(equality)],[c_601,c_1623]) ).
tff(c_4,plain,
multiply(b,a) != multiply(a,b),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_1726,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1707,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GRP512-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.00/0.15 % 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 : n009.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 21:50:38 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.89/1.96 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.89/1.97
% 3.89/1.97 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.89/2.00
% 3.89/2.00 Inference rules
% 3.89/2.00 ----------------------
% 3.89/2.00 #Ref : 0
% 3.89/2.00 #Sup : 450
% 3.89/2.00 #Fact : 0
% 3.89/2.00 #Define : 0
% 3.89/2.00 #Split : 0
% 3.89/2.00 #Chain : 0
% 3.89/2.00 #Close : 0
% 3.89/2.00
% 3.89/2.00 Ordering : KBO
% 3.89/2.00
% 3.89/2.00 Simplification rules
% 3.89/2.00 ----------------------
% 3.89/2.00 #Subsume : 0
% 3.89/2.00 #Demod : 175
% 3.89/2.00 #Tautology : 130
% 3.89/2.00 #SimpNegUnit : 0
% 3.89/2.00 #BackRed : 4
% 3.89/2.00
% 3.89/2.00 #Partial instantiations: 0
% 3.89/2.00 #Strategies tried : 1
% 3.89/2.00
% 3.89/2.00 Timing (in seconds)
% 3.89/2.00 ----------------------
% 3.89/2.00 Preprocessing : 0.38
% 3.89/2.00 Parsing : 0.20
% 3.89/2.00 CNF conversion : 0.02
% 3.89/2.00 Main loop : 0.57
% 3.89/2.00 Inferencing : 0.23
% 3.89/2.00 Reduction : 0.17
% 3.89/2.00 Demodulation : 0.14
% 3.89/2.00 BG Simplification : 0.04
% 3.89/2.00 Subsumption : 0.09
% 3.89/2.00 Abstraction : 0.04
% 3.89/2.00 MUC search : 0.00
% 4.13/2.00 Cooper : 0.00
% 4.13/2.00 Total : 0.99
% 4.13/2.00 Index Insertion : 0.00
% 4.13/2.00 Index Deletion : 0.00
% 4.13/2.00 Index Matching : 0.00
% 4.13/2.00 BG Taut test : 0.00
%------------------------------------------------------------------------------