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

View Problem - Process Solution

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

% Computer : n028.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:54 EDT 2024

% Result   : Theorem 0.19s 0.49s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   27 (  14 unt;   9 typ;   0 def)
%            Number of atoms       :   45 (  11 equ;   0 cnn)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   69 (  10   ~;   7   |;   2   &;  46   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   44 (  44   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   9 usr;   3 con; 0-3 aty)
%            Number of variables   :   35 (  26   ^   9   !;   0   ?;  35   :)

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

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

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

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

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

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

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

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

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

thf(mimpl,axiom,
    ( mimpl
    = ( ^ [X7: $i > $o,X8: $i > $o] : ( mor @ ( mnot @ X7 ) @ X8 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mimpl) ).

thf(mnot,axiom,
    ( mnot
    = ( ^ [X2: $i > $o,X3: $i] :
          ~ ( X2 @ X3 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mnot) ).

thf(mor,axiom,
    ( mor
    = ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
          ( ( X4 @ X3 )
          | ( X5 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL008^0.ax',mor) ).

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,
    mvalid @ ( mimpl @ ( mbox @ r @ a ) @ ( mbox @ r @ a ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).

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

thf(c_0_12,negated_conjecture,
    ~ ! [X21: $i] :
        ( ~ ! [X19: $i] :
              ( ( r @ X21 @ X19 )
             => ( a @ X19 ) )
        | ! [X20: $i] :
            ( ( r @ X21 @ X20 )
           => ( a @ X20 ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]),c_0_9]),c_0_10]),c_0_11]) ).

thf(c_0_13,negated_conjecture,
    ! [X23: $i] :
      ( ( ~ ( r @ esk1_0 @ X23 )
        | ( a @ X23 ) )
      & ( r @ esk1_0 @ esk2_0 )
      & ~ ( a @ 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_12])])])])]) ).

thf(c_0_14,negated_conjecture,
    ! [X1: $i] :
      ( ( a @ X1 )
      | ~ ( r @ esk1_0 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

thf(c_0_15,negated_conjecture,
    r @ esk1_0 @ esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

thf(c_0_16,negated_conjecture,
    ~ ( a @ esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

thf(c_0_17,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
    [proof] ).

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