TSTP Solution File: SET075-7 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SET075-7 : 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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n004.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:50 EDT 2023

% Result   : Unsatisfiable 6.77s 2.50s
% Output   : CNFRefutation 6.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   56
% Syntax   : Number of formulae    :   65 (   9 unt;  51 typ;   0 def)
%            Number of atoms       :   19 (   2 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   13 (   8   ~;   5   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   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    :   42 (  42 usr;  12 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 > y > x > v > universal_class > u > 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(u,type,
    u: $i ).

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

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_724,axiom,
    ! [Z] : ~ member(Z,null_class),
    file(unknown,unknown) ).

tff(f_785,axiom,
    unordered_pair(x,y) = null_class,
    file(unknown,unknown) ).

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

tff(f_784,axiom,
    member(ordered_pair(x,y),cross_product(u,v)),
    file(unknown,unknown) ).

tff(f_666,axiom,
    ! [U,V,X,Y] :
      ( ~ member(ordered_pair(U,V),cross_product(X,Y))
      | member(V,universal_class) ),
    file(unknown,unknown) ).

tff(c_206,plain,
    ! [Z_207] : ~ member(Z_207,null_class),
    inference(cnfTransformation,[status(thm)],[f_724]) ).

tff(c_234,plain,
    unordered_pair(x,y) = null_class,
    inference(cnfTransformation,[status(thm)],[f_785]) ).

tff(c_662,plain,
    ! [Y_289,X_290] :
      ( member(Y_289,unordered_pair(X_290,Y_289))
      | ~ member(Y_289,universal_class) ),
    inference(cnfTransformation,[status(thm)],[f_117]) ).

tff(c_677,plain,
    ( member(y,null_class)
    | ~ member(y,universal_class) ),
    inference(superposition,[status(thm),theory(equality)],[c_234,c_662]) ).

tff(c_678,plain,
    ~ member(y,universal_class),
    inference(negUnitSimplification,[status(thm)],[c_206,c_677]) ).

tff(c_232,plain,
    member(ordered_pair(x,y),cross_product(u,v)),
    inference(cnfTransformation,[status(thm)],[f_784]) ).

tff(c_2466,plain,
    ! [V_396,U_397,X_398,Y_399] :
      ( member(V_396,universal_class)
      | ~ member(ordered_pair(U_397,V_396),cross_product(X_398,Y_399)) ),
    inference(cnfTransformation,[status(thm)],[f_666]) ).

tff(c_2469,plain,
    member(y,universal_class),
    inference(resolution,[status(thm)],[c_232,c_2466]) ).

tff(c_2473,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_678,c_2469]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET075-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.12/0.33  % Computer : n004.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Thu Aug  3 16:37:41 EDT 2023
% 0.12/0.33  % CPUTime  : 
% 6.77/2.50  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.77/2.50  
% 6.77/2.50  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.77/2.53  
% 6.77/2.53  Inference rules
% 6.77/2.53  ----------------------
% 6.77/2.53  #Ref     : 0
% 6.77/2.53  #Sup     : 547
% 6.77/2.53  #Fact    : 0
% 6.77/2.53  #Define  : 0
% 6.77/2.53  #Split   : 5
% 6.77/2.53  #Chain   : 0
% 6.77/2.53  #Close   : 0
% 6.77/2.53  
% 6.77/2.53  Ordering : KBO
% 6.77/2.53  
% 6.77/2.53  Simplification rules
% 6.77/2.53  ----------------------
% 6.77/2.53  #Subsume      : 83
% 6.77/2.53  #Demod        : 170
% 6.77/2.53  #Tautology    : 209
% 6.77/2.53  #SimpNegUnit  : 25
% 6.77/2.53  #BackRed      : 12
% 6.77/2.53  
% 6.77/2.53  #Partial instantiations: 0
% 6.77/2.53  #Strategies tried      : 1
% 6.77/2.53  
% 6.77/2.53  Timing (in seconds)
% 6.77/2.53  ----------------------
% 6.77/2.54  Preprocessing        : 0.72
% 6.77/2.54  Parsing              : 0.37
% 6.77/2.54  CNF conversion       : 0.05
% 6.77/2.54  Main loop            : 0.79
% 6.77/2.54  Inferencing          : 0.27
% 6.77/2.54  Reduction            : 0.26
% 6.77/2.54  Demodulation         : 0.19
% 6.77/2.54  BG Simplification    : 0.05
% 6.77/2.54  Subsumption          : 0.16
% 6.77/2.54  Abstraction          : 0.03
% 6.77/2.54  MUC search           : 0.00
% 6.77/2.54  Cooper               : 0.00
% 6.77/2.54  Total                : 1.56
% 6.77/2.54  Index Insertion      : 0.00
% 6.77/2.54  Index Deletion       : 0.00
% 6.77/2.54  Index Matching       : 0.00
% 6.77/2.54  BG Taut test         : 0.00
%------------------------------------------------------------------------------