TSTP Solution File: SET046+1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SET046+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(pel42,conjecture,
    ~ ? [X1] :
      ! [X2] :
        ( element(X2,X1)
      <=> ~ ? [X3] :
              ( element(X2,X3)
              & element(X3,X2) ) ),
    file('/export/starexec/sandbox/tmp/tmp.fRcOpRsDq9/E---3.1_25401.p',pel42) ).

fof(c_0_1,negated_conjecture,
    ~ ~ ? [X1] :
        ! [X2] :
          ( element(X2,X1)
        <=> ~ ? [X3] :
                ( element(X2,X3)
                & element(X3,X2) ) ),
    inference(assume_negation,[status(cth)],[pel42]) ).

fof(c_0_2,negated_conjecture,
    ! [X5,X6] :
      ( ( ~ element(X5,esk1_0)
        | ~ element(X5,X6)
        | ~ element(X6,X5) )
      & ( element(X5,esk2_1(X5))
        | element(X5,esk1_0) )
      & ( element(esk2_1(X5),X5)
        | element(X5,esk1_0) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( ~ element(X1,esk1_0)
    | ~ element(X1,X2)
    | ~ element(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( element(esk2_1(X1),X1)
    | element(X1,esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ( element(esk1_0,esk1_0)
    | ~ element(X1,esk2_1(esk1_0))
    | ~ element(esk2_1(esk1_0),X1) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_6,negated_conjecture,
    ( element(X1,esk2_1(X1))
    | element(X1,esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_7,negated_conjecture,
    element(esk1_0,esk1_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    ( ~ element(X1,esk1_0)
    | ~ element(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_3,c_0_7]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11  % Problem    : SET046+1 : TPTP v8.1.2. Released v2.0.0.
% 0.08/0.12  % Command    : run_E %s %d THM
% 0.15/0.31  % Computer : n009.cluster.edu
% 0.15/0.31  % Model    : x86_64 x86_64
% 0.15/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.31  % Memory   : 8042.1875MB
% 0.15/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.31  % CPULimit   : 2400
% 0.15/0.31  % WCLimit    : 300
% 0.15/0.31  % DateTime   : Mon Oct  2 16:22:29 EDT 2023
% 0.15/0.31  % CPUTime    : 
% 0.15/0.42  Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.fRcOpRsDq9/E---3.1_25401.p
% 0.15/0.43  # Version: 3.1pre001
% 0.15/0.43  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN 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 25481 completed with status 0
% 0.15/0.43  # Result found by new_bool_3
% 0.15/0.43  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN 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: FGHNF-FFSF11-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 25486 completed with status 0
% 0.15/0.43  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.43  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN 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: FGHNF-FFSF11-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                        : 1
% 0.15/0.43  # Removed by relevancy pruning/SinE    : 0
% 0.15/0.43  # Initial clauses                      : 3
% 0.15/0.43  # Removed in clause preprocessing      : 0
% 0.15/0.43  # Initial clauses in saturation        : 3
% 0.15/0.43  # Processed clauses                    : 9
% 0.15/0.43  # ...of these trivial                  : 0
% 0.15/0.43  # ...subsumed                          : 0
% 0.15/0.43  # ...remaining for further processing  : 9
% 0.15/0.43  # Other redundant clauses eliminated   : 0
% 0.15/0.43  # Clauses deleted for lack of memory   : 0
% 0.15/0.43  # Backward-subsumed                    : 0
% 0.15/0.43  # Backward-rewritten                   : 1
% 0.15/0.43  # Generated clauses                    : 6
% 0.15/0.43  # ...of the previous two non-redundant : 4
% 0.15/0.43  # ...aggressively subsumed             : 0
% 0.15/0.43  # Contextual simplify-reflections      : 1
% 0.15/0.43  # Paramodulations                      : 6
% 0.15/0.43  # Factorizations                       : 0
% 0.15/0.43  # NegExts                              : 0
% 0.15/0.43  # Equation resolutions                 : 0
% 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  : 5
% 0.15/0.43  #    Positive orientable unit clauses  : 1
% 0.15/0.43  #    Positive unorientable unit clauses: 0
% 0.15/0.43  #    Negative unit clauses             : 0
% 0.15/0.43  #    Non-unit-clauses                  : 4
% 0.15/0.43  # Current number of unprocessed clauses: 1
% 0.15/0.43  # ...number of literals in the above   : 3
% 0.15/0.43  # Current number of archived formulas  : 0
% 0.15/0.43  # Current number of archived clauses   : 4
% 0.15/0.43  # Clause-clause subsumption calls (NU) : 10
% 0.15/0.43  # Rec. Clause-clause subsumption calls : 10
% 0.15/0.43  # Non-unit clause-clause subsumptions  : 1
% 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            : 1
% 0.15/0.43  # BW rewrite match successes           : 1
% 0.15/0.43  # Condensation attempts                : 0
% 0.15/0.43  # Condensation successes               : 0
% 0.15/0.43  # Termbank termtop insertions          : 291
% 0.15/0.43  
% 0.15/0.43  # -------------------------------------------------
% 0.15/0.43  # User time                : 0.001 s
% 0.15/0.43  # System time              : 0.002 s
% 0.15/0.43  # Total time               : 0.003 s
% 0.15/0.43  # Maximum resident set size: 1600 pages
% 0.15/0.43  
% 0.15/0.43  # -------------------------------------------------
% 0.15/0.43  # User time                : 0.001 s
% 0.15/0.43  # System time              : 0.004 s
% 0.15/0.43  # Total time               : 0.005 s
% 0.15/0.43  # Maximum resident set size: 1668 pages
% 0.15/0.43  % E---3.1 exiting
% 0.15/0.43  % E---3.1 exiting
%------------------------------------------------------------------------------