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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SEU123+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:26 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(t3_xboole_1,conjecture,
    ! [X1] :
      ( subset(X1,empty_set)
     => X1 = empty_set ),
    file('/export/starexec/sandbox/tmp/tmp.ZTvnoX6bWi/E---3.1_10990.p',t3_xboole_1) ).

fof(d10_xboole_0,axiom,
    ! [X1,X2] :
      ( X1 = X2
    <=> ( subset(X1,X2)
        & subset(X2,X1) ) ),
    file('/export/starexec/sandbox/tmp/tmp.ZTvnoX6bWi/E---3.1_10990.p',d10_xboole_0) ).

fof(t2_xboole_1,axiom,
    ! [X1] : subset(empty_set,X1),
    file('/export/starexec/sandbox/tmp/tmp.ZTvnoX6bWi/E---3.1_10990.p',t2_xboole_1) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1] :
        ( subset(X1,empty_set)
       => X1 = empty_set ),
    inference(assume_negation,[status(cth)],[t3_xboole_1]) ).

fof(c_0_4,plain,
    ! [X6,X7] :
      ( ( subset(X6,X7)
        | X6 != X7 )
      & ( subset(X7,X6)
        | X6 != X7 )
      & ( ~ subset(X6,X7)
        | ~ subset(X7,X6)
        | X6 = X7 ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])]) ).

fof(c_0_5,negated_conjecture,
    ( subset(esk1_0,empty_set)
    & esk1_0 != empty_set ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_6,plain,
    ! [X4] : subset(empty_set,X4),
    inference(variable_rename,[status(thm)],[t2_xboole_1]) ).

cnf(c_0_7,plain,
    ( X1 = X2
    | ~ subset(X1,X2)
    | ~ subset(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    subset(esk1_0,empty_set),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    subset(empty_set,X1),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    esk1_0 != empty_set,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SEU123+1 : TPTP v8.1.2. Released v3.3.0.
% 0.10/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 09:16:36 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.15/0.42  Running first-order model finding
% 0.15/0.42  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.ZTvnoX6bWi/E---3.1_10990.p
% 0.15/0.43  # Version: 3.1pre001
% 0.15/0.43  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43  # Starting sh5l with 300s (1) cores
% 0.15/0.43  # new_bool_3 with pid 11068 completed with status 0
% 0.15/0.43  # Result found by new_bool_3
% 0.15/0.43  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43  # Search class: FHUSS-FFSS00-SFFFFFNN
% 0.15/0.43  # partial match(2): FHUNF-FFSS00-SFFFFFNN
% 0.15/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.43  # SAT001_MinMin_p005000_rr_RG with pid 11071 completed with status 0
% 0.15/0.43  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.43  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43  # Search class: FHUSS-FFSS00-SFFFFFNN
% 0.15/0.43  # partial match(2): FHUNF-FFSS00-SFFFFFNN
% 0.15/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.43  # Preprocessing time       : 0.001 s
% 0.15/0.43  # Presaturation interreduction done
% 0.15/0.43  
% 0.15/0.43  # Proof found!
% 0.15/0.43  # SZS status Theorem
% 0.15/0.43  # SZS output start CNFRefutation
% See solution above
% 0.15/0.43  # Parsed axioms                        : 12
% 0.15/0.43  # Removed by relevancy pruning/SinE    : 3
% 0.15/0.43  # Initial clauses                      : 12
% 0.15/0.43  # Removed in clause preprocessing      : 0
% 0.15/0.43  # Initial clauses in saturation        : 12
% 0.15/0.43  # Processed clauses                    : 22
% 0.15/0.43  # ...of these trivial                  : 0
% 0.15/0.43  # ...subsumed                          : 0
% 0.15/0.43  # ...remaining for further processing  : 22
% 0.15/0.43  # Other redundant clauses eliminated   : 2
% 0.15/0.43  # Clauses deleted for lack of memory   : 0
% 0.15/0.43  # Backward-subsumed                    : 0
% 0.15/0.43  # Backward-rewritten                   : 0
% 0.15/0.43  # Generated clauses                    : 7
% 0.15/0.43  # ...of the previous two non-redundant : 3
% 0.15/0.43  # ...aggressively subsumed             : 0
% 0.15/0.43  # Contextual simplify-reflections      : 0
% 0.15/0.43  # Paramodulations                      : 5
% 0.15/0.43  # Factorizations                       : 0
% 0.15/0.43  # NegExts                              : 0
% 0.15/0.43  # Equation resolutions                 : 2
% 0.15/0.43  # Total rewrite steps                  : 3
% 0.15/0.43  # Propositional unsat checks           : 0
% 0.15/0.43  #    Propositional check models        : 0
% 0.15/0.43  #    Propositional check unsatisfiable : 0
% 0.15/0.43  #    Propositional clauses             : 0
% 0.15/0.43  #    Propositional clauses after purity: 0
% 0.15/0.43  #    Propositional unsat core size     : 0
% 0.15/0.43  #    Propositional preprocessing time  : 0.000
% 0.15/0.43  #    Propositional encoding time       : 0.000
% 0.15/0.43  #    Propositional solver time         : 0.000
% 0.15/0.43  #    Success case prop preproc time    : 0.000
% 0.15/0.43  #    Success case prop encoding time   : 0.000
% 0.15/0.43  #    Success case prop solver time     : 0.000
% 0.15/0.43  # Current number of processed clauses  : 10
% 0.15/0.43  #    Positive orientable unit clauses  : 5
% 0.15/0.43  #    Positive unorientable unit clauses: 0
% 0.15/0.43  #    Negative unit clauses             : 2
% 0.15/0.43  #    Non-unit-clauses                  : 3
% 0.15/0.43  # Current number of unprocessed clauses: 3
% 0.15/0.43  # ...number of literals in the above   : 5
% 0.15/0.43  # Current number of archived formulas  : 0
% 0.15/0.43  # Current number of archived clauses   : 10
% 0.15/0.43  # Clause-clause subsumption calls (NU) : 0
% 0.15/0.43  # Rec. Clause-clause subsumption calls : 0
% 0.15/0.43  # Non-unit clause-clause subsumptions  : 0
% 0.15/0.43  # Unit Clause-clause subsumption calls : 0
% 0.15/0.43  # Rewrite failures with RHS unbound    : 0
% 0.15/0.43  # BW rewrite match attempts            : 4
% 0.15/0.43  # BW rewrite match successes           : 0
% 0.15/0.43  # Condensation attempts                : 0
% 0.15/0.43  # Condensation successes               : 0
% 0.15/0.43  # Termbank termtop insertions          : 439
% 0.15/0.43  
% 0.15/0.43  # -------------------------------------------------
% 0.15/0.43  # User time                : 0.003 s
% 0.15/0.43  # System time              : 0.001 s
% 0.15/0.43  # Total time               : 0.004 s
% 0.15/0.43  # Maximum resident set size: 1776 pages
% 0.15/0.43  
% 0.15/0.43  # -------------------------------------------------
% 0.15/0.43  # User time                : 0.003 s
% 0.15/0.43  # System time              : 0.003 s
% 0.15/0.43  # Total time               : 0.006 s
% 0.15/0.43  # Maximum resident set size: 1676 pages
% 0.15/0.43  % E---3.1 exiting
%------------------------------------------------------------------------------