↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SET055-6 : TPTP v9.0.0. Released v1.0.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 : n029.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 : Wed Apr  9 08:37:42 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ homomorphism > compatible > subclass > member > equalish > 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(equalish,type,
    equalish: ( $i * $i ) > $o ).

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_425,axiom,
    ! [X,Y] :
      ( member(not_subclass_element(X,Y),X)
      | subclass(X,Y) ),
    file(unknown,unknown) ).

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

tff(f_454,axiom,
    ! [X,Y] :
      ( ~ subclass(X,Y)
      | ~ subclass(Y,X)
      | equalish(X,Y) ),
    file(unknown,unknown) ).

tff(f_990,axiom,
    ~ equalish(x,x),
    file(unknown,unknown) ).

tff(c_959,plain,
    ! [X_490,Y_491] :
      ( subclass(X_490,Y_491)
      | member(not_subclass_element(X_490,Y_491),X_490) ),
    inference(cnfTransformation,[status(thm)],[f_425]) ).

tff(c_140,plain,
    ! [X_207,Y_208] :
      ( subclass(X_207,Y_208)
      | ~ member(not_subclass_element(X_207,Y_208),Y_208) ),
    inference(cnfTransformation,[status(thm)],[f_430]) ).

tff(c_972,plain,
    ! [X_490] : subclass(X_490,X_490),
    inference(resolution,[status(thm)],[c_959,c_140]) ).

tff(c_1531,plain,
    ! [X_542,Y_543] :
      ( equalish(X_542,Y_543)
      | ~ subclass(Y_543,X_542)
      | ~ subclass(X_542,Y_543) ),
    inference(cnfTransformation,[status(thm)],[f_454]) ).

tff(c_1537,plain,
    ! [X_490] :
      ( equalish(X_490,X_490)
      | ~ subclass(X_490,X_490) ),
    inference(resolution,[status(thm)],[c_972,c_1531]) ).

tff(c_1566,plain,
    ! [X_490] : equalish(X_490,X_490),
    inference(demodulation,[status(thm),theory(equality)],[c_972,c_1537]) ).

tff(c_318,plain,
    ~ equalish(x,x),
    inference(cnfTransformation,[status(thm)],[f_990]) ).

tff(c_1581,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_1566,c_318]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET055-6 : TPTP v9.0.0. Released v1.0.0.
% 0.11/0.12  % 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.13/0.33  % Computer : n029.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Tue Apr  8 19:54:19 EDT 2025
% 0.13/0.33  % CPUTime  : 
% 6.98/2.54  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.98/2.55  
% 6.98/2.55  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------