TSTP Solution File: RNG014-6 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG014-6 : 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 : n016.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:43 EDT 2023
% Result : Unsatisfiable 24.97s 14.22s
% Output : CNFRefutation 24.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of formulae : 30 ( 22 unt; 8 typ; 0 def)
% Number of atoms : 22 ( 21 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 10 ( 5 >; 5 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 36 (; 36 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ associator > multiply > commutator > add > #nlpp > additive_inverse > b > additive_identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(additive_identity,type,
additive_identity: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(associator,type,
associator: ( $i * $i * $i ) > $i ).
tff(commutator,type,
commutator: ( $i * $i ) > $i ).
tff(additive_inverse,type,
additive_inverse: $i > $i ).
tff(b,type,
b: $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(f_45,axiom,
! [X] : ( add(additive_identity,X) = X ),
file(unknown,unknown) ).
tff(f_52,axiom,
! [X] : ( multiply(X,additive_identity) = additive_identity ),
file(unknown,unknown) ).
tff(f_55,axiom,
! [X] : ( add(additive_inverse(X),X) = additive_identity ),
file(unknown,unknown) ).
tff(f_47,axiom,
! [X] : ( add(X,additive_identity) = X ),
file(unknown,unknown) ).
tff(f_57,axiom,
! [X] : ( add(X,additive_inverse(X)) = additive_identity ),
file(unknown,unknown) ).
tff(f_63,axiom,
! [X,Y,Z] : ( multiply(X,add(Y,Z)) = add(multiply(X,Y),multiply(X,Z)) ),
file(unknown,unknown) ).
tff(f_71,axiom,
! [X,Y,Z] : ( add(X,add(Y,Z)) = add(add(X,Y),Z) ),
file(unknown,unknown) ).
tff(f_87,axiom,
multiply(a,additive_inverse(b)) != additive_inverse(multiply(a,b)),
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1] : ( add(additive_identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_8,plain,
! [X_4] : ( multiply(X_4,additive_identity) = additive_identity ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_10,plain,
! [X_5] : ( add(additive_inverse(X_5),X_5) = additive_identity ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_4,plain,
! [X_2] : ( add(X_2,additive_identity) = X_2 ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_12,plain,
! [X_6] : ( add(X_6,additive_inverse(X_6)) = additive_identity ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_1012,plain,
! [X_60,Y_61,Z_62] : ( add(multiply(X_60,Y_61),multiply(X_60,Z_62)) = multiply(X_60,add(Y_61,Z_62)) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_22,plain,
! [X_16,Y_17,Z_18] : ( add(add(X_16,Y_17),Z_18) = add(X_16,add(Y_17,Z_18)) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_17333,plain,
! [X_194,Y_195,Z_196,Z_197] : ( add(multiply(X_194,Y_195),add(multiply(X_194,Z_196),Z_197)) = add(multiply(X_194,add(Y_195,Z_196)),Z_197) ),
inference(superposition,[status(thm),theory(equality)],[c_1012,c_22]) ).
tff(c_17687,plain,
! [X_194,Y_195,Z_196] : ( add(multiply(X_194,add(Y_195,Z_196)),additive_inverse(multiply(X_194,Z_196))) = add(multiply(X_194,Y_195),additive_identity) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_17333]) ).
tff(c_70691,plain,
! [X_392,Y_393,Z_394] : ( add(multiply(X_392,add(Y_393,Z_394)),additive_inverse(multiply(X_392,Z_394))) = multiply(X_392,Y_393) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_17687]) ).
tff(c_71413,plain,
! [X_392,X_5] : ( add(multiply(X_392,additive_identity),additive_inverse(multiply(X_392,X_5))) = multiply(X_392,additive_inverse(X_5)) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_70691]) ).
tff(c_71491,plain,
! [X_392,X_5] : ( multiply(X_392,additive_inverse(X_5)) = additive_inverse(multiply(X_392,X_5)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_8,c_71413]) ).
tff(c_32,plain,
multiply(a,additive_inverse(b)) != additive_inverse(multiply(a,b)),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_71500,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_71491,c_32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : RNG014-6 : 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.14/0.34 % Computer : n016.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % 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 18:25:08 EDT 2023
% 0.14/0.35 % CPUTime :
% 24.97/14.22 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 24.97/14.23
% 24.97/14.23 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 24.97/14.25
% 24.97/14.25 Inference rules
% 24.97/14.25 ----------------------
% 24.97/14.25 #Ref : 0
% 24.97/14.25 #Sup : 18186
% 24.97/14.25 #Fact : 0
% 24.97/14.25 #Define : 0
% 24.97/14.25 #Split : 0
% 24.97/14.25 #Chain : 0
% 24.97/14.25 #Close : 0
% 24.97/14.25
% 24.97/14.25 Ordering : KBO
% 24.97/14.25
% 24.97/14.25 Simplification rules
% 24.97/14.25 ----------------------
% 24.97/14.25 #Subsume : 2088
% 24.97/14.25 #Demod : 28866
% 24.97/14.25 #Tautology : 6710
% 24.97/14.25 #SimpNegUnit : 0
% 24.97/14.25 #BackRed : 6
% 24.97/14.25
% 24.97/14.25 #Partial instantiations: 0
% 24.97/14.25 #Strategies tried : 1
% 24.97/14.25
% 24.97/14.25 Timing (in seconds)
% 24.97/14.25 ----------------------
% 24.97/14.25 Preprocessing : 0.49
% 24.97/14.25 Parsing : 0.25
% 24.97/14.25 CNF conversion : 0.02
% 24.97/14.25 Main loop : 12.64
% 24.97/14.25 Inferencing : 1.59
% 24.97/14.25 Reduction : 9.11
% 24.97/14.25 Demodulation : 8.71
% 24.97/14.25 BG Simplification : 0.21
% 24.97/14.26 Subsumption : 1.34
% 24.97/14.26 Abstraction : 0.42
% 24.97/14.26 MUC search : 0.00
% 24.97/14.26 Cooper : 0.00
% 24.97/14.26 Total : 13.18
% 24.97/14.26 Index Insertion : 0.00
% 24.97/14.26 Index Deletion : 0.00
% 24.97/14.26 Index Matching : 0.00
% 24.97/14.26 BG Taut test : 0.00
%------------------------------------------------------------------------------