↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : HWV030-1 : TPTP v9.0.0. 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 : n020.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 : Wed Apr  9 06:46:51 PM UTC 2025

% Result   : Unsatisfiable 4.64s 2.06s
% Output   : CNFRefutation 4.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   10 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   13 (   2 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    9 (   6   ~;   3   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   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   :    2 (   2   !;   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_939,axiom,
    p_Reset(t_139),
    file(unknown,unknown) ).

tff(f_942,axiom,
    gt(fifo_length,n0),
    file(unknown,unknown) ).

tff(f_176,axiom,
    ! [X_t_37] :
      ( ~ p_Reset(X_t_37)
      | ( wr_level(plus(X_t_37,n1)) = n0 ) ),
    file(unknown,unknown) ).

tff(f_941,axiom,
    ~ gt(fifo_length,wr_level(plus(t_139,n1))),
    file(unknown,unknown) ).

tff(c_182,plain,
    p_Reset(t_139),
    inference(cnfTransformation,[status(thm)],[f_939]) ).

tff(c_186,plain,
    gt(fifo_length,n0),
    inference(cnfTransformation,[status(thm)],[f_942]) ).

tff(c_293,plain,
    ! [X_t_37_158] :
      ( ( wr_level(plus(X_t_37_158,n1)) = n0 )
      | ~ p_Reset(X_t_37_158) ),
    inference(cnfTransformation,[status(thm)],[f_176]) ).

tff(c_184,plain,
    ~ gt(fifo_length,wr_level(plus(t_139,n1))),
    inference(cnfTransformation,[status(thm)],[f_941]) ).

tff(c_299,plain,
    ( ~ gt(fifo_length,n0)
    | ~ p_Reset(t_139) ),
    inference(superposition,[status(thm),theory(equality)],[c_293,c_184]) ).

tff(c_313,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_182,c_186,c_299]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : HWV030-1 : TPTP v9.0.0. Released v2.5.0.
% 0.11/0.13  % 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.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Mon Apr  7 22:57:34 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 4.64/2.06  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.64/2.06  
% 4.64/2.06  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------