↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : DAT073_1 : TPTP v9.0.0. Released v6.1.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 : n024.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:03 PM UTC 2025

% Result   : Theorem 225.65s 201.68s
% Output   : CNFRefutation 226.01s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   35 (   2 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   37 (  16   ~;  16   |;   2   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :   67 (  24 atm;   0 fun;  17 num;  26 var)
%            Number of types       :    3 (   1 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   14 (  13 usr;   1 con; 0-3 aty)
%            Number of variables   :   32 (  32   !;   0   ?;  32   :)

% Comments : 
%------------------------------------------------------------------------------
%$ inRange > sorted > distinct > write > rev > read > max > #nlpp > init > #skF_5 > #skF_4 > #skF_8 > #skF_1 > #skF_6 > #skF_3 > #skF_7 > #skF_2

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

%Background operators:

%Foreground operators:
tff(sorted,type,
    sorted: ( array * $int ) > $o ).

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

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

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

tff(init,type,
    init: $int > array ).

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

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

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

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

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

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

tff(inRange,type,
    inRange: ( array * $int * $int ) > $o ).

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

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

tff(distinct,type,
    distinct: ( array * $int ) > $o ).

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

tff(f_124,negated_conjecture,
    ~ ~ ! [A: array,Na: $int] :
          ( $greatereq(Na,0)
         => inRange(A,max(A,Na),Na) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c1) ).

tff(f_43,axiom,
    ! [Va: $int,Ia: $int] : ( read(init(Va),Ia) = Va ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).

tff(f_86,axiom,
    ! [A: array,Ra: $int,Na: $int] :
      ( inRange(A,Ra,Na)
    <=> ! [Ia: $int] :
          ( ( $greater(Na,Ia)
            & $greatereq(Ia,0) )
         => ( $greatereq(Ra,read(A,Ia))
            & $greatereq(read(A,Ia),0) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',inRange) ).

tff(c_71,plain,
    ! [A_45: array,N_46a: $int] :
      ( inRange(A_45,max(A_45,N_46a),N_46a)
      | ~ $greatereq(N_46a,0) ),
    inference(cnfTransformation,[status(thm)],[f_124]) ).

tff(c_221913,plain,
    ! [A_19822: array,N_19823: $int] :
      ( inRange(A_19822,max(A_19822,N_19823),N_19823)
      | $less(N_19823,0) ),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_71]) ).

tff(c_221938,plain,
    ! [V_19889: $int,I_19890: $int] : ( read(init(V_19889),I_19890) = V_19889 ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_31,plain,
    ! [A_27: array,I_32a: $int,R_28a: $int,N_29a: $int] :
      ( $greatereq(read(A_27,I_32a),0)
      | ~ inRange(A_27,R_28a,N_29a)
      | ~ $greater(N_29a,I_32a)
      | ~ $greatereq(I_32a,0) ),
    inference(cnfTransformation,[status(thm)],[f_86]) ).

tff(c_222050,plain,
    ! [A_19945: array,I_19946: $int,R_19947: $int,N_19948: $int] :
      ( ~ $less(read(A_19945,I_19946),0)
      | ~ inRange(A_19945,R_19947,N_19948)
      | ~ $less(I_19946,N_19948)
      | $less(I_19946,0) ),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_31]) ).

tff(c_222060,plain,
    ! [V_19949: $int,R_19950: $int,N_19951: $int,I_19952: $int] :
      ( ~ $less(V_19949,0)
      | ~ inRange(init(V_19949),R_19950,N_19951)
      | ~ $less(I_19952,N_19951)
      | $less(I_19952,0) ),
    inference(superposition,[status(thm),theory(equality)],[c_221938,c_222050]) ).

tff(c_222075,plain,
    ! [V_19949: $int,I_19952: $int,N_19823: $int] :
      ( ~ $less(V_19949,0)
      | ~ $less(I_19952,N_19823)
      | $less(I_19952,0)
      | $less(N_19823,0) ),
    inference(resolution,[status(thm)],[c_221913,c_222060]) ).

tff(c_222077,plain,
    ! [V_19949: $int] : ~ $less(V_19949,0),
    inference(splitLeft,[status(thm)],[c_222075]) ).

tff(c_222084,plain,
    $false,
    inference(quantifierElimination,[status(thm),theory('LIA')],[c_222077]) ).

tff(c_222086,plain,
    ! [I_19952: $int,N_19823: $int] :
      ( ~ $less(I_19952,N_19823)
      | $less(I_19952,0)
      | $less(N_19823,0) ),
    inference(splitRight,[status(thm)],[c_222075]) ).

tff(c_222088,plain,
    $false,
    inference(quantifierElimination,[status(thm),theory('LIA')],[c_222086]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : DAT073_1 : TPTP v9.0.0. Released v6.1.0.
% 0.06/0.12  % 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.12/0.33  % Computer : n024.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Mon Apr  7 18:17:06 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 119.24/101.99  ***********************************************************************
% 119.24/101.99  After 100.3 sec it's time to try something different, got 99.5 sec left
% 119.24/101.99  ***********************************************************************
% 225.65/201.63  ***********************************************************************
% 225.65/201.63  After 199.9 sec it's time to try something different, got 99.4 sec left
% 225.65/201.63  ***********************************************************************
% 225.65/201.68  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 225.65/201.69  
% 225.65/201.69  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------