TSTP Solution File: BOO009-2 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : BOO009-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/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 : n017.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.54s 2.13s
% Output   : CNFRefutation 3.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   37 (  30 unt;   7 typ;   0 def)
%            Number of atoms       :   30 (  29 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   :   45 (;  45   !;   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,
    ! [X] : ( multiply(X,multiplicative_identity) = X ),
    file(unknown,unknown) ).

tff(f_58,axiom,
    ! [X] : ( add(inverse(X),X) = multiplicative_identity ),
    file(unknown,unknown) ).

tff(f_66,axiom,
    ! [X] : ( multiply(multiplicative_identity,X) = 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_54,axiom,
    ! [X,Y,Z] : ( multiply(X,add(Y,Z)) = add(multiply(X,Y),multiply(X,Z)) ),
    file(unknown,unknown) ).

tff(f_70,axiom,
    ! [X] : ( add(additive_identity,X) = X ),
    file(unknown,unknown) ).

tff(f_60,axiom,
    ! [X] : ( multiply(X,inverse(X)) = additive_identity ),
    file(unknown,unknown) ).

tff(f_74,axiom,
    multiply(a,add(a,b)) != a,
    file(unknown,unknown) ).

tff(c_22,plain,
    ! [X_21] : ( multiply(X_21,multiplicative_identity) = X_21 ),
    inference(cnfTransformation,[status(thm)],[f_64]) ).

tff(c_16,plain,
    ! [X_18] : ( add(inverse(X_18),X_18) = multiplicative_identity ),
    inference(cnfTransformation,[status(thm)],[f_58]) ).

tff(c_24,plain,
    ! [X_22] : ( multiply(multiplicative_identity,X_22) = X_22 ),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_367,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_48]) ).

tff(c_406,plain,
    ! [X_18,Y_39] : ( add(multiply(inverse(X_18),Y_39),X_18) = multiply(multiplicative_identity,add(Y_39,X_18)) ),
    inference(superposition,[status(thm),theory(equality)],[c_16,c_367]) ).

tff(c_430,plain,
    ! [X_40,Y_41] : ( add(multiply(inverse(X_40),Y_41),X_40) = add(Y_41,X_40) ),
    inference(demodulation,[status(thm),theory(equality)],[c_24,c_406]) ).

tff(c_489,plain,
    ! [X_40] : ( add(inverse(X_40),X_40) = add(multiplicative_identity,X_40) ),
    inference(superposition,[status(thm),theory(equality)],[c_22,c_430]) ).

tff(c_499,plain,
    ! [X_40] : ( add(multiplicative_identity,X_40) = multiplicative_identity ),
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_489]) ).

tff(c_1017,plain,
    ! [X_54,Y_55,Z_56] : ( add(multiply(X_54,Y_55),multiply(X_54,Z_56)) = multiply(X_54,add(Y_55,Z_56)) ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_1110,plain,
    ! [X_21,Z_56] : ( multiply(X_21,add(multiplicative_identity,Z_56)) = add(X_21,multiply(X_21,Z_56)) ),
    inference(superposition,[status(thm),theory(equality)],[c_22,c_1017]) ).

tff(c_1132,plain,
    ! [X_21,Z_56] : ( add(X_21,multiply(X_21,Z_56)) = X_21 ),
    inference(demodulation,[status(thm),theory(equality)],[c_22,c_499,c_1110]) ).

tff(c_28,plain,
    ! [X_24] : ( add(additive_identity,X_24) = X_24 ),
    inference(cnfTransformation,[status(thm)],[f_70]) ).

tff(c_18,plain,
    ! [X_19] : ( multiply(X_19,inverse(X_19)) = additive_identity ),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_1104,plain,
    ! [X_19,Z_56] : ( multiply(X_19,add(inverse(X_19),Z_56)) = add(additive_identity,multiply(X_19,Z_56)) ),
    inference(superposition,[status(thm),theory(equality)],[c_18,c_1017]) ).

tff(c_1879,plain,
    ! [X_70,Z_71] : ( multiply(X_70,add(inverse(X_70),Z_71)) = multiply(X_70,Z_71) ),
    inference(demodulation,[status(thm),theory(equality)],[c_28,c_1104]) ).

tff(c_1989,plain,
    ! [X_18] : ( multiply(X_18,multiplicative_identity) = multiply(X_18,X_18) ),
    inference(superposition,[status(thm),theory(equality)],[c_16,c_1879]) ).

tff(c_2025,plain,
    ! [X_72] : ( multiply(X_72,X_72) = X_72 ),
    inference(demodulation,[status(thm),theory(equality)],[c_22,c_1989]) ).

tff(c_12,plain,
    ! [X_14,Y_15,Z_16] : ( add(multiply(X_14,Y_15),multiply(X_14,Z_16)) = multiply(X_14,add(Y_15,Z_16)) ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_2056,plain,
    ! [X_72,Z_16] : ( multiply(X_72,add(X_72,Z_16)) = add(X_72,multiply(X_72,Z_16)) ),
    inference(superposition,[status(thm),theory(equality)],[c_2025,c_12]) ).

tff(c_2124,plain,
    ! [X_72,Z_16] : ( multiply(X_72,add(X_72,Z_16)) = X_72 ),
    inference(demodulation,[status(thm),theory(equality)],[c_1132,c_2056]) ).

tff(c_30,plain,
    multiply(a,add(a,b)) != a,
    inference(cnfTransformation,[status(thm)],[f_74]) ).

tff(c_2432,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_2124,c_30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : BOO009-2 : TPTP v8.1.2. Released v1.0.0.
% 0.14/0.14  % 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.14/0.36  % Computer : n017.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Thu Aug  3 17:59:06 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 3.54/2.13  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.54/2.13  
% 3.54/2.13  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.54/2.16  
% 3.54/2.16  Inference rules
% 3.54/2.16  ----------------------
% 3.54/2.16  #Ref     : 0
% 3.54/2.16  #Sup     : 574
% 3.54/2.16  #Fact    : 0
% 3.54/2.16  #Define  : 0
% 3.54/2.16  #Split   : 0
% 3.54/2.16  #Chain   : 0
% 3.54/2.16  #Close   : 0
% 3.54/2.16  
% 3.54/2.16  Ordering : KBO
% 3.54/2.16  
% 3.54/2.16  Simplification rules
% 3.54/2.16  ----------------------
% 3.54/2.16  #Subsume      : 2
% 3.54/2.16  #Demod        : 457
% 3.54/2.16  #Tautology    : 382
% 3.54/2.16  #SimpNegUnit  : 0
% 3.54/2.16  #BackRed      : 4
% 3.54/2.16  
% 3.54/2.16  #Partial instantiations: 0
% 3.54/2.16  #Strategies tried      : 1
% 3.54/2.16  
% 3.54/2.16  Timing (in seconds)
% 3.54/2.16  ----------------------
% 3.54/2.17  Preprocessing        : 0.45
% 3.54/2.17  Parsing              : 0.24
% 3.54/2.17  CNF conversion       : 0.02
% 3.54/2.17  Main loop            : 0.62
% 3.54/2.17  Inferencing          : 0.21
% 3.54/2.17  Reduction            : 0.25
% 3.54/2.17  Demodulation         : 0.20
% 3.54/2.17  BG Simplification    : 0.03
% 3.54/2.17  Subsumption          : 0.09
% 3.54/2.17  Abstraction          : 0.03
% 3.54/2.17  MUC search           : 0.00
% 3.54/2.17  Cooper               : 0.00
% 3.54/2.17  Total                : 1.12
% 3.54/2.17  Index Insertion      : 0.00
% 3.54/2.17  Index Deletion       : 0.00
% 3.54/2.17  Index Matching       : 0.00
% 3.54/2.17  BG Taut test         : 0.00
%------------------------------------------------------------------------------