TSTP Solution File: FLD018-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD018-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 : n021.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:29 EDT 2023
% Result : Unsatisfiable 5.93s 2.34s
% Output : CNFRefutation 5.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of formulae : 37 ( 10 unt; 11 typ; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 48 ( 25 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 35 (; 35 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > less_or_equal > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > 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(defined,type,
defined: $i > $o ).
tff(multiplicative_inverse,type,
multiplicative_inverse: $i > $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(f_252,axiom,
~ sum(additive_identity,additive_inverse(a),additive_identity),
file(unknown,unknown) ).
tff(f_249,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_78,axiom,
! [X] :
( sum(additive_inverse(X),X,additive_identity)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_250,axiom,
sum(additive_identity,a,additive_identity),
file(unknown,unknown) ).
tff(f_83,axiom,
! [Y,X,Z] :
( sum(Y,X,Z)
| ~ sum(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_73,axiom,
! [X] :
( sum(additive_identity,X,X)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_57,axiom,
! [W,U,Z,X,Y,V] :
( sum(X,V,W)
| ~ sum(X,Y,U)
| ~ sum(Y,Z,V)
| ~ sum(U,Z,W) ),
file(unknown,unknown) ).
tff(c_58,plain,
~ sum(additive_identity,additive_inverse(a),additive_identity),
inference(cnfTransformation,[status(thm)],[f_252]) ).
tff(c_54,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_8,plain,
! [X_14] :
( ~ defined(X_14)
| sum(additive_inverse(X_14),X_14,additive_identity) ),
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_56,plain,
sum(additive_identity,a,additive_identity),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_72,plain,
! [X_84,Y_85,Z_86] :
( ~ sum(X_84,Y_85,Z_86)
| sum(Y_85,X_84,Z_86) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_81,plain,
sum(a,additive_identity,additive_identity),
inference(resolution,[status(thm)],[c_56,c_72]) ).
tff(c_6,plain,
! [X_13] :
( ~ defined(X_13)
| sum(additive_identity,X_13,X_13) ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_656,plain,
! [W_159,U_157,V_156,Y_155,X_158,Z_154] :
( ~ sum(U_157,Z_154,W_159)
| ~ sum(Y_155,Z_154,V_156)
| ~ sum(X_158,Y_155,U_157)
| sum(X_158,V_156,W_159) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_1651,plain,
! [Y_203,V_204,X_205] :
( ~ sum(Y_203,a,V_204)
| ~ sum(X_205,Y_203,additive_identity)
| sum(X_205,V_204,additive_identity) ),
inference(resolution,[status(thm)],[c_56,c_656]) ).
tff(c_1666,plain,
! [X_205] :
( ~ sum(X_205,additive_identity,additive_identity)
| sum(X_205,a,additive_identity)
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_6,c_1651]) ).
tff(c_1794,plain,
! [X_207] :
( ~ sum(X_207,additive_identity,additive_identity)
| sum(X_207,a,additive_identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_1666]) ).
tff(c_1838,plain,
sum(a,a,additive_identity),
inference(resolution,[status(thm)],[c_81,c_1794]) ).
tff(c_686,plain,
! [Y_155,V_156,X_158] :
( ~ sum(Y_155,a,V_156)
| ~ sum(X_158,Y_155,additive_identity)
| sum(X_158,V_156,additive_identity) ),
inference(resolution,[status(thm)],[c_56,c_656]) ).
tff(c_2434,plain,
! [X_215] :
( ~ sum(X_215,a,additive_identity)
| sum(X_215,additive_identity,additive_identity) ),
inference(resolution,[status(thm)],[c_1838,c_686]) ).
tff(c_10,plain,
! [X_16,Y_15,Z_17] :
( ~ sum(X_16,Y_15,Z_17)
| sum(Y_15,X_16,Z_17) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_2476,plain,
! [X_216] :
( sum(additive_identity,X_216,additive_identity)
| ~ sum(X_216,a,additive_identity) ),
inference(resolution,[status(thm)],[c_2434,c_10]) ).
tff(c_2492,plain,
( sum(additive_identity,additive_inverse(a),additive_identity)
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_8,c_2476]) ).
tff(c_2508,plain,
sum(additive_identity,additive_inverse(a),additive_identity),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_2492]) ).
tff(c_2510,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_58,c_2508]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD018-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13 % 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.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 19:58:22 EDT 2023
% 0.14/0.35 % CPUTime :
% 5.93/2.34 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.93/2.35
% 5.93/2.35 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.99/2.37
% 5.99/2.37 Inference rules
% 5.99/2.37 ----------------------
% 5.99/2.37 #Ref : 0
% 5.99/2.37 #Sup : 560
% 5.99/2.37 #Fact : 6
% 5.99/2.37 #Define : 0
% 5.99/2.37 #Split : 5
% 5.99/2.37 #Chain : 0
% 5.99/2.37 #Close : 0
% 5.99/2.37
% 5.99/2.37 Ordering : KBO
% 5.99/2.37
% 5.99/2.37 Simplification rules
% 5.99/2.37 ----------------------
% 5.99/2.37 #Subsume : 133
% 5.99/2.37 #Demod : 400
% 5.99/2.37 #Tautology : 135
% 5.99/2.37 #SimpNegUnit : 3
% 5.99/2.37 #BackRed : 0
% 5.99/2.37
% 5.99/2.37 #Partial instantiations: 0
% 5.99/2.37 #Strategies tried : 1
% 5.99/2.37
% 5.99/2.37 Timing (in seconds)
% 5.99/2.37 ----------------------
% 5.99/2.38 Preprocessing : 0.50
% 5.99/2.38 Parsing : 0.27
% 5.99/2.38 CNF conversion : 0.03
% 5.99/2.38 Main loop : 0.81
% 5.99/2.38 Inferencing : 0.29
% 5.99/2.38 Reduction : 0.21
% 5.99/2.38 Demodulation : 0.15
% 5.99/2.38 BG Simplification : 0.03
% 5.99/2.38 Subsumption : 0.22
% 5.99/2.38 Abstraction : 0.03
% 5.99/2.38 MUC search : 0.00
% 5.99/2.38 Cooper : 0.00
% 5.99/2.38 Total : 1.36
% 5.99/2.38 Index Insertion : 0.00
% 5.99/2.38 Index Deletion : 0.00
% 5.99/2.38 Index Matching : 0.00
% 5.99/2.38 BG Taut test : 0.00
%------------------------------------------------------------------------------