TSTP Solution File: FLD033-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD033-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 : n006.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:32 EDT 2023
% Result : Unsatisfiable 11.15s 3.75s
% Output : CNFRefutation 11.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 19
% Syntax : Number of formulae : 34 ( 10 unt; 12 typ; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 47 ( 22 ~; 25 |; 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 : 27 (; 27 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > less_or_equal > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > m > additive_identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(m,type,
m: $i ).
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,a,additive_identity),
file(unknown,unknown) ).
tff(f_255,axiom,
~ product(multiplicative_identity,m,multiplicative_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_253,axiom,
product(m,a,a),
file(unknown,unknown) ).
tff(f_122,axiom,
! [Y,X,Z] :
( product(Y,X,Z)
| ~ product(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_105,axiom,
! [W,U,Z,X,Y,V] :
( product(U,Z,W)
| ~ product(X,Y,U)
| ~ product(Y,Z,V)
| ~ product(X,V,W) ),
file(unknown,unknown) ).
tff(c_58,plain,
~ sum(additive_identity,a,additive_identity),
inference(cnfTransformation,[status(thm)],[f_252]) ).
tff(c_62,plain,
~ product(multiplicative_identity,m,multiplicative_identity),
inference(cnfTransformation,[status(thm)],[f_255]) ).
tff(c_54,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_18,plain,
! [X_31] :
( ~ defined(X_31)
| sum(additive_identity,X_31,additive_identity)
| product(multiplicative_inverse(X_31),X_31,multiplicative_identity) ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_60,plain,
product(m,a,a),
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(a,m,a),
inference(resolution,[status(thm)],[c_60,c_69]) ).
tff(c_319,plain,
! [W_136,V_137,Z_133,U_134,X_135,Y_132] :
( ~ product(X_135,V_137,W_136)
| ~ product(Y_132,Z_133,V_137)
| ~ product(X_135,Y_132,U_134)
| product(U_134,Z_133,W_136) ),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_12559,plain,
! [Y_452,Z_453,X_454,U_455] :
( ~ product(Y_452,Z_453,X_454)
| ~ product(multiplicative_inverse(X_454),Y_452,U_455)
| product(U_455,Z_453,multiplicative_identity)
| ~ defined(X_454)
| sum(additive_identity,X_454,additive_identity) ),
inference(resolution,[status(thm)],[c_18,c_319]) ).
tff(c_12727,plain,
! [U_455] :
( ~ product(multiplicative_inverse(a),a,U_455)
| product(U_455,m,multiplicative_identity)
| ~ defined(a)
| sum(additive_identity,a,additive_identity) ),
inference(resolution,[status(thm)],[c_75,c_12559]) ).
tff(c_13025,plain,
! [U_455] :
( ~ product(multiplicative_inverse(a),a,U_455)
| product(U_455,m,multiplicative_identity)
| sum(additive_identity,a,additive_identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_12727]) ).
tff(c_13032,plain,
! [U_456] :
( ~ product(multiplicative_inverse(a),a,U_456)
| product(U_456,m,multiplicative_identity) ),
inference(negUnitSimplification,[status(thm)],[c_58,c_13025]) ).
tff(c_13047,plain,
( product(multiplicative_identity,m,multiplicative_identity)
| ~ defined(a)
| sum(additive_identity,a,additive_identity) ),
inference(resolution,[status(thm)],[c_18,c_13032]) ).
tff(c_13061,plain,
( product(multiplicative_identity,m,multiplicative_identity)
| sum(additive_identity,a,additive_identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_13047]) ).
tff(c_13063,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_58,c_62,c_13061]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD033-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/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 : n006.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:57:29 EDT 2023
% 0.21/0.35 % CPUTime :
% 11.15/3.75 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.15/3.76
% 11.15/3.76 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 11.43/3.78
% 11.43/3.78 Inference rules
% 11.43/3.78 ----------------------
% 11.43/3.78 #Ref : 0
% 11.43/3.78 #Sup : 2989
% 11.43/3.78 #Fact : 4
% 11.43/3.78 #Define : 0
% 11.43/3.78 #Split : 18
% 11.43/3.78 #Chain : 0
% 11.43/3.78 #Close : 0
% 11.43/3.78
% 11.43/3.78 Ordering : KBO
% 11.43/3.78
% 11.43/3.78 Simplification rules
% 11.43/3.78 ----------------------
% 11.43/3.78 #Subsume : 200
% 11.43/3.78 #Demod : 1719
% 11.43/3.78 #Tautology : 441
% 11.43/3.78 #SimpNegUnit : 104
% 11.43/3.78 #BackRed : 0
% 11.43/3.78
% 11.43/3.78 #Partial instantiations: 0
% 11.43/3.78 #Strategies tried : 1
% 11.43/3.78
% 11.43/3.78 Timing (in seconds)
% 11.43/3.78 ----------------------
% 11.43/3.79 Preprocessing : 0.50
% 11.43/3.79 Parsing : 0.28
% 11.43/3.79 CNF conversion : 0.03
% 11.43/3.79 Main loop : 2.22
% 11.43/3.79 Inferencing : 0.64
% 11.43/3.79 Reduction : 0.72
% 11.43/3.79 Demodulation : 0.54
% 11.43/3.79 BG Simplification : 0.06
% 11.43/3.79 Subsumption : 0.64
% 11.43/3.79 Abstraction : 0.05
% 11.43/3.79 MUC search : 0.00
% 11.43/3.79 Cooper : 0.00
% 11.43/3.79 Total : 2.77
% 11.43/3.79 Index Insertion : 0.00
% 11.43/3.79 Index Deletion : 0.00
% 11.43/3.79 Index Matching : 0.00
% 11.43/3.79 BG Taut test : 0.00
%------------------------------------------------------------------------------