TSTP Solution File: GRP553-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP553-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 : n027.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:30 EDT 2023
% Result : Unsatisfiable 5.89s 2.47s
% Output : CNFRefutation 5.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% 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 : 5 ( 3 avg)
% Maximal term depth : 6 ( 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 : 81 (; 81 !; 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_25,axiom,
! [A,B] : ( multiply(A,B) = divide(A,inverse(B)) ),
file(unknown,unknown) ).
tff(f_23,axiom,
! [A,B,C] : ( divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B ),
file(unknown,unknown) ).
tff(f_27,axiom,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
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_2,plain,
! [A_1,B_2,C_3] : ( divide(divide(A_1,inverse(divide(B_2,divide(A_1,C_3)))),C_3) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_17,plain,
! [A_8,B_9,C_10] : ( divide(multiply(A_8,divide(B_9,divide(A_8,C_10))),C_10) = B_9 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_2]) ).
tff(c_31,plain,
! [A_8,B_9,B_5] : ( multiply(multiply(A_8,divide(B_9,divide(A_8,inverse(B_5)))),B_5) = B_9 ),
inference(superposition,[status(thm),theory(equality)],[c_17,c_4]) ).
tff(c_50,plain,
! [A_8,B_9,B_5] : ( multiply(multiply(A_8,divide(B_9,multiply(A_8,B_5))),B_5) = B_9 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_31]) ).
tff(c_7,plain,
! [A_1,B_2,C_3] : ( divide(multiply(A_1,divide(B_2,divide(A_1,C_3))),C_3) = B_2 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_2]) ).
tff(c_102,plain,
! [A_17,B_18,C_19,B_20] : ( divide(multiply(multiply(A_17,divide(B_18,divide(A_17,C_19))),divide(B_20,B_18)),C_19) = B_20 ),
inference(superposition,[status(thm),theory(equality)],[c_17,c_7]) ).
tff(c_313,plain,
! [A_28,B_29,B_30,B_31] : ( divide(multiply(multiply(A_28,divide(B_29,multiply(A_28,B_30))),divide(B_31,B_29)),inverse(B_30)) = B_31 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_102]) ).
tff(c_388,plain,
! [B_32,B_33] : ( divide(B_32,inverse(divide(B_33,B_32))) = B_33 ),
inference(superposition,[status(thm),theory(equality)],[c_50,c_313]) ).
tff(c_369,plain,
! [B_9,B_31] : ( divide(B_9,inverse(divide(B_31,B_9))) = B_31 ),
inference(superposition,[status(thm),theory(equality)],[c_50,c_313]) ).
tff(c_643,plain,
! [B_42,B_43] : ( divide(inverse(divide(B_42,B_43)),inverse(B_42)) = B_43 ),
inference(superposition,[status(thm),theory(equality)],[c_388,c_369]) ).
tff(c_419,plain,
! [B_32,B_33] : ( multiply(B_32,divide(B_33,B_32)) = B_33 ),
inference(superposition,[status(thm),theory(equality)],[c_388,c_4]) ).
tff(c_773,plain,
! [B_46,B_47] : ( multiply(inverse(B_46),B_47) = inverse(divide(B_46,B_47)) ),
inference(superposition,[status(thm),theory(equality)],[c_643,c_419]) ).
tff(c_456,plain,
! [B_34,B_35] : ( multiply(B_34,divide(B_35,B_34)) = B_35 ),
inference(superposition,[status(thm),theory(equality)],[c_388,c_4]) ).
tff(c_495,plain,
! [B_5,A_4] : ( multiply(inverse(B_5),multiply(A_4,B_5)) = A_4 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_456]) ).
tff(c_869,plain,
! [B_48,A_49] : ( inverse(divide(B_48,multiply(A_49,B_48))) = A_49 ),
inference(superposition,[status(thm),theory(equality)],[c_773,c_495]) ).
tff(c_934,plain,
! [A_50,B_51] : ( divide(multiply(A_50,B_51),A_50) = B_51 ),
inference(superposition,[status(thm),theory(equality)],[c_869,c_369]) ).
tff(c_179,plain,
! [A_21,B_22,A_23,C_24] : ( multiply(A_21,divide(B_22,divide(A_21,divide(A_23,C_24)))) = divide(multiply(A_23,B_22),C_24) ),
inference(superposition,[status(thm),theory(equality)],[c_7,c_17]) ).
tff(c_194,plain,
! [A_23,B_22,C_24] : ( divide(divide(multiply(A_23,B_22),C_24),divide(A_23,C_24)) = B_22 ),
inference(superposition,[status(thm),theory(equality)],[c_179,c_7]) ).
tff(c_959,plain,
! [B_51,A_50] : ( divide(B_51,divide(A_50,A_50)) = B_51 ),
inference(superposition,[status(thm),theory(equality)],[c_934,c_194]) ).
tff(c_477,plain,
! [B_31,B_9] : ( multiply(inverse(divide(B_31,B_9)),B_31) = B_9 ),
inference(superposition,[status(thm),theory(equality)],[c_369,c_456]) ).
tff(c_2884,plain,
! [B_78,B_79] : ( inverse(divide(divide(B_78,B_79),B_78)) = B_79 ),
inference(superposition,[status(thm),theory(equality)],[c_477,c_773]) ).
tff(c_2941,plain,
! [B_51,A_50] : ( inverse(divide(B_51,B_51)) = divide(A_50,A_50) ),
inference(superposition,[status(thm),theory(equality)],[c_959,c_2884]) ).
tff(c_3360,plain,
! [B_86,A_87] : ( inverse(divide(B_86,B_86)) = divide(A_87,A_87) ),
inference(superposition,[status(thm),theory(equality)],[c_959,c_2884]) ).
tff(c_655,plain,
! [B_42,B_43] : ( multiply(inverse(B_42),B_43) = inverse(divide(B_42,B_43)) ),
inference(superposition,[status(thm),theory(equality)],[c_643,c_419]) ).
tff(c_6,plain,
multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_772,plain,
inverse(divide(b1,b1)) != inverse(divide(a1,a1)),
inference(demodulation,[status(thm),theory(equality)],[c_655,c_655,c_6]) ).
tff(c_4532,plain,
! [A_98] : ( inverse(divide(a1,a1)) != divide(A_98,A_98) ),
inference(superposition,[status(thm),theory(equality)],[c_3360,c_772]) ).
tff(c_4540,plain,
! [A_98,A_50] : ( divide(A_98,A_98) != divide(A_50,A_50) ),
inference(superposition,[status(thm),theory(equality)],[c_2941,c_4532]) ).
tff(c_44,plain,
! [A_4,B_9,B_5] : ( divide(multiply(A_4,divide(B_9,multiply(A_4,B_5))),inverse(B_5)) = B_9 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_17]) ).
tff(c_991,plain,
! [B_9,B_5] : ( divide(B_9,multiply(inverse(B_5),B_5)) = B_9 ),
inference(superposition,[status(thm),theory(equality)],[c_934,c_44]) ).
tff(c_1179,plain,
! [B_54,B_55] : ( multiply(B_54,divide(B_55,B_55)) = B_54 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_655,c_991]) ).
tff(c_893,plain,
! [A_49,B_48] : ( divide(multiply(A_49,B_48),A_49) = B_48 ),
inference(superposition,[status(thm),theory(equality)],[c_869,c_369]) ).
tff(c_1185,plain,
! [B_55,B_54] : ( divide(B_55,B_55) = divide(B_54,B_54) ),
inference(superposition,[status(thm),theory(equality)],[c_1179,c_893]) ).
tff(c_4562,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4540,c_1185]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP553-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/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.35 % Computer : n027.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 22:34:24 EDT 2023
% 0.13/0.35 % CPUTime :
% 5.89/2.47 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.89/2.48
% 5.89/2.48 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.89/2.51
% 5.89/2.51 Inference rules
% 5.89/2.51 ----------------------
% 5.89/2.51 #Ref : 0
% 5.89/2.51 #Sup : 1218
% 5.89/2.51 #Fact : 0
% 5.89/2.51 #Define : 0
% 5.89/2.51 #Split : 0
% 5.89/2.51 #Chain : 0
% 5.89/2.51 #Close : 0
% 5.89/2.51
% 5.89/2.51 Ordering : KBO
% 5.89/2.51
% 5.89/2.51 Simplification rules
% 5.89/2.51 ----------------------
% 5.89/2.51 #Subsume : 69
% 5.89/2.51 #Demod : 740
% 5.89/2.51 #Tautology : 403
% 5.89/2.51 #SimpNegUnit : 1
% 5.89/2.51 #BackRed : 2
% 5.89/2.51
% 5.89/2.51 #Partial instantiations: 0
% 5.89/2.51 #Strategies tried : 1
% 5.89/2.51
% 5.89/2.51 Timing (in seconds)
% 5.89/2.51 ----------------------
% 5.89/2.52 Preprocessing : 0.39
% 5.89/2.52 Parsing : 0.21
% 5.89/2.52 CNF conversion : 0.02
% 5.89/2.52 Main loop : 0.99
% 5.89/2.52 Inferencing : 0.35
% 5.89/2.52 Reduction : 0.39
% 5.89/2.52 Demodulation : 0.32
% 5.89/2.52 BG Simplification : 0.05
% 5.89/2.52 Subsumption : 0.14
% 5.89/2.52 Abstraction : 0.06
% 5.89/2.52 MUC search : 0.00
% 5.89/2.52 Cooper : 0.00
% 5.89/2.52 Total : 1.44
% 5.89/2.52 Index Insertion : 0.00
% 5.89/2.52 Index Deletion : 0.00
% 5.89/2.52 Index Matching : 0.00
% 5.89/2.52 BG Taut test : 0.00
%------------------------------------------------------------------------------