TSTP Solution File: GRP539-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP539-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 : n018.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:28 EDT 2023
% Result : Unsatisfiable 18.94s 10.11s
% Output : CNFRefutation 18.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 55 ( 48 unt; 7 typ; 0 def)
% Number of atoms : 48 ( 47 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 93 (; 93 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > identity > c3 > b3 > a3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a3,type,
a3: $i ).
tff(c3,type,
c3: $i ).
tff(divide,type,
divide: ( $i * $i ) > $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b3,type,
b3: $i ).
tff(identity,type,
identity: $i ).
tff(f_29,axiom,
! [A] : ( identity = divide(A,A) ),
file(unknown,unknown) ).
tff(f_27,axiom,
! [A,B] : ( inverse(A) = divide(divide(B,B),A) ),
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_23,axiom,
! [A,B,C] : ( divide(divide(A,B),divide(divide(A,C),B)) = C ),
file(unknown,unknown) ).
tff(f_31,axiom,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file(unknown,unknown) ).
tff(c_8,plain,
! [A_9] : ( divide(A_9,A_9) = identity ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
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_11,plain,
! [A_7] : ( divide(identity,A_7) = inverse(A_7) ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_6]) ).
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_12,plain,
! [A_4,B_5] : ( divide(A_4,inverse(B_5)) = multiply(A_4,B_5) ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_8,c_4]) ).
tff(c_70,plain,
! [A_14,B_15,C_16] : ( divide(divide(A_14,B_15),divide(divide(A_14,C_16),B_15)) = C_16 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_120,plain,
! [A_14,C_16] : ( divide(divide(A_14,divide(A_14,C_16)),identity) = C_16 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_70]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( divide(divide(A_1,B_2),divide(divide(A_1,C_3),B_2)) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_229,plain,
! [A_23,C_24] : ( divide(divide(A_23,divide(A_23,C_24)),identity) = C_24 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_70]) ).
tff(c_278,plain,
! [C_25] : ( divide(C_25,identity) = C_25 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_229]) ).
tff(c_403,plain,
! [A_28,C_29] : ( divide(A_28,divide(A_28,C_29)) = C_29 ),
inference(superposition,[status(thm),theory(equality)],[c_120,c_278]) ).
tff(c_116,plain,
! [A_9,B_15] : ( divide(divide(A_9,B_15),divide(identity,B_15)) = A_9 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_70]) ).
tff(c_127,plain,
! [A_9,B_15] : ( multiply(divide(A_9,B_15),B_15) = A_9 ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_11,c_116]) ).
tff(c_412,plain,
! [C_29,A_28] : ( multiply(C_29,divide(A_28,C_29)) = A_28 ),
inference(superposition,[status(thm),theory(equality)],[c_403,c_127]) ).
tff(c_169,plain,
! [A_19,B_20] : ( multiply(divide(A_19,B_20),B_20) = A_19 ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_11,c_116]) ).
tff(c_187,plain,
! [A_9] : ( multiply(identity,A_9) = A_9 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_169]) ).
tff(c_42,plain,
! [A_12,B_13] : ( divide(A_12,inverse(B_13)) = multiply(A_12,B_13) ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_8,c_4]) ).
tff(c_49,plain,
! [B_13] : ( inverse(inverse(B_13)) = multiply(identity,B_13) ),
inference(superposition,[status(thm),theory(equality)],[c_42,c_11]) ).
tff(c_191,plain,
! [B_13] : ( inverse(inverse(B_13)) = B_13 ),
inference(demodulation,[status(thm),theory(equality)],[c_187,c_49]) ).
tff(c_110,plain,
! [B_15,A_7] : ( divide(divide(identity,B_15),divide(inverse(A_7),B_15)) = A_7 ),
inference(superposition,[status(thm),theory(equality)],[c_11,c_70]) ).
tff(c_520,plain,
! [B_31,A_32] : ( divide(inverse(B_31),divide(inverse(A_32),B_31)) = A_32 ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_110]) ).
tff(c_570,plain,
! [B_5,A_32] : ( divide(inverse(inverse(B_5)),multiply(inverse(A_32),B_5)) = A_32 ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_520]) ).
tff(c_768,plain,
! [B_39,A_40] : ( divide(B_39,multiply(inverse(A_40),B_39)) = A_40 ),
inference(demodulation,[status(thm),theory(equality)],[c_191,c_570]) ).
tff(c_808,plain,
! [A_28,A_40] : ( divide(divide(A_28,inverse(A_40)),A_28) = A_40 ),
inference(superposition,[status(thm),theory(equality)],[c_412,c_768]) ).
tff(c_840,plain,
! [A_41,A_42] : ( divide(multiply(A_41,A_42),A_41) = A_42 ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_808]) ).
tff(c_859,plain,
! [A_42,A_41] : ( multiply(A_42,A_41) = multiply(A_41,A_42) ),
inference(superposition,[status(thm),theory(equality)],[c_840,c_127]) ).
tff(c_181,plain,
! [A_4,B_5] : ( multiply(multiply(A_4,B_5),inverse(B_5)) = A_4 ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_169]) ).
tff(c_126,plain,
! [B_15,A_7] : ( divide(inverse(B_15),divide(inverse(A_7),B_15)) = A_7 ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_110]) ).
tff(c_594,plain,
! [A_33,C_34] : ( divide(identity,divide(divide(A_33,C_34),A_33)) = C_34 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_70]) ).
tff(c_624,plain,
! [A_7,B_15] : ( divide(identity,divide(A_7,inverse(B_15))) = divide(inverse(A_7),B_15) ),
inference(superposition,[status(thm),theory(equality)],[c_126,c_594]) ).
tff(c_664,plain,
! [A_7,B_15] : ( divide(inverse(A_7),B_15) = inverse(multiply(A_7,B_15)) ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_12,c_624]) ).
tff(c_4620,plain,
! [A_98,B_99,B_100,C_101] : ( divide(divide(divide(A_98,B_99),B_100),divide(C_101,B_100)) = divide(divide(A_98,C_101),B_99) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_70]) ).
tff(c_4953,plain,
! [A_7,B_100,C_101] : ( divide(divide(inverse(A_7),B_100),divide(C_101,B_100)) = divide(divide(identity,C_101),A_7) ),
inference(superposition,[status(thm),theory(equality)],[c_11,c_4620]) ).
tff(c_5018,plain,
! [A_7,B_100,C_101] : ( divide(divide(inverse(A_7),B_100),divide(C_101,B_100)) = divide(inverse(C_101),A_7) ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_4953]) ).
tff(c_25846,plain,
! [A_237,B_238,C_239] : ( inverse(multiply(multiply(A_237,B_238),divide(C_239,B_238))) = inverse(multiply(C_239,A_237)) ),
inference(demodulation,[status(thm),theory(equality)],[c_664,c_664,c_664,c_5018]) ).
tff(c_25990,plain,
! [A_237,B_238,C_239] : ( multiply(multiply(A_237,B_238),divide(C_239,B_238)) = inverse(inverse(multiply(C_239,A_237))) ),
inference(superposition,[status(thm),theory(equality)],[c_25846,c_191]) ).
tff(c_28908,plain,
! [A_252,B_253,C_254] : ( multiply(multiply(A_252,B_253),divide(C_254,B_253)) = multiply(C_254,A_252) ),
inference(demodulation,[status(thm),theory(equality)],[c_191,c_25990]) ).
tff(c_29344,plain,
! [A_4,C_254,B_5] : ( multiply(A_4,divide(C_254,inverse(B_5))) = multiply(C_254,multiply(A_4,B_5)) ),
inference(superposition,[status(thm),theory(equality)],[c_181,c_28908]) ).
tff(c_29458,plain,
! [C_254,A_4,B_5] : ( multiply(C_254,multiply(A_4,B_5)) = multiply(A_4,multiply(C_254,B_5)) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_29344]) ).
tff(c_10,plain,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_999,plain,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(demodulation,[status(thm),theory(equality)],[c_859,c_10]) ).
tff(c_70036,plain,
multiply(a3,multiply(c3,b3)) != multiply(a3,multiply(b3,c3)),
inference(demodulation,[status(thm),theory(equality)],[c_29458,c_999]) ).
tff(c_70039,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_859,c_70036]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GRP539-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/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.37 % Computer : n018.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 22:17:51 EDT 2023
% 0.22/0.37 % CPUTime :
% 18.94/10.11 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.94/10.11
% 18.94/10.11 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 18.94/10.15
% 18.94/10.15 Inference rules
% 18.94/10.15 ----------------------
% 18.94/10.15 #Ref : 0
% 18.94/10.15 #Sup : 17895
% 18.94/10.15 #Fact : 0
% 18.94/10.15 #Define : 0
% 18.94/10.15 #Split : 0
% 18.94/10.15 #Chain : 0
% 18.94/10.15 #Close : 0
% 18.94/10.15
% 18.94/10.15 Ordering : KBO
% 18.94/10.15
% 18.94/10.15 Simplification rules
% 18.94/10.15 ----------------------
% 18.94/10.15 #Subsume : 955
% 18.94/10.15 #Demod : 33697
% 18.94/10.15 #Tautology : 7353
% 18.94/10.15 #SimpNegUnit : 0
% 18.94/10.15 #BackRed : 64
% 18.94/10.15
% 18.94/10.15 #Partial instantiations: 0
% 18.94/10.15 #Strategies tried : 1
% 18.94/10.15
% 18.94/10.15 Timing (in seconds)
% 18.94/10.15 ----------------------
% 18.94/10.15 Preprocessing : 0.39
% 18.94/10.15 Parsing : 0.21
% 18.94/10.15 CNF conversion : 0.02
% 18.94/10.15 Main loop : 8.68
% 18.94/10.15 Inferencing : 1.39
% 18.94/10.15 Reduction : 5.65
% 18.94/10.15 Demodulation : 5.32
% 18.94/10.15 BG Simplification : 0.19
% 18.94/10.15 Subsumption : 0.95
% 18.94/10.15 Abstraction : 0.35
% 18.94/10.15 MUC search : 0.00
% 18.94/10.15 Cooper : 0.00
% 18.94/10.15 Total : 9.12
% 18.94/10.15 Index Insertion : 0.00
% 18.94/10.15 Index Deletion : 0.00
% 18.94/10.15 Index Matching : 0.00
% 18.94/10.15 BG Taut test : 0.00
%------------------------------------------------------------------------------