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

View Problem - Process Solution

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

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

% Result   : Theorem 0.15s 0.45s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   7 unt;   0 def)
%            Number of atoms       :   42 (  32 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   37 (  13   ~;  14   |;   4   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :    6 (   0 sgn;   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t65_relat_1,conjecture,
    ! [X1] :
      ( relation(X1)
     => ( relation_dom(X1) = empty_set
      <=> relation_rng(X1) = empty_set ) ),
    file('/export/starexec/sandbox/tmp/tmp.ausxzmYfhG/E---3.1_14649.p',t65_relat_1) ).

fof(t64_relat_1,lemma,
    ! [X1] :
      ( relation(X1)
     => ( ( relation_dom(X1) = empty_set
          | relation_rng(X1) = empty_set )
       => X1 = empty_set ) ),
    file('/export/starexec/sandbox/tmp/tmp.ausxzmYfhG/E---3.1_14649.p',t64_relat_1) ).

fof(t60_relat_1,lemma,
    ( relation_dom(empty_set) = empty_set
    & relation_rng(empty_set) = empty_set ),
    file('/export/starexec/sandbox/tmp/tmp.ausxzmYfhG/E---3.1_14649.p',t60_relat_1) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1] :
        ( relation(X1)
       => ( relation_dom(X1) = empty_set
        <=> relation_rng(X1) = empty_set ) ),
    inference(assume_negation,[status(cth)],[t65_relat_1]) ).

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

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

cnf(c_0_6,lemma,
    ( X1 = empty_set
    | relation_rng(X1) != empty_set
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ( relation_dom(esk1_0) = empty_set
    | relation_rng(esk1_0) = empty_set ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    relation(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,lemma,
    ( X1 = empty_set
    | relation_dom(X1) != empty_set
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_10,negated_conjecture,
    ( relation_dom(esk1_0) = empty_set
    | empty_set = esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).

cnf(c_0_11,lemma,
    relation_dom(empty_set) = empty_set,
    inference(split_conjunct,[status(thm)],[t60_relat_1]) ).

cnf(c_0_12,lemma,
    empty_set = esk1_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8])]) ).

cnf(c_0_13,lemma,
    relation_rng(empty_set) = empty_set,
    inference(split_conjunct,[status(thm)],[t60_relat_1]) ).

cnf(c_0_14,negated_conjecture,
    ( relation_dom(esk1_0) != empty_set
    | relation_rng(esk1_0) != empty_set ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_15,lemma,
    relation_dom(esk1_0) = esk1_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).

cnf(c_0_16,lemma,
    relation_rng(esk1_0) = esk1_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_12]),c_0_12]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : SEU189+2 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n023.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 2400
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Mon Oct  2 08:57:07 EDT 2023
% 0.15/0.31  % CPUTime    : 
% 0.15/0.42  Running first-order theorem proving
% 0.15/0.42  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.ausxzmYfhG/E---3.1_14649.p
% 0.15/0.45  # Version: 3.1pre001
% 0.15/0.45  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45  # Starting sh5l with 300s (1) cores
% 0.15/0.45  # new_bool_3 with pid 14728 completed with status 0
% 0.15/0.45  # Result found by new_bool_3
% 0.15/0.45  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45  # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.15/0.45  # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45  # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.15/0.45  # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 14732 completed with status 0
% 0.15/0.45  # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.45  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45  # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.15/0.45  # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45  # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.15/0.45  # Preprocessing time       : 0.002 s
% 0.15/0.45  # Presaturation interreduction done
% 0.15/0.45  
% 0.15/0.45  # Proof found!
% 0.15/0.45  # SZS status Theorem
% 0.15/0.45  # SZS output start CNFRefutation
% See solution above
% 0.15/0.45  # Parsed axioms                        : 171
% 0.15/0.45  # Removed by relevancy pruning/SinE    : 90
% 0.15/0.45  # Initial clauses                      : 139
% 0.15/0.45  # Removed in clause preprocessing      : 0
% 0.15/0.45  # Initial clauses in saturation        : 139
% 0.15/0.45  # Processed clauses                    : 188
% 0.15/0.45  # ...of these trivial                  : 1
% 0.15/0.45  # ...subsumed                          : 12
% 0.15/0.45  # ...remaining for further processing  : 174
% 0.15/0.45  # Other redundant clauses eliminated   : 22
% 0.15/0.45  # Clauses deleted for lack of memory   : 0
% 0.15/0.45  # Backward-subsumed                    : 0
% 0.15/0.45  # Backward-rewritten                   : 13
% 0.15/0.45  # Generated clauses                    : 25
% 0.15/0.45  # ...of the previous two non-redundant : 29
% 0.15/0.45  # ...aggressively subsumed             : 0
% 0.15/0.45  # Contextual simplify-reflections      : 0
% 0.15/0.45  # Paramodulations                      : 4
% 0.15/0.45  # Factorizations                       : 0
% 0.15/0.45  # NegExts                              : 0
% 0.15/0.45  # Equation resolutions                 : 22
% 0.15/0.45  # Total rewrite steps                  : 36
% 0.15/0.45  # Propositional unsat checks           : 0
% 0.15/0.45  #    Propositional check models        : 0
% 0.15/0.45  #    Propositional check unsatisfiable : 0
% 0.15/0.45  #    Propositional clauses             : 0
% 0.15/0.45  #    Propositional clauses after purity: 0
% 0.15/0.45  #    Propositional unsat core size     : 0
% 0.15/0.45  #    Propositional preprocessing time  : 0.000
% 0.15/0.45  #    Propositional encoding time       : 0.000
% 0.15/0.45  #    Propositional solver time         : 0.000
% 0.15/0.45  #    Success case prop preproc time    : 0.000
% 0.15/0.45  #    Success case prop encoding time   : 0.000
% 0.15/0.45  #    Success case prop solver time     : 0.000
% 0.15/0.45  # Current number of processed clauses  : 19
% 0.15/0.45  #    Positive orientable unit clauses  : 10
% 0.15/0.45  #    Positive unorientable unit clauses: 0
% 0.15/0.45  #    Negative unit clauses             : 7
% 0.15/0.45  #    Non-unit-clauses                  : 2
% 0.15/0.45  # Current number of unprocessed clauses: 101
% 0.15/0.45  # ...number of literals in the above   : 238
% 0.15/0.45  # Current number of archived formulas  : 0
% 0.15/0.45  # Current number of archived clauses   : 134
% 0.15/0.45  # Clause-clause subsumption calls (NU) : 885
% 0.15/0.45  # Rec. Clause-clause subsumption calls : 645
% 0.15/0.45  # Non-unit clause-clause subsumptions  : 11
% 0.15/0.45  # Unit Clause-clause subsumption calls : 31
% 0.15/0.45  # Rewrite failures with RHS unbound    : 0
% 0.15/0.45  # BW rewrite match attempts            : 13
% 0.15/0.45  # BW rewrite match successes           : 9
% 0.15/0.45  # Condensation attempts                : 0
% 0.15/0.45  # Condensation successes               : 0
% 0.15/0.45  # Termbank termtop insertions          : 8483
% 0.15/0.45  
% 0.15/0.45  # -------------------------------------------------
% 0.15/0.45  # User time                : 0.015 s
% 0.15/0.45  # System time              : 0.001 s
% 0.15/0.45  # Total time               : 0.016 s
% 0.15/0.45  # Maximum resident set size: 2204 pages
% 0.15/0.45  
% 0.15/0.45  # -------------------------------------------------
% 0.15/0.45  # User time                : 0.018 s
% 0.15/0.45  # System time              : 0.004 s
% 0.15/0.45  # Total time               : 0.022 s
% 0.15/0.45  # Maximum resident set size: 1840 pages
% 0.15/0.45  % E---3.1 exiting
% 0.15/0.45  % E---3.1 exiting
%------------------------------------------------------------------------------