TSTP Solution File: SEU200+1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SEU200+1 : 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:30:52 EDT 2023

% Result   : Theorem 0.15s 0.42s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (   6 unt;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   39 (  16   ~;  13   |;   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   :   25 (   5 sgn;  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t118_relat_1,conjecture,
    ! [X1,X2] :
      ( relation(X2)
     => subset(relation_rng(relation_rng_restriction(X1,X2)),relation_rng(X2)) ),
    file('/export/starexec/sandbox/tmp/tmp.meAi9HUyHl/E---3.1_1981.p',t118_relat_1) ).

fof(t117_relat_1,axiom,
    ! [X1,X2] :
      ( relation(X2)
     => subset(relation_rng_restriction(X1,X2),X2) ),
    file('/export/starexec/sandbox/tmp/tmp.meAi9HUyHl/E---3.1_1981.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.meAi9HUyHl/E---3.1_1981.p',dt_k8_relat_1) ).

fof(t25_relat_1,axiom,
    ! [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.meAi9HUyHl/E---3.1_1981.p',t25_relat_1) ).

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

fof(c_0_5,plain,
    ! [X7,X8] :
      ( ~ relation(X8)
      | subset(relation_rng_restriction(X7,X8),X8) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t117_relat_1])]) ).

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

fof(c_0_7,plain,
    ! [X15,X16] :
      ( ~ relation(X16)
      | relation(relation_rng_restriction(X15,X16)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k8_relat_1])]) ).

fof(c_0_8,plain,
    ! [X9,X10] :
      ( ( subset(relation_dom(X9),relation_dom(X10))
        | ~ subset(X9,X10)
        | ~ relation(X10)
        | ~ relation(X9) )
      & ( subset(relation_rng(X9),relation_rng(X10))
        | ~ subset(X9,X10)
        | ~ relation(X10)
        | ~ relation(X9) ) ),
    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_9,plain,
    ( subset(relation_rng_restriction(X2,X1),X1)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    relation(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

cnf(c_0_12,plain,
    ( subset(relation_rng(X1),relation_rng(X2))
    | ~ subset(X1,X2)
    | ~ relation(X2)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    subset(relation_rng_restriction(X1,esk2_0),esk2_0),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    relation(relation_rng_restriction(X1,esk2_0)),
    inference(spm,[status(thm)],[c_0_11,c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    ~ subset(relation_rng(relation_rng_restriction(esk1_0,esk2_0)),relation_rng(esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_16,negated_conjecture,
    subset(relation_rng(relation_rng_restriction(X1,esk2_0)),relation_rng(esk2_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10]),c_0_14])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : SEU200+1 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.10  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n019.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 09:33:06 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.15/0.41  Running first-order model finding
% 0.15/0.41  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.meAi9HUyHl/E---3.1_1981.p
% 0.15/0.42  # Version: 3.1pre001
% 0.15/0.42  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42  # Starting sh5l with 300s (1) cores
% 0.15/0.42  # sh5l with pid 2067 completed with status 0
% 0.15/0.42  # Result found by sh5l
% 0.15/0.42  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42  # Starting sh5l with 300s (1) cores
% 0.15/0.42  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.42  # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.15/0.42  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.15/0.42  # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 2074 completed with status 0
% 0.15/0.42  # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.15/0.42  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42  # Starting sh5l with 300s (1) cores
% 0.15/0.42  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.42  # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.15/0.42  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.15/0.42  # Preprocessing time       : 0.001 s
% 0.15/0.42  
% 0.15/0.42  # Proof found!
% 0.15/0.42  # SZS status Theorem
% 0.15/0.42  # SZS output start CNFRefutation
% See solution above
% 0.15/0.42  # Parsed axioms                        : 34
% 0.15/0.42  # Removed by relevancy pruning/SinE    : 5
% 0.15/0.42  # Initial clauses                      : 39
% 0.15/0.42  # Removed in clause preprocessing      : 0
% 0.15/0.42  # Initial clauses in saturation        : 39
% 0.15/0.42  # Processed clauses                    : 58
% 0.15/0.42  # ...of these trivial                  : 1
% 0.15/0.42  # ...subsumed                          : 3
% 0.15/0.42  # ...remaining for further processing  : 54
% 0.15/0.42  # Other redundant clauses eliminated   : 0
% 0.15/0.42  # Clauses deleted for lack of memory   : 0
% 0.15/0.42  # Backward-subsumed                    : 0
% 0.15/0.42  # Backward-rewritten                   : 9
% 0.15/0.42  # Generated clauses                    : 82
% 0.15/0.42  # ...of the previous two non-redundant : 70
% 0.15/0.42  # ...aggressively subsumed             : 0
% 0.15/0.42  # Contextual simplify-reflections      : 0
% 0.15/0.42  # Paramodulations                      : 82
% 0.15/0.42  # Factorizations                       : 0
% 0.15/0.42  # NegExts                              : 0
% 0.15/0.42  # Equation resolutions                 : 0
% 0.15/0.42  # Total rewrite steps                  : 33
% 0.15/0.42  # Propositional unsat checks           : 0
% 0.15/0.42  #    Propositional check models        : 0
% 0.15/0.42  #    Propositional check unsatisfiable : 0
% 0.15/0.42  #    Propositional clauses             : 0
% 0.15/0.42  #    Propositional clauses after purity: 0
% 0.15/0.42  #    Propositional unsat core size     : 0
% 0.15/0.42  #    Propositional preprocessing time  : 0.000
% 0.15/0.42  #    Propositional encoding time       : 0.000
% 0.15/0.42  #    Propositional solver time         : 0.000
% 0.15/0.42  #    Success case prop preproc time    : 0.000
% 0.15/0.42  #    Success case prop encoding time   : 0.000
% 0.15/0.42  #    Success case prop solver time     : 0.000
% 0.15/0.42  # Current number of processed clauses  : 45
% 0.15/0.42  #    Positive orientable unit clauses  : 16
% 0.15/0.42  #    Positive unorientable unit clauses: 0
% 0.15/0.42  #    Negative unit clauses             : 3
% 0.15/0.42  #    Non-unit-clauses                  : 26
% 0.15/0.42  # Current number of unprocessed clauses: 41
% 0.15/0.42  # ...number of literals in the above   : 49
% 0.15/0.42  # Current number of archived formulas  : 0
% 0.15/0.42  # Current number of archived clauses   : 9
% 0.15/0.42  # Clause-clause subsumption calls (NU) : 46
% 0.15/0.42  # Rec. Clause-clause subsumption calls : 41
% 0.15/0.42  # Non-unit clause-clause subsumptions  : 2
% 0.15/0.42  # Unit Clause-clause subsumption calls : 22
% 0.15/0.42  # Rewrite failures with RHS unbound    : 0
% 0.15/0.42  # BW rewrite match attempts            : 6
% 0.15/0.42  # BW rewrite match successes           : 5
% 0.15/0.42  # Condensation attempts                : 0
% 0.15/0.42  # Condensation successes               : 0
% 0.15/0.42  # Termbank termtop insertions          : 2422
% 0.15/0.42  
% 0.15/0.42  # -------------------------------------------------
% 0.15/0.42  # User time                : 0.006 s
% 0.15/0.42  # System time              : 0.001 s
% 0.15/0.42  # Total time               : 0.007 s
% 0.15/0.42  # Maximum resident set size: 1872 pages
% 0.15/0.42  
% 0.15/0.42  # -------------------------------------------------
% 0.15/0.42  # User time                : 0.006 s
% 0.15/0.42  # System time              : 0.004 s
% 0.15/0.42  # Total time               : 0.010 s
% 0.15/0.42  # Maximum resident set size: 1696 pages
% 0.15/0.42  % E---3.1 exiting
%------------------------------------------------------------------------------