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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : BOO003-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 : n010.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:21 EDT 2023

% Result   : Unsatisfiable 3.39s 2.12s
% Output   : CNFRefutation 4.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   23 (  17 unt;   6 typ;   0 def)
%            Number of atoms       :   17 (  16 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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   20 (;  20   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ multiply > add > #nlpp > inverse > multiplicative_identity > 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(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_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_54,axiom,
    ! [X,Y,Z] : ( multiply(X,add(Y,Z)) = add(multiply(X,Y),multiply(X,Z)) ),
    file(unknown,unknown) ).

tff(f_74,axiom,
    multiply(a,a) != 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_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_594,plain,
    ! [X_44,Y_45,Z_46] : ( add(multiply(X_44,Y_45),multiply(X_44,Z_46)) = multiply(X_44,add(Y_45,Z_46)) ),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_647,plain,
    ! [X_19,Z_46] : ( multiply(X_19,add(inverse(X_19),Z_46)) = add(additive_identity,multiply(X_19,Z_46)) ),
    inference(superposition,[status(thm),theory(equality)],[c_18,c_594]) ).

tff(c_1376,plain,
    ! [X_61,Z_62] : ( multiply(X_61,add(inverse(X_61),Z_62)) = multiply(X_61,Z_62) ),
    inference(demodulation,[status(thm),theory(equality)],[c_28,c_647]) ).

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

tff(c_1492,plain,
    ! [X_18] : ( multiply(X_18,X_18) = X_18 ),
    inference(demodulation,[status(thm),theory(equality)],[c_22,c_1464]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : BOO003-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/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.35  % Computer : n010.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % 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 18:24:28 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 3.39/2.12  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.05/2.12  
% 4.05/2.12  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.05/2.15  
% 4.05/2.15  Inference rules
% 4.05/2.15  ----------------------
% 4.05/2.15  #Ref     : 0
% 4.05/2.15  #Sup     : 363
% 4.05/2.15  #Fact    : 0
% 4.05/2.15  #Define  : 0
% 4.05/2.15  #Split   : 0
% 4.05/2.15  #Chain   : 0
% 4.05/2.15  #Close   : 0
% 4.05/2.15  
% 4.05/2.15  Ordering : KBO
% 4.05/2.15  
% 4.05/2.15  Simplification rules
% 4.05/2.15  ----------------------
% 4.05/2.15  #Subsume      : 0
% 4.05/2.15  #Demod        : 226
% 4.05/2.15  #Tautology    : 228
% 4.05/2.15  #SimpNegUnit  : 0
% 4.05/2.15  #BackRed      : 1
% 4.05/2.15  
% 4.05/2.15  #Partial instantiations: 0
% 4.05/2.15  #Strategies tried      : 1
% 4.05/2.15  
% 4.05/2.15  Timing (in seconds)
% 4.05/2.15  ----------------------
% 4.05/2.16  Preprocessing        : 0.43
% 4.05/2.16  Parsing              : 0.23
% 4.05/2.16  CNF conversion       : 0.02
% 4.05/2.16  Main loop            : 0.58
% 4.05/2.16  Inferencing          : 0.21
% 4.05/2.16  Reduction            : 0.22
% 4.05/2.16  Demodulation         : 0.18
% 4.05/2.16  BG Simplification    : 0.03
% 4.05/2.16  Subsumption          : 0.09
% 4.05/2.16  Abstraction          : 0.03
% 4.05/2.16  MUC search           : 0.00
% 4.05/2.16  Cooper               : 0.00
% 4.05/2.16  Total                : 1.06
% 4.05/2.16  Index Insertion      : 0.00
% 4.05/2.16  Index Deletion       : 0.00
% 4.05/2.16  Index Matching       : 0.00
% 4.05/2.16  BG Taut test         : 0.00
%------------------------------------------------------------------------------