TSTP Solution File: FLD031-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD031-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 : 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:32 EDT 2023
% Result : Unsatisfiable 103.73s 89.17s
% Output : CNFRefutation 103.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 20
% Syntax : Number of formulae : 50 ( 13 unt; 10 typ; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 98 ( 48 ~; 50 |; 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 : 49 (; 49 !; 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_239,axiom,
~ equalish(a,additive_identity),
file(unknown,unknown) ).
tff(f_236,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_147,axiom,
! [X] :
( defined(multiplicative_inverse(X))
| ~ defined(X)
| equalish(X,additive_identity) ),
file(unknown,unknown) ).
tff(f_241,axiom,
~ equalish(multiplicative_inverse(a),multiplicative_identity),
file(unknown,unknown) ).
tff(f_237,axiom,
equalish(a,multiplicative_identity),
file(unknown,unknown) ).
tff(f_199,axiom,
! [X,Y] :
( equalish(X,Y)
| ~ equalish(Y,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_91,axiom,
! [X] :
( equalish(multiply(multiplicative_identity,X),X)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_223,axiom,
! [X,Z,Y] :
( equalish(multiply(X,Z),multiply(Y,Z))
| ~ defined(Z)
| ~ equalish(X,Y) ),
file(unknown,unknown) ).
tff(f_98,axiom,
! [X] :
( equalish(multiply(X,multiplicative_inverse(X)),multiplicative_identity)
| ~ defined(X)
| equalish(X,additive_identity) ),
file(unknown,unknown) ).
tff(c_60,plain,
~ equalish(a,additive_identity),
inference(cnfTransformation,[status(thm)],[f_239]) ).
tff(c_56,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_236]) ).
tff(c_30,plain,
! [X_23] :
( equalish(X_23,additive_identity)
| ~ defined(X_23)
| defined(multiplicative_inverse(X_23)) ),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_62,plain,
~ equalish(multiplicative_inverse(a),multiplicative_identity),
inference(cnfTransformation,[status(thm)],[f_241]) ).
tff(c_58,plain,
equalish(a,multiplicative_identity),
inference(cnfTransformation,[status(thm)],[f_237]) ).
tff(c_65,plain,
! [Y_53,X_54] :
( ~ equalish(Y_53,X_54)
| equalish(X_54,Y_53) ),
inference(cnfTransformation,[status(thm)],[f_199]) ).
tff(c_71,plain,
equalish(multiplicative_identity,a),
inference(resolution,[status(thm)],[c_58,c_65]) ).
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_253,plain,
! [X_83] :
( ~ equalish(X_83,multiplicative_identity)
| equalish(X_83,a) ),
inference(resolution,[status(thm)],[c_71,c_145]) ).
tff(c_282,plain,
equalish(a,a),
inference(resolution,[status(thm)],[c_58,c_253]) ).
tff(c_76,plain,
! [X_55] :
( ~ defined(X_55)
| equalish(multiply(multiplicative_identity,X_55),X_55) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
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_79,plain,
! [X_55] :
( equalish(X_55,multiply(multiplicative_identity,X_55))
| ~ defined(X_55) ),
inference(resolution,[status(thm)],[c_76,c_44]) ).
tff(c_713,plain,
! [X_103,Y_104,Z_105] :
( ~ equalish(X_103,Y_104)
| ~ defined(Z_105)
| equalish(multiply(X_103,Z_105),multiply(Y_104,Z_105)) ),
inference(cnfTransformation,[status(thm)],[f_223]) ).
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_8562,plain,
! [X_272,X_273,Z_274,Y_275] :
( ~ equalish(X_272,multiply(X_273,Z_274))
| equalish(X_272,multiply(Y_275,Z_274))
| ~ equalish(X_273,Y_275)
| ~ defined(Z_274) ),
inference(resolution,[status(thm)],[c_713,c_46]) ).
tff(c_8767,plain,
! [X_55,Y_275] :
( equalish(X_55,multiply(Y_275,X_55))
| ~ equalish(multiplicative_identity,Y_275)
| ~ defined(X_55) ),
inference(resolution,[status(thm)],[c_79,c_8562]) ).
tff(c_2964,plain,
! [Y_170,Z_171,X_172] :
( equalish(multiply(Y_170,Z_171),multiply(X_172,Z_171))
| ~ equalish(X_172,Y_170)
| ~ defined(Z_171) ),
inference(resolution,[status(thm)],[c_713,c_44]) ).
tff(c_64441,plain,
! [X_785,Y_786,Z_787,X_788] :
( ~ equalish(X_785,multiply(Y_786,Z_787))
| equalish(X_785,multiply(X_788,Z_787))
| ~ equalish(X_788,Y_786)
| ~ defined(Z_787) ),
inference(resolution,[status(thm)],[c_2964,c_46]) ).
tff(c_262947,plain,
! [X_1618,X_1619,Y_1620] :
( equalish(X_1618,multiply(X_1619,X_1618))
| ~ equalish(X_1619,Y_1620)
| ~ equalish(multiplicative_identity,Y_1620)
| ~ defined(X_1618) ),
inference(resolution,[status(thm)],[c_8767,c_64441]) ).
tff(c_264177,plain,
! [X_1618] :
( equalish(X_1618,multiply(a,X_1618))
| ~ equalish(multiplicative_identity,a)
| ~ defined(X_1618) ),
inference(resolution,[status(thm)],[c_282,c_262947]) ).
tff(c_265481,plain,
! [X_1621] :
( equalish(X_1621,multiply(a,X_1621))
| ~ defined(X_1621) ),
inference(demodulation,[status(thm),theory(equality)],[c_71,c_264177]) ).
tff(c_331,plain,
! [X_86] :
( equalish(X_86,additive_identity)
| ~ defined(X_86)
| equalish(multiply(X_86,multiplicative_inverse(X_86)),multiplicative_identity) ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_342,plain,
! [X_39,X_86] :
( ~ equalish(X_39,multiply(X_86,multiplicative_inverse(X_86)))
| equalish(X_39,multiplicative_identity)
| equalish(X_86,additive_identity)
| ~ defined(X_86) ),
inference(resolution,[status(thm)],[c_331,c_46]) ).
tff(c_265694,plain,
( equalish(multiplicative_inverse(a),multiplicative_identity)
| equalish(a,additive_identity)
| ~ defined(a)
| ~ defined(multiplicative_inverse(a)) ),
inference(resolution,[status(thm)],[c_265481,c_342]) ).
tff(c_265856,plain,
( equalish(multiplicative_inverse(a),multiplicative_identity)
| equalish(a,additive_identity)
| ~ defined(multiplicative_inverse(a)) ),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_265694]) ).
tff(c_265857,plain,
~ defined(multiplicative_inverse(a)),
inference(negUnitSimplification,[status(thm)],[c_60,c_62,c_265856]) ).
tff(c_265866,plain,
( equalish(a,additive_identity)
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_30,c_265857]) ).
tff(c_265869,plain,
equalish(a,additive_identity),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_265866]) ).
tff(c_265871,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_60,c_265869]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD031-1 : 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.15/0.35 % Computer : n014.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 19:49:03 EDT 2023
% 0.15/0.35 % CPUTime :
% 103.73/89.17 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 103.73/89.18
% 103.73/89.18 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 103.77/89.21
% 103.77/89.21 Inference rules
% 103.77/89.21 ----------------------
% 103.77/89.21 #Ref : 0
% 103.77/89.21 #Sup : 54086
% 103.77/89.21 #Fact : 24
% 103.77/89.21 #Define : 0
% 103.77/89.21 #Split : 21
% 103.77/89.21 #Chain : 0
% 103.77/89.21 #Close : 0
% 103.77/89.21
% 103.77/89.21 Ordering : KBO
% 103.77/89.21
% 103.77/89.21 Simplification rules
% 103.77/89.21 ----------------------
% 103.77/89.21 #Subsume : 14638
% 103.77/89.21 #Demod : 35962
% 103.77/89.21 #Tautology : 11193
% 103.77/89.21 #SimpNegUnit : 2241
% 103.77/89.21 #BackRed : 0
% 103.77/89.21
% 103.77/89.21 #Partial instantiations: 0
% 103.77/89.21 #Strategies tried : 1
% 103.77/89.21
% 103.77/89.21 Timing (in seconds)
% 103.77/89.21 ----------------------
% 103.77/89.21 Preprocessing : 0.50
% 103.77/89.22 Parsing : 0.28
% 103.77/89.22 CNF conversion : 0.03
% 103.77/89.22 Main loop : 87.54
% 103.77/89.22 Inferencing : 7.69
% 103.77/89.22 Reduction : 40.52
% 103.77/89.22 Demodulation : 32.31
% 103.77/89.22 BG Simplification : 0.22
% 103.77/89.22 Subsumption : 33.04
% 103.77/89.22 Abstraction : 0.42
% 103.77/89.22 MUC search : 0.00
% 103.77/89.22 Cooper : 0.00
% 103.77/89.22 Total : 88.10
% 103.77/89.22 Index Insertion : 0.00
% 103.77/89.22 Index Deletion : 0.00
% 103.77/89.22 Index Matching : 0.00
% 103.77/89.22 BG Taut test : 0.00
%------------------------------------------------------------------------------