TSTP Solution File: SEU219+2 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SEU219+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n008.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:25:19 EDT 2023

% Result   : Theorem 0.35s 0.62s
% Output   : CNFRefutation 0.35s
% 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/sandbox2/tmp/tmp.B4EZN9BZ4s/E---3.1_12593.p',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/sandbox2/tmp/tmp.B4EZN9BZ4s/E---3.1_12593.p',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/sandbox2/tmp/tmp.B4EZN9BZ4s/E---3.1_12593.p',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,
    ! [X146] :
      ( ( relation_rng(X146) = relation_dom(relation_inverse(X146))
        | ~ relation(X146) )
      & ( relation_dom(X146) = relation_rng(relation_inverse(X146))
        | ~ relation(X146) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_relat_1])])]) ).

fof(c_0_5,plain,
    ! [X27] :
      ( ~ relation(X27)
      | ~ function(X27)
      | ~ one_to_one(X27)
      | function_inverse(X27) = relation_inverse(X27) ),
    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)
    | ~ relation(X1)
    | ~ function(X1)
    | ~ one_to_one(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    ( relation_rng(esk1_0) != relation_dom(function_inverse(esk1_0))
    | relation_dom(esk1_0) != relation_rng(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.06/0.13  % Problem    : SEU219+2 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.15  % Command    : run_E %s %d THM
% 0.15/0.36  % Computer : n008.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 2400
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon Oct  2 08:58:58 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.22/0.50  Running first-order theorem proving
% 0.22/0.50  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.B4EZN9BZ4s/E---3.1_12593.p
% 0.35/0.62  # Version: 3.1pre001
% 0.35/0.62  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.35/0.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.62  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.35/0.62  # Starting new_bool_3 with 300s (1) cores
% 0.35/0.62  # Starting new_bool_1 with 300s (1) cores
% 0.35/0.62  # Starting sh5l with 300s (1) cores
% 0.35/0.62  # new_bool_1 with pid 12673 completed with status 0
% 0.35/0.62  # Result found by new_bool_1
% 0.35/0.62  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.35/0.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.62  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.35/0.62  # Starting new_bool_3 with 300s (1) cores
% 0.35/0.62  # Starting new_bool_1 with 300s (1) cores
% 0.35/0.62  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.35/0.62  # Search class: FGHSM-FSLM31-SFFFFFNN
% 0.35/0.62  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.35/0.62  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 163s (1) cores
% 0.35/0.62  # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 12675 completed with status 0
% 0.35/0.62  # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.35/0.62  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.35/0.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.62  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.35/0.62  # Starting new_bool_3 with 300s (1) cores
% 0.35/0.62  # Starting new_bool_1 with 300s (1) cores
% 0.35/0.62  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.35/0.62  # Search class: FGHSM-FSLM31-SFFFFFNN
% 0.35/0.62  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.35/0.62  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 163s (1) cores
% 0.35/0.62  # Preprocessing time       : 0.005 s
% 0.35/0.62  
% 0.35/0.62  # Proof found!
% 0.35/0.62  # SZS status Theorem
% 0.35/0.62  # SZS output start CNFRefutation
% See solution above
% 0.35/0.62  # Parsed axioms                        : 231
% 0.35/0.62  # Removed by relevancy pruning/SinE    : 145
% 0.35/0.62  # Initial clauses                      : 183
% 0.35/0.62  # Removed in clause preprocessing      : 4
% 0.35/0.62  # Initial clauses in saturation        : 179
% 0.35/0.62  # Processed clauses                    : 587
% 0.35/0.62  # ...of these trivial                  : 7
% 0.35/0.62  # ...subsumed                          : 212
% 0.35/0.62  # ...remaining for further processing  : 368
% 0.35/0.62  # Other redundant clauses eliminated   : 20
% 0.35/0.62  # Clauses deleted for lack of memory   : 0
% 0.35/0.62  # Backward-subsumed                    : 10
% 0.35/0.62  # Backward-rewritten                   : 17
% 0.35/0.62  # Generated clauses                    : 2869
% 0.35/0.62  # ...of the previous two non-redundant : 2496
% 0.35/0.62  # ...aggressively subsumed             : 0
% 0.35/0.62  # Contextual simplify-reflections      : 27
% 0.35/0.62  # Paramodulations                      : 2827
% 0.35/0.62  # Factorizations                       : 2
% 0.35/0.62  # NegExts                              : 0
% 0.35/0.62  # Equation resolutions                 : 40
% 0.35/0.62  # Total rewrite steps                  : 815
% 0.35/0.62  # Propositional unsat checks           : 0
% 0.35/0.62  #    Propositional check models        : 0
% 0.35/0.62  #    Propositional check unsatisfiable : 0
% 0.35/0.62  #    Propositional clauses             : 0
% 0.35/0.62  #    Propositional clauses after purity: 0
% 0.35/0.62  #    Propositional unsat core size     : 0
% 0.35/0.62  #    Propositional preprocessing time  : 0.000
% 0.35/0.62  #    Propositional encoding time       : 0.000
% 0.35/0.62  #    Propositional solver time         : 0.000
% 0.35/0.62  #    Success case prop preproc time    : 0.000
% 0.35/0.62  #    Success case prop encoding time   : 0.000
% 0.35/0.62  #    Success case prop solver time     : 0.000
% 0.35/0.62  # Current number of processed clauses  : 338
% 0.35/0.62  #    Positive orientable unit clauses  : 32
% 0.35/0.62  #    Positive unorientable unit clauses: 0
% 0.35/0.62  #    Negative unit clauses             : 15
% 0.35/0.62  #    Non-unit-clauses                  : 291
% 0.35/0.62  # Current number of unprocessed clauses: 2033
% 0.35/0.62  # ...number of literals in the above   : 11237
% 0.35/0.62  # Current number of archived formulas  : 0
% 0.35/0.62  # Current number of archived clauses   : 27
% 0.35/0.62  # Clause-clause subsumption calls (NU) : 20962
% 0.35/0.62  # Rec. Clause-clause subsumption calls : 8531
% 0.35/0.62  # Non-unit clause-clause subsumptions  : 174
% 0.35/0.62  # Unit Clause-clause subsumption calls : 1713
% 0.35/0.62  # Rewrite failures with RHS unbound    : 0
% 0.35/0.62  # BW rewrite match attempts            : 12
% 0.35/0.62  # BW rewrite match successes           : 5
% 0.35/0.62  # Condensation attempts                : 0
% 0.35/0.62  # Condensation successes               : 0
% 0.35/0.62  # Termbank termtop insertions          : 53303
% 0.35/0.62  
% 0.35/0.62  # -------------------------------------------------
% 0.35/0.62  # User time                : 0.084 s
% 0.35/0.62  # System time              : 0.008 s
% 0.35/0.62  # Total time               : 0.092 s
% 0.35/0.62  # Maximum resident set size: 2424 pages
% 0.35/0.62  
% 0.35/0.62  # -------------------------------------------------
% 0.35/0.62  # User time                : 0.088 s
% 0.35/0.62  # System time              : 0.011 s
% 0.35/0.62  # Total time               : 0.100 s
% 0.35/0.62  # Maximum resident set size: 1912 pages
% 0.35/0.62  % E---3.1 exiting
% 0.35/0.62  % E---3.1 exiting
%------------------------------------------------------------------------------