TSTP Solution File: FLD055-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD055-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/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 : n002.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 3.87s 1.94s
% Output : CNFRefutation 4.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 22
% Syntax : Number of formulae : 42 ( 16 unt; 13 typ; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 53 ( 28 ~; 25 |; 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 : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 26 (; 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > less_or_equal > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > c > 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(c,type,
c: $i ).
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_253,axiom,
sum(additive_identity,b,c),
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(f_255,axiom,
~ less_or_equal(a,c),
file(unknown,unknown) ).
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_147,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_62,plain,
sum(additive_identity,b,c),
inference(cnfTransformation,[status(thm)],[f_253]) ).
tff(c_226,plain,
! [X_119,V_122,U_118,Y_121,Z_120] :
( ~ sum(Y_121,Z_120,V_122)
| ~ sum(X_119,Z_120,U_118)
| ~ less_or_equal(X_119,Y_121)
| less_or_equal(U_118,V_122) ),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_257,plain,
! [X_123,U_124] :
( ~ sum(X_123,b,U_124)
| ~ less_or_equal(X_123,additive_identity)
| less_or_equal(U_124,c) ),
inference(resolution,[status(thm)],[c_62,c_226]) ).
tff(c_277,plain,
( ~ less_or_equal(additive_identity,additive_identity)
| less_or_equal(b,c)
| ~ defined(b) ),
inference(resolution,[status(thm)],[c_6,c_257]) ).
tff(c_293,plain,
( ~ less_or_equal(additive_identity,additive_identity)
| less_or_equal(b,c) ),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_277]) ).
tff(c_295,plain,
~ less_or_equal(additive_identity,additive_identity),
inference(splitLeft,[status(thm)],[c_293]) ).
tff(c_298,plain,
~ defined(additive_identity),
inference(resolution,[status(thm)],[c_147,c_295]) ).
tff(c_304,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_298]) ).
tff(c_305,plain,
less_or_equal(b,c),
inference(splitRight,[status(thm)],[c_293]) ).
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_358,plain,
! [X_131] :
( ~ less_or_equal(X_131,b)
| less_or_equal(X_131,c) ),
inference(resolution,[status(thm)],[c_305,c_44]) ).
tff(c_64,plain,
~ less_or_equal(a,c),
inference(cnfTransformation,[status(thm)],[f_255]) ).
tff(c_365,plain,
~ less_or_equal(a,b),
inference(resolution,[status(thm)],[c_358,c_64]) ).
tff(c_371,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_60,c_365]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD055-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/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.35 % Computer : n002.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 20:01:46 EDT 2023
% 0.13/0.36 % CPUTime :
% 3.87/1.94 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.87/1.94
% 3.87/1.94 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.13/1.98
% 4.13/1.98 Inference rules
% 4.13/1.98 ----------------------
% 4.13/1.98 #Ref : 0
% 4.13/1.98 #Sup : 70
% 4.13/1.98 #Fact : 2
% 4.13/1.98 #Define : 0
% 4.13/1.98 #Split : 2
% 4.13/1.98 #Chain : 0
% 4.13/1.98 #Close : 0
% 4.13/1.98
% 4.13/1.98 Ordering : KBO
% 4.13/1.98
% 4.13/1.98 Simplification rules
% 4.13/1.98 ----------------------
% 4.13/1.98 #Subsume : 15
% 4.13/1.98 #Demod : 9
% 4.13/1.98 #Tautology : 6
% 4.13/1.98 #SimpNegUnit : 2
% 4.13/1.98 #BackRed : 0
% 4.13/1.98
% 4.13/1.98 #Partial instantiations: 0
% 4.13/1.98 #Strategies tried : 1
% 4.13/1.98
% 4.13/1.98 Timing (in seconds)
% 4.13/1.98 ----------------------
% 4.13/1.98 Preprocessing : 0.49
% 4.13/1.98 Parsing : 0.27
% 4.13/1.98 CNF conversion : 0.03
% 4.13/1.98 Main loop : 0.41
% 4.13/1.98 Inferencing : 0.16
% 4.13/1.98 Reduction : 0.10
% 4.13/1.98 Demodulation : 0.07
% 4.13/1.98 BG Simplification : 0.03
% 4.13/1.98 Subsumption : 0.09
% 4.13/1.98 Abstraction : 0.01
% 4.13/1.98 MUC search : 0.00
% 4.13/1.98 Cooper : 0.00
% 4.13/1.98 Total : 0.96
% 4.13/1.98 Index Insertion : 0.00
% 4.13/1.98 Index Deletion : 0.00
% 4.13/1.98 Index Matching : 0.00
% 4.13/1.98 BG Taut test : 0.00
%------------------------------------------------------------------------------