TSTP Solution File: GRP451-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP451-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:16 EDT 2023
% Result : Unsatisfiable 3.35s 1.90s
% Output : CNFRefutation 3.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 25 ( 20 unt; 5 typ; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 41 (; 41 !; 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_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(divide(A,A),divide(A,divide(B,divide(divide(divide(A,A),A),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_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_2,plain,
! [A_1,B_2,C_3] : ( divide(divide(divide(A_1,A_1),divide(A_1,divide(B_2,divide(divide(divide(A_1,A_1),A_1),C_3)))),C_3) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_107,plain,
! [A_17,B_18,C_19] : ( divide(inverse(divide(A_17,divide(B_18,divide(inverse(A_17),C_19)))),C_19) = B_18 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_6,c_2]) ).
tff(c_154,plain,
! [A_17,C_19,B_8] : ( divide(inverse(divide(A_17,inverse(divide(inverse(A_17),C_19)))),C_19) = divide(B_8,B_8) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_107]) ).
tff(c_531,plain,
! [A_37,C_38,B_39] : ( divide(inverse(multiply(A_37,divide(inverse(A_37),C_38))),C_38) = divide(B_39,B_39) ),
inference(demodulation,[status(thm),theory(equality)],[c_9,c_154]) ).
tff(c_165,plain,
! [A_17,C_19,B_8] : ( divide(inverse(multiply(A_17,divide(inverse(A_17),C_19))),C_19) = divide(B_8,B_8) ),
inference(demodulation,[status(thm),theory(equality)],[c_9,c_154]) ).
tff(c_682,plain,
! [B_41,B_40] : ( divide(B_41,B_41) = divide(B_40,B_40) ),
inference(superposition,[status(thm),theory(equality)],[c_531,c_165]) ).
tff(c_778,plain,
! [B_5,B_41] : ( multiply(inverse(B_5),B_5) = divide(B_41,B_41) ),
inference(superposition,[status(thm),theory(equality)],[c_682,c_9]) ).
tff(c_865,plain,
! [B_42,B_43] : ( multiply(inverse(B_42),B_42) = divide(B_43,B_43) ),
inference(superposition,[status(thm),theory(equality)],[c_682,c_9]) ).
tff(c_8,plain,
multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_1177,plain,
! [B_46] : ( multiply(inverse(a1),a1) != divide(B_46,B_46) ),
inference(superposition,[status(thm),theory(equality)],[c_865,c_8]) ).
tff(c_1183,plain,
! [B_46,B_41] : ( divide(B_46,B_46) != divide(B_41,B_41) ),
inference(superposition,[status(thm),theory(equality)],[c_778,c_1177]) ).
tff(c_542,plain,
! [B_8,B_39] : ( divide(B_8,B_8) = divide(B_39,B_39) ),
inference(superposition,[status(thm),theory(equality)],[c_531,c_165]) ).
tff(c_1215,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1183,c_542]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP451-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.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 22:34:39 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.35/1.90 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.35/1.90
% 3.35/1.90 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.35/1.93
% 3.35/1.93 Inference rules
% 3.35/1.93 ----------------------
% 3.35/1.93 #Ref : 0
% 3.35/1.93 #Sup : 328
% 3.35/1.93 #Fact : 0
% 3.35/1.93 #Define : 0
% 3.35/1.93 #Split : 0
% 3.35/1.93 #Chain : 0
% 3.35/1.93 #Close : 0
% 3.35/1.93
% 3.35/1.93 Ordering : KBO
% 3.35/1.93
% 3.35/1.93 Simplification rules
% 3.35/1.93 ----------------------
% 3.35/1.93 #Subsume : 35
% 3.35/1.93 #Demod : 90
% 3.35/1.93 #Tautology : 66
% 3.35/1.93 #SimpNegUnit : 1
% 3.35/1.93 #BackRed : 1
% 3.35/1.93
% 3.35/1.93 #Partial instantiations: 0
% 3.35/1.93 #Strategies tried : 1
% 3.35/1.93
% 3.35/1.93 Timing (in seconds)
% 3.35/1.93 ----------------------
% 3.35/1.93 Preprocessing : 0.41
% 3.35/1.93 Parsing : 0.22
% 3.35/1.93 CNF conversion : 0.02
% 3.35/1.93 Main loop : 0.47
% 3.35/1.93 Inferencing : 0.18
% 3.35/1.93 Reduction : 0.15
% 3.35/1.93 Demodulation : 0.11
% 3.35/1.93 BG Simplification : 0.03
% 3.35/1.93 Subsumption : 0.08
% 3.35/1.93 Abstraction : 0.03
% 3.35/1.93 MUC search : 0.00
% 3.35/1.93 Cooper : 0.00
% 3.35/1.93 Total : 0.93
% 3.35/1.93 Index Insertion : 0.00
% 3.35/1.93 Index Deletion : 0.00
% 3.35/1.93 Index Matching : 0.00
% 3.35/1.93 BG Taut test : 0.00
%------------------------------------------------------------------------------