↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SYO887^22 : TPTP v9.3.1. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n001.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Sep 30 08:44:56 AM UTC 2026

% Result   : Theorem 0.08s 0.23s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   22 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :   68 (  10 equ;   0 cnn)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  137 (  14   ~;   9   |;   9   &;  99   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   14 (  14   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   12 (  10 usr;   2 con; 0-3 aty)
%            Number of variables   :   45 (  24   ^;  14   !;   7   ?;  45   :)

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

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

thf(decl_24,type,
    mactual: mworld ).

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

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

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

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

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

thf(decl_35,type,
    mexists_di: ( $i > mworld > $o ) > mworld > $o ).

thf(decl_36,type,
    f: $i > mworld > $o ).

thf(decl_38,type,
    esk2_1: mworld > $i ).

thf(con,conjecture,
    ( mlocal
    @ ( mimplies
      @ ( mbox
        @ ( mexists_di
          @ ^ [X7: $i] : ( f @ X7 ) ) )
      @ ( mexists_di
        @ ^ [X7: $i] : ( mdia @ ( f @ X7 ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.QEFDvsgx7P/E---3.1_1555404.p',con) ).

thf(mlocal_def,axiom,
    ( mlocal
    = ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.QEFDvsgx7P/E---3.1_1555404.p',mlocal_def) ).

thf(mimplies_def,axiom,
    ( mimplies
    = ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
          ( ( X2 @ X3 )
         => ( X4 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.QEFDvsgx7P/E---3.1_1555404.p',mimplies_def) ).

thf(mbox_def,axiom,
    ( mbox
    = ( ^ [X1: mworld > $o,X3: mworld] :
        ! [X5: mworld] :
          ( ( mrel @ X3 @ X5 )
         => ( X1 @ X5 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.QEFDvsgx7P/E---3.1_1555404.p',mbox_def) ).

thf(mdia_def,axiom,
    ( mdia
    = ( ^ [X1: mworld > $o,X3: mworld] :
        ? [X5: mworld] :
          ( ( mrel @ X3 @ X5 )
          & ( X1 @ X5 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.QEFDvsgx7P/E---3.1_1555404.p',mdia_def) ).

thf(mexists_di_def,axiom,
    ( mexists_di
    = ( ^ [X9: $i > mworld > $o,X3: mworld] :
        ? [X7: $i] :
          ( ( eiw_di @ X7 @ X3 )
          & ( X9 @ X7 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.QEFDvsgx7P/E---3.1_1555404.p',mexists_di_def) ).

thf(mrel_reflexive,axiom,
    ! [X3: mworld] : ( mrel @ X3 @ X3 ),
    file('/export/starexec/sandbox/tmp/tmp.QEFDvsgx7P/E---3.1_1555404.p',mrel_reflexive) ).

thf(c_0_7,negated_conjecture,
    ~ ( mlocal
      @ ( mimplies
        @ ( mbox
          @ ( mexists_di
            @ ^ [X7: $i] : ( f @ X7 ) ) )
        @ ( mexists_di
          @ ^ [X7: $i] : ( mdia @ ( f @ X7 ) ) ) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

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

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

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

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

thf(c_0_12,plain,
    ( mexists_di
    = ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
        ? [X7: $i] :
          ( ( eiw_di @ X7 @ Z1 )
          & ( Z0 @ X7 @ Z1 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mexists_di_def]) ).

thf(c_0_13,negated_conjecture,
    ~ ( ! [X20: mworld] :
          ( ( mrel @ mactual @ X20 )
         => ? [X19: $i] :
              ( ( eiw_di @ X19 @ X20 )
              & ( f @ X19 @ X20 ) ) )
     => ? [X22: $i] :
          ( ( eiw_di @ X22 @ mactual )
          & ? [X21: mworld] :
              ( ( mrel @ mactual @ X21 )
              & ( f @ X22 @ X21 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_7]),c_0_8]),c_0_9]),c_0_10]),c_0_11]),c_0_12]) ).

thf(c_0_14,negated_conjecture,
    ! [X32: mworld,X34: $i,X35: mworld] :
      ( ( ( eiw_di @ ( esk2_1 @ X32 ) @ X32 )
        | ~ ( mrel @ mactual @ X32 ) )
      & ( ( f @ ( esk2_1 @ X32 ) @ X32 )
        | ~ ( mrel @ mactual @ X32 ) )
      & ( ~ ( eiw_di @ X34 @ mactual )
        | ~ ( mrel @ mactual @ X35 )
        | ~ ( f @ X34 @ X35 ) ) ),
    inference(distribute,[status(thm)],[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_13])])])])])]) ).

thf(c_0_15,negated_conjecture,
    ! [X7: $i,X3: mworld] :
      ( ~ ( eiw_di @ X7 @ mactual )
      | ~ ( mrel @ mactual @ X3 )
      | ~ ( f @ X7 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

thf(c_0_16,negated_conjecture,
    ! [X3: mworld] :
      ( ( f @ ( esk2_1 @ X3 ) @ X3 )
      | ~ ( mrel @ mactual @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

thf(c_0_17,plain,
    ! [X23: mworld] : ( mrel @ X23 @ X23 ),
    inference(variable_rename,[status(thm)],[mrel_reflexive]) ).

thf(c_0_18,negated_conjecture,
    ! [X3: mworld] :
      ( ~ ( eiw_di @ ( esk2_1 @ X3 ) @ mactual )
      | ~ ( mrel @ mactual @ X3 ) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

thf(c_0_19,negated_conjecture,
    ! [X3: mworld] :
      ( ( eiw_di @ ( esk2_1 @ X3 ) @ X3 )
      | ~ ( mrel @ mactual @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

thf(c_0_20,plain,
    ! [X3: mworld] : ( mrel @ X3 @ X3 ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

thf(c_0_21,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO887^22 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.16  % Computer : n001.cluster.edu
% 0.08/0.16  % Model    : x86_64 x86_64
% 0.08/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.16  % Memory   : 8046.5625MB
% 0.08/0.16  % OS       : Linux 6.8.0-71-generic
% 0.08/0.16  % CPULimit : 300
% 0.08/0.17  % WCLimit  : 300
% 0.08/0.17  % DateTime : Tue Sep 29 17:31:36 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.17  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20  Running higher-order theorem proving
% 0.08/0.21  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/tmp/tmp.QEFDvsgx7P/E---3.1_1555404.p
% 0.08/0.23  % Version: 3.5.1-ho
% 0.08/0.23  % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.08/0.23  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.23  % Starting ho_unfolding_3 with 1500s (5) cores
% 0.08/0.23  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.08/0.23  % Starting almost_fo_3_lam with 300s (1) cores
% 0.08/0.23  % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.23  % ehoh_best2_full_lfho with pid 1555418 completed with status 0
% 0.08/0.23  % Result found by ehoh_best2_full_lfho
% 0.08/0.23  % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.08/0.23  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.23  % Starting ho_unfolding_3 with 1500s (5) cores
% 0.08/0.23  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.08/0.23  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.23  % No SInE strategy applied
% 0.08/0.23  % Search class: HHHNS-FFSF11-SHSSMFNN
% 0.08/0.23  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.23  % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.23  % SubtermCWHack with pid 1555422 completed with status 0
% 0.08/0.23  % Result found by SubtermCWHack
% 0.08/0.23  % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.08/0.23  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.23  % Starting ho_unfolding_3 with 1500s (5) cores
% 0.08/0.23  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.08/0.23  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.23  % No SInE strategy applied
% 0.08/0.23  % Search class: HHHNS-FFSF11-SHSSMFNN
% 0.08/0.23  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.23  % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.23  % Preprocessing time       : 0.001 s
% 0.08/0.23  
% 0.08/0.23  % Proof found!
% 0.08/0.23  % SZS status Theorem
% 0.08/0.23  % SZS output start CNFRefutation
% See solution above
% 0.08/0.23  % Parsed axioms                        : 30
% 0.08/0.23  % Removed by relevancy pruning/SinE    : 0
% 0.08/0.23  % Initial clauses                      : 22
% 0.08/0.23  % Removed in clause preprocessing      : 15
% 0.08/0.23  % Initial clauses in saturation        : 7
% 0.08/0.23  % Processed clauses                    : 8
% 0.08/0.23  % ...of these trivial                  : 0
% 0.08/0.23  % ...subsumed                          : 0
% 0.08/0.23  % ...remaining for further processing  : 8
% 0.08/0.23  % Other redundant clauses eliminated   : 0
% 0.08/0.23  % Clauses deleted for lack of memory   : 0
% 0.08/0.23  % Backward-subsumed                    : 0
% 0.08/0.23  % Backward-rewritten                   : 0
% 0.08/0.23  % Generated clauses                    : 4
% 0.08/0.23  % ...of the previous two non-redundant : 1
% 0.08/0.23  % ...aggressively subsumed             : 0
% 0.08/0.23  % Contextual simplify-reflections      : 0
% 0.08/0.23  % Paramodulations                      : 4
% 0.08/0.23  % Factorizations                       : 0
% 0.08/0.23  % NegExts                              : 0
% 0.08/0.23  % Equation resolutions                 : 0
% 0.08/0.23  % Disequality decompositions           : 0
% 0.08/0.23  % Total rewrite steps                  : 1
% 0.08/0.23  % ...of those cached                   : 0
% 0.08/0.23  % Propositional unsat checks           : 0
% 0.08/0.23  %    Propositional check models        : 0
% 0.08/0.23  %    Propositional check unsatisfiable : 0
% 0.08/0.23  %    Propositional clauses             : 0
% 0.08/0.23  %    Propositional clauses after purity: 0
% 0.08/0.23  %    Propositional unsat core size     : 0
% 0.08/0.23  %    Propositional preprocessing time  : 0.000
% 0.08/0.23  %    Propositional encoding time       : 0.000
% 0.08/0.23  %    Propositional solver time         : 0.000
% 0.08/0.23  %    Success case prop preproc time    : 0.000
% 0.08/0.23  %    Success case prop encoding time   : 0.000
% 0.08/0.23  %    Success case prop solver time     : 0.000
% 0.08/0.23  % Current number of processed clauses  : 8
% 0.08/0.23  %    Positive orientable unit clauses  : 2
% 0.08/0.23  %    Positive unorientable unit clauses: 0
% 0.08/0.23  %    Negative unit clauses             : 0
% 0.08/0.23  %    Non-unit-clauses                  : 6
% 0.08/0.23  % Current number of unprocessed clauses: 0
% 0.08/0.23  % ...number of literals in the above   : 0
% 0.08/0.23  % Current number of archived formulas  : 0
% 0.08/0.23  % Current number of archived clauses   : 0
% 0.08/0.23  % Clause-clause subsumption calls (NU) : 2
% 0.08/0.23  % Rec. Clause-clause subsumption calls : 1
% 0.08/0.23  % Non-unit clause-clause subsumptions  : 0
% 0.08/0.23  % Unit Clause-clause subsumption calls : 0
% 0.08/0.23  % Rewrite failures with RHS unbound    : 0
% 0.08/0.23  % BW rewrite match attempts            : 0
% 0.08/0.23  % BW rewrite match successes           : 0
% 0.08/0.23  % Condensation attempts                : 0
% 0.08/0.23  % Condensation successes               : 0
% 0.08/0.23  % Termbank termtop insertions          : 1289
% 0.08/0.23  % Search garbage collected termcells   : 282
% 0.08/0.23  
% 0.08/0.23  % -------------------------------------------------
% 0.08/0.23  % User time                : 0.004 s
% 0.08/0.23  % System time              : 0.001 s
% 0.08/0.23  % Total time               : 0.006 s
% 0.08/0.23  % Maximum resident set size: 3604 pages
% 0.08/0.23  
% 0.08/0.23  % -------------------------------------------------
% 0.08/0.23  % User time                : 0.006 s
% 0.08/0.23  % System time              : 0.005 s
% 0.08/0.23  % Total time               : 0.012 s
% 0.08/0.23  % Maximum resident set size: 4864 pages
% 0.08/0.23  % E exiting
%------------------------------------------------------------------------------