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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP073^1 : TPTP v8.2.0. Released v7.5.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 : Mon May 20 22:16:11 EDT 2024

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

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

thf(decl_42,type,
    hF_Mirabelle_hmem: hF_Mirabelle_hf > hF_Mirabelle_hf > $o ).

thf(decl_49,type,
    ord_le976219883lle_hf: hF_Mirabelle_hf > hF_Mirabelle_hf > $o ).

thf(decl_72,type,
    a: hF_Mirabelle_hf ).

thf(decl_73,type,
    b: hF_Mirabelle_hf ).

thf(decl_219,type,
    esk146_2: hF_Mirabelle_hf > hF_Mirabelle_hf > hF_Mirabelle_hf ).

thf(fact_6_less__eq__hf__def,axiom,
    ( ord_le976219883lle_hf
    = ( ^ [X21: hF_Mirabelle_hf,X22: hF_Mirabelle_hf] :
        ! [X8: hF_Mirabelle_hf] :
          ( ( hF_Mirabelle_hmem @ X8 @ X21 )
         => ( hF_Mirabelle_hmem @ X8 @ X22 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_6_less__eq__hf__def) ).

thf(conj_0,hypothesis,
    ! [X689: hF_Mirabelle_hf] :
      ( ( hF_Mirabelle_hmem @ X689 @ a )
     => ( hF_Mirabelle_hmem @ X689 @ b ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

thf(conj_1,conjecture,
    ord_le976219883lle_hf @ a @ b,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).

thf(c_0_3,plain,
    ( ord_le976219883lle_hf
    = ( ^ [Z0: hF_Mirabelle_hf,Z1: hF_Mirabelle_hf] :
        ! [X8: hF_Mirabelle_hf] :
          ( ( hF_Mirabelle_hmem @ X8 @ Z0 )
         => ( hF_Mirabelle_hmem @ X8 @ Z1 ) ) ) ),
    inference(fof_simplification,[status(thm)],[fact_6_less__eq__hf__def]) ).

thf(c_0_4,plain,
    ( ord_le976219883lle_hf
    = ( ^ [Z0: hF_Mirabelle_hf,Z1: hF_Mirabelle_hf] :
        ! [X2154: hF_Mirabelle_hf] :
          ( ( hF_Mirabelle_hmem @ X2154 @ Z0 )
         => ( hF_Mirabelle_hmem @ X2154 @ Z1 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_5,hypothesis,
    ! [X1356: hF_Mirabelle_hf] :
      ( ~ ( hF_Mirabelle_hmem @ X1356 @ a )
      | ( hF_Mirabelle_hmem @ X1356 @ b ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_0])])]) ).

thf(c_0_6,plain,
    ! [X2064: hF_Mirabelle_hf,X2065: hF_Mirabelle_hf] :
      ( ! [X2155: hF_Mirabelle_hf] :
          ( ( hF_Mirabelle_hmem @ X2155 @ X2064 )
         => ( hF_Mirabelle_hmem @ X2155 @ X2065 ) )
    <=> ( ord_le976219883lle_hf @ X2064 @ X2065 ) ),
    inference(arg_cong,[status(thm)],[c_0_4]) ).

thf(c_0_7,negated_conjecture,
    ~ ( ord_le976219883lle_hf @ a @ b ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])]) ).

thf(c_0_8,hypothesis,
    ! [X1: hF_Mirabelle_hf] :
      ( ( hF_Mirabelle_hmem @ X1 @ b )
      | ~ ( hF_Mirabelle_hmem @ X1 @ a ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_9,plain,
    ! [X1: hF_Mirabelle_hf,X2: hF_Mirabelle_hf] :
      ( ( hF_Mirabelle_hmem @ ( esk146_2 @ X1 @ X2 ) @ X1 )
      | ( ord_le976219883lle_hf @ X1 @ X2 ) ),
    inference(dynamic_cnf,[status(thm)],[c_0_6]) ).

thf(c_0_10,negated_conjecture,
    ~ ( ord_le976219883lle_hf @ a @ b ),
    inference(fof_nnf,[status(thm)],[c_0_7]) ).

thf(c_0_11,plain,
    ! [X1: hF_Mirabelle_hf,X2: hF_Mirabelle_hf] :
      ( ( ord_le976219883lle_hf @ X1 @ X2 )
      | ~ ( hF_Mirabelle_hmem @ ( esk146_2 @ X1 @ X2 ) @ X2 ) ),
    inference(dynamic_cnf,[status(thm)],[c_0_6]) ).

thf(c_0_12,hypothesis,
    ! [X1: hF_Mirabelle_hf] :
      ( ( hF_Mirabelle_hmem @ ( esk146_2 @ a @ X1 ) @ b )
      | ( ord_le976219883lle_hf @ a @ X1 ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

thf(c_0_13,negated_conjecture,
    ~ ( ord_le976219883lle_hf @ a @ b ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_14,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem    : ITP073^1 : TPTP v8.2.0. Released v7.5.0.
% 0.04/0.15  % Command    : run_E %s %d THM
% 0.15/0.36  % Computer : n004.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Sat May 18 17:36:38 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.21/0.51  Running higher-order theorem proving
% 0.21/0.51  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.36/0.68  # Version: 3.1.0-ho
% 0.36/0.68  # Preprocessing class: HSLSSMSSSSMCHFA.
% 0.36/0.68  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.68  # Starting sh3 with 1500s (5) cores
% 0.36/0.68  # Starting new_bool_3 with 300s (1) cores
% 0.36/0.68  # Starting new_bool_1 with 300s (1) cores
% 0.36/0.68  # Starting new_bool_2 with 300s (1) cores
% 0.36/0.68  # new_bool_3 with pid 19923 completed with status 0
% 0.36/0.68  # Result found by new_bool_3
% 0.36/0.68  # Preprocessing class: HSLSSMSSSSMCHFA.
% 0.36/0.68  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.68  # Starting sh3 with 1500s (5) cores
% 0.36/0.68  # Starting new_bool_3 with 300s (1) cores
% 0.36/0.68  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/0.68  # Search class: HGHSM-FSLM33-DHFFFSBN
% 0.36/0.68  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.68  # Starting new_ho_10 with 163s (1) cores
% 0.36/0.68  # new_ho_10 with pid 19927 completed with status 0
% 0.36/0.68  # Result found by new_ho_10
% 0.36/0.68  # Preprocessing class: HSLSSMSSSSMCHFA.
% 0.36/0.68  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.68  # Starting sh3 with 1500s (5) cores
% 0.36/0.68  # Starting new_bool_3 with 300s (1) cores
% 0.36/0.68  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/0.68  # Search class: HGHSM-FSLM33-DHFFFSBN
% 0.36/0.68  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.68  # Starting new_ho_10 with 163s (1) cores
% 0.36/0.68  # Preprocessing time       : 0.012 s
% 0.36/0.68  # Presaturation interreduction done
% 0.36/0.68  
% 0.36/0.68  # Proof found!
% 0.36/0.68  # SZS status Theorem
% 0.36/0.68  # SZS output start CNFRefutation
% See solution above
% 0.36/0.68  # Parsed axioms                        : 406
% 0.36/0.68  # Removed by relevancy pruning/SinE    : 195
% 0.36/0.68  # Initial clauses                      : 508
% 0.36/0.68  # Removed in clause preprocessing      : 11
% 0.36/0.68  # Initial clauses in saturation        : 497
% 0.36/0.68  # Processed clauses                    : 842
% 0.36/0.68  # ...of these trivial                  : 13
% 0.36/0.68  # ...subsumed                          : 236
% 0.36/0.68  # ...remaining for further processing  : 593
% 0.36/0.68  # Other redundant clauses eliminated   : 91
% 0.36/0.68  # Clauses deleted for lack of memory   : 0
% 0.36/0.68  # Backward-subsumed                    : 0
% 0.36/0.68  # Backward-rewritten                   : 0
% 0.36/0.68  # Generated clauses                    : 681
% 0.36/0.68  # ...of the previous two non-redundant : 559
% 0.36/0.68  # ...aggressively subsumed             : 0
% 0.36/0.68  # Contextual simplify-reflections      : 3
% 0.36/0.68  # Paramodulations                      : 435
% 0.36/0.68  # Factorizations                       : 6
% 0.36/0.68  # NegExts                              : 0
% 0.36/0.68  # Equation resolutions                 : 91
% 0.36/0.68  # Disequality decompositions           : 0
% 0.36/0.68  # Total rewrite steps                  : 80
% 0.36/0.68  # ...of those cached                   : 49
% 0.36/0.68  # Propositional unsat checks           : 0
% 0.36/0.68  #    Propositional check models        : 0
% 0.36/0.68  #    Propositional check unsatisfiable : 0
% 0.36/0.68  #    Propositional clauses             : 0
% 0.36/0.68  #    Propositional clauses after purity: 0
% 0.36/0.68  #    Propositional unsat core size     : 0
% 0.36/0.68  #    Propositional preprocessing time  : 0.000
% 0.36/0.68  #    Propositional encoding time       : 0.000
% 0.36/0.68  #    Propositional solver time         : 0.000
% 0.36/0.68  #    Success case prop preproc time    : 0.000
% 0.36/0.68  #    Success case prop encoding time   : 0.000
% 0.36/0.68  #    Success case prop solver time     : 0.000
% 0.36/0.68  # Current number of processed clauses  : 163
% 0.36/0.68  #    Positive orientable unit clauses  : 58
% 0.36/0.68  #    Positive unorientable unit clauses: 0
% 0.36/0.68  #    Negative unit clauses             : 37
% 0.36/0.68  #    Non-unit-clauses                  : 68
% 0.36/0.68  # Current number of unprocessed clauses: 554
% 0.36/0.68  # ...number of literals in the above   : 2238
% 0.36/0.68  # Current number of archived formulas  : 0
% 0.36/0.68  # Current number of archived clauses   : 374
% 0.36/0.68  # Clause-clause subsumption calls (NU) : 16048
% 0.36/0.68  # Rec. Clause-clause subsumption calls : 4161
% 0.36/0.68  # Non-unit clause-clause subsumptions  : 209
% 0.36/0.68  # Unit Clause-clause subsumption calls : 1129
% 0.36/0.68  # Rewrite failures with RHS unbound    : 0
% 0.36/0.68  # BW rewrite match attempts            : 74
% 0.36/0.68  # BW rewrite match successes           : 6
% 0.36/0.68  # Condensation attempts                : 842
% 0.36/0.68  # Condensation successes               : 12
% 0.36/0.68  # Termbank termtop insertions          : 88086
% 0.36/0.68  # Search garbage collected termcells   : 12993
% 0.36/0.68  
% 0.36/0.68  # -------------------------------------------------
% 0.36/0.68  # User time                : 0.128 s
% 0.36/0.68  # System time              : 0.010 s
% 0.36/0.68  # Total time               : 0.138 s
% 0.36/0.68  # Maximum resident set size: 4400 pages
% 0.36/0.68  
% 0.36/0.68  # -------------------------------------------------
% 0.36/0.68  # User time                : 0.143 s
% 0.36/0.68  # System time              : 0.013 s
% 0.36/0.68  # Total time               : 0.156 s
% 0.36/0.68  # Maximum resident set size: 2716 pages
% 0.36/0.68  % E---3.1 exiting
% 0.36/0.68  % E exiting
%------------------------------------------------------------------------------