↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : ARI604_1 : TPTP v9.0.0. Released v5.1.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 : n005.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 05:40:40 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ #nlpp > f

%Foreground sorts:

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

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

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

%Foreground operators:
tff(f,type,
    f: $int > $int ).

tff(f_33,negated_conjecture,
    ~ ( ! [Xa: $int] : $greater(f(Xa),Xa)
     => ! [Xa: $int] : $less($uminus(f($uminus(Xa))),f(Xa)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fX_gt_X_implies_negfnegX_lt_fX) ).

tff(c_2,plain,
    ~ $less($uminus(f($uminus('#skF_1'))),f('#skF_1')),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_9,plain,
    ~ $less(0,$sum(f($uminus('#skF_1')),f('#skF_1'))),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).

tff(c_12,plain,
    ~ $less(0,$sum(f('#skF_1'),f($uminus('#skF_1')))),
    inference(backgroundSimplification,[status(thm),theory('LIA')],[c_9]) ).

tff(c_51,plain,
    f($uminus('#skF_1')) = '#skE_2',
    inference(define,[status(thm),theory(equality)],[c_12]) ).

tff(c_5,plain,
    ! [X_1a: $int] : $greater(f(X_1a),X_1a),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_7,plain,
    ! [X_1a: $int] : $less(X_1a,f(X_1a)),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).

tff(c_73,plain,
    $less($uminus('#skF_1'),'#skE_2'),
    inference(superposition,[status(thm),theory(equality)],[c_51,c_7]) ).

tff(c_75,plain,
    $less(0,$sum('#skE_2','#skF_1')),
    inference(backgroundSimplification,[status(thm),theory('LIA')],[c_73]) ).

tff(c_17,plain,
    f($uminus('#skF_1')) = '#skE_2',
    inference(define,[status(thm),theory(equality)],[c_12]) ).

tff(c_16,plain,
    f('#skF_1') = '#skE_1',
    inference(define,[status(thm),theory(equality)],[c_12]) ).

tff(c_14,plain,
    ~ $less(0,$sum(f('#skF_1'),f($uminus('#skF_1')))),
    inference(backgroundSimplification,[status(thm),theory('LIA')],[c_9]) ).

tff(c_28,plain,
    ~ $less(0,$sum('#skE_1','#skE_2')),
    inference(demodulation,[status(thm),theory(equality)],[c_17,c_16,c_14]) ).

tff(c_31,plain,
    f('#skF_1') = '#skE_1',
    inference(define,[status(thm),theory(equality)],[c_12]) ).

tff(c_45,plain,
    $less('#skF_1','#skE_1'),
    inference(superposition,[status(thm),theory(equality)],[c_31,c_7]) ).

tff(c_84,plain,
    $false,
    inference(close,[status(thm),theory('LIA')],[c_75,c_28,c_45]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : ARI604_1 : TPTP v9.0.0. Released v5.1.0.
% 0.07/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.32  % Computer : n005.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Mon Apr  7 15:14:27 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 2.67/1.64  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.67/1.64  
% 2.67/1.64  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------