↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : ITP214^3 : TPTP v9.3.1. Bugfixed v9.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Sep 30 08:05:53 AM UTC 2026

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

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

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

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

thf(decl_sort4,type,
    set_nat: $tType ).

thf(decl_sort5,type,
    b: $tType ).

thf(decl_44,type,
    rep_assn: assn > produc3658429121746597890et_nat > $o ).

thf(decl_579,type,
    hoare_new_addrs: heap_e7401611519738050253t_unit > set_nat > heap_e7401611519738050253t_unit > set_nat ).

thf(decl_1253,type,
    produc7507926704131184380et_nat: heap_e7401611519738050253t_unit > set_nat > produc3658429121746597890et_nat ).

thf(decl_1665,type,
    q: b > assn ).

thf(decl_1667,type,
    as: set_nat ).

thf(decl_1670,type,
    h: heap_e7401611519738050253t_unit ).

thf(decl_1671,type,
    h2: heap_e7401611519738050253t_unit ).

thf(decl_1672,type,
    h3: heap_e7401611519738050253t_unit ).

thf(decl_1674,type,
    rg: b ).

thf(conj_0,conjecture,
    rep_assn @ ( q @ rg ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h3 @ as @ h ) ),
    file('/export/starexec/sandbox/tmp/tmp.cNpn0Qtdwp/E---3.1_3162274.p',conj_0) ).

thf(fact_3_POST__G,axiom,
    rep_assn @ ( q @ rg ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h2 @ ( hoare_new_addrs @ h3 @ as @ h2 ) @ h ) ),
    file('/export/starexec/sandbox/tmp/tmp.cNpn0Qtdwp/E---3.1_3162274.p',fact_3_POST__G) ).

thf(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/sandbox/tmp/tmp.cNpn0Qtdwp/E---3.1_3162274.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) ).

thf(c_0_3,negated_conjecture,
    ~ ( rep_assn @ ( q @ rg ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h3 @ as @ h ) ) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_4,negated_conjecture,
    ~ ( rep_assn @ ( q @ rg ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h3 @ as @ h ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ~ ( rep_assn @ ( q @ rg ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h3 @ as @ h ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

thf(c_0_6,plain,
    rep_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]) ).

thf(c_0_7,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]) ).

thf(c_0_8,negated_conjecture,
    ~ ( rep_assn @ ( q @ rg ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h3 @ as @ h ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP214^3 : TPTP v9.3.1. Bugfixed v9.2.1.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18  % Computer : n014.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Tue Sep 29 20:15:30 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.23  Running higher-order theorem proving
% 2.57/2.63  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/tmp/tmp.cNpn0Qtdwp/E---3.1_3162274.p
% 24.51/11.19  % Version: 3.5.1-ho
% 24.51/11.19  % partial match(2): HMLMSMSMSSLCHFA
% 24.51/11.19  % Preprocessing class: HMLLSMLMSSLCHFA.
% 24.51/11.19  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 24.51/11.19  % Starting new_ho_10 with 1495s (5) cores
% 24.51/11.19  % Starting sh5l with 299s (1) cores
% 24.51/11.19  % Starting new_bool_1 with 299s (1) cores
% 24.51/11.19  % Starting new_bool_2 with 299s (1) cores
% 24.51/11.19  % new_bool_1 with pid 3162335 completed with status 0
% 24.51/11.19  % Result found by new_bool_1
% 24.51/11.19  % partial match(2): HMLMSMSMSSLCHFA
% 24.51/11.19  % Preprocessing class: HMLLSMLMSSLCHFA.
% 24.51/11.19  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 24.51/11.19  % Starting new_ho_10 with 1495s (5) cores
% 24.51/11.19  % Starting sh5l with 299s (1) cores
% 24.51/11.19  % Starting new_bool_1 with 299s (1) cores
% 24.51/11.19  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 24.51/11.19  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 24.51/11.19  % Search class: HGHSM-SMLM32-DHFFFSBN
% 24.51/11.19  % Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 24.51/11.19  % Starting SubtermCWHack with 30s (1) cores
% 24.51/11.19  % SubtermCWHack with pid 3162353 completed with status 0
% 24.51/11.19  % Result found by SubtermCWHack
% 24.51/11.19  % partial match(2): HMLMSMSMSSLCHFA
% 24.51/11.19  % Preprocessing class: HMLLSMLMSSLCHFA.
% 24.51/11.19  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 24.51/11.19  % Starting new_ho_10 with 1495s (5) cores
% 24.51/11.19  % Starting sh5l with 299s (1) cores
% 24.51/11.19  % Starting new_bool_1 with 299s (1) cores
% 24.51/11.19  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 24.51/11.19  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 24.51/11.19  % Search class: HGHSM-SMLM32-DHFFFSBN
% 24.51/11.19  % Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 24.51/11.19  % Starting SubtermCWHack with 30s (1) cores
% 24.51/11.19  % Preprocessing time       : 0.054 s
% 24.51/11.19  
% 24.51/11.19  % Proof found!
% 24.51/11.19  % SZS status Theorem
% 24.51/11.19  % SZS output start CNFRefutation
% See solution above
% 24.51/11.19  % Parsed axioms                        : 12112
% 24.51/11.19  % Removed by relevancy pruning/SinE    : 10054
% 24.51/11.19  % Initial clauses                      : 3801
% 24.51/11.19  % Removed in clause preprocessing      : 174
% 24.51/11.19  % Initial clauses in saturation        : 3627
% 24.51/11.19  % Processed clauses                    : 27522
% 24.51/11.19  % ...of these trivial                  : 6784
% 24.51/11.19  % ...subsumed                          : 11767
% 24.51/11.19  % ...remaining for further processing  : 8970
% 24.51/11.19  % Other redundant clauses eliminated   : 1368
% 24.51/11.19  % Clauses deleted for lack of memory   : 0
% 24.51/11.19  % Backward-subsumed                    : 439
% 24.51/11.19  % Backward-rewritten                   : 634
% 24.51/11.19  % Generated clauses                    : 312197
% 24.51/11.19  % ...of the previous two non-redundant : 266246
% 24.51/11.19  % ...aggressively subsumed             : 0
% 24.51/11.19  % Contextual simplify-reflections      : 17
% 24.51/11.19  % Paramodulations                      : 310686
% 24.51/11.19  % Factorizations                       : 26
% 24.51/11.19  % NegExts                              : 0
% 24.51/11.19  % Equation resolutions                 : 1400
% 24.51/11.19  % Disequality decompositions           : 0
% 24.51/11.19  % Total rewrite steps                  : 74187
% 24.51/11.19  % ...of those cached                   : 55628
% 24.51/11.19  % Propositional unsat checks           : 0
% 24.51/11.19  %    Propositional check models        : 0
% 24.51/11.19  %    Propositional check unsatisfiable : 0
% 24.51/11.19  %    Propositional clauses             : 0
% 24.51/11.19  %    Propositional clauses after purity: 0
% 24.51/11.19  %    Propositional unsat core size     : 0
% 24.51/11.19  %    Propositional preprocessing time  : 0.000
% 24.51/11.19  %    Propositional encoding time       : 0.000
% 24.51/11.19  %    Propositional solver time         : 0.000
% 24.51/11.19  %    Success case prop preproc time    : 0.000
% 24.51/11.19  %    Success case prop encoding time   : 0.000
% 24.51/11.19  %    Success case prop solver time     : 0.000
% 24.51/11.19  % Current number of processed clauses  : 7681
% 24.51/11.19  %    Positive orientable unit clauses  : 3442
% 24.51/11.19  %    Positive unorientable unit clauses: 20
% 24.51/11.19  %    Negative unit clauses             : 2338
% 24.51/11.19  %    Non-unit-clauses                  : 1881
% 24.51/11.19  % Current number of unprocessed clauses: 240547
% 24.51/11.19  % ...number of literals in the above   : 457289
% 24.51/11.19  % Current number of archived formulas  : 0
% 24.51/11.19  % Current number of archived clauses   : 1075
% 24.51/11.19  % Clause-clause subsumption calls (NU) : 664020
% 24.51/11.19  % Rec. Clause-clause subsumption calls : 446964
% 24.51/11.19  % Non-unit clause-clause subsumptions  : 2420
% 24.51/11.19  % Unit Clause-clause subsumption calls : 1806283
% 24.51/11.19  % Rewrite failures with RHS unbound    : 0
% 24.51/11.19  % BW rewrite match attempts            : 41318
% 24.51/11.19  % BW rewrite match successes           : 1261
% 24.51/11.19  % Condensation attempts                : 0
% 24.51/11.19  % Condensation successes               : 0
% 24.51/11.19  % Termbank termtop insertions          : 4390444
% 24.51/11.19  % Search garbage collected termcells   : 182191
% 24.51/11.19  
% 24.51/11.19  % -------------------------------------------------
% 24.51/11.19  % User time                : 6.510 s
% 24.51/11.19  % System time              : 0.212 s
% 24.51/11.19  % Total time               : 6.722 s
% 24.51/11.19  % Maximum resident set size: 45716 pages
% 24.51/11.19  
% 24.51/11.19  % -------------------------------------------------
% 24.51/11.19  % User time                : 8.237 s
% 24.51/11.19  % System time              : 0.273 s
% 24.51/11.19  % Total time               : 8.510 s
% 24.51/11.19  % Maximum resident set size: 33792 pages
% 24.51/11.19  % E exiting
%------------------------------------------------------------------------------