TSTP Solution File: FLD070-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD070-1 : 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 : n026.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 98.31s 83.30s
% Output : CNFRefutation 98.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 19
% Syntax : Number of formulae : 32 ( 9 unt; 11 typ; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 49 ( 26 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 7 >; 4 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 27 (; 27 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less_or_equal > equalish > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > b > additive_identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(less_or_equal,type,
less_or_equal: ( $i * $i ) > $o ).
tff(a,type,
a: $i ).
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(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(f_237,axiom,
defined(b),
file(unknown,unknown) ).
tff(f_238,axiom,
less_or_equal(additive_identity,a),
file(unknown,unknown) ).
tff(f_239,axiom,
less_or_equal(additive_identity,b),
file(unknown,unknown) ).
tff(f_181,axiom,
! [X,Z,Y] :
( less_or_equal(add(X,Z),add(Y,Z))
| ~ defined(Z)
| ~ less_or_equal(X,Y) ),
file(unknown,unknown) ).
tff(f_62,axiom,
! [X] :
( equalish(add(additive_identity,X),X)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_231,axiom,
! [Y,Z,X] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) ),
file(unknown,unknown) ).
tff(f_163,axiom,
! [X,Z,Y] :
( less_or_equal(X,Z)
| ~ less_or_equal(X,Y)
| ~ less_or_equal(Y,Z) ),
file(unknown,unknown) ).
tff(f_241,axiom,
~ less_or_equal(additive_identity,add(a,b)),
file(unknown,unknown) ).
tff(c_58,plain,
defined(b),
inference(cnfTransformation,[status(thm)],[f_237]) ).
tff(c_60,plain,
less_or_equal(additive_identity,a),
inference(cnfTransformation,[status(thm)],[f_238]) ).
tff(c_62,plain,
less_or_equal(additive_identity,b),
inference(cnfTransformation,[status(thm)],[f_239]) ).
tff(c_714,plain,
! [X_111,Y_112,Z_113] :
( ~ less_or_equal(X_111,Y_112)
| ~ defined(Z_113)
| less_or_equal(add(X_111,Z_113),add(Y_112,Z_113)) ),
inference(cnfTransformation,[status(thm)],[f_181]) ).
tff(c_4,plain,
! [X_4] :
( ~ defined(X_4)
| equalish(add(additive_identity,X_4),X_4) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_110,plain,
! [X_71,Y_72,Z_73] :
( ~ equalish(X_71,Y_72)
| ~ less_or_equal(X_71,Z_73)
| less_or_equal(Y_72,Z_73) ),
inference(cnfTransformation,[status(thm)],[f_231]) ).
tff(c_129,plain,
! [X_4,Z_73] :
( ~ less_or_equal(add(additive_identity,X_4),Z_73)
| less_or_equal(X_4,Z_73)
| ~ defined(X_4) ),
inference(resolution,[status(thm)],[c_4,c_110]) ).
tff(c_16888,plain,
! [Z_408,Y_409] :
( less_or_equal(Z_408,add(Y_409,Z_408))
| ~ less_or_equal(additive_identity,Y_409)
| ~ defined(Z_408) ),
inference(resolution,[status(thm)],[c_714,c_129]) ).
tff(c_34,plain,
! [Y_28,Z_27,X_26] :
( ~ less_or_equal(Y_28,Z_27)
| ~ less_or_equal(X_26,Y_28)
| less_or_equal(X_26,Z_27) ),
inference(cnfTransformation,[status(thm)],[f_163]) ).
tff(c_207336,plain,
! [X_1383,Z_1384,Y_1385] :
( ~ less_or_equal(X_1383,Z_1384)
| less_or_equal(X_1383,add(Y_1385,Z_1384))
| ~ less_or_equal(additive_identity,Y_1385)
| ~ defined(Z_1384) ),
inference(resolution,[status(thm)],[c_16888,c_34]) ).
tff(c_64,plain,
~ less_or_equal(additive_identity,add(a,b)),
inference(cnfTransformation,[status(thm)],[f_241]) ).
tff(c_207671,plain,
( ~ less_or_equal(additive_identity,b)
| ~ less_or_equal(additive_identity,a)
| ~ defined(b) ),
inference(resolution,[status(thm)],[c_207336,c_64]) ).
tff(c_207823,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_58,c_60,c_62,c_207671]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD070-1 : 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.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu Aug 3 20:16:16 EDT 2023
% 0.13/0.34 % CPUTime :
% 98.31/83.30 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 98.31/83.30
% 98.31/83.30 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 98.38/83.33
% 98.38/83.33 Inference rules
% 98.38/83.33 ----------------------
% 98.38/83.33 #Ref : 0
% 98.38/83.33 #Sup : 46194
% 98.38/83.33 #Fact : 20
% 98.38/83.33 #Define : 0
% 98.38/83.33 #Split : 25
% 98.38/83.33 #Chain : 0
% 98.38/83.33 #Close : 0
% 98.38/83.33
% 98.38/83.33 Ordering : KBO
% 98.38/83.33
% 98.38/83.33 Simplification rules
% 98.38/83.33 ----------------------
% 98.38/83.33 #Subsume : 10135
% 98.38/83.33 #Demod : 25204
% 98.38/83.33 #Tautology : 7628
% 98.38/83.33 #SimpNegUnit : 1224
% 98.38/83.33 #BackRed : 0
% 98.38/83.33
% 98.38/83.33 #Partial instantiations: 0
% 98.38/83.33 #Strategies tried : 1
% 98.38/83.33
% 98.38/83.33 Timing (in seconds)
% 98.38/83.33 ----------------------
% 98.38/83.34 Preprocessing : 0.53
% 98.38/83.34 Parsing : 0.29
% 98.38/83.34 CNF conversion : 0.04
% 98.38/83.34 Main loop : 81.81
% 98.38/83.34 Inferencing : 7.11
% 98.38/83.34 Reduction : 37.61
% 98.38/83.34 Demodulation : 30.84
% 98.38/83.34 BG Simplification : 0.24
% 98.38/83.34 Subsumption : 31.15
% 98.38/83.34 Abstraction : 0.40
% 98.38/83.34 MUC search : 0.00
% 98.38/83.34 Cooper : 0.00
% 98.38/83.34 Total : 82.39
% 98.38/83.34 Index Insertion : 0.00
% 98.38/83.34 Index Deletion : 0.00
% 98.38/83.34 Index Matching : 0.00
% 98.38/83.34 BG Taut test : 0.00
%------------------------------------------------------------------------------