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

View Problem - Process Solution

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

% Computer : n019.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:18 EDT 2023

% Result   : Theorem 0.21s 0.60s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   30
% Syntax   : Number of formulae    :   44 (   3 unt;  27 typ;   0 def)
%            Number of atoms       :   49 (   9 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   52 (  20   ~;  17   |;   7   &)
%                                         (   2 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   21 (  16   >;   5   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;  11 con; 0-2 aty)
%            Number of variables   :   29 (   0 sgn;  19   !;   0   ?;   0   :)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(decl_36,type,
    esk2_1: $i > $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_0: $i ).

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

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

tff(decl_43,type,
    esk9_1: $i > $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 ).

tff(decl_48,type,
    esk14_0: $i ).

fof(t143_funct_1,conjecture,
    ! [X1,X2] :
      ( relation(X2)
     => ( ! [X3] :
            ~ ( in(X3,X1)
              & relation_inverse_image(X2,singleton(X3)) = empty_set )
       => subset(X1,relation_rng(X2)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t143_funct_1) ).

fof(t142_funct_1,axiom,
    ! [X1,X2] :
      ( relation(X2)
     => ( in(X1,relation_rng(X2))
      <=> relation_inverse_image(X2,singleton(X1)) != empty_set ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t142_funct_1) ).

fof(d3_tarski,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
    <=> ! [X3] :
          ( in(X3,X1)
         => in(X3,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2] :
        ( relation(X2)
       => ( ! [X3] :
              ~ ( in(X3,X1)
                & relation_inverse_image(X2,singleton(X3)) = empty_set )
         => subset(X1,relation_rng(X2)) ) ),
    inference(assume_negation,[status(cth)],[t143_funct_1]) ).

fof(c_0_4,plain,
    ! [X34,X35] :
      ( ( ~ in(X34,relation_rng(X35))
        | relation_inverse_image(X35,singleton(X34)) != empty_set
        | ~ relation(X35) )
      & ( relation_inverse_image(X35,singleton(X34)) = empty_set
        | in(X34,relation_rng(X35))
        | ~ relation(X35) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t142_funct_1])])]) ).

fof(c_0_5,negated_conjecture,
    ! [X38] :
      ( relation(esk14_0)
      & ( ~ in(X38,esk13_0)
        | relation_inverse_image(esk14_0,singleton(X38)) != empty_set )
      & ~ subset(esk13_0,relation_rng(esk14_0)) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).

cnf(c_0_6,plain,
    ( relation_inverse_image(X1,singleton(X2)) = empty_set
    | in(X2,relation_rng(X1))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

cnf(c_0_8,negated_conjecture,
    ( ~ in(X1,esk13_0)
    | relation_inverse_image(esk14_0,singleton(X1)) != empty_set ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    ( relation_inverse_image(esk14_0,singleton(X1)) = empty_set
    | in(X1,relation_rng(esk14_0)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

fof(c_0_10,plain,
    ! [X9,X10,X11,X12,X13] :
      ( ( ~ subset(X9,X10)
        | ~ in(X11,X9)
        | in(X11,X10) )
      & ( in(esk1_2(X12,X13),X12)
        | subset(X12,X13) )
      & ( ~ in(esk1_2(X12,X13),X13)
        | subset(X12,X13) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])]) ).

cnf(c_0_11,negated_conjecture,
    ( in(X1,relation_rng(esk14_0))
    | ~ in(X1,esk13_0) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,plain,
    ( in(esk1_2(X1,X2),X1)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_13,plain,
    ( subset(X1,X2)
    | ~ in(esk1_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    ( subset(esk13_0,X1)
    | in(esk1_2(esk13_0,X1),relation_rng(esk14_0)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ~ subset(esk13_0,relation_rng(esk14_0)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SEU062+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35  % Computer : n019.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   : Wed Aug 23 19:55:59 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.58  start to proof: theBenchmark
% 0.21/0.60  % Version  : CSE_E---1.5
% 0.21/0.60  % Problem  : theBenchmark.p
% 0.21/0.60  % Proof found
% 0.21/0.60  % SZS status Theorem for theBenchmark.p
% 0.21/0.60  % SZS output start Proof
% See solution above
% 0.21/0.60  % Total time : 0.011000 s
% 0.21/0.60  % SZS output end Proof
% 0.21/0.60  % Total time : 0.014000 s
%------------------------------------------------------------------------------