TSTP Solution File: GRP687-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP687-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:56 EDT 2023
% Result : Unsatisfiable 40.62s 28.53s
% Output : CNFRefutation 40.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 52 ( 45 unt; 7 typ; 0 def)
% Number of atoms : 45 ( 44 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 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 : 97 (; 97 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > unit > 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(b,type,
b: $i ).
tff(unit,type,
unit: $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(c,type,
c: $i ).
tff(f_25,axiom,
! [A,B] : ( mult(A,ld(A,B)) = B ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [A] : ( mult(A,unit) = A ),
file(unknown,unknown) ).
tff(f_37,axiom,
! [A,B,C] : ( mult(mult(A,A),mult(B,C)) = mult(mult(A,mult(A,B)),C) ),
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_29,axiom,
! [A,B] : ( mult(rd(A,B),B) = A ),
file(unknown,unknown) ).
tff(f_39,axiom,
mult(a,mult(b,mult(b,c))) != mult(mult(a,mult(b,b)),c),
file(unknown,unknown) ).
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_10,plain,
! [A_9] : ( mult(A_9,unit) = A_9 ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_281,plain,
! [A_32,B_33,C_34] : ( mult(mult(A_32,mult(A_32,B_33)),C_34) = mult(mult(A_32,A_32),mult(B_33,C_34)) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_305,plain,
! [A_32,B_33] : ( mult(mult(A_32,A_32),mult(B_33,unit)) = mult(A_32,mult(A_32,B_33)) ),
inference(superposition,[status(thm),theory(equality)],[c_281,c_10]) ).
tff(c_343,plain,
! [A_32,B_33] : ( mult(mult(A_32,A_32),B_33) = mult(A_32,mult(A_32,B_33)) ),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_305]) ).
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_301,plain,
! [A_32,B_33,C_34] : ( ld(mult(A_32,mult(A_32,B_33)),mult(mult(A_32,A_32),mult(B_33,C_34))) = C_34 ),
inference(superposition,[status(thm),theory(equality)],[c_281,c_4]) ).
tff(c_1848,plain,
! [A_71,B_72,C_73] : ( ld(mult(A_71,mult(A_71,B_72)),mult(A_71,mult(A_71,mult(B_72,C_73)))) = C_73 ),
inference(demodulation,[status(thm),theory(equality)],[c_343,c_301]) ).
tff(c_1936,plain,
! [A_71,A_1,B_2] : ( ld(mult(A_71,mult(A_71,A_1)),mult(A_71,mult(A_71,B_2))) = ld(A_1,B_2) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1848]) ).
tff(c_14,plain,
! [A_11,B_12,C_13] : ( mult(mult(A_11,mult(A_11,B_12)),C_13) = mult(mult(A_11,A_11),mult(B_12,C_13)) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_351,plain,
! [A_11,B_12,C_13] : ( mult(mult(A_11,mult(A_11,B_12)),C_13) = mult(A_11,mult(A_11,mult(B_12,C_13))) ),
inference(demodulation,[status(thm),theory(equality)],[c_343,c_14]) ).
tff(c_352,plain,
! [A_35,B_36] : ( mult(mult(A_35,A_35),B_36) = mult(A_35,mult(A_35,B_36)) ),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_305]) ).
tff(c_476,plain,
! [A_39,B_40] : ( ld(mult(A_39,A_39),mult(A_39,mult(A_39,B_40))) = B_40 ),
inference(superposition,[status(thm),theory(equality)],[c_352,c_4]) ).
tff(c_511,plain,
! [A_1,B_2] : ( ld(mult(A_1,A_1),mult(A_1,B_2)) = ld(A_1,B_2) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_476]) ).
tff(c_1847,plain,
! [A_32,B_33,C_34] : ( ld(mult(A_32,mult(A_32,B_33)),mult(A_32,mult(A_32,mult(B_33,C_34)))) = C_34 ),
inference(demodulation,[status(thm),theory(equality)],[c_343,c_301]) ).
tff(c_609,plain,
! [A_43,B_44] : ( ld(mult(A_43,A_43),mult(A_43,B_44)) = ld(A_43,B_44) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_476]) ).
tff(c_683,plain,
! [A_45] : ( ld(mult(A_45,A_45),A_45) = ld(A_45,unit) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_609]) ).
tff(c_695,plain,
! [A_45] : ( mult(mult(A_45,A_45),ld(A_45,unit)) = A_45 ),
inference(superposition,[status(thm),theory(equality)],[c_683,c_2]) ).
tff(c_1909,plain,
! [A_45,C_73] : ( ld(mult(mult(A_45,A_45),A_45),mult(mult(A_45,A_45),mult(mult(A_45,A_45),mult(ld(A_45,unit),C_73)))) = C_73 ),
inference(superposition,[status(thm),theory(equality)],[c_695,c_1848]) ).
tff(c_1992,plain,
! [A_74,C_75] : ( mult(A_74,mult(ld(A_74,unit),C_75)) = C_75 ),
inference(demodulation,[status(thm),theory(equality)],[c_1847,c_343,c_343,c_343,c_1909]) ).
tff(c_369,plain,
! [A_35,B_36] : ( ld(mult(A_35,A_35),mult(A_35,mult(A_35,B_36))) = B_36 ),
inference(superposition,[status(thm),theory(equality)],[c_352,c_4]) ).
tff(c_2033,plain,
! [A_74,C_75] : ( ld(mult(A_74,A_74),mult(A_74,C_75)) = mult(ld(A_74,unit),C_75) ),
inference(superposition,[status(thm),theory(equality)],[c_1992,c_369]) ).
tff(c_2100,plain,
! [A_74,C_75] : ( mult(ld(A_74,unit),C_75) = ld(A_74,C_75) ),
inference(demodulation,[status(thm),theory(equality)],[c_511,c_2033]) ).
tff(c_12452,plain,
! [A_181,A_182,B_183] : ( ld(mult(A_181,mult(A_181,A_182)),mult(A_181,mult(A_181,B_183))) = ld(A_182,B_183) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1848]) ).
tff(c_12756,plain,
! [A_9,A_182] : ( ld(mult(A_9,mult(A_9,A_182)),mult(A_9,A_9)) = ld(A_182,unit) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_12452]) ).
tff(c_165,plain,
! [A_25,B_26] : ( rd(mult(A_25,B_26),B_26) = A_25 ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_181,plain,
! [B_2,A_1] : ( rd(B_2,ld(A_1,B_2)) = A_1 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_165]) ).
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_4008,plain,
! [A_104,B_105,C_106] : ( mult(mult(rd(A_104,B_105),rd(A_104,B_105)),mult(B_105,C_106)) = mult(mult(rd(A_104,B_105),A_104),C_106) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_281]) ).
tff(c_4163,plain,
! [B_2,A_1,C_106] : ( mult(mult(rd(B_2,ld(A_1,B_2)),A_1),mult(ld(A_1,B_2),C_106)) = mult(mult(rd(B_2,ld(A_1,B_2)),B_2),C_106) ),
inference(superposition,[status(thm),theory(equality)],[c_181,c_4008]) ).
tff(c_6331,plain,
! [A_128,B_129,C_130] : ( mult(A_128,mult(A_128,mult(ld(A_128,B_129),C_130))) = mult(mult(A_128,B_129),C_130) ),
inference(demodulation,[status(thm),theory(equality)],[c_343,c_181,c_181,c_4163]) ).
tff(c_6424,plain,
! [A_128,B_129,C_130] : ( ld(mult(A_128,A_128),mult(A_128,mult(mult(A_128,B_129),C_130))) = mult(A_128,mult(ld(A_128,B_129),C_130)) ),
inference(superposition,[status(thm),theory(equality)],[c_6331,c_369]) ).
tff(c_59399,plain,
! [A_411,B_412,C_413] : ( mult(A_411,mult(ld(A_411,B_412),C_413)) = ld(A_411,mult(mult(A_411,B_412),C_413)) ),
inference(demodulation,[status(thm),theory(equality)],[c_511,c_6424]) ).
tff(c_59897,plain,
! [A_9,A_182,C_413] : ( ld(mult(A_9,mult(A_9,A_182)),mult(mult(mult(A_9,mult(A_9,A_182)),mult(A_9,A_9)),C_413)) = mult(mult(A_9,mult(A_9,A_182)),mult(ld(A_182,unit),C_413)) ),
inference(superposition,[status(thm),theory(equality)],[c_12756,c_59399]) ).
tff(c_117795,plain,
! [A_600,A_601,C_602] : ( ld(A_600,mult(mult(A_600,mult(A_601,A_601)),C_602)) = mult(A_601,mult(A_601,C_602)) ),
inference(demodulation,[status(thm),theory(equality)],[c_1936,c_2,c_351,c_351,c_351,c_2100,c_59897]) ).
tff(c_118138,plain,
! [A_600,A_601,C_602] : ( mult(mult(A_600,mult(A_601,A_601)),C_602) = mult(A_600,mult(A_601,mult(A_601,C_602))) ),
inference(superposition,[status(thm),theory(equality)],[c_117795,c_2]) ).
tff(c_16,plain,
mult(mult(a,mult(b,b)),c) != mult(a,mult(b,mult(b,c))),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_121905,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_118138,c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP687-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:33 EDT 2023
% 0.13/0.36 % CPUTime :
% 40.62/28.53 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 40.62/28.54
% 40.62/28.54 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 40.69/28.57
% 40.69/28.57 Inference rules
% 40.69/28.57 ----------------------
% 40.69/28.57 #Ref : 0
% 40.69/28.57 #Sup : 29868
% 40.69/28.57 #Fact : 0
% 40.69/28.57 #Define : 0
% 40.69/28.57 #Split : 0
% 40.69/28.57 #Chain : 0
% 40.69/28.57 #Close : 0
% 40.69/28.57
% 40.69/28.57 Ordering : KBO
% 40.69/28.57
% 40.69/28.57 Simplification rules
% 40.69/28.57 ----------------------
% 40.69/28.57 #Subsume : 0
% 40.69/28.57 #Demod : 85338
% 40.69/28.57 #Tautology : 9412
% 40.69/28.57 #SimpNegUnit : 0
% 40.69/28.57 #BackRed : 50
% 40.69/28.57
% 40.69/28.57 #Partial instantiations: 0
% 40.69/28.57 #Strategies tried : 1
% 40.69/28.57
% 40.69/28.57 Timing (in seconds)
% 40.69/28.57 ----------------------
% 40.69/28.58 Preprocessing : 0.42
% 40.69/28.58 Parsing : 0.22
% 40.69/28.58 CNF conversion : 0.02
% 40.69/28.58 Main loop : 27.02
% 40.69/28.58 Inferencing : 3.10
% 40.69/28.58 Reduction : 19.59
% 40.69/28.58 Demodulation : 18.56
% 40.69/28.58 BG Simplification : 0.57
% 40.69/28.58 Subsumption : 2.76
% 40.69/28.58 Abstraction : 1.27
% 40.69/28.58 MUC search : 0.00
% 40.69/28.58 Cooper : 0.00
% 40.69/28.58 Total : 27.49
% 40.69/28.58 Index Insertion : 0.00
% 40.69/28.58 Index Deletion : 0.00
% 40.69/28.58 Index Matching : 0.00
% 40.69/28.58 BG Taut test : 0.00
%------------------------------------------------------------------------------