TSTP Solution File: GRP521-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP521-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 : n001.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 4.32s 2.17s
% Output : CNFRefutation 4.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 39 ( 34 unt; 5 typ; 0 def)
% Number of atoms : 34 ( 33 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 6 ( 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 : 71 (; 71 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > b1 > a1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a1,type,
a1: $i ).
tff(divide,type,
divide: ( $i * $i ) > $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b1,type,
b1: $i ).
tff(f_28,axiom,
! [A,B] : ( inverse(A) = divide(divide(B,B),A) ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [A,B,C] : ( multiply(A,B) = divide(A,divide(divide(C,C),B)) ),
file(unknown,unknown) ).
tff(f_24,axiom,
! [A,B,C] : ( divide(A,divide(B,divide(C,divide(A,B)))) = C ),
file(unknown,unknown) ).
tff(f_30,axiom,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file(unknown,unknown) ).
tff(c_6,plain,
! [B_8,A_7] : ( divide(divide(B_8,B_8),A_7) = inverse(A_7) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_4,plain,
! [A_4,C_6,B_5] : ( divide(A_4,divide(divide(C_6,C_6),B_5)) = multiply(A_4,B_5) ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_9,plain,
! [A_4,B_5] : ( divide(A_4,inverse(B_5)) = multiply(A_4,B_5) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).
tff(c_106,plain,
! [A_17,B_18,C_19] : ( divide(A_17,divide(B_18,divide(C_19,divide(A_17,B_18)))) = C_19 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_157,plain,
! [B_8,A_17,B_18] : ( divide(B_8,B_8) = divide(A_17,divide(B_18,inverse(divide(A_17,B_18)))) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_106]) ).
tff(c_267,plain,
! [B_24,A_25,B_26] : ( divide(B_24,B_24) = divide(A_25,multiply(B_26,divide(A_25,B_26))) ),
inference(demodulation,[status(thm),theory(equality)],[c_9,c_157]) ).
tff(c_175,plain,
! [B_8,A_17,B_18] : ( divide(B_8,B_8) = divide(A_17,multiply(B_18,divide(A_17,B_18))) ),
inference(demodulation,[status(thm),theory(equality)],[c_9,c_157]) ).
tff(c_272,plain,
! [B_8,B_24] : ( divide(B_8,B_8) = divide(B_24,B_24) ),
inference(superposition,[status(thm),theory(equality)],[c_267,c_175]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( divide(A_1,divide(B_2,divide(C_3,divide(A_1,B_2)))) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_710,plain,
! [B_33,C_34,A_35] : ( divide(B_33,divide(divide(C_34,divide(A_35,B_33)),C_34)) = A_35 ),
inference(superposition,[status(thm),theory(equality)],[c_106,c_2]) ).
tff(c_774,plain,
! [B_33,B_8,A_35] : ( divide(B_33,divide(divide(B_8,B_8),divide(A_35,B_33))) = A_35 ),
inference(superposition,[status(thm),theory(equality)],[c_272,c_710]) ).
tff(c_858,plain,
! [B_36,A_37] : ( multiply(B_36,divide(A_37,B_36)) = A_37 ),
inference(demodulation,[status(thm),theory(equality)],[c_9,c_6,c_774]) ).
tff(c_905,plain,
! [A_7,B_8] : ( multiply(A_7,inverse(A_7)) = divide(B_8,B_8) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_858]) ).
tff(c_123,plain,
! [B_18,C_19,B_8] : ( inverse(divide(B_18,divide(C_19,divide(divide(B_8,B_8),B_18)))) = C_19 ),
inference(superposition,[status(thm),theory(equality)],[c_106,c_6]) ).
tff(c_168,plain,
! [B_18,C_19] : ( inverse(divide(B_18,multiply(C_19,B_18))) = C_19 ),
inference(demodulation,[status(thm),theory(equality)],[c_9,c_6,c_123]) ).
tff(c_910,plain,
! [B_38,A_39] : ( divide(B_38,inverse(divide(A_39,B_38))) = A_39 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_710]) ).
tff(c_974,plain,
! [C_19,B_18] : ( divide(multiply(C_19,B_18),C_19) = B_18 ),
inference(superposition,[status(thm),theory(equality)],[c_168,c_910]) ).
tff(c_385,plain,
! [B_28,B_27] : ( divide(B_28,B_28) = divide(B_27,B_27) ),
inference(superposition,[status(thm),theory(equality)],[c_267,c_175]) ).
tff(c_455,plain,
! [B_8,B_28] : ( inverse(divide(B_8,B_8)) = divide(B_28,B_28) ),
inference(superposition,[status(thm),theory(equality)],[c_385,c_6]) ).
tff(c_1164,plain,
! [B_45,B_46] : ( divide(B_45,divide(B_46,B_46)) = B_45 ),
inference(superposition,[status(thm),theory(equality)],[c_455,c_910]) ).
tff(c_1390,plain,
! [B_49,B_50] : ( divide(B_49,divide(B_49,B_50)) = B_50 ),
inference(superposition,[status(thm),theory(equality)],[c_1164,c_2]) ).
tff(c_850,plain,
! [B_33,A_35] : ( multiply(B_33,divide(A_35,B_33)) = A_35 ),
inference(demodulation,[status(thm),theory(equality)],[c_9,c_6,c_774]) ).
tff(c_1526,plain,
! [B_51,B_52] : ( multiply(divide(B_51,B_52),B_52) = B_51 ),
inference(superposition,[status(thm),theory(equality)],[c_1390,c_850]) ).
tff(c_1563,plain,
! [C_19,B_18] : ( multiply(C_19,B_18) = multiply(B_18,C_19) ),
inference(superposition,[status(thm),theory(equality)],[c_974,c_1526]) ).
tff(c_512,plain,
! [B_29,B_30] : ( multiply(inverse(B_29),B_29) = divide(B_30,B_30) ),
inference(superposition,[status(thm),theory(equality)],[c_385,c_9]) ).
tff(c_8,plain,
multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_551,plain,
! [B_30] : ( multiply(inverse(a1),a1) != divide(B_30,B_30) ),
inference(superposition,[status(thm),theory(equality)],[c_512,c_8]) ).
tff(c_2623,plain,
! [B_70] : ( multiply(a1,inverse(a1)) != divide(B_70,B_70) ),
inference(demodulation,[status(thm),theory(equality)],[c_1563,c_551]) ).
tff(c_2631,plain,
! [B_8,B_70] : ( divide(B_8,B_8) != divide(B_70,B_70) ),
inference(superposition,[status(thm),theory(equality)],[c_905,c_2623]) ).
tff(c_2660,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2631,c_272]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GRP521-1 : TPTP v8.1.2. Released v2.6.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.36 % Computer : n001.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:30:10 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.32/2.17 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.32/2.17
% 4.32/2.17 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.32/2.21
% 4.32/2.21 Inference rules
% 4.32/2.21 ----------------------
% 4.32/2.21 #Ref : 0
% 4.32/2.21 #Sup : 711
% 4.32/2.21 #Fact : 0
% 4.32/2.21 #Define : 0
% 4.32/2.21 #Split : 0
% 4.32/2.21 #Chain : 0
% 4.32/2.21 #Close : 0
% 4.32/2.21
% 4.32/2.21 Ordering : KBO
% 4.32/2.21
% 4.32/2.21 Simplification rules
% 4.32/2.21 ----------------------
% 4.32/2.21 #Subsume : 87
% 4.32/2.21 #Demod : 292
% 4.32/2.21 #Tautology : 236
% 4.32/2.21 #SimpNegUnit : 1
% 4.32/2.21 #BackRed : 5
% 4.32/2.21
% 4.32/2.21 #Partial instantiations: 0
% 4.32/2.21 #Strategies tried : 1
% 4.32/2.21
% 4.32/2.21 Timing (in seconds)
% 4.32/2.21 ----------------------
% 4.32/2.21 Preprocessing : 0.43
% 4.32/2.21 Parsing : 0.22
% 4.32/2.21 CNF conversion : 0.02
% 4.32/2.21 Main loop : 0.67
% 4.32/2.21 Inferencing : 0.25
% 4.32/2.21 Reduction : 0.22
% 4.32/2.21 Demodulation : 0.16
% 4.32/2.21 BG Simplification : 0.04
% 4.32/2.21 Subsumption : 0.12
% 4.32/2.21 Abstraction : 0.04
% 4.32/2.21 MUC search : 0.00
% 4.32/2.21 Cooper : 0.00
% 4.32/2.21 Total : 1.15
% 4.32/2.21 Index Insertion : 0.00
% 4.32/2.21 Index Deletion : 0.00
% 4.32/2.21 Index Matching : 0.00
% 4.32/2.21 BG Taut test : 0.00
%------------------------------------------------------------------------------