↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LCL706^1 : TPTP v9.3.1. Bugfixed v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n011.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:03 AM UTC 2026

% Result   : Theorem 0.12s 0.28s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   27 (  18 unt;   0 typ;   0 def)
%            Number of atoms       :   70 (  15 equ;   0 cnn)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :  182 (  25   ~;  21   |;   7   &; 123   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   41 (  41   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   14 (  12 usr;   3 con; 0-3 aty)
%            Number of variables   :   73 (  34   ^;  36   !;   3   ?;  73   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_25,type,
    mnot: ( $i > $o ) > $i > $o ).

thf(decl_26,type,
    mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).

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

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

thf(decl_38,type,
    mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).

thf(decl_47,type,
    mweakly_dense: ( $i > $i > $o ) > $o ).

thf(decl_50,type,
    mvalid: ( $i > $o ) > $o ).

thf(decl_54,type,
    epred1_0: $i > $i > $o ).

thf(decl_55,type,
    esk1_2: $i > $i > $i ).

thf(decl_56,type,
    esk2_0: $i ).

thf(decl_57,type,
    epred2_0: $i > $o ).

thf(decl_58,type,
    esk3_0: $i ).

thf(mimplies,axiom,
    ( mimplies
    = ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.0lqVwwTljz/E---3.1_4068512.p',mimplies) ).

thf(mnot,axiom,
    ( mnot
    = ( ^ [X6: $i > $o,X3: $i] :
          ~ ( X6 @ X3 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.0lqVwwTljz/E---3.1_4068512.p',mnot) ).

thf(mor,axiom,
    ( mor
    = ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
          ( ( X6 @ X3 )
          | ( X7 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.0lqVwwTljz/E---3.1_4068512.p',mor) ).

thf(conj,conjecture,
    ! [X13: $i > $i > $o] :
      ( ( mweakly_dense @ X13 )
     => ( mvalid
        @ ( mforall_prop
          @ ^ [X18: $i > $o] : ( mimplies @ ( mbox @ X13 @ ( mbox @ X13 @ X18 ) ) @ ( mbox @ X13 @ X18 ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.0lqVwwTljz/E---3.1_4068512.p',conj) ).

thf(mforall_prop,axiom,
    ( mforall_prop
    = ( ^ [X9: ( $i > $o ) > $i > $o,X3: $i] :
        ! [X10: $i > $o] : ( X9 @ X10 @ X3 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.0lqVwwTljz/E---3.1_4068512.p',mforall_prop) ).

thf(mbox,axiom,
    ( mbox
    = ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
        ! [X14: $i] :
          ( ~ ( X13 @ X3 @ X14 )
          | ( X6 @ X14 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.0lqVwwTljz/E---3.1_4068512.p',mbox) ).

thf(mweakly_dense,axiom,
    ( mweakly_dense
    = ( ^ [X13: $i > $i > $o] :
        ! [X15: $i,X16: $i,X17: $i] :
          ( ( X13 @ X15 @ X16 )
         => ? [X17: $i] :
              ( ( X13 @ X15 @ X17 )
              & ( X13 @ X17 @ X16 ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.0lqVwwTljz/E---3.1_4068512.p',mweakly_dense) ).

thf(mvalid,axiom,
    ( mvalid
    = ( ^ [X6: $i > $o] :
        ! [X3: $i] : ( X6 @ X3 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.0lqVwwTljz/E---3.1_4068512.p',mvalid) ).

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

thf(c_0_9,plain,
    ( mnot
    = ( ^ [Z0: $i > $o,Z1: $i] :
          ~ ( Z0 @ Z1 ) ) ),
    inference(fof_simplification,[status(thm)],[mnot]) ).

thf(c_0_10,plain,
    ( mor
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
          ( ( Z0 @ Z2 )
          | ( Z1 @ Z2 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mor]) ).

thf(c_0_11,negated_conjecture,
    ~ ! [X13: $i > $i > $o] :
        ( ( mweakly_dense @ X13 )
       => ( mvalid
          @ ( mforall_prop
            @ ^ [X18: $i > $o] : ( mimplies @ ( mbox @ X13 @ ( mbox @ X13 @ X18 ) ) @ ( mbox @ X13 @ X18 ) ) ) ) ),
    inference(assume_negation,[status(cth)],[conj]) ).

thf(c_0_12,plain,
    ( mimplies
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
          ( ~ ( Z0 @ Z2 )
          | ( Z1 @ Z2 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).

thf(c_0_13,plain,
    ( mforall_prop
    = ( ^ [Z0: ( $i > $o ) > $i > $o,Z1: $i] :
        ! [X10: $i > $o] : ( Z0 @ X10 @ Z1 ) ) ),
    inference(fof_simplification,[status(thm)],[mforall_prop]) ).

thf(c_0_14,plain,
    ( mbox
    = ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
        ! [X14: $i] :
          ( ~ ( Z0 @ Z2 @ X14 )
          | ( Z1 @ X14 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mbox]) ).

thf(c_0_15,plain,
    ( mweakly_dense
    = ( ^ [Z0: $i > $i > $o] :
        ! [X15: $i,X16: $i,X17: $i] :
          ( ( Z0 @ X15 @ X16 )
         => ? [X17: $i] :
              ( ( Z0 @ X15 @ X17 )
              & ( Z0 @ X17 @ X16 ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[mweakly_dense]) ).

thf(c_0_16,plain,
    ( mvalid
    = ( ^ [Z0: $i > $o] :
        ! [X3: $i] : ( Z0 @ X3 ) ) ),
    inference(fof_simplification,[status(thm)],[mvalid]) ).

thf(c_0_17,negated_conjecture,
    ~ ! [X13: $i > $i > $o] :
        ( ! [X23: $i,X24: $i,X25: $i] :
            ( ( X13 @ X23 @ X24 )
           => ? [X26: $i] :
                ( ( X13 @ X23 @ X26 )
                & ( X13 @ X26 @ X24 ) ) )
       => ! [X31: $i,X30: $i > $o] :
            ( ~ ! [X28: $i] :
                  ( ~ ( X13 @ X31 @ X28 )
                  | ! [X27: $i] :
                      ( ~ ( X13 @ X28 @ X27 )
                      | ( X30 @ X27 ) ) )
            | ! [X29: $i] :
                ( ~ ( X13 @ X31 @ X29 )
                | ( X30 @ X29 ) ) ) ),
    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_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16]) ).

thf(c_0_18,negated_conjecture,
    ! [X33: $i,X34: $i,X38: $i,X39: $i] :
      ( ( ( epred1_0 @ X33 @ ( esk1_2 @ X33 @ X34 ) )
        | ~ ( epred1_0 @ X33 @ X34 ) )
      & ( ( epred1_0 @ ( esk1_2 @ X33 @ X34 ) @ X34 )
        | ~ ( epred1_0 @ X33 @ X34 ) )
      & ( ~ ( epred1_0 @ esk2_0 @ X38 )
        | ~ ( epred1_0 @ X38 @ X39 )
        | ( epred2_0 @ X39 ) )
      & ( epred1_0 @ esk2_0 @ esk3_0 )
      & ~ ( epred2_0 @ esk3_0 ) ),
    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)],[inference(fof_simplification,[status(thm)],[c_0_17])])])])])])]) ).

thf(c_0_19,negated_conjecture,
    ! [X3: $i,X14: $i] :
      ( ( epred2_0 @ X14 )
      | ~ ( epred1_0 @ esk2_0 @ X3 )
      | ~ ( epred1_0 @ X3 @ X14 ) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

thf(c_0_20,negated_conjecture,
    ! [X3: $i,X14: $i] :
      ( ( epred1_0 @ X3 @ ( esk1_2 @ X3 @ X14 ) )
      | ~ ( epred1_0 @ X3 @ X14 ) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

thf(c_0_21,negated_conjecture,
    ! [X3: $i,X14: $i] :
      ( ( epred2_0 @ X3 )
      | ~ ( epred1_0 @ ( esk1_2 @ esk2_0 @ X14 ) @ X3 )
      | ~ ( epred1_0 @ esk2_0 @ X14 ) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

thf(c_0_22,negated_conjecture,
    ! [X3: $i,X14: $i] :
      ( ( epred1_0 @ ( esk1_2 @ X3 @ X14 ) @ X14 )
      | ~ ( epred1_0 @ X3 @ X14 ) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

thf(c_0_23,negated_conjecture,
    ! [X3: $i] :
      ( ( epred2_0 @ X3 )
      | ~ ( epred1_0 @ esk2_0 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

thf(c_0_24,negated_conjecture,
    epred1_0 @ esk2_0 @ esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

thf(c_0_25,negated_conjecture,
    ~ ( epred2_0 @ esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

thf(c_0_26,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL706^1 : TPTP v9.3.1. Bugfixed v5.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.18  % Computer : n011.cluster.edu
% 0.12/0.18  % Model    : x86_64 x86_64
% 0.12/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.18  % Memory   : 8046.5625MB
% 0.12/0.18  % OS       : Linux 6.8.0-71-generic
% 0.12/0.18  % CPULimit : 300
% 0.12/0.18  % WCLimit  : 300
% 0.12/0.18  % DateTime : Tue Sep 29 09:45:16 UTC 2026
% 0.12/0.19  % CPUTime  : 
% 0.12/0.19  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.23  Running higher-order theorem proving
% 0.12/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.0lqVwwTljz/E---3.1_4068512.p
% 0.12/0.28  % Version: 3.5.1-ho
% 0.12/0.28  % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.12/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.28  % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.12/0.28  % Starting lpo9_lambda_fix with 300s (1) cores
% 0.12/0.28  % Starting sh5l with 300s (1) cores
% 0.12/0.28  % Starting ho_unfolding_6 with 300s (1) cores
% 0.12/0.28  % ho_unfolding_6 with pid 4068563 completed with status 0
% 0.12/0.28  % Result found by ho_unfolding_6
% 0.12/0.28  % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.12/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.28  % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.12/0.28  % Starting lpo9_lambda_fix with 300s (1) cores
% 0.12/0.28  % Starting sh5l with 300s (1) cores
% 0.12/0.28  % Starting ho_unfolding_6 with 300s (1) cores
% 0.12/0.28  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.28  % No SInE strategy applied
% 0.12/0.28  % Search class: HHUNF-FFSF22-SHHSMFNN
% 0.12/0.28  % partial match(2): HHUNF-FFSF00-SHHSMFNN
% 0.12/0.28  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.28  % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.28  % SubtermCWHack with pid 4068572 completed with status 0
% 0.12/0.28  % Result found by SubtermCWHack
% 0.12/0.28  % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.12/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.28  % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.12/0.28  % Starting lpo9_lambda_fix with 300s (1) cores
% 0.12/0.28  % Starting sh5l with 300s (1) cores
% 0.12/0.28  % Starting ho_unfolding_6 with 300s (1) cores
% 0.12/0.28  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.28  % No SInE strategy applied
% 0.12/0.28  % Search class: HHUNF-FFSF22-SHHSMFNN
% 0.12/0.28  % partial match(2): HHUNF-FFSF00-SHHSMFNN
% 0.12/0.28  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.28  % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.28  % Preprocessing time       : 0.001 s
% 0.12/0.28  
% 0.12/0.28  % Proof found!
% 0.12/0.28  % SZS status Theorem
% 0.12/0.28  % SZS output start CNFRefutation
% See solution above
% 0.12/0.28  % Parsed axioms                        : 64
% 0.12/0.28  % Removed by relevancy pruning/SinE    : 0
% 0.12/0.28  % Initial clauses                      : 37
% 0.12/0.28  % Removed in clause preprocessing      : 32
% 0.12/0.28  % Initial clauses in saturation        : 5
% 0.12/0.28  % Processed clauses                    : 9
% 0.12/0.28  % ...of these trivial                  : 0
% 0.12/0.28  % ...subsumed                          : 0
% 0.12/0.28  % ...remaining for further processing  : 9
% 0.12/0.28  % Other redundant clauses eliminated   : 0
% 0.12/0.28  % Clauses deleted for lack of memory   : 0
% 0.12/0.28  % Backward-subsumed                    : 0
% 0.12/0.28  % Backward-rewritten                   : 0
% 0.12/0.28  % Generated clauses                    : 7
% 0.12/0.28  % ...of the previous two non-redundant : 6
% 0.12/0.28  % ...aggressively subsumed             : 0
% 0.12/0.28  % Contextual simplify-reflections      : 0
% 0.12/0.28  % Paramodulations                      : 7
% 0.12/0.28  % Factorizations                       : 0
% 0.12/0.28  % NegExts                              : 0
% 0.12/0.28  % Equation resolutions                 : 0
% 0.12/0.28  % Disequality decompositions           : 0
% 0.12/0.28  % Total rewrite steps                  : 0
% 0.12/0.28  % ...of those cached                   : 0
% 0.12/0.28  % Propositional unsat checks           : 0
% 0.12/0.28  %    Propositional check models        : 0
% 0.12/0.28  %    Propositional check unsatisfiable : 0
% 0.12/0.28  %    Propositional clauses             : 0
% 0.12/0.28  %    Propositional clauses after purity: 0
% 0.12/0.28  %    Propositional unsat core size     : 0
% 0.12/0.28  %    Propositional preprocessing time  : 0.000
% 0.12/0.28  %    Propositional encoding time       : 0.000
% 0.12/0.28  %    Propositional solver time         : 0.000
% 0.12/0.28  %    Success case prop preproc time    : 0.000
% 0.12/0.28  %    Success case prop encoding time   : 0.000
% 0.12/0.28  %    Success case prop solver time     : 0.000
% 0.12/0.28  % Current number of processed clauses  : 9
% 0.12/0.28  %    Positive orientable unit clauses  : 1
% 0.12/0.28  %    Positive unorientable unit clauses: 0
% 0.12/0.28  %    Negative unit clauses             : 1
% 0.12/0.28  %    Non-unit-clauses                  : 7
% 0.12/0.28  % Current number of unprocessed clauses: 1
% 0.12/0.28  % ...number of literals in the above   : 3
% 0.12/0.28  % Current number of archived formulas  : 0
% 0.12/0.28  % Current number of archived clauses   : 0
% 0.12/0.28  % Clause-clause subsumption calls (NU) : 8
% 0.12/0.28  % Rec. Clause-clause subsumption calls : 8
% 0.12/0.28  % Non-unit clause-clause subsumptions  : 0
% 0.12/0.28  % Unit Clause-clause subsumption calls : 0
% 0.12/0.28  % Rewrite failures with RHS unbound    : 0
% 0.12/0.28  % BW rewrite match attempts            : 0
% 0.12/0.28  % BW rewrite match successes           : 0
% 0.12/0.28  % Condensation attempts                : 0
% 0.12/0.28  % Condensation successes               : 0
% 0.12/0.28  % Termbank termtop insertions          : 2510
% 0.12/0.28  % Search garbage collected termcells   : 611
% 0.12/0.28  
% 0.12/0.28  % -------------------------------------------------
% 0.12/0.28  % User time                : 0.003 s
% 0.12/0.28  % System time              : 0.004 s
% 0.12/0.28  % Total time               : 0.006 s
% 0.12/0.28  % Maximum resident set size: 3696 pages
% 0.12/0.28  
% 0.12/0.28  % -------------------------------------------------
% 0.12/0.28  % User time                : 0.006 s
% 0.12/0.28  % System time              : 0.008 s
% 0.12/0.28  % Total time               : 0.014 s
% 0.12/0.28  % Maximum resident set size: 4608 pages
% 0.12/0.28  % E exiting
%------------------------------------------------------------------------------