TSTP Solution File: RNG024-6 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : RNG024-6 : 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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n031.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:54:44 EDT 2023

% Result   : Unsatisfiable 3.54s 2.06s
% Output   : CNFRefutation 3.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   19 (  11 unt;   8 typ;   0 def)
%            Number of atoms       :   11 (  10 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    :    5 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   10 (   5   >;   5   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :   16 (;  16   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ associator > multiply > commutator > add > #nlpp > additive_inverse > y > x > additive_identity

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(x,type,
    x: $i ).

tff(additive_identity,type,
    additive_identity: $i ).

tff(multiply,type,
    multiply: ( $i * $i ) > $i ).

tff(associator,type,
    associator: ( $i * $i * $i ) > $i ).

tff(commutator,type,
    commutator: ( $i * $i ) > $i ).

tff(additive_inverse,type,
    additive_inverse: $i > $i ).

tff(y,type,
    y: $i ).

tff(add,type,
    add: ( $i * $i ) > $i ).

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

tff(f_76,axiom,
    ! [X,Y] : ( multiply(multiply(X,Y),Y) = multiply(X,multiply(Y,Y)) ),
    file(unknown,unknown) ).

tff(f_82,axiom,
    ! [X,Y,Z] : ( associator(X,Y,Z) = add(multiply(multiply(X,Y),Z),additive_inverse(multiply(X,multiply(Y,Z)))) ),
    file(unknown,unknown) ).

tff(f_89,axiom,
    associator(x,y,y) != additive_identity,
    file(unknown,unknown) ).

tff(c_12,plain,
    ! [X_6] : ( add(X_6,additive_inverse(X_6)) = additive_identity ),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_24,plain,
    ! [X_19,Y_20] : ( multiply(multiply(X_19,Y_20),Y_20) = multiply(X_19,multiply(Y_20,Y_20)) ),
    inference(cnfTransformation,[status(thm)],[f_76]) ).

tff(c_1297,plain,
    ! [X_69,Y_70,Z_71] : ( add(multiply(multiply(X_69,Y_70),Z_71),additive_inverse(multiply(X_69,multiply(Y_70,Z_71)))) = associator(X_69,Y_70,Z_71) ),
    inference(cnfTransformation,[status(thm)],[f_82]) ).

tff(c_1345,plain,
    ! [X_19,Y_20] : ( add(multiply(X_19,multiply(Y_20,Y_20)),additive_inverse(multiply(X_19,multiply(Y_20,Y_20)))) = associator(X_19,Y_20,Y_20) ),
    inference(superposition,[status(thm),theory(equality)],[c_24,c_1297]) ).

tff(c_1379,plain,
    ! [X_19,Y_20] : ( associator(X_19,Y_20,Y_20) = additive_identity ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_1345]) ).

tff(c_32,plain,
    associator(x,y,y) != additive_identity,
    inference(cnfTransformation,[status(thm)],[f_89]) ).

tff(c_1395,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_1379,c_32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : RNG024-6 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.37  % Computer : n031.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Thu Aug  3 18:20:45 EDT 2023
% 0.15/0.37  % CPUTime  : 
% 3.54/2.06  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.54/2.07  
% 3.54/2.07  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.54/2.09  
% 3.54/2.09  Inference rules
% 3.54/2.09  ----------------------
% 3.54/2.09  #Ref     : 0
% 3.54/2.09  #Sup     : 334
% 3.54/2.09  #Fact    : 0
% 3.54/2.09  #Define  : 0
% 3.54/2.09  #Split   : 0
% 3.54/2.09  #Chain   : 0
% 3.54/2.09  #Close   : 0
% 3.54/2.09  
% 3.54/2.09  Ordering : KBO
% 3.54/2.09  
% 3.54/2.09  Simplification rules
% 3.54/2.09  ----------------------
% 3.54/2.09  #Subsume      : 9
% 3.54/2.09  #Demod        : 263
% 3.54/2.09  #Tautology    : 218
% 3.54/2.09  #SimpNegUnit  : 0
% 3.54/2.09  #BackRed      : 1
% 3.54/2.09  
% 3.54/2.09  #Partial instantiations: 0
% 3.54/2.09  #Strategies tried      : 1
% 3.54/2.09  
% 3.54/2.09  Timing (in seconds)
% 3.54/2.09  ----------------------
% 3.54/2.10  Preprocessing        : 0.45
% 3.54/2.10  Parsing              : 0.24
% 3.54/2.10  CNF conversion       : 0.02
% 3.54/2.10  Main loop            : 0.50
% 3.54/2.10  Inferencing          : 0.19
% 3.54/2.10  Reduction            : 0.18
% 3.54/2.10  Demodulation         : 0.14
% 3.54/2.10  BG Simplification    : 0.02
% 3.54/2.10  Subsumption          : 0.08
% 3.54/2.10  Abstraction          : 0.03
% 3.54/2.10  MUC search           : 0.00
% 3.54/2.10  Cooper               : 0.00
% 3.54/2.10  Total                : 0.99
% 3.54/2.10  Index Insertion      : 0.00
% 3.54/2.10  Index Deletion       : 0.00
% 3.54/2.10  Index Matching       : 0.00
% 3.54/2.10  BG Taut test         : 0.00
%------------------------------------------------------------------------------