TSTP Solution File: SEU200+1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SEU200+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n016.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 16:23:16 EDT 2023

% Result   : Theorem 0.22s 0.59s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   37 (   6 unt;  19 typ;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   39 (  16   ~;  13   |;   3   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   16 (  12   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   7 con; 0-2 aty)
%            Number of variables   :   25 (   5 sgn;  16   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    in: ( $i * $i ) > $o ).

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

tff(decl_24,type,
    relation: $i > $o ).

tff(decl_25,type,
    relation_rng_restriction: ( $i * $i ) > $i ).

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

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

tff(decl_28,type,
    empty_set: $i ).

tff(decl_29,type,
    relation_dom: $i > $i ).

tff(decl_30,type,
    relation_rng: $i > $i ).

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

tff(decl_32,type,
    esk1_1: $i > $i ).

tff(decl_33,type,
    esk2_0: $i ).

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

tff(decl_35,type,
    esk4_0: $i ).

tff(decl_36,type,
    esk5_0: $i ).

tff(decl_37,type,
    esk6_1: $i > $i ).

tff(decl_38,type,
    esk7_0: $i ).

tff(decl_39,type,
    esk8_0: $i ).

tff(decl_40,type,
    esk9_0: $i ).

fof(t118_relat_1,conjecture,
    ! [X1,X2] :
      ( relation(X2)
     => subset(relation_rng(relation_rng_restriction(X1,X2)),relation_rng(X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t118_relat_1) ).

fof(t117_relat_1,axiom,
    ! [X1,X2] :
      ( relation(X2)
     => subset(relation_rng_restriction(X1,X2),X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t117_relat_1) ).

fof(dt_k8_relat_1,axiom,
    ! [X1,X2] :
      ( relation(X2)
     => relation(relation_rng_restriction(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k8_relat_1) ).

fof(t25_relat_1,axiom,
    ! [X1] :
      ( relation(X1)
     => ! [X2] :
          ( relation(X2)
         => ( subset(X1,X2)
           => ( subset(relation_dom(X1),relation_dom(X2))
              & subset(relation_rng(X1),relation_rng(X2)) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t25_relat_1) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1,X2] :
        ( relation(X2)
       => subset(relation_rng(relation_rng_restriction(X1,X2)),relation_rng(X2)) ),
    inference(assume_negation,[status(cth)],[t118_relat_1]) ).

fof(c_0_5,plain,
    ! [X25,X26] :
      ( ~ relation(X26)
      | subset(relation_rng_restriction(X25,X26),X26) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t117_relat_1])]) ).

fof(c_0_6,negated_conjecture,
    ( relation(esk9_0)
    & ~ subset(relation_rng(relation_rng_restriction(esk8_0,esk9_0)),relation_rng(esk9_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_7,plain,
    ! [X7,X8] :
      ( ~ relation(X8)
      | relation(relation_rng_restriction(X7,X8)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k8_relat_1])]) ).

fof(c_0_8,plain,
    ! [X31,X32] :
      ( ( subset(relation_dom(X31),relation_dom(X32))
        | ~ subset(X31,X32)
        | ~ relation(X32)
        | ~ relation(X31) )
      & ( subset(relation_rng(X31),relation_rng(X32))
        | ~ subset(X31,X32)
        | ~ relation(X32)
        | ~ relation(X31) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t25_relat_1])])])]) ).

cnf(c_0_9,plain,
    ( subset(relation_rng_restriction(X2,X1),X1)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    relation(esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ( relation(relation_rng_restriction(X2,X1))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ( subset(relation_rng(X1),relation_rng(X2))
    | ~ subset(X1,X2)
    | ~ relation(X2)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    subset(relation_rng_restriction(X1,esk9_0),esk9_0),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    relation(relation_rng_restriction(X1,esk9_0)),
    inference(spm,[status(thm)],[c_0_11,c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    ~ subset(relation_rng(relation_rng_restriction(esk8_0,esk9_0)),relation_rng(esk9_0)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_16,negated_conjecture,
    subset(relation_rng(relation_rng_restriction(X1,esk9_0)),relation_rng(esk9_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10]),c_0_14])]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SEU200+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.15/0.35  % Computer : n016.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Thu Aug 24 02:07:23 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.22/0.57  start to proof: theBenchmark
% 0.22/0.59  % Version  : CSE_E---1.5
% 0.22/0.59  % Problem  : theBenchmark.p
% 0.22/0.59  % Proof found
% 0.22/0.59  % SZS status Theorem for theBenchmark.p
% 0.22/0.59  % SZS output start Proof
% See solution above
% 0.22/0.59  % Total time : 0.008000 s
% 0.22/0.59  % SZS output end Proof
% 0.22/0.59  % Total time : 0.011000 s
%------------------------------------------------------------------------------