TSTP Solution File: FLD020-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD020-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 : n015.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 9.74s 3.29s
% Output : CNFRefutation 9.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of formulae : 31 ( 9 unt; 12 typ; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 36 ( 19 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 26 (; 26 !; 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_253,axiom,
~ sum(additive_identity,m,additive_identity),
file(unknown,unknown) ).
tff(f_249,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_78,axiom,
! [X] :
( sum(additive_inverse(X),X,additive_identity)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_251,axiom,
sum(m,a,a),
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(c_60,plain,
~ sum(additive_identity,m,additive_identity),
inference(cnfTransformation,[status(thm)],[f_253]) ).
tff(c_54,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_8,plain,
! [X_14] :
( ~ defined(X_14)
| sum(additive_inverse(X_14),X_14,additive_identity) ),
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_58,plain,
sum(m,a,a),
inference(cnfTransformation,[status(thm)],[f_251]) ).
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_83,plain,
sum(a,m,a),
inference(resolution,[status(thm)],[c_58,c_74]) ).
tff(c_2791,plain,
! [X_268,Z_264,W_265,V_267,Y_269,U_266] :
( ~ sum(X_268,V_267,W_265)
| ~ sum(Y_269,Z_264,V_267)
| ~ sum(X_268,Y_269,U_266)
| sum(U_266,Z_264,W_265) ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_6593,plain,
! [Y_382,Z_383,X_384,U_385] :
( ~ sum(Y_382,Z_383,X_384)
| ~ sum(additive_inverse(X_384),Y_382,U_385)
| sum(U_385,Z_383,additive_identity)
| ~ defined(X_384) ),
inference(resolution,[status(thm)],[c_8,c_2791]) ).
tff(c_6671,plain,
! [U_385] :
( ~ sum(additive_inverse(a),a,U_385)
| sum(U_385,m,additive_identity)
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_83,c_6593]) ).
tff(c_8059,plain,
! [U_406] :
( ~ sum(additive_inverse(a),a,U_406)
| sum(U_406,m,additive_identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_6671]) ).
tff(c_8078,plain,
( sum(additive_identity,m,additive_identity)
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_8,c_8059]) ).
tff(c_8089,plain,
sum(additive_identity,m,additive_identity),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_8078]) ).
tff(c_8091,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_60,c_8089]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD020-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.36 % Computer : n015.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 20:17:29 EDT 2023
% 0.14/0.36 % CPUTime :
% 9.74/3.29 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.74/3.29
% 9.74/3.29 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 9.74/3.32
% 9.74/3.32 Inference rules
% 9.74/3.32 ----------------------
% 9.74/3.32 #Ref : 0
% 9.74/3.32 #Sup : 1825
% 9.74/3.32 #Fact : 12
% 9.74/3.32 #Define : 0
% 9.74/3.32 #Split : 22
% 9.74/3.32 #Chain : 0
% 9.74/3.32 #Close : 0
% 9.74/3.32
% 9.74/3.32 Ordering : KBO
% 9.74/3.32
% 9.74/3.32 Simplification rules
% 9.74/3.32 ----------------------
% 9.74/3.32 #Subsume : 274
% 9.74/3.32 #Demod : 1104
% 9.74/3.32 #Tautology : 325
% 9.74/3.32 #SimpNegUnit : 29
% 9.74/3.32 #BackRed : 0
% 9.74/3.32
% 9.74/3.32 #Partial instantiations: 0
% 9.74/3.32 #Strategies tried : 1
% 9.74/3.32
% 9.74/3.32 Timing (in seconds)
% 9.74/3.32 ----------------------
% 9.74/3.32 Preprocessing : 0.50
% 9.74/3.32 Parsing : 0.28
% 9.74/3.32 CNF conversion : 0.03
% 9.74/3.32 Main loop : 1.76
% 9.74/3.32 Inferencing : 0.60
% 9.74/3.32 Reduction : 0.52
% 9.74/3.32 Demodulation : 0.35
% 9.74/3.32 BG Simplification : 0.05
% 9.74/3.32 Subsumption : 0.46
% 9.74/3.32 Abstraction : 0.05
% 9.74/3.32 MUC search : 0.00
% 9.74/3.32 Cooper : 0.00
% 9.74/3.32 Total : 2.30
% 9.74/3.32 Index Insertion : 0.00
% 9.74/3.33 Index Deletion : 0.00
% 9.74/3.33 Index Matching : 0.00
% 9.74/3.33 BG Taut test : 0.00
%------------------------------------------------------------------------------