TSTP Solution File: SYO897^6 by E---3.1.00

View Problem - Process Solution

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

% Computer : n026.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 08:50:32 EDT 2024

% Result   : Theorem 0.20s 0.50s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   26 (  11 unt;  10 typ;   0 def)
%            Number of atoms       :   48 (   8 equ;   0 cnn)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :   80 (   8   ~;   4   |;   7   &;  54   @)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   27 (  27   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   9 usr;   3 con; 0-3 aty)
%            Number of variables   :   28 (  16   ^   8   !;   4   ?;  28   :)

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

thf(decl_22,type,
    mrel: mworld > mworld > $o ).

thf(decl_23,type,
    mactual: mworld ).

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

thf(decl_28,type,
    mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).

thf(decl_30,type,
    mbox: ( mworld > $o ) > mworld > $o ).

thf(decl_31,type,
    mdia: ( mworld > $o ) > mworld > $o ).

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

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

thf(decl_34,type,
    esk1_0: mworld ).

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

thf(mimplies_def,axiom,
    ( mimplies
    = ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
          ( ( X2 @ X3 )
         => ( X4 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimplies_def) ).

thf(mbox_def,axiom,
    ( mbox
    = ( ^ [X1: mworld > $o,X3: mworld] :
        ! [X5: mworld] :
          ( ( mrel @ X3 @ X5 )
         => ( X1 @ X5 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox_def) ).

thf(mdia_def,axiom,
    ( mdia
    = ( ^ [X1: mworld > $o,X3: mworld] :
        ? [X5: mworld] :
          ( ( mrel @ X3 @ X5 )
          & ( X1 @ X5 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mdia_def) ).

thf(con,conjecture,
    mlocal @ ( mimplies @ ( mdia @ p ) @ ( mimplies @ ( mbox @ q ) @ ( mdia @ q ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

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

thf(c_0_6,plain,
    ( mimplies
    = ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
          ( ( Z0 @ Z2 )
         => ( Z1 @ Z2 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mimplies_def]) ).

thf(c_0_7,plain,
    ( mbox
    = ( ^ [Z0: mworld > $o,Z1: mworld] :
        ! [X5: mworld] :
          ( ( mrel @ Z1 @ X5 )
         => ( Z0 @ X5 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mbox_def]) ).

thf(c_0_8,plain,
    ( mdia
    = ( ^ [Z0: mworld > $o,Z1: mworld] :
        ? [X5: mworld] :
          ( ( mrel @ Z1 @ X5 )
          & ( Z0 @ X5 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mdia_def]) ).

thf(c_0_9,negated_conjecture,
    ~ ( ? [X8: mworld] :
          ( ( mrel @ mactual @ X8 )
          & ( p @ X8 ) )
     => ( ! [X9: mworld] :
            ( ( mrel @ mactual @ X9 )
           => ( q @ X9 ) )
       => ? [X10: mworld] :
            ( ( mrel @ mactual @ X10 )
            & ( q @ X10 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[con]),c_0_5]),c_0_6]),c_0_7]),c_0_8]) ).

thf(c_0_10,negated_conjecture,
    ! [X14: mworld,X15: mworld] :
      ( ( mrel @ mactual @ esk1_0 )
      & ( p @ esk1_0 )
      & ( ~ ( mrel @ mactual @ X14 )
        | ( q @ X14 ) )
      & ( ~ ( mrel @ mactual @ X15 )
        | ~ ( q @ X15 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).

thf(c_0_11,negated_conjecture,
    ! [X3: mworld] :
      ( ( q @ X3 )
      | ~ ( mrel @ mactual @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_12,negated_conjecture,
    ! [X3: mworld] :
      ( ~ ( mrel @ mactual @ X3 )
      | ~ ( q @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_13,negated_conjecture,
    mrel @ mactual @ esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_14,negated_conjecture,
    ! [X3: mworld] :
      ~ ( mrel @ mactual @ X3 ),
    inference(csr,[status(thm)],[c_0_11,c_0_12]) ).

thf(c_0_15,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_13,c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYO897^6 : TPTP v8.2.0. Released v8.1.0.
% 0.13/0.13  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n026.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon May 20 10:34:53 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.20/0.48  Running higher-order theorem proving
% 0.20/0.48  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.50  # Version: 3.1.0-ho
% 0.20/0.50  # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.50  # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.50  # Starting sh1l with 300s (1) cores
% 0.20/0.50  # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.50  # new_ho_9 with pid 30488 completed with status 0
% 0.20/0.50  # Result found by new_ho_9
% 0.20/0.50  # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.50  # No SInE strategy applied
% 0.20/0.50  # Search class: HHHNF-FFSF00-SHSSMFNN
% 0.20/0.50  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50  # Starting new_ho_10 with 811s (1) cores
% 0.20/0.50  # Starting new_ho_9 with 151s (1) cores
% 0.20/0.50  # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.20/0.50  # Starting lpo1_def_fix with 136s (1) cores
% 0.20/0.50  # Starting ehoh_best8_lambda with 136s (1) cores
% 0.20/0.50  # ehoh_best8_lambda with pid 30497 completed with status 0
% 0.20/0.50  # Result found by ehoh_best8_lambda
% 0.20/0.50  # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.50  # No SInE strategy applied
% 0.20/0.50  # Search class: HHHNF-FFSF00-SHSSMFNN
% 0.20/0.50  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50  # Starting new_ho_10 with 811s (1) cores
% 0.20/0.50  # Starting new_ho_9 with 151s (1) cores
% 0.20/0.50  # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.20/0.50  # Starting lpo1_def_fix with 136s (1) cores
% 0.20/0.50  # Starting ehoh_best8_lambda with 136s (1) cores
% 0.20/0.50  # Preprocessing time       : 0.001 s
% 0.20/0.50  # Presaturation interreduction done
% 0.20/0.50  
% 0.20/0.50  # Proof found!
% 0.20/0.50  # SZS status Theorem
% 0.20/0.50  # SZS output start CNFRefutation
% See solution above
% 0.20/0.50  # Parsed axioms                        : 23
% 0.20/0.50  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.50  # Initial clauses                      : 18
% 0.20/0.50  # Removed in clause preprocessing      : 13
% 0.20/0.50  # Initial clauses in saturation        : 5
% 0.20/0.50  # Processed clauses                    : 4
% 0.20/0.50  # ...of these trivial                  : 0
% 0.20/0.50  # ...subsumed                          : 0
% 0.20/0.50  # ...remaining for further processing  : 4
% 0.20/0.50  # Other redundant clauses eliminated   : 0
% 0.20/0.50  # Clauses deleted for lack of memory   : 0
% 0.20/0.50  # Backward-subsumed                    : 1
% 0.20/0.50  # Backward-rewritten                   : 0
% 0.20/0.50  # Generated clauses                    : 1
% 0.20/0.50  # ...of the previous two non-redundant : 0
% 0.20/0.50  # ...aggressively subsumed             : 0
% 0.20/0.50  # Contextual simplify-reflections      : 1
% 0.20/0.50  # Paramodulations                      : 0
% 0.20/0.50  # Factorizations                       : 0
% 0.20/0.50  # NegExts                              : 0
% 0.20/0.50  # Equation resolutions                 : 0
% 0.20/0.50  # Disequality decompositions           : 0
% 0.20/0.50  # Total rewrite steps                  : 0
% 0.20/0.50  # ...of those cached                   : 0
% 0.20/0.50  # Propositional unsat checks           : 0
% 0.20/0.50  #    Propositional check models        : 0
% 0.20/0.50  #    Propositional check unsatisfiable : 0
% 0.20/0.50  #    Propositional clauses             : 0
% 0.20/0.50  #    Propositional clauses after purity: 0
% 0.20/0.50  #    Propositional unsat core size     : 0
% 0.20/0.50  #    Propositional preprocessing time  : 0.000
% 0.20/0.50  #    Propositional encoding time       : 0.000
% 0.20/0.50  #    Propositional solver time         : 0.000
% 0.20/0.50  #    Success case prop preproc time    : 0.000
% 0.20/0.50  #    Success case prop encoding time   : 0.000
% 0.20/0.50  #    Success case prop solver time     : 0.000
% 0.20/0.50  # Current number of processed clauses  : 2
% 0.20/0.50  #    Positive orientable unit clauses  : 1
% 0.20/0.50  #    Positive unorientable unit clauses: 0
% 0.20/0.50  #    Negative unit clauses             : 1
% 0.20/0.50  #    Non-unit-clauses                  : 0
% 0.20/0.50  # Current number of unprocessed clauses: 1
% 0.20/0.50  # ...number of literals in the above   : 1
% 0.20/0.50  # Current number of archived formulas  : 0
% 0.20/0.50  # Current number of archived clauses   : 2
% 0.20/0.50  # Clause-clause subsumption calls (NU) : 1
% 0.20/0.50  # Rec. Clause-clause subsumption calls : 1
% 0.20/0.50  # Non-unit clause-clause subsumptions  : 1
% 0.20/0.50  # Unit Clause-clause subsumption calls : 1
% 0.20/0.50  # Rewrite failures with RHS unbound    : 0
% 0.20/0.50  # BW rewrite match attempts            : 0
% 0.20/0.50  # BW rewrite match successes           : 0
% 0.20/0.50  # Condensation attempts                : 0
% 0.20/0.50  # Condensation successes               : 0
% 0.20/0.50  # Termbank termtop insertions          : 761
% 0.20/0.50  # Search garbage collected termcells   : 157
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.001 s
% 0.20/0.50  # System time              : 0.002 s
% 0.20/0.50  # Total time               : 0.004 s
% 0.20/0.50  # Maximum resident set size: 1800 pages
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.010 s
% 0.20/0.50  # System time              : 0.005 s
% 0.20/0.50  # Total time               : 0.015 s
% 0.20/0.50  # Maximum resident set size: 1736 pages
% 0.20/0.50  % E---3.1 exiting
% 0.20/0.50  % E exiting
%------------------------------------------------------------------------------