↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : DAT060_1 : TPTP v9.0.0. Released v5.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 : n008.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:08:01 PM UTC 2025

% Result   : Theorem 3.36s 1.83s
% Output   : CNFRefutation 3.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    8 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   11 (   7 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    7 (   4   ~;   2   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :    9 (   3 atm;   0 fun;   0 num;   6 var)
%            Number of types       :    3 (   2 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-3 aty)
%            Number of variables   :   12 (  12   !;   0   ?;  12   :)

% Comments : 
%------------------------------------------------------------------------------
%$ put > get > #nlpp > none > mkarray > #skF_3 > #skF_2 > #skF_1

%Foreground sorts:
tff(data,type,
    data: $tType ).

tff(array,type,
    array: $tType ).

%Background operators:
tff('#skF_5',type,
    '#skF_5': $int ).

tff('#skF_4',type,
    '#skF_4': $int ).

%Foreground operators:
tff('#skF_3',type,
    '#skF_3': array ).

tff('#skF_2',type,
    '#skF_2': data ).

tff(get,type,
    get: ( array * $int ) > data ).

tff('#skF_1',type,
    '#skF_1': ( array * array ) > $int ).

tff(mkarray,type,
    mkarray: array ).

tff(put,type,
    put: ( array * $int * data ) > array ).

tff(none,type,
    none: data ).

tff(f_65,axiom,
    ! [Na: $int,D: data,Ar: array,Ma: $int] :
      ( ( Ma != Na )
     => ( get(put(Ar,Na,D),Ma) = get(Ar,Ma) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/DAT004_0.ax',ax_19) ).

tff(f_80,negated_conjecture,
    ~ ! [D: data,Ar: array,Na: $int,Ma: $int] :
        ( ( get(put(Ar,Ma,D),Na) = get(Ar,Na) )
        | ~ $less(Na,Ma) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',th_lem_6) ).

tff(c_23,plain,
    ! [Ar_7: array,N_5a: $int,D_6: data,M_8a: $int] :
      ( ( get(put(Ar_7,N_5a,D_6),M_8a) = get(Ar_7,M_8a) )
      | ( N_5a = M_8a ) ),
    inference(cnfTransformation,[status(thm)],[f_65]) ).

tff(c_165,plain,
    get(put('#skF_3','#skF_5','#skF_2'),'#skF_4') != get('#skF_3','#skF_4'),
    inference(cnfTransformation,[status(thm)],[f_80]) ).

tff(c_190,plain,
    '#skF_5' = '#skF_4',
    inference(superposition,[status(thm),theory(equality)],[c_23,c_165]) ).

tff(c_20,plain,
    $less('#skF_4','#skF_5'),
    inference(cnfTransformation,[status(thm)],[f_80]) ).

tff(c_199,plain,
    $less('#skF_4','#skF_4'),
    inference(demodulation,[status(thm),theory(equality)],[c_190,c_20]) ).

tff(c_208,plain,
    $false,
    inference(backgroundSimplification,[status(thm),theory('LIA')],[c_199]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : DAT060_1 : TPTP v9.0.0. Released v5.5.0.
% 0.11/0.13  % 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.13/0.34  % Computer : n008.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 18:17:03 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.36/1.83  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.36/1.83  
% 3.36/1.83  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------