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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SET091+1 : TPTP v8.1.2. Bugfixed v7.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 : n003.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:55:55 EDT 2023

% Result   : Theorem 5.39s 2.29s
% Output   : CNFRefutation 5.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   44
% Syntax   : Number of formulae    :   53 (   5 unt;  41 typ;   0 def)
%            Number of atoms       :   21 (  16 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   16 (   7   ~;   6   |;   2   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   48 (  32   >;  16   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   36 (  36 usr;   9 con; 0-3 aty)
%            Number of variables   :    9 (;   8   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ subclass > member > disjoint > inductive > function > restrict > unordered_pair > union > ordered_pair > intersection > image > cross_product > compose > apply > #nlpp > sum_class > successor > singleton > second > rotate > range_of > power_class > member_of > inverse > flip > first > domain_of > complement > universal_class > successor_relation > null_class > identity_relation > element_relation > #skF_4 > #skF_7 > #skF_3 > #skF_2 > #skF_9 > #skF_8 > #skF_1 > #skF_5 > #skF_6

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_392,axiom,
    ! [X] :
      ( ( singleton(member_of(X)) = X )
      | ( member_of(X) = X ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_self) ).

tff(f_388,axiom,
    ! [X] :
      ( member(member_of(X),universal_class)
      | ( member_of(X) = X ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',member_universal_self) ).

tff(f_405,negated_conjecture,
    ~ ! [X,U] :
        ( ( ~ ? [Y] :
                ( member(Y,universal_class)
                & ( X = singleton(Y) ) )
          & ( X = U ) )
       => ( member_of(X) = U ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',member_when_not_a_singleton) ).

tff(c_186,plain,
    ! [X_98] :
      ( ( member_of(X_98) = X_98 )
      | ( singleton(member_of(X_98)) = X_98 ) ),
    inference(cnfTransformation,[status(thm)],[f_392]) ).

tff(c_407,plain,
    ! [X_145] :
      ( ( member_of(X_145) = X_145 )
      | member(member_of(X_145),universal_class) ),
    inference(cnfTransformation,[status(thm)],[f_388]) ).

tff(c_192,plain,
    ! [Y_100] :
      ( ( singleton(Y_100) != '#skF_8' )
      | ~ member(Y_100,universal_class) ),
    inference(cnfTransformation,[status(thm)],[f_405]) ).

tff(c_435,plain,
    ! [X_150] :
      ( ( singleton(member_of(X_150)) != '#skF_8' )
      | ( member_of(X_150) = X_150 ) ),
    inference(resolution,[status(thm)],[c_407,c_192]) ).

tff(c_966,plain,
    member_of('#skF_8') = '#skF_8',
    inference(superposition,[status(thm),theory(equality)],[c_186,c_435]) ).

tff(c_190,plain,
    '#skF_9' = '#skF_8',
    inference(cnfTransformation,[status(thm)],[f_405]) ).

tff(c_188,plain,
    member_of('#skF_8') != '#skF_9',
    inference(cnfTransformation,[status(thm)],[f_405]) ).

tff(c_193,plain,
    member_of('#skF_8') != '#skF_8',
    inference(demodulation,[status(thm),theory(equality)],[c_190,c_188]) ).

tff(c_969,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_966,c_193]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SET091+1 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.14/0.14  % 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.35  % Computer : n003.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Thu Aug  3 16:33:08 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 5.39/2.29  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.39/2.30  
% 5.39/2.30  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.63/2.32  
% 5.63/2.32  Inference rules
% 5.63/2.32  ----------------------
% 5.63/2.32  #Ref     : 0
% 5.63/2.32  #Sup     : 161
% 5.63/2.32  #Fact    : 0
% 5.63/2.32  #Define  : 0
% 5.63/2.32  #Split   : 8
% 5.63/2.32  #Chain   : 0
% 5.63/2.32  #Close   : 0
% 5.63/2.32  
% 5.63/2.32  Ordering : KBO
% 5.63/2.32  
% 5.63/2.32  Simplification rules
% 5.63/2.32  ----------------------
% 5.63/2.32  #Subsume      : 27
% 5.63/2.32  #Demod        : 16
% 5.63/2.32  #Tautology    : 37
% 5.63/2.32  #SimpNegUnit  : 0
% 5.63/2.32  #BackRed      : 1
% 5.63/2.32  
% 5.63/2.32  #Partial instantiations: 0
% 5.63/2.32  #Strategies tried      : 1
% 5.63/2.32  
% 5.63/2.32  Timing (in seconds)
% 5.63/2.32  ----------------------
% 5.63/2.32  Preprocessing        : 0.67
% 5.63/2.32  Parsing              : 0.34
% 5.63/2.32  CNF conversion       : 0.05
% 5.63/2.32  Main loop            : 0.50
% 5.63/2.32  Inferencing          : 0.17
% 5.63/2.32  Reduction            : 0.15
% 5.63/2.32  Demodulation         : 0.10
% 5.63/2.32  BG Simplification    : 0.04
% 5.63/2.32  Subsumption          : 0.12
% 5.63/2.32  Abstraction          : 0.02
% 5.63/2.32  MUC search           : 0.00
% 5.63/2.32  Cooper               : 0.00
% 5.63/2.32  Total                : 1.22
% 5.63/2.32  Index Insertion      : 0.00
% 5.63/2.32  Index Deletion       : 0.00
% 5.63/2.32  Index Matching       : 0.00
% 5.63/2.32  BG Taut test         : 0.00
%------------------------------------------------------------------------------