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

View Problem - Process Solution

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

% Computer : n032.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:22:13 EDT 2023

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

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

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

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

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

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

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

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

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

tff(decl_30,type,
    one_to_one: $i > $o ).

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

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

tff(decl_33,type,
    relation_dom_restriction: ( $i * $i ) > $i ).

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

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

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

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

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

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

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

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

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

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

tff(decl_44,type,
    esk10_0: $i ).

tff(decl_45,type,
    esk11_0: $i ).

tff(decl_46,type,
    esk12_0: $i ).

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

fof(t76_funct_1,conjecture,
    ! [X1,X2] :
      ( ( relation(X2)
        & function(X2) )
     => ( subset(relation_dom(relation_dom_restriction(X2,X1)),relation_dom(X2))
        & subset(relation_rng(relation_dom_restriction(X2,X1)),relation_rng(X2)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t76_funct_1) ).

fof(t89_relat_1,axiom,
    ! [X1,X2] :
      ( relation(X2)
     => subset(relation_dom(relation_dom_restriction(X2,X1)),relation_dom(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t89_relat_1) ).

fof(t99_relat_1,axiom,
    ! [X1,X2] :
      ( relation(X2)
     => subset(relation_rng(relation_dom_restriction(X2,X1)),relation_rng(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t99_relat_1) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2] :
        ( ( relation(X2)
          & function(X2) )
       => ( subset(relation_dom(relation_dom_restriction(X2,X1)),relation_dom(X2))
          & subset(relation_rng(relation_dom_restriction(X2,X1)),relation_rng(X2)) ) ),
    inference(assume_negation,[status(cth)],[t76_funct_1]) ).

fof(c_0_4,plain,
    ! [X54,X55] :
      ( ~ relation(X55)
      | subset(relation_dom(relation_dom_restriction(X55,X54)),relation_dom(X55)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t89_relat_1])]) ).

fof(c_0_5,negated_conjecture,
    ( relation(esk13_0)
    & function(esk13_0)
    & ( ~ subset(relation_dom(relation_dom_restriction(esk13_0,esk12_0)),relation_dom(esk13_0))
      | ~ subset(relation_rng(relation_dom_restriction(esk13_0,esk12_0)),relation_rng(esk13_0)) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

cnf(c_0_6,plain,
    ( subset(relation_dom(relation_dom_restriction(X1,X2)),relation_dom(X1))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    relation(esk13_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_8,plain,
    ! [X56,X57] :
      ( ~ relation(X57)
      | subset(relation_rng(relation_dom_restriction(X57,X56)),relation_rng(X57)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t99_relat_1])]) ).

cnf(c_0_9,negated_conjecture,
    ( ~ subset(relation_dom(relation_dom_restriction(esk13_0,esk12_0)),relation_dom(esk13_0))
    | ~ subset(relation_rng(relation_dom_restriction(esk13_0,esk12_0)),relation_rng(esk13_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    subset(relation_dom(relation_dom_restriction(esk13_0,X1)),relation_dom(esk13_0)),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

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

cnf(c_0_12,negated_conjecture,
    ~ subset(relation_rng(relation_dom_restriction(esk13_0,esk12_0)),relation_rng(esk13_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).

cnf(c_0_13,negated_conjecture,
    subset(relation_rng(relation_dom_restriction(esk13_0,X1)),relation_rng(esk13_0)),
    inference(spm,[status(thm)],[c_0_11,c_0_7]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SEU040+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.10  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.10/0.30  % Computer : n032.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Wed Aug 23 12:53:25 EDT 2023
% 0.10/0.30  % CPUTime  : 
% 0.15/0.50  start to proof: theBenchmark
% 0.15/0.51  % Version  : CSE_E---1.5
% 0.15/0.51  % Problem  : theBenchmark.p
% 0.15/0.51  % Proof found
% 0.15/0.51  % SZS status Theorem for theBenchmark.p
% 0.15/0.51  % SZS output start Proof
% See solution above
% 0.15/0.52  % Total time : 0.010000 s
% 0.15/0.52  % SZS output end Proof
% 0.15/0.52  % Total time : 0.012000 s
%------------------------------------------------------------------------------