TSTP Solution File: RNG003-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : RNG003-1 : 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 : n013.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:40 EDT 2023

% Result   : Unsatisfiable 4.88s 2.32s
% Output   : CNFRefutation 4.88s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   42 (  18 unt;  10 typ;   0 def)
%            Number of atoms       :   54 (  11 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   46 (  24   ~;  22   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   11 (   5   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   49 (;  49   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ sum > product > multiply > add > #nlpp > additive_inverse > d > c > b > additive_identity > a

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(sum,type,
    sum: ( $i * $i * $i ) > $o ).

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

tff(product,type,
    product: ( $i * $i * $i ) > $o ).

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

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

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

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

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

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

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

tff(f_185,axiom,
    a != b,
    file(unknown,unknown) ).

tff(f_55,axiom,
    ! [X] : sum(additive_inverse(X),X,additive_identity),
    file(unknown,unknown) ).

tff(f_182,axiom,
    sum(a,c,d),
    file(unknown,unknown) ).

tff(f_84,axiom,
    ! [X,Y,Z] :
      ( ~ sum(X,Y,Z)
      | sum(Y,X,Z) ),
    file(unknown,unknown) ).

tff(f_47,axiom,
    ! [X] : sum(additive_identity,X,X),
    file(unknown,unknown) ).

tff(f_68,axiom,
    ! [W,U,Z,X,Y,V] :
      ( ~ sum(X,Y,U)
      | ~ sum(Y,Z,V)
      | ~ sum(U,Z,W)
      | sum(X,V,W) ),
    file(unknown,unknown) ).

tff(f_183,axiom,
    sum(b,c,d),
    file(unknown,unknown) ).

tff(f_53,axiom,
    ! [X,Y] : sum(X,Y,add(X,Y)),
    file(unknown,unknown) ).

tff(f_171,axiom,
    ! [X,Y,U,V] :
      ( ~ sum(X,Y,U)
      | ~ sum(X,Y,V)
      | ( U = V ) ),
    file(unknown,unknown) ).

tff(c_40,plain,
    b != a,
    inference(cnfTransformation,[status(thm)],[f_185]) ).

tff(c_10,plain,
    ! [X_7] : sum(additive_inverse(X_7),X_7,additive_identity),
    inference(cnfTransformation,[status(thm)],[f_55]) ).

tff(c_36,plain,
    sum(a,c,d),
    inference(cnfTransformation,[status(thm)],[f_182]) ).

tff(c_47,plain,
    ! [Y_80,X_81,Z_82] :
      ( sum(Y_80,X_81,Z_82)
      | ~ sum(X_81,Y_80,Z_82) ),
    inference(cnfTransformation,[status(thm)],[f_84]) ).

tff(c_67,plain,
    sum(c,a,d),
    inference(resolution,[status(thm)],[c_36,c_47]) ).

tff(c_2,plain,
    ! [X_1] : sum(additive_identity,X_1,X_1),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_250,plain,
    ! [Y_108,Z_111,V_109,W_106,X_107,U_110] :
      ( sum(X_107,V_109,W_106)
      | ~ sum(U_110,Z_111,W_106)
      | ~ sum(Y_108,Z_111,V_109)
      | ~ sum(X_107,Y_108,U_110) ),
    inference(cnfTransformation,[status(thm)],[f_68]) ).

tff(c_775,plain,
    ! [X_151,V_152,X_153,Y_154] :
      ( sum(X_151,V_152,X_153)
      | ~ sum(Y_154,X_153,V_152)
      | ~ sum(X_151,Y_154,additive_identity) ),
    inference(resolution,[status(thm)],[c_2,c_250]) ).

tff(c_798,plain,
    ! [X_151] :
      ( sum(X_151,d,a)
      | ~ sum(X_151,c,additive_identity) ),
    inference(resolution,[status(thm)],[c_67,c_775]) ).

tff(c_38,plain,
    sum(b,c,d),
    inference(cnfTransformation,[status(thm)],[f_183]) ).

tff(c_72,plain,
    sum(c,b,d),
    inference(resolution,[status(thm)],[c_38,c_47]) ).

tff(c_806,plain,
    ! [X_155] :
      ( sum(X_155,d,b)
      | ~ sum(X_155,c,additive_identity) ),
    inference(resolution,[status(thm)],[c_72,c_775]) ).

tff(c_8,plain,
    ! [X_5,Y_6] : sum(X_5,Y_6,add(X_5,Y_6)),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_96,plain,
    ! [V_92,U_93,X_94,Y_95] :
      ( ( V_92 = U_93 )
      | ~ sum(X_94,Y_95,V_92)
      | ~ sum(X_94,Y_95,U_93) ),
    inference(cnfTransformation,[status(thm)],[f_171]) ).

tff(c_120,plain,
    ! [X_5,Y_6,U_93] :
      ( ( add(X_5,Y_6) = U_93 )
      | ~ sum(X_5,Y_6,U_93) ),
    inference(resolution,[status(thm)],[c_8,c_96]) ).

tff(c_1752,plain,
    ! [X_218] :
      ( ( add(X_218,d) = b )
      | ~ sum(X_218,c,additive_identity) ),
    inference(resolution,[status(thm)],[c_806,c_120]) ).

tff(c_1757,plain,
    add(additive_inverse(c),d) = b,
    inference(resolution,[status(thm)],[c_10,c_1752]) ).

tff(c_1770,plain,
    sum(additive_inverse(c),d,b),
    inference(superposition,[status(thm),theory(equality)],[c_1757,c_8]) ).

tff(c_32,plain,
    ! [V_67,U_66,X_64,Y_65] :
      ( ( V_67 = U_66 )
      | ~ sum(X_64,Y_65,V_67)
      | ~ sum(X_64,Y_65,U_66) ),
    inference(cnfTransformation,[status(thm)],[f_171]) ).

tff(c_1891,plain,
    ! [U_222] :
      ( ( b = U_222 )
      | ~ sum(additive_inverse(c),d,U_222) ),
    inference(resolution,[status(thm)],[c_1770,c_32]) ).

tff(c_1914,plain,
    ( ( b = a )
    | ~ sum(additive_inverse(c),c,additive_identity) ),
    inference(resolution,[status(thm)],[c_798,c_1891]) ).

tff(c_1935,plain,
    b = a,
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_1914]) ).

tff(c_1937,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_40,c_1935]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : RNG003-1 : 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.14/0.37  % Computer : n013.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit : 300
% 0.14/0.37  % WCLimit  : 300
% 0.14/0.37  % DateTime : Thu Aug  3 17:51:33 EDT 2023
% 0.14/0.37  % CPUTime  : 
% 4.88/2.32  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.88/2.33  
% 4.88/2.33  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.88/2.35  
% 4.88/2.35  Inference rules
% 4.88/2.35  ----------------------
% 4.88/2.35  #Ref     : 0
% 4.88/2.35  #Sup     : 466
% 4.88/2.35  #Fact    : 0
% 4.88/2.35  #Define  : 0
% 4.88/2.35  #Split   : 13
% 4.88/2.36  #Chain   : 0
% 4.88/2.36  #Close   : 0
% 4.88/2.36  
% 4.88/2.36  Ordering : KBO
% 4.88/2.36  
% 4.88/2.36  Simplification rules
% 4.88/2.36  ----------------------
% 4.88/2.36  #Subsume      : 13
% 4.88/2.36  #Demod        : 180
% 4.88/2.36  #Tautology    : 213
% 4.88/2.36  #SimpNegUnit  : 1
% 4.88/2.36  #BackRed      : 0
% 4.88/2.36  
% 4.88/2.36  #Partial instantiations: 0
% 4.88/2.36  #Strategies tried      : 1
% 4.88/2.36  
% 4.88/2.36  Timing (in seconds)
% 4.88/2.36  ----------------------
% 4.88/2.36  Preprocessing        : 0.49
% 4.88/2.36  Parsing              : 0.26
% 4.88/2.36  CNF conversion       : 0.03
% 4.88/2.36  Main loop            : 0.75
% 4.88/2.36  Inferencing          : 0.27
% 4.88/2.36  Reduction            : 0.21
% 4.88/2.36  Demodulation         : 0.15
% 4.88/2.36  BG Simplification    : 0.03
% 4.88/2.36  Subsumption          : 0.19
% 4.88/2.36  Abstraction          : 0.03
% 4.88/2.36  MUC search           : 0.00
% 4.88/2.36  Cooper               : 0.00
% 4.88/2.36  Total                : 1.28
% 4.88/2.36  Index Insertion      : 0.00
% 4.88/2.36  Index Deletion       : 0.00
% 4.88/2.36  Index Matching       : 0.00
% 4.88/2.36  BG Taut test         : 0.00
%------------------------------------------------------------------------------