↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : ARI180_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/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 : n032.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:39:47 PM UTC 2025

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

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

%Foreground sorts:

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

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

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

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

tff(f_35,negated_conjecture,
    ~ ! [Ua: $int,Va: $int] :
        ( ( ( $sum(Ua,Va) = f(Ua) )
          & ( $difference(Va,f(Ua)) = 0 ) )
       => ( Va = f(0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

tff(c_16,plain,
    f(0) != '#skF_2',
    inference(cnfTransformation,[status(thm)],[f_35]) ).

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

tff(c_25,plain,
    '#skF_2' != '#skE_1',
    inference(demodulation,[status(thm),theory(equality)],[c_21,c_16]) ).

tff(c_4,plain,
    $difference('#skF_2',f('#skF_1')) = 0,
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_32,plain,
    f('#skF_1') = '#skF_2',
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_4]) ).

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

tff(c_38,plain,
    ( ( '#skF_2' = '#skE_1' )
    | ( '#skF_1' != 0 ) ),
    inference(superposition,[status(thm),theory(equality)],[c_32,c_24]) ).

tff(c_49,plain,
    '#skF_1' != 0,
    inference(negUnitSimplification,[status(thm)],[c_25,c_38]) ).

tff(c_15,plain,
    f('#skF_1') = '#skF_2',
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_4]) ).

tff(c_55,plain,
    f('#skF_1') = $sum('#skF_1','#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_35]) ).

tff(c_83,plain,
    $sum('#skF_1','#skF_2') = '#skF_2',
    inference(superposition,[status(thm),theory(equality)],[c_15,c_55]) ).

tff(c_85,plain,
    '#skF_1' = 0,
    inference(backgroundSimplification,[status(thm),theory('LIA')],[c_83]) ).

tff(c_86,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_49,c_85]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.08  % Problem  : ARI180_1 : TPTP v9.0.0. Released v5.0.0.
% 0.07/0.09  % 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.08/0.28  % Computer : n032.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit : 300
% 0.08/0.28  % WCLimit  : 300
% 0.08/0.28  % DateTime : Mon Apr  7 15:04:46 EDT 2025
% 0.08/0.28  % CPUTime  : 
% 2.11/1.50  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.11/1.51  
% 2.11/1.51  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------