TSTP Solution File: SEU217+3 by E---3.1

View Problem - Process Solution

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

% Computer : n012.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:18 EDT 2023

% Result   : Timeout 0.27s 300.13s
% Output   : None 
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (   7 unt;   0 def)
%            Number of atoms       :   49 (  19 equ)
%            Maximal formula atoms :   19 (   3 avg)
%            Number of connectives :   55 (  22   ~;  20   |;   8   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   21 (   2 sgn;  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t34_funct_1,axiom,
    ! [X1,X2] :
      ( ( relation(X2)
        & function(X2) )
     => ( X2 = identity_relation(X1)
      <=> ( relation_dom(X2) = X1
          & ! [X3] :
              ( in(X3,X1)
             => apply(X2,X3) = X3 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.6gtBIs2iN1/E---3.1_7974.p',t34_funct_1) ).

fof(fc2_funct_1,axiom,
    ! [X1] :
      ( relation(identity_relation(X1))
      & function(identity_relation(X1)) ),
    file('/export/starexec/sandbox2/tmp/tmp.6gtBIs2iN1/E---3.1_7974.p',fc2_funct_1) ).

fof(dt_k6_relat_1,axiom,
    ! [X1] : relation(identity_relation(X1)),
    file('/export/starexec/sandbox2/tmp/tmp.6gtBIs2iN1/E---3.1_7974.p',dt_k6_relat_1) ).

fof(t35_funct_1,conjecture,
    ! [X1,X2] :
      ( in(X2,X1)
     => apply(identity_relation(X1),X2) = X2 ),
    file('/export/starexec/sandbox2/tmp/tmp.6gtBIs2iN1/E---3.1_7974.p',t35_funct_1) ).

fof(c_0_4,plain,
    ! [X6,X7,X8] :
      ( ( relation_dom(X7) = X6
        | X7 != identity_relation(X6)
        | ~ relation(X7)
        | ~ function(X7) )
      & ( ~ in(X8,X6)
        | apply(X7,X8) = X8
        | X7 != identity_relation(X6)
        | ~ relation(X7)
        | ~ function(X7) )
      & ( in(esk3_2(X6,X7),X6)
        | relation_dom(X7) != X6
        | X7 = identity_relation(X6)
        | ~ relation(X7)
        | ~ function(X7) )
      & ( apply(X7,esk3_2(X6,X7)) != esk3_2(X6,X7)
        | relation_dom(X7) != X6
        | X7 = identity_relation(X6)
        | ~ relation(X7)
        | ~ function(X7) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t34_funct_1])])])])]) ).

fof(c_0_5,plain,
    ! [X11] :
      ( relation(identity_relation(X11))
      & function(identity_relation(X11)) ),
    inference(variable_rename,[status(thm)],[fc2_funct_1]) ).

fof(c_0_6,plain,
    ! [X10] : relation(identity_relation(X10)),
    inference(variable_rename,[status(thm)],[dt_k6_relat_1]) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1,X2] :
        ( in(X2,X1)
       => apply(identity_relation(X1),X2) = X2 ),
    inference(assume_negation,[status(cth)],[t35_funct_1]) ).

cnf(c_0_8,plain,
    ( apply(X3,X1) = X1
    | ~ in(X1,X2)
    | X3 != identity_relation(X2)
    | ~ relation(X3)
    | ~ function(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_9,plain,
    function(identity_relation(X1)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,plain,
    relation(identity_relation(X1)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_11,negated_conjecture,
    ( in(esk2_0,esk1_0)
    & apply(identity_relation(esk1_0),esk2_0) != esk2_0 ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

cnf(c_0_12,plain,
    ( apply(identity_relation(X1),X2) = X2
    | ~ in(X2,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_8]),c_0_9]),c_0_10])]) ).

cnf(c_0_13,negated_conjecture,
    in(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    apply(identity_relation(esk1_0),esk2_0) != esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10  % Problem    : SEU217+3 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n012.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:51:50 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.16/0.43  Running first-order theorem proving
% 0.16/0.43  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.6gtBIs2iN1/E---3.1_7974.p
% 0.27/300.13  # Version: 3.1pre001
% 0.27/300.13  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/300.13  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/300.13  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/300.13  # Starting new_bool_3 with 300s (1) cores
% 0.27/300.13  # Starting new_bool_1 with 300s (1) cores
% 0.27/300.13  # Starting sh5l with 300s (1) cores
% 0.27/300.13  # new_bool_3 with pid 8053 completed with status 0
% 0.27/300.13  # Result found by new_bool_3
% 0.27/300.13  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/300.13  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/300.13  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/300.13  # Starting new_bool_3 with 300s (1) cores
% 0.27/300.13  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/300.13  # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.27/300.13  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.27/300.13  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.27/300.13  # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 8056 completed with status 0
% 0.27/300.13  # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.27/300.13  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/300.13  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/300.13  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/300.13  # Starting new_bool_3 with 300s (1) cores
% 0.27/300.13  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/300.13  # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.27/300.13  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.27/300.13  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.27/300.13  # Preprocessing time       : 0.001 s
% 0.27/300.13  
% 0.27/300.13  # Proof found!
% 0.27/300.13  # SZS status Theorem
% 0.27/300.13  # SZS output start CNFRefutation
% See solution above
% 0.27/300.13  # Parsed axioms                        : 31
% 0.27/300.13  # Removed by relevancy pruning/SinE    : 7
% 0.27/300.13  # Initial clauses                      : 35
% 0.27/300.13  # Removed in clause preprocessing      : 0
% 0.27/300.13  # Initial clauses in saturation        : 35
% 0.27/300.13  # Processed clauses                    : 59
% 0.27/300.13  # ...of these trivial                  : 1
% 0.27/300.13  # ...subsumed                          : 2
% 0.27/300.13  # ...remaining for further processing  : 56
% 0.27/300.13  # Other redundant clauses eliminated   : 4
% 0.27/300.13  # Clauses deleted for lack of memory   : 0
% 0.27/300.13  # Backward-subsumed                    : 0
% 0.27/300.13  # Backward-rewritten                   : 8
% 0.27/300.13  # Generated clauses                    : 63
% 0.27/300.13  # ...of the previous two non-redundant : 50
% 0.27/300.13  # ...aggressively subsumed             : 0
% 0.27/300.13  # Contextual simplify-reflections      : 0
% 0.27/300.13  # Paramodulations                      : 59
% 0.27/300.13  # Factorizations                       : 0
% 0.27/300.13  # NegExts                              : 0
% 0.27/300.13  # Equation resolutions                 : 4
% 0.27/300.13  # Total rewrite steps                  : 45
% 0.27/300.13  # Propositional unsat checks           : 0
% 0.27/300.13  #    Propositional check models        : 0
% 0.27/300.13  #    Propositional check unsatisfiable : 0
% 0.27/300.13  #    Propositional clauses             : 0
% 0.27/300.13  #    Propositional clauses after purity: 0
% 0.27/300.13  #    Propositional unsat core size     : 0
% 0.27/300.13  #    Propositional preprocessing time  : 0.000
% 0.27/300.13  #    Propositional encoding time       : 0.000
% 0.27/300.13  #    Propositional solver time         : 0.000
% 0.27/300.13  #    Success case prop preproc time    : 0.000
% 0.27/300.13  #    Success case prop encoding time   : 0.000
% 0.27/300.13  #    Success case prop solver time     : 0.000
% 0.27/300.13  # Current number of processed clauses  : 44
% 0.27/300.13  #    Positive orientable unit clauses  : 16
% 0.27/300.13  #    Positive unorientable unit clauses: 0
% 0.27/300.13  #    Negative unit clauses             : 6
% 0.27/300.13  #    Non-unit-clauses                  : 22
% 0.27/300.13  # Current number of unprocessed clauses: 14
% 0.27/300.13  # ...number of literals in the above   : 24
% 0.27/300.13  # Current number of archived formulas  : 0
% 0.27/300.13  # Current number of archived clauses   : 8
% 0.27/300.13  # Clause-clause subsumption calls (NU) : 29
% 0.27/300.13  # Rec. Clause-clause subsumption calls : 29
% 0.27/300.13  # Non-unit clause-clause subsumptions  : 1
% 0.27/300.13  # Unit Clause-clause subsumption calls : 48
% 0.27/300.13  # Rewrite failures with RHS unbound    : 0
% 0.27/300.13  # BW rewrite match attempts            : 4
% 0.27/300.13  # BW rewrite match successes           : 4
% 0.27/300.13  # Condensation attempts                : 0
% 0.27/300.13  # Condensation successes               : 0
% 0.27/300.13  # Termbank termtop insertions          : 2103
% 0.27/300.13  
% 0.27/300.13  # -------------------------------------------------
% 0.27/300.13  # User time                : 0.005 s
% 0.27/300.13  # System time              : 0.001 s
% 0.27/300.13  # Total time               : 0.007 s
% 0.27/300.13  # Maximum resident set size: 1716 pages
% 0.27/300.13  
% 0.27/300.13  # -------------------------------------------------
% 0.27/300.13  # User time                : 0.007 s
% 0.27/300.13  # System time              : 0.002 s
% 0.27/300.13  # Total time               : 0.009 s
% 0.27/300.13  # Maximum resident set size: 1696 pages
% 0.27/300.13  % E---3.1 exiting
% 0.27/300.13  % E---3.1 exiting
%------------------------------------------------------------------------------