TSTP Solution File: SET055^12 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SET055^12 : TPTP v8.2.0. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n002.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 : Tue May 21 02:52:46 EDT 2024

% Result   : Theorem 0.17s 0.50s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   21 (   7 unt;   7 typ;   0 def)
%            Number of atoms       :   29 (   4 equ;   0 cnn)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   60 (   5   ~;   2   |;   1   &;  48   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   17 (  17   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   14 (   8   ^   6   !;   0   ?;  14   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    mworld: $tType ).

thf(decl_23,type,
    mactual: mworld ).

thf(decl_24,type,
    mlocal: ( mworld > $o ) > $o ).

thf(decl_32,type,
    eiw_di: $i > mworld > $o ).

thf(decl_33,type,
    mforall_di: ( $i > mworld > $o ) > mworld > $o ).

thf(decl_40,type,
    qmltpeq: $i > $i > mworld > $o ).

thf(decl_74,type,
    esk8_0: $i ).

thf(mlocal_def,axiom,
    ( mlocal
    = ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mlocal_def) ).

thf(mforall_di_def,axiom,
    ( mforall_di
    = ( ^ [X7: $i > mworld > $o,X3: mworld] :
        ! [X6: $i] :
          ( ( eiw_di @ X6 @ X3 )
         => ( X7 @ X6 @ X3 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mforall_di_def) ).

thf(reflexivity_0,conjecture,
    ( mlocal
    @ ( mforall_di
      @ ^ [X6: $i] : ( qmltpeq @ X6 @ X6 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_0) ).

thf(reflexivity,axiom,
    ( mlocal
    @ ( mforall_di
      @ ^ [X6: $i] : ( qmltpeq @ X6 @ X6 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).

thf(c_0_4,plain,
    ( mlocal
    = ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
    inference(fof_simplification,[status(thm)],[mlocal_def]) ).

thf(c_0_5,plain,
    ( mforall_di
    = ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
        ! [X6: $i] :
          ( ( eiw_di @ X6 @ Z1 )
         => ( Z0 @ X6 @ Z1 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mforall_di_def]) ).

thf(c_0_6,negated_conjecture,
    ~ ! [X299: $i] :
        ( ( eiw_di @ X299 @ mactual )
       => ( qmltpeq @ X299 @ X299 @ mactual ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[reflexivity_0])]),c_0_4]),c_0_5]) ).

thf(c_0_7,plain,
    ! [X105: $i] :
      ( ( eiw_di @ X105 @ mactual )
     => ( qmltpeq @ X105 @ X105 @ mactual ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity]),c_0_4]),c_0_5]) ).

thf(c_0_8,negated_conjecture,
    ( ( eiw_di @ esk8_0 @ mactual )
    & ~ ( qmltpeq @ esk8_0 @ esk8_0 @ mactual ) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).

thf(c_0_9,plain,
    ! [X304: $i] :
      ( ~ ( eiw_di @ X304 @ mactual )
      | ( qmltpeq @ X304 @ X304 @ mactual ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

thf(c_0_10,negated_conjecture,
    ~ ( qmltpeq @ esk8_0 @ esk8_0 @ mactual ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_11,plain,
    ! [X6: $i] :
      ( ( qmltpeq @ X6 @ X6 @ mactual )
      | ~ ( eiw_di @ X6 @ mactual ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_12,negated_conjecture,
    eiw_di @ esk8_0 @ mactual,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : SET055^12 : TPTP v8.2.0. Released v8.1.0.
% 0.10/0.12  % Command    : run_E %s %d THM
% 0.12/0.32  % Computer : n002.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit   : 300
% 0.12/0.32  % WCLimit    : 300
% 0.12/0.32  % DateTime   : Mon May 20 12:18:23 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.17/0.44  Running higher-order theorem proving
% 0.17/0.44  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.50  # Version: 3.1.0-ho
% 0.17/0.50  # Preprocessing class: HSLSSMSSMLLNHSN.
% 0.17/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50  # Starting almost_fo_3 with 1500s (5) cores
% 0.17/0.50  # Starting sh10 with 300s (1) cores
% 0.17/0.50  # Starting new_ho_16 with 300s (1) cores
% 0.17/0.50  # Starting post_as_ho11 with 300s (1) cores
% 0.17/0.50  # new_ho_16 with pid 17691 completed with status 8
% 0.17/0.50  # almost_fo_3 with pid 17689 completed with status 0
% 0.17/0.50  # Result found by almost_fo_3
% 0.17/0.50  # Preprocessing class: HSLSSMSSMLLNHSN.
% 0.17/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50  # Starting almost_fo_3 with 1500s (5) cores
% 0.17/0.50  # No SInE strategy applied
% 0.17/0.50  # Search class: HGHNS-FSLM31-MHSSMFNN
% 0.17/0.50  # partial match(2): HGHNS-FSLM11-SHSSMFNN
% 0.17/0.50  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.50  # Starting new_ho_10 with 811s (1) cores
% 0.17/0.50  # Starting almost_fo_3 with 151s (1) cores
% 0.17/0.50  # Starting new_bool_1 with 136s (1) cores
% 0.17/0.50  # Starting new_bool_2 with 136s (1) cores
% 0.17/0.50  # Starting new_bool_9 with 136s (1) cores
% 0.17/0.50  # almost_fo_3 with pid 17702 completed with status 0
% 0.17/0.50  # Result found by almost_fo_3
% 0.17/0.50  # Preprocessing class: HSLSSMSSMLLNHSN.
% 0.17/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50  # Starting almost_fo_3 with 1500s (5) cores
% 0.17/0.50  # No SInE strategy applied
% 0.17/0.50  # Search class: HGHNS-FSLM31-MHSSMFNN
% 0.17/0.50  # partial match(2): HGHNS-FSLM11-SHSSMFNN
% 0.17/0.50  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.50  # Starting new_ho_10 with 811s (1) cores
% 0.17/0.50  # Starting almost_fo_3 with 151s (1) cores
% 0.17/0.50  # Preprocessing time       : 0.004 s
% 0.17/0.50  # Presaturation interreduction done
% 0.17/0.50  
% 0.17/0.50  # Proof found!
% 0.17/0.50  # SZS status Theorem
% 0.17/0.50  # SZS output start CNFRefutation
% See solution above
% 0.17/0.50  # Parsed axioms                        : 142
% 0.17/0.50  # Removed by relevancy pruning/SinE    : 0
% 0.17/0.50  # Initial clauses                      : 182
% 0.17/0.50  # Removed in clause preprocessing      : 46
% 0.17/0.50  # Initial clauses in saturation        : 136
% 0.17/0.50  # Processed clauses                    : 145
% 0.17/0.50  # ...of these trivial                  : 0
% 0.17/0.50  # ...subsumed                          : 0
% 0.17/0.50  # ...remaining for further processing  : 145
% 0.17/0.50  # Other redundant clauses eliminated   : 0
% 0.17/0.50  # Clauses deleted for lack of memory   : 0
% 0.17/0.50  # Backward-subsumed                    : 0
% 0.17/0.50  # Backward-rewritten                   : 0
% 0.17/0.50  # Generated clauses                    : 1
% 0.17/0.50  # ...of the previous two non-redundant : 0
% 0.17/0.50  # ...aggressively subsumed             : 0
% 0.17/0.50  # Contextual simplify-reflections      : 0
% 0.17/0.50  # Paramodulations                      : 1
% 0.17/0.50  # Factorizations                       : 0
% 0.17/0.50  # NegExts                              : 0
% 0.17/0.50  # Equation resolutions                 : 0
% 0.17/0.50  # Disequality decompositions           : 0
% 0.17/0.50  # Total rewrite steps                  : 1
% 0.17/0.50  # ...of those cached                   : 0
% 0.17/0.50  # Propositional unsat checks           : 0
% 0.17/0.50  #    Propositional check models        : 0
% 0.17/0.50  #    Propositional check unsatisfiable : 0
% 0.17/0.50  #    Propositional clauses             : 0
% 0.17/0.50  #    Propositional clauses after purity: 0
% 0.17/0.50  #    Propositional unsat core size     : 0
% 0.17/0.50  #    Propositional preprocessing time  : 0.000
% 0.17/0.50  #    Propositional encoding time       : 0.000
% 0.17/0.50  #    Propositional solver time         : 0.000
% 0.17/0.50  #    Success case prop preproc time    : 0.000
% 0.17/0.50  #    Success case prop encoding time   : 0.000
% 0.17/0.50  #    Success case prop solver time     : 0.000
% 0.17/0.50  # Current number of processed clauses  : 9
% 0.17/0.50  #    Positive orientable unit clauses  : 6
% 0.17/0.50  #    Positive unorientable unit clauses: 0
% 0.17/0.50  #    Negative unit clauses             : 1
% 0.17/0.50  #    Non-unit-clauses                  : 2
% 0.17/0.50  # Current number of unprocessed clauses: 127
% 0.17/0.50  # ...number of literals in the above   : 562
% 0.17/0.50  # Current number of archived formulas  : 0
% 0.17/0.50  # Current number of archived clauses   : 136
% 0.17/0.50  # Clause-clause subsumption calls (NU) : 6627
% 0.17/0.50  # Rec. Clause-clause subsumption calls : 536
% 0.17/0.50  # Non-unit clause-clause subsumptions  : 0
% 0.17/0.50  # Unit Clause-clause subsumption calls : 0
% 0.17/0.50  # Rewrite failures with RHS unbound    : 0
% 0.17/0.50  # BW rewrite match attempts            : 0
% 0.17/0.50  # BW rewrite match successes           : 0
% 0.17/0.50  # Condensation attempts                : 0
% 0.17/0.50  # Condensation successes               : 0
% 0.17/0.50  # Termbank termtop insertions          : 32552
% 0.17/0.50  # Search garbage collected termcells   : 12932
% 0.17/0.50  
% 0.17/0.50  # -------------------------------------------------
% 0.17/0.50  # User time                : 0.034 s
% 0.17/0.50  # System time              : 0.008 s
% 0.17/0.50  # Total time               : 0.042 s
% 0.17/0.50  # Maximum resident set size: 4096 pages
% 0.17/0.50  
% 0.17/0.50  # -------------------------------------------------
% 0.17/0.50  # User time                : 0.113 s
% 0.17/0.50  # System time              : 0.058 s
% 0.17/0.50  # Total time               : 0.171 s
% 0.17/0.50  # Maximum resident set size: 1940 pages
% 0.17/0.50  % E---3.1 exiting
% 0.17/0.50  % E exiting
%------------------------------------------------------------------------------