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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : HWV014-1 : TPTP v8.1.2. Released v2.5.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 : n001.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:42:25 EDT 2023

% Result   : Unsatisfiable 7.68s 2.94s
% Output   : CNFRefutation 7.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   39
% Syntax   : Number of formulae    :   75 (  28 unt;  23 typ;   0 def)
%            Number of atoms       :   91 (  40 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   75 (  36   ~;  39   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   27 (  19   >;   8   *;   0   +;   0  <<)
%            Number of predicates  :   14 (  12 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   4 con; 0-2 aty)
%            Number of variables   :   42 (;  42   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ p_Mem > p_Data_out > p_Data_in > gt > def_10 > p_Wr_error > p_Wr > p_Reset > p_Rd_error > p_Rd > p_Full > p_Empty > plus > minus > #nlpp > y_27 > wr_level > rd_level > level > int_level > x_139 > n1 > n0 > fifo_length

%Foreground sorts:

%Background operators:

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

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

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

tff(p_Rd_error,type,
    p_Rd_error: $i > $o ).

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

tff(p_Wr,type,
    p_Wr: $i > $o ).

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

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

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

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

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

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

tff(p_Full,type,
    p_Full: $i > $o ).

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

tff(p_Reset,type,
    p_Reset: $i > $o ).

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

tff(p_Empty,type,
    p_Empty: $i > $o ).

tff(p_Wr_error,type,
    p_Wr_error: $i > $o ).

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

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

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

tff(p_Rd,type,
    p_Rd: $i > $o ).

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

tff(f_80,axiom,
    ! [Y_4,X_3] :
      ( ~ def_10(Y_4,X_3)
      | ( X_3 != Y_4 ) ),
    file(unknown,unknown) ).

tff(f_944,axiom,
    ~ p_Reset(x_139),
    file(unknown,unknown) ).

tff(f_942,axiom,
    ~ p_Wr(x_139),
    file(unknown,unknown) ).

tff(f_61,axiom,
    ! [X_3,Y_4,Z_5] :
      ( ( minus(X_3,Y_4) != Z_5 )
      | ( plus(Z_5,Y_4) = X_3 )
      | def_10(Y_4,X_3) ),
    file(unknown,unknown) ).

tff(f_47,axiom,
    ! [X_0] : ( plus(X_0,n1) != n0 ),
    file(unknown,unknown) ).

tff(f_133,axiom,
    ! [X_26] :
      ( ( X_26 = n0 )
      | ( X_26 = plus(y_27(X_26),n1) ) ),
    file(unknown,unknown) ).

tff(f_141,axiom,
    ! [X_29,Y_30] :
      ( ( plus(X_29,n1) != plus(Y_30,n1) )
      | ( X_29 = Y_30 ) ),
    file(unknown,unknown) ).

tff(f_146,axiom,
    ! [X_t_32] : ( level(X_t_32) = int_level(X_t_32) ),
    file(unknown,unknown) ).

tff(f_939,axiom,
    gt(level(x_139),n0),
    file(unknown,unknown) ).

tff(f_143,axiom,
    ! [X_31] : ( plus(n0,X_31) = X_31 ),
    file(unknown,unknown) ).

tff(f_85,axiom,
    ! [Y_12,X_11] :
      ( ~ gt(Y_12,X_11)
      | gt(plus(Y_12,n1),plus(X_11,n1)) ),
    file(unknown,unknown) ).

tff(f_104,axiom,
    ! [X_15,Y_16] :
      ( ~ gt(plus(X_15,n1),Y_16)
      | gt(X_15,Y_16)
      | ( X_15 = Y_16 ) ),
    file(unknown,unknown) ).

tff(f_74,axiom,
    ! [Y_4,X_3] :
      ( ~ def_10(Y_4,X_3)
      | ~ gt(X_3,Y_4) ),
    file(unknown,unknown) ).

tff(f_946,axiom,
    level(plus(x_139,n1)) != minus(level(x_139),n1),
    file(unknown,unknown) ).

tff(f_940,axiom,
    p_Rd(x_139),
    file(unknown,unknown) ).

tff(f_720,axiom,
    ! [X_t_42] :
      ( p_Reset(X_t_42)
      | p_Wr(X_t_42)
      | ~ p_Rd(X_t_42)
      | ~ gt(int_level(X_t_42),n0)
      | ( int_level(plus(X_t_42,n1)) = minus(int_level(X_t_42),n1) ) ),
    file(unknown,unknown) ).

tff(c_14,plain,
    ! [Y_4_12] : ~ def_10(Y_4_12,Y_4_12),
    inference(cnfTransformation,[status(thm)],[f_80]) ).

tff(c_188,plain,
    ~ p_Reset(x_139),
    inference(cnfTransformation,[status(thm)],[f_944]) ).

tff(c_186,plain,
    ~ p_Wr(x_139),
    inference(cnfTransformation,[status(thm)],[f_942]) ).

tff(c_8,plain,
    ! [Y_4_5,X_3_4] :
      ( def_10(Y_4_5,X_3_4)
      | ( plus(minus(X_3_4,Y_4_5),Y_4_5) = X_3_4 ) ),
    inference(cnfTransformation,[status(thm)],[f_61]) ).

tff(c_2,plain,
    ! [X_0_1] : ( plus(X_0_1,n1) != n0 ),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_32,plain,
    ! [X_26_30] :
      ( ( plus(y_27(X_26_30),n1) = X_26_30 )
      | ( n0 = X_26_30 ) ),
    inference(cnfTransformation,[status(thm)],[f_133]) ).

tff(c_369,plain,
    ! [Y_30_168,X_29_169] :
      ( ( Y_30_168 = X_29_169 )
      | ( plus(Y_30_168,n1) != plus(X_29_169,n1) ) ),
    inference(cnfTransformation,[status(thm)],[f_141]) ).

tff(c_375,plain,
    ! [X_26_30,Y_30_168] :
      ( ( y_27(X_26_30) = Y_30_168 )
      | ( plus(Y_30_168,n1) != X_26_30 )
      | ( n0 = X_26_30 ) ),
    inference(superposition,[status(thm),theory(equality)],[c_32,c_369]) ).

tff(c_2092,plain,
    ! [Y_30_168] :
      ( ( y_27(plus(Y_30_168,n1)) = Y_30_168 )
      | ( plus(Y_30_168,n1) = n0 ) ),
    inference(reflexivity,[status(thm),theory(equality)],[c_375]) ).

tff(c_2106,plain,
    ! [Y_30_246] : ( y_27(plus(Y_30_246,n1)) = Y_30_246 ),
    inference(negUnitSimplification,[status(thm)],[c_2,c_2092]) ).

tff(c_2240,plain,
    ! [X_3_248] :
      ( ( minus(X_3_248,n1) = y_27(X_3_248) )
      | def_10(n1,X_3_248) ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_2106]) ).

tff(c_42,plain,
    ! [X_t_32_35] : ( level(X_t_32_35) = int_level(X_t_32_35) ),
    inference(cnfTransformation,[status(thm)],[f_146]) ).

tff(c_182,plain,
    gt(level(x_139),n0),
    inference(cnfTransformation,[status(thm)],[f_939]) ).

tff(c_191,plain,
    gt(int_level(x_139),n0),
    inference(demodulation,[status(thm),theory(equality)],[c_42,c_182]) ).

tff(c_38,plain,
    ! [X_31_34] : ( plus(n0,X_31_34) = X_31_34 ),
    inference(cnfTransformation,[status(thm)],[f_143]) ).

tff(c_853,plain,
    ! [Y_12_207,X_11_208] :
      ( gt(plus(Y_12_207,n1),plus(X_11_208,n1))
      | ~ gt(Y_12_207,X_11_208) ),
    inference(cnfTransformation,[status(thm)],[f_85]) ).

tff(c_889,plain,
    ! [Y_12_207] :
      ( gt(plus(Y_12_207,n1),n1)
      | ~ gt(Y_12_207,n0) ),
    inference(superposition,[status(thm),theory(equality)],[c_38,c_853]) ).

tff(c_970,plain,
    ! [Y_16_212,X_15_213] :
      ( ( Y_16_212 = X_15_213 )
      | gt(X_15_213,Y_16_212)
      | ~ gt(plus(X_15_213,n1),Y_16_212) ),
    inference(cnfTransformation,[status(thm)],[f_104]) ).

tff(c_1121,plain,
    ! [Y_12_216] :
      ( ( n1 = Y_12_216 )
      | gt(Y_12_216,n1)
      | ~ gt(Y_12_216,n0) ),
    inference(resolution,[status(thm)],[c_889,c_970]) ).

tff(c_12,plain,
    ! [X_3_11,Y_4_10] :
      ( ~ gt(X_3_11,Y_4_10)
      | ~ def_10(Y_4_10,X_3_11) ),
    inference(cnfTransformation,[status(thm)],[f_74]) ).

tff(c_1921,plain,
    ! [Y_12_239] :
      ( ~ def_10(n1,Y_12_239)
      | ( n1 = Y_12_239 )
      | ~ gt(Y_12_239,n0) ),
    inference(resolution,[status(thm)],[c_1121,c_12]) ).

tff(c_1974,plain,
    ( ~ def_10(n1,int_level(x_139))
    | ( int_level(x_139) = n1 ) ),
    inference(resolution,[status(thm)],[c_191,c_1921]) ).

tff(c_1991,plain,
    ~ def_10(n1,int_level(x_139)),
    inference(splitLeft,[status(thm)],[c_1974]) ).

tff(c_2263,plain,
    minus(int_level(x_139),n1) = y_27(int_level(x_139)),
    inference(resolution,[status(thm)],[c_2240,c_1991]) ).

tff(c_190,plain,
    minus(level(x_139),n1) != level(plus(x_139,n1)),
    inference(cnfTransformation,[status(thm)],[f_946]) ).

tff(c_192,plain,
    minus(int_level(x_139),n1) != int_level(plus(x_139,n1)),
    inference(demodulation,[status(thm),theory(equality)],[c_42,c_42,c_190]) ).

tff(c_2274,plain,
    y_27(int_level(x_139)) != int_level(plus(x_139,n1)),
    inference(demodulation,[status(thm),theory(equality)],[c_2263,c_192]) ).

tff(c_184,plain,
    p_Rd(x_139),
    inference(cnfTransformation,[status(thm)],[f_940]) ).

tff(c_5943,plain,
    ! [X_t_42_333] :
      ( ( minus(int_level(X_t_42_333),n1) = int_level(plus(X_t_42_333,n1)) )
      | ~ gt(int_level(X_t_42_333),n0)
      | ~ p_Rd(X_t_42_333)
      | p_Wr(X_t_42_333)
      | p_Reset(X_t_42_333) ),
    inference(cnfTransformation,[status(thm)],[f_720]) ).

tff(c_5991,plain,
    ( ( minus(int_level(x_139),n1) = int_level(plus(x_139,n1)) )
    | ~ p_Rd(x_139)
    | p_Wr(x_139)
    | p_Reset(x_139) ),
    inference(resolution,[status(thm)],[c_191,c_5943]) ).

tff(c_6011,plain,
    ( ( y_27(int_level(x_139)) = int_level(plus(x_139,n1)) )
    | p_Wr(x_139)
    | p_Reset(x_139) ),
    inference(demodulation,[status(thm),theory(equality)],[c_184,c_2263,c_5991]) ).

tff(c_6013,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_188,c_186,c_2274,c_6011]) ).

tff(c_6014,plain,
    int_level(x_139) = n1,
    inference(splitRight,[status(thm)],[c_1974]) ).

tff(c_6015,plain,
    def_10(n1,int_level(x_139)),
    inference(splitRight,[status(thm)],[c_1974]) ).

tff(c_6026,plain,
    def_10(n1,n1),
    inference(demodulation,[status(thm),theory(equality)],[c_6014,c_6015]) ).

tff(c_6027,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_14,c_6026]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : HWV014-1 : TPTP v8.1.2. Released v2.5.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.36  % Computer : n001.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Fri Aug  4 00:25:26 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 7.68/2.94  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.68/2.94  
% 7.68/2.94  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.68/2.97  
% 7.68/2.97  Inference rules
% 7.68/2.97  ----------------------
% 7.68/2.97  #Ref     : 2
% 7.68/2.97  #Sup     : 1284
% 7.68/2.97  #Fact    : 2
% 7.68/2.97  #Define  : 0
% 7.68/2.97  #Split   : 10
% 7.68/2.97  #Chain   : 0
% 7.68/2.97  #Close   : 0
% 7.68/2.97  
% 7.68/2.97  Ordering : KBO
% 7.68/2.97  
% 7.68/2.97  Simplification rules
% 7.68/2.97  ----------------------
% 7.68/2.97  #Subsume      : 434
% 7.68/2.97  #Demod        : 293
% 7.68/2.97  #Tautology    : 342
% 7.68/2.97  #SimpNegUnit  : 288
% 7.68/2.97  #BackRed      : 6
% 7.68/2.97  
% 7.68/2.97  #Partial instantiations: 0
% 7.68/2.97  #Strategies tried      : 1
% 7.68/2.97  
% 7.68/2.97  Timing (in seconds)
% 7.68/2.97  ----------------------
% 7.68/2.98  Preprocessing        : 0.72
% 7.68/2.98  Parsing              : 0.37
% 7.68/2.98  CNF conversion       : 0.05
% 7.68/2.98  Main loop            : 1.14
% 7.68/2.98  Inferencing          : 0.38
% 7.68/2.98  Reduction            : 0.34
% 7.68/2.98  Demodulation         : 0.21
% 7.68/2.98  BG Simplification    : 0.06
% 7.68/2.98  Subsumption          : 0.28
% 7.68/2.98  Abstraction          : 0.04
% 7.68/2.98  MUC search           : 0.00
% 7.68/2.98  Cooper               : 0.00
% 7.68/2.98  Total                : 1.91
% 7.68/2.98  Index Insertion      : 0.00
% 7.68/2.98  Index Deletion       : 0.00
% 7.68/2.98  Index Matching       : 0.00
% 7.68/2.98  BG Taut test         : 0.00
%------------------------------------------------------------------------------