TSTP Solution File: ITP186^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP186^1 : TPTP v8.2.0. Released v7.5.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 : Mon May 20 22:16:43 EDT 2024

% Result   : Theorem 270.27s 35.38s
% Output   : CNFRefutation 270.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   26 (   7 unt;  16 typ;   0 def)
%            Number of atoms       :   13 (   0 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :  126 (   5   ~;   2   |;   0   &; 118   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   8 avg)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  12 usr;   9 con; 0-3 aty)
%            Number of variables   :   12 (   0   ^  12   !;   0   ?;  12   :)

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

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

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

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

thf(decl_27,type,
    par: pi > pi > pi ).

thf(decl_38,type,
    subs: pi > name > name > pi ).

thf(decl_44,type,
    late_TauR: late_freeRes ).

thf(decl_46,type,
    late_FreeR: late_freeRes > pi > late_residual ).

thf(decl_58,type,
    late_transitions: pi > late_residual > $o ).

thf(decl_142,type,
    p: pi ).

thf(decl_144,type,
    p2: pi ).

thf(decl_145,type,
    q: pi ).

thf(decl_147,type,
    q2: pi ).

thf(decl_148,type,
    r: pi ).

thf(decl_151,type,
    b: name ).

thf(decl_152,type,
    x: name ).

thf(conj_0,conjecture,
    late_transitions @ ( par @ ( par @ p @ q ) @ r ) @ ( late_FreeR @ late_TauR @ ( par @ ( par @ p2 @ ( subs @ q2 @ x @ b ) ) @ r ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

thf(fact_11_Par1F,axiom,
    ! [X1: pi,X5: late_freeRes,X6: pi,X2: pi] :
      ( ( late_transitions @ X1 @ ( late_FreeR @ X5 @ X6 ) )
     => ( late_transitions @ ( par @ X1 @ X2 ) @ ( late_FreeR @ X5 @ ( par @ X6 @ X2 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_11_Par1F) ).

thf(fact_3__092_060open_062P_A_092_060parallel_062_AQ_A_092_060longmapsto_062_A_092_060tau_062_A_092_060prec_062_AP_H_A_092_060parallel_062_AQ_H_091x_058_058_061b_093_092_060close_062,axiom,
    late_transitions @ ( par @ p @ q ) @ ( late_FreeR @ late_TauR @ ( par @ p2 @ ( subs @ q2 @ x @ b ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3__092_060open_062P_A_092_060parallel_062_AQ_A_092_060longmapsto_062_A_092_060tau_062_A_092_060prec_062_AP_H_A_092_060parallel_062_AQ_H_091x_058_058_061b_093_092_060close_062) ).

thf(c_0_3,negated_conjecture,
    ~ ( late_transitions @ ( par @ ( par @ p @ q ) @ r ) @ ( late_FreeR @ late_TauR @ ( par @ ( par @ p2 @ ( subs @ q2 @ x @ b ) ) @ r ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

thf(c_0_4,negated_conjecture,
    ~ ( late_transitions @ ( par @ ( par @ p @ q ) @ r ) @ ( late_FreeR @ late_TauR @ ( par @ ( par @ p2 @ ( subs @ q2 @ x @ b ) ) @ r ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_3]) ).

thf(c_0_5,plain,
    ! [X1989: pi,X1990: late_freeRes,X1991: pi,X1992: pi] :
      ( ~ ( late_transitions @ X1989 @ ( late_FreeR @ X1990 @ X1991 ) )
      | ( late_transitions @ ( par @ X1989 @ X1992 ) @ ( late_FreeR @ X1990 @ ( par @ X1991 @ X1992 ) ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_11_Par1F])])]) ).

thf(c_0_6,negated_conjecture,
    ~ ( late_transitions @ ( par @ ( par @ p @ q ) @ r ) @ ( late_FreeR @ late_TauR @ ( par @ ( par @ p2 @ ( subs @ q2 @ x @ b ) ) @ r ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_7,plain,
    ! [X6: pi,X5: late_freeRes,X1: pi,X2: pi] :
      ( ( late_transitions @ ( par @ X1 @ X6 ) @ ( late_FreeR @ X5 @ ( par @ X2 @ X6 ) ) )
      | ~ ( late_transitions @ X1 @ ( late_FreeR @ X5 @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_8,plain,
    late_transitions @ ( par @ p @ q ) @ ( late_FreeR @ late_TauR @ ( par @ p2 @ ( subs @ q2 @ x @ b ) ) ),
    inference(split_conjunct,[status(thm)],[fact_3__092_060open_062P_A_092_060parallel_062_AQ_A_092_060longmapsto_062_A_092_060tau_062_A_092_060prec_062_AP_H_A_092_060parallel_062_AQ_H_091x_058_058_061b_093_092_060close_062]) ).

thf(c_0_9,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : ITP186^1 : TPTP v8.2.0. Released v7.5.0.
% 0.08/0.14  % Command    : run_E %s %d THM
% 0.14/0.36  % Computer : n020.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:16:08 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.23/0.52  Running higher-order theorem proving
% 0.23/0.52  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
% 270.27/35.38  # Version: 3.1.0-ho
% 270.27/35.38  # Preprocessing class: HSLMSMSMSSLNHFA.
% 270.27/35.38  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 270.27/35.38  # Starting new_ho_11 with 1500s (5) cores
% 270.27/35.38  # Starting additional_ho_5 with 300s (1) cores
% 270.27/35.38  # Starting new_ho_10_cnf2 with 300s (1) cores
% 270.27/35.38  # Starting full_lambda_7 with 300s (1) cores
% 270.27/35.38  # additional_ho_5 with pid 10041 completed with status 0
% 270.27/35.38  # Result found by additional_ho_5
% 270.27/35.38  # Preprocessing class: HSLMSMSMSSLNHFA.
% 270.27/35.38  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 270.27/35.38  # Starting new_ho_11 with 1500s (5) cores
% 270.27/35.38  # Starting additional_ho_5 with 300s (1) cores
% 270.27/35.38  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 270.27/35.38  # Search class: HGHSM-SMLM31-MHFFFMBN
% 270.27/35.38  # Scheduled 6 strats onto 1 cores with 299 seconds (299 total)
% 270.27/35.38  # Starting new_ho_10 with 162s (1) cores
% 270.27/35.38  # new_ho_10 with pid 10058 completed with status 0
% 270.27/35.38  # Result found by new_ho_10
% 270.27/35.38  # Preprocessing class: HSLMSMSMSSLNHFA.
% 270.27/35.38  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 270.27/35.38  # Starting new_ho_11 with 1500s (5) cores
% 270.27/35.38  # Starting additional_ho_5 with 300s (1) cores
% 270.27/35.38  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 270.27/35.38  # Search class: HGHSM-SMLM31-MHFFFMBN
% 270.27/35.38  # Scheduled 6 strats onto 1 cores with 299 seconds (299 total)
% 270.27/35.38  # Starting new_ho_10 with 162s (1) cores
% 270.27/35.38  # Preprocessing time       : 1.274 s
% 270.27/35.38  # Presaturation interreduction done
% 270.27/35.38  
% 270.27/35.38  # Proof found!
% 270.27/35.38  # SZS status Theorem
% 270.27/35.38  # SZS output start CNFRefutation
% See solution above
% 270.27/35.38  # Parsed axioms                        : 500
% 270.27/35.38  # Removed by relevancy pruning/SinE    : 283
% 270.27/35.38  # Initial clauses                      : 29288
% 270.27/35.38  # Removed in clause preprocessing      : 15
% 270.27/35.38  # Initial clauses in saturation        : 29273
% 270.27/35.38  # Processed clauses                    : 29515
% 270.27/35.38  # ...of these trivial                  : 4
% 270.27/35.38  # ...subsumed                          : 38
% 270.27/35.38  # ...remaining for further processing  : 29473
% 270.27/35.38  # Other redundant clauses eliminated   : 19
% 270.27/35.38  # Clauses deleted for lack of memory   : 0
% 270.27/35.38  # Backward-subsumed                    : 0
% 270.27/35.38  # Backward-rewritten                   : 0
% 270.27/35.38  # Generated clauses                    : 440
% 270.27/35.38  # ...of the previous two non-redundant : 370
% 270.27/35.38  # ...aggressively subsumed             : 0
% 270.27/35.38  # Contextual simplify-reflections      : 0
% 270.27/35.38  # Paramodulations                      : 396
% 270.27/35.38  # Factorizations                       : 0
% 270.27/35.38  # NegExts                              : 1
% 270.27/35.38  # Equation resolutions                 : 43
% 270.27/35.38  # Disequality decompositions           : 0
% 270.27/35.38  # Total rewrite steps                  : 37
% 270.27/35.38  # ...of those cached                   : 13
% 270.27/35.38  # Propositional unsat checks           : 0
% 270.27/35.38  #    Propositional check models        : 0
% 270.27/35.38  #    Propositional check unsatisfiable : 0
% 270.27/35.38  #    Propositional clauses             : 0
% 270.27/35.38  #    Propositional clauses after purity: 0
% 270.27/35.38  #    Propositional unsat core size     : 0
% 270.27/35.38  #    Propositional preprocessing time  : 0.000
% 270.27/35.38  #    Propositional encoding time       : 0.000
% 270.27/35.38  #    Propositional solver time         : 0.000
% 270.27/35.38  #    Success case prop preproc time    : 0.000
% 270.27/35.38  #    Success case prop encoding time   : 0.000
% 270.27/35.38  #    Success case prop solver time     : 0.000
% 270.27/35.38  # Current number of processed clauses  : 217
% 270.27/35.38  #    Positive orientable unit clauses  : 57
% 270.27/35.38  #    Positive unorientable unit clauses: 0
% 270.27/35.38  #    Negative unit clauses             : 77
% 270.27/35.38  #    Non-unit-clauses                  : 83
% 270.27/35.38  # Current number of unprocessed clauses: 29376
% 270.27/35.38  # ...number of literals in the above   : 318134
% 270.27/35.38  # Current number of archived formulas  : 0
% 270.27/35.38  # Current number of archived clauses   : 29249
% 270.27/35.38  # Clause-clause subsumption calls (NU) : 23857131
% 270.27/35.38  # Rec. Clause-clause subsumption calls : 18884
% 270.27/35.38  # Non-unit clause-clause subsumptions  : 20
% 270.27/35.38  # Unit Clause-clause subsumption calls : 1219
% 270.27/35.38  # Rewrite failures with RHS unbound    : 0
% 270.27/35.38  # BW rewrite match attempts            : 13
% 270.27/35.38  # BW rewrite match successes           : 0
% 270.27/35.38  # Condensation attempts                : 29515
% 270.27/35.38  # Condensation successes               : 0
% 270.27/35.38  # Termbank termtop insertions          : 9252287
% 270.27/35.38  # Search garbage collected termcells   : 196883
% 270.27/35.38  
% 270.27/35.38  # -------------------------------------------------
% 270.27/35.38  # User time                : 34.155 s
% 270.27/35.38  # System time              : 0.270 s
% 270.27/35.38  # Total time               : 34.425 s
% 270.27/35.38  # Maximum resident set size: 63112 pages
% 270.27/35.38  
% 270.27/35.38  # -------------------------------------------------
% 270.27/35.38  # User time                : 34.177 s
% 270.27/35.38  # System time              : 0.282 s
% 270.27/35.38  # Total time               : 34.459 s
% 270.27/35.38  # Maximum resident set size: 3140 pages
% 270.27/35.38  % E---3.1 exiting
% 270.27/35.38  % E exiting
%------------------------------------------------------------------------------