TSTP Solution File: ITP010_1 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : ITP010_1 : TPTP v8.1.2. Bugfixed v7.5.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 : Sat May  4 08:08:47 EDT 2024

% Result   : Theorem 0.19s 0.51s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   15 (   4 unt;  10 typ;   0 def)
%            Number of atoms       :    6 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    5 (   4   ~;   0   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :    8 (   5   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   2 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :    8 (   4 sgn   8   !;   0   ?;   8   :)

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

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

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

tff(decl_sort4,type,
    mono_2Etyop_2Emin_2Ebool: $tType ).

tff(decl_22,type,
    tyop_2Emin_2Ebool: d ).

tff(decl_23,type,
    tyop_2Emin_2Efun: ( d * d ) > d ).

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

tff(decl_26,type,
    p: mono_2Etyop_2Emin_2Ebool > $o ).

tff(decl_45,type,
    c_2Ecardinal_2Ecardleq_2E2: ( du * du ) > u ).

tff(decl_63,type,
    j_mono_2Etyop_2Emin_2Ebool: du > mono_2Etyop_2Emin_2Ebool ).

tff(thm_2Ecardinal_2ECARD__NOT__LE,conjecture,
    ! [X1: d,X2: d,X31: u,X32: u] :
      ( ~ p(j_mono_2Etyop_2Emin_2Ebool(s(tyop_2Emin_2Ebool,c_2Ecardinal_2Ecardleq_2E2(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X31),s(tyop_2Emin_2Efun(X2,tyop_2Emin_2Ebool),X32)))))
    <=> ~ p(j_mono_2Etyop_2Emin_2Ebool(s(tyop_2Emin_2Ebool,c_2Ecardinal_2Ecardleq_2E2(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X31),s(tyop_2Emin_2Efun(X2,tyop_2Emin_2Ebool),X32))))) ),
    file('/export/starexec/sandbox/tmp/tmp.X3zT2FZyMX/E---3.1_17010.p',thm_2Ecardinal_2ECARD__NOT__LE) ).

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

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

cnf(c_0_3,negated_conjecture,
    $false,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13  % Problem    : ITP010_1 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.06/0.14  % Command    : run_E %s %d THM
% 0.13/0.36  % Computer : n007.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   : Fri May  3 12:05:05 EDT 2024
% 0.13/0.36  % CPUTime    : 
% 0.19/0.50  Running first-order model finding
% 0.19/0.50  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.X3zT2FZyMX/E---3.1_17010.p
% 0.19/0.51  # Version: 3.1.0
% 0.19/0.51  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51  # Starting sh5l with 300s (1) cores
% 0.19/0.51  # new_bool_1 with pid 17089 completed with status 0
% 0.19/0.51  # Result found by new_bool_1
% 0.19/0.51  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51  # Search class: FGHSF-FFMF32-MFFFFFNN
% 0.19/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51  # Starting G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.51  # G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 17092 completed with status 0
% 0.19/0.51  # Result found by G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.51  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51  # Search class: FGHSF-FFMF32-MFFFFFNN
% 0.19/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51  # Starting G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.51  # Preprocessing time       : 0.003 s
% 0.19/0.51  # Presaturation interreduction done
% 0.19/0.51  
% 0.19/0.51  # Proof found!
% 0.19/0.51  # SZS status Theorem
% 0.19/0.51  # SZS output start CNFRefutation
% See solution above
% 0.19/0.51  # Parsed axioms                        : 98
% 0.19/0.51  # Removed by relevancy pruning/SinE    : 90
% 0.19/0.51  # Initial clauses                      : 59
% 0.19/0.51  # Removed in clause preprocessing      : 32
% 0.19/0.51  # Initial clauses in saturation        : 27
% 0.19/0.51  # Processed clauses                    : 1
% 0.19/0.51  # ...of these trivial                  : 0
% 0.19/0.51  # ...subsumed                          : 0
% 0.19/0.51  # ...remaining for further processing  : 0
% 0.19/0.51  # Other redundant clauses eliminated   : 0
% 0.19/0.51  # Clauses deleted for lack of memory   : 0
% 0.19/0.51  # Backward-subsumed                    : 0
% 0.19/0.51  # Backward-rewritten                   : 0
% 0.19/0.51  # Generated clauses                    : 0
% 0.19/0.51  # ...of the previous two non-redundant : 0
% 0.19/0.51  # ...aggressively subsumed             : 0
% 0.19/0.51  # Contextual simplify-reflections      : 0
% 0.19/0.51  # Paramodulations                      : 0
% 0.19/0.51  # Factorizations                       : 0
% 0.19/0.51  # NegExts                              : 0
% 0.19/0.51  # Equation resolutions                 : 0
% 0.19/0.51  # Disequality decompositions           : 0
% 0.19/0.51  # Total rewrite steps                  : 0
% 0.19/0.51  # ...of those cached                   : 0
% 0.19/0.51  # Propositional unsat checks           : 0
% 0.19/0.51  #    Propositional check models        : 0
% 0.19/0.51  #    Propositional check unsatisfiable : 0
% 0.19/0.51  #    Propositional clauses             : 0
% 0.19/0.51  #    Propositional clauses after purity: 0
% 0.19/0.51  #    Propositional unsat core size     : 0
% 0.19/0.51  #    Propositional preprocessing time  : 0.000
% 0.19/0.51  #    Propositional encoding time       : 0.000
% 0.19/0.51  #    Propositional solver time         : 0.000
% 0.19/0.51  #    Success case prop preproc time    : 0.000
% 0.19/0.51  #    Success case prop encoding time   : 0.000
% 0.19/0.51  #    Success case prop solver time     : 0.000
% 0.19/0.51  # Current number of processed clauses  : 0
% 0.19/0.51  #    Positive orientable unit clauses  : 0
% 0.19/0.51  #    Positive unorientable unit clauses: 0
% 0.19/0.51  #    Negative unit clauses             : 0
% 0.19/0.51  #    Non-unit-clauses                  : 0
% 0.19/0.51  # Current number of unprocessed clauses: 26
% 0.19/0.51  # ...number of literals in the above   : 89
% 0.19/0.51  # Current number of archived formulas  : 0
% 0.19/0.51  # Current number of archived clauses   : 0
% 0.19/0.51  # Clause-clause subsumption calls (NU) : 0
% 0.19/0.51  # Rec. Clause-clause subsumption calls : 0
% 0.19/0.51  # Non-unit clause-clause subsumptions  : 0
% 0.19/0.51  # Unit Clause-clause subsumption calls : 0
% 0.19/0.51  # Rewrite failures with RHS unbound    : 0
% 0.19/0.51  # BW rewrite match attempts            : 0
% 0.19/0.51  # BW rewrite match successes           : 0
% 0.19/0.51  # Condensation attempts                : 0
% 0.19/0.51  # Condensation successes               : 0
% 0.19/0.51  # Termbank termtop insertions          : 2985
% 0.19/0.51  # Search garbage collected termcells   : 848
% 0.19/0.51  
% 0.19/0.51  # -------------------------------------------------
% 0.19/0.51  # User time                : 0.003 s
% 0.19/0.51  # System time              : 0.003 s
% 0.19/0.51  # Total time               : 0.006 s
% 0.19/0.51  # Maximum resident set size: 1920 pages
% 0.19/0.51  
% 0.19/0.51  # -------------------------------------------------
% 0.19/0.51  # User time                : 0.005 s
% 0.19/0.51  # System time              : 0.006 s
% 0.19/0.51  # Total time               : 0.011 s
% 0.19/0.51  # Maximum resident set size: 1824 pages
% 0.19/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------