TSTP Solution File: LCL591^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : LCL591^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n021.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 23:46:55 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(decl_33,type,
    mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).

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

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

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

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

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

thf(mbox,axiom,
    ( mbox
    = ( ^ [X10: $i > $i > $o,X11: $i > $o,X1: $i] :
        ! [X12: $i] :
          ( ( X10 @ X1 @ X12 )
         => ( X11 @ X12 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mbox) ).

thf(mvalid,axiom,
    ( mvalid
    = ( ^ [X11: $i > $o] :
        ! [X15: $i] : ( X11 @ X15 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mvalid) ).

thf(thm,conjecture,
    ! [X10: $i > $i > $o,X19: $i > $o] :
      ( ( mvalid @ X19 )
     => ( mvalid @ ( mbox @ X10 @ X19 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).

thf(c_0_3,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_4,plain,
    ( mvalid
    = ( ^ [Z0: $i > $o] :
        ! [X15: $i] : ( Z0 @ X15 ) ) ),
    inference(fof_simplification,[status(thm)],[mvalid]) ).

thf(c_0_5,negated_conjecture,
    ~ ! [X10: $i > $i > $o,X19: $i > $o] :
        ( ! [X22: $i] : ( X19 @ X22 )
       => ! [X24: $i,X23: $i] :
            ( ( X10 @ X24 @ X23 )
           => ( X19 @ X23 ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]),c_0_3]),c_0_4]) ).

thf(c_0_6,negated_conjecture,
    ! [X27: $i] :
      ( ( epred2_0 @ X27 )
      & ( epred1_0 @ esk1_0 @ esk2_0 )
      & ~ ( epred2_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_5])])])])]) ).

thf(c_0_7,negated_conjecture,
    ~ ( epred2_0 @ esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_8,negated_conjecture,
    ! [X1: $i] : ( epred2_0 @ X1 ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LCL591^1 : TPTP v8.2.0. Released v3.6.0.
% 0.13/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n021.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon May 20 02:48:07 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.20/0.48  Running higher-order theorem proving
% 0.20/0.48  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/benchmark/theBenchmark.p
% 0.20/0.49  # Version: 3.1.0-ho
% 0.20/0.49  # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.49  # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49  # Starting sh1l with 300s (1) cores
% 0.20/0.49  # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.49  # post_as_ho1 with pid 8741 completed with status 0
% 0.20/0.49  # Result found by post_as_ho1
% 0.20/0.49  # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.49  # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49  # No SInE strategy applied
% 0.20/0.49  # Search class: HUUNF-FFSF00-SHSSMFNN
% 0.20/0.49  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49  # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49  # new_ho_10 with pid 8745 completed with status 0
% 0.20/0.49  # Result found by new_ho_10
% 0.20/0.49  # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting new_ho_9 with 1500s (5) cores
% 0.20/0.49  # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49  # No SInE strategy applied
% 0.20/0.49  # Search class: HUUNF-FFSF00-SHSSMFNN
% 0.20/0.49  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49  # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49  # Preprocessing time       : 0.001 s
% 0.20/0.49  # Presaturation interreduction done
% 0.20/0.49  
% 0.20/0.49  # Proof found!
% 0.20/0.49  # SZS status Theorem
% 0.20/0.49  # SZS output start CNFRefutation
% See solution above
% 0.20/0.49  # Parsed axioms                        : 36
% 0.20/0.49  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.49  # Initial clauses                      : 23
% 0.20/0.49  # Removed in clause preprocessing      : 20
% 0.20/0.49  # Initial clauses in saturation        : 3
% 0.20/0.49  # Processed clauses                    : 3
% 0.20/0.49  # ...of these trivial                  : 0
% 0.20/0.49  # ...subsumed                          : 0
% 0.20/0.49  # ...remaining for further processing  : 3
% 0.20/0.49  # Other redundant clauses eliminated   : 0
% 0.20/0.49  # Clauses deleted for lack of memory   : 0
% 0.20/0.49  # Backward-subsumed                    : 0
% 0.20/0.49  # Backward-rewritten                   : 1
% 0.20/0.49  # Generated clauses                    : 0
% 0.20/0.49  # ...of the previous two non-redundant : 0
% 0.20/0.49  # ...aggressively subsumed             : 0
% 0.20/0.49  # Contextual simplify-reflections      : 0
% 0.20/0.49  # Paramodulations                      : 0
% 0.20/0.49  # Factorizations                       : 0
% 0.20/0.49  # NegExts                              : 0
% 0.20/0.49  # Equation resolutions                 : 0
% 0.20/0.49  # Disequality decompositions           : 0
% 0.20/0.49  # Total rewrite steps                  : 1
% 0.20/0.49  # ...of those cached                   : 0
% 0.20/0.49  # Propositional unsat checks           : 0
% 0.20/0.49  #    Propositional check models        : 0
% 0.20/0.49  #    Propositional check unsatisfiable : 0
% 0.20/0.49  #    Propositional clauses             : 0
% 0.20/0.49  #    Propositional clauses after purity: 0
% 0.20/0.49  #    Propositional unsat core size     : 0
% 0.20/0.49  #    Propositional preprocessing time  : 0.000
% 0.20/0.49  #    Propositional encoding time       : 0.000
% 0.20/0.49  #    Propositional solver time         : 0.000
% 0.20/0.49  #    Success case prop preproc time    : 0.000
% 0.20/0.49  #    Success case prop encoding time   : 0.000
% 0.20/0.49  #    Success case prop solver time     : 0.000
% 0.20/0.49  # Current number of processed clauses  : 2
% 0.20/0.49  #    Positive orientable unit clauses  : 2
% 0.20/0.49  #    Positive unorientable unit clauses: 0
% 0.20/0.49  #    Negative unit clauses             : 0
% 0.20/0.49  #    Non-unit-clauses                  : 0
% 0.20/0.49  # Current number of unprocessed clauses: 0
% 0.20/0.49  # ...number of literals in the above   : 0
% 0.20/0.49  # Current number of archived formulas  : 0
% 0.20/0.49  # Current number of archived clauses   : 1
% 0.20/0.49  # Clause-clause subsumption calls (NU) : 0
% 0.20/0.49  # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.49  # Unit Clause-clause subsumption calls : 0
% 0.20/0.49  # Rewrite failures with RHS unbound    : 0
% 0.20/0.49  # BW rewrite match attempts            : 1
% 0.20/0.49  # BW rewrite match successes           : 1
% 0.20/0.49  # Condensation attempts                : 3
% 0.20/0.49  # Condensation successes               : 0
% 0.20/0.49  # Termbank termtop insertions          : 880
% 0.20/0.49  # Search garbage collected termcells   : 162
% 0.20/0.49  
% 0.20/0.49  # -------------------------------------------------
% 0.20/0.49  # User time                : 0.001 s
% 0.20/0.49  # System time              : 0.003 s
% 0.20/0.49  # Total time               : 0.005 s
% 0.20/0.49  # Maximum resident set size: 1740 pages
% 0.20/0.49  
% 0.20/0.49  # -------------------------------------------------
% 0.20/0.49  # User time                : 0.001 s
% 0.20/0.49  # System time              : 0.007 s
% 0.20/0.49  # Total time               : 0.009 s
% 0.20/0.49  # Maximum resident set size: 1764 pages
% 0.20/0.49  % E---3.1 exiting
% 0.20/0.49  % E exiting
%------------------------------------------------------------------------------