TSTP Solution File: GRP562-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP562-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 : n001.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.71s 2.03s
% Output : CNFRefutation 3.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 23 ( 18 unt; 5 typ; 0 def)
% Number of atoms : 18 ( 17 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 7 ( 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 : 42 (; 42 !; 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(divide(divide(A,inverse(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_2,plain,
! [A_1,B_2,C_3] : ( divide(divide(divide(A_1,inverse(B_2)),C_3),divide(A_1,C_3)) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_7,plain,
! [A_1,B_2,C_3] : ( divide(divide(multiply(A_1,B_2),C_3),divide(A_1,C_3)) = B_2 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_2]) ).
tff(c_17,plain,
! [A_8,B_9,C_10] : ( divide(divide(multiply(A_8,B_9),C_10),divide(A_8,C_10)) = B_9 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_2]) ).
tff(c_57,plain,
! [A_14,B_15,C_16,B_17] : ( divide(divide(multiply(divide(multiply(A_14,B_15),C_16),B_17),divide(A_14,C_16)),B_15) = B_17 ),
inference(superposition,[status(thm),theory(equality)],[c_7,c_17]) ).
tff(c_148,plain,
! [A_25,B_26,C_27,B_28] : ( multiply(divide(multiply(divide(multiply(A_25,inverse(B_26)),C_27),B_28),divide(A_25,C_27)),B_26) = B_28 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_57]) ).
tff(c_26,plain,
! [A_1,B_2,C_3,B_9] : ( divide(divide(multiply(divide(multiply(A_1,B_2),C_3),B_9),divide(A_1,C_3)),B_2) = B_9 ),
inference(superposition,[status(thm),theory(equality)],[c_7,c_17]) ).
tff(c_180,plain,
! [B_28,A_25,B_26,C_27] : ( divide(divide(B_28,divide(divide(multiply(A_25,inverse(B_26)),C_27),divide(A_25,C_27))),B_28) = B_26 ),
inference(superposition,[status(thm),theory(equality)],[c_148,c_26]) ).
tff(c_238,plain,
! [B_29,B_30] : ( divide(multiply(B_29,B_30),B_29) = B_30 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_7,c_180]) ).
tff(c_287,plain,
! [B_31,B_32] : ( divide(B_31,divide(B_32,B_32)) = B_31 ),
inference(superposition,[status(thm),theory(equality)],[c_238,c_7]) ).
tff(c_233,plain,
! [B_28,B_26] : ( divide(multiply(B_28,B_26),B_28) = B_26 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_7,c_180]) ).
tff(c_396,plain,
! [B_33,B_34] : ( multiply(divide(B_33,B_33),B_34) = B_34 ),
inference(superposition,[status(thm),theory(equality)],[c_287,c_233]) ).
tff(c_452,plain,
! [B_5,B_34] : ( multiply(multiply(inverse(B_5),B_5),B_34) = B_34 ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_396]) ).
tff(c_6,plain,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_1209,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_452,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GRP562-1 : TPTP v8.1.2. Released v2.6.0.
% 0.15/0.15 % 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.15/0.37 % Computer : n001.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:31:10 EDT 2023
% 0.15/0.37 % CPUTime :
% 3.71/2.03 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.71/2.03
% 3.71/2.03 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.85/2.06
% 3.85/2.06 Inference rules
% 3.85/2.06 ----------------------
% 3.85/2.06 #Ref : 0
% 3.85/2.06 #Sup : 306
% 3.85/2.06 #Fact : 0
% 3.85/2.06 #Define : 0
% 3.85/2.06 #Split : 0
% 3.85/2.06 #Chain : 0
% 3.85/2.06 #Close : 0
% 3.85/2.06
% 3.85/2.06 Ordering : KBO
% 3.85/2.06
% 3.85/2.06 Simplification rules
% 3.85/2.06 ----------------------
% 3.85/2.06 #Subsume : 22
% 3.85/2.06 #Demod : 126
% 3.85/2.06 #Tautology : 104
% 3.85/2.06 #SimpNegUnit : 0
% 3.85/2.06 #BackRed : 1
% 3.85/2.06
% 3.85/2.06 #Partial instantiations: 0
% 3.85/2.06 #Strategies tried : 1
% 3.85/2.06
% 3.85/2.06 Timing (in seconds)
% 3.85/2.06 ----------------------
% 3.85/2.07 Preprocessing : 0.40
% 3.85/2.07 Parsing : 0.21
% 3.85/2.07 CNF conversion : 0.02
% 3.85/2.07 Main loop : 0.50
% 3.85/2.07 Inferencing : 0.20
% 3.85/2.07 Reduction : 0.15
% 3.85/2.07 Demodulation : 0.12
% 3.85/2.07 BG Simplification : 0.03
% 3.85/2.07 Subsumption : 0.08
% 3.85/2.07 Abstraction : 0.03
% 3.85/2.07 MUC search : 0.00
% 3.85/2.07 Cooper : 0.00
% 3.85/2.07 Total : 0.94
% 3.85/2.07 Index Insertion : 0.00
% 3.85/2.07 Index Deletion : 0.00
% 3.85/2.07 Index Matching : 0.00
% 3.85/2.07 BG Taut test : 0.00
%------------------------------------------------------------------------------