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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : RNG010-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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 : n019.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:43 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ associator > multiply > add > #nlpp > additive_inverse > cz > cy > cx > additive_identity

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

tff(c_18,plain,
    ! [X_14,Y_15] : ( multiply(multiply(X_14,Y_15),Y_15) = multiply(X_14,multiply(Y_15,Y_15)) ),
    inference(cnfTransformation,[status(thm)],[f_73]) ).

tff(c_1017,plain,
    ! [Y_103,X_104] : ( multiply(multiply(Y_103,X_104),Y_103) != multiply(Y_103,multiply(X_104,Y_103)) ),
    inference(cnfTransformation,[status(thm)],[f_109]) ).

tff(c_1051,plain,
    $false,
    inference(superposition,[status(thm),theory(equality)],[c_18,c_1017]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : RNG010-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.15/0.15  % 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.15/0.37  % Computer : n019.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 17:56:46 EDT 2023
% 0.15/0.37  % CPUTime  : 
% 3.98/2.12  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.98/2.12  
% 3.98/2.12  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.98/2.14  
% 3.98/2.14  Inference rules
% 3.98/2.14  ----------------------
% 3.98/2.14  #Ref     : 3
% 3.98/2.14  #Sup     : 247
% 3.98/2.14  #Fact    : 0
% 3.98/2.14  #Define  : 0
% 3.98/2.14  #Split   : 0
% 3.98/2.14  #Chain   : 0
% 3.98/2.14  #Close   : 0
% 3.98/2.14  
% 3.98/2.14  Ordering : KBO
% 3.98/2.14  
% 3.98/2.14  Simplification rules
% 3.98/2.14  ----------------------
% 3.98/2.14  #Subsume      : 39
% 3.98/2.14  #Demod        : 138
% 3.98/2.14  #Tautology    : 131
% 3.98/2.14  #SimpNegUnit  : 0
% 3.98/2.14  #BackRed      : 0
% 3.98/2.14  
% 3.98/2.15  #Partial instantiations: 0
% 3.98/2.15  #Strategies tried      : 1
% 3.98/2.15  
% 3.98/2.15  Timing (in seconds)
% 3.98/2.15  ----------------------
% 3.98/2.15  Preprocessing        : 0.52
% 3.98/2.15  Parsing              : 0.26
% 3.98/2.15  CNF conversion       : 0.03
% 3.98/2.15  Main loop            : 0.43
% 3.98/2.15  Inferencing          : 0.15
% 3.98/2.15  Reduction            : 0.14
% 3.98/2.15  Demodulation         : 0.11
% 3.98/2.15  BG Simplification    : 0.03
% 3.98/2.15  Subsumption          : 0.08
% 3.98/2.15  Abstraction          : 0.02
% 3.98/2.15  MUC search           : 0.00
% 3.98/2.15  Cooper               : 0.00
% 3.98/2.15  Total                : 0.99
% 3.98/2.15  Index Insertion      : 0.00
% 3.98/2.15  Index Deletion       : 0.00
% 3.98/2.15  Index Matching       : 0.00
% 3.98/2.15  BG Taut test         : 0.00
%------------------------------------------------------------------------------