↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SEU161+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/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 08:53:00 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ in > set_union2 > #nlpp > singleton > #skF_2 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

tff(f_41,negated_conjecture,
    ~ ! [A,B] :
        ( in(A,B)
       => ( set_union2(singleton(A),B) = B ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t46_zfmisc_1) ).

tff(f_45,axiom,
    ! [A,B] :
      ( in(A,B)
     => ( set_union2(singleton(A),B) = B ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l23_zfmisc_1) ).

tff(f_28,axiom,
    ! [A,B] : ( set_union2(A,B) = set_union2(B,A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).

tff(c_14,plain,
    in('#skF_1','#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_64,plain,
    ! [A_14,B_15] :
      ( ( set_union2(singleton(A_14),B_15) = B_15 )
      | ~ in(A_14,B_15) ),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

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

tff(c_97,plain,
    ! [B_16,A_17] :
      ( ( set_union2(B_16,singleton(A_17)) = B_16 )
      | ~ in(A_17,B_16) ),
    inference(superposition,[status(thm),theory(equality)],[c_64,c_2]) ).

tff(c_12,plain,
    set_union2(singleton('#skF_1'),'#skF_2') != '#skF_2',
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_17,plain,
    set_union2('#skF_2',singleton('#skF_1')) != '#skF_2',
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_12]) ).

tff(c_113,plain,
    ~ in('#skF_1','#skF_2'),
    inference(superposition,[status(thm),theory(equality)],[c_97,c_17]) ).

tff(c_141,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_14,c_113]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem  : SEU161+1 : TPTP v9.0.0. Released v3.3.0.
% 0.05/0.10  % 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.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 300
% 0.10/0.29  % DateTime : Tue Apr  8 22:10:00 EDT 2025
% 0.10/0.29  % CPUTime  : 
% 2.19/1.52  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.35/1.52  
% 2.35/1.52  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------