↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : DAT014_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 : n006.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:54 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ write > read > #nlpp > #skF_1

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

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

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

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

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

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

tff(f_87,negated_conjecture,
    ~ ! [U: array] :
        ( ( ! [Va: $int] :
              ( ( $lesseq(1,Va)
                & $lesseq(Va,10) )
             => $greater(read(U,Va),Va) )
          & ! [Wa: $int] :
              ( ( $lesseq(11,Wa)
                & $lesseq(Wa,20) )
             => $greater(read(U,Wa),$difference(20,Wa)) ) )
       => ! [Xa: $int] :
            ( ( $lesseq(6,Xa)
              & $lesseq(Xa,15) )
           => $greater(read(U,Xa),5) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

tff(c_5,plain,
    ~ $greater(read('#skF_1','#skF_2'),5),
    inference(cnfTransformation,[status(thm)],[f_87]) ).

tff(c_22,plain,
    ~ $less(5,read('#skF_1','#skF_2')),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).

tff(c_33,plain,
    read('#skF_1','#skF_2') = '#skE_1',
    inference(define,[status(thm),theory(equality)],[c_22]) ).

tff(c_11,plain,
    ! [W_12a: $int] :
      ( $greater(read('#skF_1',W_12a),$difference(20,W_12a))
      | ~ $lesseq(11,W_12a)
      | ~ $lesseq(W_12a,20) ),
    inference(cnfTransformation,[status(thm)],[f_87]) ).

tff(c_91,plain,
    ! [W_26a: $int] :
      ( $less(20,$sum(W_26a,read('#skF_1',W_26a)))
      | $less(W_26a,11)
      | $less(20,W_26a) ),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_11]) ).

tff(c_96,plain,
    ( $less(20,$sum('#skF_2','#skE_1'))
    | $less('#skF_2',11)
    | $less(20,'#skF_2') ),
    inference(superposition,[status(thm),theory(equality)],[c_33,c_91]) ).

tff(c_98,plain,
    $less(20,'#skF_2'),
    inference(splitLeft,[status(thm)],[c_96]) ).

tff(c_7,plain,
    $lesseq('#skF_2',15),
    inference(cnfTransformation,[status(thm)],[f_87]) ).

tff(c_18,plain,
    ~ $less(15,'#skF_2'),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_7]) ).

tff(c_99,plain,
    $false,
    inference(close,[status(thm),theory('LIA')],[c_98,c_18]) ).

tff(c_102,plain,
    ( $less('#skF_2',11)
    | $less(20,$sum('#skF_2','#skE_1')) ),
    inference(splitRight,[status(thm)],[c_96]) ).

tff(c_105,plain,
    $less(20,$sum('#skF_2','#skE_1')),
    inference(splitLeft,[status(thm)],[c_102]) ).

tff(c_27,plain,
    read('#skF_1','#skF_2') = '#skE_1',
    inference(define,[status(thm),theory(equality)],[c_22]) ).

tff(c_26,plain,
    ~ $less(5,read('#skF_1','#skF_2')),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).

tff(c_34,plain,
    ~ $less(5,'#skE_1'),
    inference(demodulation,[status(thm),theory(equality)],[c_27,c_26]) ).

tff(c_106,plain,
    $false,
    inference(close,[status(thm),theory('LIA')],[c_105,c_34,c_18]) ).

tff(c_109,plain,
    $less('#skF_2',11),
    inference(splitRight,[status(thm)],[c_102]) ).

tff(c_13,plain,
    ! [V_11a: $int] :
      ( $greater(read('#skF_1',V_11a),V_11a)
      | ~ $lesseq(1,V_11a)
      | ~ $lesseq(V_11a,10) ),
    inference(cnfTransformation,[status(thm)],[f_87]) ).

tff(c_83,plain,
    ! [V_25a: $int] :
      ( $less(V_25a,read('#skF_1',V_25a))
      | $less(V_25a,1)
      | $less(10,V_25a) ),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_13]) ).

tff(c_88,plain,
    ( $less('#skF_2','#skE_1')
    | $less('#skF_2',1)
    | $less(10,'#skF_2') ),
    inference(superposition,[status(thm),theory(equality)],[c_33,c_83]) ).

tff(c_90,plain,
    $less(10,'#skF_2'),
    inference(splitLeft,[status(thm)],[c_88]) ).

tff(c_111,plain,
    $false,
    inference(close,[status(thm),theory('LIA')],[c_109,c_90]) ).

tff(c_114,plain,
    ( $less('#skF_2',1)
    | $less('#skF_2','#skE_1') ),
    inference(splitRight,[status(thm)],[c_88]) ).

tff(c_117,plain,
    $less('#skF_2','#skE_1'),
    inference(splitLeft,[status(thm)],[c_114]) ).

tff(c_9,plain,
    $lesseq(6,'#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_87]) ).

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

tff(c_124,plain,
    $false,
    inference(close,[status(thm),theory('LIA')],[c_117,c_34,c_17]) ).

tff(c_127,plain,
    $less('#skF_2',1),
    inference(splitRight,[status(thm)],[c_114]) ).

tff(c_129,plain,
    $false,
    inference(close,[status(thm),theory('LIA')],[c_127,c_17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12  % Problem  : DAT014_1 : TPTP v9.0.0. Released v5.0.0.
% 0.02/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.12/0.34  % Computer : n006.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Mon Apr  7 18:15:08 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 3.30/1.82  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.33/1.83  
% 3.33/1.83  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------