↑ Up

Beagle---0.9.52.THM-CRf.s

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

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

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

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

%Background operators:

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

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

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

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

tff(f_60,axiom,
    ! [Ua: $int] : ~ in(Ua,empty),
    file('/export/starexec/sandbox2/benchmark/Axioms/DAT002_0.ax',ax1) ).

tff(f_83,negated_conjecture,
    ~ ~ in(4,add(1,add(3,add(5,empty)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

tff(f_71,axiom,
    ! [Za: $int,X1: collection,X2a: $int] :
      ( ( in(Za,X1)
        | ( Za = X2a ) )
    <=> in(Za,add(X2a,X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/DAT002_0.ax',ax4) ).

tff(c_28,plain,
    ! [U_1a: $int] : ~ in(U_1a,empty),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_19,plain,
    in(4,add(1,add(3,add(5,empty)))),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

tff(c_48,plain,
    ! [Z_26a: $int,X1_27: collection,X2_28a: $int] :
      ( in(Z_26a,X1_27)
      | ~ in(Z_26a,add(X2_28a,X1_27))
      | ( Z_26a = X2_28a ) ),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_58,plain,
    ( in(4,add(3,add(5,empty)))
    | ( 4 = 1 ) ),
    inference(resolution,[status(thm)],[c_19,c_48]) ).

tff(c_60,plain,
    in(4,add(3,add(5,empty))),
    inference(backgroundSimplification,[status(thm),theory('LIA')],[c_58]) ).

tff(c_25,plain,
    ! [Z_6a: $int,X1_7: collection,X2_8a: $int] :
      ( in(Z_6a,X1_7)
      | ~ in(Z_6a,add(X2_8a,X1_7))
      | ( Z_6a = X2_8a ) ),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_69,plain,
    ( in(4,add(5,empty))
    | ( 4 = 3 ) ),
    inference(resolution,[status(thm)],[c_60,c_25]) ).

tff(c_71,plain,
    in(4,add(5,empty)),
    inference(backgroundSimplification,[status(thm),theory('LIA')],[c_69]) ).

tff(c_74,plain,
    ( in(4,empty)
    | ( 5 = 4 ) ),
    inference(resolution,[status(thm)],[c_71,c_25]) ).

tff(c_77,plain,
    5 = 4,
    inference(negUnitSimplification,[status(thm)],[c_28,c_74]) ).

tff(c_80,plain,
    $false,
    inference(backgroundSimplification,[status(thm),theory('LIA')],[c_77]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : DAT020_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.12/0.34  % Computer : n009.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:26 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 2.85/1.65  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.85/1.65  
% 2.85/1.65  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------