TSTP Solution File: GRP659-10 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP659-10 : TPTP v8.1.2. Released v8.1.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 : n006.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:50 EDT 2023
% Result : Unsatisfiable 16.22s 5.27s
% Output : CNFRefutation 16.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 12
% Syntax : Number of formulae : 52 ( 46 unt; 6 typ; 0 def)
% Number of atoms : 46 ( 45 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 10 ( 6 >; 4 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 0 con; 1-2 aty)
% Number of variables : 99 (; 99 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ tuple > rd > mult > ld > #nlpp > x1_2 > x1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(ld,type,
ld: ( $i * $i ) > $i ).
tff(rd,type,
rd: ( $i * $i ) > $i ).
tff(tuple,type,
tuple: ( $i * $i ) > $i ).
tff(x1,type,
x1: $i > $i ).
tff(x1_2,type,
x1_2: $i > $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(f_29,axiom,
! [A,B] : ( mult(rd(A,B),B) = A ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [A,B] : ( mult(A,ld(A,B)) = B ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [A,B,C] : ( mult(mult(A,mult(B,C)),B) = mult(mult(A,B),mult(C,B)) ),
file(unknown,unknown) ).
tff(f_27,axiom,
! [A,B] : ( ld(A,mult(A,B)) = B ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [A,B] : ( rd(mult(A,B),B) = A ),
file(unknown,unknown) ).
tff(f_36,axiom,
! [X0] : ( tuple(mult(X0,x1(X0)),mult(x1_2(X0),X0)) != tuple(x1(X0),x1_2(X0)) ),
file(unknown,unknown) ).
tff(c_6,plain,
! [A_5,B_6] : ( mult(rd(A_5,B_6),B_6) = A_5 ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_2,plain,
! [A_1,B_2] : ( mult(A_1,ld(A_1,B_2)) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_88,plain,
! [A_23,B_24,C_25] : ( mult(mult(A_23,mult(B_24,C_25)),B_24) = mult(mult(A_23,B_24),mult(C_25,B_24)) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_209,plain,
! [A_32,A_33,B_34] : ( mult(mult(A_32,A_33),mult(ld(A_33,B_34),A_33)) = mult(mult(A_32,B_34),A_33) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_88]) ).
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_2210,plain,
! [A_80,A_81,B_82] : ( ld(mult(A_80,A_81),mult(mult(A_80,B_82),A_81)) = mult(ld(A_81,B_82),A_81) ),
inference(superposition,[status(thm),theory(equality)],[c_209,c_4]) ).
tff(c_2324,plain,
! [A_81,A_1,B_2] : ( mult(ld(A_81,ld(A_1,B_2)),A_81) = ld(mult(A_1,A_81),mult(B_2,A_81)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_2210]) ).
tff(c_51,plain,
! [A_19,B_20] : ( mult(A_19,ld(A_19,B_20)) = B_20 ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
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_60,plain,
! [B_20,A_19] : ( rd(B_20,ld(A_19,B_20)) = A_19 ),
inference(superposition,[status(thm),theory(equality)],[c_51,c_8]) ).
tff(c_117,plain,
! [A_23,A_1,B_2] : ( mult(mult(A_23,A_1),mult(ld(A_1,B_2),A_1)) = mult(mult(A_23,B_2),A_1) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_88]) ).
tff(c_330,plain,
! [A_38,B_39,C_40] : ( ld(mult(A_38,mult(B_39,C_40)),mult(mult(A_38,B_39),mult(C_40,B_39))) = B_39 ),
inference(superposition,[status(thm),theory(equality)],[c_88,c_4]) ).
tff(c_351,plain,
! [A_23,B_2,A_1] : ( ld(mult(mult(A_23,B_2),A_1),mult(mult(mult(A_23,A_1),ld(A_1,B_2)),mult(A_1,ld(A_1,B_2)))) = ld(A_1,B_2) ),
inference(superposition,[status(thm),theory(equality)],[c_117,c_330]) ).
tff(c_5023,plain,
! [A_118,B_119,A_120] : ( ld(mult(mult(A_118,B_119),A_120),mult(mult(mult(A_118,A_120),ld(A_120,B_119)),B_119)) = ld(A_120,B_119) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_351]) ).
tff(c_234,plain,
! [A_32,A_33,B_34] : ( ld(mult(A_32,A_33),mult(mult(A_32,B_34),A_33)) = mult(ld(A_33,B_34),A_33) ),
inference(superposition,[status(thm),theory(equality)],[c_209,c_4]) ).
tff(c_5291,plain,
! [A_121] : ( mult(ld(A_121,ld(A_121,A_121)),A_121) = ld(A_121,A_121) ),
inference(superposition,[status(thm),theory(equality)],[c_5023,c_234]) ).
tff(c_5490,plain,
! [A_122] : ( ld(ld(A_122,ld(A_122,A_122)),ld(A_122,A_122)) = A_122 ),
inference(superposition,[status(thm),theory(equality)],[c_5291,c_4]) ).
tff(c_5505,plain,
! [A_122] : ( ld(mult(A_122,ld(A_122,ld(A_122,A_122))),mult(A_122,ld(A_122,ld(A_122,A_122)))) = mult(A_122,ld(A_122,ld(A_122,A_122))) ),
inference(superposition,[status(thm),theory(equality)],[c_5490,c_2324]) ).
tff(c_5615,plain,
! [A_124] : ( ld(ld(A_124,A_124),ld(A_124,A_124)) = ld(A_124,A_124) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_2,c_5505]) ).
tff(c_531,plain,
! [A_47,B_48,B_49] : ( mult(mult(rd(A_47,B_48),B_49),B_48) = mult(A_47,mult(ld(B_48,B_49),B_48)) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_209]) ).
tff(c_604,plain,
! [A_47,B_48,B_49] : ( ld(mult(rd(A_47,B_48),B_49),mult(A_47,mult(ld(B_48,B_49),B_48))) = B_48 ),
inference(superposition,[status(thm),theory(equality)],[c_531,c_4]) ).
tff(c_5654,plain,
! [A_47,A_124] : ( ld(mult(rd(A_47,ld(A_124,A_124)),ld(A_124,A_124)),mult(A_47,mult(ld(A_124,A_124),ld(A_124,A_124)))) = ld(A_124,A_124) ),
inference(superposition,[status(thm),theory(equality)],[c_5615,c_604]) ).
tff(c_5710,plain,
! [A_124] : ( mult(ld(A_124,A_124),ld(A_124,A_124)) = ld(A_124,A_124) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_6,c_5654]) ).
tff(c_272,plain,
! [A_35,B_36,C_37] : ( rd(mult(mult(A_35,B_36),mult(C_37,B_36)),B_36) = mult(A_35,mult(B_36,C_37)) ),
inference(superposition,[status(thm),theory(equality)],[c_88,c_8]) ).
tff(c_18422,plain,
! [A_232,A_233,B_234] : ( rd(mult(mult(A_232,ld(A_233,B_234)),B_234),ld(A_233,B_234)) = mult(A_232,mult(ld(A_233,B_234),A_233)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_272]) ).
tff(c_18850,plain,
! [B_235,A_236] : ( rd(mult(B_235,B_235),ld(A_236,B_235)) = mult(A_236,mult(ld(A_236,B_235),A_236)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_18422]) ).
tff(c_19213,plain,
! [A_124,A_236] : ( rd(ld(A_124,A_124),ld(A_236,ld(A_124,A_124))) = mult(A_236,mult(ld(A_236,ld(A_124,A_124)),A_236)) ),
inference(superposition,[status(thm),theory(equality)],[c_5710,c_18850]) ).
tff(c_19329,plain,
! [A_237,A_238] : ( mult(A_237,ld(mult(A_238,A_237),mult(A_238,A_237))) = A_237 ),
inference(demodulation,[status(thm),theory(equality)],[c_2324,c_60,c_19213]) ).
tff(c_19740,plain,
! [B_6,A_5] : ( mult(B_6,ld(A_5,mult(rd(A_5,B_6),B_6))) = B_6 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_19329]) ).
tff(c_19828,plain,
! [B_6,A_5] : ( mult(B_6,ld(A_5,A_5)) = B_6 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_19740]) ).
tff(c_39,plain,
! [A_17,B_18] : ( ld(A_17,mult(A_17,B_18)) = B_18 ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_48,plain,
! [A_5,B_6] : ( ld(rd(A_5,B_6),A_5) = B_6 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_39]) ).
tff(c_19835,plain,
! [B_239,A_240] : ( mult(B_239,ld(A_240,A_240)) = B_239 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_19740]) ).
tff(c_153,plain,
! [A_29,B_30,C_31] : ( mult(mult(rd(A_29,mult(B_30,C_31)),B_30),mult(C_31,B_30)) = mult(A_29,B_30) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_88]) ).
tff(c_171,plain,
! [A_29,B_30,C_31] : ( ld(mult(rd(A_29,mult(B_30,C_31)),B_30),mult(A_29,B_30)) = mult(C_31,B_30) ),
inference(superposition,[status(thm),theory(equality)],[c_153,c_4]) ).
tff(c_20168,plain,
! [B_239,A_240,C_31] : ( ld(mult(rd(B_239,mult(ld(A_240,A_240),C_31)),ld(A_240,A_240)),B_239) = mult(C_31,ld(A_240,A_240)) ),
inference(superposition,[status(thm),theory(equality)],[c_19835,c_171]) ).
tff(c_20998,plain,
! [A_245,C_246] : ( mult(ld(A_245,A_245),C_246) = C_246 ),
inference(demodulation,[status(thm),theory(equality)],[c_19828,c_48,c_19828,c_20168]) ).
tff(c_12,plain,
! [X0_12] : ( tuple(mult(X0_12,x1(X0_12)),mult(x1_2(X0_12),X0_12)) != tuple(x1(X0_12),x1_2(X0_12)) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_21350,plain,
! [A_245] : ( tuple(x1(ld(A_245,A_245)),mult(x1_2(ld(A_245,A_245)),ld(A_245,A_245))) != tuple(x1(ld(A_245,A_245)),x1_2(ld(A_245,A_245))) ),
inference(superposition,[status(thm),theory(equality)],[c_20998,c_12]) ).
tff(c_21485,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_19828,c_21350]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP659-10 : TPTP v8.1.2. Released v8.1.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.14/0.35 % Computer : n006.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:07:28 EDT 2023
% 0.14/0.35 % CPUTime :
% 16.22/5.27 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.22/5.28
% 16.22/5.28 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 16.22/5.31
% 16.22/5.31 Inference rules
% 16.22/5.31 ----------------------
% 16.22/5.31 #Ref : 0
% 16.22/5.31 #Sup : 5892
% 16.22/5.31 #Fact : 0
% 16.22/5.31 #Define : 0
% 16.22/5.31 #Split : 0
% 16.22/5.31 #Chain : 0
% 16.22/5.31 #Close : 0
% 16.22/5.31
% 16.22/5.31 Ordering : KBO
% 16.22/5.31
% 16.22/5.31 Simplification rules
% 16.22/5.31 ----------------------
% 16.22/5.31 #Subsume : 28
% 16.22/5.31 #Demod : 5482
% 16.22/5.31 #Tautology : 1394
% 16.22/5.31 #SimpNegUnit : 0
% 16.22/5.31 #BackRed : 16
% 16.22/5.31
% 16.22/5.31 #Partial instantiations: 0
% 16.22/5.31 #Strategies tried : 1
% 16.22/5.31
% 16.22/5.31 Timing (in seconds)
% 16.22/5.31 ----------------------
% 16.22/5.31 Preprocessing : 0.41
% 16.22/5.31 Parsing : 0.22
% 16.22/5.31 CNF conversion : 0.02
% 16.22/5.31 Main loop : 3.76
% 16.22/5.31 Inferencing : 1.17
% 16.22/5.31 Reduction : 1.72
% 16.22/5.31 Demodulation : 1.52
% 16.22/5.31 BG Simplification : 0.20
% 16.22/5.31 Subsumption : 0.48
% 16.22/5.31 Abstraction : 0.30
% 16.22/5.31 MUC search : 0.00
% 16.22/5.31 Cooper : 0.00
% 16.22/5.31 Total : 4.23
% 16.22/5.31 Index Insertion : 0.00
% 16.22/5.31 Index Deletion : 0.00
% 16.22/5.31 Index Matching : 0.00
% 16.22/5.31 BG Taut test : 0.00
%------------------------------------------------------------------------------