TSTP Solution File: SET079-6 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SET079-6 : TPTP v8.1.2. Bugfixed v2.1.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 : n024.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:52 EDT 2023

% Result   : Unsatisfiable 5.84s 2.43s
% Output   : CNFRefutation 5.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   55
% Syntax   : Number of formulae    :   72 (  10 unt;  48 typ;   0 def)
%            Number of atoms       :   39 (  12 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  15   ~;  15   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   65 (  39   >;  26   *;   0   +;   0  <<)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :   39 (  39 usr;   9 con; 0-3 aty)
%            Number of variables   :   24 (;  24   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ homomorphism > compatible > subclass > member > single_valued_class > operation > one_to_one > inductive > function > restrict > range > not_homomorphism2 > not_homomorphism1 > domain > unordered_pair > union > symmetric_difference > ordered_pair > not_subclass_element > intersection > image > cross_product > compose > apply > #nlpp > sum_class > successor > singleton > second > rotate > regular > range_of > power_class > inverse > flip > first > domain_of > diagonalise > complement > cantor > x > universal_class > successor_relation > subset_relation > omega > null_class > identity_relation > element_relation > choice

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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(symmetric_difference,type,
    symmetric_difference: ( $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(choice,type,
    choice: $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_644,axiom,
    member(x,universal_class),
    file(unknown,unknown) ).

tff(f_645,axiom,
    singleton(x) = null_class,
    file(unknown,unknown) ).

tff(f_123,axiom,
    ! [X] : ( unordered_pair(X,X) = singleton(X) ),
    file(unknown,unknown) ).

tff(f_109,axiom,
    ! [X,Y] :
      ( ~ member(X,universal_class)
      | member(X,unordered_pair(X,Y)) ),
    file(unknown,unknown) ).

tff(f_474,axiom,
    ! [X] :
      ( ( X = null_class )
      | ( intersection(X,regular(X)) = null_class ) ),
    file(unknown,unknown) ).

tff(f_185,axiom,
    ! [Z,X,Y] :
      ( ~ member(Z,intersection(X,Y))
      | member(Z,X) ),
    file(unknown,unknown) ).

tff(f_207,axiom,
    ! [Z,X] :
      ( ~ member(Z,complement(X))
      | ~ member(Z,X) ),
    file(unknown,unknown) ).

tff(c_184,plain,
    member(x,universal_class),
    inference(cnfTransformation,[status(thm)],[f_644]) ).

tff(c_186,plain,
    singleton(x) = null_class,
    inference(cnfTransformation,[status(thm)],[f_645]) ).

tff(c_24,plain,
    ! [X_24] : ( unordered_pair(X_24,X_24) = singleton(X_24) ),
    inference(cnfTransformation,[status(thm)],[f_123]) ).

tff(c_361,plain,
    ! [X_220,Y_221] :
      ( member(X_220,unordered_pair(X_220,Y_221))
      | ~ member(X_220,universal_class) ),
    inference(cnfTransformation,[status(thm)],[f_109]) ).

tff(c_366,plain,
    ! [X_223] :
      ( member(X_223,singleton(X_223))
      | ~ member(X_223,universal_class) ),
    inference(superposition,[status(thm),theory(equality)],[c_24,c_361]) ).

tff(c_369,plain,
    ( member(x,null_class)
    | ~ member(x,universal_class) ),
    inference(superposition,[status(thm),theory(equality)],[c_186,c_366]) ).

tff(c_371,plain,
    member(x,null_class),
    inference(demodulation,[status(thm),theory(equality)],[c_184,c_369]) ).

tff(c_134,plain,
    ! [X_132] :
      ( ( intersection(X_132,regular(X_132)) = null_class )
      | ( null_class = X_132 ) ),
    inference(cnfTransformation,[status(thm)],[f_474]) ).

tff(c_542,plain,
    ! [Z_251,X_252,Y_253] :
      ( member(Z_251,X_252)
      | ~ member(Z_251,intersection(X_252,Y_253)) ),
    inference(cnfTransformation,[status(thm)],[f_185]) ).

tff(c_590,plain,
    ! [Z_259,X_260] :
      ( member(Z_259,X_260)
      | ~ member(Z_259,null_class)
      | ( null_class = X_260 ) ),
    inference(superposition,[status(thm),theory(equality)],[c_134,c_542]) ).

tff(c_607,plain,
    ! [X_261] :
      ( member(x,X_261)
      | ( null_class = X_261 ) ),
    inference(resolution,[status(thm)],[c_371,c_590]) ).

tff(c_48,plain,
    ! [Z_55,X_56] :
      ( ~ member(Z_55,X_56)
      | ~ member(Z_55,complement(X_56)) ),
    inference(cnfTransformation,[status(thm)],[f_207]) ).

tff(c_628,plain,
    ! [X_265] :
      ( ~ member(x,X_265)
      | ( complement(X_265) = null_class ) ),
    inference(resolution,[status(thm)],[c_607,c_48]) ).

tff(c_664,plain,
    complement(null_class) = null_class,
    inference(resolution,[status(thm)],[c_371,c_628]) ).

tff(c_1374,plain,
    ! [Z_292] :
      ( ~ member(Z_292,null_class)
      | ~ member(Z_292,null_class) ),
    inference(superposition,[status(thm),theory(equality)],[c_664,c_48]) ).

tff(c_1382,plain,
    ~ member(x,null_class),
    inference(resolution,[status(thm)],[c_371,c_1374]) ).

tff(c_1397,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_371,c_1382]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : SET079-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.08/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.36  % Computer : n024.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % 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 16:09:30 EDT 2023
% 0.15/0.37  % CPUTime  : 
% 5.84/2.43  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.84/2.44  
% 5.84/2.44  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.84/2.46  
% 5.84/2.46  Inference rules
% 5.84/2.46  ----------------------
% 5.84/2.46  #Ref     : 0
% 5.84/2.46  #Sup     : 298
% 5.84/2.46  #Fact    : 0
% 5.84/2.46  #Define  : 0
% 5.84/2.46  #Split   : 4
% 5.84/2.46  #Chain   : 0
% 5.84/2.46  #Close   : 0
% 5.84/2.46  
% 5.84/2.46  Ordering : KBO
% 5.84/2.46  
% 5.84/2.46  Simplification rules
% 5.84/2.46  ----------------------
% 5.84/2.46  #Subsume      : 18
% 5.84/2.46  #Demod        : 68
% 5.84/2.46  #Tautology    : 103
% 5.84/2.46  #SimpNegUnit  : 1
% 5.84/2.46  #BackRed      : 27
% 5.84/2.46  
% 5.84/2.46  #Partial instantiations: 0
% 5.84/2.46  #Strategies tried      : 1
% 5.84/2.46  
% 5.84/2.46  Timing (in seconds)
% 5.84/2.46  ----------------------
% 5.84/2.47  Preprocessing        : 0.67
% 5.84/2.47  Parsing              : 0.36
% 5.84/2.47  CNF conversion       : 0.05
% 5.84/2.47  Main loop            : 0.59
% 5.84/2.47  Inferencing          : 0.20
% 5.84/2.47  Reduction            : 0.19
% 5.84/2.47  Demodulation         : 0.14
% 5.84/2.47  BG Simplification    : 0.04
% 5.84/2.47  Subsumption          : 0.11
% 5.84/2.47  Abstraction          : 0.02
% 5.84/2.47  MUC search           : 0.00
% 5.84/2.47  Cooper               : 0.00
% 5.84/2.47  Total                : 1.31
% 5.84/2.47  Index Insertion      : 0.00
% 5.84/2.47  Index Deletion       : 0.00
% 5.84/2.47  Index Matching       : 0.00
% 5.84/2.47  BG Taut test         : 0.00
%------------------------------------------------------------------------------