↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n016.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:11:58 AM UTC 2026

% Result   : Theorem 0.23s 0.27s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   21 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :   55 (  11 equ;   0 cnn)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  120 (  18   ~;  14   |;   3   &;  80   @)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   32 (  32   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   12 (  10 usr;   3 con; 0-3 aty)
%            Number of variables   :   48 (  26   ^;  22   !;   0   ?;  48   :)

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

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

thf(decl_32,type,
    mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).

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

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

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

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

thf(decl_44,type,
    epred3_0: $i > $o ).

thf(decl_45,type,
    esk1_0: $i ).

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

thf(mimpl,axiom,
    ( mimpl
    = ( ^ [X7: $i > $o,X8: $i > $o] : ( mor @ ( mnot @ X7 ) @ X8 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.E3nPDg0xKh/E---3.1_85335.p',mimpl) ).

thf(mnot,axiom,
    ( mnot
    = ( ^ [X2: $i > $o,X3: $i] :
          ~ ( X2 @ X3 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.E3nPDg0xKh/E---3.1_85335.p',mnot) ).

thf(mor,axiom,
    ( mor
    = ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
          ( ( X4 @ X3 )
          | ( X5 @ X3 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.E3nPDg0xKh/E---3.1_85335.p',mor) ).

thf(thm,conjecture,
    ! [X10: $i > $i > $o,X19: $i > $o,X20: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ X10 @ ( mimpl @ X19 @ X20 ) ) @ ( mimpl @ ( mbox @ X10 @ X19 ) @ ( mbox @ X10 @ X20 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.E3nPDg0xKh/E---3.1_85335.p',thm) ).

thf(mbox,axiom,
    ( mbox
    = ( ^ [X10: $i > $i > $o,X11: $i > $o,X1: $i] :
        ! [X12: $i] :
          ( ( X10 @ X1 @ X12 )
         => ( X11 @ X12 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.E3nPDg0xKh/E---3.1_85335.p',mbox) ).

thf(mvalid,axiom,
    ( mvalid
    = ( ^ [X11: $i > $o] :
        ! [X15: $i] : ( X11 @ X15 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.E3nPDg0xKh/E---3.1_85335.p',mvalid) ).

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

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

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

thf(c_0_9,negated_conjecture,
    ~ ! [X10: $i > $i > $o,X19: $i > $o,X20: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ X10 @ ( mimpl @ X19 @ X20 ) ) @ ( mimpl @ ( mbox @ X10 @ X19 ) @ ( mbox @ X10 @ X20 ) ) ) ),
    inference(assume_negation,[status(cth)],[thm]) ).

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

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

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

thf(c_0_13,negated_conjecture,
    ~ ! [X10: $i > $i > $o,X19: $i > $o,X20: $i > $o,X27: $i] :
        ( ~ ! [X24: $i] :
              ( ( X10 @ X27 @ X24 )
             => ( ~ ( X19 @ X24 )
                | ( X20 @ X24 ) ) )
        | ~ ! [X25: $i] :
              ( ( X10 @ X27 @ X25 )
             => ( X19 @ X25 ) )
        | ! [X26: $i] :
            ( ( X10 @ X27 @ X26 )
           => ( X20 @ X26 ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]) ).

thf(c_0_14,negated_conjecture,
    ! [X32: $i,X33: $i] :
      ( ( ~ ( epred1_0 @ esk1_0 @ X32 )
        | ~ ( epred2_0 @ X32 )
        | ( epred3_0 @ X32 ) )
      & ( ~ ( epred1_0 @ esk1_0 @ X33 )
        | ( epred2_0 @ X33 ) )
      & ( epred1_0 @ esk1_0 @ esk2_0 )
      & ~ ( epred3_0 @ esk2_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_13])])])])]) ).

thf(c_0_15,negated_conjecture,
    ! [X1: $i] :
      ( ( epred3_0 @ X1 )
      | ~ ( epred1_0 @ esk1_0 @ X1 )
      | ~ ( epred2_0 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

thf(c_0_16,negated_conjecture,
    ! [X1: $i] :
      ( ( epred2_0 @ X1 )
      | ~ ( epred1_0 @ esk1_0 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

thf(c_0_17,negated_conjecture,
    ! [X1: $i] :
      ( ( epred3_0 @ X1 )
      | ~ ( epred1_0 @ esk1_0 @ X1 ) ),
    inference(csr,[status(thm)],[c_0_15,c_0_16]) ).

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

thf(c_0_19,negated_conjecture,
    ~ ( epred3_0 @ esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

thf(c_0_20,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
    [proof] ).

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