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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : HWV019-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 : n017.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:27 EDT 2023

% Result   : Unsatisfiable 7.68s 2.91s
% Output   : CNFRefutation 7.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   30
% Syntax   : Number of formulae    :   50 (  14 unt;  23 typ;   0 def)
%            Number of atoms       :   56 (   2 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   54 (  25   ~;  29   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 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   :    7 (;   7   !;   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_942,axiom,
    ~ p_Reset(t_139),
    file(unknown,unknown) ).

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

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

tff(f_452,axiom,
    ! [X_t_42] :
      ( p_Reset(X_t_42)
      | ~ p_Wr(X_t_42)
      | ~ p_Rd(X_t_42)
      | ~ p_Wr_error(plus(X_t_42,n1)) ),
    file(unknown,unknown) ).

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

tff(f_945,axiom,
    ( gt(fifo_length,level(t_139))
    | p_Rd(t_139) ),
    file(unknown,unknown) ).

tff(f_227,axiom,
    ! [X_t_42] :
      ( p_Reset(X_t_42)
      | ~ p_Wr(X_t_42)
      | p_Rd(X_t_42)
      | ~ gt(fifo_length,int_level(X_t_42))
      | ~ p_Wr_error(plus(X_t_42,n1)) ),
    file(unknown,unknown) ).

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

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

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

tff(c_631,plain,
    ! [X_t_42_192] :
      ( ~ p_Wr_error(plus(X_t_42_192,n1))
      | ~ p_Rd(X_t_42_192)
      | ~ p_Wr(X_t_42_192)
      | p_Reset(X_t_42_192) ),
    inference(cnfTransformation,[status(thm)],[f_452]) ).

tff(c_645,plain,
    ( ~ p_Rd(t_139)
    | ~ p_Wr(t_139)
    | p_Reset(t_139) ),
    inference(resolution,[status(thm)],[c_182,c_631]) ).

tff(c_649,plain,
    ( ~ p_Rd(t_139)
    | p_Reset(t_139) ),
    inference(demodulation,[status(thm),theory(equality)],[c_184,c_645]) ).

tff(c_650,plain,
    ~ p_Rd(t_139),
    inference(negUnitSimplification,[status(thm)],[c_186,c_649]) ).

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_188,plain,
    ( p_Rd(t_139)
    | gt(fifo_length,level(t_139)) ),
    inference(cnfTransformation,[status(thm)],[f_945]) ).

tff(c_189,plain,
    ( p_Rd(t_139)
    | gt(fifo_length,int_level(t_139)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_42,c_188]) ).

tff(c_274,plain,
    gt(fifo_length,int_level(t_139)),
    inference(splitLeft,[status(thm)],[c_189]) ).

tff(c_5321,plain,
    ! [X_t_42_347] :
      ( ~ p_Wr_error(plus(X_t_42_347,n1))
      | ~ gt(fifo_length,int_level(X_t_42_347))
      | p_Rd(X_t_42_347)
      | ~ p_Wr(X_t_42_347)
      | p_Reset(X_t_42_347) ),
    inference(cnfTransformation,[status(thm)],[f_227]) ).

tff(c_5348,plain,
    ( ~ p_Wr_error(plus(t_139,n1))
    | p_Rd(t_139)
    | ~ p_Wr(t_139)
    | p_Reset(t_139) ),
    inference(resolution,[status(thm)],[c_274,c_5321]) ).

tff(c_5361,plain,
    ( p_Rd(t_139)
    | p_Reset(t_139) ),
    inference(demodulation,[status(thm),theory(equality)],[c_184,c_182,c_5348]) ).

tff(c_5363,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_186,c_650,c_5361]) ).

tff(c_5364,plain,
    p_Rd(t_139),
    inference(splitRight,[status(thm)],[c_189]) ).

tff(c_5724,plain,
    ! [X_t_42_380] :
      ( ~ p_Wr_error(plus(X_t_42_380,n1))
      | ~ p_Rd(X_t_42_380)
      | ~ p_Wr(X_t_42_380)
      | p_Reset(X_t_42_380) ),
    inference(cnfTransformation,[status(thm)],[f_452]) ).

tff(c_5738,plain,
    ( ~ p_Rd(t_139)
    | ~ p_Wr(t_139)
    | p_Reset(t_139) ),
    inference(resolution,[status(thm)],[c_182,c_5724]) ).

tff(c_5742,plain,
    p_Reset(t_139),
    inference(demodulation,[status(thm),theory(equality)],[c_184,c_5364,c_5738]) ).

tff(c_5744,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_186,c_5742]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.20  % Problem  : HWV019-1 : TPTP v8.1.2. Released v2.5.0.
% 0.12/0.20  % 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.13/0.41  % Computer : n017.cluster.edu
% 0.13/0.41  % Model    : x86_64 x86_64
% 0.13/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.41  % Memory   : 8042.1875MB
% 0.13/0.41  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.41  % CPULimit : 300
% 0.13/0.41  % WCLimit  : 300
% 0.13/0.41  % DateTime : Thu Aug  3 23:15:51 EDT 2023
% 0.13/0.42  % CPUTime  : 
% 7.68/2.91  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.68/2.91  
% 7.68/2.91  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.87/2.94  
% 7.87/2.94  Inference rules
% 7.87/2.94  ----------------------
% 7.87/2.94  #Ref     : 4
% 7.87/2.94  #Sup     : 1204
% 7.87/2.94  #Fact    : 4
% 7.87/2.94  #Define  : 0
% 7.87/2.94  #Split   : 17
% 7.87/2.94  #Chain   : 0
% 7.87/2.94  #Close   : 0
% 7.87/2.94  
% 7.87/2.94  Ordering : KBO
% 7.87/2.94  
% 7.87/2.94  Simplification rules
% 7.87/2.94  ----------------------
% 7.87/2.94  #Subsume      : 352
% 7.87/2.94  #Demod        : 209
% 7.87/2.94  #Tautology    : 314
% 7.87/2.94  #SimpNegUnit  : 228
% 7.87/2.94  #BackRed      : 9
% 7.87/2.94  
% 7.87/2.94  #Partial instantiations: 0
% 7.87/2.94  #Strategies tried      : 1
% 7.87/2.94  
% 7.87/2.94  Timing (in seconds)
% 7.87/2.94  ----------------------
% 7.87/2.94  Preprocessing        : 0.72
% 7.87/2.94  Parsing              : 0.38
% 7.87/2.94  CNF conversion       : 0.05
% 7.87/2.94  Main loop            : 1.08
% 7.87/2.94  Inferencing          : 0.39
% 7.87/2.94  Reduction            : 0.31
% 7.87/2.94  Demodulation         : 0.19
% 7.87/2.94  BG Simplification    : 0.06
% 7.87/2.94  Subsumption          : 0.26
% 7.87/2.94  Abstraction          : 0.04
% 7.87/2.94  MUC search           : 0.00
% 7.87/2.94  Cooper               : 0.00
% 7.87/2.94  Total                : 1.85
% 7.87/2.94  Index Insertion      : 0.00
% 7.87/2.94  Index Deletion       : 0.00
% 7.87/2.94  Index Matching       : 0.00
% 7.87/2.94  BG Taut test         : 0.00
%------------------------------------------------------------------------------