TSTP Solution File: BOO013-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : BOO013-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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 : n029.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:25 EDT 2023
% Result : Unsatisfiable 4.29s 2.20s
% Output : CNFRefutation 4.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 22
% Syntax : Number of formulae : 53 ( 45 unt; 8 typ; 0 def)
% Number of atoms : 45 ( 44 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 : 3 ( 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 : 42 (; 42 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > add > #nlpp > inverse > multiplicative_identity > c > 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(c,type,
c: $i ).
tff(f_80,axiom,
b != c,
file(unknown,unknown) ).
tff(f_68,axiom,
! [X] : ( multiply(multiplicative_identity,X) = X ),
file(unknown,unknown) ).
tff(f_75,axiom,
add(a,b) = multiplicative_identity,
file(unknown,unknown) ).
tff(f_66,axiom,
! [X] : ( multiply(X,multiplicative_identity) = X ),
file(unknown,unknown) ).
tff(f_76,axiom,
add(a,c) = multiplicative_identity,
file(unknown,unknown) ).
tff(f_70,axiom,
! [X] : ( add(X,additive_identity) = X ),
file(unknown,unknown) ).
tff(f_78,axiom,
multiply(a,c) = additive_identity,
file(unknown,unknown) ).
tff(f_56,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] : ( add(X,Y) = add(Y,X) ),
file(unknown,unknown) ).
tff(f_50,axiom,
! [X,Y,Z] : ( add(multiply(X,Y),Z) = multiply(add(X,Z),add(Y,Z)) ),
file(unknown,unknown) ).
tff(f_54,axiom,
! [X,Y,Z] : ( multiply(add(X,Y),Z) = add(multiply(X,Z),multiply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X,Y] : ( multiply(X,Y) = multiply(Y,X) ),
file(unknown,unknown) ).
tff(f_72,axiom,
! [X] : ( add(additive_identity,X) = X ),
file(unknown,unknown) ).
tff(f_77,axiom,
multiply(a,b) = additive_identity,
file(unknown,unknown) ).
tff(c_38,plain,
c != b,
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_24,plain,
! [X_22] : ( multiply(multiplicative_identity,X_22) = X_22 ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_30,plain,
add(a,b) = multiplicative_identity,
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_22,plain,
! [X_21] : ( multiply(X_21,multiplicative_identity) = X_21 ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_32,plain,
add(a,c) = multiplicative_identity,
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_26,plain,
! [X_23] : ( add(X_23,additive_identity) = X_23 ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_36,plain,
multiply(a,c) = additive_identity,
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_860,plain,
! [X_47,Y_48,Z_49] : ( add(multiply(X_47,Y_48),multiply(X_47,Z_49)) = multiply(X_47,add(Y_48,Z_49)) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_958,plain,
! [Y_48] : ( multiply(a,add(Y_48,c)) = add(multiply(a,Y_48),additive_identity) ),
inference(superposition,[status(thm),theory(equality)],[c_36,c_860]) ).
tff(c_993,plain,
! [Y_50] : ( multiply(a,add(Y_50,c)) = multiply(a,Y_50) ),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_958]) ).
tff(c_1036,plain,
multiply(a,multiplicative_identity) = multiply(a,a),
inference(superposition,[status(thm),theory(equality)],[c_32,c_993]) ).
tff(c_1045,plain,
multiply(a,a) = a,
inference(demodulation,[status(thm),theory(equality)],[c_22,c_1036]) ).
tff(c_2,plain,
! [Y_2,X_1] : ( add(Y_2,X_1) = add(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_391,plain,
! [X_37,Z_38,Y_39] : ( multiply(add(X_37,Z_38),add(Y_39,Z_38)) = add(multiply(X_37,Y_39),Z_38) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_448,plain,
! [Y_39] : ( multiply(multiplicative_identity,add(Y_39,b)) = add(multiply(a,Y_39),b) ),
inference(superposition,[status(thm),theory(equality)],[c_30,c_391]) ).
tff(c_466,plain,
! [Y_39] : ( add(b,multiply(a,Y_39)) = add(Y_39,b) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_24,c_448]) ).
tff(c_1085,plain,
add(b,a) = add(a,b),
inference(superposition,[status(thm),theory(equality)],[c_1045,c_466]) ).
tff(c_1090,plain,
add(b,a) = multiplicative_identity,
inference(demodulation,[status(thm),theory(equality)],[c_30,c_1085]) ).
tff(c_707,plain,
! [X_44,Z_45,Y_46] : ( add(multiply(X_44,Z_45),multiply(Y_46,Z_45)) = multiply(add(X_44,Y_46),Z_45) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_797,plain,
! [X_44] : ( multiply(add(X_44,a),c) = add(multiply(X_44,c),additive_identity) ),
inference(superposition,[status(thm),theory(equality)],[c_36,c_707]) ).
tff(c_1266,plain,
! [X_52] : ( multiply(add(X_52,a),c) = multiply(X_52,c) ),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_797]) ).
tff(c_1293,plain,
multiply(multiplicative_identity,c) = multiply(b,c),
inference(superposition,[status(thm),theory(equality)],[c_1090,c_1266]) ).
tff(c_1320,plain,
multiply(b,c) = c,
inference(demodulation,[status(thm),theory(equality)],[c_24,c_1293]) ).
tff(c_4,plain,
! [Y_4,X_3] : ( multiply(Y_4,X_3) = multiply(X_3,Y_4) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_28,plain,
! [X_24] : ( add(additive_identity,X_24) = X_24 ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_34,plain,
multiply(a,b) = additive_identity,
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_776,plain,
! [Y_46] : ( multiply(add(a,Y_46),b) = add(additive_identity,multiply(Y_46,b)) ),
inference(superposition,[status(thm),theory(equality)],[c_34,c_707]) ).
tff(c_1516,plain,
! [Y_54] : ( multiply(add(a,Y_54),b) = multiply(Y_54,b) ),
inference(demodulation,[status(thm),theory(equality)],[c_28,c_776]) ).
tff(c_1568,plain,
multiply(multiplicative_identity,b) = multiply(c,b),
inference(superposition,[status(thm),theory(equality)],[c_32,c_1516]) ).
tff(c_1576,plain,
c = b,
inference(demodulation,[status(thm),theory(equality)],[c_1320,c_4,c_24,c_1568]) ).
tff(c_1578,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_38,c_1576]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : BOO013-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.13 % 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.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 18:47:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.29/2.20 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.29/2.20
% 4.29/2.20 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.29/2.23
% 4.29/2.23 Inference rules
% 4.29/2.23 ----------------------
% 4.29/2.23 #Ref : 0
% 4.29/2.23 #Sup : 422
% 4.29/2.23 #Fact : 0
% 4.29/2.23 #Define : 0
% 4.29/2.23 #Split : 0
% 4.29/2.23 #Chain : 0
% 4.29/2.23 #Close : 0
% 4.29/2.23
% 4.29/2.23 Ordering : KBO
% 4.29/2.23
% 4.29/2.23 Simplification rules
% 4.29/2.23 ----------------------
% 4.29/2.23 #Subsume : 1
% 4.29/2.23 #Demod : 252
% 4.29/2.23 #Tautology : 196
% 4.29/2.23 #SimpNegUnit : 1
% 4.29/2.23 #BackRed : 0
% 4.29/2.23
% 4.29/2.23 #Partial instantiations: 0
% 4.29/2.23 #Strategies tried : 1
% 4.29/2.23
% 4.29/2.23 Timing (in seconds)
% 4.29/2.23 ----------------------
% 4.29/2.24 Preprocessing : 0.47
% 4.29/2.24 Parsing : 0.24
% 4.29/2.24 CNF conversion : 0.02
% 4.29/2.24 Main loop : 0.62
% 4.29/2.24 Inferencing : 0.21
% 4.29/2.24 Reduction : 0.25
% 4.29/2.24 Demodulation : 0.20
% 4.29/2.24 BG Simplification : 0.03
% 4.29/2.24 Subsumption : 0.10
% 4.29/2.24 Abstraction : 0.03
% 4.29/2.24 MUC search : 0.00
% 4.29/2.24 Cooper : 0.00
% 4.29/2.24 Total : 1.15
% 4.29/2.24 Index Insertion : 0.00
% 4.29/2.24 Index Deletion : 0.00
% 4.29/2.24 Index Matching : 0.00
% 4.29/2.24 BG Taut test : 0.00
%------------------------------------------------------------------------------