TSTP Solution File: FLD059-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD059-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/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 : n032.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 73.00s 60.54s
% Output : CNFRefutation 73.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 17
% Syntax : Number of formulae : 29 ( 7 unt; 10 typ; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 47 ( 25 ~; 22 |; 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 : 7 ( 7 usr; 3 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 > 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(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_236,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_237,axiom,
less_or_equal(additive_identity,a),
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_239,axiom,
~ less_or_equal(additive_identity,add(a,a)),
file(unknown,unknown) ).
tff(c_56,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_236]) ).
tff(c_58,plain,
less_or_equal(additive_identity,a),
inference(cnfTransformation,[status(thm)],[f_237]) ).
tff(c_38,plain,
! [X_31,Y_33,Z_32] :
( ~ less_or_equal(X_31,Y_33)
| ~ defined(Z_32)
| less_or_equal(add(X_31,Z_32),add(Y_33,Z_32)) ),
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_126,plain,
! [X_75,Y_76,Z_77] :
( ~ equalish(X_75,Y_76)
| ~ less_or_equal(X_75,Z_77)
| less_or_equal(Y_76,Z_77) ),
inference(cnfTransformation,[status(thm)],[f_231]) ).
tff(c_1368,plain,
! [X_138,Z_139] :
( ~ less_or_equal(add(additive_identity,X_138),Z_139)
| less_or_equal(X_138,Z_139)
| ~ defined(X_138) ),
inference(resolution,[status(thm)],[c_4,c_126]) ).
tff(c_5851,plain,
! [Z_238,Y_239] :
( less_or_equal(Z_238,add(Y_239,Z_238))
| ~ less_or_equal(additive_identity,Y_239)
| ~ defined(Z_238) ),
inference(resolution,[status(thm)],[c_38,c_1368]) ).
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_193103,plain,
! [X_1297,Z_1298,Y_1299] :
( ~ less_or_equal(X_1297,Z_1298)
| less_or_equal(X_1297,add(Y_1299,Z_1298))
| ~ less_or_equal(additive_identity,Y_1299)
| ~ defined(Z_1298) ),
inference(resolution,[status(thm)],[c_5851,c_34]) ).
tff(c_60,plain,
~ less_or_equal(additive_identity,add(a,a)),
inference(cnfTransformation,[status(thm)],[f_239]) ).
tff(c_193506,plain,
( ~ less_or_equal(additive_identity,a)
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_193103,c_60]) ).
tff(c_193687,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_56,c_58,c_193506]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : FLD059-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.10 % 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.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Thu Aug 3 19:52:21 EDT 2023
% 0.10/0.30 % CPUTime :
% 73.00/60.54 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 73.00/60.55
% 73.00/60.55 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 73.10/60.58
% 73.10/60.58 Inference rules
% 73.10/60.58 ----------------------
% 73.10/60.58 #Ref : 0
% 73.10/60.58 #Sup : 41791
% 73.10/60.58 #Fact : 20
% 73.10/60.58 #Define : 0
% 73.10/60.58 #Split : 23
% 73.10/60.58 #Chain : 0
% 73.10/60.58 #Close : 0
% 73.10/60.58
% 73.10/60.58 Ordering : KBO
% 73.10/60.58
% 73.10/60.58 Simplification rules
% 73.10/60.58 ----------------------
% 73.10/60.58 #Subsume : 10988
% 73.10/60.58 #Demod : 24306
% 73.10/60.58 #Tautology : 7006
% 73.10/60.58 #SimpNegUnit : 1245
% 73.10/60.58 #BackRed : 0
% 73.10/60.58
% 73.10/60.59 #Partial instantiations: 0
% 73.10/60.59 #Strategies tried : 1
% 73.10/60.59
% 73.10/60.59 Timing (in seconds)
% 73.10/60.59 ----------------------
% 73.10/60.59 Preprocessing : 0.51
% 73.10/60.59 Parsing : 0.27
% 73.10/60.59 CNF conversion : 0.03
% 73.10/60.59 Main loop : 59.05
% 73.10/60.59 Inferencing : 4.70
% 73.10/60.59 Reduction : 27.46
% 73.10/60.59 Demodulation : 22.50
% 73.10/60.59 BG Simplification : 0.19
% 73.10/60.59 Subsumption : 22.76
% 73.10/60.59 Abstraction : 0.32
% 73.10/60.59 MUC search : 0.00
% 73.10/60.59 Cooper : 0.00
% 73.10/60.59 Total : 59.62
% 73.10/60.59 Index Insertion : 0.00
% 73.10/60.59 Index Deletion : 0.00
% 73.10/60.59 Index Matching : 0.00
% 73.10/60.59 BG Taut test : 0.00
%------------------------------------------------------------------------------