TSTP Solution File: ITP207^3 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP207^3 : TPTP v8.2.0. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n019.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 : Mon May 20 22:16:50 EDT 2024

% Result   : Theorem 2.92s 1.81s
% Output   : CNFRefutation 2.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   34 (  10 unt;  18 typ;   0 def)
%            Number of atoms       :   23 (  10 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   77 (   8   ~;   4   |;   0   &;  63   @)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Number of types       :    8 (   7 usr)
%            Number of type conns  :   16 (  16   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  11 usr;   5 con; 0-2 aty)
%            Number of variables   :   18 (   0   ^  18   !;   0   ?;  18   :)

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

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

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

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

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

thf(decl_sort6,type,
    a: $tType ).

thf(decl_sort7,type,
    produc6653097349344004940it_nat: $tType ).

thf(decl_397,type,
    one_one_nat: nat ).

thf(decl_501,type,
    heap_Time_assert_a: ( a > $o ) > a > heap_Time_Heap_a ).

thf(decl_509,type,
    heap_Time_execute_a: heap_Time_Heap_a > heap_e7401611519738050253t_unit > option3562590408128118217it_nat ).

thf(decl_519,type,
    heap_Time_success_a: heap_Time_Heap_a > heap_e7401611519738050253t_unit > $o ).

thf(decl_714,type,
    none_P2651198173097904984it_nat: option3562590408128118217it_nat ).

thf(decl_717,type,
    some_P7913643980934408916it_nat: produc3260487557148687353it_nat > option3562590408128118217it_nat ).

thf(decl_838,type,
    produc584006145561248582it_nat: heap_e7401611519738050253t_unit > nat > produc6653097349344004940it_nat ).

thf(decl_855,type,
    produc9178034014595674355it_nat: a > produc6653097349344004940it_nat > produc3260487557148687353it_nat ).

thf(decl_1217,type,
    p: a > $o ).

thf(decl_1218,type,
    h: heap_e7401611519738050253t_unit ).

thf(decl_1219,type,
    x: a ).

thf(conj_1,conjecture,
    heap_Time_success_a @ ( heap_Time_assert_a @ p @ x ) @ h,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).

thf(fact_10_successI,axiom,
    ! [X21: heap_Time_Heap_a,X3: heap_e7401611519738050253t_unit] :
      ( ( ( heap_Time_execute_a @ X21 @ X3 )
       != none_P2651198173097904984it_nat )
     => ( heap_Time_success_a @ X21 @ X3 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_10_successI) ).

thf(fact_350_execute__assert_I1_J,axiom,
    ! [X909: a > $o,X8: a,X3: heap_e7401611519738050253t_unit] :
      ( ( X909 @ X8 )
     => ( ( heap_Time_execute_a @ ( heap_Time_assert_a @ X909 @ X8 ) @ X3 )
        = ( some_P7913643980934408916it_nat @ ( produc9178034014595674355it_nat @ X8 @ ( produc584006145561248582it_nat @ X3 @ one_one_nat ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_350_execute__assert_I1_J) ).

thf(fact_76_option_Odistinct_I1_J,axiom,
    ! [X165: produc3260487557148687353it_nat] :
      ( none_P2651198173097904984it_nat
     != ( some_P7913643980934408916it_nat @ X165 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_76_option_Odistinct_I1_J) ).

thf(conj_0,hypothesis,
    p @ x,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

thf(c_0_5,negated_conjecture,
    ~ ( heap_Time_success_a @ ( heap_Time_assert_a @ p @ x ) @ h ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])]) ).

thf(c_0_6,plain,
    ! [X18148: heap_Time_Heap_a,X18149: heap_e7401611519738050253t_unit] :
      ( ( ( heap_Time_execute_a @ X18148 @ X18149 )
        = none_P2651198173097904984it_nat )
      | ( heap_Time_success_a @ X18148 @ X18149 ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_10_successI])]) ).

thf(c_0_7,plain,
    ! [X18163: a > $o,X18164: a,X18165: heap_e7401611519738050253t_unit] :
      ( ~ ( X18163 @ X18164 )
      | ( ( heap_Time_execute_a @ ( heap_Time_assert_a @ X18163 @ X18164 ) @ X18165 )
        = ( some_P7913643980934408916it_nat @ ( produc9178034014595674355it_nat @ X18164 @ ( produc584006145561248582it_nat @ X18165 @ one_one_nat ) ) ) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_350_execute__assert_I1_J])]) ).

thf(c_0_8,negated_conjecture,
    ~ ( heap_Time_success_a @ ( heap_Time_assert_a @ p @ x ) @ h ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_9,plain,
    ! [X2: heap_Time_Heap_a,X3: heap_e7401611519738050253t_unit] :
      ( ( ( heap_Time_execute_a @ X2 @ X3 )
        = none_P2651198173097904984it_nat )
      | ( heap_Time_success_a @ X2 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_10,plain,
    ! [X18259: produc3260487557148687353it_nat] :
      ( none_P2651198173097904984it_nat
     != ( some_P7913643980934408916it_nat @ X18259 ) ),
    inference(variable_rename,[status(thm)],[fact_76_option_Odistinct_I1_J]) ).

thf(c_0_11,plain,
    ! [X3: heap_e7401611519738050253t_unit,X18: a > $o,X8: a] :
      ( ( ( heap_Time_execute_a @ ( heap_Time_assert_a @ X18 @ X8 ) @ X3 )
        = ( some_P7913643980934408916it_nat @ ( produc9178034014595674355it_nat @ X8 @ ( produc584006145561248582it_nat @ X3 @ one_one_nat ) ) ) )
      | ~ ( X18 @ X8 ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_12,negated_conjecture,
    ( ( heap_Time_execute_a @ ( heap_Time_assert_a @ p @ x ) @ h )
    = none_P2651198173097904984it_nat ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

thf(c_0_13,hypothesis,
    p @ x,
    inference(split_conjunct,[status(thm)],[conj_0]) ).

thf(c_0_14,plain,
    ! [X51: produc3260487557148687353it_nat] :
      ( none_P2651198173097904984it_nat
     != ( some_P7913643980934408916it_nat @ X51 ) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_15,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13  % Problem    : ITP207^3 : TPTP v8.2.0. Released v8.1.0.
% 0.10/0.14  % Command    : run_E %s %d THM
% 0.14/0.36  % Computer : n019.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   : Sat May 18 18:05:08 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.21/0.50  Running higher-order theorem proving
% 0.21/0.50  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 2.92/1.81  # Version: 3.1.0-ho
% 2.92/1.81  # partial match(2): HMLMSMSMSSLCHSA
% 2.92/1.81  # Preprocessing class: HMLLSMLMSSLCHSA.
% 2.92/1.81  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.92/1.81  # Starting new_ho_10 with 1500s (5) cores
% 2.92/1.81  # Starting sh5l with 300s (1) cores
% 2.92/1.81  # Starting new_bool_1 with 300s (1) cores
% 2.92/1.81  # Starting new_bool_2 with 300s (1) cores
% 2.92/1.81  # new_bool_2 with pid 13436 completed with status 0
% 2.92/1.81  # Result found by new_bool_2
% 2.92/1.81  # partial match(2): HMLMSMSMSSLCHSA
% 2.92/1.81  # Preprocessing class: HMLLSMLMSSLCHSA.
% 2.92/1.81  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.92/1.81  # Starting new_ho_10 with 1500s (5) cores
% 2.92/1.81  # Starting sh5l with 300s (1) cores
% 2.92/1.81  # Starting new_bool_1 with 300s (1) cores
% 2.92/1.81  # Starting new_bool_2 with 300s (1) cores
% 2.92/1.81  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.92/1.81  # Search class: HGHSM-FSLM32-DHSFFSBN
% 2.92/1.81  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.92/1.81  # Starting full_lambda_3 with 139s (1) cores
% 2.92/1.81  # full_lambda_3 with pid 13438 completed with status 0
% 2.92/1.81  # Result found by full_lambda_3
% 2.92/1.81  # partial match(2): HMLMSMSMSSLCHSA
% 2.92/1.81  # Preprocessing class: HMLLSMLMSSLCHSA.
% 2.92/1.81  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.92/1.81  # Starting new_ho_10 with 1500s (5) cores
% 2.92/1.81  # Starting sh5l with 300s (1) cores
% 2.92/1.81  # Starting new_bool_1 with 300s (1) cores
% 2.92/1.81  # Starting new_bool_2 with 300s (1) cores
% 2.92/1.81  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.92/1.81  # Search class: HGHSM-FSLM32-DHSFFSBN
% 2.92/1.81  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.92/1.81  # Starting full_lambda_3 with 139s (1) cores
% 2.92/1.81  # Preprocessing time       : 0.025 s
% 2.92/1.81  
% 2.92/1.81  # Proof found!
% 2.92/1.81  # SZS status Theorem
% 2.92/1.81  # SZS output start CNFRefutation
% See solution above
% 2.92/1.81  # Parsed axioms                        : 9497
% 2.92/1.81  # Removed by relevancy pruning/SinE    : 8925
% 2.92/1.81  # Initial clauses                      : 903
% 2.92/1.81  # Removed in clause preprocessing      : 69
% 2.92/1.81  # Initial clauses in saturation        : 834
% 2.92/1.81  # Processed clauses                    : 929
% 2.92/1.81  # ...of these trivial                  : 58
% 2.92/1.81  # ...subsumed                          : 251
% 2.92/1.81  # ...remaining for further processing  : 620
% 2.92/1.81  # Other redundant clauses eliminated   : 471
% 2.92/1.81  # Clauses deleted for lack of memory   : 0
% 2.92/1.81  # Backward-subsumed                    : 11
% 2.92/1.81  # Backward-rewritten                   : 15
% 2.92/1.81  # Generated clauses                    : 21906
% 2.92/1.81  # ...of the previous two non-redundant : 19925
% 2.92/1.81  # ...aggressively subsumed             : 0
% 2.92/1.81  # Contextual simplify-reflections      : 3
% 2.92/1.81  # Paramodulations                      : 21167
% 2.92/1.81  # Factorizations                       : 68
% 2.92/1.81  # NegExts                              : 0
% 2.92/1.81  # Equation resolutions                 : 482
% 2.92/1.81  # Disequality decompositions           : 0
% 2.92/1.81  # Total rewrite steps                  : 7164
% 2.92/1.81  # ...of those cached                   : 5939
% 2.92/1.81  # Propositional unsat checks           : 0
% 2.92/1.81  #    Propositional check models        : 0
% 2.92/1.81  #    Propositional check unsatisfiable : 0
% 2.92/1.81  #    Propositional clauses             : 0
% 2.92/1.81  #    Propositional clauses after purity: 0
% 2.92/1.81  #    Propositional unsat core size     : 0
% 2.92/1.81  #    Propositional preprocessing time  : 0.000
% 2.92/1.81  #    Propositional encoding time       : 0.000
% 2.92/1.81  #    Propositional solver time         : 0.000
% 2.92/1.81  #    Success case prop preproc time    : 0.000
% 2.92/1.81  #    Success case prop encoding time   : 0.000
% 2.92/1.81  #    Success case prop solver time     : 0.000
% 2.92/1.81  # Current number of processed clauses  : 501
% 2.92/1.81  #    Positive orientable unit clauses  : 81
% 2.92/1.81  #    Positive unorientable unit clauses: 9
% 2.92/1.81  #    Negative unit clauses             : 17
% 2.92/1.81  #    Non-unit-clauses                  : 394
% 2.92/1.81  # Current number of unprocessed clauses: 19821
% 2.92/1.81  # ...number of literals in the above   : 64617
% 2.92/1.81  # Current number of archived formulas  : 0
% 2.92/1.81  # Current number of archived clauses   : 26
% 2.92/1.81  # Clause-clause subsumption calls (NU) : 32078
% 2.92/1.81  # Rec. Clause-clause subsumption calls : 23856
% 2.92/1.81  # Non-unit clause-clause subsumptions  : 164
% 2.92/1.81  # Unit Clause-clause subsumption calls : 889
% 2.92/1.81  # Rewrite failures with RHS unbound    : 0
% 2.92/1.81  # BW rewrite match attempts            : 152
% 2.92/1.81  # BW rewrite match successes           : 40
% 2.92/1.81  # Condensation attempts                : 929
% 2.92/1.81  # Condensation successes               : 0
% 2.92/1.81  # Termbank termtop insertions          : 1060747
% 2.92/1.81  # Search garbage collected termcells   : 94118
% 2.92/1.81  
% 2.92/1.81  # -------------------------------------------------
% 2.92/1.81  # User time                : 0.617 s
% 2.92/1.81  # System time              : 0.058 s
% 2.92/1.81  # Total time               : 0.675 s
% 2.92/1.81  # Maximum resident set size: 26304 pages
% 2.92/1.81  
% 2.92/1.81  # -------------------------------------------------
% 2.92/1.81  # User time                : 1.209 s
% 2.92/1.81  # System time              : 0.085 s
% 2.92/1.81  # Total time               : 1.294 s
% 2.92/1.81  # Maximum resident set size: 22452 pages
% 2.92/1.81  % E---3.1 exiting
% 2.92/1.82  % E exiting
%------------------------------------------------------------------------------