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

View Problem - Process Solution

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

% Computer : n002.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:10 EDT 2023

% Result   : Theorem 0.21s 0.59s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   29
% Syntax   : Number of formulae    :   46 (   6 unt;  24 typ;   0 def)
%            Number of atoms       :   52 (  16 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   51 (  21   ~;  15   |;   6   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   30 (  18   >;  12   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   20 (  20 usr;   6 con; 0-3 aty)
%            Number of variables   :   13 (   0 sgn;  10   !;   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,
    unordered_pair: ( $i * $i ) > $i ).

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

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

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

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

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

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

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

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

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

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

tff(decl_36,type,
    esk5_2: ( $i * $i ) > $i ).

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

tff(decl_38,type,
    esk7_1: $i > $i ).

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

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

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

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

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

tff(decl_44,type,
    esk13_1: $i > $i ).

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

fof(fc6_relat_1,axiom,
    ! [X1] :
      ( ( ~ empty(X1)
        & relation(X1) )
     => ~ empty(relation_rng(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc6_relat_1) ).

fof(t64_relat_1,conjecture,
    ! [X1] :
      ( relation(X1)
     => ( ( relation_dom(X1) = empty_set
          | relation_rng(X1) = empty_set )
       => X1 = empty_set ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t64_relat_1) ).

fof(fc5_relat_1,axiom,
    ! [X1] :
      ( ( ~ empty(X1)
        & relation(X1) )
     => ~ empty(relation_dom(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc5_relat_1) ).

fof(fc1_xboole_0,axiom,
    empty(empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).

fof(t6_boole,axiom,
    ! [X1] :
      ( empty(X1)
     => X1 = empty_set ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).

fof(c_0_5,plain,
    ! [X1] :
      ( ( ~ empty(X1)
        & relation(X1) )
     => ~ empty(relation_rng(X1)) ),
    inference(fof_simplification,[status(thm)],[fc6_relat_1]) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X1] :
        ( relation(X1)
       => ( ( relation_dom(X1) = empty_set
            | relation_rng(X1) = empty_set )
         => X1 = empty_set ) ),
    inference(assume_negation,[status(cth)],[t64_relat_1]) ).

fof(c_0_7,plain,
    ! [X1] :
      ( ( ~ empty(X1)
        & relation(X1) )
     => ~ empty(relation_dom(X1)) ),
    inference(fof_simplification,[status(thm)],[fc5_relat_1]) ).

fof(c_0_8,plain,
    ! [X40] :
      ( empty(X40)
      | ~ relation(X40)
      | ~ empty(relation_rng(X40)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).

fof(c_0_9,negated_conjecture,
    ( relation(esk14_0)
    & ( relation_dom(esk14_0) = empty_set
      | relation_rng(esk14_0) = empty_set )
    & esk14_0 != empty_set ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

fof(c_0_10,plain,
    ! [X39] :
      ( empty(X39)
      | ~ relation(X39)
      | ~ empty(relation_dom(X39)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).

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

cnf(c_0_12,negated_conjecture,
    ( relation_dom(esk14_0) = empty_set
    | relation_rng(esk14_0) = empty_set ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    relation(esk14_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    empty(empty_set),
    inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).

fof(c_0_15,plain,
    ! [X55] :
      ( ~ empty(X55)
      | X55 = empty_set ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).

cnf(c_0_16,plain,
    ( empty(X1)
    | ~ relation(X1)
    | ~ empty(relation_dom(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_17,negated_conjecture,
    ( relation_dom(esk14_0) = empty_set
    | empty(esk14_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).

cnf(c_0_18,plain,
    ( X1 = empty_set
    | ~ empty(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    empty(esk14_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_13]),c_0_14])]) ).

cnf(c_0_20,negated_conjecture,
    esk14_0 != empty_set,
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEU188+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34  % Computer : n002.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Wed Aug 23 14:10:01 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.60  % Total time : 0.014000 s
% 0.21/0.60  % SZS output end Proof
% 0.21/0.60  % Total time : 0.016000 s
%------------------------------------------------------------------------------