TSTP Solution File: GRP589-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP589-1 : TPTP v8.1.2. Released v2.6.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 : n027.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:35 EDT 2023
% Result : Unsatisfiable 3.51s 2.05s
% Output : CNFRefutation 3.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 26 unt; 5 typ; 0 def)
% Number of atoms : 26 ( 25 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 57 (; 57 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > double_divide > #nlpp > inverse > b1 > a1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a1,type,
a1: $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(double_divide,type,
double_divide: ( $i * $i ) > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b1,type,
b1: $i ).
tff(f_25,axiom,
! [A,B] : ( multiply(A,B) = inverse(double_divide(B,A)) ),
file(unknown,unknown) ).
tff(f_23,axiom,
! [A,B,C] : ( double_divide(inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(C))))),B) = C ),
file(unknown,unknown) ).
tff(f_27,axiom,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file(unknown,unknown) ).
tff(c_4,plain,
! [B_5,A_4] : ( inverse(double_divide(B_5,A_4)) = multiply(A_4,B_5) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( double_divide(inverse(double_divide(double_divide(A_1,B_2),inverse(double_divide(A_1,inverse(C_3))))),B_2) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_17,plain,
! [C_8,A_9,B_10] : ( double_divide(multiply(multiply(inverse(C_8),A_9),double_divide(A_9,B_10)),B_10) = C_8 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_4,c_2]) ).
tff(c_26,plain,
! [B_10,C_8,A_9] : ( multiply(B_10,multiply(multiply(inverse(C_8),A_9),double_divide(A_9,B_10))) = inverse(C_8) ),
inference(superposition,[status(thm),theory(equality)],[c_17,c_4]) ).
tff(c_7,plain,
! [C_3,A_1,B_2] : ( double_divide(multiply(multiply(inverse(C_3),A_1),double_divide(A_1,B_2)),B_2) = C_3 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_4,c_2]) ).
tff(c_102,plain,
! [C_18,C_19,A_20,B_21] : ( double_divide(multiply(multiply(inverse(C_18),multiply(multiply(inverse(C_19),A_20),double_divide(A_20,B_21))),C_19),B_21) = C_18 ),
inference(superposition,[status(thm),theory(equality)],[c_17,c_7]) ).
tff(c_149,plain,
! [C_22,C_23] : ( double_divide(multiply(inverse(C_22),C_22),inverse(C_23)) = C_23 ),
inference(superposition,[status(thm),theory(equality)],[c_26,c_102]) ).
tff(c_167,plain,
! [C_23,C_22] : ( multiply(inverse(C_23),multiply(inverse(C_22),C_22)) = inverse(C_23) ),
inference(superposition,[status(thm),theory(equality)],[c_149,c_4]) ).
tff(c_179,plain,
! [C_24,C_25] : ( multiply(inverse(C_24),multiply(inverse(C_25),C_25)) = inverse(C_24) ),
inference(superposition,[status(thm),theory(equality)],[c_149,c_4]) ).
tff(c_137,plain,
! [C_8,C_18] : ( double_divide(multiply(inverse(C_8),C_8),inverse(C_18)) = C_18 ),
inference(superposition,[status(thm),theory(equality)],[c_26,c_102]) ).
tff(c_220,plain,
! [C_26,C_27] : ( double_divide(inverse(multiply(inverse(C_26),C_26)),inverse(C_27)) = C_27 ),
inference(superposition,[status(thm),theory(equality)],[c_179,c_137]) ).
tff(c_238,plain,
! [C_27,C_26] : ( multiply(inverse(C_27),inverse(multiply(inverse(C_26),C_26))) = inverse(C_27) ),
inference(superposition,[status(thm),theory(equality)],[c_220,c_4]) ).
tff(c_190,plain,
! [C_25,C_18] : ( double_divide(inverse(multiply(inverse(C_25),C_25)),inverse(C_18)) = C_18 ),
inference(superposition,[status(thm),theory(equality)],[c_179,c_137]) ).
tff(c_348,plain,
! [C_32,A_33,B_34] : ( double_divide(multiply(inverse(C_32),C_32),multiply(A_33,B_34)) = double_divide(B_34,A_33) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_149]) ).
tff(c_363,plain,
! [C_3,C_32,B_34,A_33] : ( double_divide(multiply(multiply(inverse(C_3),multiply(inverse(C_32),C_32)),double_divide(B_34,A_33)),multiply(A_33,B_34)) = C_3 ),
inference(superposition,[status(thm),theory(equality)],[c_348,c_7]) ).
tff(c_479,plain,
! [C_38,B_39,A_40] : ( double_divide(multiply(inverse(C_38),double_divide(B_39,A_40)),multiply(A_40,B_39)) = C_38 ),
inference(demodulation,[status(thm),theory(equality)],[c_167,c_363]) ).
tff(c_532,plain,
! [C_38,C_18,C_25] : ( double_divide(multiply(inverse(C_38),C_18),multiply(inverse(C_18),inverse(multiply(inverse(C_25),C_25)))) = C_38 ),
inference(superposition,[status(thm),theory(equality)],[c_190,c_479]) ).
tff(c_564,plain,
! [C_41,C_42] : ( double_divide(multiply(inverse(C_41),C_42),inverse(C_42)) = C_41 ),
inference(demodulation,[status(thm),theory(equality)],[c_238,c_532]) ).
tff(c_811,plain,
! [C_49,C_50] : ( double_divide(inverse(C_49),inverse(multiply(inverse(C_50),C_50))) = C_49 ),
inference(superposition,[status(thm),theory(equality)],[c_167,c_564]) ).
tff(c_874,plain,
! [C_52,C_51] : ( multiply(inverse(C_52),C_52) = multiply(inverse(C_51),C_51) ),
inference(superposition,[status(thm),theory(equality)],[c_811,c_190]) ).
tff(c_6,plain,
multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_1004,plain,
! [C_52] : ( multiply(inverse(a1),a1) != multiply(inverse(C_52),C_52) ),
inference(superposition,[status(thm),theory(equality)],[c_874,c_6]) ).
tff(c_1060,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_1004]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP589-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.13 % 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.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % 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:25:54 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.51/2.05 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.51/2.06
% 3.51/2.06 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.92/2.08
% 3.92/2.08 Inference rules
% 3.92/2.08 ----------------------
% 3.92/2.08 #Ref : 1
% 3.92/2.08 #Sup : 295
% 3.92/2.08 #Fact : 0
% 3.92/2.08 #Define : 0
% 3.92/2.08 #Split : 0
% 3.92/2.08 #Chain : 0
% 3.92/2.08 #Close : 0
% 3.92/2.08
% 3.92/2.08 Ordering : KBO
% 3.92/2.08
% 3.92/2.08 Simplification rules
% 3.92/2.08 ----------------------
% 3.92/2.08 #Subsume : 10
% 3.92/2.08 #Demod : 99
% 3.92/2.08 #Tautology : 98
% 3.92/2.08 #SimpNegUnit : 0
% 3.92/2.08 #BackRed : 0
% 3.92/2.08
% 3.92/2.08 #Partial instantiations: 0
% 3.92/2.08 #Strategies tried : 1
% 3.92/2.08
% 3.92/2.08 Timing (in seconds)
% 3.92/2.08 ----------------------
% 3.92/2.09 Preprocessing : 0.41
% 3.92/2.09 Parsing : 0.21
% 3.92/2.09 CNF conversion : 0.02
% 3.92/2.09 Main loop : 0.51
% 3.92/2.09 Inferencing : 0.21
% 3.92/2.09 Reduction : 0.15
% 3.92/2.09 Demodulation : 0.11
% 3.92/2.09 BG Simplification : 0.03
% 3.92/2.09 Subsumption : 0.08
% 3.92/2.09 Abstraction : 0.04
% 3.92/2.09 MUC search : 0.00
% 3.92/2.09 Cooper : 0.00
% 3.92/2.09 Total : 0.96
% 3.92/2.09 Index Insertion : 0.00
% 3.92/2.09 Index Deletion : 0.00
% 3.92/2.09 Index Matching : 0.00
% 3.92/2.09 BG Taut test : 0.00
%------------------------------------------------------------------------------