TSTP Solution File: FLD031-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD031-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 : n023.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 5.00s 2.16s
% Output : CNFRefutation 5.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 19
% Syntax : Number of formulae : 39 ( 11 unt; 11 typ; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 54 ( 27 ~; 27 |; 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 35 (; 35 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > less_or_equal > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > additive_identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
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_252,axiom,
~ sum(additive_identity,a,additive_identity),
file(unknown,unknown) ).
tff(f_254,axiom,
~ product(multiplicative_identity,multiplicative_inverse(a),multiplicative_identity),
file(unknown,unknown) ).
tff(f_249,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_117,axiom,
! [X] :
( product(multiplicative_inverse(X),X,multiplicative_identity)
| sum(additive_identity,X,additive_identity)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_250,axiom,
product(multiplicative_identity,a,multiplicative_identity),
file(unknown,unknown) ).
tff(f_122,axiom,
! [Y,X,Z] :
( product(Y,X,Z)
| ~ product(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_110,axiom,
! [X] :
( product(multiplicative_identity,X,X)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_94,axiom,
! [W,U,Z,X,Y,V] :
( product(X,V,W)
| ~ product(X,Y,U)
| ~ product(Y,Z,V)
| ~ product(U,Z,W) ),
file(unknown,unknown) ).
tff(c_58,plain,
~ sum(additive_identity,a,additive_identity),
inference(cnfTransformation,[status(thm)],[f_252]) ).
tff(c_60,plain,
~ product(multiplicative_identity,multiplicative_inverse(a),multiplicative_identity),
inference(cnfTransformation,[status(thm)],[f_254]) ).
tff(c_54,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_18,plain,
! [X_31] :
( ~ defined(X_31)
| sum(additive_identity,X_31,additive_identity)
| product(multiplicative_inverse(X_31),X_31,multiplicative_identity) ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_56,plain,
product(multiplicative_identity,a,multiplicative_identity),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_66,plain,
! [X_80,Y_81,Z_82] :
( ~ product(X_80,Y_81,Z_82)
| product(Y_81,X_80,Z_82) ),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_72,plain,
product(a,multiplicative_identity,multiplicative_identity),
inference(resolution,[status(thm)],[c_56,c_66]) ).
tff(c_16,plain,
! [X_30] :
( ~ defined(X_30)
| product(multiplicative_identity,X_30,X_30) ),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_975,plain,
! [Y_209,V_208,U_204,Z_205,W_206,X_207] :
( ~ product(U_204,Z_205,W_206)
| ~ product(Y_209,Z_205,V_208)
| ~ product(X_207,Y_209,U_204)
| product(X_207,V_208,W_206) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_1070,plain,
! [Y_217,V_218,X_219] :
( ~ product(Y_217,a,V_218)
| ~ product(X_219,Y_217,multiplicative_identity)
| product(X_219,V_218,multiplicative_identity) ),
inference(resolution,[status(thm)],[c_56,c_975]) ).
tff(c_1084,plain,
! [X_219] :
( ~ product(X_219,multiplicative_identity,multiplicative_identity)
| product(X_219,a,multiplicative_identity)
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_16,c_1070]) ).
tff(c_1102,plain,
! [X_220] :
( ~ product(X_220,multiplicative_identity,multiplicative_identity)
| product(X_220,a,multiplicative_identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_1084]) ).
tff(c_1137,plain,
product(a,a,multiplicative_identity),
inference(resolution,[status(thm)],[c_72,c_1102]) ).
tff(c_1014,plain,
! [Y_209,V_208,X_207] :
( ~ product(Y_209,a,V_208)
| ~ product(X_207,Y_209,multiplicative_identity)
| product(X_207,V_208,multiplicative_identity) ),
inference(resolution,[status(thm)],[c_56,c_975]) ).
tff(c_1284,plain,
! [X_228] :
( ~ product(X_228,a,multiplicative_identity)
| product(X_228,multiplicative_identity,multiplicative_identity) ),
inference(resolution,[status(thm)],[c_1137,c_1014]) ).
tff(c_20,plain,
! [X_33,Y_32,Z_34] :
( ~ product(X_33,Y_32,Z_34)
| product(Y_32,X_33,Z_34) ),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_1312,plain,
! [X_229] :
( product(multiplicative_identity,X_229,multiplicative_identity)
| ~ product(X_229,a,multiplicative_identity) ),
inference(resolution,[status(thm)],[c_1284,c_20]) ).
tff(c_1323,plain,
( product(multiplicative_identity,multiplicative_inverse(a),multiplicative_identity)
| ~ defined(a)
| sum(additive_identity,a,additive_identity) ),
inference(resolution,[status(thm)],[c_18,c_1312]) ).
tff(c_1335,plain,
( product(multiplicative_identity,multiplicative_inverse(a),multiplicative_identity)
| sum(additive_identity,a,additive_identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_1323]) ).
tff(c_1337,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_58,c_60,c_1335]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : FLD031-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/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.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 20:05:52 EDT 2023
% 0.15/0.36 % CPUTime :
% 5.00/2.16 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.00/2.16
% 5.00/2.16 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.00/2.19
% 5.00/2.19 Inference rules
% 5.00/2.19 ----------------------
% 5.00/2.19 #Ref : 0
% 5.00/2.19 #Sup : 309
% 5.00/2.19 #Fact : 2
% 5.00/2.19 #Define : 0
% 5.00/2.19 #Split : 3
% 5.00/2.19 #Chain : 0
% 5.00/2.19 #Close : 0
% 5.00/2.19
% 5.00/2.19 Ordering : KBO
% 5.00/2.19
% 5.00/2.19 Simplification rules
% 5.00/2.19 ----------------------
% 5.00/2.19 #Subsume : 49
% 5.00/2.19 #Demod : 83
% 5.00/2.19 #Tautology : 39
% 5.00/2.19 #SimpNegUnit : 26
% 5.00/2.19 #BackRed : 0
% 5.00/2.19
% 5.00/2.19 #Partial instantiations: 0
% 5.00/2.19 #Strategies tried : 1
% 5.00/2.19
% 5.00/2.19 Timing (in seconds)
% 5.00/2.19 ----------------------
% 5.00/2.19 Preprocessing : 0.50
% 5.00/2.19 Parsing : 0.27
% 5.00/2.19 CNF conversion : 0.03
% 5.00/2.19 Main loop : 0.62
% 5.00/2.19 Inferencing : 0.23
% 5.00/2.19 Reduction : 0.15
% 5.00/2.20 Demodulation : 0.10
% 5.00/2.20 BG Simplification : 0.03
% 5.00/2.20 Subsumption : 0.16
% 5.00/2.20 Abstraction : 0.02
% 5.00/2.20 MUC search : 0.00
% 5.00/2.20 Cooper : 0.00
% 5.00/2.20 Total : 1.16
% 5.00/2.20 Index Insertion : 0.00
% 5.00/2.20 Index Deletion : 0.00
% 5.00/2.20 Index Matching : 0.00
% 5.00/2.20 BG Taut test : 0.00
%------------------------------------------------------------------------------