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

View Problem - Process Solution

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

% Computer : n022.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:39 EDT 2024

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

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

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

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

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

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

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

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

tff(decl_sort8,type,
    produc3658429121746597890et_nat: $tType ).

tff(decl_1145,type,
    rep_assn: assn > fun_Pr6001797050664311790t_bool ).

tff(decl_1680,type,
    hoare_new_addrs: ( heap_e7401611519738050253t_unit * set_nat * heap_e7401611519738050253t_unit ) > set_nat ).

tff(decl_2329,type,
    produc7507926704131184380et_nat: ( heap_e7401611519738050253t_unit * set_nat ) > produc3658429121746597890et_nat ).

tff(decl_3005,type,
    aa_Pro2991721470636411351t_bool: ( fun_Pr6001797050664311790t_bool * produc3658429121746597890et_nat ) > bool ).

tff(decl_3463,type,
    aa_b_assn: ( fun_b_assn * b ) > assn ).

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

tff(decl_3544,type,
    q: fun_b_assn ).

tff(decl_3546,type,
    as: set_nat ).

tff(decl_3549,type,
    h: heap_e7401611519738050253t_unit ).

tff(decl_3550,type,
    h2: heap_e7401611519738050253t_unit ).

tff(decl_3551,type,
    h3: heap_e7401611519738050253t_unit ).

tff(decl_3553,type,
    rg: b ).

tff(conj_0,conjecture,
    pp(aa_Pro2991721470636411351t_bool(rep_assn(aa_b_assn(q,rg)),produc7507926704131184380et_nat(h,hoare_new_addrs(h3,as,h)))),
    file('/export/starexec/sandbox2/tmp/tmp.yMFAP6ocWP/E---3.1_30966.p',conj_0) ).

tff(fact_3_POST__G,axiom,
    pp(aa_Pro2991721470636411351t_bool(rep_assn(aa_b_assn(q,rg)),produc7507926704131184380et_nat(h,hoare_new_addrs(h2,hoare_new_addrs(h3,as,h2),h)))),
    file('/export/starexec/sandbox2/tmp/tmp.yMFAP6ocWP/E---3.1_30966.p',fact_3_POST__G) ).

tff(fact_0__092_060open_062new__addrs_Ah_H_A_Inew__addrs_Ah_Aas_Ah_H_J_Ah_H_H_A_061_Anew__addrs_Ah_Aas_Ah_H_H_092_060close_062,axiom,
    hoare_new_addrs(h2,hoare_new_addrs(h3,as,h2),h) = hoare_new_addrs(h3,as,h),
    file('/export/starexec/sandbox2/tmp/tmp.yMFAP6ocWP/E---3.1_30966.p',fact_0__092_060open_062new__addrs_Ah_H_A_Inew__addrs_Ah_Aas_Ah_H_J_Ah_H_H_A_061_Anew__addrs_Ah_Aas_Ah_H_H_092_060close_062) ).

tff(c_0_3,negated_conjecture,
    ~ pp(aa_Pro2991721470636411351t_bool(rep_assn(aa_b_assn(q,rg)),produc7507926704131184380et_nat(h,hoare_new_addrs(h3,as,h)))),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

tff(c_0_4,negated_conjecture,
    ~ pp(aa_Pro2991721470636411351t_bool(rep_assn(aa_b_assn(q,rg)),produc7507926704131184380et_nat(h,hoare_new_addrs(h3,as,h)))),
    inference(fof_nnf,[status(thm)],[c_0_3]) ).

tcf(c_0_5,plain,
    pp(aa_Pro2991721470636411351t_bool(rep_assn(aa_b_assn(q,rg)),produc7507926704131184380et_nat(h,hoare_new_addrs(h2,hoare_new_addrs(h3,as,h2),h)))),
    inference(split_conjunct,[status(thm)],[fact_3_POST__G]) ).

tcf(c_0_6,plain,
    hoare_new_addrs(h2,hoare_new_addrs(h3,as,h2),h) = hoare_new_addrs(h3,as,h),
    inference(split_conjunct,[status(thm)],[fact_0__092_060open_062new__addrs_Ah_H_A_Inew__addrs_Ah_Aas_Ah_H_J_Ah_H_H_A_061_Anew__addrs_Ah_Aas_Ah_H_H_092_060close_062]) ).

tcf(c_0_7,negated_conjecture,
    ~ pp(aa_Pro2991721470636411351t_bool(rep_assn(aa_b_assn(q,rg)),produc7507926704131184380et_nat(h,hoare_new_addrs(h3,as,h)))),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_7]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : ITP214_1 : TPTP v8.1.2. Released v8.0.0.
% 0.14/0.15  % Command    : run_E %s %d THM
% 0.14/0.36  % Computer : n022.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Fri May  3 12:25:12 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 14.16/14.32  Running first-order model finding
% 14.16/14.32  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.yMFAP6ocWP/E---3.1_30966.p
% 17.46/15.98  # Version: 3.1.0
% 17.46/15.98  # Preprocessing class: FMLLSMLLSSSNFFN.
% 17.46/15.98  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 17.46/15.98  # Starting new_bool_3 with 897s (3) cores
% 17.46/15.98  # Starting new_bool_1 with 897s (3) cores
% 17.46/15.98  # Starting sh5l with 299s (1) cores
% 17.46/15.98  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 17.46/15.98  # new_bool_3 with pid 31636 completed with status 0
% 17.46/15.98  # Result found by new_bool_3
% 17.46/15.98  # Preprocessing class: FMLLSMLLSSSNFFN.
% 17.46/15.98  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 17.46/15.98  # Starting new_bool_3 with 897s (3) cores
% 17.46/15.98  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 17.46/15.98  # Search class: FGHSM-SMLM32-DFFFFFNN
% 17.46/15.98  # Scheduled 13 strats onto 3 cores with 897 seconds (897 total)
% 17.46/15.98  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 17.46/15.98  # Starting new_bool_3 with 90s (1) cores
% 17.46/15.98  # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 17.46/15.98  # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 31642 completed with status 0
% 17.46/15.98  # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 17.46/15.98  # Preprocessing class: FMLLSMLLSSSNFFN.
% 17.46/15.98  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 17.46/15.98  # Starting new_bool_3 with 897s (3) cores
% 17.46/15.98  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 17.46/15.98  # Search class: FGHSM-SMLM32-DFFFFFNN
% 17.46/15.98  # Scheduled 13 strats onto 3 cores with 897 seconds (897 total)
% 17.46/15.98  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 17.46/15.98  # Starting new_bool_3 with 90s (1) cores
% 17.46/15.98  # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 17.46/15.98  # Preprocessing time       : 0.051 s
% 17.46/15.98  
% 17.46/15.98  # Proof found!
% 17.46/15.98  # SZS status Theorem
% 17.46/15.98  # SZS output start CNFRefutation
% See solution above
% 17.46/15.98  # Parsed axioms                        : 15926
% 17.46/15.98  # Removed by relevancy pruning/SinE    : 14930
% 17.46/15.98  # Initial clauses                      : 1814
% 17.46/15.98  # Removed in clause preprocessing      : 35
% 17.46/15.98  # Initial clauses in saturation        : 1779
% 17.46/15.98  # Processed clauses                    : 35
% 17.46/15.98  # ...of these trivial                  : 0
% 17.46/15.98  # ...subsumed                          : 9
% 17.46/15.98  # ...remaining for further processing  : 25
% 17.46/15.98  # Other redundant clauses eliminated   : 0
% 17.46/15.98  # Clauses deleted for lack of memory   : 0
% 17.46/15.98  # Backward-subsumed                    : 1
% 17.46/15.98  # Backward-rewritten                   : 0
% 17.46/15.98  # Generated clauses                    : 8
% 17.46/15.98  # ...of the previous two non-redundant : 6
% 17.46/15.98  # ...aggressively subsumed             : 0
% 17.46/15.98  # Contextual simplify-reflections      : 0
% 17.46/15.98  # Paramodulations                      : 7
% 17.46/15.98  # Factorizations                       : 0
% 17.46/15.98  # NegExts                              : 0
% 17.46/15.98  # Equation resolutions                 : 1
% 17.46/15.98  # Disequality decompositions           : 0
% 17.46/15.98  # Total rewrite steps                  : 1
% 17.46/15.98  # ...of those cached                   : 0
% 17.46/15.98  # Propositional unsat checks           : 0
% 17.46/15.98  #    Propositional check models        : 0
% 17.46/15.98  #    Propositional check unsatisfiable : 0
% 17.46/15.98  #    Propositional clauses             : 0
% 17.46/15.98  #    Propositional clauses after purity: 0
% 17.46/15.98  #    Propositional unsat core size     : 0
% 17.46/15.98  #    Propositional preprocessing time  : 0.000
% 17.46/15.98  #    Propositional encoding time       : 0.000
% 17.46/15.98  #    Propositional solver time         : 0.000
% 17.46/15.98  #    Success case prop preproc time    : 0.000
% 17.46/15.98  #    Success case prop encoding time   : 0.000
% 17.46/15.98  #    Success case prop solver time     : 0.000
% 17.46/15.98  # Current number of processed clauses  : 24
% 17.46/15.98  #    Positive orientable unit clauses  : 9
% 17.46/15.98  #    Positive unorientable unit clauses: 0
% 17.46/15.98  #    Negative unit clauses             : 8
% 17.46/15.98  #    Non-unit-clauses                  : 7
% 17.46/15.98  # Current number of unprocessed clauses: 1750
% 17.46/15.98  # ...number of literals in the above   : 5102
% 17.46/15.98  # Current number of archived formulas  : 0
% 17.46/15.98  # Current number of archived clauses   : 1
% 17.46/15.98  # Clause-clause subsumption calls (NU) : 6
% 17.46/15.98  # Rec. Clause-clause subsumption calls : 6
% 17.46/15.98  # Non-unit clause-clause subsumptions  : 1
% 17.46/15.98  # Unit Clause-clause subsumption calls : 15
% 17.46/15.98  # Rewrite failures with RHS unbound    : 0
% 17.46/15.98  # BW rewrite match attempts            : 4
% 17.46/15.98  # BW rewrite match successes           : 0
% 17.46/15.98  # Condensation attempts                : 0
% 17.46/15.98  # Condensation successes               : 0
% 17.46/15.98  # Termbank termtop insertions          : 377979
% 17.46/15.98  # Search garbage collected termcells   : 178244
% 17.46/15.98  
% 17.46/15.98  # -------------------------------------------------
% 17.46/15.98  # User time                : 0.399 s
% 17.46/15.98  # System time              : 0.057 s
% 17.46/15.98  # Total time               : 0.456 s
% 17.46/15.98  # Maximum resident set size: 43372 pages
% 17.46/15.98  
% 17.46/15.98  # -------------------------------------------------
% 17.46/15.98  # User time                : 1.646 s
% 17.46/15.98  # System time              : 0.123 s
% 17.46/15.98  # Total time               : 1.769 s
% 17.46/15.98  # Maximum resident set size: 35256 pages
% 17.46/15.98  % E---3.1 exiting
%------------------------------------------------------------------------------