↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SEU150+3 : TPTP v9.0.0. Released v3.2.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 : n012.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:57 PM UTC 2025

% Result   : Theorem 2.76s 1.67s
% Output   : CNFRefutation 2.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   20 (  19 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   12 (   6   ~;   4   |;   0   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   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    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   18 (  18   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ empty > unordered_pair > #nlpp > singleton > #skF_5 > #skF_2 > #skF_3 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(empty,type,
    empty: $i > $o ).

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

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

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

tff(f_27,axiom,
    ! [A,B] : ( unordered_pair(A,B) = unordered_pair(B,A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).

tff(c_10,plain,
    '#skF_5' != '#skF_4',
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_12,plain,
    unordered_pair('#skF_4','#skF_5') = singleton('#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_50,plain,
    ! [B_8,A_9,C_10] :
      ( ( B_8 = A_9 )
      | ( unordered_pair(B_8,C_10) != singleton(A_9) ) ),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_59,plain,
    ! [A_9] :
      ( ( A_9 = '#skF_4' )
      | ( singleton(A_9) != singleton('#skF_3') ) ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_50]) ).

tff(c_62,plain,
    '#skF_3' = '#skF_4',
    inference(reflexivity,[status(thm),theory(equality)],[c_59]) ).

tff(c_65,plain,
    unordered_pair('#skF_4','#skF_5') = singleton('#skF_4'),
    inference(demodulation,[status(thm),theory(equality)],[c_62,c_12]) ).

tff(c_2,plain,
    ! [B_2,A_1] : ( unordered_pair(B_2,A_1) = unordered_pair(A_1,B_2) ),
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_82,plain,
    ! [B_13,A_14,A_15] :
      ( ( B_13 = A_14 )
      | ( unordered_pair(A_15,B_13) != singleton(A_14) ) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_50]) ).

tff(c_85,plain,
    ! [A_14] :
      ( ( A_14 = '#skF_5' )
      | ( singleton(A_14) != singleton('#skF_4') ) ),
    inference(superposition,[status(thm),theory(equality)],[c_65,c_82]) ).

tff(c_94,plain,
    '#skF_5' = '#skF_4',
    inference(reflexivity,[status(thm),theory(equality)],[c_85]) ).

tff(c_96,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_10,c_94]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU150+3 : TPTP v9.0.0. Released v3.2.0.
% 0.11/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.33  % Computer : n012.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % 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 : Tue Apr  8 22:08:14 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 2.76/1.67  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.76/1.67  
% 2.76/1.67  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------