TSTP Solution File: BOO013-4 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : BOO013-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/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 3.51s 2.12s
% Output   : CNFRefutation 4.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   64 (  57 unt;   7 typ;   0 def)
%            Number of atoms       :   57 (  56 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 (   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   :   62 (;  62   !;   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_64,axiom,
    b != inverse(a),
    file(unknown,unknown) ).

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_46,axiom,
    ! [X,Y] : ( multiply(X,Y) = multiply(Y,X) ),
    file(unknown,unknown) ).

tff(f_54,axiom,
    ! [X] : ( multiply(X,multiplicative_identity) = X ),
    file(unknown,unknown) ).

tff(f_61,axiom,
    add(a,b) = multiplicative_identity,
    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_44,axiom,
    ! [X,Y] : ( add(X,Y) = add(Y,X) ),
    file(unknown,unknown) ).

tff(f_62,axiom,
    multiply(a,b) = additive_identity,
    file(unknown,unknown) ).

tff(f_56,axiom,
    ! [X] : ( add(X,inverse(X)) = multiplicative_identity ),
    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(c_22,plain,
    inverse(a) != b,
    inference(cnfTransformation,[status(thm)],[f_64]) ).

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_4,plain,
    ! [Y_4,X_3] : ( multiply(Y_4,X_3) = multiply(X_3,Y_4) ),
    inference(cnfTransformation,[status(thm)],[f_46]) ).

tff(c_12,plain,
    ! [X_12] : ( multiply(X_12,multiplicative_identity) = X_12 ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_18,plain,
    add(a,b) = multiplicative_identity,
    inference(cnfTransformation,[status(thm)],[f_61]) ).

tff(c_273,plain,
    ! [X_25,Y_26,Z_27] : ( multiply(add(X_25,Y_26),add(X_25,Z_27)) = add(X_25,multiply(Y_26,Z_27)) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_327,plain,
    ! [Y_26] : ( multiply(add(a,Y_26),multiplicative_identity) = add(a,multiply(Y_26,b)) ),
    inference(superposition,[status(thm),theory(equality)],[c_18,c_273]) ).

tff(c_532,plain,
    ! [Y_33] : ( add(a,multiply(Y_33,b)) = add(a,Y_33) ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_327]) ).

tff(c_566,plain,
    ! [X_34] : ( add(a,multiply(b,X_34)) = add(a,X_34) ),
    inference(superposition,[status(thm),theory(equality)],[c_4,c_532]) ).

tff(c_598,plain,
    add(a,inverse(b)) = add(a,additive_identity),
    inference(superposition,[status(thm),theory(equality)],[c_16,c_566]) ).

tff(c_611,plain,
    add(a,inverse(b)) = a,
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_598]) ).

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_20,plain,
    multiply(a,b) = additive_identity,
    inference(cnfTransformation,[status(thm)],[f_62]) ).

tff(c_155,plain,
    ! [Y_22,X_23] : ( multiply(Y_22,X_23) = multiply(X_23,Y_22) ),
    inference(cnfTransformation,[status(thm)],[f_46]) ).

tff(c_190,plain,
    ! [X_12] : ( multiply(multiplicative_identity,X_12) = X_12 ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_155]) ).

tff(c_14,plain,
    ! [X_13] : ( add(X_13,inverse(X_13)) = multiplicative_identity ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_312,plain,
    ! [X_13,Z_27] : ( add(X_13,multiply(inverse(X_13),Z_27)) = multiply(multiplicative_identity,add(X_13,Z_27)) ),
    inference(superposition,[status(thm),theory(equality)],[c_14,c_273]) ).

tff(c_929,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_190,c_312]) ).

tff(c_995,plain,
    ! [X_40] : ( add(X_40,inverse(inverse(X_40))) = add(X_40,additive_identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_16,c_929]) ).

tff(c_1019,plain,
    ! [X_42] : ( add(X_42,inverse(inverse(X_42))) = X_42 ),
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_995]) ).

tff(c_63,plain,
    ! [Y_19,X_20] : ( add(Y_19,X_20) = add(X_20,Y_19) ),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_79,plain,
    ! [X_20] : ( add(additive_identity,X_20) = X_20 ),
    inference(superposition,[status(thm),theory(equality)],[c_63,c_10]) ).

tff(c_339,plain,
    ! [X_28,Y_29,Z_30] : ( add(multiply(X_28,Y_29),multiply(X_28,Z_30)) = multiply(X_28,add(Y_29,Z_30)) ),
    inference(cnfTransformation,[status(thm)],[f_50]) ).

tff(c_402,plain,
    ! [Z_30] : ( multiply(a,add(b,Z_30)) = add(additive_identity,multiply(a,Z_30)) ),
    inference(superposition,[status(thm),theory(equality)],[c_20,c_339]) ).

tff(c_412,plain,
    ! [Z_30] : ( multiply(a,add(b,Z_30)) = multiply(a,Z_30) ),
    inference(demodulation,[status(thm),theory(equality)],[c_79,c_402]) ).

tff(c_1030,plain,
    multiply(a,inverse(inverse(b))) = multiply(a,b),
    inference(superposition,[status(thm),theory(equality)],[c_1019,c_412]) ).

tff(c_1060,plain,
    multiply(a,inverse(inverse(b))) = additive_identity,
    inference(demodulation,[status(thm),theory(equality)],[c_20,c_1030]) ).

tff(c_315,plain,
    ! [X_13,Y_26] : ( add(X_13,multiply(Y_26,inverse(X_13))) = multiply(add(X_13,Y_26),multiplicative_identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_14,c_273]) ).

tff(c_333,plain,
    ! [X_13,Y_26] : ( add(X_13,multiply(Y_26,inverse(X_13))) = add(X_13,Y_26) ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_315]) ).

tff(c_1071,plain,
    add(inverse(b),additive_identity) = add(inverse(b),a),
    inference(superposition,[status(thm),theory(equality)],[c_1060,c_333]) ).

tff(c_1080,plain,
    inverse(b) = a,
    inference(demodulation,[status(thm),theory(equality)],[c_611,c_2,c_10,c_1071]) ).

tff(c_390,plain,
    ! [X_14,Z_30] : ( multiply(X_14,add(inverse(X_14),Z_30)) = add(additive_identity,multiply(X_14,Z_30)) ),
    inference(superposition,[status(thm),theory(equality)],[c_16,c_339]) ).

tff(c_1322,plain,
    ! [X_45,Z_46] : ( multiply(X_45,add(inverse(X_45),Z_46)) = multiply(X_45,Z_46) ),
    inference(demodulation,[status(thm),theory(equality)],[c_79,c_390]) ).

tff(c_1403,plain,
    ! [X_45] : ( multiply(X_45,inverse(inverse(X_45))) = multiply(X_45,multiplicative_identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_14,c_1322]) ).

tff(c_1571,plain,
    ! [X_49] : ( multiply(X_49,inverse(inverse(X_49))) = X_49 ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_1403]) ).

tff(c_1613,plain,
    multiply(b,inverse(a)) = b,
    inference(superposition,[status(thm),theory(equality)],[c_1080,c_1571]) ).

tff(c_332,plain,
    ! [X_13,Z_27] : ( add(X_13,multiply(inverse(X_13),Z_27)) = add(X_13,Z_27) ),
    inference(demodulation,[status(thm),theory(equality)],[c_190,c_312]) ).

tff(c_1096,plain,
    ! [Z_27] : ( add(b,multiply(a,Z_27)) = add(b,Z_27) ),
    inference(superposition,[status(thm),theory(equality)],[c_1080,c_332]) ).

tff(c_1582,plain,
    add(b,inverse(inverse(a))) = add(b,a),
    inference(superposition,[status(thm),theory(equality)],[c_1571,c_1096]) ).

tff(c_1626,plain,
    add(b,inverse(inverse(a))) = multiplicative_identity,
    inference(demodulation,[status(thm),theory(equality)],[c_18,c_2,c_1582]) ).

tff(c_393,plain,
    ! [X_14,Y_29] : ( multiply(X_14,add(Y_29,inverse(X_14))) = add(multiply(X_14,Y_29),additive_identity) ),
    inference(superposition,[status(thm),theory(equality)],[c_16,c_339]) ).

tff(c_1672,plain,
    ! [X_50,Y_51] : ( multiply(X_50,add(Y_51,inverse(X_50))) = multiply(X_50,Y_51) ),
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_393]) ).

tff(c_1719,plain,
    multiply(inverse(a),multiplicative_identity) = multiply(inverse(a),b),
    inference(superposition,[status(thm),theory(equality)],[c_1626,c_1672]) ).

tff(c_1790,plain,
    inverse(a) = b,
    inference(demodulation,[status(thm),theory(equality)],[c_1613,c_4,c_12,c_1719]) ).

tff(c_1792,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_22,c_1790]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : BOO013-4 : TPTP v8.1.2. Released v1.1.0.
% 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:07 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 3.51/2.12  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.51/2.13  
% 3.51/2.13  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.38/2.17  
% 4.38/2.17  Inference rules
% 4.38/2.17  ----------------------
% 4.38/2.17  #Ref     : 0
% 4.38/2.17  #Sup     : 431
% 4.38/2.17  #Fact    : 0
% 4.38/2.17  #Define  : 0
% 4.38/2.17  #Split   : 0
% 4.38/2.17  #Chain   : 0
% 4.38/2.17  #Close   : 0
% 4.38/2.17  
% 4.38/2.17  Ordering : KBO
% 4.38/2.17  
% 4.38/2.17  Simplification rules
% 4.38/2.17  ----------------------
% 4.38/2.17  #Subsume      : 0
% 4.38/2.17  #Demod        : 364
% 4.38/2.17  #Tautology    : 290
% 4.38/2.17  #SimpNegUnit  : 1
% 4.38/2.17  #BackRed      : 3
% 4.38/2.17  
% 4.38/2.17  #Partial instantiations: 0
% 4.38/2.17  #Strategies tried      : 1
% 4.38/2.17  
% 4.38/2.17  Timing (in seconds)
% 4.38/2.17  ----------------------
% 4.38/2.17  Preprocessing        : 0.43
% 4.38/2.17  Parsing              : 0.22
% 4.38/2.17  CNF conversion       : 0.02
% 4.38/2.17  Main loop            : 0.61
% 4.38/2.17  Inferencing          : 0.22
% 4.38/2.17  Reduction            : 0.25
% 4.38/2.17  Demodulation         : 0.20
% 4.38/2.17  BG Simplification    : 0.03
% 4.38/2.17  Subsumption          : 0.09
% 4.38/2.17  Abstraction          : 0.03
% 4.38/2.17  MUC search           : 0.00
% 4.38/2.17  Cooper               : 0.00
% 4.38/2.17  Total                : 1.09
% 4.38/2.17  Index Insertion      : 0.00
% 4.38/2.17  Index Deletion       : 0.00
% 4.38/2.17  Index Matching       : 0.00
% 4.38/2.17  BG Taut test         : 0.00
%------------------------------------------------------------------------------