TSTP Solution File: SEU248+2 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n019.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:31:09 EDT 2023

% Result   : Theorem 0.15s 0.49s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (   4 unt;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   43 (  19   ~;  14   |;   3   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   22 (   2 sgn;  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(l29_wellord1,conjecture,
    ! [X1,X2] :
      ( relation(X2)
     => subset(relation_dom(relation_rng_restriction(X1,X2)),relation_dom(X2)) ),
    file('/export/starexec/sandbox/tmp/tmp.3VN9t3HxY3/E---3.1_6069.p',l29_wellord1) ).

fof(t25_relat_1,lemma,
    ! [X1] :
      ( relation(X1)
     => ! [X2] :
          ( relation(X2)
         => ( subset(X1,X2)
           => ( subset(relation_dom(X1),relation_dom(X2))
              & subset(relation_rng(X1),relation_rng(X2)) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.3VN9t3HxY3/E---3.1_6069.p',t25_relat_1) ).

fof(t117_relat_1,lemma,
    ! [X1,X2] :
      ( relation(X2)
     => subset(relation_rng_restriction(X1,X2),X2) ),
    file('/export/starexec/sandbox/tmp/tmp.3VN9t3HxY3/E---3.1_6069.p',t117_relat_1) ).

fof(dt_k8_relat_1,axiom,
    ! [X1,X2] :
      ( relation(X2)
     => relation(relation_rng_restriction(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/tmp.3VN9t3HxY3/E---3.1_6069.p',dt_k8_relat_1) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1,X2] :
        ( relation(X2)
       => subset(relation_dom(relation_rng_restriction(X1,X2)),relation_dom(X2)) ),
    inference(assume_negation,[status(cth)],[l29_wellord1]) ).

fof(c_0_5,negated_conjecture,
    ( relation(esk2_0)
    & ~ subset(relation_dom(relation_rng_restriction(esk1_0,esk2_0)),relation_dom(esk2_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_6,lemma,
    ! [X36,X37] :
      ( ( subset(relation_dom(X36),relation_dom(X37))
        | ~ subset(X36,X37)
        | ~ relation(X37)
        | ~ relation(X36) )
      & ( subset(relation_rng(X36),relation_rng(X37))
        | ~ subset(X36,X37)
        | ~ relation(X37)
        | ~ relation(X36) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t25_relat_1])])])]) ).

cnf(c_0_7,negated_conjecture,
    ~ subset(relation_dom(relation_rng_restriction(esk1_0,esk2_0)),relation_dom(esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,lemma,
    ( subset(relation_dom(X1),relation_dom(X2))
    | ~ subset(X1,X2)
    | ~ relation(X2)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    relation(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_10,lemma,
    ! [X58,X59] :
      ( ~ relation(X59)
      | subset(relation_rng_restriction(X58,X59),X59) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t117_relat_1])]) ).

cnf(c_0_11,negated_conjecture,
    ( ~ subset(relation_rng_restriction(esk1_0,esk2_0),esk2_0)
    | ~ relation(relation_rng_restriction(esk1_0,esk2_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).

cnf(c_0_12,lemma,
    ( subset(relation_rng_restriction(X2,X1),X1)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_13,plain,
    ! [X49,X50] :
      ( ~ relation(X50)
      | relation(relation_rng_restriction(X49,X50)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k8_relat_1])]) ).

cnf(c_0_14,lemma,
    ~ relation(relation_rng_restriction(esk1_0,esk2_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_9])]) ).

cnf(c_0_15,plain,
    ( relation(relation_rng_restriction(X2,X1))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_16,lemma,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_9])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem    : SEU248+2 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.10  % Command    : run_E %s %d THM
% 0.10/0.30  % Computer : n019.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 2400
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Mon Oct  2 08:54:51 EDT 2023
% 0.10/0.30  % CPUTime    : 
% 0.15/0.43  Running first-order model finding
% 0.15/0.43  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.3VN9t3HxY3/E---3.1_6069.p
% 0.15/0.49  # Version: 3.1pre001
% 0.15/0.49  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.49  # Starting sh5l with 300s (1) cores
% 0.15/0.49  # new_bool_3 with pid 6147 completed with status 0
% 0.15/0.49  # Result found by new_bool_3
% 0.15/0.49  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.49  # Search class: FGHSM-FSLM31-SFFFFFNN
% 0.15/0.49  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.49  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 163s (1) cores
% 0.15/0.49  # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 6151 completed with status 0
% 0.15/0.49  # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.15/0.49  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.49  # Search class: FGHSM-FSLM31-SFFFFFNN
% 0.15/0.49  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.49  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 163s (1) cores
% 0.15/0.49  # Preprocessing time       : 0.004 s
% 0.15/0.49  
% 0.15/0.49  # Proof found!
% 0.15/0.49  # SZS status Theorem
% 0.15/0.49  # SZS output start CNFRefutation
% See solution above
% 0.15/0.49  # Parsed axioms                        : 306
% 0.15/0.49  # Removed by relevancy pruning/SinE    : 201
% 0.15/0.49  # Initial clauses                      : 200
% 0.15/0.49  # Removed in clause preprocessing      : 2
% 0.15/0.49  # Initial clauses in saturation        : 198
% 0.15/0.49  # Processed clauses                    : 224
% 0.15/0.49  # ...of these trivial                  : 5
% 0.15/0.49  # ...subsumed                          : 17
% 0.15/0.49  # ...remaining for further processing  : 202
% 0.15/0.49  # Other redundant clauses eliminated   : 17
% 0.15/0.49  # Clauses deleted for lack of memory   : 0
% 0.15/0.49  # Backward-subsumed                    : 1
% 0.15/0.49  # Backward-rewritten                   : 6
% 0.15/0.49  # Generated clauses                    : 1068
% 0.15/0.49  # ...of the previous two non-redundant : 951
% 0.15/0.49  # ...aggressively subsumed             : 0
% 0.15/0.49  # Contextual simplify-reflections      : 0
% 0.15/0.49  # Paramodulations                      : 1028
% 0.15/0.49  # Factorizations                       : 8
% 0.15/0.49  # NegExts                              : 0
% 0.15/0.49  # Equation resolutions                 : 32
% 0.15/0.49  # Total rewrite steps                  : 129
% 0.15/0.49  # Propositional unsat checks           : 0
% 0.15/0.49  #    Propositional check models        : 0
% 0.15/0.49  #    Propositional check unsatisfiable : 0
% 0.15/0.49  #    Propositional clauses             : 0
% 0.15/0.49  #    Propositional clauses after purity: 0
% 0.15/0.49  #    Propositional unsat core size     : 0
% 0.15/0.49  #    Propositional preprocessing time  : 0.000
% 0.15/0.49  #    Propositional encoding time       : 0.000
% 0.15/0.49  #    Propositional solver time         : 0.000
% 0.15/0.49  #    Success case prop preproc time    : 0.000
% 0.15/0.49  #    Success case prop encoding time   : 0.000
% 0.15/0.49  #    Success case prop solver time     : 0.000
% 0.15/0.49  # Current number of processed clauses  : 193
% 0.15/0.49  #    Positive orientable unit clauses  : 32
% 0.15/0.49  #    Positive unorientable unit clauses: 1
% 0.15/0.49  #    Negative unit clauses             : 8
% 0.15/0.49  #    Non-unit-clauses                  : 152
% 0.15/0.49  # Current number of unprocessed clauses: 922
% 0.15/0.49  # ...number of literals in the above   : 4110
% 0.15/0.49  # Current number of archived formulas  : 0
% 0.15/0.49  # Current number of archived clauses   : 7
% 0.15/0.49  # Clause-clause subsumption calls (NU) : 6898
% 0.15/0.49  # Rec. Clause-clause subsumption calls : 1921
% 0.15/0.49  # Non-unit clause-clause subsumptions  : 16
% 0.15/0.49  # Unit Clause-clause subsumption calls : 1020
% 0.15/0.49  # Rewrite failures with RHS unbound    : 0
% 0.15/0.49  # BW rewrite match attempts            : 8
% 0.15/0.49  # BW rewrite match successes           : 6
% 0.15/0.49  # Condensation attempts                : 0
% 0.15/0.49  # Condensation successes               : 0
% 0.15/0.49  # Termbank termtop insertions          : 29477
% 0.15/0.49  
% 0.15/0.49  # -------------------------------------------------
% 0.15/0.49  # User time                : 0.041 s
% 0.15/0.49  # System time              : 0.007 s
% 0.15/0.49  # Total time               : 0.049 s
% 0.15/0.49  # Maximum resident set size: 2588 pages
% 0.15/0.49  
% 0.15/0.49  # -------------------------------------------------
% 0.15/0.49  # User time                : 0.049 s
% 0.15/0.49  # System time              : 0.009 s
% 0.15/0.49  # Total time               : 0.057 s
% 0.15/0.49  # Maximum resident set size: 2008 pages
% 0.15/0.49  % E---3.1 exiting
%------------------------------------------------------------------------------