TSTP Solution File: RNG006-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG006-1 : TPTP v8.1.2. Released v1.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 : n029.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:54:41 EDT 2023
% Result : Unsatisfiable 33.92s 21.30s
% Output : CNFRefutation 33.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 22
% Syntax : Number of formulae : 40 ( 16 unt; 13 typ; 0 def)
% Number of atoms : 50 ( 5 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 48 ( 25 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 5 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 44 (; 44 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > multiply > add > #nlpp > additive_inverse > c > bS_Ic > b > additive_identity > aPc > aPb_S_IaPc > aPb > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(aPc,type,
aPc: $i ).
tff(sum,type,
sum: ( $i * $i * $i ) > $o ).
tff(aPb,type,
aPb: $i ).
tff(a,type,
a: $i ).
tff(product,type,
product: ( $i * $i * $i ) > $o ).
tff(additive_identity,type,
additive_identity: $i ).
tff(bS_Ic,type,
bS_Ic: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(additive_inverse,type,
additive_inverse: $i > $i ).
tff(b,type,
b: $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(aPb_S_IaPc,type,
aPb_S_IaPc: $i ).
tff(c,type,
c: $i ).
tff(f_201,axiom,
~ product(a,bS_Ic,aPb_S_IaPc),
file(unknown,unknown) ).
tff(f_197,axiom,
product(a,b,aPb),
file(unknown,unknown) ).
tff(f_198,axiom,
product(a,c,aPc),
file(unknown,unknown) ).
tff(f_50,axiom,
! [X,Y] : product(X,Y,multiply(X,Y)),
file(unknown,unknown) ).
tff(f_185,axiom,
! [A,B,C] :
( ~ product(A,B,C)
| product(A,additive_inverse(B),additive_inverse(C)) ),
file(unknown,unknown) ).
tff(f_178,axiom,
! [X,Y,U,V] :
( ~ product(X,Y,U)
| ~ product(X,Y,V)
| ( U = V ) ),
file(unknown,unknown) ).
tff(f_196,axiom,
sum(b,additive_inverse(c),bS_Ic),
file(unknown,unknown) ).
tff(f_199,axiom,
sum(aPb,additive_inverse(aPc),aPb_S_IaPc),
file(unknown,unknown) ).
tff(f_133,axiom,
! [V3,Z,V1,X,Y,V2,V4] :
( ~ product(X,Y,V1)
| ~ product(X,Z,V2)
| ~ sum(Y,Z,V3)
| ~ sum(V1,V2,V4)
| product(X,V3,V4) ),
file(unknown,unknown) ).
tff(c_50,plain,
~ product(a,bS_Ic,aPb_S_IaPc),
inference(cnfTransformation,[status(thm)],[f_201]) ).
tff(c_44,plain,
product(a,b,aPb),
inference(cnfTransformation,[status(thm)],[f_197]) ).
tff(c_46,plain,
product(a,c,aPc),
inference(cnfTransformation,[status(thm)],[f_198]) ).
tff(c_6,plain,
! [X_3,Y_4] : product(X_3,Y_4,multiply(X_3,Y_4)),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_36,plain,
! [A_72,B_73,C_74] :
( product(A_72,additive_inverse(B_73),additive_inverse(C_74))
| ~ product(A_72,B_73,C_74) ),
inference(cnfTransformation,[status(thm)],[f_185]) ).
tff(c_130,plain,
! [V_107,U_108,X_109,Y_110] :
( ( V_107 = U_108 )
| ~ product(X_109,Y_110,V_107)
| ~ product(X_109,Y_110,U_108) ),
inference(cnfTransformation,[status(thm)],[f_178]) ).
tff(c_1298,plain,
! [C_211,U_212,A_213,B_214] :
( ( additive_inverse(C_211) = U_212 )
| ~ product(A_213,additive_inverse(B_214),U_212)
| ~ product(A_213,B_214,C_211) ),
inference(resolution,[status(thm)],[c_36,c_130]) ).
tff(c_1334,plain,
! [X_215,B_216,C_217] :
( ( multiply(X_215,additive_inverse(B_216)) = additive_inverse(C_217) )
| ~ product(X_215,B_216,C_217) ),
inference(resolution,[status(thm)],[c_6,c_1298]) ).
tff(c_1373,plain,
multiply(a,additive_inverse(c)) = additive_inverse(aPc),
inference(resolution,[status(thm)],[c_46,c_1334]) ).
tff(c_1381,plain,
product(a,additive_inverse(c),additive_inverse(aPc)),
inference(superposition,[status(thm),theory(equality)],[c_1373,c_6]) ).
tff(c_42,plain,
sum(b,additive_inverse(c),bS_Ic),
inference(cnfTransformation,[status(thm)],[f_196]) ).
tff(c_48,plain,
sum(aPb,additive_inverse(aPc),aPb_S_IaPc),
inference(cnfTransformation,[status(thm)],[f_199]) ).
tff(c_644,plain,
! [Z_156,V2_155,X_158,V4_159,V1_157,V3_153,Y_154] :
( product(X_158,V3_153,V4_159)
| ~ sum(V1_157,V2_155,V4_159)
| ~ sum(Y_154,Z_156,V3_153)
| ~ product(X_158,Z_156,V2_155)
| ~ product(X_158,Y_154,V1_157) ),
inference(cnfTransformation,[status(thm)],[f_133]) ).
tff(c_14837,plain,
! [X_502,V3_503,Y_504,Z_505] :
( product(X_502,V3_503,aPb_S_IaPc)
| ~ sum(Y_504,Z_505,V3_503)
| ~ product(X_502,Z_505,additive_inverse(aPc))
| ~ product(X_502,Y_504,aPb) ),
inference(resolution,[status(thm)],[c_48,c_644]) ).
tff(c_114529,plain,
! [X_1398] :
( product(X_1398,bS_Ic,aPb_S_IaPc)
| ~ product(X_1398,additive_inverse(c),additive_inverse(aPc))
| ~ product(X_1398,b,aPb) ),
inference(resolution,[status(thm)],[c_42,c_14837]) ).
tff(c_114532,plain,
( product(a,bS_Ic,aPb_S_IaPc)
| ~ product(a,b,aPb) ),
inference(resolution,[status(thm)],[c_1381,c_114529]) ).
tff(c_114555,plain,
product(a,bS_Ic,aPb_S_IaPc),
inference(demodulation,[status(thm),theory(equality)],[c_44,c_114532]) ).
tff(c_114557,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_50,c_114555]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : RNG006-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % 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.13/0.35 % Computer : n029.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 18:11:52 EDT 2023
% 0.13/0.35 % CPUTime :
% 33.92/21.30 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 33.92/21.31
% 33.92/21.31 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 33.92/21.34
% 33.92/21.34 Inference rules
% 33.92/21.34 ----------------------
% 33.92/21.34 #Ref : 0
% 33.92/21.34 #Sup : 27360
% 33.92/21.34 #Fact : 0
% 33.92/21.34 #Define : 0
% 33.92/21.34 #Split : 73
% 33.92/21.34 #Chain : 0
% 33.92/21.34 #Close : 0
% 33.92/21.34
% 33.92/21.34 Ordering : KBO
% 33.92/21.34
% 33.92/21.34 Simplification rules
% 33.92/21.34 ----------------------
% 33.92/21.34 #Subsume : 6353
% 33.92/21.34 #Demod : 13331
% 33.92/21.34 #Tautology : 5682
% 33.92/21.34 #SimpNegUnit : 546
% 33.92/21.34 #BackRed : 26
% 33.92/21.34
% 33.92/21.34 #Partial instantiations: 0
% 33.92/21.34 #Strategies tried : 1
% 33.92/21.34
% 33.92/21.34 Timing (in seconds)
% 33.92/21.34 ----------------------
% 33.92/21.34 Preprocessing : 0.60
% 33.92/21.34 Parsing : 0.31
% 33.92/21.34 CNF conversion : 0.03
% 33.92/21.34 Main loop : 19.66
% 33.92/21.34 Inferencing : 2.22
% 33.92/21.34 Reduction : 8.75
% 33.92/21.34 Demodulation : 6.28
% 33.92/21.34 BG Simplification : 0.14
% 33.92/21.34 Subsumption : 6.96
% 33.92/21.34 Abstraction : 0.18
% 33.92/21.34 MUC search : 0.00
% 33.92/21.34 Cooper : 0.00
% 33.92/21.34 Total : 20.32
% 33.92/21.34 Index Insertion : 0.00
% 33.92/21.34 Index Deletion : 0.00
% 33.92/21.34 Index Matching : 0.00
% 33.92/21.34 BG Taut test : 0.00
%------------------------------------------------------------------------------