TSTP Solution File: BOO009-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : BOO009-4 : TPTP v8.1.2. Released v1.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 : n003.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:34:23 EDT 2023
% Result : Unsatisfiable 3.85s 2.14s
% Output : CNFRefutation 3.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 30 ( 23 unt; 7 typ; 0 def)
% Number of atoms : 23 ( 22 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 36 (; 36 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > add > #nlpp > inverse > multiplicative_identity > b > additive_identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(additive_identity,type,
additive_identity: $i ).
tff(multiplicative_identity,type,
multiplicative_identity: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(f_52,axiom,
! [X] : ( add(X,additive_identity) = X ),
file(unknown,unknown) ).
tff(f_58,axiom,
! [X] : ( multiply(X,inverse(X)) = additive_identity ),
file(unknown,unknown) ).
tff(f_44,axiom,
! [X,Y] : ( add(X,Y) = add(Y,X) ),
file(unknown,unknown) ).
tff(f_50,axiom,
! [X,Y,Z] : ( multiply(X,add(Y,Z)) = add(multiply(X,Y),multiply(X,Z)) ),
file(unknown,unknown) ).
tff(f_46,axiom,
! [X,Y] : ( multiply(X,Y) = multiply(Y,X) ),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X,Y,Z] : ( add(X,multiply(Y,Z)) = multiply(add(X,Y),add(X,Z)) ),
file(unknown,unknown) ).
tff(f_62,axiom,
multiply(a,add(a,b)) != a,
file(unknown,unknown) ).
tff(c_10,plain,
! [X_11] : ( add(X_11,additive_identity) = X_11 ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_16,plain,
! [X_14] : ( multiply(X_14,inverse(X_14)) = additive_identity ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_156,plain,
! [Y_22,X_23] : ( add(Y_22,X_23) = add(X_23,Y_22) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_194,plain,
! [X_11] : ( add(additive_identity,X_11) = X_11 ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_156]) ).
tff(c_263,plain,
! [X_25,Y_26,Z_27] : ( add(multiply(X_25,Y_26),multiply(X_25,Z_27)) = multiply(X_25,add(Y_26,Z_27)) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_302,plain,
! [X_14,Z_27] : ( multiply(X_14,add(inverse(X_14),Z_27)) = add(additive_identity,multiply(X_14,Z_27)) ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_263]) ).
tff(c_389,plain,
! [X_31,Z_32] : ( multiply(X_31,add(inverse(X_31),Z_32)) = multiply(X_31,Z_32) ),
inference(demodulation,[status(thm),theory(equality)],[c_194,c_302]) ).
tff(c_431,plain,
! [X_31] : ( multiply(X_31,inverse(X_31)) = multiply(X_31,additive_identity) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_389]) ).
tff(c_441,plain,
! [X_33] : ( multiply(X_33,additive_identity) = additive_identity ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_431]) ).
tff(c_4,plain,
! [Y_4,X_3] : ( multiply(Y_4,X_3) = multiply(X_3,Y_4) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_456,plain,
! [X_33] : ( multiply(additive_identity,X_33) = additive_identity ),
inference(superposition,[status(thm),theory(equality)],[c_441,c_4]) ).
tff(c_321,plain,
! [X_28,Y_29,Z_30] : ( multiply(add(X_28,Y_29),add(X_28,Z_30)) = add(X_28,multiply(Y_29,Z_30)) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_378,plain,
! [X_11,Z_30] : ( multiply(X_11,add(X_11,Z_30)) = add(X_11,multiply(additive_identity,Z_30)) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_321]) ).
tff(c_1285,plain,
! [X_11,Z_30] : ( multiply(X_11,add(X_11,Z_30)) = X_11 ),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_456,c_378]) ).
tff(c_18,plain,
multiply(a,add(a,b)) != a,
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_1288,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1285,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.15 % Problem : BOO009-4 : TPTP v8.1.2. Released v1.1.0.
% 0.13/0.16 % 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.16/0.37 % Computer : n003.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 3 18:39:53 EDT 2023
% 0.16/0.37 % CPUTime :
% 3.85/2.14 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.85/2.14
% 3.85/2.14 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.85/2.17
% 3.85/2.17 Inference rules
% 3.85/2.17 ----------------------
% 3.85/2.17 #Ref : 0
% 3.85/2.17 #Sup : 296
% 3.85/2.17 #Fact : 0
% 3.85/2.17 #Define : 0
% 3.85/2.17 #Split : 0
% 3.85/2.17 #Chain : 0
% 3.85/2.17 #Close : 0
% 3.85/2.17
% 3.85/2.17 Ordering : KBO
% 3.85/2.17
% 3.85/2.17 Simplification rules
% 3.85/2.17 ----------------------
% 3.85/2.17 #Subsume : 0
% 3.85/2.17 #Demod : 233
% 3.85/2.17 #Tautology : 219
% 3.85/2.17 #SimpNegUnit : 0
% 3.85/2.17 #BackRed : 1
% 3.85/2.17
% 3.85/2.17 #Partial instantiations: 0
% 3.85/2.17 #Strategies tried : 1
% 3.85/2.17
% 3.85/2.17 Timing (in seconds)
% 3.85/2.17 ----------------------
% 3.85/2.17 Preprocessing : 0.45
% 3.85/2.17 Parsing : 0.22
% 3.85/2.17 CNF conversion : 0.02
% 3.85/2.17 Main loop : 0.51
% 3.85/2.17 Inferencing : 0.18
% 3.85/2.17 Reduction : 0.19
% 3.85/2.17 Demodulation : 0.16
% 3.85/2.17 BG Simplification : 0.02
% 3.85/2.17 Subsumption : 0.08
% 3.85/2.17 Abstraction : 0.02
% 3.85/2.17 MUC search : 0.00
% 3.85/2.17 Cooper : 0.00
% 3.85/2.17 Total : 1.01
% 3.85/2.18 Index Insertion : 0.00
% 3.85/2.18 Index Deletion : 0.00
% 3.85/2.18 Index Matching : 0.00
% 3.85/2.18 BG Taut test : 0.00
%------------------------------------------------------------------------------