TSTP Solution File: SEU328+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SEU328+1 : TPTP v8.1.2. 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 : n018.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 : Tue Aug 22 10:58:26 EDT 2023

% Result   : Theorem 24.37s 11.66s
% Output   : CNFRefutation 24.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   42
% Syntax   : Number of formulae    :   77 (  21 unt;  31 typ;   0 def)
%            Number of atoms       :   78 (  37 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   56 (  24   ~;  20   |;   1   &)
%                                         (   1 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   37 (  27   >;  10   *;   0   +;   0  <<)
%            Number of predicates  :   16 (  14 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;   4 con; 0-3 aty)
%            Number of variables   :   52 (;  52   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ subset > in > element > v5_membered > v4_membered > v3_membered > v2_membered > v1_xreal_0 > v1_xcmplx_0 > v1_rat_1 > v1_membered > v1_int_1 > natural > empty > subset_difference > union_of_subsets > subset_complement > set_difference > meet_of_subsets > complements_of_subsets > #nlpp > union > set_meet > powerset > cast_to_subset > empty_set > #skF_4 > #skF_1 > #skF_5 > #skF_6 > #skF_2 > #skF_3

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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 ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_316,negated_conjecture,
    ~ ! [A,B] :
        ( element(B,powerset(powerset(A)))
       => ( ( B != empty_set )
         => ( union_of_subsets(A,complements_of_subsets(A,B)) = subset_complement(A,meet_of_subsets(A,B)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_tops_2) ).

tff(f_200,axiom,
    ! [A,B] :
      ( element(B,powerset(powerset(A)))
     => element(complements_of_subsets(A,B),powerset(powerset(A))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k7_setfam_1) ).

tff(f_296,axiom,
    ! [A,B] :
      ( element(B,powerset(powerset(A)))
     => ( union_of_subsets(A,B) = union(B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k5_setfam_1) ).

tff(f_300,axiom,
    ! [A,B] :
      ( element(B,powerset(powerset(A)))
     => ( meet_of_subsets(A,B) = set_meet(B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k6_setfam_1) ).

tff(f_190,axiom,
    ! [A,B] :
      ( element(B,powerset(powerset(A)))
     => element(meet_of_subsets(A,B),powerset(A)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k6_setfam_1) ).

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

tff(f_171,axiom,
    ! [A] : ( cast_to_subset(A) = A ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_subset_1) ).

tff(f_339,axiom,
    ! [A,B] :
      ( element(B,powerset(powerset(A)))
     => ( ( B != empty_set )
       => ( union_of_subsets(A,complements_of_subsets(A,B)) = subset_difference(A,cast_to_subset(A),meet_of_subsets(A,B)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t48_setfam_1) ).

tff(f_332,axiom,
    ! [A,B] :
      ( element(A,powerset(B))
    <=> subset(A,B) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).

tff(f_178,axiom,
    ! [A] : element(cast_to_subset(A),powerset(A)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_subset_1) ).

tff(f_306,axiom,
    ! [A,B,C] :
      ( ( element(B,powerset(A))
        & element(C,powerset(A)) )
     => ( subset_difference(A,B,C) = set_difference(B,C) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k6_subset_1) ).

tff(c_192,plain,
    element('#skF_6',powerset(powerset('#skF_5'))),
    inference(cnfTransformation,[status(thm)],[f_316]) ).

tff(c_4353,plain,
    ! [A_376,B_377] :
      ( element(complements_of_subsets(A_376,B_377),powerset(powerset(A_376)))
      | ~ element(B_377,powerset(powerset(A_376))) ),
    inference(cnfTransformation,[status(thm)],[f_200]) ).

tff(c_180,plain,
    ! [A_74,B_75] :
      ( ( union_of_subsets(A_74,B_75) = union(B_75) )
      | ~ element(B_75,powerset(powerset(A_74))) ),
    inference(cnfTransformation,[status(thm)],[f_296]) ).

tff(c_22510,plain,
    ! [A_796,B_797] :
      ( ( union_of_subsets(A_796,complements_of_subsets(A_796,B_797)) = union(complements_of_subsets(A_796,B_797)) )
      | ~ element(B_797,powerset(powerset(A_796))) ),
    inference(resolution,[status(thm)],[c_4353,c_180]) ).

tff(c_22584,plain,
    union_of_subsets('#skF_5',complements_of_subsets('#skF_5','#skF_6')) = union(complements_of_subsets('#skF_5','#skF_6')),
    inference(resolution,[status(thm)],[c_192,c_22510]) ).

tff(c_2403,plain,
    ! [A_344,B_345] :
      ( ( meet_of_subsets(A_344,B_345) = set_meet(B_345) )
      | ~ element(B_345,powerset(powerset(A_344))) ),
    inference(cnfTransformation,[status(thm)],[f_300]) ).

tff(c_2434,plain,
    meet_of_subsets('#skF_5','#skF_6') = set_meet('#skF_6'),
    inference(resolution,[status(thm)],[c_192,c_2403]) ).

tff(c_3530,plain,
    ! [A_367,B_368] :
      ( element(meet_of_subsets(A_367,B_368),powerset(A_367))
      | ~ element(B_368,powerset(powerset(A_367))) ),
    inference(cnfTransformation,[status(thm)],[f_190]) ).

tff(c_3652,plain,
    ( element(set_meet('#skF_6'),powerset('#skF_5'))
    | ~ element('#skF_6',powerset(powerset('#skF_5'))) ),
    inference(superposition,[status(thm),theory(equality)],[c_2434,c_3530]) ).

tff(c_3696,plain,
    element(set_meet('#skF_6'),powerset('#skF_5')),
    inference(demodulation,[status(thm),theory(equality)],[c_192,c_3652]) ).

tff(c_84,plain,
    ! [A_39,B_40] :
      ( ( subset_complement(A_39,B_40) = set_difference(A_39,B_40) )
      | ~ element(B_40,powerset(A_39)) ),
    inference(cnfTransformation,[status(thm)],[f_175]) ).

tff(c_3799,plain,
    subset_complement('#skF_5',set_meet('#skF_6')) = set_difference('#skF_5',set_meet('#skF_6')),
    inference(resolution,[status(thm)],[c_3696,c_84]) ).

tff(c_188,plain,
    union_of_subsets('#skF_5',complements_of_subsets('#skF_5','#skF_6')) != subset_complement('#skF_5',meet_of_subsets('#skF_5','#skF_6')),
    inference(cnfTransformation,[status(thm)],[f_316]) ).

tff(c_2439,plain,
    union_of_subsets('#skF_5',complements_of_subsets('#skF_5','#skF_6')) != subset_complement('#skF_5',set_meet('#skF_6')),
    inference(demodulation,[status(thm),theory(equality)],[c_2434,c_188]) ).

tff(c_19126,plain,
    union_of_subsets('#skF_5',complements_of_subsets('#skF_5','#skF_6')) != set_difference('#skF_5',set_meet('#skF_6')),
    inference(demodulation,[status(thm),theory(equality)],[c_3799,c_2439]) ).

tff(c_22657,plain,
    set_difference('#skF_5',set_meet('#skF_6')) != union(complements_of_subsets('#skF_5','#skF_6')),
    inference(demodulation,[status(thm),theory(equality)],[c_22584,c_19126]) ).

tff(c_190,plain,
    empty_set != '#skF_6',
    inference(cnfTransformation,[status(thm)],[f_316]) ).

tff(c_82,plain,
    ! [A_38] : ( cast_to_subset(A_38) = A_38 ),
    inference(cnfTransformation,[status(thm)],[f_171]) ).

tff(c_204,plain,
    ! [A_90,B_91] :
      ( ( subset_difference(A_90,cast_to_subset(A_90),meet_of_subsets(A_90,B_91)) = union_of_subsets(A_90,complements_of_subsets(A_90,B_91)) )
      | ( empty_set = B_91 )
      | ~ element(B_91,powerset(powerset(A_90))) ),
    inference(cnfTransformation,[status(thm)],[f_339]) ).

tff(c_5032,plain,
    ! [A_385,B_386] :
      ( ( subset_difference(A_385,A_385,meet_of_subsets(A_385,B_386)) = union_of_subsets(A_385,complements_of_subsets(A_385,B_386)) )
      | ( empty_set = B_386 )
      | ~ element(B_386,powerset(powerset(A_385))) ),
    inference(demodulation,[status(thm),theory(equality)],[c_82,c_204]) ).

tff(c_5069,plain,
    ( ( subset_difference('#skF_5','#skF_5',meet_of_subsets('#skF_5','#skF_6')) = union_of_subsets('#skF_5',complements_of_subsets('#skF_5','#skF_6')) )
    | ( empty_set = '#skF_6' ) ),
    inference(resolution,[status(thm)],[c_192,c_5032]) ).

tff(c_5088,plain,
    ( ( subset_difference('#skF_5','#skF_5',set_meet('#skF_6')) = union_of_subsets('#skF_5',complements_of_subsets('#skF_5','#skF_6')) )
    | ( empty_set = '#skF_6' ) ),
    inference(demodulation,[status(thm),theory(equality)],[c_2434,c_5069]) ).

tff(c_5089,plain,
    subset_difference('#skF_5','#skF_5',set_meet('#skF_6')) = union_of_subsets('#skF_5',complements_of_subsets('#skF_5','#skF_6')),
    inference(negUnitSimplification,[status(thm)],[c_190,c_5088]) ).

tff(c_22660,plain,
    subset_difference('#skF_5','#skF_5',set_meet('#skF_6')) = union(complements_of_subsets('#skF_5','#skF_6')),
    inference(demodulation,[status(thm),theory(equality)],[c_22584,c_5089]) ).

tff(c_200,plain,
    ! [A_88,B_89] :
      ( subset(A_88,B_89)
      | ~ element(A_88,powerset(B_89)) ),
    inference(cnfTransformation,[status(thm)],[f_332]) ).

tff(c_3819,plain,
    subset(set_meet('#skF_6'),'#skF_5'),
    inference(resolution,[status(thm)],[c_3696,c_200]) ).

tff(c_92,plain,
    ! [A_41] : element(cast_to_subset(A_41),powerset(A_41)),
    inference(cnfTransformation,[status(thm)],[f_178]) ).

tff(c_217,plain,
    ! [A_41] : element(A_41,powerset(A_41)),
    inference(demodulation,[status(thm),theory(equality)],[c_82,c_92]) ).

tff(c_202,plain,
    ! [A_88,B_89] :
      ( element(A_88,powerset(B_89))
      | ~ subset(A_88,B_89) ),
    inference(cnfTransformation,[status(thm)],[f_332]) ).

tff(c_4706,plain,
    ! [A_378,B_379,C_380] :
      ( ( subset_difference(A_378,B_379,C_380) = set_difference(B_379,C_380) )
      | ~ element(C_380,powerset(A_378))
      | ~ element(B_379,powerset(A_378)) ),
    inference(cnfTransformation,[status(thm)],[f_306]) ).

tff(c_22015,plain,
    ! [B_786,B_787,A_788] :
      ( ( subset_difference(B_786,B_787,A_788) = set_difference(B_787,A_788) )
      | ~ element(B_787,powerset(B_786))
      | ~ subset(A_788,B_786) ),
    inference(resolution,[status(thm)],[c_202,c_4706]) ).

tff(c_52713,plain,
    ! [A_1239,A_1240] :
      ( ( subset_difference(A_1239,A_1239,A_1240) = set_difference(A_1239,A_1240) )
      | ~ subset(A_1240,A_1239) ),
    inference(resolution,[status(thm)],[c_217,c_22015]) ).

tff(c_52811,plain,
    subset_difference('#skF_5','#skF_5',set_meet('#skF_6')) = set_difference('#skF_5',set_meet('#skF_6')),
    inference(resolution,[status(thm)],[c_3819,c_52713]) ).

tff(c_52880,plain,
    set_difference('#skF_5',set_meet('#skF_6')) = union(complements_of_subsets('#skF_5','#skF_6')),
    inference(demodulation,[status(thm),theory(equality)],[c_22660,c_52811]) ).

tff(c_52882,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_22657,c_52880]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SEU328+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.15  % 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.15/0.37  % Computer : n018.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Thu Aug  3 11:59:20 EDT 2023
% 0.15/0.37  % CPUTime  : 
% 24.37/11.66  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 24.37/11.67  
% 24.37/11.67  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 24.43/11.70  
% 24.43/11.70  Inference rules
% 24.43/11.70  ----------------------
% 24.43/11.70  #Ref     : 0
% 24.43/11.70  #Sup     : 11951
% 24.43/11.70  #Fact    : 0
% 24.43/11.70  #Define  : 0
% 24.43/11.70  #Split   : 45
% 24.43/11.70  #Chain   : 0
% 24.43/11.70  #Close   : 0
% 24.43/11.70  
% 24.43/11.70  Ordering : KBO
% 24.43/11.70  
% 24.43/11.70  Simplification rules
% 24.43/11.70  ----------------------
% 24.43/11.70  #Subsume      : 6031
% 24.43/11.70  #Demod        : 7324
% 24.43/11.70  #Tautology    : 2198
% 24.43/11.70  #SimpNegUnit  : 797
% 24.43/11.70  #BackRed      : 530
% 24.43/11.70  
% 24.43/11.70  #Partial instantiations: 0
% 24.43/11.70  #Strategies tried      : 1
% 24.43/11.70  
% 24.43/11.70  Timing (in seconds)
% 24.43/11.70  ----------------------
% 24.43/11.70  Preprocessing        : 0.67
% 24.43/11.70  Parsing              : 0.34
% 24.43/11.70  CNF conversion       : 0.05
% 24.43/11.70  Main loop            : 9.89
% 24.43/11.70  Inferencing          : 2.10
% 24.43/11.70  Reduction            : 4.17
% 24.43/11.70  Demodulation         : 3.24
% 24.43/11.70  BG Simplification    : 0.11
% 24.43/11.70  Subsumption          : 2.92
% 24.43/11.70  Abstraction          : 0.16
% 24.43/11.70  MUC search           : 0.00
% 24.43/11.70  Cooper               : 0.00
% 24.43/11.70  Total                : 10.61
% 24.43/11.70  Index Insertion      : 0.00
% 24.43/11.70  Index Deletion       : 0.00
% 24.43/11.70  Index Matching       : 0.00
% 24.43/11.70  BG Taut test         : 0.00
%------------------------------------------------------------------------------