TSTP Solution File: ITP010^4 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP010^4 : TPTP v8.2.0. Bugfixed v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n016.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:15:23 EDT 2024

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

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

thf(decl_sort2,type,
    u: $tType ).

thf(decl_sort3,type,
    du: $tType ).

thf(decl_22,type,
    tyop_2Emin_2Ebool: d ).

thf(decl_23,type,
    tyop_2Emin_2Efun: d > d > d ).

thf(decl_24,type,
    s: d > u > du ).

thf(decl_56,type,
    j_mono_2Etyop_2Emin_2Ebool: du > $o ).

thf(decl_3845,type,
    c_2Ecardinal_2Ecardleq_2E2: du > du > u ).

thf(thm_2Ecardinal_2ECARD__NOT__LE,conjecture,
    ! [X1: d,X2: d,X468: u,X85: u] :
      ( ~ ( j_mono_2Etyop_2Emin_2Ebool @ ( s @ tyop_2Emin_2Ebool @ ( c_2Ecardinal_2Ecardleq_2E2 @ ( s @ ( tyop_2Emin_2Efun @ X1 @ tyop_2Emin_2Ebool ) @ X468 ) @ ( s @ ( tyop_2Emin_2Efun @ X2 @ tyop_2Emin_2Ebool ) @ X85 ) ) ) )
    <=> ~ ( j_mono_2Etyop_2Emin_2Ebool @ ( s @ tyop_2Emin_2Ebool @ ( c_2Ecardinal_2Ecardleq_2E2 @ ( s @ ( tyop_2Emin_2Efun @ X1 @ tyop_2Emin_2Ebool ) @ X468 ) @ ( s @ ( tyop_2Emin_2Efun @ X2 @ tyop_2Emin_2Ebool ) @ X85 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm_2Ecardinal_2ECARD__NOT__LE) ).

thf(c_0_1,negated_conjecture,
    ~ ! [X1: d,X2: d,X468: u,X85: u] : $true,
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[thm_2Ecardinal_2ECARD__NOT__LE])]) ).

thf(c_0_2,negated_conjecture,
    ~ $true,
    inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).

thf(c_0_3,negated_conjecture,
    ~ $true,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : ITP010^4 : TPTP v8.2.0. Bugfixed v7.5.0.
% 0.03/0.14  % Command    : run_E %s %d THM
% 0.13/0.36  % Computer : n016.cluster.edu
% 0.13/0.36  % Model    : x86_64 x86_64
% 0.13/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36  % Memory   : 8042.1875MB
% 0.13/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit   : 300
% 0.13/0.36  % WCLimit    : 300
% 0.13/0.36  % DateTime   : Sat May 18 18:21:23 EDT 2024
% 0.13/0.36  % CPUTime    : 
% 0.21/0.49  Running higher-order theorem proving
% 0.21/0.49  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
% 4.71/3.04  # Version: 3.1.0-ho
% 4.71/3.04  # partial match(2): HMLMSLSLSSSCHFA
% 4.71/3.04  # Preprocessing class: HMLLSLLLSSSCHFA.
% 4.71/3.04  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 4.71/3.04  # Starting new_ho_2 with 1196s (4) cores
% 4.71/3.04  # Starting sh3l with 598s (2) cores
% 4.71/3.04  # Starting lpo5_rw_fix with 299s (1) cores
% 4.71/3.04  # Starting full_lambda_7 with 299s (1) cores
% 4.71/3.04  # lpo5_rw_fix with pid 2671 completed with status 0
% 4.71/3.04  # Result found by lpo5_rw_fix
% 4.71/3.04  # partial match(2): HMLMSLSLSSSCHFA
% 4.71/3.04  # Preprocessing class: HMLLSLLLSSSCHFA.
% 4.71/3.04  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 4.71/3.04  # Starting new_ho_2 with 1196s (4) cores
% 4.71/3.04  # Starting sh3l with 598s (2) cores
% 4.71/3.04  # Starting lpo5_rw_fix with 299s (1) cores
% 4.71/3.04  # SinE strategy is gf120_gu_RUU_F100_L01000
% 4.71/3.04  # Search class: HGHSM-SMLM33-DHFFFFBC
% 4.71/3.04  # partial match(1): HGHSM-SMLM32-DHFFFFBC
% 4.71/3.04  # Scheduled 6 strats onto 1 cores with 299 seconds (299 total)
% 4.71/3.04  # Starting new_ho_6 with 160s (1) cores
% 4.71/3.04  # new_ho_6 with pid 2673 completed with status 0
% 4.71/3.04  # Result found by new_ho_6
% 4.71/3.04  # partial match(2): HMLMSLSLSSSCHFA
% 4.71/3.04  # Preprocessing class: HMLLSLLLSSSCHFA.
% 4.71/3.04  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 4.71/3.04  # Starting new_ho_2 with 1196s (4) cores
% 4.71/3.04  # Starting sh3l with 598s (2) cores
% 4.71/3.04  # Starting lpo5_rw_fix with 299s (1) cores
% 4.71/3.04  # SinE strategy is gf120_gu_RUU_F100_L01000
% 4.71/3.04  # Search class: HGHSM-SMLM33-DHFFFFBC
% 4.71/3.04  # partial match(1): HGHSM-SMLM32-DHFFFFBC
% 4.71/3.04  # Scheduled 6 strats onto 1 cores with 299 seconds (299 total)
% 4.71/3.04  # Starting new_ho_6 with 160s (1) cores
% 4.71/3.04  # Preprocessing time       : 0.111 s
% 4.71/3.04  
% 4.71/3.04  # Proof found!
% 4.71/3.04  # SZS status Theorem
% 4.71/3.04  # SZS output start CNFRefutation
% See solution above
% 4.71/3.04  # Parsed axioms                        : 25243
% 4.71/3.04  # Removed by relevancy pruning/SinE    : 24242
% 4.71/3.04  # Initial clauses                      : 2196
% 4.71/3.04  # Removed in clause preprocessing      : 204
% 4.71/3.04  # Initial clauses in saturation        : 1992
% 4.71/3.04  # Processed clauses                    : 1
% 4.71/3.04  # ...of these trivial                  : 0
% 4.71/3.04  # ...subsumed                          : 0
% 4.71/3.04  # ...remaining for further processing  : 0
% 4.71/3.04  # Other redundant clauses eliminated   : 0
% 4.71/3.04  # Clauses deleted for lack of memory   : 0
% 4.71/3.04  # Backward-subsumed                    : 0
% 4.71/3.04  # Backward-rewritten                   : 0
% 4.71/3.04  # Generated clauses                    : 0
% 4.71/3.04  # ...of the previous two non-redundant : 0
% 4.71/3.04  # ...aggressively subsumed             : 0
% 4.71/3.04  # Contextual simplify-reflections      : 0
% 4.71/3.04  # Paramodulations                      : 0
% 4.71/3.04  # Factorizations                       : 0
% 4.71/3.04  # NegExts                              : 0
% 4.71/3.04  # Equation resolutions                 : 0
% 4.71/3.04  # Disequality decompositions           : 0
% 4.71/3.04  # Total rewrite steps                  : 0
% 4.71/3.04  # ...of those cached                   : 0
% 4.71/3.04  # Propositional unsat checks           : 0
% 4.71/3.04  #    Propositional check models        : 0
% 4.71/3.04  #    Propositional check unsatisfiable : 0
% 4.71/3.04  #    Propositional clauses             : 0
% 4.71/3.04  #    Propositional clauses after purity: 0
% 4.71/3.04  #    Propositional unsat core size     : 0
% 4.71/3.04  #    Propositional preprocessing time  : 0.000
% 4.71/3.04  #    Propositional encoding time       : 0.000
% 4.71/3.04  #    Propositional solver time         : 0.000
% 4.71/3.04  #    Success case prop preproc time    : 0.000
% 4.71/3.04  #    Success case prop encoding time   : 0.000
% 4.71/3.04  #    Success case prop solver time     : 0.000
% 4.71/3.04  # Current number of processed clauses  : 0
% 4.71/3.04  #    Positive orientable unit clauses  : 0
% 4.71/3.04  #    Positive unorientable unit clauses: 0
% 4.71/3.04  #    Negative unit clauses             : 0
% 4.71/3.04  #    Non-unit-clauses                  : 0
% 4.71/3.04  # Current number of unprocessed clauses: 1991
% 4.71/3.04  # ...number of literals in the above   : 4988
% 4.71/3.04  # Current number of archived formulas  : 0
% 4.71/3.04  # Current number of archived clauses   : 0
% 4.71/3.04  # Clause-clause subsumption calls (NU) : 0
% 4.71/3.04  # Rec. Clause-clause subsumption calls : 0
% 4.71/3.04  # Non-unit clause-clause subsumptions  : 0
% 4.71/3.04  # Unit Clause-clause subsumption calls : 0
% 4.71/3.04  # Rewrite failures with RHS unbound    : 0
% 4.71/3.04  # BW rewrite match attempts            : 0
% 4.71/3.04  # BW rewrite match successes           : 0
% 4.71/3.04  # Condensation attempts                : 1
% 4.71/3.04  # Condensation successes               : 0
% 4.71/3.04  # Termbank termtop insertions          : 1304089
% 4.71/3.04  # Search garbage collected termcells   : 270525
% 4.71/3.04  
% 4.71/3.04  # -------------------------------------------------
% 4.71/3.04  # User time                : 0.489 s
% 4.71/3.04  # System time              : 0.103 s
% 4.71/3.04  # Total time               : 0.592 s
% 4.71/3.04  # Maximum resident set size: 61696 pages
% 4.71/3.04  
% 4.71/3.04  # -------------------------------------------------
% 4.71/3.04  # User time                : 2.361 s
% 4.71/3.04  # System time              : 0.155 s
% 4.71/3.04  # Total time               : 2.515 s
% 4.71/3.04  # Maximum resident set size: 52572 pages
% 4.71/3.04  % E---3.1 exiting
% 4.71/3.04  % E exiting
%------------------------------------------------------------------------------