TSTP Solution File: GRP558-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP558-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:31 EDT 2023
% Result : Unsatisfiable 3.68s 2.11s
% Output : CNFRefutation 3.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 28 unt; 5 typ; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 8 ( 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 : 61 (; 61 !; 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_25,axiom,
! [A,B] : ( multiply(A,B) = divide(A,inverse(B)) ),
file(unknown,unknown) ).
tff(f_23,axiom,
! [A,B,C] : ( divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B ),
file(unknown,unknown) ).
tff(f_27,axiom,
multiply(multiply(inverse(b2),b2),a2) != a2,
file(unknown,unknown) ).
tff(c_4,plain,
! [A_4,B_5] : ( divide(A_4,inverse(B_5)) = multiply(A_4,B_5) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_16,plain,
! [A_8,B_9,C_10] : ( divide(A_8,inverse(divide(divide(B_9,C_10),divide(A_8,C_10)))) = B_9 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_28,plain,
! [A_8,B_9,C_10] : ( multiply(A_8,divide(divide(B_9,C_10),divide(A_8,C_10))) = B_9 ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_4]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( divide(A_1,inverse(divide(divide(B_2,C_3),divide(A_1,C_3)))) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_22,plain,
! [A_8,B_2,B_9,C_10] : ( divide(A_8,inverse(divide(divide(B_2,inverse(divide(divide(B_9,C_10),divide(A_8,C_10)))),B_9))) = B_2 ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_2]) ).
tff(c_112,plain,
! [A_17,B_18,B_19,C_20] : ( multiply(A_17,divide(multiply(B_18,divide(divide(B_19,C_20),divide(A_17,C_20))),B_19)) = B_18 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_4,c_22]) ).
tff(c_127,plain,
! [A_8,B_9] : ( multiply(A_8,divide(B_9,B_9)) = A_8 ),
inference(superposition,[status(thm),theory(equality)],[c_28,c_112]) ).
tff(c_150,plain,
! [A_21,B_22] : ( multiply(A_21,divide(B_22,B_22)) = A_21 ),
inference(superposition,[status(thm),theory(equality)],[c_28,c_112]) ).
tff(c_49,plain,
! [A_8,B_2,B_9,C_10] : ( multiply(A_8,divide(multiply(B_2,divide(divide(B_9,C_10),divide(A_8,C_10))),B_9)) = B_2 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_4,c_22]) ).
tff(c_195,plain,
! [B_23,A_24] : ( multiply(B_23,divide(A_24,B_23)) = A_24 ),
inference(superposition,[status(thm),theory(equality)],[c_150,c_49]) ).
tff(c_315,plain,
! [B_31,A_32] : ( multiply(inverse(B_31),multiply(A_32,B_31)) = A_32 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_195]) ).
tff(c_353,plain,
! [B_9,A_8] : ( multiply(inverse(divide(B_9,B_9)),A_8) = A_8 ),
inference(superposition,[status(thm),theory(equality)],[c_127,c_315]) ).
tff(c_503,plain,
! [B_39,A_40] : ( multiply(inverse(divide(B_39,B_39)),A_40) = A_40 ),
inference(superposition,[status(thm),theory(equality)],[c_127,c_315]) ).
tff(c_40,plain,
! [A_8,A_4,B_5] : ( divide(A_8,inverse(divide(multiply(A_4,B_5),divide(A_8,inverse(B_5))))) = A_4 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_16]) ).
tff(c_54,plain,
! [A_8,A_4,B_5] : ( multiply(A_8,divide(multiply(A_4,B_5),multiply(A_8,B_5))) = A_4 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_4,c_40]) ).
tff(c_571,plain,
! [A_4,B_5,B_39] : ( divide(multiply(A_4,B_5),multiply(inverse(divide(B_39,B_39)),B_5)) = A_4 ),
inference(superposition,[status(thm),theory(equality)],[c_503,c_54]) ).
tff(c_639,plain,
! [A_41,B_42] : ( divide(multiply(A_41,B_42),B_42) = A_41 ),
inference(demodulation,[status(thm),theory(equality)],[c_353,c_571]) ).
tff(c_157,plain,
! [B_9,A_21] : ( multiply(B_9,divide(A_21,B_9)) = A_21 ),
inference(superposition,[status(thm),theory(equality)],[c_150,c_49]) ).
tff(c_654,plain,
! [B_42,A_41] : ( multiply(B_42,A_41) = multiply(A_41,B_42) ),
inference(superposition,[status(thm),theory(equality)],[c_639,c_157]) ).
tff(c_1729,plain,
! [A_59,B_60] : ( divide(A_59,inverse(divide(B_60,B_60))) = A_59 ),
inference(superposition,[status(thm),theory(equality)],[c_503,c_157]) ).
tff(c_1858,plain,
! [A_59,B_5] : ( divide(A_59,inverse(multiply(inverse(B_5),B_5))) = A_59 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_1729]) ).
tff(c_1888,plain,
! [A_59,B_5] : ( multiply(A_59,multiply(B_5,inverse(B_5))) = A_59 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_654,c_1858]) ).
tff(c_6,plain,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_725,plain,
multiply(a2,multiply(b2,inverse(b2))) != a2,
inference(demodulation,[status(thm),theory(equality)],[c_654,c_654,c_6]) ).
tff(c_3191,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1888,c_725]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP558-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/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.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 22:00:08 EDT 2023
% 0.12/0.34 % CPUTime :
% 3.68/2.11 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.68/2.12
% 3.68/2.12 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.68/2.15
% 3.68/2.15 Inference rules
% 3.68/2.15 ----------------------
% 3.68/2.15 #Ref : 0
% 3.68/2.15 #Sup : 828
% 3.68/2.15 #Fact : 0
% 3.68/2.15 #Define : 0
% 3.68/2.15 #Split : 0
% 3.68/2.15 #Chain : 0
% 3.68/2.15 #Close : 0
% 3.68/2.15
% 3.68/2.15 Ordering : KBO
% 3.68/2.15
% 3.68/2.15 Simplification rules
% 3.68/2.15 ----------------------
% 3.68/2.15 #Subsume : 41
% 3.68/2.15 #Demod : 401
% 3.68/2.15 #Tautology : 310
% 3.68/2.15 #SimpNegUnit : 0
% 3.68/2.15 #BackRed : 6
% 3.68/2.15
% 3.68/2.15 #Partial instantiations: 0
% 3.68/2.15 #Strategies tried : 1
% 3.68/2.15
% 3.68/2.15 Timing (in seconds)
% 3.68/2.15 ----------------------
% 3.68/2.15 Preprocessing : 0.37
% 3.68/2.15 Parsing : 0.20
% 3.68/2.15 CNF conversion : 0.02
% 3.68/2.15 Main loop : 0.73
% 3.68/2.15 Inferencing : 0.28
% 3.68/2.15 Reduction : 0.25
% 3.68/2.15 Demodulation : 0.20
% 3.68/2.15 BG Simplification : 0.04
% 3.68/2.15 Subsumption : 0.11
% 3.68/2.15 Abstraction : 0.05
% 3.68/2.15 MUC search : 0.00
% 3.68/2.15 Cooper : 0.00
% 3.68/2.15 Total : 1.15
% 3.68/2.15 Index Insertion : 0.00
% 3.68/2.15 Index Deletion : 0.00
% 3.68/2.15 Index Matching : 0.00
% 3.68/2.15 BG Taut test : 0.00
%------------------------------------------------------------------------------