TSTP Solution File: GRP525-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP525-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 : n009.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 7.20s 3.02s
% Output : CNFRefutation 7.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% 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 : 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 : 66 (; 66 !; 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(A,divide(divide(A,B),divide(C,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(A_17,divide(divide(A_17,B_18),divide(C_19,B_18))) = C_19 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_181,plain,
! [B_20,C_21] : ( divide(B_20,inverse(divide(C_21,B_20))) = C_21 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_106]) ).
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_241,plain,
! [B_22,C_23] : ( multiply(B_22,divide(C_23,B_22)) = C_23 ),
inference(superposition,[status(thm),theory(equality)],[c_181,c_9]) ).
tff(c_274,plain,
! [A_24,B_25] : ( multiply(A_24,inverse(A_24)) = divide(B_25,B_25) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_241]) ).
tff(c_270,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_241]) ).
tff(c_278,plain,
! [B_8,B_25] : ( divide(B_8,B_8) = divide(B_25,B_25) ),
inference(superposition,[status(thm),theory(equality)],[c_274,c_270]) ).
tff(c_170,plain,
! [B_8,B_18,C_19] : ( inverse(divide(divide(divide(B_8,B_8),B_18),divide(C_19,B_18))) = C_19 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_106]) ).
tff(c_1649,plain,
! [B_53,C_54] : ( inverse(divide(inverse(B_53),divide(C_54,B_53))) = C_54 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_170]) ).
tff(c_166,plain,
! [B_8,C_19] : ( divide(B_8,inverse(divide(C_19,B_8))) = C_19 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_106]) ).
tff(c_1771,plain,
! [C_55,B_56] : ( divide(divide(C_55,B_56),C_55) = inverse(B_56) ),
inference(superposition,[status(thm),theory(equality)],[c_1649,c_166]) ).
tff(c_200,plain,
! [B_20,C_21] : ( multiply(B_20,divide(C_21,B_20)) = C_21 ),
inference(superposition,[status(thm),theory(equality)],[c_181,c_9]) ).
tff(c_1804,plain,
! [C_55,B_56] : ( multiply(C_55,inverse(B_56)) = divide(C_55,B_56) ),
inference(superposition,[status(thm),theory(equality)],[c_1771,c_200]) ).
tff(c_10,plain,
! [B_9,A_10] : ( divide(divide(B_9,B_9),A_10) = inverse(A_10) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_21,plain,
! [B_8,A_10] : ( divide(inverse(divide(B_8,B_8)),A_10) = inverse(A_10) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_10]) ).
tff(c_337,plain,
! [B_27,B_26] : ( divide(B_27,B_27) = divide(B_26,B_26) ),
inference(superposition,[status(thm),theory(equality)],[c_274,c_270]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( divide(A_1,divide(divide(A_1,B_2),divide(C_3,B_2))) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_510,plain,
! [A_30,B_31] : ( divide(A_30,divide(B_31,B_31)) = A_30 ),
inference(superposition,[status(thm),theory(equality)],[c_337,c_2]) ).
tff(c_639,plain,
! [A_32,B_33] : ( divide(A_32,divide(A_32,B_33)) = B_33 ),
inference(superposition,[status(thm),theory(equality)],[c_510,c_2]) ).
tff(c_669,plain,
! [B_8,B_33] : ( inverse(divide(inverse(divide(B_8,B_8)),B_33)) = B_33 ),
inference(superposition,[status(thm),theory(equality)],[c_639,c_21]) ).
tff(c_723,plain,
! [B_33] : ( inverse(inverse(B_33)) = B_33 ),
inference(demodulation,[status(thm),theory(equality)],[c_21,c_669]) ).
tff(c_1882,plain,
! [A_4,B_5] : ( divide(multiply(A_4,B_5),A_4) = inverse(inverse(B_5)) ),
inference(superposition,[status(thm),theory(equality)],[c_9,c_1771]) ).
tff(c_1913,plain,
! [A_57,B_58] : ( divide(multiply(A_57,B_58),A_57) = B_58 ),
inference(demodulation,[status(thm),theory(equality)],[c_723,c_1882]) ).
tff(c_652,plain,
! [A_32,B_33] : ( multiply(divide(A_32,B_33),B_33) = A_32 ),
inference(superposition,[status(thm),theory(equality)],[c_639,c_200]) ).
tff(c_1932,plain,
! [B_58,A_57] : ( multiply(B_58,A_57) = multiply(A_57,B_58) ),
inference(superposition,[status(thm),theory(equality)],[c_1913,c_652]) ).
tff(c_8,plain,
multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_2027,plain,
multiply(b1,inverse(b1)) != multiply(a1,inverse(a1)),
inference(demodulation,[status(thm),theory(equality)],[c_1932,c_1932,c_8]) ).
tff(c_10551,plain,
divide(b1,b1) != divide(a1,a1),
inference(demodulation,[status(thm),theory(equality)],[c_1804,c_1804,c_2027]) ).
tff(c_10553,plain,
! [B_8] : ( divide(a1,a1) != divide(B_8,B_8) ),
inference(superposition,[status(thm),theory(equality)],[c_278,c_10551]) ).
tff(c_10559,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_10553]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP525-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.15/0.35 % Computer : n009.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 21:52:53 EDT 2023
% 0.15/0.35 % CPUTime :
% 7.20/3.02 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.20/3.03
% 7.20/3.03 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.67/3.06
% 7.67/3.06 Inference rules
% 7.67/3.06 ----------------------
% 7.67/3.06 #Ref : 1
% 7.67/3.06 #Sup : 2697
% 7.67/3.06 #Fact : 0
% 7.67/3.06 #Define : 0
% 7.67/3.06 #Split : 0
% 7.67/3.06 #Chain : 0
% 7.67/3.06 #Close : 0
% 7.67/3.06
% 7.67/3.06 Ordering : KBO
% 7.67/3.06
% 7.67/3.06 Simplification rules
% 7.67/3.06 ----------------------
% 7.67/3.06 #Subsume : 463
% 7.67/3.06 #Demod : 3415
% 7.67/3.06 #Tautology : 1440
% 7.67/3.06 #SimpNegUnit : 0
% 7.67/3.06 #BackRed : 16
% 7.67/3.06
% 7.67/3.06 #Partial instantiations: 0
% 7.67/3.06 #Strategies tried : 1
% 7.67/3.06
% 7.67/3.06 Timing (in seconds)
% 7.67/3.06 ----------------------
% 7.67/3.06 Preprocessing : 0.42
% 7.67/3.06 Parsing : 0.21
% 7.67/3.06 CNF conversion : 0.02
% 7.67/3.06 Main loop : 1.51
% 7.67/3.06 Inferencing : 0.50
% 7.67/3.06 Reduction : 0.66
% 7.67/3.06 Demodulation : 0.57
% 7.67/3.06 BG Simplification : 0.05
% 7.67/3.06 Subsumption : 0.20
% 7.67/3.06 Abstraction : 0.09
% 7.67/3.06 MUC search : 0.00
% 7.67/3.06 Cooper : 0.00
% 7.67/3.07 Total : 1.98
% 7.67/3.07 Index Insertion : 0.00
% 7.67/3.07 Index Deletion : 0.00
% 7.67/3.07 Index Matching : 0.00
% 7.67/3.07 BG Taut test : 0.00
%------------------------------------------------------------------------------