TSTP Solution File: GRP698-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP698-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 : n020.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:57 EDT 2023
% Result : Unsatisfiable 198.42s 131.09s
% Output : CNFRefutation 198.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 28 ( 21 unt; 7 typ; 0 def)
% Number of atoms : 21 ( 20 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 : 41 (; 41 !; 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_29,axiom,
! [A,B] : ( mult(rd(A,B),B) = A ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [A] : ( mult(A,unit) = A ),
file(unknown,unknown) ).
tff(f_37,axiom,
! [A,B,C] : ( mult(mult(mult(A,B),A),mult(A,C)) = mult(A,mult(mult(mult(B,A),A),C)) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [A,B] : ( rd(mult(A,B),B) = A ),
file(unknown,unknown) ).
tff(f_41,axiom,
mult(a,mult(b,c)) != mult(rd(mult(a,b),a),mult(a,c)),
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_10,plain,
! [A_9] : ( mult(A_9,unit) = A_9 ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_283,plain,
! [A_35,B_36,C_37] : ( mult(mult(mult(A_35,B_36),A_35),mult(A_35,C_37)) = mult(A_35,mult(mult(mult(B_36,A_35),A_35),C_37)) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_337,plain,
! [A_9,B_36] : ( mult(A_9,mult(mult(mult(B_36,A_9),A_9),unit)) = mult(mult(mult(A_9,B_36),A_9),A_9) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_283]) ).
tff(c_883,plain,
! [A_50,B_51] : ( mult(mult(mult(A_50,B_51),A_50),A_50) = mult(A_50,mult(mult(B_51,A_50),A_50)) ),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_337]) ).
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_2585,plain,
! [A_77,B_78] : ( rd(mult(A_77,mult(mult(B_78,A_77),A_77)),A_77) = mult(mult(A_77,B_78),A_77) ),
inference(superposition,[status(thm),theory(equality)],[c_883,c_8]) ).
tff(c_2977,plain,
! [B_83,A_84] : ( rd(mult(B_83,mult(A_84,B_83)),B_83) = mult(mult(B_83,rd(A_84,B_83)),B_83) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_2585]) ).
tff(c_3068,plain,
! [B_6,A_5] : ( mult(mult(B_6,rd(rd(A_5,B_6),B_6)),B_6) = rd(mult(B_6,A_5),B_6) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_2977]) ).
tff(c_6826,plain,
! [A_120,B_121,C_122] : ( rd(mult(A_120,mult(mult(mult(B_121,A_120),A_120),C_122)),mult(A_120,C_122)) = mult(mult(A_120,B_121),A_120) ),
inference(superposition,[status(thm),theory(equality)],[c_283,c_8]) ).
tff(c_51362,plain,
! [B_346,A_347,C_348] : ( rd(mult(B_346,mult(mult(A_347,B_346),C_348)),mult(B_346,C_348)) = mult(mult(B_346,rd(A_347,B_346)),B_346) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_6826]) ).
tff(c_51962,plain,
! [B_6,A_5,C_348] : ( rd(mult(B_6,mult(A_5,C_348)),mult(B_6,C_348)) = mult(mult(B_6,rd(rd(A_5,B_6),B_6)),B_6) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_51362]) ).
tff(c_196354,plain,
! [B_734,A_735,C_736] : ( rd(mult(B_734,mult(A_735,C_736)),mult(B_734,C_736)) = rd(mult(B_734,A_735),B_734) ),
inference(demodulation,[status(thm),theory(equality)],[c_3068,c_51962]) ).
tff(c_196574,plain,
! [B_734,A_735,C_736] : ( mult(rd(mult(B_734,A_735),B_734),mult(B_734,C_736)) = mult(B_734,mult(A_735,C_736)) ),
inference(superposition,[status(thm),theory(equality)],[c_196354,c_6]) ).
tff(c_18,plain,
mult(rd(mult(a,b),a),mult(a,c)) != mult(a,mult(b,c)),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_281034,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_196574,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GRP698-1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/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.20/0.36 % Computer : n020.cluster.edu
% 0.20/0.36 % Model : x86_64 x86_64
% 0.20/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.36 % Memory : 8042.1875MB
% 0.20/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.36 % CPULimit : 300
% 0.20/0.36 % WCLimit : 300
% 0.20/0.36 % DateTime : Thu Aug 3 22:20:37 EDT 2023
% 0.20/0.36 % CPUTime :
% 198.42/131.09 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 198.42/131.10
% 198.42/131.10 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 198.42/131.12
% 198.42/131.12 Inference rules
% 198.42/131.12 ----------------------
% 198.42/131.12 #Ref : 0
% 198.42/131.12 #Sup : 74342
% 198.42/131.12 #Fact : 0
% 198.42/131.12 #Define : 0
% 198.42/131.12 #Split : 0
% 198.42/131.12 #Chain : 0
% 198.42/131.12 #Close : 0
% 198.42/131.12
% 198.42/131.12 Ordering : KBO
% 198.42/131.12
% 198.42/131.12 Simplification rules
% 198.42/131.12 ----------------------
% 198.42/131.13 #Subsume : 0
% 198.42/131.13 #Demod : 154525
% 198.42/131.13 #Tautology : 14458
% 198.42/131.13 #SimpNegUnit : 0
% 198.42/131.13 #BackRed : 106
% 198.42/131.13
% 198.42/131.13 #Partial instantiations: 0
% 198.42/131.13 #Strategies tried : 1
% 198.42/131.13
% 198.42/131.13 Timing (in seconds)
% 198.42/131.13 ----------------------
% 198.42/131.13 Preprocessing : 0.42
% 198.42/131.13 Parsing : 0.23
% 198.42/131.13 CNF conversion : 0.02
% 198.42/131.13 Main loop : 129.63
% 198.42/131.13 Inferencing : 8.81
% 198.42/131.13 Reduction : 103.73
% 198.42/131.13 Demodulation : 100.62
% 198.42/131.13 BG Simplification : 1.67
% 198.42/131.13 Subsumption : 11.24
% 198.42/131.13 Abstraction : 4.27
% 198.42/131.13 MUC search : 0.00
% 198.42/131.13 Cooper : 0.00
% 198.42/131.13 Total : 130.10
% 198.42/131.13 Index Insertion : 0.00
% 198.42/131.13 Index Deletion : 0.00
% 198.42/131.13 Index Matching : 0.00
% 198.42/131.13 BG Taut test : 0.00
%------------------------------------------------------------------------------