TSTP Solution File: FLD050-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD050-4 : TPTP v8.1.2. Bugfixed v2.1.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 : n010.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:37:37 EDT 2023
% Result : Unsatisfiable 6.77s 2.58s
% Output : CNFRefutation 6.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 30
% Syntax : Number of formulae : 65 ( 27 unt; 16 typ; 0 def)
% Number of atoms : 84 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 70 ( 35 ~; 35 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 8 >; 7 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 39 (; 39 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > less_or_equal > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > s > multiplicative_identity > k > d > c > b > additive_identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(sum,type,
sum: ( $i * $i * $i ) > $o ).
tff(less_or_equal,type,
less_or_equal: ( $i * $i ) > $o ).
tff(a,type,
a: $i ).
tff(product,type,
product: ( $i * $i * $i ) > $o ).
tff(additive_identity,type,
additive_identity: $i ).
tff(s,type,
s: $i ).
tff(multiplicative_identity,type,
multiplicative_identity: $i ).
tff(k,type,
k: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(additive_inverse,type,
additive_inverse: $i > $i ).
tff(b,type,
b: $i ).
tff(defined,type,
defined: $i > $o ).
tff(multiplicative_inverse,type,
multiplicative_inverse: $i > $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(d,type,
d: $i ).
tff(c,type,
c: $i ).
tff(f_263,axiom,
~ product(c,multiplicative_inverse(d),s),
file(unknown,unknown) ).
tff(f_258,axiom,
~ sum(additive_identity,d,additive_identity),
file(unknown,unknown) ).
tff(f_252,axiom,
defined(d),
file(unknown,unknown) ).
tff(f_117,axiom,
! [X] :
( product(multiplicative_inverse(X),X,multiplicative_identity)
| sum(additive_identity,X,additive_identity)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_249,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_260,axiom,
product(a,d,k),
file(unknown,unknown) ).
tff(f_122,axiom,
! [Y,X,Z] :
( product(Y,X,Z)
| ~ product(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_110,axiom,
! [X] :
( product(multiplicative_identity,X,X)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_94,axiom,
! [W,U,Z,X,Y,V] :
( product(X,V,W)
| ~ product(X,Y,U)
| ~ product(Y,Z,V)
| ~ product(U,Z,W) ),
file(unknown,unknown) ).
tff(f_256,axiom,
~ sum(additive_identity,b,additive_identity),
file(unknown,unknown) ).
tff(f_250,axiom,
defined(b),
file(unknown,unknown) ).
tff(f_251,axiom,
defined(c),
file(unknown,unknown) ).
tff(f_261,axiom,
product(b,c,k),
file(unknown,unknown) ).
tff(f_259,axiom,
product(a,multiplicative_inverse(b),s),
file(unknown,unknown) ).
tff(c_76,plain,
~ product(c,multiplicative_inverse(d),s),
inference(cnfTransformation,[status(thm)],[f_263]) ).
tff(c_68,plain,
~ sum(additive_identity,d,additive_identity),
inference(cnfTransformation,[status(thm)],[f_258]) ).
tff(c_60,plain,
defined(d),
inference(cnfTransformation,[status(thm)],[f_252]) ).
tff(c_18,plain,
! [X_31] :
( ~ defined(X_31)
| sum(additive_identity,X_31,additive_identity)
| product(multiplicative_inverse(X_31),X_31,multiplicative_identity) ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_54,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_72,plain,
product(a,d,k),
inference(cnfTransformation,[status(thm)],[f_260]) ).
tff(c_81,plain,
! [X_78,Y_79,Z_80] :
( ~ product(X_78,Y_79,Z_80)
| product(Y_79,X_78,Z_80) ),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_93,plain,
product(d,a,k),
inference(resolution,[status(thm)],[c_72,c_81]) ).
tff(c_16,plain,
! [X_30] :
( ~ defined(X_30)
| product(multiplicative_identity,X_30,X_30) ),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_427,plain,
! [X_137,W_136,U_134,Y_139,V_138,Z_135] :
( ~ product(U_134,Z_135,W_136)
| ~ product(Y_139,Z_135,V_138)
| ~ product(X_137,Y_139,U_134)
| product(X_137,V_138,W_136) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_2606,plain,
! [Y_234,X_235,V_236,X_237] :
( ~ product(Y_234,X_235,V_236)
| ~ product(X_237,Y_234,multiplicative_identity)
| product(X_237,V_236,X_235)
| ~ defined(X_235) ),
inference(resolution,[status(thm)],[c_16,c_427]) ).
tff(c_2668,plain,
! [X_237] :
( ~ product(X_237,d,multiplicative_identity)
| product(X_237,k,a)
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_93,c_2606]) ).
tff(c_2759,plain,
! [X_238] :
( ~ product(X_238,d,multiplicative_identity)
| product(X_238,k,a) ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_2668]) ).
tff(c_20,plain,
! [X_33,Y_32,Z_34] :
( ~ product(X_33,Y_32,Z_34)
| product(Y_32,X_33,Z_34) ),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_2956,plain,
! [X_247] :
( product(k,X_247,a)
| ~ product(X_247,d,multiplicative_identity) ),
inference(resolution,[status(thm)],[c_2759,c_20]) ).
tff(c_2959,plain,
( product(k,multiplicative_inverse(d),a)
| ~ defined(d)
| sum(additive_identity,d,additive_identity) ),
inference(resolution,[status(thm)],[c_18,c_2956]) ).
tff(c_2962,plain,
( product(k,multiplicative_inverse(d),a)
| sum(additive_identity,d,additive_identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_60,c_2959]) ).
tff(c_2963,plain,
product(k,multiplicative_inverse(d),a),
inference(negUnitSimplification,[status(thm)],[c_68,c_2962]) ).
tff(c_2988,plain,
product(multiplicative_inverse(d),k,a),
inference(resolution,[status(thm)],[c_2963,c_20]) ).
tff(c_66,plain,
~ sum(additive_identity,b,additive_identity),
inference(cnfTransformation,[status(thm)],[f_256]) ).
tff(c_56,plain,
defined(b),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_58,plain,
defined(c),
inference(cnfTransformation,[status(thm)],[f_251]) ).
tff(c_74,plain,
product(b,c,k),
inference(cnfTransformation,[status(thm)],[f_261]) ).
tff(c_2676,plain,
! [X_237] :
( ~ product(X_237,b,multiplicative_identity)
| product(X_237,k,c)
| ~ defined(c) ),
inference(resolution,[status(thm)],[c_74,c_2606]) ).
tff(c_2806,plain,
! [X_240] :
( ~ product(X_240,b,multiplicative_identity)
| product(X_240,k,c) ),
inference(demodulation,[status(thm),theory(equality)],[c_58,c_2676]) ).
tff(c_2833,plain,
! [X_241] :
( product(k,X_241,c)
| ~ product(X_241,b,multiplicative_identity) ),
inference(resolution,[status(thm)],[c_2806,c_20]) ).
tff(c_2836,plain,
( product(k,multiplicative_inverse(b),c)
| ~ defined(b)
| sum(additive_identity,b,additive_identity) ),
inference(resolution,[status(thm)],[c_18,c_2833]) ).
tff(c_2839,plain,
( product(k,multiplicative_inverse(b),c)
| sum(additive_identity,b,additive_identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_2836]) ).
tff(c_2840,plain,
product(k,multiplicative_inverse(b),c),
inference(negUnitSimplification,[status(thm)],[c_66,c_2839]) ).
tff(c_70,plain,
product(a,multiplicative_inverse(b),s),
inference(cnfTransformation,[status(thm)],[f_259]) ).
tff(c_455,plain,
! [Y_139,V_138,X_137] :
( ~ product(Y_139,multiplicative_inverse(b),V_138)
| ~ product(X_137,Y_139,a)
| product(X_137,V_138,s) ),
inference(resolution,[status(thm)],[c_70,c_427]) ).
tff(c_3026,plain,
! [X_250] :
( ~ product(X_250,k,a)
| product(X_250,c,s) ),
inference(resolution,[status(thm)],[c_2840,c_455]) ).
tff(c_3033,plain,
product(multiplicative_inverse(d),c,s),
inference(resolution,[status(thm)],[c_2988,c_3026]) ).
tff(c_3049,plain,
product(c,multiplicative_inverse(d),s),
inference(resolution,[status(thm)],[c_3033,c_20]) ).
tff(c_3061,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_76,c_3049]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD050-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.14 % 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.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 19:51:13 EDT 2023
% 0.14/0.36 % CPUTime :
% 6.77/2.58 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.77/2.59
% 6.77/2.59 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.77/2.62
% 6.77/2.62 Inference rules
% 6.77/2.62 ----------------------
% 6.77/2.62 #Ref : 0
% 6.77/2.62 #Sup : 707
% 6.77/2.62 #Fact : 4
% 6.77/2.62 #Define : 0
% 6.77/2.62 #Split : 11
% 6.77/2.62 #Chain : 0
% 6.77/2.62 #Close : 0
% 6.77/2.62
% 6.77/2.62 Ordering : KBO
% 6.77/2.63
% 6.77/2.63 Simplification rules
% 6.77/2.63 ----------------------
% 6.77/2.63 #Subsume : 207
% 6.77/2.63 #Demod : 381
% 6.77/2.63 #Tautology : 89
% 6.77/2.63 #SimpNegUnit : 12
% 6.77/2.63 #BackRed : 0
% 6.77/2.63
% 6.77/2.63 #Partial instantiations: 0
% 6.77/2.63 #Strategies tried : 1
% 6.77/2.63
% 6.77/2.63 Timing (in seconds)
% 6.77/2.63 ----------------------
% 6.77/2.63 Preprocessing : 0.51
% 6.77/2.63 Parsing : 0.27
% 6.77/2.63 CNF conversion : 0.03
% 6.77/2.63 Main loop : 0.96
% 6.77/2.63 Inferencing : 0.34
% 6.77/2.63 Reduction : 0.29
% 6.77/2.63 Demodulation : 0.20
% 6.77/2.63 BG Simplification : 0.03
% 6.77/2.63 Subsumption : 0.22
% 6.77/2.63 Abstraction : 0.03
% 6.77/2.63 MUC search : 0.00
% 6.77/2.63 Cooper : 0.00
% 6.77/2.63 Total : 1.53
% 6.77/2.63 Index Insertion : 0.00
% 6.77/2.63 Index Deletion : 0.00
% 6.99/2.63 Index Matching : 0.00
% 6.99/2.63 BG Taut test : 0.00
%------------------------------------------------------------------------------