TSTP Solution File: FLD021-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD021-1 : 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 : n014.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 12.54s 4.33s
% Output : CNFRefutation 12.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 17
% Syntax : Number of formulae : 27 ( 7 unt; 11 typ; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 33 ( 18 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 7 >; 4 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 18 (; 18 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less_or_equal > equalish > 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(less_or_equal,type,
less_or_equal: ( $i * $i ) > $o ).
tff(a,type,
a: $i ).
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(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(f_236,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_238,axiom,
equalish(m,additive_identity),
file(unknown,unknown) ).
tff(f_215,axiom,
! [X,Z,Y] :
( equalish(add(X,Z),add(Y,Z))
| ~ defined(Z)
| ~ equalish(X,Y) ),
file(unknown,unknown) ).
tff(f_62,axiom,
! [X] :
( equalish(add(additive_identity,X),X)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_207,axiom,
! [X,Z,Y] :
( equalish(X,Z)
| ~ equalish(X,Y)
| ~ equalish(Y,Z) ),
file(unknown,unknown) ).
tff(f_240,axiom,
~ equalish(add(m,a),a),
file(unknown,unknown) ).
tff(c_56,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_236]) ).
tff(c_60,plain,
equalish(m,additive_identity),
inference(cnfTransformation,[status(thm)],[f_238]) ).
tff(c_48,plain,
! [X_42,Y_44,Z_43] :
( ~ equalish(X_42,Y_44)
| ~ defined(Z_43)
| equalish(add(X_42,Z_43),add(Y_44,Z_43)) ),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_4,plain,
! [X_4] :
( ~ defined(X_4)
| equalish(add(additive_identity,X_4),X_4) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_145,plain,
! [Y_76,Z_77,X_78] :
( ~ equalish(Y_76,Z_77)
| ~ equalish(X_78,Y_76)
| equalish(X_78,Z_77) ),
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_1733,plain,
! [X_153,X_154] :
( ~ equalish(X_153,add(additive_identity,X_154))
| equalish(X_153,X_154)
| ~ defined(X_154) ),
inference(resolution,[status(thm)],[c_4,c_145]) ).
tff(c_17843,plain,
! [X_413,Z_414] :
( equalish(add(X_413,Z_414),Z_414)
| ~ equalish(X_413,additive_identity)
| ~ defined(Z_414) ),
inference(resolution,[status(thm)],[c_48,c_1733]) ).
tff(c_62,plain,
~ equalish(add(m,a),a),
inference(cnfTransformation,[status(thm)],[f_240]) ).
tff(c_17971,plain,
( ~ equalish(m,additive_identity)
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_17843,c_62]) ).
tff(c_18030,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_56,c_60,c_17971]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD021-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13 % 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.13/0.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 19:47:33 EDT 2023
% 0.13/0.35 % CPUTime :
% 12.54/4.33 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.54/4.33
% 12.54/4.33 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 12.54/4.36
% 12.54/4.36 Inference rules
% 12.54/4.36 ----------------------
% 12.54/4.36 #Ref : 0
% 12.54/4.36 #Sup : 3502
% 12.54/4.36 #Fact : 6
% 12.54/4.36 #Define : 0
% 12.54/4.36 #Split : 7
% 12.54/4.36 #Chain : 0
% 12.54/4.36 #Close : 0
% 12.54/4.36
% 12.54/4.36 Ordering : KBO
% 12.54/4.36
% 12.54/4.36 Simplification rules
% 12.54/4.36 ----------------------
% 12.54/4.36 #Subsume : 442
% 12.54/4.36 #Demod : 2911
% 12.54/4.36 #Tautology : 1450
% 12.54/4.36 #SimpNegUnit : 55
% 12.54/4.36 #BackRed : 0
% 12.54/4.36
% 12.54/4.36 #Partial instantiations: 0
% 12.54/4.36 #Strategies tried : 1
% 12.54/4.36
% 12.54/4.36 Timing (in seconds)
% 12.54/4.36 ----------------------
% 12.54/4.36 Preprocessing : 0.49
% 12.54/4.36 Parsing : 0.26
% 12.54/4.36 CNF conversion : 0.03
% 12.54/4.36 Main loop : 2.82
% 12.54/4.36 Inferencing : 0.85
% 12.54/4.36 Reduction : 0.92
% 12.54/4.37 Demodulation : 0.67
% 12.54/4.37 BG Simplification : 0.05
% 12.54/4.37 Subsumption : 0.83
% 12.54/4.37 Abstraction : 0.05
% 12.54/4.37 MUC search : 0.00
% 12.54/4.37 Cooper : 0.00
% 12.54/4.37 Total : 3.35
% 12.54/4.37 Index Insertion : 0.00
% 12.54/4.37 Index Deletion : 0.00
% 12.54/4.37 Index Matching : 0.00
% 12.54/4.37 BG Taut test : 0.00
%------------------------------------------------------------------------------