TSTP Solution File: FLD009-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD009-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 : 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:26 EDT 2023
% Result : Unsatisfiable 16.98s 7.07s
% Output : CNFRefutation 17.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 22
% Syntax : Number of formulae : 44 ( 11 unt; 12 typ; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 80 ( 41 ~; 39 |; 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 : 42 (; 42 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > less_or_equal > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > b > 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(b,type,
b: $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_249,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_180,axiom,
! [X] :
( defined(multiplicative_inverse(X))
| ~ defined(X)
| sum(additive_identity,X,additive_identity) ),
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_122,axiom,
! [Y,X,Z] :
( product(Y,X,Z)
| ~ product(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_250,axiom,
defined(b),
file(unknown,unknown) ).
tff(f_196,axiom,
! [X,Y] :
( product(X,Y,multiply(X,Y))
| ~ defined(X)
| ~ defined(Y) ),
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(f_255,axiom,
! [X] : ~ product(a,X,b),
file(unknown,unknown) ).
tff(c_58,plain,
~ sum(additive_identity,a,additive_identity),
inference(cnfTransformation,[status(thm)],[f_252]) ).
tff(c_54,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_36,plain,
! [X_54] :
( sum(additive_identity,X_54,additive_identity)
| ~ defined(X_54)
| defined(multiplicative_inverse(X_54)) ),
inference(cnfTransformation,[status(thm)],[f_180]) ).
tff(c_160,plain,
! [X_112] :
( ~ defined(X_112)
| sum(additive_identity,X_112,additive_identity)
| product(multiplicative_inverse(X_112),X_112,multiplicative_identity) ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
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_163,plain,
! [X_112] :
( product(X_112,multiplicative_inverse(X_112),multiplicative_identity)
| ~ defined(X_112)
| sum(additive_identity,X_112,additive_identity) ),
inference(resolution,[status(thm)],[c_160,c_20]) ).
tff(c_56,plain,
defined(b),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_140,plain,
! [Y_104,X_105] :
( ~ defined(Y_104)
| ~ defined(X_105)
| product(X_105,Y_104,multiply(X_105,Y_104)) ),
inference(cnfTransformation,[status(thm)],[f_196]) ).
tff(c_143,plain,
! [Y_104,X_105] :
( product(Y_104,X_105,multiply(X_105,Y_104))
| ~ defined(Y_104)
| ~ defined(X_105) ),
inference(resolution,[status(thm)],[c_140,c_20]) ).
tff(c_16,plain,
! [X_30] :
( ~ defined(X_30)
| product(multiplicative_identity,X_30,X_30) ),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_517,plain,
! [Z_163,X_165,Y_167,U_162,W_164,V_166] :
( ~ product(U_162,Z_163,W_164)
| ~ product(Y_167,Z_163,V_166)
| ~ product(X_165,Y_167,U_162)
| product(X_165,V_166,W_164) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_1695,plain,
! [Y_226,X_227,V_228,X_229] :
( ~ product(Y_226,X_227,V_228)
| ~ product(X_229,Y_226,multiplicative_identity)
| product(X_229,V_228,X_227)
| ~ defined(X_227) ),
inference(resolution,[status(thm)],[c_16,c_517]) ).
tff(c_35928,plain,
! [X_587,Y_588,X_589] :
( ~ product(X_587,Y_588,multiplicative_identity)
| product(X_587,multiply(X_589,Y_588),X_589)
| ~ defined(Y_588)
| ~ defined(X_589) ),
inference(resolution,[status(thm)],[c_143,c_1695]) ).
tff(c_60,plain,
! [X_74] : ~ product(a,X_74,b),
inference(cnfTransformation,[status(thm)],[f_255]) ).
tff(c_35985,plain,
! [Y_588] :
( ~ product(a,Y_588,multiplicative_identity)
| ~ defined(Y_588)
| ~ defined(b) ),
inference(resolution,[status(thm)],[c_35928,c_60]) ).
tff(c_36018,plain,
! [Y_590] :
( ~ product(a,Y_590,multiplicative_identity)
| ~ defined(Y_590) ),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_35985]) ).
tff(c_36050,plain,
( ~ defined(multiplicative_inverse(a))
| ~ defined(a)
| sum(additive_identity,a,additive_identity) ),
inference(resolution,[status(thm)],[c_163,c_36018]) ).
tff(c_36074,plain,
( ~ defined(multiplicative_inverse(a))
| sum(additive_identity,a,additive_identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_36050]) ).
tff(c_36075,plain,
~ defined(multiplicative_inverse(a)),
inference(negUnitSimplification,[status(thm)],[c_58,c_36074]) ).
tff(c_36078,plain,
( sum(additive_identity,a,additive_identity)
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_36,c_36075]) ).
tff(c_36081,plain,
sum(additive_identity,a,additive_identity),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_36078]) ).
tff(c_36083,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_58,c_36081]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD009-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.13/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.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:52:48 EDT 2023
% 0.13/0.35 % CPUTime :
% 16.98/7.07 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.98/7.07
% 16.98/7.07 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 17.09/7.10
% 17.09/7.10 Inference rules
% 17.09/7.10 ----------------------
% 17.09/7.10 #Ref : 0
% 17.09/7.10 #Sup : 8018
% 17.09/7.10 #Fact : 6
% 17.09/7.10 #Define : 0
% 17.09/7.10 #Split : 13
% 17.09/7.10 #Chain : 0
% 17.09/7.10 #Close : 0
% 17.09/7.10
% 17.09/7.10 Ordering : KBO
% 17.09/7.10
% 17.09/7.10 Simplification rules
% 17.09/7.10 ----------------------
% 17.09/7.10 #Subsume : 502
% 17.09/7.10 #Demod : 6021
% 17.09/7.10 #Tautology : 1811
% 17.09/7.10 #SimpNegUnit : 145
% 17.09/7.10 #BackRed : 0
% 17.09/7.10
% 17.09/7.10 #Partial instantiations: 0
% 17.09/7.10 #Strategies tried : 1
% 17.09/7.10
% 17.09/7.10 Timing (in seconds)
% 17.09/7.10 ----------------------
% 17.09/7.10 Preprocessing : 0.49
% 17.09/7.10 Parsing : 0.27
% 17.09/7.10 CNF conversion : 0.03
% 17.09/7.10 Main loop : 5.55
% 17.09/7.10 Inferencing : 1.06
% 17.09/7.11 Reduction : 1.96
% 17.09/7.11 Demodulation : 1.59
% 17.09/7.11 BG Simplification : 0.08
% 17.09/7.11 Subsumption : 2.09
% 17.09/7.11 Abstraction : 0.09
% 17.09/7.11 MUC search : 0.00
% 17.09/7.11 Cooper : 0.00
% 17.09/7.11 Total : 6.10
% 17.09/7.11 Index Insertion : 0.00
% 17.09/7.11 Index Deletion : 0.00
% 17.09/7.11 Index Matching : 0.00
% 17.09/7.11 BG Taut test : 0.00
%------------------------------------------------------------------------------