↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LCL953^8 : 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 : 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:12:53 AM UTC 2026

% Result   : Theorem 0.22s 0.27s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   12 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   92 (   4 equ;   0 cnn)
%            Maximal formula atoms :   13 (   7 avg)
%            Number of connectives :  140 (   9   ~;   0   |;   0   &; 125   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (  11 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :    6 (   6   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   8 usr;   1 con; 0-3 aty)
%            Number of variables   :   32 (  32   ^;   0   !;   0   ?;  32   :)

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

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

thf(decl_26,type,
    mnot: ( 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_34,type,
    mforall_di: ( $i > mworld > $o ) > mworld > $o ).

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

thf(decl_37,type,
    disjoint: $i > $i > mworld > $o ).

thf(decl_39,type,
    singleton: $i > $i ).

thf(t56_zfmisc_1,conjecture,
    ( mlocal
    @ ( mbox
      @ ( mforall_di
        @ ^ [X15: $i] :
            ( mbox
            @ ( mforall_di
              @ ^ [X16: $i] : ( mbox @ ( mimplies @ ( mbox @ ( mnot @ ( mbox @ ( in @ X15 @ X16 ) ) ) ) @ ( mbox @ ( disjoint @ ( singleton @ X15 ) @ X16 ) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.FPp5wUTpqL/E---3.1_1142547.p',t56_zfmisc_1) ).

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

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

thf(l28_zfmisc_1,axiom,
    ( mlocal
    @ ( mbox
      @ ( mforall_di
        @ ^ [X17: $i] :
            ( mbox
            @ ( mforall_di
              @ ^ [X18: $i] : ( mbox @ ( mimplies @ ( mbox @ ( mnot @ ( mbox @ ( in @ X17 @ X18 ) ) ) ) @ ( mbox @ ( disjoint @ ( singleton @ X17 ) @ X18 ) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.FPp5wUTpqL/E---3.1_1142547.p',l28_zfmisc_1) ).

thf(c_0_4,negated_conjecture,
    ~ ( mlocal
      @ ( mbox
        @ ( mforall_di
          @ ^ [X15: $i] :
              ( mbox
              @ ( mforall_di
                @ ^ [X16: $i] : ( mbox @ ( mimplies @ ( mbox @ ( mnot @ ( mbox @ ( in @ X15 @ X16 ) ) ) ) @ ( mbox @ ( disjoint @ ( singleton @ X15 ) @ X16 ) ) ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[t56_zfmisc_1]) ).

thf(c_0_5,plain,
    ( mnot
    = ( ^ [Z0: mworld > $o,Z1: mworld] :
          ~ ( Z0 @ Z1 ) ) ),
    inference(fof_simplification,[status(thm)],[mnot_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,negated_conjecture,
    ~ ( mlocal
      @ ( mbox
        @ ( mforall_di
          @ ^ [Z0: $i] :
              ( mbox
              @ ( mforall_di
                @ ^ [Z1: $i] :
                    ( mbox
                    @ ^ [Z2: mworld] :
                        ( ( mbox
                          @ ^ [Z3: mworld] :
                              ~ ( mbox @ ( in @ Z0 @ Z1 ) @ Z3 )
                          @ Z2 )
                       => ( mbox @ ( disjoint @ ( singleton @ Z0 ) @ Z1 ) @ Z2 ) ) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4]),c_0_5]),c_0_6])]) ).

thf(c_0_8,plain,
    ( mlocal
    @ ( mbox
      @ ( mforall_di
        @ ^ [Z0: $i] :
            ( mbox
            @ ( mforall_di
              @ ^ [Z1: $i] :
                  ( mbox
                  @ ^ [Z2: mworld] :
                      ( ( mbox
                        @ ^ [Z3: mworld] :
                            ~ ( mbox @ ( in @ Z0 @ Z1 ) @ Z3 )
                        @ Z2 )
                     => ( mbox @ ( disjoint @ ( singleton @ Z0 ) @ Z1 ) @ Z2 ) ) ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[l28_zfmisc_1]),c_0_5]),c_0_6]) ).

thf(c_0_9,negated_conjecture,
    ~ ( mlocal
      @ ( mbox
        @ ( mforall_di
          @ ^ [Z0: $i] :
              ( mbox
              @ ( mforall_di
                @ ^ [Z1: $i] :
                    ( mbox
                    @ ^ [Z2: mworld] :
                        ( ( mbox
                          @ ^ [Z3: mworld] :
                              ~ ( mbox @ ( in @ Z0 @ Z1 ) @ Z3 )
                          @ Z2 )
                       => ( mbox @ ( disjoint @ ( singleton @ Z0 ) @ Z1 ) @ Z2 ) ) ) ) ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_10,plain,
    ( mlocal
    @ ( mbox
      @ ( mforall_di
        @ ^ [Z0: $i] :
            ( mbox
            @ ( mforall_di
              @ ^ [Z1: $i] :
                  ( mbox
                  @ ^ [Z2: mworld] :
                      ( ( mbox
                        @ ^ [Z3: mworld] :
                            ~ ( mbox @ ( in @ Z0 @ Z1 ) @ Z3 )
                        @ Z2 )
                     => ( mbox @ ( disjoint @ ( singleton @ Z0 ) @ Z1 ) @ Z2 ) ) ) ) ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL953^8 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.19  % Computer : n004.cluster.edu
% 0.07/0.19  % Model    : x86_64 x86_64
% 0.07/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19  % Memory   : 8046.5625MB
% 0.07/0.19  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Tue Sep 29 10:53:06 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.23  Running higher-order theorem proving
% 0.07/0.25  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.FPp5wUTpqL/E---3.1_1142547.p
% 0.22/0.27  % Version: 3.5.1-ho
% 0.22/0.27  % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.22/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.22/0.27  % Starting post_as_ho3 with 300s (1) cores
% 0.22/0.27  % Starting new_ho_12 with 300s (1) cores
% 0.22/0.27  % Starting new_bool_2 with 300s (1) cores
% 0.22/0.27  % new_bool_2 with pid 1142580 completed with status 0
% 0.22/0.27  % Result found by new_bool_2
% 0.22/0.27  % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.22/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.22/0.27  % Starting post_as_ho3 with 300s (1) cores
% 0.22/0.27  % Starting new_ho_12 with 300s (1) cores
% 0.22/0.27  % Starting new_bool_2 with 300s (1) cores
% 0.22/0.27  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/0.27  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.27  % Search class: HUUNF-FFSS11-DHSSMFNN
% 0.22/0.27  % partial match(3): HGUNF-FFSF11-SHSSMFNN
% 0.22/0.27  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.27  % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.27  % SubtermCWHack with pid 1142582 completed with status 0
% 0.22/0.27  % Result found by SubtermCWHack
% 0.22/0.27  % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.22/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.22/0.27  % Starting post_as_ho3 with 300s (1) cores
% 0.22/0.27  % Starting new_ho_12 with 300s (1) cores
% 0.22/0.27  % Starting new_bool_2 with 300s (1) cores
% 0.22/0.27  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/0.27  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.27  % Search class: HUUNF-FFSS11-DHSSMFNN
% 0.22/0.27  % partial match(3): HGUNF-FFSF11-SHSSMFNN
% 0.22/0.27  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.27  % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.27  % Preprocessing time       : 0.001 s
% 0.22/0.27  
% 0.22/0.27  % Proof found!
% 0.22/0.27  % SZS status Theorem
% 0.22/0.27  % SZS output start CNFRefutation
% See solution above
% 0.22/0.27  % Parsed axioms                        : 36
% 0.22/0.27  % Removed by relevancy pruning/SinE    : 30
% 0.22/0.27  % Initial clauses                      : 4
% 0.22/0.27  % Removed in clause preprocessing      : 0
% 0.22/0.27  % Initial clauses in saturation        : 4
% 0.22/0.27  % Processed clauses                    : 4
% 0.22/0.27  % ...of these trivial                  : 0
% 0.22/0.27  % ...subsumed                          : 0
% 0.22/0.27  % ...remaining for further processing  : 3
% 0.22/0.27  % Other redundant clauses eliminated   : 0
% 0.22/0.27  % Clauses deleted for lack of memory   : 0
% 0.22/0.27  % Backward-subsumed                    : 0
% 0.22/0.27  % Backward-rewritten                   : 0
% 0.22/0.27  % Generated clauses                    : 0
% 0.22/0.27  % ...of the previous two non-redundant : 0
% 0.22/0.27  % ...aggressively subsumed             : 0
% 0.22/0.27  % Contextual simplify-reflections      : 0
% 0.22/0.27  % Paramodulations                      : 0
% 0.22/0.27  % Factorizations                       : 0
% 0.22/0.27  % NegExts                              : 0
% 0.22/0.27  % Equation resolutions                 : 0
% 0.22/0.27  % Disequality decompositions           : 0
% 0.22/0.27  % Total rewrite steps                  : 1
% 0.22/0.27  % ...of those cached                   : 0
% 0.22/0.27  % Propositional unsat checks           : 0
% 0.22/0.27  %    Propositional check models        : 0
% 0.22/0.27  %    Propositional check unsatisfiable : 0
% 0.22/0.27  %    Propositional clauses             : 0
% 0.22/0.27  %    Propositional clauses after purity: 0
% 0.22/0.27  %    Propositional unsat core size     : 0
% 0.22/0.27  %    Propositional preprocessing time  : 0.000
% 0.22/0.27  %    Propositional encoding time       : 0.000
% 0.22/0.27  %    Propositional solver time         : 0.000
% 0.22/0.27  %    Success case prop preproc time    : 0.000
% 0.22/0.27  %    Success case prop encoding time   : 0.000
% 0.22/0.27  %    Success case prop solver time     : 0.000
% 0.22/0.27  % Current number of processed clauses  : 3
% 0.22/0.27  %    Positive orientable unit clauses  : 3
% 0.22/0.27  %    Positive unorientable unit clauses: 0
% 0.22/0.27  %    Negative unit clauses             : 0
% 0.22/0.27  %    Non-unit-clauses                  : 0
% 0.22/0.27  % Current number of unprocessed clauses: 0
% 0.22/0.27  % ...number of literals in the above   : 0
% 0.22/0.27  % Current number of archived formulas  : 0
% 0.22/0.27  % Current number of archived clauses   : 0
% 0.22/0.27  % Clause-clause subsumption calls (NU) : 0
% 0.22/0.27  % Rec. Clause-clause subsumption calls : 0
% 0.22/0.27  % Non-unit clause-clause subsumptions  : 0
% 0.22/0.27  % Unit Clause-clause subsumption calls : 0
% 0.22/0.27  % Rewrite failures with RHS unbound    : 0
% 0.22/0.27  % BW rewrite match attempts            : 3
% 0.22/0.27  % BW rewrite match successes           : 0
% 0.22/0.27  % Condensation attempts                : 0
% 0.22/0.27  % Condensation successes               : 0
% 0.22/0.27  % Termbank termtop insertions          : 4328
% 0.22/0.27  % Search garbage collected termcells   : 154
% 0.22/0.27  
% 0.22/0.27  % -------------------------------------------------
% 0.22/0.27  % User time                : 0.005 s
% 0.22/0.27  % System time              : 0.002 s
% 0.22/0.27  % Total time               : 0.007 s
% 0.22/0.27  % Maximum resident set size: 3636 pages
% 0.22/0.27  
% 0.22/0.27  % -------------------------------------------------
% 0.22/0.27  % User time                : 0.009 s
% 0.22/0.27  % System time              : 0.004 s
% 0.22/0.27  % Total time               : 0.013 s
% 0.22/0.27  % Maximum resident set size: 4864 pages
% 0.22/0.27  % E exiting
%------------------------------------------------------------------------------