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

View Problem - Process Solution

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

% Computer : n004.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:07:34 EDT 2024

% Result   : Theorem 0.20s 0.51s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   18 (   3 unt;   9 typ;   0 def)
%            Number of atoms       :   46 (   5 equ;   0 cnn)
%            Maximal formula atoms :   20 (   5 avg)
%            Number of connectives :  158 (  17   ~;  13   |;  17   &; 104   @)
%                                         (   1 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   8 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   72 (  72   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   43 (   0   ^  35   !;   8   ?;  43   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    a: $tType ).

thf(decl_22,type,
    epred1_0: a > a > $o ).

thf(decl_23,type,
    esk1_1: a > a ).

thf(decl_24,type,
    epred2_1: ( ( a > $o ) > ( a > $o ) > $o ) > a > $o ).

thf(decl_25,type,
    epred3_1: ( ( a > $o ) > ( a > $o ) > $o ) > a > $o ).

thf(decl_26,type,
    epred4_1: ( ( a > $o ) > ( a > $o ) > $o ) > a > $o ).

thf(decl_27,type,
    epred5_1: ( ( a > $o ) > ( a > $o ) > $o ) > a > $o ).

thf(decl_28,type,
    epred6_1: ( ( a > $o ) > ( a > $o ) > $o ) > a > $o ).

thf(decl_33,type,
    epred7_0: $o ).

thf(cTHM165_pme,conjecture,
    ( ? [X1: a > a > $o] :
        ( ! [X2: a] :
          ? [X3: a] : ( X1 @ X2 @ X3 )
        & ! [X2: a] :
            ~ ( X1 @ X2 @ X2 )
        & ! [X2: a,X4: a,X5: a] :
            ( ( ( X1 @ X2 @ X4 )
              & ( X1 @ X4 @ X5 ) )
           => ( X1 @ X2 @ X5 ) ) )
   => ? [X6: ( a > $o ) > ( a > $o ) > $o] :
        ( ! [X7: a > $o] :
          ? [X8: a > $o] : ( X6 @ X7 @ X8 )
        & ! [X9: a > $o] :
            ~ ( X6 @ X9 @ X9 )
        & ! [X10: a > $o,X11: a > $o,X12: a > $o] :
            ( ( ( X6 @ X10 @ X11 )
              & ( X6 @ X11 @ X12 ) )
           => ( X6 @ X10 @ X12 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM165_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ( ? [X1: a > a > $o] :
          ( ! [X2: a] :
            ? [X3: a] : ( X1 @ X2 @ X3 )
          & ! [X2: a] :
              ~ ( X1 @ X2 @ X2 )
          & ! [X2: a,X4: a,X5: a] :
              ( ( ( X1 @ X2 @ X4 )
                & ( X1 @ X4 @ X5 ) )
             => ( X1 @ X2 @ X5 ) ) )
     => ? [X6: ( a > $o ) > ( a > $o ) > $o] :
          ( ! [X7: a > $o] :
            ? [X8: a > $o] : ( X6 @ X7 @ X8 )
          & ! [X9: a > $o] :
              ~ ( X6 @ X9 @ X9 )
          & ! [X10: a > $o,X11: a > $o,X12: a > $o] :
              ( ( ( X6 @ X10 @ X11 )
                & ( X6 @ X11 @ X12 ) )
             => ( X6 @ X10 @ X12 ) ) ) ),
    inference(assume_negation,[status(cth)],[cTHM165_pme]) ).

thf(c_0_2,negated_conjecture,
    ! [X28: a,X30: a,X31: a,X32: a,X33: a,X34: ( a > $o ) > ( a > $o ) > $o,X36: a > $o] :
      ( ( epred1_0 @ X28 @ ( esk1_1 @ X28 ) )
      & ~ ( epred1_0 @ X30 @ X30 )
      & ( ~ ( epred1_0 @ X31 @ X32 )
        | ~ ( epred1_0 @ X32 @ X33 )
        | ( epred1_0 @ X31 @ X33 ) )
      & ( ( X34 @ ( epred4_1 @ X34 ) @ ( epred5_1 @ X34 ) )
        | ~ ( X34 @ ( epred2_1 @ X34 ) @ X36 )
        | ( X34 @ ( epred3_1 @ X34 ) @ ( epred3_1 @ X34 ) ) )
      & ( ( X34 @ ( epred5_1 @ X34 ) @ ( epred6_1 @ X34 ) )
        | ~ ( X34 @ ( epred2_1 @ X34 ) @ X36 )
        | ( X34 @ ( epred3_1 @ X34 ) @ ( epred3_1 @ X34 ) ) )
      & ( ~ ( X34 @ ( epred4_1 @ X34 ) @ ( epred6_1 @ X34 ) )
        | ~ ( X34 @ ( epred2_1 @ X34 ) @ X36 )
        | ( X34 @ ( epred3_1 @ X34 ) @ ( epred3_1 @ X34 ) ) ) ),
    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,
    ! [X6: ( a > $o ) > ( a > $o ) > $o,X7: a > $o] :
      ( ( X6 @ ( epred4_1 @ X6 ) @ ( epred5_1 @ X6 ) )
      | ( X6 @ ( epred3_1 @ X6 ) @ ( epred3_1 @ X6 ) )
      | ~ ( X6 @ ( epred2_1 @ X6 ) @ X7 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X7: a > $o] :
      ( ( ( epred2_1 @ $neq )
        = X7 )
      | ( ( epred5_1 @ $neq )
       != ( epred4_1 @ $neq ) ) ),
    inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ! [X7: a > $o,X8: a > $o] :
      ( ( X7 = X8 )
      | ( ( epred5_1 @ $neq )
       != ( epred4_1 @ $neq ) ) ),
    inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4])])]) ).

thf(c_0_6,negated_conjecture,
    ! [X7: a > $o,X8: a > $o,X49: a] :
      ( ( ( X7 @ X49 )
      <=> ( X8 @ X49 ) )
      | ( ( epred5_1 @ $neq )
       != ( epred4_1 @ $neq ) ) ),
    inference(arg_cong,[status(thm)],[c_0_5]) ).

thf(c_0_7,negated_conjecture,
    ~ epred7_0,
    inference(dynamic_cnf,[status(thm)],[c_0_6]) ).

thf(c_0_8,negated_conjecture,
    $false,
    inference(flex_resolve,[status(thm)],[inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6]),c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SEV090^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n004.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 19 18:25:23 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.48  Running higher-order theorem proving
% 0.20/0.48  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/benchmark/theBenchmark.p
% 0.20/0.51  # Version: 3.1.0-ho
% 0.20/0.51  # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.51  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting sh2lt with 1200s (4) cores
% 0.20/0.51  # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.51  # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.51  # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.51  # Starting ehoh_best3_rw with 300s (1) cores
% 0.20/0.51  # sh2lt with pid 9627 completed with status 0
% 0.20/0.51  # Result found by sh2lt
% 0.20/0.51  # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.51  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting sh2lt with 1200s (4) cores
% 0.20/0.51  # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.20/0.51  # Search class: HGUNF-FFSF11-SHHFFMBN
% 0.20/0.51  # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.20/0.51  # Starting ho_unfolding_3 with 649s (1) cores
% 0.20/0.51  # Starting sh2lt with 121s (1) cores
% 0.20/0.51  # Starting sh5l with 109s (1) cores
% 0.20/0.51  # Starting new_bool_3 with 109s (1) cores
% 0.20/0.51  # sh2lt with pid 9633 completed with status 0
% 0.20/0.51  # Result found by sh2lt
% 0.20/0.51  # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.51  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting sh2lt with 1200s (4) cores
% 0.20/0.51  # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.20/0.51  # Search class: HGUNF-FFSF11-SHHFFMBN
% 0.20/0.51  # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.20/0.51  # Starting ho_unfolding_3 with 649s (1) cores
% 0.20/0.51  # Starting sh2lt with 121s (1) cores
% 0.20/0.51  # Preprocessing time       : 0.001 s
% 0.20/0.51  # Presaturation interreduction done
% 0.20/0.51  
% 0.20/0.51  # Proof found!
% 0.20/0.51  # SZS status Theorem
% 0.20/0.51  # SZS output start CNFRefutation
% See solution above
% 0.20/0.51  # Parsed axioms                        : 2
% 0.20/0.51  # Removed by relevancy pruning/SinE    : 1
% 0.20/0.51  # Initial clauses                      : 6
% 0.20/0.51  # Removed in clause preprocessing      : 0
% 0.20/0.51  # Initial clauses in saturation        : 6
% 0.20/0.51  # Processed clauses                    : 95
% 0.20/0.51  # ...of these trivial                  : 11
% 0.20/0.51  # ...subsumed                          : 5
% 0.20/0.51  # ...remaining for further processing  : 78
% 0.20/0.51  # Other redundant clauses eliminated   : 1
% 0.20/0.51  # Clauses deleted for lack of memory   : 0
% 0.20/0.51  # Backward-subsumed                    : 3
% 0.20/0.51  # Backward-rewritten                   : 1
% 0.20/0.51  # Generated clauses                    : 178
% 0.20/0.51  # ...of the previous two non-redundant : 163
% 0.20/0.51  # ...aggressively subsumed             : 0
% 0.20/0.51  # Contextual simplify-reflections      : 1
% 0.20/0.51  # Paramodulations                      : 77
% 0.20/0.51  # Factorizations                       : 2
% 0.20/0.51  # NegExts                              : 5
% 0.20/0.51  # Equation resolutions                 : 1
% 0.20/0.51  # Disequality decompositions           : 0
% 0.20/0.51  # Total rewrite steps                  : 25
% 0.20/0.51  # ...of those cached                   : 19
% 0.20/0.51  # Propositional unsat checks           : 0
% 0.20/0.51  #    Propositional check models        : 0
% 0.20/0.51  #    Propositional check unsatisfiable : 0
% 0.20/0.51  #    Propositional clauses             : 0
% 0.20/0.51  #    Propositional clauses after purity: 0
% 0.20/0.51  #    Propositional unsat core size     : 0
% 0.20/0.51  #    Propositional preprocessing time  : 0.000
% 0.20/0.51  #    Propositional encoding time       : 0.000
% 0.20/0.51  #    Propositional solver time         : 0.000
% 0.20/0.51  #    Success case prop preproc time    : 0.000
% 0.20/0.51  #    Success case prop encoding time   : 0.000
% 0.20/0.51  #    Success case prop solver time     : 0.000
% 0.20/0.51  # Current number of processed clauses  : 62
% 0.20/0.51  #    Positive orientable unit clauses  : 6
% 0.20/0.51  #    Positive unorientable unit clauses: 0
% 0.20/0.51  #    Negative unit clauses             : 48
% 0.20/0.51  #    Non-unit-clauses                  : 8
% 0.20/0.51  # Current number of unprocessed clauses: 77
% 0.20/0.51  # ...number of literals in the above   : 234
% 0.20/0.51  # Current number of archived formulas  : 0
% 0.20/0.51  # Current number of archived clauses   : 16
% 0.20/0.51  # Clause-clause subsumption calls (NU) : 30
% 0.20/0.51  # Rec. Clause-clause subsumption calls : 29
% 0.20/0.51  # Non-unit clause-clause subsumptions  : 6
% 0.20/0.51  # Unit Clause-clause subsumption calls : 1229
% 0.20/0.51  # Rewrite failures with RHS unbound    : 0
% 0.20/0.51  # BW rewrite match attempts            : 1
% 0.20/0.51  # BW rewrite match successes           : 1
% 0.20/0.51  # Condensation attempts                : 0
% 0.20/0.51  # Condensation successes               : 0
% 0.20/0.51  # Termbank termtop insertions          : 19717
% 0.20/0.51  # Search garbage collected termcells   : 302
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.013 s
% 0.20/0.51  # System time              : 0.005 s
% 0.20/0.51  # Total time               : 0.018 s
% 0.20/0.51  # Maximum resident set size: 1868 pages
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.054 s
% 0.20/0.51  # System time              : 0.015 s
% 0.20/0.51  # Total time               : 0.069 s
% 0.20/0.51  # Maximum resident set size: 1728 pages
% 0.20/0.51  % E---3.1 exiting
% 0.20/0.52  % E exiting
%------------------------------------------------------------------------------