TSTP Solution File: FLD049-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD049-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/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 : n019.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:36 EDT 2023
% Result : Unsatisfiable 10.11s 3.40s
% Output : CNFRefutation 10.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 31
% Syntax : Number of formulae : 68 ( 29 unt; 16 typ; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 81 ( 40 ~; 41 |; 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 : 50 (; 50 !; 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(b,c,k),
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_122,axiom,
! [Y,X,Z] :
( product(Y,X,Z)
| ~ product(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_251,axiom,
defined(c),
file(unknown,unknown) ).
tff(f_260,axiom,
product(c,multiplicative_inverse(d),s),
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_249,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_259,axiom,
product(a,multiplicative_inverse(b),s),
file(unknown,unknown) ).
tff(f_261,axiom,
product(a,d,k),
file(unknown,unknown) ).
tff(f_105,axiom,
! [W,U,Z,X,Y,V] :
( product(U,Z,W)
| ~ product(X,Y,U)
| ~ product(Y,Z,V)
| ~ product(X,V,W) ),
file(unknown,unknown) ).
tff(c_76,plain,
~ product(b,c,k),
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_191,plain,
! [X_104] :
( ~ defined(X_104)
| sum(additive_identity,X_104,additive_identity)
| product(multiplicative_inverse(X_104),X_104,multiplicative_identity) ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
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_194,plain,
! [X_104] :
( product(X_104,multiplicative_inverse(X_104),multiplicative_identity)
| ~ defined(X_104)
| sum(additive_identity,X_104,additive_identity) ),
inference(resolution,[status(thm)],[c_191,c_20]) ).
tff(c_58,plain,
defined(c),
inference(cnfTransformation,[status(thm)],[f_251]) ).
tff(c_72,plain,
product(c,multiplicative_inverse(d),s),
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_91,plain,
product(multiplicative_inverse(d),c,s),
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_302,plain,
! [W_115,U_113,V_117,Z_114,X_116,Y_118] :
( ~ product(U_113,Z_114,W_115)
| ~ product(Y_118,Z_114,V_117)
| ~ product(X_116,Y_118,U_113)
| product(X_116,V_117,W_115) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_3571,plain,
! [Y_282,X_283,V_284,X_285] :
( ~ product(Y_282,X_283,V_284)
| ~ product(X_285,Y_282,multiplicative_identity)
| product(X_285,V_284,X_283)
| ~ defined(X_283) ),
inference(resolution,[status(thm)],[c_16,c_302]) ).
tff(c_3653,plain,
! [X_285] :
( ~ product(X_285,multiplicative_inverse(d),multiplicative_identity)
| product(X_285,s,c)
| ~ defined(c) ),
inference(resolution,[status(thm)],[c_91,c_3571]) ).
tff(c_7502,plain,
! [X_374] :
( ~ product(X_374,multiplicative_inverse(d),multiplicative_identity)
| product(X_374,s,c) ),
inference(demodulation,[status(thm),theory(equality)],[c_58,c_3653]) ).
tff(c_7506,plain,
( product(d,s,c)
| ~ defined(d)
| sum(additive_identity,d,additive_identity) ),
inference(resolution,[status(thm)],[c_194,c_7502]) ).
tff(c_7513,plain,
( product(d,s,c)
| sum(additive_identity,d,additive_identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_60,c_7506]) ).
tff(c_7514,plain,
product(d,s,c),
inference(negUnitSimplification,[status(thm)],[c_68,c_7513]) ).
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_54,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_70,plain,
product(a,multiplicative_inverse(b),s),
inference(cnfTransformation,[status(thm)],[f_259]) ).
tff(c_92,plain,
product(multiplicative_inverse(b),a,s),
inference(resolution,[status(thm)],[c_70,c_81]) ).
tff(c_3651,plain,
! [X_285] :
( ~ product(X_285,multiplicative_inverse(b),multiplicative_identity)
| product(X_285,s,a)
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_92,c_3571]) ).
tff(c_4025,plain,
! [X_299] :
( ~ product(X_299,multiplicative_inverse(b),multiplicative_identity)
| product(X_299,s,a) ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_3651]) ).
tff(c_4029,plain,
( product(b,s,a)
| ~ defined(b)
| sum(additive_identity,b,additive_identity) ),
inference(resolution,[status(thm)],[c_194,c_4025]) ).
tff(c_4036,plain,
( product(b,s,a)
| sum(additive_identity,b,additive_identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_4029]) ).
tff(c_4037,plain,
product(b,s,a),
inference(negUnitSimplification,[status(thm)],[c_66,c_4036]) ).
tff(c_4067,plain,
product(s,b,a),
inference(resolution,[status(thm)],[c_4037,c_20]) ).
tff(c_74,plain,
product(a,d,k),
inference(cnfTransformation,[status(thm)],[f_261]) ).
tff(c_93,plain,
product(d,a,k),
inference(resolution,[status(thm)],[c_74,c_81]) ).
tff(c_403,plain,
! [U_130,W_132,V_133,Z_129,Y_128,X_131] :
( ~ product(X_131,V_133,W_132)
| ~ product(Y_128,Z_129,V_133)
| ~ product(X_131,Y_128,U_130)
| product(U_130,Z_129,W_132) ),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_429,plain,
! [Y_128,Z_129,U_130] :
( ~ product(Y_128,Z_129,a)
| ~ product(d,Y_128,U_130)
| product(U_130,Z_129,k) ),
inference(resolution,[status(thm)],[c_93,c_403]) ).
tff(c_4095,plain,
! [U_130] :
( ~ product(d,s,U_130)
| product(U_130,b,k) ),
inference(resolution,[status(thm)],[c_4067,c_429]) ).
tff(c_7545,plain,
product(c,b,k),
inference(resolution,[status(thm)],[c_7514,c_4095]) ).
tff(c_7628,plain,
product(b,c,k),
inference(resolution,[status(thm)],[c_7545,c_20]) ).
tff(c_7651,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_76,c_7628]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD049-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/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.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % 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:56:46 EDT 2023
% 0.14/0.36 % CPUTime :
% 10.11/3.40 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.11/3.40
% 10.11/3.40 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 10.36/3.44
% 10.36/3.44 Inference rules
% 10.36/3.44 ----------------------
% 10.36/3.44 #Ref : 0
% 10.36/3.44 #Sup : 1743
% 10.36/3.44 #Fact : 4
% 10.36/3.44 #Define : 0
% 10.36/3.44 #Split : 25
% 10.36/3.44 #Chain : 0
% 10.36/3.44 #Close : 0
% 10.36/3.44
% 10.36/3.44 Ordering : KBO
% 10.36/3.44
% 10.36/3.44 Simplification rules
% 10.36/3.44 ----------------------
% 10.36/3.44 #Subsume : 317
% 10.36/3.44 #Demod : 1003
% 10.36/3.44 #Tautology : 193
% 10.36/3.44 #SimpNegUnit : 60
% 10.36/3.44 #BackRed : 0
% 10.36/3.44
% 10.36/3.44 #Partial instantiations: 0
% 10.36/3.44 #Strategies tried : 1
% 10.36/3.44
% 10.36/3.44 Timing (in seconds)
% 10.36/3.44 ----------------------
% 10.36/3.44 Preprocessing : 0.51
% 10.36/3.44 Parsing : 0.27
% 10.36/3.44 CNF conversion : 0.03
% 10.36/3.44 Main loop : 1.84
% 10.36/3.44 Inferencing : 0.58
% 10.36/3.44 Reduction : 0.60
% 10.36/3.44 Demodulation : 0.44
% 10.36/3.44 BG Simplification : 0.05
% 10.36/3.44 Subsumption : 0.47
% 10.36/3.44 Abstraction : 0.04
% 10.36/3.44 MUC search : 0.00
% 10.36/3.44 Cooper : 0.00
% 10.36/3.44 Total : 2.41
% 10.36/3.44 Index Insertion : 0.00
% 10.36/3.44 Index Deletion : 0.00
% 10.36/3.44 Index Matching : 0.00
% 10.36/3.44 BG Taut test : 0.00
%------------------------------------------------------------------------------