↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n004.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:43:32 AM UTC 2026

% Result   : Theorem 0.09s 0.24s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   77 (   8 equ;   0 cnn)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  135 (  17   ~;  11   |;   7   &;  91   @)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   10 (  10   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   9 usr;   3 con; 0-3 aty)
%            Number of variables   :   35 (  16   ^;  15   !;   4   ?;  35   :)

% 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,
    p: mworld > $o ).

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

thf(decl_35,type,
    esk1_0: mworld ).

thf(con,conjecture,
    mlocal @ ( mimplies @ ( mdia @ ( mimplies @ p @ ( mbox @ q ) ) ) @ ( mimplies @ ( mbox @ p ) @ ( mdia @ q ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.5JymrESyTB/E---3.1_1602468.p',con) ).

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

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

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

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

thf(mrel_reflexive,axiom,
    ! [X3: mworld] : ( mrel @ X3 @ X3 ),
    file('/export/starexec/sandbox2/tmp/tmp.5JymrESyTB/E---3.1_1602468.p',mrel_reflexive) ).

thf(c_0_6,negated_conjecture,
    ~ ( mlocal @ ( mimplies @ ( mdia @ ( mimplies @ p @ ( mbox @ q ) ) ) @ ( mimplies @ ( mbox @ p ) @ ( mdia @ q ) ) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

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

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

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

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

thf(c_0_11,negated_conjecture,
    ~ ( ? [X8: mworld] :
          ( ( mrel @ mactual @ X8 )
          & ( ( p @ X8 )
           => ! [X7: mworld] :
                ( ( mrel @ X8 @ X7 )
               => ( q @ X7 ) ) ) )
     => ( ! [X9: mworld] :
            ( ( mrel @ mactual @ X9 )
           => ( p @ 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)],[c_0_6,c_0_7]),c_0_8]),c_0_9]),c_0_10]) ).

thf(c_0_12,negated_conjecture,
    ! [X13: mworld,X14: mworld,X15: mworld] :
      ( ( mrel @ mactual @ esk1_0 )
      & ( ~ ( p @ esk1_0 )
        | ~ ( mrel @ esk1_0 @ X13 )
        | ( q @ X13 ) )
      & ( ~ ( mrel @ mactual @ X14 )
        | ( p @ 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_11])])])])]) ).

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

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

thf(c_0_15,negated_conjecture,
    ! [X3: mworld] :
      ( ~ ( mrel @ mactual @ X3 )
      | ~ ( mrel @ esk1_0 @ X3 )
      | ~ ( p @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

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

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

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

thf(c_0_19,negated_conjecture,
    ! [X3: mworld] :
      ( ~ ( mrel @ mactual @ X3 )
      | ~ ( mrel @ esk1_0 @ X3 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).

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

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

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