TSTP Solution File: FLD069-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD069-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 : n013.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:41 EDT 2023
% Result : Unsatisfiable 3.94s 2.04s
% Output : CNFRefutation 3.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 20
% Syntax : Number of formulae : 34 ( 13 unt; 12 typ; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 21 ~; 17 |; 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 : 18 (; 18 !; 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,
less_or_equal(additive_identity,b),
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,b,additive_identity),
file(unknown,unknown) ).
tff(f_250,axiom,
defined(b),
file(unknown,unknown) ).
tff(f_251,axiom,
less_or_equal(additive_identity,a),
file(unknown,unknown) ).
tff(f_73,axiom,
! [X] :
( sum(additive_identity,X,X)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_255,axiom,
sum(a,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(c_60,plain,
less_or_equal(additive_identity,b),
inference(cnfTransformation,[status(thm)],[f_252]) ).
tff(c_130,plain,
! [Y_101,X_102] :
( ~ less_or_equal(Y_101,X_102)
| ~ less_or_equal(X_102,Y_101)
| sum(additive_identity,X_102,Y_101) ),
inference(cnfTransformation,[status(thm)],[f_204]) ).
tff(c_62,plain,
~ sum(additive_identity,b,additive_identity),
inference(cnfTransformation,[status(thm)],[f_254]) ).
tff(c_135,plain,
( ~ less_or_equal(additive_identity,b)
| ~ less_or_equal(b,additive_identity) ),
inference(resolution,[status(thm)],[c_130,c_62]) ).
tff(c_142,plain,
~ less_or_equal(b,additive_identity),
inference(demodulation,[status(thm),theory(equality)],[c_60,c_135]) ).
tff(c_56,plain,
defined(b),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_58,plain,
less_or_equal(additive_identity,a),
inference(cnfTransformation,[status(thm)],[f_251]) ).
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(a,b,additive_identity),
inference(cnfTransformation,[status(thm)],[f_255]) ).
tff(c_423,plain,
! [Z_130,Y_131,U_128,V_132,X_129] :
( ~ sum(Y_131,Z_130,V_132)
| ~ sum(X_129,Z_130,U_128)
| ~ less_or_equal(X_129,Y_131)
| less_or_equal(U_128,V_132) ),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_454,plain,
! [X_133,U_134] :
( ~ sum(X_133,b,U_134)
| ~ less_or_equal(X_133,a)
| less_or_equal(U_134,additive_identity) ),
inference(resolution,[status(thm)],[c_64,c_423]) ).
tff(c_474,plain,
( ~ less_or_equal(additive_identity,a)
| less_or_equal(b,additive_identity)
| ~ defined(b) ),
inference(resolution,[status(thm)],[c_6,c_454]) ).
tff(c_492,plain,
less_or_equal(b,additive_identity),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_58,c_474]) ).
tff(c_494,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_142,c_492]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD069-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.18/0.36 % Computer : n013.cluster.edu
% 0.18/0.36 % Model : x86_64 x86_64
% 0.18/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.36 % Memory : 8042.1875MB
% 0.18/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.36 % CPULimit : 300
% 0.18/0.36 % WCLimit : 300
% 0.18/0.36 % DateTime : Thu Aug 3 19:50:02 EDT 2023
% 0.18/0.36 % CPUTime :
% 3.94/2.04 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.94/2.05
% 3.94/2.05 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.94/2.08
% 3.94/2.08 Inference rules
% 3.94/2.08 ----------------------
% 3.94/2.08 #Ref : 0
% 3.94/2.08 #Sup : 91
% 3.94/2.08 #Fact : 2
% 3.94/2.08 #Define : 0
% 3.94/2.08 #Split : 2
% 3.94/2.08 #Chain : 0
% 3.94/2.08 #Close : 0
% 3.94/2.08
% 3.94/2.08 Ordering : KBO
% 3.94/2.08
% 3.94/2.08 Simplification rules
% 3.94/2.08 ----------------------
% 3.94/2.08 #Subsume : 27
% 3.94/2.08 #Demod : 47
% 3.94/2.08 #Tautology : 10
% 3.94/2.08 #SimpNegUnit : 3
% 3.94/2.08 #BackRed : 0
% 3.94/2.08
% 3.94/2.08 #Partial instantiations: 0
% 3.94/2.08 #Strategies tried : 1
% 3.94/2.08
% 3.94/2.08 Timing (in seconds)
% 3.94/2.08 ----------------------
% 3.94/2.08 Preprocessing : 0.51
% 3.94/2.08 Parsing : 0.28
% 3.94/2.08 CNF conversion : 0.03
% 3.94/2.08 Main loop : 0.43
% 3.94/2.08 Inferencing : 0.17
% 3.94/2.08 Reduction : 0.10
% 3.94/2.08 Demodulation : 0.07
% 3.94/2.08 BG Simplification : 0.03
% 3.94/2.08 Subsumption : 0.10
% 3.94/2.08 Abstraction : 0.01
% 3.94/2.08 MUC search : 0.00
% 3.94/2.08 Cooper : 0.00
% 3.94/2.08 Total : 0.99
% 3.94/2.08 Index Insertion : 0.00
% 3.94/2.08 Index Deletion : 0.00
% 3.94/2.08 Index Matching : 0.00
% 3.94/2.08 BG Taut test : 0.00
%------------------------------------------------------------------------------