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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : BOO003-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 : n014.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.38s 2.04s
% Output   : CNFRefutation 3.62s
% 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_54,axiom,
    ! [X] : ( multiply(X,multiplicative_identity) = X ),
    file(unknown,unknown) ).

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

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

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

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

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_321,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_375,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_321]) ).

tff(c_747,plain,
    ! [X_39,Y_40] : ( multiply(X_39,add(Y_40,inverse(X_39))) = multiply(X_39,Y_40) ),
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_375]) ).

tff(c_811,plain,
    ! [X_13] : ( multiply(X_13,multiplicative_identity) = multiply(X_13,X_13) ),
    inference(superposition,[status(thm),theory(equality)],[c_14,c_747]) ).

tff(c_827,plain,
    ! [X_13] : ( multiply(X_13,X_13) = X_13 ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_811]) ).

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

tff(c_874,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_827,c_18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : BOO003-4 : TPTP v8.1.2. Released v1.1.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.18/0.35  % Computer : n014.cluster.edu
% 0.18/0.35  % Model    : x86_64 x86_64
% 0.18/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35  % Memory   : 8042.1875MB
% 0.18/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.19/0.35  % CPULimit : 300
% 0.19/0.35  % WCLimit  : 300
% 0.19/0.35  % DateTime : Thu Aug  3 18:28:03 EDT 2023
% 0.19/0.35  % CPUTime  : 
% 3.38/2.04  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.38/2.04  
% 3.38/2.04  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.62/2.07  
% 3.62/2.07  Inference rules
% 3.62/2.07  ----------------------
% 3.62/2.07  #Ref     : 0
% 3.62/2.07  #Sup     : 205
% 3.62/2.07  #Fact    : 0
% 3.62/2.07  #Define  : 0
% 3.62/2.07  #Split   : 0
% 3.62/2.07  #Chain   : 0
% 3.62/2.07  #Close   : 0
% 3.62/2.07  
% 3.62/2.07  Ordering : KBO
% 3.62/2.07  
% 3.62/2.07  Simplification rules
% 3.62/2.07  ----------------------
% 3.62/2.07  #Subsume      : 0
% 3.62/2.07  #Demod        : 133
% 3.62/2.07  #Tautology    : 144
% 3.62/2.07  #SimpNegUnit  : 0
% 3.62/2.07  #BackRed      : 1
% 3.62/2.07  
% 3.62/2.07  #Partial instantiations: 0
% 3.62/2.07  #Strategies tried      : 1
% 3.62/2.07  
% 3.62/2.07  Timing (in seconds)
% 3.62/2.07  ----------------------
% 3.62/2.07  Preprocessing        : 0.52
% 3.62/2.07  Parsing              : 0.23
% 3.62/2.07  CNF conversion       : 0.04
% 3.62/2.07  Main loop            : 0.46
% 3.62/2.07  Inferencing          : 0.17
% 3.62/2.07  Reduction            : 0.17
% 3.62/2.07  Demodulation         : 0.14
% 3.62/2.07  BG Simplification    : 0.02
% 3.62/2.07  Subsumption          : 0.07
% 3.62/2.07  Abstraction          : 0.02
% 3.62/2.07  MUC search           : 0.00
% 3.62/2.07  Cooper               : 0.00
% 3.62/2.07  Total                : 1.02
% 3.62/2.07  Index Insertion      : 0.00
% 3.62/2.07  Index Deletion       : 0.00
% 3.62/2.07  Index Matching       : 0.00
% 3.62/2.07  BG Taut test         : 0.00
%------------------------------------------------------------------------------