TSTP Solution File: GRP730-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP730-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/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 : 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:42:02 EDT 2023
% Result : Unsatisfiable 82.38s 60.40s
% Output : CNFRefutation 82.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 21
% Syntax : Number of formulae : 36 ( 23 unt; 13 typ; 0 def)
% Number of atoms : 23 ( 22 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 18 ( 8 >; 10 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 46 (; 46 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ op_r > op_l > asoc > rd > op_t > op_k > mult > #nlpp > i > unit > d > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(op_r,type,
op_r: ( $i * $i * $i ) > $i ).
tff(rd,type,
rd: ( $i * $i ) > $i ).
tff(a,type,
a: $i ).
tff(i,type,
i: $i > $i ).
tff(b,type,
b: $i ).
tff(op_t,type,
op_t: ( $i * $i ) > $i ).
tff(op_l,type,
op_l: ( $i * $i * $i ) > $i ).
tff(d,type,
d: $i ).
tff(unit,type,
unit: $i ).
tff(op_k,type,
op_k: ( $i * $i ) > $i ).
tff(asoc,type,
asoc: ( $i * $i * $i ) > $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(c,type,
c: $i ).
tff(f_44,axiom,
! [A,B] : ( mult(A,B) = mult(mult(B,A),op_k(A,B)) ),
file(unknown,unknown) ).
tff(f_34,axiom,
! [A,B] : ( mult(i(A),mult(A,B)) = B ),
file(unknown,unknown) ).
tff(f_32,axiom,
! [A,B] : ( i(mult(A,B)) = mult(i(A),i(B)) ),
file(unknown,unknown) ).
tff(f_24,axiom,
! [A] : ( mult(unit,A) = A ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [A] : ( mult(i(A),A) = unit ),
file(unknown,unknown) ).
tff(f_42,axiom,
! [A,B,C] : ( mult(mult(A,B),C) = mult(mult(A,mult(B,C)),asoc(A,B,C)) ),
file(unknown,unknown) ).
tff(f_64,axiom,
! [A,B,C,E,D] : ( asoc(asoc(A,B,C),D,E) = unit ),
file(unknown,unknown) ).
tff(f_68,axiom,
asoc(op_k(a,b),c,d) != unit,
file(unknown,unknown) ).
tff(c_1230,plain,
! [B_118,A_119] : ( mult(mult(B_118,A_119),op_k(A_119,B_118)) = mult(A_119,B_118) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_12,plain,
! [A_7,B_8] : ( mult(i(A_7),mult(A_7,B_8)) = B_8 ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_1251,plain,
! [B_118,A_119] : ( mult(i(mult(B_118,A_119)),mult(A_119,B_118)) = op_k(A_119,B_118) ),
inference(superposition,[status(thm),theory(equality)],[c_1230,c_12]) ).
tff(c_10,plain,
! [A_5,B_6] : ( mult(i(A_5),i(B_6)) = i(mult(A_5,B_6)) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_2,plain,
! [A_1] : ( mult(unit,A_1) = A_1 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_8,plain,
! [A_4] : ( mult(i(A_4),A_4) = unit ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_2867,plain,
! [A_179,B_180,C_181] : ( mult(mult(A_179,mult(B_180,C_181)),asoc(A_179,B_180,C_181)) = mult(mult(A_179,B_180),C_181) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_2998,plain,
! [B_180,C_181] : ( mult(mult(i(mult(B_180,C_181)),B_180),C_181) = mult(unit,asoc(i(mult(B_180,C_181)),B_180,C_181)) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_2867]) ).
tff(c_35684,plain,
! [B_483,C_484] : ( mult(mult(i(mult(B_483,C_484)),B_483),C_484) = asoc(i(mult(B_483,C_484)),B_483,C_484) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2998]) ).
tff(c_36111,plain,
! [A_7,B_8] : ( asoc(i(mult(i(A_7),mult(A_7,B_8))),i(A_7),mult(A_7,B_8)) = mult(mult(i(B_8),i(A_7)),mult(A_7,B_8)) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_35684]) ).
tff(c_212540,plain,
! [B_1217,A_1218] : ( asoc(i(B_1217),i(A_1218),mult(A_1218,B_1217)) = op_k(A_1218,B_1217) ),
inference(demodulation,[status(thm),theory(equality)],[c_1251,c_10,c_12,c_36111]) ).
tff(c_42,plain,
! [B_56,D_59,C_57,E_58,A_55] : ( asoc(asoc(A_55,B_56,C_57),D_59,E_58) = unit ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_212670,plain,
! [A_1218,B_1217,D_59,E_58] : ( asoc(op_k(A_1218,B_1217),D_59,E_58) = unit ),
inference(superposition,[status(thm),theory(equality)],[c_212540,c_42]) ).
tff(c_46,plain,
asoc(op_k(a,b),c,d) != unit,
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_214627,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_212670,c_46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GRP730-1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.15 % 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.15/0.36 % Computer : n001.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 22:39:41 EDT 2023
% 0.22/0.36 % CPUTime :
% 82.38/60.40 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 82.38/60.41
% 82.38/60.41 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 82.38/60.43
% 82.38/60.43 Inference rules
% 82.38/60.43 ----------------------
% 82.38/60.43 #Ref : 0
% 82.38/60.43 #Sup : 55936
% 82.38/60.43 #Fact : 0
% 82.38/60.43 #Define : 0
% 82.38/60.43 #Split : 0
% 82.38/60.43 #Chain : 0
% 82.38/60.43 #Close : 0
% 82.38/60.43
% 82.38/60.43 Ordering : KBO
% 82.38/60.43
% 82.38/60.43 Simplification rules
% 82.38/60.43 ----------------------
% 82.38/60.43 #Subsume : 476
% 82.38/60.43 #Demod : 85598
% 82.38/60.43 #Tautology : 18488
% 82.38/60.43 #SimpNegUnit : 0
% 82.38/60.43 #BackRed : 34
% 82.38/60.43
% 82.38/60.43 #Partial instantiations: 0
% 82.38/60.43 #Strategies tried : 1
% 82.38/60.43
% 82.38/60.43 Timing (in seconds)
% 82.38/60.43 ----------------------
% 82.38/60.44 Preprocessing : 0.51
% 82.38/60.44 Parsing : 0.26
% 82.38/60.44 CNF conversion : 0.03
% 82.38/60.44 Main loop : 58.84
% 82.38/60.44 Inferencing : 5.40
% 82.38/60.44 Reduction : 40.16
% 82.38/60.44 Demodulation : 37.79
% 82.38/60.44 BG Simplification : 0.94
% 82.38/60.44 Subsumption : 9.45
% 82.38/60.44 Abstraction : 2.05
% 82.38/60.44 MUC search : 0.00
% 82.38/60.44 Cooper : 0.00
% 82.38/60.44 Total : 59.39
% 82.38/60.44 Index Insertion : 0.00
% 82.38/60.44 Index Deletion : 0.00
% 82.38/60.44 Index Matching : 0.00
% 82.38/60.44 BG Taut test : 0.00
%------------------------------------------------------------------------------