TSTP Solution File: FLD021-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD021-3 : 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 : n012.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:29 EDT 2023
% Result : Unsatisfiable 7.32s 2.72s
% Output : CNFRefutation 7.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 20
% Syntax : Number of formulae : 42 ( 11 unt; 12 typ; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 75 ( 39 ~; 36 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 1 ( 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 52 (; 52 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > less_or_equal > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > m > additive_identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(m,type,
m: $i ).
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(multiplicative_identity,type,
multiplicative_identity: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(additive_inverse,type,
additive_inverse: $i > $i ).
tff(defined,type,
defined: $i > $o ).
tff(multiplicative_inverse,type,
multiplicative_inverse: $i > $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(f_249,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_251,axiom,
sum(additive_identity,m,additive_identity),
file(unknown,unknown) ).
tff(f_250,axiom,
defined(m),
file(unknown,unknown) ).
tff(f_73,axiom,
! [X] :
( sum(additive_identity,X,X)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_83,axiom,
! [Y,X,Z] :
( sum(Y,X,Z)
| ~ sum(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_68,axiom,
! [W,U,Z,X,Y,V] :
( sum(U,Z,W)
| ~ sum(X,Y,U)
| ~ sum(Y,Z,V)
| ~ sum(X,V,W) ),
file(unknown,unknown) ).
tff(f_57,axiom,
! [W,U,Z,X,Y,V] :
( sum(X,V,W)
| ~ sum(X,Y,U)
| ~ sum(Y,Z,V)
| ~ sum(U,Z,W) ),
file(unknown,unknown) ).
tff(f_253,axiom,
~ sum(m,a,a),
file(unknown,unknown) ).
tff(c_54,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_58,plain,
sum(additive_identity,m,additive_identity),
inference(cnfTransformation,[status(thm)],[f_251]) ).
tff(c_56,plain,
defined(m),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_6,plain,
! [X_13] :
( ~ defined(X_13)
| sum(additive_identity,X_13,X_13) ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_74,plain,
! [X_84,Y_85,Z_86] :
( ~ sum(X_84,Y_85,Z_86)
| sum(Y_85,X_84,Z_86) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_82,plain,
! [X_13] :
( sum(X_13,additive_identity,X_13)
| ~ defined(X_13) ),
inference(resolution,[status(thm)],[c_6,c_74]) ).
tff(c_339,plain,
! [Z_130,W_131,V_133,Y_135,U_132,X_134] :
( ~ sum(X_134,V_133,W_131)
| ~ sum(Y_135,Z_130,V_133)
| ~ sum(X_134,Y_135,U_132)
| sum(U_132,Z_130,W_131) ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_1235,plain,
! [Y_192,Z_193,U_194] :
( ~ sum(Y_192,Z_193,m)
| ~ sum(additive_identity,Y_192,U_194)
| sum(U_194,Z_193,additive_identity) ),
inference(resolution,[status(thm)],[c_58,c_339]) ).
tff(c_1244,plain,
! [U_194] :
( ~ sum(additive_identity,m,U_194)
| sum(U_194,additive_identity,additive_identity)
| ~ defined(m) ),
inference(resolution,[status(thm)],[c_82,c_1235]) ).
tff(c_1256,plain,
! [U_195] :
( ~ sum(additive_identity,m,U_195)
| sum(U_195,additive_identity,additive_identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_1244]) ).
tff(c_1281,plain,
sum(additive_identity,additive_identity,additive_identity),
inference(resolution,[status(thm)],[c_58,c_1256]) ).
tff(c_421,plain,
! [U_142,V_141,W_144,Z_139,X_143,Y_140] :
( ~ sum(U_142,Z_139,W_144)
| ~ sum(Y_140,Z_139,V_141)
| ~ sum(X_143,Y_140,U_142)
| sum(X_143,V_141,W_144) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_3844,plain,
! [Y_242,X_243,V_244,X_245] :
( ~ sum(Y_242,X_243,V_244)
| ~ sum(X_245,Y_242,additive_identity)
| sum(X_245,V_244,X_243)
| ~ defined(X_243) ),
inference(resolution,[status(thm)],[c_6,c_421]) ).
tff(c_3932,plain,
! [X_245] :
( ~ sum(X_245,additive_identity,additive_identity)
| sum(X_245,additive_identity,m)
| ~ defined(m) ),
inference(resolution,[status(thm)],[c_58,c_3844]) ).
tff(c_4042,plain,
! [X_245] :
( ~ sum(X_245,additive_identity,additive_identity)
| sum(X_245,additive_identity,m) ),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_3932]) ).
tff(c_3335,plain,
! [Y_233,Z_234,X_235,U_236] :
( ~ sum(Y_233,Z_234,X_235)
| ~ sum(additive_identity,Y_233,U_236)
| sum(U_236,Z_234,X_235)
| ~ defined(X_235) ),
inference(resolution,[status(thm)],[c_6,c_339]) ).
tff(c_4215,plain,
! [U_248,X_249] :
( ~ sum(additive_identity,additive_identity,U_248)
| sum(U_248,X_249,X_249)
| ~ defined(X_249) ),
inference(resolution,[status(thm)],[c_6,c_3335]) ).
tff(c_4218,plain,
! [X_249] :
( sum(m,X_249,X_249)
| ~ defined(X_249)
| ~ sum(additive_identity,additive_identity,additive_identity) ),
inference(resolution,[status(thm)],[c_4042,c_4215]) ).
tff(c_4693,plain,
! [X_256] :
( sum(m,X_256,X_256)
| ~ defined(X_256) ),
inference(demodulation,[status(thm),theory(equality)],[c_1281,c_4218]) ).
tff(c_60,plain,
~ sum(m,a,a),
inference(cnfTransformation,[status(thm)],[f_253]) ).
tff(c_4735,plain,
~ defined(a),
inference(resolution,[status(thm)],[c_4693,c_60]) ).
tff(c_4768,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_54,c_4735]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD021-3 : 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 : n012.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 19:45:22 EDT 2023
% 0.14/0.36 % CPUTime :
% 7.32/2.72 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.32/2.73
% 7.32/2.73 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.66/2.77
% 7.66/2.77 Inference rules
% 7.66/2.77 ----------------------
% 7.66/2.77 #Ref : 0
% 7.66/2.77 #Sup : 1054
% 7.66/2.77 #Fact : 6
% 7.66/2.77 #Define : 0
% 7.66/2.77 #Split : 7
% 7.66/2.77 #Chain : 0
% 7.66/2.77 #Close : 0
% 7.66/2.77
% 7.66/2.77 Ordering : KBO
% 7.66/2.77
% 7.66/2.77 Simplification rules
% 7.66/2.77 ----------------------
% 7.66/2.77 #Subsume : 125
% 7.66/2.77 #Demod : 825
% 7.66/2.77 #Tautology : 314
% 7.66/2.77 #SimpNegUnit : 2
% 7.66/2.77 #BackRed : 0
% 7.66/2.77
% 7.66/2.77 #Partial instantiations: 0
% 7.66/2.77 #Strategies tried : 1
% 7.66/2.77
% 7.66/2.77 Timing (in seconds)
% 7.66/2.77 ----------------------
% 7.66/2.78 Preprocessing : 0.49
% 7.66/2.78 Parsing : 0.27
% 7.66/2.78 CNF conversion : 0.03
% 7.66/2.78 Main loop : 1.21
% 7.66/2.78 Inferencing : 0.39
% 7.66/2.78 Reduction : 0.37
% 7.66/2.78 Demodulation : 0.27
% 7.66/2.78 BG Simplification : 0.04
% 7.66/2.78 Subsumption : 0.33
% 7.66/2.78 Abstraction : 0.04
% 7.66/2.78 MUC search : 0.00
% 7.66/2.78 Cooper : 0.00
% 7.66/2.78 Total : 1.77
% 7.66/2.78 Index Insertion : 0.00
% 7.66/2.78 Index Deletion : 0.00
% 7.66/2.78 Index Matching : 0.00
% 7.66/2.78 BG Taut test : 0.00
%------------------------------------------------------------------------------