↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SEU149+1 : TPTP v9.0.0. Released v3.3.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 : n026.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 08:52:56 PM UTC 2025

% Result   : Theorem 2.73s 1.55s
% Output   : CNFRefutation 2.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   10 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   17 (  11 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   10 (   3   ~;   2   |;   0   &)
%                                         (   4 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-3 aty)
%            Number of variables   :   14 (  14   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ in > unordered_pair > #nlpp > singleton > #skF_4 > #skF_7 > #skF_5 > #skF_6 > #skF_3 > #skF_2 > #skF_1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(singleton,type,
    singleton: $i > $i ).

tff(unordered_pair,type,
    unordered_pair: ( $i * $i ) > $i ).

tff('#skF_4',type,
    '#skF_4': ( $i * $i * $i ) > $i ).

tff('#skF_7',type,
    '#skF_7': $i ).

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

tff('#skF_5',type,
    '#skF_5': $i ).

tff('#skF_6',type,
    '#skF_6': $i ).

tff('#skF_3',type,
    '#skF_3': ( $i * $i * $i ) > $i ).

tff('#skF_2',type,
    '#skF_2': ( $i * $i ) > $i ).

tff('#skF_1',type,
    '#skF_1': ( $i * $i ) > $i ).

tff(f_55,negated_conjecture,
    ~ ! [A,B,C] :
        ( ( singleton(A) = unordered_pair(B,C) )
       => ( A = B ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).

tff(f_49,axiom,
    ! [A,B,C] :
      ( ( C = unordered_pair(A,B) )
    <=> ! [D] :
          ( in(D,C)
        <=> ( ( D = A )
            | ( D = B ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).

tff(f_40,axiom,
    ! [A,B] :
      ( ( B = singleton(A) )
    <=> ! [C] :
          ( in(C,B)
        <=> ( C = A ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).

tff(c_40,plain,
    '#skF_5' != '#skF_6',
    inference(cnfTransformation,[status(thm)],[f_55]) ).

tff(c_42,plain,
    unordered_pair('#skF_6','#skF_7') = singleton('#skF_5'),
    inference(cnfTransformation,[status(thm)],[f_55]) ).

tff(c_48,plain,
    ! [D_17,B_18] : in(D_17,unordered_pair(D_17,B_18)),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_51,plain,
    in('#skF_6',singleton('#skF_5')),
    inference(superposition,[status(thm),theory(equality)],[c_42,c_48]) ).

tff(c_142,plain,
    ! [C_30,A_31] :
      ( ( C_30 = A_31 )
      | ~ in(C_30,singleton(A_31)) ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_148,plain,
    '#skF_5' = '#skF_6',
    inference(resolution,[status(thm)],[c_51,c_142]) ).

tff(c_156,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_40,c_148]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07  % Problem  : SEU149+1 : TPTP v9.0.0. Released v3.3.0.
% 0.02/0.08  % 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.08/0.27  % Computer : n026.cluster.edu
% 0.08/0.27  % Model    : x86_64 x86_64
% 0.08/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27  % Memory   : 8042.1875MB
% 0.08/0.27  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27  % CPULimit : 300
% 0.08/0.27  % WCLimit  : 300
% 0.08/0.27  % DateTime : Tue Apr  8 22:08:23 EDT 2025
% 0.08/0.27  % CPUTime  : 
% 2.73/1.55  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.73/1.55  
% 2.73/1.55  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------