TSTP Solution File: SEU230+3 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SEU230+3 : TPTP v8.1.2. Released v3.2.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:03 EDT 2023

% Result   : Theorem 0.16s 0.43s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (  10 unt;   0 def)
%            Number of atoms       :   57 (  23 equ)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :   65 (  25   ~;  28   |;   8   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-3 aty)
%            Number of variables   :   37 (   2 sgn;  25   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t10_ordinal1,conjecture,
    ! [X1] : in(X1,succ(X1)),
    file('/export/starexec/sandbox2/tmp/tmp.Y12X9Kzlby/E---3.1_9576.p',t10_ordinal1) ).

fof(d1_ordinal1,axiom,
    ! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
    file('/export/starexec/sandbox2/tmp/tmp.Y12X9Kzlby/E---3.1_9576.p',d1_ordinal1) ).

fof(d2_xboole_0,axiom,
    ! [X1,X2,X3] :
      ( X3 = set_union2(X1,X2)
    <=> ! [X4] :
          ( in(X4,X3)
        <=> ( in(X4,X1)
            | in(X4,X2) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.Y12X9Kzlby/E---3.1_9576.p',d2_xboole_0) ).

fof(d1_tarski,axiom,
    ! [X1,X2] :
      ( X2 = singleton(X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> X3 = X1 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.Y12X9Kzlby/E---3.1_9576.p',d1_tarski) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1] : in(X1,succ(X1)),
    inference(assume_negation,[status(cth)],[t10_ordinal1]) ).

fof(c_0_5,negated_conjecture,
    ~ in(esk14_0,succ(esk14_0)),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_6,plain,
    ! [X12] : succ(X12) = set_union2(X12,singleton(X12)),
    inference(variable_rename,[status(thm)],[d1_ordinal1]) ).

fof(c_0_7,plain,
    ! [X20,X21,X22,X23,X24,X25,X26,X27] :
      ( ( ~ in(X23,X22)
        | in(X23,X20)
        | in(X23,X21)
        | X22 != set_union2(X20,X21) )
      & ( ~ in(X24,X20)
        | in(X24,X22)
        | X22 != set_union2(X20,X21) )
      & ( ~ in(X24,X21)
        | in(X24,X22)
        | X22 != set_union2(X20,X21) )
      & ( ~ in(esk2_3(X25,X26,X27),X25)
        | ~ in(esk2_3(X25,X26,X27),X27)
        | X27 = set_union2(X25,X26) )
      & ( ~ in(esk2_3(X25,X26,X27),X26)
        | ~ in(esk2_3(X25,X26,X27),X27)
        | X27 = set_union2(X25,X26) )
      & ( in(esk2_3(X25,X26,X27),X27)
        | in(esk2_3(X25,X26,X27),X25)
        | in(esk2_3(X25,X26,X27),X26)
        | X27 = set_union2(X25,X26) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_xboole_0])])])])])]) ).

fof(c_0_8,plain,
    ! [X13,X14,X15,X16,X17,X18] :
      ( ( ~ in(X15,X14)
        | X15 = X13
        | X14 != singleton(X13) )
      & ( X16 != X13
        | in(X16,X14)
        | X14 != singleton(X13) )
      & ( ~ in(esk1_2(X17,X18),X18)
        | esk1_2(X17,X18) != X17
        | X18 = singleton(X17) )
      & ( in(esk1_2(X17,X18),X18)
        | esk1_2(X17,X18) = X17
        | X18 = singleton(X17) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tarski])])])])])]) ).

cnf(c_0_9,negated_conjecture,
    ~ in(esk14_0,succ(esk14_0)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,plain,
    succ(X1) = set_union2(X1,singleton(X1)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ( in(X1,X3)
    | ~ in(X1,X2)
    | X3 != set_union2(X4,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ( in(X1,X3)
    | X1 != X2
    | X3 != singleton(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    ~ in(esk14_0,set_union2(esk14_0,singleton(esk14_0))),
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,plain,
    ( in(X1,set_union2(X2,X3))
    | ~ in(X1,X3) ),
    inference(er,[status(thm)],[c_0_11]) ).

cnf(c_0_15,plain,
    in(X1,singleton(X1)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_12])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem    : SEU230+3 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.11  % 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 08:31:21 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.16/0.42  Running first-order model finding
% 0.16/0.42  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.Y12X9Kzlby/E---3.1_9576.p
% 0.16/0.43  # Version: 3.1pre001
% 0.16/0.43  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43  # Starting sh5l with 300s (1) cores
% 0.16/0.43  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9653 completed with status 0
% 0.16/0.43  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.43  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43  # No SInE strategy applied
% 0.16/0.43  # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.16/0.43  # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.43  # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.43  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.16/0.43  # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.43  # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.16/0.43  # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 9659 completed with status 0
% 0.16/0.43  # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.43  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43  # No SInE strategy applied
% 0.16/0.43  # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.16/0.43  # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.43  # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.43  # Preprocessing time       : 0.001 s
% 0.16/0.43  # Presaturation interreduction done
% 0.16/0.43  
% 0.16/0.43  # Proof found!
% 0.16/0.43  # SZS status Theorem
% 0.16/0.43  # SZS output start CNFRefutation
% See solution above
% 0.16/0.43  # Parsed axioms                        : 34
% 0.16/0.43  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.43  # Initial clauses                      : 59
% 0.16/0.43  # Removed in clause preprocessing      : 3
% 0.16/0.43  # Initial clauses in saturation        : 56
% 0.16/0.43  # Processed clauses                    : 111
% 0.16/0.43  # ...of these trivial                  : 3
% 0.16/0.43  # ...subsumed                          : 0
% 0.16/0.43  # ...remaining for further processing  : 108
% 0.16/0.43  # Other redundant clauses eliminated   : 6
% 0.16/0.43  # Clauses deleted for lack of memory   : 0
% 0.16/0.43  # Backward-subsumed                    : 0
% 0.16/0.43  # Backward-rewritten                   : 8
% 0.16/0.43  # Generated clauses                    : 29
% 0.16/0.43  # ...of the previous two non-redundant : 20
% 0.16/0.43  # ...aggressively subsumed             : 0
% 0.16/0.43  # Contextual simplify-reflections      : 2
% 0.16/0.43  # Paramodulations                      : 24
% 0.16/0.43  # Factorizations                       : 0
% 0.16/0.43  # NegExts                              : 0
% 0.16/0.43  # Equation resolutions                 : 6
% 0.16/0.43  # Total rewrite steps                  : 20
% 0.16/0.43  # Propositional unsat checks           : 0
% 0.16/0.43  #    Propositional check models        : 0
% 0.16/0.43  #    Propositional check unsatisfiable : 0
% 0.16/0.43  #    Propositional clauses             : 0
% 0.16/0.43  #    Propositional clauses after purity: 0
% 0.16/0.43  #    Propositional unsat core size     : 0
% 0.16/0.43  #    Propositional preprocessing time  : 0.000
% 0.16/0.43  #    Propositional encoding time       : 0.000
% 0.16/0.43  #    Propositional solver time         : 0.000
% 0.16/0.43  #    Success case prop preproc time    : 0.000
% 0.16/0.43  #    Success case prop encoding time   : 0.000
% 0.16/0.43  #    Success case prop solver time     : 0.000
% 0.16/0.43  # Current number of processed clauses  : 42
% 0.16/0.43  #    Positive orientable unit clauses  : 24
% 0.16/0.43  #    Positive unorientable unit clauses: 1
% 0.16/0.43  #    Negative unit clauses             : 6
% 0.16/0.43  #    Non-unit-clauses                  : 11
% 0.16/0.43  # Current number of unprocessed clauses: 16
% 0.16/0.43  # ...number of literals in the above   : 40
% 0.16/0.43  # Current number of archived formulas  : 0
% 0.16/0.43  # Current number of archived clauses   : 62
% 0.16/0.43  # Clause-clause subsumption calls (NU) : 103
% 0.16/0.43  # Rec. Clause-clause subsumption calls : 74
% 0.16/0.43  # Non-unit clause-clause subsumptions  : 2
% 0.16/0.43  # Unit Clause-clause subsumption calls : 20
% 0.16/0.43  # Rewrite failures with RHS unbound    : 0
% 0.16/0.43  # BW rewrite match attempts            : 30
% 0.16/0.43  # BW rewrite match successes           : 23
% 0.16/0.43  # Condensation attempts                : 0
% 0.16/0.43  # Condensation successes               : 0
% 0.16/0.43  # Termbank termtop insertions          : 2379
% 0.16/0.43  
% 0.16/0.43  # -------------------------------------------------
% 0.16/0.43  # User time                : 0.007 s
% 0.16/0.43  # System time              : 0.002 s
% 0.16/0.43  # Total time               : 0.008 s
% 0.16/0.43  # Maximum resident set size: 1816 pages
% 0.16/0.43  
% 0.16/0.43  # -------------------------------------------------
% 0.16/0.43  # User time                : 0.019 s
% 0.16/0.43  # System time              : 0.008 s
% 0.16/0.43  # Total time               : 0.027 s
% 0.16/0.43  # Maximum resident set size: 1696 pages
% 0.16/0.43  % E---3.1 exiting
%------------------------------------------------------------------------------