TSTP Solution File: ITP236_1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP236_1 : TPTP v8.1.2. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n002.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:07:41 EDT 2024

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

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

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

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

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

tff(decl_sort5,type,
    fun_VE3763956218935105199t_bool: $tType ).

tff(decl_sort6,type,
    vEBT_VEBT: $tType ).

tff(decl_1192,type,
    nth_VEBT_VEBT: ( list_VEBT_VEBT * nat ) > vEBT_VEBT ).

tff(decl_1728,type,
    vEBT_V8194947554948674370ptions: fun_VE3763956218935105199t_bool ).

tff(decl_1860,type,
    aa_nat_bool: ( fun_nat_bool * nat ) > bool ).

tff(decl_2023,type,
    aa_VEB4832260192069861672t_bool: ( fun_VE3763956218935105199t_bool * vEBT_VEBT ) > fun_nat_bool ).

tff(decl_2302,type,
    pp: bool > $o ).

tff(decl_2306,type,
    maxs: nat ).

tff(decl_2310,type,
    thesis: $o ).

tff(decl_2311,type,
    treeList: list_VEBT_VEBT ).

tff(decl_2354,type,
    esk38_0: nat ).

fof(conj_1,conjecture,
    thesis,
    file('/export/starexec/sandbox/tmp/tmp.3byKrTgYwl/E---3.1_6426.p',conj_1) ).

tff(conj_0,hypothesis,
    ! [X19779: nat] :
      ( pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,maxs)),X19779))
     => thesis ),
    file('/export/starexec/sandbox/tmp/tmp.3byKrTgYwl/E---3.1_6426.p',conj_0) ).

tff(fact_0__092_060open_062_092_060exists_062x_O_Aboth__member__options_A_ItreeList_A_B_Amaxs_J_Ax_092_060close_062,axiom,
    ? [X1: nat] : pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,maxs)),X1)),
    file('/export/starexec/sandbox/tmp/tmp.3byKrTgYwl/E---3.1_6426.p',fact_0__092_060open_062_092_060exists_062x_O_Aboth__member__options_A_ItreeList_A_B_Amaxs_J_Ax_092_060close_062) ).

fof(c_0_3,negated_conjecture,
    ~ thesis,
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])]) ).

tff(c_0_4,hypothesis,
    ! [X19780: nat] :
      ( ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,maxs)),X19780))
      | thesis ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_0])])]) ).

fof(c_0_5,negated_conjecture,
    ~ thesis,
    inference(fof_nnf,[status(thm)],[c_0_3]) ).

tff(c_0_6,plain,
    pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,maxs)),esk38_0)),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[fact_0__092_060open_062_092_060exists_062x_O_Aboth__member__options_A_ItreeList_A_B_Amaxs_J_Ax_092_060close_062])]) ).

tcf(c_0_7,hypothesis,
    ! [X1: nat] :
      ( thesis
      | ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,maxs)),X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    ~ thesis,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

tcf(c_0_9,plain,
    pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,maxs)),esk38_0)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

tcf(c_0_10,hypothesis,
    ! [X1: nat] : ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,maxs)),X1)),
    inference(sr,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,plain,
    $false,
    inference(sr,[status(thm)],[c_0_9,c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 10.95/11.04  % Problem    : ITP236_1 : TPTP v8.1.2. Released v8.0.0.
% 10.95/11.06  % Command    : run_E %s %d THM
% 11.03/11.25  % Computer : n002.cluster.edu
% 11.03/11.25  % Model    : x86_64 x86_64
% 11.03/11.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 11.03/11.25  % Memory   : 8042.1875MB
% 11.03/11.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 11.03/11.25  % CPULimit   : 300
% 11.03/11.25  % WCLimit    : 300
% 11.03/11.25  % DateTime   : Fri May  3 12:35:53 EDT 2024
% 11.03/11.25  % CPUTime    : 
% 19.66/19.90  Running first-order theorem proving
% 19.66/19.90  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.3byKrTgYwl/E---3.1_6426.p
% 25.05/21.84  # Version: 3.1.0
% 25.05/21.84  # Preprocessing class: FMLLSMLLSSSNFFN.
% 25.05/21.84  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.05/21.84  # Starting new_bool_3 with 900s (3) cores
% 25.05/21.84  # Starting new_bool_1 with 900s (3) cores
% 25.05/21.84  # Starting sh5l with 300s (1) cores
% 25.05/21.84  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 25.05/21.84  # new_bool_1 with pid 6925 completed with status 0
% 25.05/21.84  # Result found by new_bool_1
% 25.05/21.84  # Preprocessing class: FMLLSMLLSSSNFFN.
% 25.05/21.84  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.05/21.84  # Starting new_bool_3 with 900s (3) cores
% 25.05/21.84  # Starting new_bool_1 with 900s (3) cores
% 25.05/21.84  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 25.05/21.84  # Search class: FGHSM-SMLM32-DFFFFFNN
% 25.05/21.84  # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 25.05/21.84  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 25.05/21.84  # Starting new_bool_1 with 91s (1) cores
% 25.05/21.84  # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 25.05/21.84  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with pid 6928 completed with status 0
% 25.05/21.84  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y
% 25.05/21.84  # Preprocessing class: FMLLSMLLSSSNFFN.
% 25.05/21.84  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.05/21.84  # Starting new_bool_3 with 900s (3) cores
% 25.05/21.84  # Starting new_bool_1 with 900s (3) cores
% 25.05/21.84  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 25.05/21.84  # Search class: FGHSM-SMLM32-DFFFFFNN
% 25.05/21.84  # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 25.05/21.84  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 25.05/21.84  # Preprocessing time       : 0.133 s
% 25.05/21.84  # Presaturation interreduction done
% 25.05/21.84  
% 25.05/21.84  # Proof found!
% 25.05/21.84  # SZS status Theorem
% 25.05/21.84  # SZS output start CNFRefutation
% See solution above
% 25.05/21.84  # Parsed axioms                        : 13486
% 25.05/21.84  # Removed by relevancy pruning/SinE    : 11346
% 25.05/21.84  # Initial clauses                      : 6943
% 25.05/21.84  # Removed in clause preprocessing      : 1808
% 25.05/21.84  # Initial clauses in saturation        : 5135
% 25.05/21.84  # Processed clauses                    : 733
% 25.05/21.84  # ...of these trivial                  : 46
% 25.05/21.84  # ...subsumed                          : 138
% 25.05/21.84  # ...remaining for further processing  : 548
% 25.05/21.84  # Other redundant clauses eliminated   : 213
% 25.05/21.84  # Clauses deleted for lack of memory   : 0
% 25.05/21.84  # Backward-subsumed                    : 8
% 25.05/21.84  # Backward-rewritten                   : 6
% 25.05/21.84  # Generated clauses                    : 201
% 25.05/21.84  # ...of the previous two non-redundant : 108
% 25.05/21.84  # ...aggressively subsumed             : 0
% 25.05/21.84  # Contextual simplify-reflections      : 1
% 25.05/21.84  # Paramodulations                      : 0
% 25.05/21.84  # Factorizations                       : 0
% 25.05/21.84  # NegExts                              : 0
% 25.05/21.84  # Equation resolutions                 : 213
% 25.05/21.84  # Disequality decompositions           : 0
% 25.05/21.84  # Total rewrite steps                  : 186
% 25.05/21.84  # ...of those cached                   : 123
% 25.05/21.84  # Propositional unsat checks           : 0
% 25.05/21.84  #    Propositional check models        : 0
% 25.05/21.84  #    Propositional check unsatisfiable : 0
% 25.05/21.84  #    Propositional clauses             : 0
% 25.05/21.84  #    Propositional clauses after purity: 0
% 25.05/21.84  #    Propositional unsat core size     : 0
% 25.05/21.84  #    Propositional preprocessing time  : 0.000
% 25.05/21.84  #    Propositional encoding time       : 0.000
% 25.05/21.84  #    Propositional solver time         : 0.000
% 25.05/21.84  #    Success case prop preproc time    : 0.000
% 25.05/21.84  #    Success case prop encoding time   : 0.000
% 25.05/21.84  #    Success case prop solver time     : 0.000
% 25.05/21.84  # Current number of processed clauses  : 333
% 25.05/21.84  #    Positive orientable unit clauses  : 97
% 25.05/21.84  #    Positive unorientable unit clauses: 0
% 25.05/21.84  #    Negative unit clauses             : 71
% 25.05/21.84  #    Non-unit-clauses                  : 165
% 25.05/21.84  # Current number of unprocessed clauses: 4510
% 25.05/21.84  # ...number of literals in the above   : 22006
% 25.05/21.84  # Current number of archived formulas  : 0
% 25.05/21.84  # Current number of archived clauses   : 14
% 25.05/21.84  # Clause-clause subsumption calls (NU) : 8238
% 25.05/21.84  # Rec. Clause-clause subsumption calls : 7039
% 25.05/21.84  # Non-unit clause-clause subsumptions  : 114
% 25.05/21.84  # Unit Clause-clause subsumption calls : 208
% 25.05/21.84  # Rewrite failures with RHS unbound    : 0
% 25.05/21.84  # BW rewrite match attempts            : 265
% 25.05/21.84  # BW rewrite match successes           : 6
% 25.05/21.84  # Condensation attempts                : 0
% 25.05/21.84  # Condensation successes               : 0
% 25.05/21.84  # Termbank termtop insertions          : 834836
% 25.05/21.84  # Search garbage collected termcells   : 191110
% 25.05/21.84  
% 25.05/21.84  # -------------------------------------------------
% 25.05/21.84  # User time                : 0.867 s
% 25.05/21.84  # System time              : 0.071 s
% 25.05/21.84  # Total time               : 0.938 s
% 25.05/21.84  # Maximum resident set size: 43884 pages
% 25.05/21.84  
% 25.05/21.84  # -------------------------------------------------
% 25.05/21.84  # User time                : 2.114 s
% 25.05/21.84  # System time              : 0.132 s
% 25.05/21.84  # Total time               : 2.246 s
% 25.05/21.84  # Maximum resident set size: 30348 pages
% 25.05/21.84  % E---3.1 exiting
% 25.09/21.89  % E exiting
%------------------------------------------------------------------------------