TSTP Solution File: FLD018-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD018-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/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 : 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:29 EDT 2023
% Result : Unsatisfiable 72.36s 58.19s
% Output : CNFRefutation 72.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 19
% Syntax : Number of formulae : 40 ( 10 unt; 10 typ; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 69 ( 37 ~; 32 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 37 (; 37 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less_or_equal > equalish > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > additive_identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
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_131,axiom,
! [X] :
( defined(additive_inverse(X))
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_237,axiom,
equalish(a,additive_identity),
file(unknown,unknown) ).
tff(f_199,axiom,
! [X,Y] :
( equalish(X,Y)
| ~ equalish(Y,X) ),
file(unknown,unknown) ).
tff(f_62,axiom,
! [X] :
( equalish(add(additive_identity,X),X)
| ~ defined(X) ),
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_207,axiom,
! [X,Z,Y] :
( equalish(X,Z)
| ~ equalish(X,Y)
| ~ equalish(Y,Z) ),
file(unknown,unknown) ).
tff(f_67,axiom,
! [X] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_239,axiom,
~ equalish(additive_inverse(a),additive_identity),
file(unknown,unknown) ).
tff(c_56,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_236]) ).
tff(c_24,plain,
! [X_20] :
( ~ defined(X_20)
| defined(additive_inverse(X_20)) ),
inference(cnfTransformation,[status(thm)],[f_131]) ).
tff(c_58,plain,
equalish(a,additive_identity),
inference(cnfTransformation,[status(thm)],[f_237]) ).
tff(c_63,plain,
! [Y_53,X_54] :
( ~ equalish(Y_53,X_54)
| equalish(X_54,Y_53) ),
inference(cnfTransformation,[status(thm)],[f_199]) ).
tff(c_69,plain,
equalish(additive_identity,a),
inference(resolution,[status(thm)],[c_58,c_63]) ).
tff(c_70,plain,
! [X_55] :
( ~ defined(X_55)
| equalish(add(additive_identity,X_55),X_55) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_44,plain,
! [Y_38,X_37] :
( ~ equalish(Y_38,X_37)
| equalish(X_37,Y_38) ),
inference(cnfTransformation,[status(thm)],[f_199]) ).
tff(c_73,plain,
! [X_55] :
( equalish(X_55,add(additive_identity,X_55))
| ~ defined(X_55) ),
inference(resolution,[status(thm)],[c_70,c_44]) ).
tff(c_801,plain,
! [X_106,Y_107,Z_108] :
( ~ equalish(X_106,Y_107)
| ~ defined(Z_108)
| equalish(add(X_106,Z_108),add(Y_107,Z_108)) ),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_46,plain,
! [Y_41,Z_40,X_39] :
( ~ equalish(Y_41,Z_40)
| ~ equalish(X_39,Y_41)
| equalish(X_39,Z_40) ),
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_9314,plain,
! [X_287,X_288,Z_289,Y_290] :
( ~ equalish(X_287,add(X_288,Z_289))
| equalish(X_287,add(Y_290,Z_289))
| ~ equalish(X_288,Y_290)
| ~ defined(Z_289) ),
inference(resolution,[status(thm)],[c_801,c_46]) ).
tff(c_22824,plain,
! [X_451,Y_452] :
( equalish(X_451,add(Y_452,X_451))
| ~ equalish(additive_identity,Y_452)
| ~ defined(X_451) ),
inference(resolution,[status(thm)],[c_73,c_9314]) ).
tff(c_6,plain,
! [X_5] :
( ~ defined(X_5)
| equalish(add(X_5,additive_inverse(X_5)),additive_identity) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_101,plain,
! [Y_66,Z_67,X_68] :
( ~ equalish(Y_66,Z_67)
| ~ equalish(X_68,Y_66)
| equalish(X_68,Z_67) ),
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_121,plain,
! [X_68,X_5] :
( ~ equalish(X_68,add(X_5,additive_inverse(X_5)))
| equalish(X_68,additive_identity)
| ~ defined(X_5) ),
inference(resolution,[status(thm)],[c_6,c_101]) ).
tff(c_195061,plain,
! [Y_1354] :
( equalish(additive_inverse(Y_1354),additive_identity)
| ~ defined(Y_1354)
| ~ equalish(additive_identity,Y_1354)
| ~ defined(additive_inverse(Y_1354)) ),
inference(resolution,[status(thm)],[c_22824,c_121]) ).
tff(c_60,plain,
~ equalish(additive_inverse(a),additive_identity),
inference(cnfTransformation,[status(thm)],[f_239]) ).
tff(c_195140,plain,
( ~ defined(a)
| ~ equalish(additive_identity,a)
| ~ defined(additive_inverse(a)) ),
inference(resolution,[status(thm)],[c_195061,c_60]) ).
tff(c_195195,plain,
~ defined(additive_inverse(a)),
inference(demodulation,[status(thm),theory(equality)],[c_69,c_56,c_195140]) ).
tff(c_195198,plain,
~ defined(a),
inference(resolution,[status(thm)],[c_24,c_195195]) ).
tff(c_195202,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_56,c_195198]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD018-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/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.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 19:47:43 EDT 2023
% 0.13/0.35 % CPUTime :
% 72.36/58.19 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 72.36/58.19
% 72.36/58.19 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 72.36/58.22
% 72.36/58.22 Inference rules
% 72.36/58.22 ----------------------
% 72.36/58.22 #Ref : 0
% 72.36/58.22 #Sup : 41101
% 72.36/58.23 #Fact : 16
% 72.36/58.23 #Define : 0
% 72.36/58.23 #Split : 16
% 72.36/58.23 #Chain : 0
% 72.36/58.23 #Close : 0
% 72.36/58.23
% 72.36/58.23 Ordering : KBO
% 72.36/58.23
% 72.36/58.23 Simplification rules
% 72.36/58.23 ----------------------
% 72.36/58.23 #Subsume : 9153
% 72.36/58.23 #Demod : 26395
% 72.36/58.23 #Tautology : 8949
% 72.36/58.23 #SimpNegUnit : 1542
% 72.36/58.23 #BackRed : 0
% 72.36/58.23
% 72.36/58.23 #Partial instantiations: 0
% 72.36/58.23 #Strategies tried : 1
% 72.36/58.23
% 72.36/58.23 Timing (in seconds)
% 72.36/58.23 ----------------------
% 72.36/58.23 Preprocessing : 0.51
% 72.36/58.23 Parsing : 0.29
% 72.36/58.23 CNF conversion : 0.03
% 72.36/58.23 Main loop : 56.71
% 72.36/58.23 Inferencing : 5.31
% 72.36/58.23 Reduction : 26.13
% 72.36/58.23 Demodulation : 21.47
% 72.36/58.23 BG Simplification : 0.19
% 72.36/58.23 Subsumption : 21.88
% 72.36/58.23 Abstraction : 0.32
% 72.36/58.23 MUC search : 0.00
% 72.36/58.23 Cooper : 0.00
% 72.36/58.23 Total : 57.28
% 72.36/58.23 Index Insertion : 0.00
% 72.36/58.23 Index Deletion : 0.00
% 72.36/58.23 Index Matching : 0.00
% 72.36/58.23 BG Taut test : 0.00
%------------------------------------------------------------------------------