TSTP Solution File: FLD038-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD038-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 : n019.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:34 EDT 2023
% Result : Unsatisfiable 5.63s 2.35s
% Output : CNFRefutation 5.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 21
% Syntax : Number of formulae : 41 ( 14 unt; 12 typ; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 51 ( 25 ~; 26 |; 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 32 (; 32 !; 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_255,axiom,
~ product(multiplicative_identity,a,b),
file(unknown,unknown) ).
tff(f_252,axiom,
~ sum(additive_identity,a,additive_identity),
file(unknown,unknown) ).
tff(f_249,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_117,axiom,
! [X] :
( product(multiplicative_inverse(X),X,multiplicative_identity)
| sum(additive_identity,X,additive_identity)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_122,axiom,
! [Y,X,Z] :
( product(Y,X,Z)
| ~ product(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_250,axiom,
defined(b),
file(unknown,unknown) ).
tff(f_253,axiom,
product(b,multiplicative_inverse(a),multiplicative_identity),
file(unknown,unknown) ).
tff(f_110,axiom,
! [X] :
( product(multiplicative_identity,X,X)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_94,axiom,
! [W,U,Z,X,Y,V] :
( product(X,V,W)
| ~ product(X,Y,U)
| ~ product(Y,Z,V)
| ~ product(U,Z,W) ),
file(unknown,unknown) ).
tff(c_62,plain,
~ product(multiplicative_identity,a,b),
inference(cnfTransformation,[status(thm)],[f_255]) ).
tff(c_58,plain,
~ sum(additive_identity,a,additive_identity),
inference(cnfTransformation,[status(thm)],[f_252]) ).
tff(c_54,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_168,plain,
! [X_110] :
( ~ defined(X_110)
| sum(additive_identity,X_110,additive_identity)
| product(multiplicative_inverse(X_110),X_110,multiplicative_identity) ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_20,plain,
! [X_33,Y_32,Z_34] :
( ~ product(X_33,Y_32,Z_34)
| product(Y_32,X_33,Z_34) ),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_171,plain,
! [X_110] :
( product(X_110,multiplicative_inverse(X_110),multiplicative_identity)
| ~ defined(X_110)
| sum(additive_identity,X_110,additive_identity) ),
inference(resolution,[status(thm)],[c_168,c_20]) ).
tff(c_56,plain,
defined(b),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_60,plain,
product(b,multiplicative_inverse(a),multiplicative_identity),
inference(cnfTransformation,[status(thm)],[f_253]) ).
tff(c_69,plain,
! [X_82,Y_83,Z_84] :
( ~ product(X_82,Y_83,Z_84)
| product(Y_83,X_82,Z_84) ),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_75,plain,
product(multiplicative_inverse(a),b,multiplicative_identity),
inference(resolution,[status(thm)],[c_60,c_69]) ).
tff(c_16,plain,
! [X_30] :
( ~ defined(X_30)
| product(multiplicative_identity,X_30,X_30) ),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_549,plain,
! [Z_167,V_170,Y_171,X_169,U_166,W_168] :
( ~ product(U_166,Z_167,W_168)
| ~ product(Y_171,Z_167,V_170)
| ~ product(X_169,Y_171,U_166)
| product(X_169,V_170,W_168) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_1802,plain,
! [Y_228,X_229,V_230,X_231] :
( ~ product(Y_228,X_229,V_230)
| ~ product(X_231,Y_228,multiplicative_identity)
| product(X_231,V_230,X_229)
| ~ defined(X_229) ),
inference(resolution,[status(thm)],[c_16,c_549]) ).
tff(c_1836,plain,
! [X_231] :
( ~ product(X_231,multiplicative_inverse(a),multiplicative_identity)
| product(X_231,multiplicative_identity,b)
| ~ defined(b) ),
inference(resolution,[status(thm)],[c_75,c_1802]) ).
tff(c_1880,plain,
! [X_232] :
( ~ product(X_232,multiplicative_inverse(a),multiplicative_identity)
| product(X_232,multiplicative_identity,b) ),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_1836]) ).
tff(c_1898,plain,
( product(a,multiplicative_identity,b)
| ~ defined(a)
| sum(additive_identity,a,additive_identity) ),
inference(resolution,[status(thm)],[c_171,c_1880]) ).
tff(c_1912,plain,
( product(a,multiplicative_identity,b)
| sum(additive_identity,a,additive_identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_1898]) ).
tff(c_1913,plain,
product(a,multiplicative_identity,b),
inference(negUnitSimplification,[status(thm)],[c_58,c_1912]) ).
tff(c_1934,plain,
product(multiplicative_identity,a,b),
inference(resolution,[status(thm)],[c_1913,c_20]) ).
tff(c_1948,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_62,c_1934]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD038-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.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 19:57:16 EDT 2023
% 0.14/0.36 % CPUTime :
% 5.63/2.35 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.63/2.36
% 5.63/2.36 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.87/2.39
% 5.87/2.39 Inference rules
% 5.87/2.39 ----------------------
% 5.87/2.39 #Ref : 0
% 5.87/2.39 #Sup : 414
% 5.87/2.39 #Fact : 6
% 5.87/2.39 #Define : 0
% 5.87/2.39 #Split : 7
% 5.87/2.39 #Chain : 0
% 5.87/2.39 #Close : 0
% 5.87/2.39
% 5.87/2.39 Ordering : KBO
% 5.87/2.39
% 5.87/2.39 Simplification rules
% 5.87/2.39 ----------------------
% 5.87/2.39 #Subsume : 82
% 5.87/2.39 #Demod : 220
% 5.87/2.39 #Tautology : 69
% 5.87/2.39 #SimpNegUnit : 20
% 5.87/2.39 #BackRed : 0
% 5.87/2.39
% 5.87/2.39 #Partial instantiations: 0
% 5.87/2.39 #Strategies tried : 1
% 5.87/2.39
% 5.87/2.39 Timing (in seconds)
% 5.87/2.39 ----------------------
% 5.87/2.40 Preprocessing : 0.52
% 5.87/2.40 Parsing : 0.28
% 5.87/2.40 CNF conversion : 0.03
% 5.87/2.40 Main loop : 0.77
% 5.87/2.40 Inferencing : 0.27
% 5.87/2.40 Reduction : 0.21
% 5.87/2.40 Demodulation : 0.15
% 5.87/2.40 BG Simplification : 0.03
% 5.87/2.40 Subsumption : 0.20
% 5.87/2.40 Abstraction : 0.02
% 5.87/2.40 MUC search : 0.00
% 5.87/2.40 Cooper : 0.00
% 5.87/2.40 Total : 1.34
% 5.87/2.40 Index Insertion : 0.00
% 5.87/2.40 Index Deletion : 0.00
% 5.87/2.40 Index Matching : 0.00
% 5.87/2.40 BG Taut test : 0.00
%------------------------------------------------------------------------------