TSTP Solution File: RNG005-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG005-2 : 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/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 : n024.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 124.72s 108.92s
% Output : CNFRefutation 124.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of formulae : 31 ( 12 unt; 11 typ; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 37 ( 20 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 6 >; 7 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 35 (; 35 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > equalish > multiply > add > #nlpp > additive_inverse > d > c > b > additive_identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(sum,type,
sum: ( $i * $i * $i ) > $o ).
tff(a,type,
a: $i ).
tff(product,type,
product: ( $i * $i * $i ) > $o ).
tff(additive_identity,type,
additive_identity: $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(d,type,
d: $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(c,type,
c: $i ).
tff(f_237,axiom,
product(a,b,d),
file(unknown,unknown) ).
tff(f_238,axiom,
product(additive_inverse(a),b,c),
file(unknown,unknown) ).
tff(f_110,axiom,
! [X] : sum(X,additive_inverse(X),additive_identity),
file(unknown,unknown) ).
tff(f_234,axiom,
! [X] : product(additive_identity,X,additive_identity),
file(unknown,unknown) ).
tff(f_201,axiom,
! [V3,Z,V1,X,Y,V2,V4] :
( ~ product(Y,X,V1)
| ~ product(Z,X,V2)
| ~ sum(Y,Z,V3)
| ~ product(V3,X,V4)
| sum(V1,V2,V4) ),
file(unknown,unknown) ).
tff(f_137,axiom,
! [X,Y,Z] :
( ~ sum(X,Y,Z)
| sum(Y,X,Z) ),
file(unknown,unknown) ).
tff(f_240,axiom,
~ sum(c,d,additive_identity),
file(unknown,unknown) ).
tff(c_58,plain,
product(a,b,d),
inference(cnfTransformation,[status(thm)],[f_237]) ).
tff(c_60,plain,
product(additive_inverse(a),b,c),
inference(cnfTransformation,[status(thm)],[f_238]) ).
tff(c_30,plain,
! [X_40] : sum(X_40,additive_inverse(X_40),additive_identity),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_54,plain,
! [X_104] : product(additive_identity,X_104,additive_identity),
inference(cnfTransformation,[status(thm)],[f_234]) ).
tff(c_910,plain,
! [X_233,V1_235,V4_234,Y_230,V2_232,V3_231,Z_229] :
( sum(V1_235,V2_232,V4_234)
| ~ product(V3_231,X_233,V4_234)
| ~ sum(Y_230,Z_229,V3_231)
| ~ product(Z_229,X_233,V2_232)
| ~ product(Y_230,X_233,V1_235) ),
inference(cnfTransformation,[status(thm)],[f_201]) ).
tff(c_14623,plain,
! [X_633,Y_630,V1_631,Z_632,V2_634] :
( sum(V1_631,V2_634,additive_identity)
| ~ sum(Y_630,Z_632,additive_identity)
| ~ product(Z_632,X_633,V2_634)
| ~ product(Y_630,X_633,V1_631) ),
inference(resolution,[status(thm)],[c_54,c_910]) ).
tff(c_321259,plain,
! [V1_2802,V2_2803,X_2804,X_2805] :
( sum(V1_2802,V2_2803,additive_identity)
| ~ product(additive_inverse(X_2804),X_2805,V2_2803)
| ~ product(X_2804,X_2805,V1_2802) ),
inference(resolution,[status(thm)],[c_30,c_14623]) ).
tff(c_321652,plain,
! [V1_2806] :
( sum(V1_2806,c,additive_identity)
| ~ product(a,b,V1_2806) ),
inference(resolution,[status(thm)],[c_60,c_321259]) ).
tff(c_36,plain,
! [Y_54,X_53,Z_55] :
( sum(Y_54,X_53,Z_55)
| ~ sum(X_53,Y_54,Z_55) ),
inference(cnfTransformation,[status(thm)],[f_137]) ).
tff(c_322185,plain,
! [V1_2807] :
( sum(c,V1_2807,additive_identity)
| ~ product(a,b,V1_2807) ),
inference(resolution,[status(thm)],[c_321652,c_36]) ).
tff(c_62,plain,
~ sum(c,d,additive_identity),
inference(cnfTransformation,[status(thm)],[f_240]) ).
tff(c_322502,plain,
~ product(a,b,d),
inference(resolution,[status(thm)],[c_322185,c_62]) ).
tff(c_322633,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_58,c_322502]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : RNG005-2 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.12 % 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.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 18:02:00 EDT 2023
% 0.13/0.34 % CPUTime :
% 124.72/108.92 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 124.72/108.92
% 124.72/108.92 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 124.72/108.95
% 124.72/108.95 Inference rules
% 124.72/108.95 ----------------------
% 124.72/108.95 #Ref : 0
% 124.72/108.95 #Sup : 75805
% 124.72/108.95 #Fact : 0
% 124.72/108.95 #Define : 0
% 124.72/108.95 #Split : 22
% 124.72/108.95 #Chain : 0
% 124.72/108.95 #Close : 0
% 124.72/108.95
% 124.72/108.95 Ordering : KBO
% 124.72/108.95
% 124.72/108.95 Simplification rules
% 124.72/108.95 ----------------------
% 124.72/108.95 #Subsume : 18482
% 124.72/108.95 #Demod : 19951
% 124.72/108.95 #Tautology : 11216
% 124.72/108.95 #SimpNegUnit : 701
% 124.72/108.95 #BackRed : 0
% 124.72/108.95
% 124.72/108.95 #Partial instantiations: 0
% 124.72/108.95 #Strategies tried : 1
% 124.72/108.95
% 124.72/108.95 Timing (in seconds)
% 124.72/108.95 ----------------------
% 124.72/108.95 Preprocessing : 0.51
% 124.72/108.95 Parsing : 0.29
% 124.72/108.95 CNF conversion : 0.03
% 124.72/108.95 Main loop : 107.30
% 124.72/108.95 Inferencing : 6.68
% 124.72/108.95 Reduction : 48.04
% 124.72/108.96 Demodulation : 34.97
% 124.72/108.96 BG Simplification : 0.27
% 124.72/108.96 Subsumption : 41.82
% 124.72/108.96 Abstraction : 0.44
% 124.72/108.96 MUC search : 0.00
% 124.72/108.96 Cooper : 0.00
% 124.72/108.96 Total : 107.86
% 124.72/108.96 Index Insertion : 0.00
% 124.72/108.96 Index Deletion : 0.00
% 124.72/108.96 Index Matching : 0.00
% 124.72/108.96 BG Taut test : 0.00
%------------------------------------------------------------------------------