TSTP Solution File: SEU247+2 by E---3.1.00

View Problem - Process Solution

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

% Computer : n022.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  : 300s
% DateTime : Sat May  4 09:25:51 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(t18_wellord1,conjecture,
    ! [X1,X2] :
      ( relation(X2)
     => relation_restriction(X2,X1) = relation_rng_restriction(X1,relation_dom_restriction(X2,X1)) ),
    file('/export/starexec/sandbox2/tmp/tmp.4v6qW8iWxc/E---3.1_23637.p',t18_wellord1) ).

fof(t140_relat_1,lemma,
    ! [X1,X2,X3] :
      ( relation(X3)
     => relation_dom_restriction(relation_rng_restriction(X1,X3),X2) = relation_rng_restriction(X1,relation_dom_restriction(X3,X2)) ),
    file('/export/starexec/sandbox2/tmp/tmp.4v6qW8iWxc/E---3.1_23637.p',t140_relat_1) ).

fof(t17_wellord1,lemma,
    ! [X1,X2] :
      ( relation(X2)
     => relation_restriction(X2,X1) = relation_dom_restriction(relation_rng_restriction(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.4v6qW8iWxc/E---3.1_23637.p',t17_wellord1) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2] :
        ( relation(X2)
       => relation_restriction(X2,X1) = relation_rng_restriction(X1,relation_dom_restriction(X2,X1)) ),
    inference(assume_negation,[status(cth)],[t18_wellord1]) ).

fof(c_0_4,lemma,
    ! [X33,X34,X35] :
      ( ~ relation(X35)
      | relation_dom_restriction(relation_rng_restriction(X33,X35),X34) = relation_rng_restriction(X33,relation_dom_restriction(X35,X34)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t140_relat_1])])]) ).

fof(c_0_5,negated_conjecture,
    ( relation(esk2_0)
    & relation_restriction(esk2_0,esk1_0) != relation_rng_restriction(esk1_0,relation_dom_restriction(esk2_0,esk1_0)) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).

fof(c_0_6,lemma,
    ! [X79,X80] :
      ( ~ relation(X80)
      | relation_restriction(X80,X79) = relation_dom_restriction(relation_rng_restriction(X79,X80),X79) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t17_wellord1])])]) ).

cnf(c_0_7,lemma,
    ( relation_dom_restriction(relation_rng_restriction(X2,X1),X3) = relation_rng_restriction(X2,relation_dom_restriction(X1,X3))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

cnf(c_0_9,lemma,
    ( relation_restriction(X1,X2) = relation_dom_restriction(relation_rng_restriction(X2,X1),X2)
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    relation_restriction(esk2_0,esk1_0) != relation_rng_restriction(esk1_0,relation_dom_restriction(esk2_0,esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,negated_conjecture,
    relation_rng_restriction(X1,relation_dom_restriction(esk2_0,X2)) = relation_dom_restriction(relation_rng_restriction(X1,esk2_0),X2),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    relation_dom_restriction(relation_rng_restriction(X1,esk2_0),X1) = relation_restriction(esk2_0,X1),
    inference(spm,[status(thm)],[c_0_9,c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15  % Problem    : SEU247+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.16  % Command    : run_E %s %d THM
% 0.16/0.37  % Computer : n022.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 300
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Fri May  3 07:51:57 EDT 2024
% 0.16/0.37  % CPUTime    : 
% 0.23/0.54  Running first-order theorem proving
% 0.23/0.54  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.4v6qW8iWxc/E---3.1_23637.p
% 0.66/0.62  # Version: 3.1.0
% 0.66/0.62  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.62  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.62  # Starting new_bool_3 with 300s (1) cores
% 0.66/0.62  # Starting new_bool_1 with 300s (1) cores
% 0.66/0.62  # Starting sh5l with 300s (1) cores
% 0.66/0.62  # new_bool_3 with pid 23782 completed with status 0
% 0.66/0.62  # Result found by new_bool_3
% 0.66/0.62  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.62  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.62  # Starting new_bool_3 with 300s (1) cores
% 0.66/0.62  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.66/0.62  # Search class: FGHSM-FSLM32-SFFFFFNN
% 0.66/0.62  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.66/0.62  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 127s (1) cores
% 0.66/0.62  # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 23795 completed with status 0
% 0.66/0.62  # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 0.66/0.62  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.62  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.62  # Starting new_bool_3 with 300s (1) cores
% 0.66/0.62  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.66/0.62  # Search class: FGHSM-FSLM32-SFFFFFNN
% 0.66/0.62  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.66/0.62  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 127s (1) cores
% 0.66/0.62  # Preprocessing time       : 0.004 s
% 0.66/0.62  
% 0.66/0.62  # Proof found!
% 0.66/0.62  # SZS status Theorem
% 0.66/0.62  # SZS output start CNFRefutation
% See solution above
% 0.66/0.62  # Parsed axioms                        : 305
% 0.66/0.62  # Removed by relevancy pruning/SinE    : 184
% 0.66/0.62  # Initial clauses                      : 243
% 0.66/0.62  # Removed in clause preprocessing      : 4
% 0.66/0.62  # Initial clauses in saturation        : 239
% 0.66/0.62  # Processed clauses                    : 318
% 0.66/0.62  # ...of these trivial                  : 11
% 0.66/0.62  # ...subsumed                          : 20
% 0.66/0.62  # ...remaining for further processing  : 287
% 0.66/0.62  # Other redundant clauses eliminated   : 38
% 0.66/0.62  # Clauses deleted for lack of memory   : 0
% 0.66/0.62  # Backward-subsumed                    : 0
% 0.66/0.62  # Backward-rewritten                   : 18
% 0.66/0.62  # Generated clauses                    : 1848
% 0.66/0.62  # ...of the previous two non-redundant : 1758
% 0.66/0.62  # ...aggressively subsumed             : 0
% 0.66/0.62  # Contextual simplify-reflections      : 3
% 0.66/0.62  # Paramodulations                      : 1802
% 0.66/0.62  # Factorizations                       : 8
% 0.66/0.62  # NegExts                              : 0
% 0.66/0.62  # Equation resolutions                 : 40
% 0.66/0.62  # Disequality decompositions           : 0
% 0.66/0.62  # Total rewrite steps                  : 246
% 0.66/0.62  # ...of those cached                   : 186
% 0.66/0.62  # Propositional unsat checks           : 0
% 0.66/0.62  #    Propositional check models        : 0
% 0.66/0.62  #    Propositional check unsatisfiable : 0
% 0.66/0.62  #    Propositional clauses             : 0
% 0.66/0.62  #    Propositional clauses after purity: 0
% 0.66/0.62  #    Propositional unsat core size     : 0
% 0.66/0.62  #    Propositional preprocessing time  : 0.000
% 0.66/0.62  #    Propositional encoding time       : 0.000
% 0.66/0.62  #    Propositional solver time         : 0.000
% 0.66/0.62  #    Success case prop preproc time    : 0.000
% 0.66/0.62  #    Success case prop encoding time   : 0.000
% 0.66/0.62  #    Success case prop solver time     : 0.000
% 0.66/0.62  # Current number of processed clauses  : 234
% 0.66/0.62  #    Positive orientable unit clauses  : 55
% 0.66/0.62  #    Positive unorientable unit clauses: 1
% 0.66/0.62  #    Negative unit clauses             : 5
% 0.66/0.62  #    Non-unit-clauses                  : 173
% 0.66/0.62  # Current number of unprocessed clauses: 1654
% 0.66/0.62  # ...number of literals in the above   : 6214
% 0.66/0.62  # Current number of archived formulas  : 0
% 0.66/0.62  # Current number of archived clauses   : 18
% 0.66/0.62  # Clause-clause subsumption calls (NU) : 6619
% 0.66/0.62  # Rec. Clause-clause subsumption calls : 2058
% 0.66/0.62  # Non-unit clause-clause subsumptions  : 22
% 0.66/0.62  # Unit Clause-clause subsumption calls : 1213
% 0.66/0.62  # Rewrite failures with RHS unbound    : 0
% 0.66/0.62  # BW rewrite match attempts            : 34
% 0.66/0.62  # BW rewrite match successes           : 20
% 0.66/0.62  # Condensation attempts                : 0
% 0.66/0.62  # Condensation successes               : 0
% 0.66/0.62  # Termbank termtop insertions          : 46052
% 0.66/0.62  # Search garbage collected termcells   : 5359
% 0.66/0.62  
% 0.66/0.62  # -------------------------------------------------
% 0.66/0.62  # User time                : 0.058 s
% 0.66/0.62  # System time              : 0.003 s
% 0.66/0.62  # Total time               : 0.061 s
% 0.66/0.62  # Maximum resident set size: 2696 pages
% 0.66/0.62  
% 0.66/0.62  # -------------------------------------------------
% 0.66/0.62  # User time                : 0.066 s
% 0.66/0.62  # System time              : 0.006 s
% 0.66/0.62  # Total time               : 0.071 s
% 0.66/0.62  # Maximum resident set size: 2024 pages
% 0.66/0.62  % E---3.1 exiting
% 0.66/0.62  % E exiting
%------------------------------------------------------------------------------