↑ Up

Beagle---0.9.52.THM-CRf.s

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

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

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

%Foreground sorts:

%Background operators:
tff(a,type,
    a: $int ).

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

tff(f_36,negated_conjecture,
    ~ ( ( p(a)
        & p($sum(a,1))
        & p($difference(a,1)) )
     => ? [Xa: $int] : p($product(3,Xa)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',exists_X_in_a_aplus1_aminus1_div_3) ).

tff(c_4,plain,
    p($difference(a,1)),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_52,plain,
    p($sum($uminus(1),a)),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_4]) ).

tff(c_26,plain,
    ! [X_1a: $int] : ~ p($product(3,X_1a)),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_57,plain,
    ! [X_1a: $int] : ( $product(3,X_1a) != $sum($uminus(1),a) ),
    inference(resolution,[status(thm)],[c_52,c_26]) ).

tff(c_59,plain,
    ~ $divides(3,$sum($uminus(1),a)),
    inference(quantifierElimination,[status(thm),theory('LIA')],[c_57]) ).

tff(c_7,plain,
    p($sum(a,1)),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_44,plain,
    p($sum(1,a)),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_7]) ).

tff(c_49,plain,
    ! [X_1a: $int] : ( $product(3,X_1a) != $sum(1,a) ),
    inference(resolution,[status(thm)],[c_44,c_26]) ).

tff(c_51,plain,
    ~ $divides(3,$sum(1,a)),
    inference(quantifierElimination,[status(thm),theory('LIA')],[c_49]) ).

tff(c_14,plain,
    p(a),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_36,plain,
    ! [X_12a: $int] : ~ p($product(3,X_12a)),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_41,plain,
    ! [X_12a: $int] : ( a != $product(3,X_12a) ),
    inference(resolution,[status(thm)],[c_14,c_36]) ).

tff(c_43,plain,
    ~ $divides(3,a),
    inference(quantifierElimination,[status(thm),theory('LIA')],[c_41]) ).

tff(c_60,plain,
    $false,
    inference(close,[status(thm),theory('LIA')],[c_59,c_51,c_43]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : ARI596_1 : TPTP v9.0.0. Released v5.1.0.
% 0.12/0.13  % 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.14/0.34  % Computer : n021.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Mon Apr  7 15:14:43 EDT 2025
% 0.14/0.35  % CPUTime  : 
% 2.73/1.65  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.73/1.65  
% 2.73/1.65  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------