TSTP Solution File: SEU219+2 by ET---2.0

View Problem - Process Solution

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

% Computer : n027.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:57 EDT 2022

% Result   : Theorem 0.25s 1.41s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   5 unt;   0 def)
%            Number of atoms       :   53 (  20 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   57 (  22   ~;  18   |;  10   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :   11 (   0 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t55_funct_1,conjecture,
    ! [X1] :
      ( ( relation(X1)
        & function(X1) )
     => ( one_to_one(X1)
       => ( relation_rng(X1) = relation_dom(function_inverse(X1))
          & relation_dom(X1) = relation_rng(function_inverse(X1)) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t55_funct_1) ).

fof(t37_relat_1,lemma,
    ! [X1] :
      ( relation(X1)
     => ( relation_rng(X1) = relation_dom(relation_inverse(X1))
        & relation_dom(X1) = relation_rng(relation_inverse(X1)) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t37_relat_1) ).

fof(d9_funct_1,axiom,
    ! [X1] :
      ( ( relation(X1)
        & function(X1) )
     => ( one_to_one(X1)
       => function_inverse(X1) = relation_inverse(X1) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d9_funct_1) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1] :
        ( ( relation(X1)
          & function(X1) )
       => ( one_to_one(X1)
         => ( relation_rng(X1) = relation_dom(function_inverse(X1))
            & relation_dom(X1) = relation_rng(function_inverse(X1)) ) ) ),
    inference(assume_negation,[status(cth)],[t55_funct_1]) ).

fof(c_0_4,lemma,
    ! [X2] :
      ( ( relation_rng(X2) = relation_dom(relation_inverse(X2))
        | ~ relation(X2) )
      & ( relation_dom(X2) = relation_rng(relation_inverse(X2))
        | ~ relation(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_relat_1])])]) ).

fof(c_0_5,plain,
    ! [X2] :
      ( ~ relation(X2)
      | ~ function(X2)
      | ~ one_to_one(X2)
      | function_inverse(X2) = relation_inverse(X2) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_funct_1])]) ).

fof(c_0_6,negated_conjecture,
    ( relation(esk1_0)
    & function(esk1_0)
    & one_to_one(esk1_0)
    & ( relation_rng(esk1_0) != relation_dom(function_inverse(esk1_0))
      | relation_dom(esk1_0) != relation_rng(function_inverse(esk1_0)) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

cnf(c_0_7,lemma,
    ( relation_dom(X1) = relation_rng(relation_inverse(X1))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    ( function_inverse(X1) = relation_inverse(X1)
    | ~ one_to_one(X1)
    | ~ function(X1)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    ( relation_dom(esk1_0) != relation_rng(function_inverse(esk1_0))
    | relation_rng(esk1_0) != relation_dom(function_inverse(esk1_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,lemma,
    ( relation_rng(function_inverse(X1)) = relation_dom(X1)
    | ~ one_to_one(X1)
    | ~ relation(X1)
    | ~ function(X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    one_to_one(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,negated_conjecture,
    relation(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_13,negated_conjecture,
    function(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_14,lemma,
    ( relation_rng(X1) = relation_dom(relation_inverse(X1))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_15,negated_conjecture,
    relation_dom(function_inverse(esk1_0)) != relation_rng(esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),c_0_13])]) ).

cnf(c_0_16,lemma,
    ( relation_dom(function_inverse(X1)) = relation_rng(X1)
    | ~ one_to_one(X1)
    | ~ relation(X1)
    | ~ function(X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU219+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n027.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 20:22:24 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.25/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.41  # Preprocessing time       : 0.029 s
% 0.25/1.41  
% 0.25/1.41  # Proof found!
% 0.25/1.41  # SZS status Theorem
% 0.25/1.41  # SZS output start CNFRefutation
% See solution above
% 0.25/1.41  # Proof object total steps             : 18
% 0.25/1.41  # Proof object clause steps            : 11
% 0.25/1.41  # Proof object formula steps           : 7
% 0.25/1.41  # Proof object conjectures             : 9
% 0.25/1.41  # Proof object clause conjectures      : 6
% 0.25/1.41  # Proof object formula conjectures     : 3
% 0.25/1.41  # Proof object initial clauses used    : 7
% 0.25/1.41  # Proof object initial formulas used   : 3
% 0.25/1.41  # Proof object generating inferences   : 4
% 0.25/1.41  # Proof object simplifying inferences  : 8
% 0.25/1.41  # Training examples: 0 positive, 0 negative
% 0.25/1.41  # Parsed axioms                        : 231
% 0.25/1.41  # Removed by relevancy pruning/SinE    : 138
% 0.25/1.41  # Initial clauses                      : 197
% 0.25/1.41  # Removed in clause preprocessing      : 4
% 0.25/1.41  # Initial clauses in saturation        : 193
% 0.25/1.41  # Processed clauses                    : 395
% 0.25/1.41  # ...of these trivial                  : 4
% 0.25/1.41  # ...subsumed                          : 86
% 0.25/1.41  # ...remaining for further processing  : 305
% 0.25/1.41  # Other redundant clauses eliminated   : 8
% 0.25/1.41  # Clauses deleted for lack of memory   : 0
% 0.25/1.41  # Backward-subsumed                    : 1
% 0.25/1.41  # Backward-rewritten                   : 34
% 0.25/1.41  # Generated clauses                    : 1848
% 0.25/1.41  # ...of the previous two non-trivial   : 1588
% 0.25/1.41  # Contextual simplify-reflections      : 51
% 0.25/1.41  # Paramodulations                      : 1829
% 0.25/1.41  # Factorizations                       : 2
% 0.25/1.41  # Equation resolutions                 : 17
% 0.25/1.41  # Current number of processed clauses  : 267
% 0.25/1.41  #    Positive orientable unit clauses  : 34
% 0.25/1.41  #    Positive unorientable unit clauses: 0
% 0.25/1.41  #    Negative unit clauses             : 15
% 0.25/1.41  #    Non-unit-clauses                  : 218
% 0.25/1.41  # Current number of unprocessed clauses: 1218
% 0.25/1.41  # ...number of literals in the above   : 6762
% 0.25/1.41  # Current number of archived formulas  : 0
% 0.25/1.41  # Current number of archived clauses   : 35
% 0.25/1.41  # Clause-clause subsumption calls (NU) : 13801
% 0.25/1.41  # Rec. Clause-clause subsumption calls : 4687
% 0.25/1.41  # Non-unit clause-clause subsumptions  : 120
% 0.25/1.41  # Unit Clause-clause subsumption calls : 2142
% 0.25/1.41  # Rewrite failures with RHS unbound    : 0
% 0.25/1.41  # BW rewrite match attempts            : 11
% 0.25/1.41  # BW rewrite match successes           : 8
% 0.25/1.41  # Condensation attempts                : 0
% 0.25/1.41  # Condensation successes               : 0
% 0.25/1.41  # Termbank termtop insertions          : 40928
% 0.25/1.41  
% 0.25/1.41  # -------------------------------------------------
% 0.25/1.41  # User time                : 0.089 s
% 0.25/1.41  # System time              : 0.003 s
% 0.25/1.41  # Total time               : 0.092 s
% 0.25/1.41  # Maximum resident set size: 5404 pages
%------------------------------------------------------------------------------