TSTP Solution File: BOO017-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : BOO017-2 : TPTP v8.1.2. Released v1.0.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 : n020.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:26 EDT 2023
% Result : Unsatisfiable 4.54s 2.16s
% Output : CNFRefutation 4.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 20
% Syntax : Number of formulae : 45 ( 37 unt; 8 typ; 0 def)
% Number of atoms : 37 ( 36 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 53 (; 53 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > add > #nlpp > inverse > z > y > x > multiplicative_identity > additive_identity
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(x,type,
x: $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(y,type,
y: $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(z,type,
z: $i ).
tff(f_75,axiom,
multiply(x,z) != x,
file(unknown,unknown) ).
tff(f_73,axiom,
add(x,y) = z,
file(unknown,unknown) ).
tff(f_44,axiom,
! [X,Y] : ( add(X,Y) = add(Y,X) ),
file(unknown,unknown) ).
tff(f_70,axiom,
! [X] : ( add(additive_identity,X) = X ),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X] : ( multiply(multiplicative_identity,X) = X ),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X] : ( add(X,inverse(X)) = multiplicative_identity ),
file(unknown,unknown) ).
tff(f_64,axiom,
! [X] : ( multiply(X,multiplicative_identity) = X ),
file(unknown,unknown) ).
tff(f_50,axiom,
! [X,Y,Z] : ( add(X,multiply(Y,Z)) = multiply(add(X,Y),add(X,Z)) ),
file(unknown,unknown) ).
tff(f_52,axiom,
! [X,Y,Z] : ( multiply(add(X,Y),Z) = add(multiply(X,Z),multiply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_68,axiom,
! [X] : ( add(X,additive_identity) = X ),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X,Y,Z] : ( add(multiply(X,Y),Z) = multiply(add(X,Z),add(Y,Z)) ),
file(unknown,unknown) ).
tff(f_46,axiom,
! [X,Y] : ( multiply(X,Y) = multiply(Y,X) ),
file(unknown,unknown) ).
tff(c_32,plain,
multiply(x,z) != x,
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_30,plain,
add(x,y) = z,
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_2,plain,
! [Y_2,X_1] : ( add(Y_2,X_1) = add(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_28,plain,
! [X_24] : ( add(additive_identity,X_24) = X_24 ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_24,plain,
! [X_22] : ( multiply(multiplicative_identity,X_22) = X_22 ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_14,plain,
! [X_17] : ( add(X_17,inverse(X_17)) = multiplicative_identity ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_22,plain,
! [X_21] : ( multiply(X_21,multiplicative_identity) = X_21 ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_373,plain,
! [X_37,Y_38,Z_39] : ( multiply(add(X_37,Y_38),add(X_37,Z_39)) = add(X_37,multiply(Y_38,Z_39)) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_412,plain,
! [X_17,Z_39] : ( add(X_17,multiply(inverse(X_17),Z_39)) = multiply(multiplicative_identity,add(X_17,Z_39)) ),
inference(superposition,[status(thm),theory(equality)],[c_14,c_373]) ).
tff(c_442,plain,
! [X_40,Z_41] : ( add(X_40,multiply(inverse(X_40),Z_41)) = add(X_40,Z_41) ),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_412]) ).
tff(c_483,plain,
! [X_40] : ( add(X_40,inverse(X_40)) = add(X_40,multiplicative_identity) ),
inference(superposition,[status(thm),theory(equality)],[c_22,c_442]) ).
tff(c_496,plain,
! [X_40] : ( add(X_40,multiplicative_identity) = multiplicative_identity ),
inference(demodulation,[status(thm),theory(equality)],[c_14,c_483]) ).
tff(c_757,plain,
! [X_48,Z_49,Y_50] : ( add(multiply(X_48,Z_49),multiply(Y_50,Z_49)) = multiply(add(X_48,Y_50),Z_49) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_847,plain,
! [X_48,X_22] : ( multiply(add(X_48,multiplicative_identity),X_22) = add(multiply(X_48,X_22),X_22) ),
inference(superposition,[status(thm),theory(equality)],[c_24,c_757]) ).
tff(c_908,plain,
! [X_52,X_53] : ( add(multiply(X_52,X_53),X_53) = X_53 ),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_496,c_847]) ).
tff(c_26,plain,
! [X_23] : ( add(X_23,additive_identity) = X_23 ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_935,plain,
! [X_52] : ( multiply(X_52,additive_identity) = additive_identity ),
inference(superposition,[status(thm),theory(equality)],[c_908,c_26]) ).
tff(c_1055,plain,
! [X_55,Z_56,Y_57] : ( multiply(add(X_55,Z_56),add(Y_57,Z_56)) = add(multiply(X_55,Y_57),Z_56) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_1174,plain,
! [X_55,X_24] : ( multiply(add(X_55,X_24),X_24) = add(multiply(X_55,additive_identity),X_24) ),
inference(superposition,[status(thm),theory(equality)],[c_28,c_1055]) ).
tff(c_1706,plain,
! [X_66,X_67] : ( multiply(add(X_66,X_67),X_67) = X_67 ),
inference(demodulation,[status(thm),theory(equality)],[c_28,c_935,c_1174]) ).
tff(c_2678,plain,
! [Y_78,X_79] : ( multiply(add(Y_78,X_79),Y_78) = Y_78 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1706]) ).
tff(c_2818,plain,
multiply(z,x) = x,
inference(superposition,[status(thm),theory(equality)],[c_30,c_2678]) ).
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_2878,plain,
multiply(x,z) = x,
inference(superposition,[status(thm),theory(equality)],[c_2818,c_4]) ).
tff(c_2896,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_32,c_2878]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : BOO017-2 : TPTP v8.1.2. Released v1.0.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.15/0.36 % Computer : n020.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 18:32:37 EDT 2023
% 0.15/0.36 % CPUTime :
% 4.54/2.16 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.54/2.16
% 4.54/2.16 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.54/2.19
% 4.54/2.19 Inference rules
% 4.54/2.19 ----------------------
% 4.54/2.19 #Ref : 0
% 4.54/2.19 #Sup : 710
% 4.54/2.19 #Fact : 0
% 4.54/2.19 #Define : 0
% 4.54/2.19 #Split : 0
% 4.54/2.19 #Chain : 0
% 4.54/2.19 #Close : 0
% 4.54/2.19
% 4.54/2.19 Ordering : KBO
% 4.54/2.19
% 4.54/2.19 Simplification rules
% 4.54/2.19 ----------------------
% 4.54/2.19 #Subsume : 0
% 4.54/2.19 #Demod : 488
% 4.54/2.19 #Tautology : 435
% 4.54/2.19 #SimpNegUnit : 1
% 4.54/2.19 #BackRed : 2
% 4.54/2.19
% 4.54/2.19 #Partial instantiations: 0
% 4.54/2.19 #Strategies tried : 1
% 4.54/2.19
% 4.54/2.19 Timing (in seconds)
% 4.54/2.19 ----------------------
% 4.54/2.19 Preprocessing : 0.43
% 4.54/2.19 Parsing : 0.23
% 4.54/2.19 CNF conversion : 0.02
% 4.54/2.19 Main loop : 0.67
% 4.54/2.19 Inferencing : 0.23
% 4.54/2.19 Reduction : 0.28
% 4.54/2.19 Demodulation : 0.23
% 4.54/2.19 BG Simplification : 0.03
% 4.54/2.19 Subsumption : 0.10
% 4.54/2.19 Abstraction : 0.03
% 4.54/2.19 MUC search : 0.00
% 4.54/2.19 Cooper : 0.00
% 4.54/2.19 Total : 1.15
% 4.54/2.19 Index Insertion : 0.00
% 4.54/2.19 Index Deletion : 0.00
% 4.54/2.19 Index Matching : 0.00
% 4.54/2.19 BG Taut test : 0.00
%------------------------------------------------------------------------------