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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : HWV021-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/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 : 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:28 EDT 2023

% Result   : Unsatisfiable 20.96s 8.87s
% Output   : CNFRefutation 21.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   39
% Syntax   : Number of formulae    :   72 (  20 unt;  23 typ;   0 def)
%            Number of atoms       :  114 (  22 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  118 (  53   ~;  65   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   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   :   45 (;  45   !;   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 > t_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(t_139,type,
    t_139: $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(level,type,
    level: $i > $i ).

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

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

tff(f_161,axiom,
    ! [X_t_35] :
      ( ( int_level(X_t_35) != n0 )
      | p_Empty(X_t_35) ),
    file(unknown,unknown) ).

tff(f_944,axiom,
    ~ p_Empty(t_139),
    file(unknown,unknown) ).

tff(f_942,axiom,
    ~ p_Reset(t_139),
    file(unknown,unknown) ).

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

tff(f_939,axiom,
    p_Rd_error(plus(t_139,n1)),
    file(unknown,unknown) ).

tff(f_136,axiom,
    ! [X_28] : ~ gt(X_28,X_28),
    file(unknown,unknown) ).

tff(f_47,axiom,
    ! [X_0] : ( plus(X_0,n1) != 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_49,axiom,
    ! [X_1] : gt(plus(X_1,n1),n0),
    file(unknown,unknown) ).

tff(f_118,axiom,
    ! [Z_21,Y_20,X_19] :
      ( ~ gt(Z_21,Y_20)
      | gt(Z_21,X_19)
      | ~ gt(Y_20,X_19) ),
    file(unknown,unknown) ).

tff(f_110,axiom,
    ! [Y_18,X_17] :
      ( gt(Y_18,X_17)
      | ( X_17 = Y_18 )
      | gt(X_17,Y_18) ),
    file(unknown,unknown) ).

tff(f_466,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)
      | ~ p_Rd_error(plus(X_t_42,n1)) ),
    file(unknown,unknown) ).

tff(f_129,axiom,
    ! [X_25] :
      ( ( X_25 = n0 )
      | gt(X_25,n0) ),
    file(unknown,unknown) ).

tff(f_708,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)
      | ~ p_Rd_error(plus(X_t_42,n1)) ),
    file(unknown,unknown) ).

tff(c_222,plain,
    ! [X_t_35_148] :
      ( p_Empty(X_t_35_148)
      | ( int_level(X_t_35_148) != n0 ) ),
    inference(cnfTransformation,[status(thm)],[f_161]) ).

tff(c_188,plain,
    ~ p_Empty(t_139),
    inference(cnfTransformation,[status(thm)],[f_944]) ).

tff(c_230,plain,
    int_level(t_139) != n0,
    inference(resolution,[status(thm)],[c_222,c_188]) ).

tff(c_186,plain,
    ~ p_Reset(t_139),
    inference(cnfTransformation,[status(thm)],[f_942]) ).

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

tff(c_182,plain,
    p_Rd_error(plus(t_139,n1)),
    inference(cnfTransformation,[status(thm)],[f_939]) ).

tff(c_34,plain,
    ! [X_28_31] : ~ gt(X_28_31,X_28_31),
    inference(cnfTransformation,[status(thm)],[f_136]) ).

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

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

tff(c_632,plain,
    ! [Y_12_194,X_11_195] :
      ( gt(plus(Y_12_194,n1),plus(X_11_195,n1))
      | ~ gt(Y_12_194,X_11_195) ),
    inference(cnfTransformation,[status(thm)],[f_85]) ).

tff(c_661,plain,
    ! [X_11_195] :
      ( gt(n1,plus(X_11_195,n1))
      | ~ gt(n0,X_11_195) ),
    inference(superposition,[status(thm),theory(equality)],[c_38,c_632]) ).

tff(c_763,plain,
    ! [Y_16_200,X_15_201] :
      ( ( Y_16_200 = X_15_201 )
      | gt(X_15_201,Y_16_200)
      | ~ gt(plus(X_15_201,n1),Y_16_200) ),
    inference(cnfTransformation,[status(thm)],[f_104]) ).

tff(c_820,plain,
    ! [Y_16_202] :
      ( ( n0 = Y_16_202 )
      | gt(n0,Y_16_202)
      | ~ gt(n1,Y_16_202) ),
    inference(superposition,[status(thm),theory(equality)],[c_38,c_763]) ).

tff(c_823,plain,
    ! [X_11_195] :
      ( ( plus(X_11_195,n1) = n0 )
      | gt(n0,plus(X_11_195,n1))
      | ~ gt(n0,X_11_195) ),
    inference(resolution,[status(thm)],[c_661,c_820]) ).

tff(c_991,plain,
    ! [X_11_211] :
      ( gt(n0,plus(X_11_211,n1))
      | ~ gt(n0,X_11_211) ),
    inference(negUnitSimplification,[status(thm)],[c_2,c_823]) ).

tff(c_4,plain,
    ! [X_1_2] : gt(plus(X_1_2,n1),n0),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_476,plain,
    ! [Y_20_181,X_19_182,Z_21_183] :
      ( ~ gt(Y_20_181,X_19_182)
      | gt(Z_21_183,X_19_182)
      | ~ gt(Z_21_183,Y_20_181) ),
    inference(cnfTransformation,[status(thm)],[f_118]) ).

tff(c_497,plain,
    ! [Z_21_183,X_1_2] :
      ( gt(Z_21_183,n0)
      | ~ gt(Z_21_183,plus(X_1_2,n1)) ),
    inference(resolution,[status(thm)],[c_4,c_476]) ).

tff(c_994,plain,
    ! [X_11_211] :
      ( gt(n0,n0)
      | ~ gt(n0,X_11_211) ),
    inference(resolution,[status(thm)],[c_991,c_497]) ).

tff(c_1015,plain,
    ! [X_11_211] : ~ gt(n0,X_11_211),
    inference(negUnitSimplification,[status(thm)],[c_34,c_994]) ).

tff(c_24,plain,
    ! [X_17_23,Y_18_22] :
      ( gt(X_17_23,Y_18_22)
      | ( Y_18_22 = X_17_23 )
      | gt(Y_18_22,X_17_23) ),
    inference(cnfTransformation,[status(thm)],[f_110]) ).

tff(c_4044,plain,
    ! [X_t_42_303] :
      ( ~ p_Rd_error(plus(X_t_42_303,n1))
      | ~ gt(int_level(X_t_42_303),n0)
      | ~ p_Rd(X_t_42_303)
      | ~ p_Wr(X_t_42_303)
      | p_Reset(X_t_42_303) ),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_4074,plain,
    ! [X_t_42_303] :
      ( ~ p_Rd_error(plus(X_t_42_303,n1))
      | ~ p_Rd(X_t_42_303)
      | ~ p_Wr(X_t_42_303)
      | p_Reset(X_t_42_303)
      | gt(n0,int_level(X_t_42_303))
      | ( int_level(X_t_42_303) = n0 ) ),
    inference(resolution,[status(thm)],[c_24,c_4044]) ).

tff(c_116413,plain,
    ! [X_t_42_23161] :
      ( ~ p_Rd_error(plus(X_t_42_23161,n1))
      | ~ p_Rd(X_t_42_23161)
      | ~ p_Wr(X_t_42_23161)
      | p_Reset(X_t_42_23161)
      | ( int_level(X_t_42_23161) = n0 ) ),
    inference(negUnitSimplification,[status(thm)],[c_1015,c_4074]) ).

tff(c_116601,plain,
    ( ~ p_Rd(t_139)
    | ~ p_Wr(t_139)
    | p_Reset(t_139)
    | ( int_level(t_139) = n0 ) ),
    inference(resolution,[status(thm)],[c_182,c_116413]) ).

tff(c_116615,plain,
    ( ~ p_Wr(t_139)
    | p_Reset(t_139)
    | ( int_level(t_139) = n0 ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_184,c_116601]) ).

tff(c_116616,plain,
    ~ p_Wr(t_139),
    inference(negUnitSimplification,[status(thm)],[c_230,c_186,c_116615]) ).

tff(c_30,plain,
    ! [X_25_29] :
      ( gt(X_25_29,n0)
      | ( n0 = X_25_29 ) ),
    inference(cnfTransformation,[status(thm)],[f_129]) ).

tff(c_3775,plain,
    ! [X_t_42_296] :
      ( ~ p_Rd_error(plus(X_t_42_296,n1))
      | ~ gt(int_level(X_t_42_296),n0)
      | ~ p_Rd(X_t_42_296)
      | p_Wr(X_t_42_296)
      | p_Reset(X_t_42_296) ),
    inference(cnfTransformation,[status(thm)],[f_708]) ).

tff(c_125051,plain,
    ! [X_t_42_24582] :
      ( ~ p_Rd_error(plus(X_t_42_24582,n1))
      | ~ p_Rd(X_t_42_24582)
      | p_Wr(X_t_42_24582)
      | p_Reset(X_t_42_24582)
      | ( int_level(X_t_42_24582) = n0 ) ),
    inference(resolution,[status(thm)],[c_30,c_3775]) ).

tff(c_125239,plain,
    ( ~ p_Rd(t_139)
    | p_Wr(t_139)
    | p_Reset(t_139)
    | ( int_level(t_139) = n0 ) ),
    inference(resolution,[status(thm)],[c_182,c_125051]) ).

tff(c_125253,plain,
    ( p_Wr(t_139)
    | p_Reset(t_139)
    | ( int_level(t_139) = n0 ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_184,c_125239]) ).

tff(c_125255,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_230,c_186,c_116616,c_125253]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : HWV021-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/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.14/0.36  % Computer : n001.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Fri Aug  4 00:33:41 EDT 2023
% 0.14/0.37  % CPUTime  : 
% 20.96/8.87  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 20.96/8.87  
% 20.96/8.87  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 21.03/8.90  
% 21.03/8.90  Inference rules
% 21.03/8.90  ----------------------
% 21.03/8.90  #Ref     : 8
% 21.03/8.90  #Sup     : 14505
% 21.03/8.90  #Fact    : 15
% 21.03/8.90  #Define  : 0
% 21.03/8.90  #Split   : 16
% 21.03/8.90  #Chain   : 0
% 21.03/8.90  #Close   : 0
% 21.03/8.90  
% 21.03/8.90  Ordering : KBO
% 21.03/8.90  
% 21.03/8.90  Simplification rules
% 21.03/8.90  ----------------------
% 21.03/8.90  #Subsume      : 5282
% 21.03/8.90  #Demod        : 7701
% 21.03/8.90  #Tautology    : 5002
% 21.03/8.90  #SimpNegUnit  : 1440
% 21.03/8.90  #BackRed      : 2
% 21.03/8.90  
% 21.03/8.90  #Partial instantiations: 29238
% 21.03/8.90  #Strategies tried      : 1
% 21.03/8.90  
% 21.03/8.90  Timing (in seconds)
% 21.03/8.90  ----------------------
% 21.03/8.91  Preprocessing        : 0.75
% 21.03/8.91  Parsing              : 0.40
% 21.03/8.91  CNF conversion       : 0.05
% 21.03/8.91  Main loop            : 7.00
% 21.03/8.91  Inferencing          : 1.49
% 21.03/8.91  Reduction            : 2.00
% 21.03/8.91  Demodulation         : 1.14
% 21.03/8.91  BG Simplification    : 0.13
% 21.03/8.91  Subsumption          : 3.11
% 21.03/8.91  Abstraction          : 0.14
% 21.03/8.91  MUC search           : 0.00
% 21.03/8.91  Cooper               : 0.00
% 21.03/8.91  Total                : 7.80
% 21.03/8.91  Index Insertion      : 0.00
% 21.03/8.91  Index Deletion       : 0.00
% 21.03/8.91  Index Matching       : 0.00
% 21.03/8.91  BG Taut test         : 0.00
%------------------------------------------------------------------------------