TSTP Solution File: GRP517-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP517-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/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 : n031.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 14.56s 6.28s
% Output : CNFRefutation 14.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 33 unt; 4 typ; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 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 : 69 (; 69 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > #nlpp > inverse > b1 > a1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a1,type,
a1: $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b1,type,
b1: $i ).
tff(f_23,axiom,
! [A,B,C] : ( multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C ),
file(unknown,unknown) ).
tff(f_25,axiom,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( multiply(A_1,multiply(multiply(inverse(multiply(A_1,B_2)),C_3),B_2)) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_5,plain,
! [A_4,B_5,C_6] : ( multiply(A_4,multiply(multiply(inverse(multiply(A_4,B_5)),C_6),B_5)) = C_6 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_28,plain,
! [A_7,C_8,C_9,B_10] : ( multiply(A_7,multiply(multiply(inverse(C_8),C_9),multiply(multiply(inverse(multiply(A_7,B_10)),C_8),B_10))) = C_9 ),
inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).
tff(c_78,plain,
! [C_3,C_9] : ( multiply(multiply(inverse(C_3),C_9),C_3) = C_9 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_28]) ).
tff(c_81,plain,
! [C_11,C_12] : ( multiply(multiply(inverse(C_11),C_12),C_11) = C_12 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_28]) ).
tff(c_104,plain,
! [C_13,C_14,C_15] : ( multiply(multiply(inverse(C_13),C_14),multiply(multiply(inverse(C_14),C_15),C_13)) = C_15 ),
inference(superposition,[status(thm),theory(equality)],[c_81,c_2]) ).
tff(c_129,plain,
! [C_3,C_9] : ( multiply(multiply(inverse(C_3),C_3),C_9) = C_9 ),
inference(superposition,[status(thm),theory(equality)],[c_78,c_104]) ).
tff(c_157,plain,
! [A_16,B_17,B_18,C_19] : ( multiply(multiply(inverse(multiply(inverse(multiply(A_16,B_17)),B_18)),C_19),B_18) = multiply(A_16,multiply(C_19,B_17)) ),
inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).
tff(c_311,plain,
! [A_22,B_23,C_24] : ( multiply(inverse(multiply(A_22,B_23)),multiply(A_22,multiply(C_24,B_23))) = C_24 ),
inference(superposition,[status(thm),theory(equality)],[c_157,c_2]) ).
tff(c_376,plain,
! [C_9,C_3,C_24] : ( multiply(inverse(C_9),multiply(multiply(inverse(C_3),C_3),multiply(C_24,C_9))) = C_24 ),
inference(superposition,[status(thm),theory(equality)],[c_129,c_311]) ).
tff(c_445,plain,
! [C_25,C_26] : ( multiply(inverse(C_25),multiply(C_26,C_25)) = C_26 ),
inference(demodulation,[status(thm),theory(equality)],[c_129,c_376]) ).
tff(c_548,plain,
! [C_27,C_28] : ( multiply(inverse(multiply(inverse(C_27),C_27)),C_28) = C_28 ),
inference(superposition,[status(thm),theory(equality)],[c_445,c_2]) ).
tff(c_440,plain,
! [C_9,C_24] : ( multiply(inverse(C_9),multiply(C_24,C_9)) = C_24 ),
inference(demodulation,[status(thm),theory(equality)],[c_129,c_376]) ).
tff(c_562,plain,
! [C_24,C_27] : ( multiply(C_24,multiply(inverse(C_27),C_27)) = C_24 ),
inference(superposition,[status(thm),theory(equality)],[c_548,c_440]) ).
tff(c_665,plain,
! [C_29,C_30] : ( multiply(C_29,multiply(inverse(C_30),C_30)) = C_29 ),
inference(superposition,[status(thm),theory(equality)],[c_548,c_440]) ).
tff(c_178,plain,
! [A_16,B_17,C_19] : ( multiply(inverse(multiply(A_16,B_17)),multiply(A_16,multiply(C_19,B_17))) = C_19 ),
inference(superposition,[status(thm),theory(equality)],[c_157,c_2]) ).
tff(c_690,plain,
! [C_29,C_19,C_30] : ( multiply(inverse(C_29),multiply(C_29,multiply(C_19,multiply(inverse(C_30),C_30)))) = C_19 ),
inference(superposition,[status(thm),theory(equality)],[c_665,c_178]) ).
tff(c_829,plain,
! [C_31,C_32] : ( multiply(inverse(C_31),multiply(C_31,C_32)) = C_32 ),
inference(demodulation,[status(thm),theory(equality)],[c_562,c_690]) ).
tff(c_839,plain,
! [C_32] : ( inverse(inverse(C_32)) = C_32 ),
inference(superposition,[status(thm),theory(equality)],[c_829,c_562]) ).
tff(c_508,plain,
! [C_24,C_9] : ( multiply(inverse(multiply(C_24,C_9)),C_24) = inverse(C_9) ),
inference(superposition,[status(thm),theory(equality)],[c_440,c_445]) ).
tff(c_4369,plain,
! [C_72,C_73] : ( multiply(inverse(multiply(C_72,C_73)),C_72) = inverse(C_73) ),
inference(superposition,[status(thm),theory(equality)],[c_440,c_445]) ).
tff(c_4484,plain,
! [C_9,C_24] : ( multiply(inverse(inverse(C_9)),inverse(multiply(C_24,C_9))) = inverse(C_24) ),
inference(superposition,[status(thm),theory(equality)],[c_508,c_4369]) ).
tff(c_4604,plain,
! [C_9,C_24] : ( multiply(C_9,inverse(multiply(C_24,C_9))) = inverse(C_24) ),
inference(demodulation,[status(thm),theory(equality)],[c_839,c_4484]) ).
tff(c_879,plain,
! [C_32,C_31] : ( multiply(C_32,C_31) = multiply(C_31,C_32) ),
inference(superposition,[status(thm),theory(equality)],[c_829,c_78]) ).
tff(c_765,plain,
! [C_30,A_1,B_2] : ( multiply(inverse(C_30),C_30) = multiply(A_1,multiply(inverse(multiply(A_1,B_2)),B_2)) ),
inference(superposition,[status(thm),theory(equality)],[c_665,c_2]) ).
tff(c_7865,plain,
! [C_97,A_98] : ( multiply(inverse(C_97),C_97) = multiply(A_98,inverse(A_98)) ),
inference(demodulation,[status(thm),theory(equality)],[c_4604,c_879,c_765]) ).
tff(c_9388,plain,
! [C_105,A_106] : ( multiply(C_105,inverse(C_105)) = multiply(A_106,inverse(A_106)) ),
inference(superposition,[status(thm),theory(equality)],[c_839,c_7865]) ).
tff(c_4,plain,
multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_1011,plain,
multiply(b1,inverse(b1)) != multiply(a1,inverse(a1)),
inference(demodulation,[status(thm),theory(equality)],[c_879,c_879,c_4]) ).
tff(c_9632,plain,
! [A_106] : ( multiply(a1,inverse(a1)) != multiply(A_106,inverse(A_106)) ),
inference(superposition,[status(thm),theory(equality)],[c_9388,c_1011]) ).
tff(c_22616,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_9632]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GRP517-1 : TPTP v8.1.2. Released v2.6.0.
% 0.15/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.15/0.37 % Computer : n031.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 22:34:59 EDT 2023
% 0.15/0.37 % CPUTime :
% 14.56/6.28 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.56/6.28
% 14.56/6.28 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 14.56/6.31
% 14.56/6.31 Inference rules
% 14.56/6.31 ----------------------
% 14.56/6.31 #Ref : 1
% 14.56/6.31 #Sup : 5537
% 14.56/6.31 #Fact : 0
% 14.56/6.31 #Define : 0
% 14.56/6.31 #Split : 0
% 14.56/6.31 #Chain : 0
% 14.56/6.31 #Close : 0
% 14.56/6.31
% 14.56/6.31 Ordering : KBO
% 14.56/6.31
% 14.56/6.31 Simplification rules
% 14.56/6.31 ----------------------
% 14.56/6.31 #Subsume : 186
% 14.56/6.31 #Demod : 6697
% 14.56/6.31 #Tautology : 1382
% 14.56/6.31 #SimpNegUnit : 0
% 14.56/6.31 #BackRed : 8
% 14.56/6.31
% 14.56/6.31 #Partial instantiations: 0
% 14.56/6.31 #Strategies tried : 1
% 14.56/6.31
% 14.56/6.31 Timing (in seconds)
% 14.56/6.31 ----------------------
% 14.56/6.32 Preprocessing : 0.40
% 14.56/6.32 Parsing : 0.20
% 14.56/6.32 CNF conversion : 0.02
% 14.56/6.32 Main loop : 4.76
% 14.56/6.32 Inferencing : 0.89
% 14.56/6.32 Reduction : 3.25
% 14.56/6.32 Demodulation : 3.08
% 14.56/6.32 BG Simplification : 0.15
% 14.56/6.32 Subsumption : 0.33
% 14.56/6.32 Abstraction : 0.23
% 14.56/6.32 MUC search : 0.00
% 14.56/6.32 Cooper : 0.00
% 14.56/6.32 Total : 5.21
% 14.56/6.32 Index Insertion : 0.00
% 14.56/6.32 Index Deletion : 0.00
% 14.56/6.32 Index Matching : 0.00
% 14.56/6.32 BG Taut test : 0.00
%------------------------------------------------------------------------------