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

View Problem - Process Solution

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

% Computer : n018.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:46 EDT 2024

% Result   : Theorem 0.46s 0.58s
% Output   : CNFRefutation 0.46s
% 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.zhdleIlZE7/E---3.1_7406.p',t10_ordinal1) ).

fof(d1_ordinal1,axiom,
    ! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
    file('/export/starexec/sandbox2/tmp/tmp.zhdleIlZE7/E---3.1_7406.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.zhdleIlZE7/E---3.1_7406.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.zhdleIlZE7/E---3.1_7406.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(esk1_0,succ(esk1_0)),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

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

fof(c_0_7,plain,
    ! [X36,X37,X38,X39,X40,X41,X42,X43] :
      ( ( ~ in(X39,X38)
        | in(X39,X36)
        | in(X39,X37)
        | X38 != set_union2(X36,X37) )
      & ( ~ in(X40,X36)
        | in(X40,X38)
        | X38 != set_union2(X36,X37) )
      & ( ~ in(X40,X37)
        | in(X40,X38)
        | X38 != set_union2(X36,X37) )
      & ( ~ in(esk5_3(X41,X42,X43),X41)
        | ~ in(esk5_3(X41,X42,X43),X43)
        | X43 = set_union2(X41,X42) )
      & ( ~ in(esk5_3(X41,X42,X43),X42)
        | ~ in(esk5_3(X41,X42,X43),X43)
        | X43 = set_union2(X41,X42) )
      & ( in(esk5_3(X41,X42,X43),X43)
        | in(esk5_3(X41,X42,X43),X41)
        | in(esk5_3(X41,X42,X43),X42)
        | X43 = set_union2(X41,X42) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[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,
    ! [X70,X71,X72,X73,X74,X75] :
      ( ( ~ in(X72,X71)
        | X72 = X70
        | X71 != singleton(X70) )
      & ( X73 != X70
        | in(X73,X71)
        | X71 != singleton(X70) )
      & ( ~ in(esk6_2(X74,X75),X75)
        | esk6_2(X74,X75) != X74
        | X75 = singleton(X74) )
      & ( in(esk6_2(X74,X75),X75)
        | esk6_2(X74,X75) = X74
        | X75 = singleton(X74) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[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(esk1_0,succ(esk1_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(esk1_0,set_union2(esk1_0,singleton(esk1_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.12/0.15  % Problem    : SEU230+2 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.16  % Command    : run_E %s %d THM
% 0.15/0.37  % Computer : n018.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit   : 300
% 0.15/0.37  % WCLimit    : 300
% 0.15/0.37  % DateTime   : Fri May  3 08:17:16 EDT 2024
% 0.15/0.37  % CPUTime    : 
% 0.23/0.53  Running first-order theorem proving
% 0.23/0.53  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.zhdleIlZE7/E---3.1_7406.p
% 0.46/0.58  # Version: 3.1.0
% 0.46/0.58  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.46/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.58  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.46/0.58  # Starting new_bool_3 with 300s (1) cores
% 0.46/0.58  # Starting new_bool_1 with 300s (1) cores
% 0.46/0.58  # Starting sh5l with 300s (1) cores
% 0.46/0.58  # new_bool_3 with pid 7551 completed with status 0
% 0.46/0.58  # Result found by new_bool_3
% 0.46/0.58  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.46/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.58  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.46/0.58  # Starting new_bool_3 with 300s (1) cores
% 0.46/0.58  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.46/0.58  # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.46/0.58  # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.46/0.58  # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.46/0.58  # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 7557 completed with status 0
% 0.46/0.58  # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.46/0.58  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.46/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.58  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.46/0.58  # Starting new_bool_3 with 300s (1) cores
% 0.46/0.58  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.46/0.58  # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.46/0.58  # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.46/0.58  # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.46/0.58  # Preprocessing time       : 0.003 s
% 0.46/0.58  # Presaturation interreduction done
% 0.46/0.58  
% 0.46/0.58  # Proof found!
% 0.46/0.58  # SZS status Theorem
% 0.46/0.58  # SZS output start CNFRefutation
% See solution above
% 0.46/0.58  # Parsed axioms                        : 255
% 0.46/0.58  # Removed by relevancy pruning/SinE    : 164
% 0.46/0.58  # Initial clauses                      : 157
% 0.46/0.58  # Removed in clause preprocessing      : 2
% 0.46/0.58  # Initial clauses in saturation        : 155
% 0.46/0.58  # Processed clauses                    : 534
% 0.46/0.58  # ...of these trivial                  : 7
% 0.46/0.58  # ...subsumed                          : 155
% 0.46/0.58  # ...remaining for further processing  : 372
% 0.46/0.58  # Other redundant clauses eliminated   : 27
% 0.46/0.58  # Clauses deleted for lack of memory   : 0
% 0.46/0.58  # Backward-subsumed                    : 0
% 0.46/0.58  # Backward-rewritten                   : 26
% 0.46/0.58  # Generated clauses                    : 654
% 0.46/0.58  # ...of the previous two non-redundant : 511
% 0.46/0.58  # ...aggressively subsumed             : 0
% 0.46/0.58  # Contextual simplify-reflections      : 0
% 0.46/0.58  # Paramodulations                      : 626
% 0.46/0.58  # Factorizations                       : 0
% 0.46/0.58  # NegExts                              : 0
% 0.46/0.58  # Equation resolutions                 : 29
% 0.46/0.58  # Disequality decompositions           : 0
% 0.46/0.58  # Total rewrite steps                  : 205
% 0.46/0.58  # ...of those cached                   : 163
% 0.46/0.58  # Propositional unsat checks           : 0
% 0.46/0.58  #    Propositional check models        : 0
% 0.46/0.58  #    Propositional check unsatisfiable : 0
% 0.46/0.58  #    Propositional clauses             : 0
% 0.46/0.58  #    Propositional clauses after purity: 0
% 0.46/0.58  #    Propositional unsat core size     : 0
% 0.46/0.58  #    Propositional preprocessing time  : 0.000
% 0.46/0.58  #    Propositional encoding time       : 0.000
% 0.46/0.58  #    Propositional solver time         : 0.000
% 0.46/0.58  #    Success case prop preproc time    : 0.000
% 0.46/0.58  #    Success case prop encoding time   : 0.000
% 0.46/0.58  #    Success case prop solver time     : 0.000
% 0.46/0.58  # Current number of processed clauses  : 189
% 0.46/0.58  #    Positive orientable unit clauses  : 48
% 0.46/0.58  #    Positive unorientable unit clauses: 1
% 0.46/0.58  #    Negative unit clauses             : 26
% 0.46/0.58  #    Non-unit-clauses                  : 114
% 0.46/0.58  # Current number of unprocessed clauses: 264
% 0.46/0.58  # ...number of literals in the above   : 631
% 0.46/0.58  # Current number of archived formulas  : 0
% 0.46/0.58  # Current number of archived clauses   : 162
% 0.46/0.58  # Clause-clause subsumption calls (NU) : 1429
% 0.46/0.58  # Rec. Clause-clause subsumption calls : 968
% 0.46/0.58  # Non-unit clause-clause subsumptions  : 75
% 0.46/0.58  # Unit Clause-clause subsumption calls : 501
% 0.46/0.58  # Rewrite failures with RHS unbound    : 0
% 0.46/0.58  # BW rewrite match attempts            : 57
% 0.46/0.58  # BW rewrite match successes           : 36
% 0.46/0.58  # Condensation attempts                : 0
% 0.46/0.58  # Condensation successes               : 0
% 0.46/0.58  # Termbank termtop insertions          : 17058
% 0.46/0.58  # Search garbage collected termcells   : 3387
% 0.46/0.58  
% 0.46/0.58  # -------------------------------------------------
% 0.46/0.58  # User time                : 0.034 s
% 0.46/0.58  # System time              : 0.002 s
% 0.46/0.58  # Total time               : 0.036 s
% 0.46/0.58  # Maximum resident set size: 2356 pages
% 0.46/0.58  
% 0.46/0.58  # -------------------------------------------------
% 0.46/0.58  # User time                : 0.040 s
% 0.46/0.58  # System time              : 0.005 s
% 0.46/0.58  # Total time               : 0.045 s
% 0.46/0.58  # Maximum resident set size: 1960 pages
% 0.46/0.58  % E---3.1 exiting
% 0.46/0.58  % E exiting
%------------------------------------------------------------------------------