TSTP Solution File: SEU180+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SEU180+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n011.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  : 600s
% DateTime : Tue Jul 19 09:17:32 EDT 2022

% Result   : Theorem 0.23s 1.41s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   28 (   6 unt;   0 def)
%            Number of atoms       :  114 (  26 equ)
%            Maximal formula atoms :   20 (   4 avg)
%            Number of connectives :  140 (  54   ~;  58   |;  15   &)
%                                         (   6 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   3 con; 0-3 aty)
%            Number of variables   :   67 (  14 sgn  40   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t30_relat_1,conjecture,
    ! [X1,X2,X3] :
      ( relation(X3)
     => ( in(ordered_pair(X1,X2),X3)
       => ( in(X1,relation_field(X3))
          & in(X2,relation_field(X3)) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t30_relat_1) ).

fof(d5_relat_1,axiom,
    ! [X1] :
      ( relation(X1)
     => ! [X2] :
          ( X2 = relation_rng(X1)
        <=> ! [X3] :
              ( in(X3,X2)
            <=> ? [X4] : in(ordered_pair(X4,X3),X1) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_relat_1) ).

fof(d6_relat_1,axiom,
    ! [X1] :
      ( relation(X1)
     => relation_field(X1) = set_union2(relation_dom(X1),relation_rng(X1)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d6_relat_1) ).

fof(d2_xboole_0,axiom,
    ! [X1,X2,X3] :
      ( X3 = set_union2(X1,X2)
    <=> ! [X4] :
          ( in(X4,X3)
        <=> ( in(X4,X1)
            | in(X4,X2) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_xboole_0) ).

fof(d4_relat_1,axiom,
    ! [X1] :
      ( relation(X1)
     => ! [X2] :
          ( X2 = relation_dom(X1)
        <=> ! [X3] :
              ( in(X3,X2)
            <=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_relat_1) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( relation(X3)
       => ( in(ordered_pair(X1,X2),X3)
         => ( in(X1,relation_field(X3))
            & in(X2,relation_field(X3)) ) ) ),
    inference(assume_negation,[status(cth)],[t30_relat_1]) ).

fof(c_0_6,plain,
    ! [X5,X6,X7,X7,X9,X6,X11] :
      ( ( ~ in(X7,X6)
        | in(ordered_pair(esk8_3(X5,X6,X7),X7),X5)
        | X6 != relation_rng(X5)
        | ~ relation(X5) )
      & ( ~ in(ordered_pair(X9,X7),X5)
        | in(X7,X6)
        | X6 != relation_rng(X5)
        | ~ relation(X5) )
      & ( ~ in(esk9_2(X5,X6),X6)
        | ~ in(ordered_pair(X11,esk9_2(X5,X6)),X5)
        | X6 = relation_rng(X5)
        | ~ relation(X5) )
      & ( in(esk9_2(X5,X6),X6)
        | in(ordered_pair(esk10_2(X5,X6),esk9_2(X5,X6)),X5)
        | X6 = relation_rng(X5)
        | ~ relation(X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_relat_1])])])])])])]) ).

fof(c_0_7,negated_conjecture,
    ( relation(esk3_0)
    & in(ordered_pair(esk1_0,esk2_0),esk3_0)
    & ( ~ in(esk1_0,relation_field(esk3_0))
      | ~ in(esk2_0,relation_field(esk3_0)) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

fof(c_0_8,plain,
    ! [X2] :
      ( ~ relation(X2)
      | relation_field(X2) = set_union2(relation_dom(X2),relation_rng(X2)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d6_relat_1])]) ).

fof(c_0_9,plain,
    ! [X5,X6,X7,X8,X8,X5,X6,X7] :
      ( ( ~ in(X8,X7)
        | in(X8,X5)
        | in(X8,X6)
        | X7 != set_union2(X5,X6) )
      & ( ~ in(X8,X5)
        | in(X8,X7)
        | X7 != set_union2(X5,X6) )
      & ( ~ in(X8,X6)
        | in(X8,X7)
        | X7 != set_union2(X5,X6) )
      & ( ~ in(esk4_3(X5,X6,X7),X5)
        | ~ in(esk4_3(X5,X6,X7),X7)
        | X7 = set_union2(X5,X6) )
      & ( ~ in(esk4_3(X5,X6,X7),X6)
        | ~ in(esk4_3(X5,X6,X7),X7)
        | X7 = set_union2(X5,X6) )
      & ( in(esk4_3(X5,X6,X7),X7)
        | in(esk4_3(X5,X6,X7),X5)
        | in(esk4_3(X5,X6,X7),X6)
        | X7 = set_union2(X5,X6) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_xboole_0])])])])])])]) ).

cnf(c_0_10,plain,
    ( in(X3,X2)
    | ~ relation(X1)
    | X2 != relation_rng(X1)
    | ~ in(ordered_pair(X4,X3),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,negated_conjecture,
    in(ordered_pair(esk1_0,esk2_0),esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    relation(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_13,plain,
    ! [X5,X6,X7,X7,X9,X6,X11] :
      ( ( ~ in(X7,X6)
        | in(ordered_pair(X7,esk11_3(X5,X6,X7)),X5)
        | X6 != relation_dom(X5)
        | ~ relation(X5) )
      & ( ~ in(ordered_pair(X7,X9),X5)
        | in(X7,X6)
        | X6 != relation_dom(X5)
        | ~ relation(X5) )
      & ( ~ in(esk12_2(X5,X6),X6)
        | ~ in(ordered_pair(esk12_2(X5,X6),X11),X5)
        | X6 = relation_dom(X5)
        | ~ relation(X5) )
      & ( in(esk12_2(X5,X6),X6)
        | in(ordered_pair(esk12_2(X5,X6),esk13_2(X5,X6)),X5)
        | X6 = relation_dom(X5)
        | ~ relation(X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_relat_1])])])])])])]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ in(esk2_0,relation_field(esk3_0))
    | ~ in(esk1_0,relation_field(esk3_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_15,plain,
    ( relation_field(X1) = set_union2(relation_dom(X1),relation_rng(X1))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_16,plain,
    ( in(X4,X1)
    | X1 != set_union2(X2,X3)
    | ~ in(X4,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_17,negated_conjecture,
    ( in(esk2_0,X1)
    | X1 != relation_rng(esk3_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).

cnf(c_0_18,plain,
    ( in(X3,X2)
    | ~ relation(X1)
    | X2 != relation_dom(X1)
    | ~ in(ordered_pair(X3,X4),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ in(esk1_0,set_union2(relation_dom(esk3_0),relation_rng(esk3_0)))
    | ~ in(esk2_0,set_union2(relation_dom(esk3_0),relation_rng(esk3_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_12])]) ).

cnf(c_0_20,plain,
    ( in(X1,set_union2(X2,X3))
    | ~ in(X1,X3) ),
    inference(er,[status(thm)],[c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    in(esk2_0,relation_rng(esk3_0)),
    inference(er,[status(thm)],[c_0_17]) ).

cnf(c_0_22,plain,
    ( in(X4,X1)
    | X1 != set_union2(X2,X3)
    | ~ in(X4,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_23,negated_conjecture,
    ( in(esk1_0,X1)
    | X1 != relation_dom(esk3_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_11]),c_0_12])]) ).

cnf(c_0_24,negated_conjecture,
    ~ in(esk1_0,set_union2(relation_dom(esk3_0),relation_rng(esk3_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).

cnf(c_0_25,plain,
    ( in(X1,set_union2(X2,X3))
    | ~ in(X1,X2) ),
    inference(er,[status(thm)],[c_0_22]) ).

cnf(c_0_26,negated_conjecture,
    in(esk1_0,relation_dom(esk3_0)),
    inference(er,[status(thm)],[c_0_23]) ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU180+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n011.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jun 19 05:16:53 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.23/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41  # Preprocessing time       : 0.017 s
% 0.23/1.41  
% 0.23/1.41  # Proof found!
% 0.23/1.41  # SZS status Theorem
% 0.23/1.41  # SZS output start CNFRefutation
% See solution above
% 0.23/1.41  # Proof object total steps             : 28
% 0.23/1.41  # Proof object clause steps            : 17
% 0.23/1.41  # Proof object formula steps           : 11
% 0.23/1.41  # Proof object conjectures             : 13
% 0.23/1.41  # Proof object clause conjectures      : 10
% 0.23/1.41  # Proof object formula conjectures     : 3
% 0.23/1.41  # Proof object initial clauses used    : 8
% 0.23/1.41  # Proof object initial formulas used   : 5
% 0.23/1.41  # Proof object generating inferences   : 9
% 0.23/1.41  # Proof object simplifying inferences  : 10
% 0.23/1.41  # Training examples: 0 positive, 0 negative
% 0.23/1.41  # Parsed axioms                        : 36
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 19
% 0.23/1.41  # Initial clauses                      : 31
% 0.23/1.41  # Removed in clause preprocessing      : 0
% 0.23/1.41  # Initial clauses in saturation        : 31
% 0.23/1.41  # Processed clauses                    : 67
% 0.23/1.41  # ...of these trivial                  : 0
% 0.23/1.41  # ...subsumed                          : 11
% 0.23/1.41  # ...remaining for further processing  : 56
% 0.23/1.41  # Other redundant clauses eliminated   : 3
% 0.23/1.41  # Clauses deleted for lack of memory   : 0
% 0.23/1.41  # Backward-subsumed                    : 0
% 0.23/1.41  # Backward-rewritten                   : 3
% 0.23/1.41  # Generated clauses                    : 128
% 0.23/1.41  # ...of the previous two non-trivial   : 99
% 0.23/1.41  # Contextual simplify-reflections      : 1
% 0.23/1.41  # Paramodulations                      : 111
% 0.23/1.41  # Factorizations                       : 8
% 0.23/1.41  # Equation resolutions                 : 9
% 0.23/1.41  # Current number of processed clauses  : 53
% 0.23/1.41  #    Positive orientable unit clauses  : 8
% 0.23/1.41  #    Positive unorientable unit clauses: 1
% 0.23/1.41  #    Negative unit clauses             : 10
% 0.23/1.41  #    Non-unit-clauses                  : 34
% 0.23/1.41  # Current number of unprocessed clauses: 63
% 0.23/1.41  # ...number of literals in the above   : 251
% 0.23/1.41  # Current number of archived formulas  : 0
% 0.23/1.41  # Current number of archived clauses   : 3
% 0.23/1.41  # Clause-clause subsumption calls (NU) : 136
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 108
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 11
% 0.23/1.41  # Unit Clause-clause subsumption calls : 41
% 0.23/1.41  # Rewrite failures with RHS unbound    : 0
% 0.23/1.41  # BW rewrite match attempts            : 6
% 0.23/1.41  # BW rewrite match successes           : 5
% 0.23/1.41  # Condensation attempts                : 0
% 0.23/1.41  # Condensation successes               : 0
% 0.23/1.41  # Termbank termtop insertions          : 3307
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.018 s
% 0.23/1.41  # System time              : 0.003 s
% 0.23/1.41  # Total time               : 0.021 s
% 0.23/1.41  # Maximum resident set size: 3012 pages
%------------------------------------------------------------------------------