TSTP Solution File: SET658+3 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SET658+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n015.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 : Thu Aug 31 14:35:05 EDT 2023

% Result   : Theorem 0.21s 0.59s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   34
% Syntax   : Number of formulae    :   47 (   7 unt;  30 typ;   0 def)
%            Number of atoms       :   34 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   30 (  13   ~;  10   |;   1   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   43 (  26   >;  17   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   25 (  25 usr;   4 con; 0-3 aty)
%            Number of variables   :   17 (   1 sgn;  10   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    set_type: $i ).

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

tff(decl_24,type,
    binary_relation_type: $i ).

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

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

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

tff(decl_28,type,
    relation_type: ( $i * $i ) > $i ).

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

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

tff(decl_31,type,
    relation_like: $i > $o ).

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

tff(decl_33,type,
    subset_type: $i > $i ).

tff(decl_34,type,
    power_set: $i > $i ).

tff(decl_35,type,
    member_type: $i > $i ).

tff(decl_36,type,
    empty: $i > $o ).

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

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

tff(decl_39,type,
    esk1_2: ( $i * $i ) > $i ).

tff(decl_40,type,
    esk2_2: ( $i * $i ) > $i ).

tff(decl_41,type,
    esk3_0: $i ).

tff(decl_42,type,
    esk4_2: ( $i * $i ) > $i ).

tff(decl_43,type,
    esk5_1: $i > $i ).

tff(decl_44,type,
    esk6_2: ( $i * $i ) > $i ).

tff(decl_45,type,
    esk7_2: ( $i * $i ) > $i ).

tff(decl_46,type,
    esk8_2: ( $i * $i ) > $i ).

tff(decl_47,type,
    esk9_1: $i > $i ).

tff(decl_48,type,
    esk10_2: ( $i * $i ) > $i ).

tff(decl_49,type,
    esk11_1: $i > $i ).

tff(decl_50,type,
    esk12_1: $i > $i ).

tff(decl_51,type,
    esk13_0: $i ).

fof(prove_relset_1_20,conjecture,
    ! [X1] :
      ( ilf_type(X1,binary_relation_type)
     => ilf_type(X1,relation_type(domain_of(X1),range_of(X1))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_relset_1_20) ).

fof(p1,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,binary_relation_type)
         => ( subset(domain_of(X2),X1)
           => ilf_type(X2,relation_type(X1,range_of(X2))) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p1) ).

fof(p28,axiom,
    ! [X1] : ilf_type(X1,set_type),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p28) ).

fof(p15,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => subset(X1,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p15) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1] :
        ( ilf_type(X1,binary_relation_type)
       => ilf_type(X1,relation_type(domain_of(X1),range_of(X1))) ),
    inference(assume_negation,[status(cth)],[prove_relset_1_20]) ).

fof(c_0_5,plain,
    ! [X5,X6] :
      ( ~ ilf_type(X5,set_type)
      | ~ ilf_type(X6,binary_relation_type)
      | ~ subset(domain_of(X6),X5)
      | ilf_type(X6,relation_type(X5,range_of(X6))) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])]) ).

fof(c_0_6,plain,
    ! [X74] : ilf_type(X74,set_type),
    inference(variable_rename,[status(thm)],[p28]) ).

fof(c_0_7,plain,
    ! [X38] :
      ( ~ ilf_type(X38,set_type)
      | subset(X38,X38) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p15])]) ).

fof(c_0_8,negated_conjecture,
    ( ilf_type(esk13_0,binary_relation_type)
    & ~ ilf_type(esk13_0,relation_type(domain_of(esk13_0),range_of(esk13_0))) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

cnf(c_0_9,plain,
    ( ilf_type(X2,relation_type(X1,range_of(X2)))
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,binary_relation_type)
    | ~ subset(domain_of(X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,plain,
    ilf_type(X1,set_type),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ( subset(X1,X1)
    | ~ ilf_type(X1,set_type) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    ~ ilf_type(esk13_0,relation_type(domain_of(esk13_0),range_of(esk13_0))),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( ilf_type(X1,relation_type(X2,range_of(X1)))
    | ~ subset(domain_of(X1),X2)
    | ~ ilf_type(X1,binary_relation_type) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).

cnf(c_0_14,plain,
    subset(X1,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10])]) ).

cnf(c_0_15,negated_conjecture,
    ilf_type(esk13_0,binary_relation_type),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SET658+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35  % Computer : n015.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   : Sat Aug 26 09:28:52 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.57  start to proof: theBenchmark
% 0.21/0.59  % Version  : CSE_E---1.5
% 0.21/0.59  % Problem  : theBenchmark.p
% 0.21/0.59  % Proof found
% 0.21/0.59  % SZS status Theorem for theBenchmark.p
% 0.21/0.59  % SZS output start Proof
% See solution above
% 0.21/0.59  % Total time : 0.012000 s
% 0.21/0.59  % SZS output end Proof
% 0.21/0.59  % Total time : 0.015000 s
%------------------------------------------------------------------------------