↑ Up

Beagle---0.9.52.THM-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
%$ subset > in > empty > set_difference > #nlpp > empty_set > #skF_7 > #skF_5 > #skF_6 > #skF_2 > #skF_4 > #skF_3 > #skF_1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(set_difference,type,
    set_difference: ( $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(subset,type,
    subset: ( $i * $i ) > $o ).

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

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

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

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

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

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

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

tff(f_38,axiom,
    ! [A,B] :
      ( subset(A,B)
    <=> ! [C] :
          ( in(C,A)
         => in(C,B) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).

tff(f_48,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(f_60,negated_conjecture,
    ~ ! [A,B] : subset(set_difference(A,B),A),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t36_xboole_1) ).

tff(c_8,plain,
    ! [A_3,B_4] :
      ( in('#skF_1'(A_3,B_4),A_3)
      | subset(A_3,B_4) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_155,plain,
    ! [D_42,A_43,B_44] :
      ( in(D_42,A_43)
      | ~ in(D_42,set_difference(A_43,B_44)) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_898,plain,
    ! [A_135,B_136,B_137] :
      ( in('#skF_1'(set_difference(A_135,B_136),B_137),A_135)
      | subset(set_difference(A_135,B_136),B_137) ),
    inference(resolution,[status(thm)],[c_8,c_155]) ).

tff(c_6,plain,
    ! [A_3,B_4] :
      ( ~ in('#skF_1'(A_3,B_4),B_4)
      | subset(A_3,B_4) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_956,plain,
    ! [A_135,B_136] : subset(set_difference(A_135,B_136),A_135),
    inference(resolution,[status(thm)],[c_898,c_6]) ).

tff(c_40,plain,
    ~ subset(set_difference('#skF_6','#skF_7'),'#skF_6'),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_964,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_956,c_40]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU133+1 : TPTP v9.0.0. Released v3.3.0.
% 0.06/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.14/0.34  % Computer : n014.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Tue Apr  8 22:05:49 EDT 2025
% 0.14/0.34  % CPUTime  : 
% 4.52/2.37  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.52/2.38  
% 4.52/2.38  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------