TSTP Solution File: FLD058-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD058-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 : n012.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:38 EDT 2023
% Result : Unsatisfiable 4.18s 2.09s
% Output : CNFRefutation 4.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 23
% Syntax : Number of formulae : 47 ( 19 unt; 12 typ; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 64 ( 34 ~; 30 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 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 : 30 (; 30 !; 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_251,axiom,
less_or_equal(additive_identity,a),
file(unknown,unknown) ).
tff(f_204,axiom,
! [X,Y] :
( sum(additive_identity,X,Y)
| ~ less_or_equal(X,Y)
| ~ less_or_equal(Y,X) ),
file(unknown,unknown) ).
tff(f_254,axiom,
~ sum(additive_identity,a,additive_identity),
file(unknown,unknown) ).
tff(f_252,axiom,
less_or_equal(a,b),
file(unknown,unknown) ).
tff(f_159,axiom,
defined(additive_identity),
file(unknown,unknown) ).
tff(f_222,axiom,
! [X,Y] :
( less_or_equal(X,Y)
| less_or_equal(Y,X)
| ~ defined(X)
| ~ defined(Y) ),
file(unknown,unknown) ).
tff(f_250,axiom,
defined(b),
file(unknown,unknown) ).
tff(f_73,axiom,
! [X] :
( sum(additive_identity,X,X)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_255,axiom,
sum(additive_identity,b,additive_identity),
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_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_58,plain,
less_or_equal(additive_identity,a),
inference(cnfTransformation,[status(thm)],[f_251]) ).
tff(c_236,plain,
! [Y_107,X_108] :
( ~ less_or_equal(Y_107,X_108)
| ~ less_or_equal(X_108,Y_107)
| sum(additive_identity,X_108,Y_107) ),
inference(cnfTransformation,[status(thm)],[f_204]) ).
tff(c_62,plain,
~ sum(additive_identity,a,additive_identity),
inference(cnfTransformation,[status(thm)],[f_254]) ).
tff(c_241,plain,
( ~ less_or_equal(additive_identity,a)
| ~ less_or_equal(a,additive_identity) ),
inference(resolution,[status(thm)],[c_236,c_62]) ).
tff(c_248,plain,
~ less_or_equal(a,additive_identity),
inference(demodulation,[status(thm),theory(equality)],[c_58,c_241]) ).
tff(c_60,plain,
less_or_equal(a,b),
inference(cnfTransformation,[status(thm)],[f_252]) ).
tff(c_28,plain,
defined(additive_identity),
inference(cnfTransformation,[status(thm)],[f_159]) ).
tff(c_46,plain,
! [Y_65,X_64] :
( ~ defined(Y_65)
| ~ defined(X_64)
| less_or_equal(Y_65,X_64)
| less_or_equal(X_64,Y_65) ),
inference(cnfTransformation,[status(thm)],[f_222]) ).
tff(c_263,plain,
! [Y_65] :
( ~ defined(Y_65)
| less_or_equal(Y_65,Y_65) ),
inference(factorization,[status(thm),theory(equality)],[c_46]) ).
tff(c_56,plain,
defined(b),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_6,plain,
! [X_13] :
( ~ defined(X_13)
| sum(additive_identity,X_13,X_13) ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_64,plain,
sum(additive_identity,b,additive_identity),
inference(cnfTransformation,[status(thm)],[f_255]) ).
tff(c_779,plain,
! [Z_142,X_141,U_140,Y_143,V_144] :
( ~ sum(Y_143,Z_142,V_144)
| ~ sum(X_141,Z_142,U_140)
| ~ less_or_equal(X_141,Y_143)
| less_or_equal(U_140,V_144) ),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_810,plain,
! [X_145,U_146] :
( ~ sum(X_145,b,U_146)
| ~ less_or_equal(X_145,additive_identity)
| less_or_equal(U_146,additive_identity) ),
inference(resolution,[status(thm)],[c_64,c_779]) ).
tff(c_830,plain,
( ~ less_or_equal(additive_identity,additive_identity)
| less_or_equal(b,additive_identity)
| ~ defined(b) ),
inference(resolution,[status(thm)],[c_6,c_810]) ).
tff(c_846,plain,
( ~ less_or_equal(additive_identity,additive_identity)
| less_or_equal(b,additive_identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_830]) ).
tff(c_848,plain,
~ less_or_equal(additive_identity,additive_identity),
inference(splitLeft,[status(thm)],[c_846]) ).
tff(c_855,plain,
~ defined(additive_identity),
inference(resolution,[status(thm)],[c_263,c_848]) ).
tff(c_864,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_855]) ).
tff(c_865,plain,
less_or_equal(b,additive_identity),
inference(splitRight,[status(thm)],[c_846]) ).
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_1027,plain,
! [X_153] :
( ~ less_or_equal(X_153,b)
| less_or_equal(X_153,additive_identity) ),
inference(resolution,[status(thm)],[c_865,c_44]) ).
tff(c_1068,plain,
less_or_equal(a,additive_identity),
inference(resolution,[status(thm)],[c_60,c_1027]) ).
tff(c_1089,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_248,c_1068]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD058-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/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.14/0.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 19:45:37 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.18/2.09 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.18/2.10
% 4.18/2.10 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.18/2.13
% 4.18/2.13 Inference rules
% 4.18/2.13 ----------------------
% 4.18/2.13 #Ref : 0
% 4.18/2.13 #Sup : 217
% 4.18/2.13 #Fact : 6
% 4.18/2.13 #Define : 0
% 4.18/2.13 #Split : 3
% 4.18/2.13 #Chain : 0
% 4.18/2.13 #Close : 0
% 4.18/2.13
% 4.18/2.13 Ordering : KBO
% 4.18/2.13
% 4.18/2.13 Simplification rules
% 4.18/2.13 ----------------------
% 4.18/2.13 #Subsume : 62
% 4.18/2.13 #Demod : 155
% 4.18/2.13 #Tautology : 46
% 4.18/2.13 #SimpNegUnit : 3
% 4.18/2.13 #BackRed : 0
% 4.18/2.13
% 4.18/2.13 #Partial instantiations: 0
% 4.18/2.13 #Strategies tried : 1
% 4.18/2.13
% 4.18/2.13 Timing (in seconds)
% 4.18/2.13 ----------------------
% 4.18/2.13 Preprocessing : 0.49
% 4.18/2.13 Parsing : 0.27
% 4.18/2.13 CNF conversion : 0.03
% 4.18/2.13 Main loop : 0.52
% 4.18/2.13 Inferencing : 0.20
% 4.18/2.14 Reduction : 0.13
% 4.18/2.14 Demodulation : 0.09
% 4.18/2.14 BG Simplification : 0.03
% 4.18/2.14 Subsumption : 0.13
% 4.18/2.14 Abstraction : 0.02
% 4.18/2.14 MUC search : 0.00
% 4.18/2.14 Cooper : 0.00
% 4.18/2.14 Total : 1.07
% 4.18/2.14 Index Insertion : 0.00
% 4.18/2.14 Index Deletion : 0.00
% 4.18/2.14 Index Matching : 0.00
% 4.18/2.14 BG Taut test : 0.00
%------------------------------------------------------------------------------