TSTP Solution File: GRP520-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP520-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 : n005.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:26 EDT 2023
% Result : Unsatisfiable 3.27s 1.90s
% Output : CNFRefutation 3.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 23 unt; 4 typ; 0 def)
% Number of atoms : 23 ( 22 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 : 52 (; 52 !; 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_24,axiom,
! [A,B,C] : ( multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C ),
file(unknown,unknown) ).
tff(f_26,axiom,
multiply(a,b) != multiply(b,a),
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_24]) ).
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_24]) ).
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_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_4,plain,
multiply(b,a) != multiply(a,b),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_1013,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_879,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP520-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.00/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.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 22:23:26 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.27/1.90 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.27/1.90
% 3.27/1.90 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.63/1.93
% 3.63/1.93 Inference rules
% 3.63/1.93 ----------------------
% 3.63/1.93 #Ref : 0
% 3.63/1.93 #Sup : 259
% 3.63/1.93 #Fact : 0
% 3.63/1.93 #Define : 0
% 3.63/1.93 #Split : 0
% 3.63/1.93 #Chain : 0
% 3.63/1.93 #Close : 0
% 3.63/1.93
% 3.63/1.93 Ordering : KBO
% 3.63/1.93
% 3.63/1.93 Simplification rules
% 3.63/1.93 ----------------------
% 3.63/1.93 #Subsume : 0
% 3.63/1.93 #Demod : 98
% 3.63/1.93 #Tautology : 88
% 3.63/1.93 #SimpNegUnit : 0
% 3.63/1.93 #BackRed : 6
% 3.63/1.93
% 3.63/1.93 #Partial instantiations: 0
% 3.63/1.93 #Strategies tried : 1
% 3.63/1.93
% 3.63/1.93 Timing (in seconds)
% 3.63/1.93 ----------------------
% 3.63/1.93 Preprocessing : 0.39
% 3.63/1.93 Parsing : 0.20
% 3.63/1.93 CNF conversion : 0.02
% 3.63/1.93 Main loop : 0.47
% 3.63/1.93 Inferencing : 0.20
% 3.63/1.93 Reduction : 0.14
% 3.63/1.93 Demodulation : 0.11
% 3.63/1.93 BG Simplification : 0.03
% 3.63/1.93 Subsumption : 0.07
% 3.63/1.93 Abstraction : 0.03
% 3.63/1.93 MUC search : 0.00
% 3.63/1.93 Cooper : 0.00
% 3.63/1.93 Total : 0.91
% 3.63/1.93 Index Insertion : 0.00
% 3.63/1.93 Index Deletion : 0.00
% 3.63/1.93 Index Matching : 0.00
% 3.63/1.93 BG Taut test : 0.00
%------------------------------------------------------------------------------