↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYO896^7 : 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 : n009.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:31 AM UTC 2026

% Result   : Theorem 0.08s 0.26s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   22 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :   85 (  12 equ;   0 cnn)
%            Maximal formula atoms :   15 (   3 avg)
%            Number of connectives :  133 (  18   ~;   9   |;   9   &;  88   @)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   16 (  16   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  11 usr;   3 con; 0-3 aty)
%            Number of variables   :   38 (  26   ^;   9   !;   3   ?;  38   :)

% 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_26,type,
    mnot: ( mworld > $o ) > mworld > $o ).

thf(decl_27,type,
    mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $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 @ ( mand @ ( mbox @ ( mimplies @ p @ q ) ) @ ( mbox @ ( mimplies @ p @ ( mnot @ q ) ) ) ) @ ( mnot @ ( mdia @ p ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.pGeKSIp2Jh/E---3.1_105972.p',con) ).

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

thf(mnot_def,axiom,
    ( mnot
    = ( ^ [X2: mworld > $o,X3: mworld] :
          ~ ( X2 @ X3 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.pGeKSIp2Jh/E---3.1_105972.p',mnot_def) ).

thf(mand_def,axiom,
    ( mand
    = ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
          ( ( X2 @ X3 )
          & ( X4 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.pGeKSIp2Jh/E---3.1_105972.p',mand_def) ).

thf(mimplies_def,axiom,
    ( mimplies
    = ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
          ( ( X2 @ X3 )
         => ( X4 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.pGeKSIp2Jh/E---3.1_105972.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.pGeKSIp2Jh/E---3.1_105972.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.pGeKSIp2Jh/E---3.1_105972.p',mdia_def) ).

thf(c_0_7,negated_conjecture,
    ~ ( mlocal @ ( mimplies @ ( mand @ ( mbox @ ( mimplies @ p @ q ) ) @ ( mbox @ ( mimplies @ p @ ( mnot @ q ) ) ) ) @ ( mnot @ ( mdia @ p ) ) ) ),
    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,
    ( mnot
    = ( ^ [Z0: mworld > $o,Z1: mworld] :
          ~ ( Z0 @ Z1 ) ) ),
    inference(fof_simplification,[status(thm)],[mnot_def]) ).

thf(c_0_10,plain,
    ( mand
    = ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
          ( ( Z0 @ Z2 )
          & ( Z1 @ Z2 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mand_def]) ).

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

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

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

thf(c_0_14,negated_conjecture,
    ~ ( ( ! [X6: mworld] :
            ( ( mrel @ mactual @ X6 )
           => ( ( p @ X6 )
             => ( q @ X6 ) ) )
        & ! [X7: mworld] :
            ( ( mrel @ mactual @ X7 )
           => ( ( p @ X7 )
             => ~ ( q @ X7 ) ) ) )
     => ~ ? [X8: mworld] :
            ( ( mrel @ mactual @ X8 )
            & ( p @ X8 ) ) ),
    inference(fof_simplification,[status(thm)],[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(apply_def,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10]),c_0_11]),c_0_12]),c_0_13])]) ).

thf(c_0_15,negated_conjecture,
    ! [X9: mworld,X10: mworld] :
      ( ( ~ ( mrel @ mactual @ X9 )
        | ~ ( p @ X9 )
        | ( q @ X9 ) )
      & ( ~ ( mrel @ mactual @ X10 )
        | ~ ( p @ X10 )
        | ~ ( q @ X10 ) )
      & ( mrel @ mactual @ esk1_0 )
      & ( p @ esk1_0 ) ),
    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_14])])])])]) ).

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

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

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

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

thf(c_0_20,negated_conjecture,
    p @ esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

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