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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SET065-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 : n027.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:47 EDT 2023

% Result   : Unsatisfiable 5.46s 2.31s
% Output   : CNFRefutation 5.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   52
% Syntax   : Number of formulae    :   61 (   8 unt;  47 typ;   0 def)
%            Number of atoms       :   23 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   21 (  12   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   65 (  39   >;  26   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :   38 (  38 usr;   8 con; 0-3 aty)
%            Number of variables   :   14 (;  14   !;   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 > 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(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_645,axiom,
    ~ member(null_class,universal_class),
    file(unknown,unknown) ).

tff(f_71,axiom,
    ! [X] : subclass(X,universal_class),
    file(unknown,unknown) ).

tff(f_349,axiom,
    ! [X] :
      ( ~ inductive(X)
      | member(null_class,X) ),
    file(unknown,unknown) ).

tff(f_57,axiom,
    ! [X,Y,U] :
      ( ~ subclass(X,Y)
      | ~ member(U,X)
      | member(U,Y) ),
    file(unknown,unknown) ).

tff(f_368,axiom,
    inductive(omega),
    file(unknown,unknown) ).

tff(c_184,plain,
    ~ member(null_class,universal_class),
    inference(cnfTransformation,[status(thm)],[f_645]) ).

tff(c_8,plain,
    ! [X_8] : subclass(X_8,universal_class),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_94,plain,
    ! [X_106] :
      ( member(null_class,X_106)
      | ~ inductive(X_106) ),
    inference(cnfTransformation,[status(thm)],[f_349]) ).

tff(c_559,plain,
    ! [U_258,Y_259,X_260] :
      ( member(U_258,Y_259)
      | ~ member(U_258,X_260)
      | ~ subclass(X_260,Y_259) ),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_673,plain,
    ! [Y_267,X_268] :
      ( member(null_class,Y_267)
      | ~ subclass(X_268,Y_267)
      | ~ inductive(X_268) ),
    inference(resolution,[status(thm)],[c_94,c_559]) ).

tff(c_709,plain,
    ! [X_8] :
      ( member(null_class,universal_class)
      | ~ inductive(X_8) ),
    inference(resolution,[status(thm)],[c_8,c_673]) ).

tff(c_728,plain,
    ! [X_8] : ~ inductive(X_8),
    inference(negUnitSimplification,[status(thm)],[c_184,c_709]) ).

tff(c_100,plain,
    inductive(omega),
    inference(cnfTransformation,[status(thm)],[f_368]) ).

tff(c_764,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_728,c_100]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SET065-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13  % 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.14/0.35  % Computer : n027.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 17:08:54 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 5.46/2.31  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.46/2.31  
% 5.46/2.31  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.46/2.34  
% 5.46/2.34  Inference rules
% 5.46/2.34  ----------------------
% 5.46/2.34  #Ref     : 0
% 5.46/2.34  #Sup     : 130
% 5.46/2.34  #Fact    : 0
% 5.46/2.34  #Define  : 0
% 5.46/2.34  #Split   : 3
% 5.46/2.34  #Chain   : 0
% 5.46/2.34  #Close   : 0
% 5.46/2.34  
% 5.46/2.34  Ordering : KBO
% 5.46/2.34  
% 5.46/2.34  Simplification rules
% 5.46/2.34  ----------------------
% 5.46/2.34  #Subsume      : 18
% 5.46/2.34  #Demod        : 15
% 5.46/2.34  #Tautology    : 36
% 5.46/2.34  #SimpNegUnit  : 2
% 5.46/2.34  #BackRed      : 1
% 5.46/2.34  
% 5.46/2.34  #Partial instantiations: 0
% 5.46/2.34  #Strategies tried      : 1
% 5.46/2.34  
% 5.46/2.34  Timing (in seconds)
% 5.46/2.34  ----------------------
% 5.46/2.34  Preprocessing        : 0.69
% 5.46/2.34  Parsing              : 0.36
% 5.46/2.34  CNF conversion       : 0.04
% 5.46/2.34  Main loop            : 0.46
% 5.46/2.34  Inferencing          : 0.15
% 5.46/2.34  Reduction            : 0.15
% 5.46/2.34  Demodulation         : 0.11
% 5.46/2.34  BG Simplification    : 0.04
% 5.46/2.34  Subsumption          : 0.10
% 5.46/2.34  Abstraction          : 0.02
% 5.46/2.34  MUC search           : 0.00
% 5.46/2.34  Cooper               : 0.00
% 5.46/2.34  Total                : 1.20
% 5.46/2.34  Index Insertion      : 0.00
% 5.46/2.34  Index Deletion       : 0.00
% 5.46/2.34  Index Matching       : 0.00
% 5.46/2.34  BG Taut test         : 0.00
%------------------------------------------------------------------------------