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

View Problem - Process Solution

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

% Computer : n020.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:09:40 EDT 2024

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

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

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

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

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

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

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

tff(decl_sort7,type,
    option3216581401566546698it_nat: $tType ).

tff(decl_799,type,
    array_of_list_a: list_a > heap_T6362127782908069795rray_a ).

tff(decl_1777,type,
    heap_T5591663578999710211rray_a: heap_T6362127782908069795rray_a > fun_he1504492240061592256it_nat ).

tff(decl_1787,type,
    heap_T6932021131025641745rray_a: heap_T6362127782908069795rray_a > fun_he6201055237484778573t_bool ).

tff(decl_2054,type,
    none_P2587165478634041381it_nat: option3216581401566546698it_nat ).

tff(decl_3362,type,
    aa_hea1793595068369496646t_bool: ( fun_he6201055237484778573t_bool * heap_e7401611519738050253t_unit ) > bool ).

tff(decl_3364,type,
    aa_hea5936688510613671481it_nat: ( fun_he1504492240061592256it_nat * heap_e7401611519738050253t_unit ) > option3216581401566546698it_nat ).

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

tff(decl_4336,type,
    h: heap_e7401611519738050253t_unit ).

tff(decl_4337,type,
    xs: list_a ).

tff(fact_12_success__def,axiom,
    ! [X4: heap_T6362127782908069795rray_a,X2: heap_e7401611519738050253t_unit] :
      ( pp(aa_hea1793595068369496646t_bool(heap_T6932021131025641745rray_a(X4),X2))
    <=> ( aa_hea5936688510613671481it_nat(heap_T5591663578999710211rray_a(X4),X2) != none_P2587165478634041381it_nat ) ),
    file('/export/starexec/sandbox/tmp/tmp.HG3dDmjHXY/E---3.1_14498.p',fact_12_success__def) ).

tff(fact_45_success__of__listI,axiom,
    ! [X67: list_a,X2: heap_e7401611519738050253t_unit] : pp(aa_hea1793595068369496646t_bool(heap_T6932021131025641745rray_a(array_of_list_a(X67)),X2)),
    file('/export/starexec/sandbox/tmp/tmp.HG3dDmjHXY/E---3.1_14498.p',fact_45_success__of__listI) ).

tff(conj_0,conjecture,
    aa_hea5936688510613671481it_nat(heap_T5591663578999710211rray_a(array_of_list_a(xs)),h) != none_P2587165478634041381it_nat,
    file('/export/starexec/sandbox/tmp/tmp.HG3dDmjHXY/E---3.1_14498.p',conj_0) ).

tff(c_0_3,plain,
    ! [X4: heap_T6362127782908069795rray_a,X2: heap_e7401611519738050253t_unit] :
      ( pp(aa_hea1793595068369496646t_bool(heap_T6932021131025641745rray_a(X4),X2))
    <=> ( aa_hea5936688510613671481it_nat(heap_T5591663578999710211rray_a(X4),X2) != none_P2587165478634041381it_nat ) ),
    inference(fof_simplification,[status(thm)],[fact_12_success__def]) ).

tff(c_0_4,plain,
    ! [X18552: heap_T6362127782908069795rray_a,X18553: heap_e7401611519738050253t_unit] :
      ( ( ~ pp(aa_hea1793595068369496646t_bool(heap_T6932021131025641745rray_a(X18552),X18553))
        | ( aa_hea5936688510613671481it_nat(heap_T5591663578999710211rray_a(X18552),X18553) != none_P2587165478634041381it_nat ) )
      & ( ( aa_hea5936688510613671481it_nat(heap_T5591663578999710211rray_a(X18552),X18553) = none_P2587165478634041381it_nat )
        | pp(aa_hea1793595068369496646t_bool(heap_T6932021131025641745rray_a(X18552),X18553)) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

tff(c_0_5,plain,
    ! [X18548: list_a,X18549: heap_e7401611519738050253t_unit] : pp(aa_hea1793595068369496646t_bool(heap_T6932021131025641745rray_a(array_of_list_a(X18548)),X18549)),
    inference(variable_rename,[status(thm)],[fact_45_success__of__listI]) ).

tff(c_0_6,negated_conjecture,
    aa_hea5936688510613671481it_nat(heap_T5591663578999710211rray_a(array_of_list_a(xs)),h) = none_P2587165478634041381it_nat,
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

tcf(c_0_7,plain,
    ! [X1: heap_T6362127782908069795rray_a,X2: heap_e7401611519738050253t_unit] :
      ( ~ pp(aa_hea1793595068369496646t_bool(heap_T6932021131025641745rray_a(X1),X2))
      | ( aa_hea5936688510613671481it_nat(heap_T5591663578999710211rray_a(X1),X2) != none_P2587165478634041381it_nat ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

tcf(c_0_8,plain,
    ! [X67: list_a,X2: heap_e7401611519738050253t_unit] : pp(aa_hea1793595068369496646t_bool(heap_T6932021131025641745rray_a(array_of_list_a(X67)),X2)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

tcf(c_0_9,negated_conjecture,
    aa_hea5936688510613671481it_nat(heap_T5591663578999710211rray_a(array_of_list_a(xs)),h) = none_P2587165478634041381it_nat,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

tcf(c_0_10,plain,
    ! [X67: list_a,X2: heap_e7401611519738050253t_unit] : aa_hea5936688510613671481it_nat(heap_T5591663578999710211rray_a(array_of_list_a(X67)),X2) != none_P2587165478634041381it_nat,
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : ITP216_1 : TPTP v8.1.2. Released v8.0.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.15/0.36  % Computer : n020.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   : Fri May  3 12:10:16 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 10.95/11.23  Running first-order model finding
% 10.95/11.23  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.HG3dDmjHXY/E---3.1_14498.p
% 12.39/12.19  # Version: 3.1.0
% 12.39/12.19  # Preprocessing class: FMLLSMLLSSSNFFN.
% 12.39/12.19  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.39/12.19  # Starting new_bool_3 with 900s (3) cores
% 12.39/12.19  # Starting new_bool_1 with 900s (3) cores
% 12.39/12.19  # Starting sh5l with 300s (1) cores
% 12.39/12.19  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 12.39/12.19  # new_bool_3 with pid 15274 completed with status 0
% 12.39/12.19  # Result found by new_bool_3
% 12.39/12.19  # Preprocessing class: FMLLSMLLSSSNFFN.
% 12.39/12.19  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.39/12.19  # Starting new_bool_3 with 900s (3) cores
% 12.39/12.19  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 12.39/12.19  # Search class: FGHSF-FFSF21-MFFFFFNN
% 12.39/12.19  # Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 12.39/12.19  # Starting SAT001_CO_MinMin_p005000_rr with 541s (1) cores
% 12.39/12.19  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 91s (1) cores
% 12.39/12.19  # Starting new_bool_3 with 91s (1) cores
% 12.39/12.19  # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 15279 completed with status 0
% 12.39/12.19  # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 12.39/12.19  # Preprocessing class: FMLLSMLLSSSNFFN.
% 12.39/12.19  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.39/12.19  # Starting new_bool_3 with 900s (3) cores
% 12.39/12.19  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 12.39/12.19  # Search class: FGHSF-FFSF21-MFFFFFNN
% 12.39/12.19  # Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 12.39/12.19  # Starting SAT001_CO_MinMin_p005000_rr with 541s (1) cores
% 12.39/12.19  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 91s (1) cores
% 12.39/12.19  # Preprocessing time       : 0.006 s
% 12.39/12.19  # Presaturation interreduction done
% 12.39/12.19  
% 12.39/12.19  # Proof found!
% 12.39/12.19  # SZS status Theorem
% 12.39/12.19  # SZS output start CNFRefutation
% See solution above
% 12.39/12.19  # Parsed axioms                        : 14580
% 12.39/12.19  # Removed by relevancy pruning/SinE    : 14567
% 12.39/12.19  # Initial clauses                      : 17
% 12.39/12.19  # Removed in clause preprocessing      : 0
% 12.39/12.19  # Initial clauses in saturation        : 17
% 12.39/12.19  # Processed clauses                    : 30
% 12.39/12.19  # ...of these trivial                  : 0
% 12.39/12.19  # ...subsumed                          : 5
% 12.39/12.19  # ...remaining for further processing  : 25
% 12.39/12.19  # Other redundant clauses eliminated   : 4
% 12.39/12.19  # Clauses deleted for lack of memory   : 0
% 12.39/12.19  # Backward-subsumed                    : 0
% 12.39/12.19  # Backward-rewritten                   : 0
% 12.39/12.19  # Generated clauses                    : 10
% 12.39/12.19  # ...of the previous two non-redundant : 5
% 12.39/12.19  # ...aggressively subsumed             : 0
% 12.39/12.19  # Contextual simplify-reflections      : 0
% 12.39/12.19  # Paramodulations                      : 5
% 12.39/12.19  # Factorizations                       : 0
% 12.39/12.19  # NegExts                              : 0
% 12.39/12.19  # Equation resolutions                 : 4
% 12.39/12.19  # Disequality decompositions           : 0
% 12.39/12.19  # Total rewrite steps                  : 0
% 12.39/12.19  # ...of those cached                   : 0
% 12.39/12.19  # Propositional unsat checks           : 0
% 12.39/12.19  #    Propositional check models        : 0
% 12.39/12.19  #    Propositional check unsatisfiable : 0
% 12.39/12.19  #    Propositional clauses             : 0
% 12.39/12.19  #    Propositional clauses after purity: 0
% 12.39/12.19  #    Propositional unsat core size     : 0
% 12.39/12.19  #    Propositional preprocessing time  : 0.000
% 12.39/12.19  #    Propositional encoding time       : 0.000
% 12.39/12.19  #    Propositional solver time         : 0.000
% 12.39/12.19  #    Success case prop preproc time    : 0.000
% 12.39/12.19  #    Success case prop encoding time   : 0.000
% 12.39/12.19  #    Success case prop solver time     : 0.000
% 12.39/12.19  # Current number of processed clauses  : 8
% 12.39/12.19  #    Positive orientable unit clauses  : 1
% 12.39/12.19  #    Positive unorientable unit clauses: 0
% 12.39/12.19  #    Negative unit clauses             : 2
% 12.39/12.19  #    Non-unit-clauses                  : 5
% 12.39/12.19  # Current number of unprocessed clauses: 4
% 12.39/12.19  # ...number of literals in the above   : 8
% 12.39/12.19  # Current number of archived formulas  : 0
% 12.39/12.19  # Current number of archived clauses   : 13
% 12.39/12.19  # Clause-clause subsumption calls (NU) : 19
% 12.39/12.19  # Rec. Clause-clause subsumption calls : 19
% 12.39/12.19  # Non-unit clause-clause subsumptions  : 1
% 12.39/12.19  # Unit Clause-clause subsumption calls : 1
% 12.39/12.19  # Rewrite failures with RHS unbound    : 0
% 12.39/12.19  # BW rewrite match attempts            : 2
% 12.39/12.19  # BW rewrite match successes           : 0
% 12.39/12.19  # Condensation attempts                : 0
% 12.39/12.19  # Condensation successes               : 0
% 12.39/12.19  # Termbank termtop insertions          : 165282
% 12.39/12.19  # Search garbage collected termcells   : 110059
% 12.39/12.19  
% 12.39/12.19  # -------------------------------------------------
% 12.39/12.19  # User time                : 0.062 s
% 12.39/12.19  # System time              : 0.041 s
% 12.39/12.19  # Total time               : 0.103 s
% 12.39/12.19  # Maximum resident set size: 35860 pages
% 12.39/12.19  
% 12.39/12.19  # -------------------------------------------------
% 12.39/12.19  # User time                : 0.892 s
% 12.39/12.19  # System time              : 0.080 s
% 12.39/12.19  # Total time               : 0.972 s
% 12.39/12.19  # Maximum resident set size: 27612 pages
% 12.39/12.19  % E---3.1 exiting
%------------------------------------------------------------------------------