TSTP Solution File: GRP529-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP529-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 : n004.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 6.35s 2.65s
% Output : CNFRefutation 6.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 38 unt; 5 typ; 0 def)
% Number of atoms : 38 ( 37 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 : 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 : 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_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(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_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_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_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_323,plain,
! [B_8,B_30] : ( divide(B_8,B_8) = divide(B_30,B_30) ),
inference(superposition,[status(thm),theory(equality)],[c_308,c_206]) ).
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_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_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(inverse(b1),b1) != multiply(inverse(a1),a1),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_920,plain,
multiply(b1,inverse(b1)) != multiply(a1,inverse(a1)),
inference(demodulation,[status(thm),theory(equality)],[c_793,c_793,c_8]) ).
tff(c_7079,plain,
divide(b1,b1) != divide(a1,a1),
inference(demodulation,[status(thm),theory(equality)],[c_216,c_216,c_920]) ).
tff(c_7081,plain,
! [B_8] : ( divide(a1,a1) != divide(B_8,B_8) ),
inference(superposition,[status(thm),theory(equality)],[c_323,c_7079]) ).
tff(c_7087,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_7081]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP529-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/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.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 21:56:41 EDT 2023
% 0.13/0.34 % CPUTime :
% 6.35/2.65 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.35/2.65
% 6.35/2.65 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.35/2.68
% 6.35/2.68 Inference rules
% 6.35/2.68 ----------------------
% 6.35/2.68 #Ref : 1
% 6.35/2.68 #Sup : 1823
% 6.35/2.68 #Fact : 0
% 6.35/2.68 #Define : 0
% 6.35/2.68 #Split : 0
% 6.35/2.68 #Chain : 0
% 6.35/2.68 #Close : 0
% 6.35/2.68
% 6.35/2.68 Ordering : KBO
% 6.35/2.68
% 6.35/2.68 Simplification rules
% 6.35/2.68 ----------------------
% 6.35/2.68 #Subsume : 357
% 6.35/2.68 #Demod : 2054
% 6.35/2.68 #Tautology : 910
% 6.35/2.68 #SimpNegUnit : 0
% 6.35/2.68 #BackRed : 11
% 6.35/2.68
% 6.35/2.68 #Partial instantiations: 0
% 6.35/2.68 #Strategies tried : 1
% 6.35/2.68
% 6.35/2.69 Timing (in seconds)
% 6.35/2.69 ----------------------
% 6.35/2.69 Preprocessing : 0.42
% 6.35/2.69 Parsing : 0.22
% 6.35/2.69 CNF conversion : 0.02
% 6.35/2.69 Main loop : 1.13
% 6.35/2.69 Inferencing : 0.38
% 6.35/2.69 Reduction : 0.43
% 6.35/2.69 Demodulation : 0.36
% 6.35/2.69 BG Simplification : 0.05
% 6.35/2.69 Subsumption : 0.20
% 6.35/2.69 Abstraction : 0.07
% 6.35/2.69 MUC search : 0.00
% 6.35/2.69 Cooper : 0.00
% 6.35/2.69 Total : 1.60
% 6.35/2.69 Index Insertion : 0.00
% 6.35/2.69 Index Deletion : 0.00
% 6.35/2.69 Index Matching : 0.00
% 6.35/2.69 BG Taut test : 0.00
%------------------------------------------------------------------------------