↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SEU155+2 : 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 : n029.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:58 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ subset > proper_subset > in > disjoint > empty > unordered_pair > set_union2 > set_intersection2 > set_difference > #nlpp > union > singleton > powerset > empty_set > #skF_17 > #skF_20 > #skF_26 > #skF_6 > #skF_18 > #skF_12 > #skF_19 > #skF_13 > #skF_14 > #skF_10 > #skF_21 > #skF_11 > #skF_7 > #skF_9 > #skF_24 > #skF_23 > #skF_3 > #skF_22 > #skF_25 > #skF_2 > #skF_8 > #skF_1 > #skF_5 > #skF_15 > #skF_4 > #skF_16

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_196,negated_conjecture,
    ~ ! [A,B] :
        ( in(A,B)
       => subset(A,union(B)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l50_zfmisc_1) ).

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

tff(f_112,axiom,
    ! [A,B] :
      ( ( B = union(A) )
    <=> ! [C] :
          ( in(C,B)
        <=> ? [D] :
              ( in(C,D)
              & in(D,A) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).

tff(c_204,plain,
    ~ subset('#skF_19',union('#skF_20')),
    inference(cnfTransformation,[status(thm)],[f_196]) ).

tff(c_86,plain,
    ! [A_39,B_40] :
      ( in('#skF_10'(A_39,B_40),A_39)
      | subset(A_39,B_40) ),
    inference(cnfTransformation,[status(thm)],[f_93]) ).

tff(c_206,plain,
    in('#skF_19','#skF_20'),
    inference(cnfTransformation,[status(thm)],[f_196]) ).

tff(c_5246,plain,
    ! [C_499,A_500,D_501] :
      ( in(C_499,union(A_500))
      | ~ in(D_501,A_500)
      | ~ in(C_499,D_501) ),
    inference(cnfTransformation,[status(thm)],[f_112]) ).

tff(c_5421,plain,
    ! [C_505] :
      ( in(C_505,union('#skF_20'))
      | ~ in(C_505,'#skF_19') ),
    inference(resolution,[status(thm)],[c_206,c_5246]) ).

tff(c_84,plain,
    ! [A_39,B_40] :
      ( ~ in('#skF_10'(A_39,B_40),B_40)
      | subset(A_39,B_40) ),
    inference(cnfTransformation,[status(thm)],[f_93]) ).

tff(c_9308,plain,
    ! [A_615] :
      ( subset(A_615,union('#skF_20'))
      | ~ in('#skF_10'(A_615,union('#skF_20')),'#skF_19') ),
    inference(resolution,[status(thm)],[c_5421,c_84]) ).

tff(c_9315,plain,
    subset('#skF_19',union('#skF_20')),
    inference(resolution,[status(thm)],[c_86,c_9308]) ).

tff(c_9319,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_204,c_204,c_9315]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU155+2 : TPTP v9.0.0. Released v3.3.0.
% 0.11/0.12  % 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.13/0.33  % Computer : n029.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Tue Apr  8 22:09:04 EDT 2025
% 0.13/0.33  % CPUTime  : 
% 8.97/3.09  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.97/3.10  
% 8.97/3.10  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------