TSTP Solution File: GRP708-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP708-1 : TPTP v8.1.2. Released v4.0.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 : n008.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:59 EDT 2023
% Result : Unsatisfiable 14.83s 6.22s
% Output : CNFRefutation 14.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 44 ( 37 unt; 7 typ; 0 def)
% Number of atoms : 37 ( 36 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 : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 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 : 60 (; 60 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > unit > op_c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(ld,type,
ld: ( $i * $i ) > $i ).
tff(rd,type,
rd: ( $i * $i ) > $i ).
tff(a,type,
a: $i ).
tff(op_c,type,
op_c: $i ).
tff(b,type,
b: $i ).
tff(unit,type,
unit: $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(f_39,axiom,
! [A] : ( mult(op_c,A) = mult(A,op_c) ),
file(unknown,unknown) ).
tff(f_27,axiom,
! [A,B] : ( ld(A,mult(A,B)) = B ),
file(unknown,unknown) ).
tff(f_37,axiom,
! [A,B,C] : ( mult(A,mult(B,mult(A,C))) = mult(mult(A,mult(B,A)),C) ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [A] : ( mult(A,unit) = A ),
file(unknown,unknown) ).
tff(f_35,axiom,
! [A] : ( mult(unit,A) = A ),
file(unknown,unknown) ).
tff(f_41,axiom,
! [A,B] : ( mult(mult(op_c,op_c),mult(A,B)) = mult(mult(mult(op_c,op_c),A),B) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [A,B] : ( rd(mult(A,B),B) = A ),
file(unknown,unknown) ).
tff(f_43,axiom,
mult(a,mult(b,op_c)) != mult(mult(a,b),op_c),
file(unknown,unknown) ).
tff(c_16,plain,
! [A_14] : ( mult(op_c,A_14) = mult(A_14,op_c) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_4,plain,
! [A_3,B_4] : ( ld(A_3,mult(A_3,B_4)) = B_4 ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_456,plain,
! [A_39,B_40,C_41] : ( mult(mult(A_39,mult(B_40,A_39)),C_41) = mult(A_39,mult(B_40,mult(A_39,C_41))) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_504,plain,
! [A_14,C_41] : ( mult(mult(op_c,mult(op_c,A_14)),C_41) = mult(op_c,mult(A_14,mult(op_c,C_41))) ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_456]) ).
tff(c_10,plain,
! [A_9] : ( mult(A_9,unit) = A_9 ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_12,plain,
! [A_10] : ( mult(unit,A_10) = A_10 ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_531,plain,
! [A_10,C_41] : ( mult(A_10,mult(unit,mult(A_10,C_41))) = mult(mult(A_10,A_10),C_41) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_456]) ).
tff(c_545,plain,
! [A_10,C_41] : ( mult(mult(A_10,A_10),C_41) = mult(A_10,mult(A_10,C_41)) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_531]) ).
tff(c_18,plain,
! [A_15,B_16] : ( mult(mult(mult(op_c,op_c),A_15),B_16) = mult(mult(op_c,op_c),mult(A_15,B_16)) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_716,plain,
! [A_45,B_46] : ( mult(mult(mult(op_c,op_c),A_45),B_46) = mult(mult(op_c,op_c),mult(A_45,B_46)) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_14,plain,
! [A_11,B_12,C_13] : ( mult(mult(A_11,mult(B_12,A_11)),C_13) = mult(A_11,mult(B_12,mult(A_11,C_13))) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_726,plain,
! [B_46,A_45,C_13] : ( mult(mult(B_46,mult(mult(op_c,op_c),mult(A_45,B_46))),C_13) = mult(B_46,mult(mult(mult(op_c,op_c),A_45),mult(B_46,C_13))) ),
inference(superposition,[status(thm),theory(equality)],[c_716,c_14]) ).
tff(c_789,plain,
! [B_46,A_45,C_13] : ( mult(mult(B_46,mult(mult(op_c,op_c),mult(A_45,B_46))),C_13) = mult(B_46,mult(mult(op_c,op_c),mult(A_45,mult(B_46,C_13)))) ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_726]) ).
tff(c_20092,plain,
! [B_174,A_175,C_176] : ( mult(mult(B_174,mult(op_c,mult(op_c,mult(A_175,B_174)))),C_176) = mult(B_174,mult(op_c,mult(op_c,mult(A_175,mult(B_174,C_176))))) ),
inference(demodulation,[status(thm),theory(equality)],[c_545,c_545,c_789]) ).
tff(c_20854,plain,
! [A_175,C_176] : ( mult(unit,mult(op_c,mult(op_c,mult(A_175,mult(unit,C_176))))) = mult(mult(op_c,mult(op_c,mult(A_175,unit))),C_176) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_20092]) ).
tff(c_27212,plain,
! [A_201,C_202] : ( mult(op_c,mult(op_c,mult(A_201,C_202))) = mult(op_c,mult(A_201,mult(op_c,C_202))) ),
inference(demodulation,[status(thm),theory(equality)],[c_504,c_10,c_12,c_12,c_20854]) ).
tff(c_8,plain,
! [A_7,B_8] : ( rd(mult(A_7,B_8),B_8) = A_7 ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_745,plain,
! [A_45,B_46] : ( rd(mult(mult(op_c,op_c),mult(A_45,B_46)),B_46) = mult(mult(op_c,op_c),A_45) ),
inference(superposition,[status(thm),theory(equality)],[c_716,c_8]) ).
tff(c_1669,plain,
! [A_61,B_62] : ( rd(mult(op_c,mult(op_c,mult(A_61,B_62))),B_62) = mult(op_c,mult(op_c,A_61)) ),
inference(demodulation,[status(thm),theory(equality)],[c_545,c_545,c_745]) ).
tff(c_228,plain,
! [A_31] : ( mult(op_c,A_31) = mult(A_31,op_c) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_237,plain,
! [A_31] : ( rd(mult(op_c,A_31),op_c) = A_31 ),
inference(superposition,[status(thm),theory(equality)],[c_228,c_8]) ).
tff(c_1776,plain,
! [A_63] : ( mult(op_c,mult(op_c,A_63)) = mult(op_c,mult(A_63,op_c)) ),
inference(superposition,[status(thm),theory(equality)],[c_1669,c_237]) ).
tff(c_1848,plain,
! [A_63] : ( ld(op_c,mult(op_c,mult(op_c,A_63))) = mult(A_63,op_c) ),
inference(superposition,[status(thm),theory(equality)],[c_1776,c_4]) ).
tff(c_27589,plain,
! [A_201,C_202] : ( ld(op_c,mult(op_c,mult(A_201,mult(op_c,C_202)))) = mult(mult(A_201,C_202),op_c) ),
inference(superposition,[status(thm),theory(equality)],[c_27212,c_1848]) ).
tff(c_28011,plain,
! [A_201,C_202] : ( mult(op_c,mult(A_201,C_202)) = mult(A_201,mult(op_c,C_202)) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_4,c_27589]) ).
tff(c_20,plain,
mult(mult(a,b),op_c) != mult(a,mult(b,op_c)),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_21,plain,
mult(op_c,mult(a,b)) != mult(a,mult(b,op_c)),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_20]) ).
tff(c_28051,plain,
mult(a,mult(op_c,b)) != mult(a,mult(b,op_c)),
inference(demodulation,[status(thm),theory(equality)],[c_28011,c_21]) ).
tff(c_28054,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_28051]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP708-1 : TPTP v8.1.2. Released v4.0.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 : n008.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:03:03 EDT 2023
% 0.13/0.35 % CPUTime :
% 14.83/6.22 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.83/6.23
% 14.83/6.23 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 14.83/6.26
% 14.83/6.26 Inference rules
% 14.83/6.26 ----------------------
% 14.83/6.26 #Ref : 0
% 14.83/6.26 #Sup : 6783
% 14.83/6.26 #Fact : 0
% 14.83/6.26 #Define : 0
% 14.83/6.26 #Split : 0
% 14.83/6.26 #Chain : 0
% 14.83/6.26 #Close : 0
% 14.83/6.26
% 14.83/6.26 Ordering : KBO
% 14.83/6.26
% 14.83/6.26 Simplification rules
% 14.83/6.26 ----------------------
% 14.83/6.26 #Subsume : 567
% 14.83/6.26 #Demod : 7366
% 14.83/6.26 #Tautology : 2389
% 14.83/6.26 #SimpNegUnit : 0
% 14.83/6.26 #BackRed : 12
% 14.83/6.26
% 14.83/6.26 #Partial instantiations: 0
% 14.83/6.26 #Strategies tried : 1
% 14.83/6.26
% 14.83/6.26 Timing (in seconds)
% 14.83/6.26 ----------------------
% 14.83/6.26 Preprocessing : 0.42
% 14.83/6.26 Parsing : 0.23
% 14.83/6.26 CNF conversion : 0.02
% 14.83/6.26 Main loop : 4.79
% 14.83/6.26 Inferencing : 0.86
% 14.83/6.26 Reduction : 3.06
% 14.83/6.26 Demodulation : 2.84
% 14.83/6.26 BG Simplification : 0.13
% 14.83/6.26 Subsumption : 0.56
% 14.83/6.26 Abstraction : 0.21
% 14.83/6.26 MUC search : 0.00
% 14.83/6.26 Cooper : 0.00
% 14.83/6.26 Total : 5.25
% 14.83/6.26 Index Insertion : 0.00
% 14.83/6.26 Index Deletion : 0.00
% 14.83/6.27 Index Matching : 0.00
% 14.83/6.27 BG Taut test : 0.00
%------------------------------------------------------------------------------