TSTP Solution File: SEV408^5 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SEV408^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n007.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 : Tue May 21 04:08:20 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(decl_22,type,
    cF: ( $i > $o ) > $o ).

thf(decl_23,type,
    epred1_1: ( ( $i > $o ) > $o ) > $i > $o ).

thf(decl_24,type,
    esk1_2: ( ( $i > $o ) > $o ) > ( $i > $o ) > $i ).

thf(cBLEDSOE2_pme,conjecture,
    ? [X1: ( $i > $o ) > $o] :
    ! [X2: $i > $o] :
      ( ( X1 @ X2 )
     => ? [X3: $i > $o] :
          ( ( cF @ X3 )
          & ! [X4: $i] :
              ( ( X2 @ X4 )
             => ( X3 @ X4 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBLEDSOE2_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ? [X1: ( $i > $o ) > $o] :
      ! [X2: $i > $o] :
        ( ( X1 @ X2 )
       => ? [X3: $i > $o] :
            ( ( cF @ X3 )
            & ! [X4: $i] :
                ( ( X2 @ X4 )
               => ( X3 @ X4 ) ) ) ),
    inference(assume_negation,[status(cth)],[cBLEDSOE2_pme]) ).

thf(c_0_2,negated_conjecture,
    ! [X9: ( $i > $o ) > $o,X11: $i > $o] :
      ( ( X9 @ ( epred1_1 @ X9 ) )
      & ( ( epred1_1 @ X9 @ ( esk1_2 @ X9 @ X11 ) )
        | ~ ( cF @ X11 ) )
      & ( ~ ( X11 @ ( esk1_2 @ X9 @ X11 ) )
        | ~ ( cF @ X11 ) ) ),
    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)],[c_0_1])])])])])]) ).

thf(c_0_3,negated_conjecture,
    ! [X1: ( $i > $o ) > $o] : ( X1 @ ( epred1_1 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    $false,
    inference(flex_resolve,[status(thm)],[c_0_3]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SEV408^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n007.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   : Sun May 19 19:16:38 EDT 2024
% 0.13/0.35  % 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: HSSSSMSSSSSNHHA.
% 0.20/0.49  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting sh2lt with 1200s (4) cores
% 0.20/0.49  # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.49  # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.49  # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49  # Starting ehoh_best3_rw with 300s (1) cores
% 0.20/0.49  # full_lambda_6 with pid 24044 completed with status 0
% 0.20/0.49  # Result found by full_lambda_6
% 0.20/0.49  # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.49  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting sh2lt with 1200s (4) cores
% 0.20/0.49  # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.49  # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.49  # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.20/0.49  # Search class: HHHNF-FFSF22-SHHFFMBN
% 0.20/0.49  # partial match(2): HGHNF-FFSF21-SHHFFMBN
% 0.20/0.49  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49  # Starting pre_casc_2 with 109s (1) cores
% 0.20/0.49  # pre_casc_2 with pid 24050 completed with status 0
% 0.20/0.49  # Result found by pre_casc_2
% 0.20/0.49  # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.49  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting sh2lt with 1200s (4) cores
% 0.20/0.49  # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.49  # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.49  # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.20/0.49  # Search class: HHHNF-FFSF22-SHHFFMBN
% 0.20/0.49  # partial match(2): HGHNF-FFSF21-SHHFFMBN
% 0.20/0.49  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49  # Starting pre_casc_2 with 109s (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                        : 2
% 0.20/0.49  # Removed by relevancy pruning/SinE    : 1
% 0.20/0.49  # Initial clauses                      : 3
% 0.20/0.49  # Removed in clause preprocessing      : 0
% 0.20/0.49  # Initial clauses in saturation        : 3
% 0.20/0.49  # Processed clauses                    : 1
% 0.20/0.49  # ...of these trivial                  : 0
% 0.20/0.49  # ...subsumed                          : 0
% 0.20/0.49  # ...remaining for further processing  : 0
% 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                   : 0
% 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                  : 0
% 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  : 0
% 0.20/0.49  #    Positive orientable unit clauses  : 0
% 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: 2
% 0.20/0.49  # ...number of literals in the above   : 4
% 0.20/0.49  # Current number of archived formulas  : 0
% 0.20/0.49  # Current number of archived clauses   : 0
% 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            : 0
% 0.20/0.49  # BW rewrite match successes           : 0
% 0.20/0.49  # Condensation attempts                : 1
% 0.20/0.49  # Condensation successes               : 0
% 0.20/0.49  # Termbank termtop insertions          : 208
% 0.20/0.49  # Search garbage collected termcells   : 94
% 0.20/0.49  
% 0.20/0.49  # -------------------------------------------------
% 0.20/0.49  # User time                : 0.002 s
% 0.20/0.49  # System time              : 0.001 s
% 0.20/0.49  # Total time               : 0.003 s
% 0.20/0.49  # Maximum resident set size: 1804 pages
% 0.20/0.49  
% 0.20/0.49  # -------------------------------------------------
% 0.20/0.49  # User time                : 0.003 s
% 0.20/0.49  # System time              : 0.003 s
% 0.20/0.49  # Total time               : 0.006 s
% 0.20/0.49  # Maximum resident set size: 1720 pages
% 0.20/0.49  % E---3.1 exiting
% 0.20/0.49  % E exiting
%------------------------------------------------------------------------------