TSTP Solution File: FLD060-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD060-4 : 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 : n021.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:39 EDT 2023
% Result : Unsatisfiable 208.07s 186.64s
% Output : CNFRefutation 208.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 24
% Syntax : Number of formulae : 46 ( 14 unt; 14 typ; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 86 ( 44 ~; 42 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 10 ( 10 usr; 6 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 > v > u > 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(u,type,
u: $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(v,type,
v: $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(f_257,axiom,
~ less_or_equal(u,v),
file(unknown,unknown) ).
tff(f_250,axiom,
defined(b),
file(unknown,unknown) ).
tff(f_253,axiom,
less_or_equal(a,b),
file(unknown,unknown) ).
tff(f_249,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_254,axiom,
sum(a,a,u),
file(unknown,unknown) ).
tff(f_188,axiom,
! [X,Y] :
( sum(X,Y,add(X,Y))
| ~ defined(X)
| ~ defined(Y) ),
file(unknown,unknown) ).
tff(f_233,axiom,
! [U,Z,X,Y,V] :
( less_or_equal(U,V)
| ~ less_or_equal(X,Y)
| ~ sum(X,Z,U)
| ~ sum(Y,Z,V) ),
file(unknown,unknown) ).
tff(f_83,axiom,
! [Y,X,Z] :
( sum(Y,X,Z)
| ~ sum(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_255,axiom,
sum(b,b,v),
file(unknown,unknown) ).
tff(f_212,axiom,
! [X,Z,Y] :
( less_or_equal(X,Z)
| ~ less_or_equal(X,Y)
| ~ less_or_equal(Y,Z) ),
file(unknown,unknown) ).
tff(c_68,plain,
~ less_or_equal(u,v),
inference(cnfTransformation,[status(thm)],[f_257]) ).
tff(c_56,plain,
defined(b),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_62,plain,
less_or_equal(a,b),
inference(cnfTransformation,[status(thm)],[f_253]) ).
tff(c_54,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_64,plain,
sum(a,a,u),
inference(cnfTransformation,[status(thm)],[f_254]) ).
tff(c_38,plain,
! [Y_56,X_55] :
( ~ defined(Y_56)
| ~ defined(X_55)
| sum(X_55,Y_56,add(X_55,Y_56)) ),
inference(cnfTransformation,[status(thm)],[f_188]) ).
tff(c_322,plain,
! [V_130,X_127,Y_129,Z_128,U_126] :
( ~ sum(Y_129,Z_128,V_130)
| ~ sum(X_127,Z_128,U_126)
| ~ less_or_equal(X_127,Y_129)
| less_or_equal(U_126,V_130) ),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_27743,plain,
! [X_703,Y_704,U_705,X_706] :
( ~ sum(X_703,Y_704,U_705)
| ~ less_or_equal(X_703,X_706)
| less_or_equal(U_705,add(X_706,Y_704))
| ~ defined(Y_704)
| ~ defined(X_706) ),
inference(resolution,[status(thm)],[c_38,c_322]) ).
tff(c_27853,plain,
! [X_706] :
( ~ less_or_equal(a,X_706)
| less_or_equal(u,add(X_706,a))
| ~ defined(a)
| ~ defined(X_706) ),
inference(resolution,[status(thm)],[c_64,c_27743]) ).
tff(c_27978,plain,
! [X_706] :
( ~ less_or_equal(a,X_706)
| less_or_equal(u,add(X_706,a))
| ~ defined(X_706) ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_27853]) ).
tff(c_159,plain,
! [Y_101,X_102] :
( ~ defined(Y_101)
| ~ defined(X_102)
| sum(X_102,Y_101,add(X_102,Y_101)) ),
inference(cnfTransformation,[status(thm)],[f_188]) ).
tff(c_10,plain,
! [X_16,Y_15,Z_17] :
( ~ sum(X_16,Y_15,Z_17)
| sum(Y_15,X_16,Z_17) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_162,plain,
! [Y_101,X_102] :
( sum(Y_101,X_102,add(X_102,Y_101))
| ~ defined(Y_101)
| ~ defined(X_102) ),
inference(resolution,[status(thm)],[c_159,c_10]) ).
tff(c_66,plain,
sum(b,b,v),
inference(cnfTransformation,[status(thm)],[f_255]) ).
tff(c_353,plain,
! [X_131,U_132] :
( ~ sum(X_131,b,U_132)
| ~ less_or_equal(X_131,b)
| less_or_equal(U_132,v) ),
inference(resolution,[status(thm)],[c_66,c_322]) ).
tff(c_357,plain,
! [Y_101] :
( ~ less_or_equal(Y_101,b)
| less_or_equal(add(b,Y_101),v)
| ~ defined(Y_101)
| ~ defined(b) ),
inference(resolution,[status(thm)],[c_162,c_353]) ).
tff(c_154164,plain,
! [Y_1740] :
( ~ less_or_equal(Y_1740,b)
| less_or_equal(add(b,Y_1740),v)
| ~ defined(Y_1740) ),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_357]) ).
tff(c_44,plain,
! [Y_63,Z_62,X_61] :
( ~ less_or_equal(Y_63,Z_62)
| ~ less_or_equal(X_61,Y_63)
| less_or_equal(X_61,Z_62) ),
inference(cnfTransformation,[status(thm)],[f_212]) ).
tff(c_437813,plain,
! [X_3025,Y_3026] :
( ~ less_or_equal(X_3025,add(b,Y_3026))
| less_or_equal(X_3025,v)
| ~ less_or_equal(Y_3026,b)
| ~ defined(Y_3026) ),
inference(resolution,[status(thm)],[c_154164,c_44]) ).
tff(c_437924,plain,
( less_or_equal(u,v)
| ~ defined(a)
| ~ less_or_equal(a,b)
| ~ defined(b) ),
inference(resolution,[status(thm)],[c_27978,c_437813]) ).
tff(c_438026,plain,
less_or_equal(u,v),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_62,c_54,c_437924]) ).
tff(c_438028,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_68,c_438026]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD060-4 : 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 : n021.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 19:55:21 EDT 2023
% 0.13/0.35 % CPUTime :
% 208.07/186.64 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 208.07/186.65
% 208.07/186.65 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 208.07/186.68
% 208.07/186.68 Inference rules
% 208.07/186.68 ----------------------
% 208.07/186.68 #Ref : 0
% 208.07/186.68 #Sup : 95150
% 208.07/186.68 #Fact : 40
% 208.07/186.68 #Define : 0
% 208.07/186.68 #Split : 249
% 208.07/186.68 #Chain : 0
% 208.07/186.68 #Close : 0
% 208.07/186.68
% 208.07/186.68 Ordering : KBO
% 208.07/186.68
% 208.07/186.68 Simplification rules
% 208.07/186.68 ----------------------
% 208.07/186.68 #Subsume : 25088
% 208.07/186.68 #Demod : 69454
% 208.07/186.68 #Tautology : 14356
% 208.07/186.68 #SimpNegUnit : 4236
% 208.07/186.68 #BackRed : 0
% 208.07/186.68
% 208.07/186.68 #Partial instantiations: 0
% 208.07/186.68 #Strategies tried : 1
% 208.07/186.68
% 208.07/186.68 Timing (in seconds)
% 208.07/186.68 ----------------------
% 208.07/186.68 Preprocessing : 0.50
% 208.07/186.68 Parsing : 0.27
% 208.07/186.68 CNF conversion : 0.03
% 208.07/186.68 Main loop : 185.13
% 208.07/186.68 Inferencing : 14.40
% 208.07/186.68 Reduction : 101.21
% 208.07/186.68 Demodulation : 84.73
% 208.07/186.68 BG Simplification : 0.40
% 208.07/186.68 Subsumption : 52.52
% 208.07/186.68 Abstraction : 0.71
% 208.07/186.68 MUC search : 0.00
% 208.07/186.68 Cooper : 0.00
% 208.07/186.68 Total : 185.68
% 208.07/186.68 Index Insertion : 0.00
% 208.07/186.68 Index Deletion : 0.00
% 208.07/186.68 Index Matching : 0.00
% 208.07/186.68 BG Taut test : 0.00
%------------------------------------------------------------------------------