↑ Up

Beagle---0.9.52.THM-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
%$ in > element > empty > subset_complement > set_difference > #nlpp > powerset > empty_set > #skF_5 > #skF_2 > #skF_1 > #skF_7 > #skF_6 > #skF_3 > #skF_9 > #skF_8 > #skF_4 > #skF_10

%Foreground sorts:

%Background operators:

%Foreground operators:
tff('#skF_5',type,
    '#skF_5': $i > $i ).

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

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

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

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

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

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

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

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

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

tff(empty_set,type,
    empty_set: $i ).

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

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

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

tff(powerset,type,
    powerset: $i > $i ).

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

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

tff(f_99,negated_conjecture,
    ~ ! [A,B,C] :
        ( element(C,powerset(A))
       => ~ ( in(B,subset_complement(A,C))
            & in(B,C) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t54_subset_1) ).

tff(f_91,axiom,
    ! [A,B] :
      ( element(B,powerset(A))
     => ( subset_complement(A,B) = set_difference(A,B) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_subset_1) ).

tff(f_109,axiom,
    ! [A,B,C] :
      ( ( C = set_difference(A,B) )
    <=> ! [D] :
          ( in(D,C)
        <=> ( in(D,A)
            & ~ in(D,B) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).

tff(c_46,plain,
    in('#skF_7','#skF_8'),
    inference(cnfTransformation,[status(thm)],[f_99]) ).

tff(c_50,plain,
    element('#skF_8',powerset('#skF_6')),
    inference(cnfTransformation,[status(thm)],[f_99]) ).

tff(c_203,plain,
    ! [A_58,B_59] :
      ( ( subset_complement(A_58,B_59) = set_difference(A_58,B_59) )
      | ~ element(B_59,powerset(A_58)) ),
    inference(cnfTransformation,[status(thm)],[f_91]) ).

tff(c_225,plain,
    subset_complement('#skF_6','#skF_8') = set_difference('#skF_6','#skF_8'),
    inference(resolution,[status(thm)],[c_50,c_203]) ).

tff(c_48,plain,
    in('#skF_7',subset_complement('#skF_6','#skF_8')),
    inference(cnfTransformation,[status(thm)],[f_99]) ).

tff(c_290,plain,
    in('#skF_7',set_difference('#skF_6','#skF_8')),
    inference(demodulation,[status(thm),theory(equality)],[c_225,c_48]) ).

tff(c_54,plain,
    ! [D_28,B_24,A_23] :
      ( ~ in(D_28,B_24)
      | ~ in(D_28,set_difference(A_23,B_24)) ),
    inference(cnfTransformation,[status(thm)],[f_109]) ).

tff(c_302,plain,
    ~ in('#skF_7','#skF_8'),
    inference(resolution,[status(thm)],[c_290,c_54]) ).

tff(c_314,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_46,c_302]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU172+1 : TPTP v9.0.0. Released v3.3.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.13/0.34  % Computer : n026.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue Apr  8 22:12:08 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.51/1.86  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.51/1.86  
% 3.51/1.86  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------