↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : DAT024_1 : TPTP v9.0.0. Released v5.0.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 : n003.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:07:56 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ in > remove > add > #nlpp > empty > #skF_1

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

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

%Foreground operators:
tff(empty,type,
    empty: collection ).

tff('#skF_1',type,
    '#skF_1': collection ).

tff(in,type,
    in: ( $int * collection ) > $o ).

tff(remove,type,
    remove: ( $int * collection ) > collection ).

tff(add,type,
    add: ( $int * collection ) > collection ).

tff(f_96,negated_conjecture,
    ~ ! [U: collection] :
        ( ( ! [Va: $int] :
              ( in(Va,U)
             => $greatereq(Va,0) )
          & ~ in(0,U)
          & ~ in(1,U) )
       => ! [Wa: $int] :
            ( in(Wa,U)
           => $greatereq(Wa,2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

tff(c_33,plain,
    in('#skF_2','#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_25,plain,
    ! [V_14a: $int] :
      ( ~ in(V_14a,'#skF_1')
      | $greatereq(V_14a,0) ),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_61,plain,
    ! [V_23a: $int] :
      ( ~ in(V_23a,'#skF_1')
      | ~ $less(V_23a,0) ),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_25]) ).

tff(c_66,plain,
    ~ $less('#skF_2',0),
    inference(resolution,[status(thm)],[c_33,c_61]) ).

tff(c_48,plain,
    in('#skF_2','#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_29,plain,
    ~ in(1,'#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_56,plain,
    '#skF_2' != 1,
    inference(resolution,[status(thm)],[c_48,c_29]) ).

tff(c_28,plain,
    ~ in(0,'#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_58,plain,
    '#skF_2' != 0,
    inference(resolution,[status(thm)],[c_48,c_28]) ).

tff(c_17,plain,
    ~ $greatereq('#skF_2',2),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_34,plain,
    $less('#skF_2',2),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_17]) ).

tff(c_67,plain,
    $false,
    inference(close,[status(thm),theory('LIA')],[c_66,c_56,c_58,c_34]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : DAT024_1 : TPTP v9.0.0. Released v5.0.0.
% 0.06/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 : n003.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:15:48 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.02/1.70  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.02/1.70  
% 3.02/1.70  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------