TSTP Solution File: GRP530-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP530-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 : n016.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:27 EDT 2023
% Result : Unsatisfiable 4.06s 2.25s
% Output : CNFRefutation 4.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 36 unt; 5 typ; 0 def)
% Number of atoms : 36 ( 35 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 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 : 70 (; 70 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > b2 > a2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(divide,type,
divide: ( $i * $i ) > $i ).
tff(b2,type,
b2: $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(a2,type,
a2: $i ).
tff(f_27,axiom,
! [A,B] : ( inverse(A) = divide(divide(B,B),A) ),
file(unknown,unknown) ).
tff(f_23,axiom,
! [A,B,C] : ( divide(divide(A,divide(B,C)),divide(A,B)) = C ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [A,B,C] : ( multiply(A,B) = divide(A,divide(divide(C,C),B)) ),
file(unknown,unknown) ).
tff(f_29,axiom,
multiply(multiply(inverse(b2),b2),a2) != a2,
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_27]) ).
tff(c_106,plain,
! [A_17,B_18,C_19] : ( divide(divide(A_17,divide(B_18,C_19)),divide(A_17,B_18)) = C_19 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_173,plain,
! [B_20,C_21] : ( inverse(divide(divide(B_20,C_21),B_20)) = C_21 ),
inference(superposition,[status(thm),theory(equality)],[c_106,c_6]) ).
tff(c_202,plain,
! [A_7] : ( inverse(inverse(A_7)) = A_7 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_173]) ).
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_25]) ).
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_157,plain,
! [B_18,C_19,B_8] : ( divide(inverse(divide(B_18,C_19)),divide(divide(B_8,B_8),B_18)) = C_19 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_106]) ).
tff(c_253,plain,
! [B_25,C_26] : ( multiply(inverse(divide(B_25,C_26)),B_25) = C_26 ),
inference(demodulation,[status(thm),theory(equality)],[c_9,c_6,c_157]) ).
tff(c_274,plain,
! [A_7,B_8] : ( multiply(inverse(inverse(A_7)),divide(B_8,B_8)) = A_7 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_253]) ).
tff(c_278,plain,
! [A_7,B_8] : ( multiply(A_7,divide(B_8,B_8)) = A_7 ),
inference(demodulation,[status(thm),theory(equality)],[c_202,c_274]) ).
tff(c_207,plain,
! [A_22] : ( inverse(inverse(A_22)) = A_22 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_173]) ).
tff(c_216,plain,
! [A_4,A_22] : ( multiply(A_4,inverse(A_22)) = divide(A_4,A_22) ),
inference(superposition,[status(thm),theory(equality)],[c_207,c_9]) ).
tff(c_122,plain,
! [B_18,C_19] : ( inverse(divide(divide(B_18,C_19),B_18)) = C_19 ),
inference(superposition,[status(thm),theory(equality)],[c_106,c_6]) ).
tff(c_279,plain,
! [C_27,B_28] : ( multiply(C_27,divide(B_28,C_27)) = B_28 ),
inference(superposition,[status(thm),theory(equality)],[c_122,c_253]) ).
tff(c_27,plain,
! [A_11,B_12] : ( divide(A_11,inverse(B_12)) = multiply(A_11,B_12) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_4]) ).
tff(c_45,plain,
! [B_8,B_12] : ( multiply(divide(B_8,B_8),B_12) = inverse(inverse(B_12)) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_27]) ).
tff(c_206,plain,
! [B_8,B_12] : ( multiply(divide(B_8,B_8),B_12) = B_12 ),
inference(demodulation,[status(thm),theory(equality)],[c_202,c_45]) ).
tff(c_358,plain,
! [B_31,B_32] : ( divide(B_31,divide(B_32,B_32)) = B_31 ),
inference(superposition,[status(thm),theory(equality)],[c_279,c_206]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( divide(divide(A_1,divide(B_2,C_3)),divide(A_1,B_2)) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_395,plain,
! [B_31,B_32,C_3] : ( divide(divide(B_31,divide(divide(B_32,B_32),C_3)),B_31) = C_3 ),
inference(superposition,[status(thm),theory(equality)],[c_358,c_2]) ).
tff(c_453,plain,
! [B_31,C_3] : ( divide(multiply(B_31,C_3),B_31) = C_3 ),
inference(demodulation,[status(thm),theory(equality)],[c_9,c_6,c_395]) ).
tff(c_286,plain,
! [B_28,B_8] : ( divide(B_28,divide(B_8,B_8)) = B_28 ),
inference(superposition,[status(thm),theory(equality)],[c_279,c_206]) ).
tff(c_308,plain,
! [A_29,B_30] : ( multiply(A_29,divide(B_30,B_30)) = A_29 ),
inference(demodulation,[status(thm),theory(equality)],[c_202,c_274]) ).
tff(c_461,plain,
! [B_34,B_33] : ( divide(B_34,B_34) = divide(B_33,B_33) ),
inference(superposition,[status(thm),theory(equality)],[c_308,c_206]) ).
tff(c_520,plain,
! [A_1,B_33,B_34] : ( divide(divide(A_1,divide(B_33,B_33)),divide(A_1,B_34)) = B_34 ),
inference(superposition,[status(thm),theory(equality)],[c_461,c_2]) ).
tff(c_616,plain,
! [A_35,B_36] : ( divide(A_35,divide(A_35,B_36)) = B_36 ),
inference(demodulation,[status(thm),theory(equality)],[c_286,c_520]) ).
tff(c_262,plain,
! [C_19,B_18] : ( multiply(C_19,divide(B_18,C_19)) = B_18 ),
inference(superposition,[status(thm),theory(equality)],[c_122,c_253]) ).
tff(c_773,plain,
! [A_39,B_40] : ( multiply(divide(A_39,B_40),B_40) = A_39 ),
inference(superposition,[status(thm),theory(equality)],[c_616,c_262]) ).
tff(c_793,plain,
! [C_3,B_31] : ( multiply(C_3,B_31) = multiply(B_31,C_3) ),
inference(superposition,[status(thm),theory(equality)],[c_453,c_773]) ).
tff(c_8,plain,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_1054,plain,
multiply(a2,multiply(b2,inverse(b2))) != a2,
inference(demodulation,[status(thm),theory(equality)],[c_793,c_793,c_8]) ).
tff(c_3980,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_278,c_216,c_1054]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP530-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.14 % 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.13/0.36 % Computer : n016.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Thu Aug 3 22:45:38 EDT 2023
% 0.13/0.36 % CPUTime :
% 4.06/2.25 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.06/2.25
% 4.06/2.25 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.06/2.28
% 4.06/2.28 Inference rules
% 4.06/2.28 ----------------------
% 4.06/2.28 #Ref : 0
% 4.06/2.28 #Sup : 1012
% 4.06/2.28 #Fact : 0
% 4.06/2.28 #Define : 0
% 4.06/2.28 #Split : 0
% 4.06/2.28 #Chain : 0
% 4.06/2.28 #Close : 0
% 4.06/2.28
% 4.06/2.28 Ordering : KBO
% 4.06/2.28
% 4.06/2.28 Simplification rules
% 4.06/2.28 ----------------------
% 4.06/2.28 #Subsume : 117
% 4.06/2.28 #Demod : 777
% 4.06/2.28 #Tautology : 519
% 4.06/2.28 #SimpNegUnit : 0
% 4.06/2.28 #BackRed : 14
% 4.06/2.28
% 4.06/2.28 #Partial instantiations: 0
% 4.06/2.28 #Strategies tried : 1
% 4.06/2.28
% 4.06/2.28 Timing (in seconds)
% 4.06/2.28 ----------------------
% 4.06/2.29 Preprocessing : 0.39
% 4.06/2.29 Parsing : 0.20
% 4.06/2.29 CNF conversion : 0.02
% 4.06/2.29 Main loop : 0.77
% 4.06/2.29 Inferencing : 0.29
% 4.06/2.29 Reduction : 0.27
% 4.06/2.29 Demodulation : 0.22
% 4.06/2.29 BG Simplification : 0.03
% 4.06/2.29 Subsumption : 0.13
% 4.06/2.29 Abstraction : 0.04
% 4.06/2.29 MUC search : 0.00
% 4.06/2.29 Cooper : 0.00
% 4.06/2.29 Total : 1.21
% 4.06/2.29 Index Insertion : 0.00
% 4.06/2.29 Index Deletion : 0.00
% 4.06/2.29 Index Matching : 0.00
% 4.06/2.29 BG Taut test : 0.00
%------------------------------------------------------------------------------