TSTP Solution File: ITP092^1 by E---3.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.2.0
% Problem  : ITP092^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n011.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 Jun 24 09:11:44 EDT 2024

% Result   : Theorem 0.41s 0.88s
% Output   : CNFRefutation 0.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :   24 (  14 equ;   0 cnn)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  174 (  11   ~;   3   |;   1   &; 158   @)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  14 usr;   7 con; 0-2 aty)
%            Number of variables   :   44 (   1   ^  43   !;   0   ?;  44   :)

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

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

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

thf(decl_25,type,
    kurato1072996284sing_a: list_P1467822637od_a_a > $o ).

thf(decl_31,type,
    append1574001858od_a_a: list_P1467822637od_a_a > list_P1467822637od_a_a > list_P1467822637od_a_a ).

thf(decl_67,type,
    cons_P1921020637od_a_a: product_prod_a_a > list_P1467822637od_a_a > list_P1467822637od_a_a ).

thf(decl_144,type,
    product_Pair_a_a: a > a > product_prod_a_a ).

thf(decl_172,type,
    e: product_prod_a_a ).

thf(decl_173,type,
    es: list_P1467822637od_a_a ).

thf(decl_185,type,
    esk9_1: list_P1467822637od_a_a > list_P1467822637od_a_a ).

thf(decl_186,type,
    esk10_1: list_P1467822637od_a_a > a ).

thf(decl_187,type,
    esk11_1: list_P1467822637od_a_a > a ).

thf(decl_188,type,
    esk12_1: list_P1467822637od_a_a > list_P1467822637od_a_a ).

thf(decl_614,type,
    esk424_0: list_P1467822637od_a_a ).

thf(decl_615,type,
    esk425_0: a ).

thf(decl_616,type,
    esk426_0: a ).

thf(decl_617,type,
    esk427_0: list_P1467822637od_a_a ).

thf(fact_3_progressing__def,axiom,
    ( kurato1072996284sing_a
    = ( ^ [X11: list_P1467822637od_a_a] :
        ! [X12: list_P1467822637od_a_a,X13: a,X14: a,X15: list_P1467822637od_a_a] :
          ( X11
         != ( append1574001858od_a_a @ X12 @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ X13 @ X14 ) @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ X14 @ X13 ) @ X15 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ai9YvCSnDa/E---3.1_13572.p',fact_3_progressing__def) ).

thf(conj_0,conjecture,
    ! [X790: list_P1467822637od_a_a,X1235: a,X274: a,X792: list_P1467822637od_a_a] :
      ( es
     != ( append1574001858od_a_a @ X790 @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ X1235 @ X274 ) @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ X274 @ X1235 ) @ X792 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ai9YvCSnDa/E---3.1_13572.p',conj_0) ).

thf(fact_46_append__Cons,axiom,
    ! [X152: product_prod_a_a,X153: list_P1467822637od_a_a,X154: list_P1467822637od_a_a] :
      ( ( append1574001858od_a_a @ ( cons_P1921020637od_a_a @ X152 @ X153 ) @ X154 )
      = ( cons_P1921020637od_a_a @ X152 @ ( append1574001858od_a_a @ X153 @ X154 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ai9YvCSnDa/E---3.1_13572.p',fact_46_append__Cons) ).

thf(fact_0_assms,axiom,
    kurato1072996284sing_a @ ( cons_P1921020637od_a_a @ e @ es ),
    file('/export/starexec/sandbox2/tmp/tmp.ai9YvCSnDa/E---3.1_13572.p',fact_0_assms) ).

thf(c_0_4,plain,
    ! [X2807: list_P1467822637od_a_a] :
      ( ( kurato1072996284sing_a @ X2807 )
    <=> ! [X12: list_P1467822637od_a_a,X13: a,X14: a,X15: list_P1467822637od_a_a] :
          ( X2807
         != ( append1574001858od_a_a @ X12 @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ X13 @ X14 ) @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ X14 @ X13 ) @ X15 ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_3_progressing__def])])]) ).

thf(c_0_5,negated_conjecture,
    ~ ! [X790: list_P1467822637od_a_a,X1235: a,X274: a,X792: list_P1467822637od_a_a] :
        ( es
       != ( append1574001858od_a_a @ X790 @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ X1235 @ X274 ) @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ X274 @ X1235 ) @ X792 ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

thf(c_0_6,plain,
    ! [X2833: list_P1467822637od_a_a,X2834: list_P1467822637od_a_a,X2835: a,X2836: a,X2837: list_P1467822637od_a_a,X2838: list_P1467822637od_a_a] :
      ( ( ~ ( kurato1072996284sing_a @ X2833 )
        | ( X2833
         != ( append1574001858od_a_a @ X2834 @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ X2835 @ X2836 ) @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ X2836 @ X2835 ) @ X2837 ) ) ) ) )
      & ( ( X2838
          = ( append1574001858od_a_a @ ( esk9_1 @ X2838 ) @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ ( esk10_1 @ X2838 ) @ ( esk11_1 @ X2838 ) ) @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ ( esk11_1 @ X2838 ) @ ( esk10_1 @ X2838 ) ) @ ( esk12_1 @ X2838 ) ) ) ) )
        | ( kurato1072996284sing_a @ X2838 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).

thf(c_0_7,plain,
    ! [X2996: product_prod_a_a,X2997: list_P1467822637od_a_a,X2998: list_P1467822637od_a_a] :
      ( ( append1574001858od_a_a @ ( cons_P1921020637od_a_a @ X2996 @ X2997 ) @ X2998 )
      = ( cons_P1921020637od_a_a @ X2996 @ ( append1574001858od_a_a @ X2997 @ X2998 ) ) ),
    inference(variable_rename,[status(thm)],[fact_46_append__Cons]) ).

thf(c_0_8,negated_conjecture,
    ( es
    = ( append1574001858od_a_a @ esk424_0 @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ esk425_0 @ esk426_0 ) @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ esk426_0 @ esk425_0 ) @ esk427_0 ) ) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

thf(c_0_9,plain,
    ! [X11: list_P1467822637od_a_a,X12: list_P1467822637od_a_a,X13: a,X14: a,X15: list_P1467822637od_a_a] :
      ( ~ ( kurato1072996284sing_a @ X11 )
      | ( X11
       != ( append1574001858od_a_a @ X12 @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ X13 @ X14 ) @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ X14 @ X13 ) @ X15 ) ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_10,plain,
    ! [X3: product_prod_a_a,X11: list_P1467822637od_a_a,X12: list_P1467822637od_a_a] :
      ( ( append1574001858od_a_a @ ( cons_P1921020637od_a_a @ X3 @ X11 ) @ X12 )
      = ( cons_P1921020637od_a_a @ X3 @ ( append1574001858od_a_a @ X11 @ X12 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_11,negated_conjecture,
    ( es
    = ( append1574001858od_a_a @ esk424_0 @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ esk425_0 @ esk426_0 ) @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ esk426_0 @ esk425_0 ) @ esk427_0 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_12,plain,
    ! [X11: list_P1467822637od_a_a,X14: a,X13: a,X12: list_P1467822637od_a_a] :
      ~ ( kurato1072996284sing_a @ ( append1574001858od_a_a @ X11 @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ X13 @ X14 ) @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ X14 @ X13 ) @ X12 ) ) ) ),
    inference(er,[status(thm)],[c_0_9]) ).

thf(c_0_13,negated_conjecture,
    ! [X3: product_prod_a_a] :
      ( ( append1574001858od_a_a @ ( cons_P1921020637od_a_a @ X3 @ esk424_0 ) @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ esk425_0 @ esk426_0 ) @ ( cons_P1921020637od_a_a @ ( product_Pair_a_a @ esk426_0 @ esk425_0 ) @ esk427_0 ) ) )
      = ( cons_P1921020637od_a_a @ X3 @ es ) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

thf(c_0_14,plain,
    kurato1072996284sing_a @ ( cons_P1921020637od_a_a @ e @ es ),
    inference(split_conjunct,[status(thm)],[fact_0_assms]) ).

thf(c_0_15,negated_conjecture,
    ! [X3: product_prod_a_a] :
      ~ ( kurato1072996284sing_a @ ( cons_P1921020637od_a_a @ X3 @ es ) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

thf(c_0_16,plain,
    $false,
    inference(sr,[status(thm)],[c_0_14,c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : ITP092^1 : TPTP v8.2.0. Released v7.5.0.
% 0.03/0.12  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n011.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Wed Jun 19 02:21:24 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.19/0.55  Running higher-order theorem proving
% 0.19/0.55  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/tmp/tmp.ai9YvCSnDa/E---3.1_13572.p
% 0.41/0.88  # Version: 3.2.0-ho
% 0.41/0.88  # Preprocessing class: HSLMSMSSSSMNHFA.
% 0.41/0.88  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.88  # Starting lpo5_fix with 1500s (5) cores
% 0.41/0.88  # Starting new_bool_3 with 300s (1) cores
% 0.41/0.88  # Starting new_bool_1 with 300s (1) cores
% 0.41/0.88  # Starting new_bool_2 with 300s (1) cores
% 0.41/0.88  # lpo5_fix with pid 13651 completed with status 0
% 0.41/0.88  # Result found by lpo5_fix
% 0.41/0.88  # Preprocessing class: HSLMSMSSSSMNHFA.
% 0.41/0.88  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.88  # Starting lpo5_fix with 1500s (5) cores
% 0.41/0.88  # No SInE strategy applied
% 0.41/0.88  # Search class: HGHSM-FSLS31-DHFFFSBN
% 0.41/0.88  # partial match(1): HGHSM-FSLM31-DHFFFSBN
% 0.41/0.88  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.41/0.88  # Starting lpo8_lambda_fix with 811s (1) cores
% 0.41/0.88  # Starting lpo5_fix with 151s (1) cores
% 0.41/0.88  # Starting lpo8_s with 136s (1) cores
% 0.41/0.88  # Starting lpo1_lambda_fix with 136s (1) cores
% 0.41/0.88  # Starting lpo1_def_fix with 136s (1) cores
% 0.41/0.88  # lpo5_fix with pid 13659 completed with status 0
% 0.41/0.88  # Result found by lpo5_fix
% 0.41/0.88  # Preprocessing class: HSLMSMSSSSMNHFA.
% 0.41/0.88  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.88  # Starting lpo5_fix with 1500s (5) cores
% 0.41/0.88  # No SInE strategy applied
% 0.41/0.88  # Search class: HGHSM-FSLS31-DHFFFSBN
% 0.41/0.88  # partial match(1): HGHSM-FSLM31-DHFFFSBN
% 0.41/0.88  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.41/0.88  # Starting lpo8_lambda_fix with 811s (1) cores
% 0.41/0.88  # Starting lpo5_fix with 151s (1) cores
% 0.41/0.88  # Preprocessing time       : 0.019 s
% 0.41/0.88  
% 0.41/0.88  # Proof found!
% 0.41/0.88  # SZS status Theorem
% 0.41/0.88  # SZS output start CNFRefutation
% See solution above
% 0.41/0.88  # Parsed axioms                        : 566
% 0.41/0.88  # Removed by relevancy pruning/SinE    : 0
% 0.41/0.88  # Initial clauses                      : 1155
% 0.41/0.88  # Removed in clause preprocessing      : 249
% 0.41/0.88  # Initial clauses in saturation        : 906
% 0.41/0.88  # Processed clauses                    : 1038
% 0.41/0.88  # ...of these trivial                  : 18
% 0.41/0.88  # ...subsumed                          : 102
% 0.41/0.88  # ...remaining for further processing  : 918
% 0.41/0.88  # Other redundant clauses eliminated   : 644
% 0.41/0.88  # Clauses deleted for lack of memory   : 0
% 0.41/0.88  # Backward-subsumed                    : 3
% 0.41/0.88  # Backward-rewritten                   : 1
% 0.41/0.88  # Generated clauses                    : 3993
% 0.41/0.88  # ...of the previous two non-redundant : 3510
% 0.41/0.88  # ...aggressively subsumed             : 0
% 0.41/0.88  # Contextual simplify-reflections      : 1
% 0.41/0.88  # Paramodulations                      : 3256
% 0.41/0.88  # Factorizations                       : 0
% 0.41/0.88  # NegExts                              : 0
% 0.41/0.88  # Equation resolutions                 : 724
% 0.41/0.88  # Disequality decompositions           : 0
% 0.41/0.88  # Total rewrite steps                  : 281
% 0.41/0.88  # ...of those cached                   : 144
% 0.41/0.88  # Propositional unsat checks           : 0
% 0.41/0.88  #    Propositional check models        : 0
% 0.41/0.88  #    Propositional check unsatisfiable : 0
% 0.41/0.88  #    Propositional clauses             : 0
% 0.41/0.88  #    Propositional clauses after purity: 0
% 0.41/0.88  #    Propositional unsat core size     : 0
% 0.41/0.88  #    Propositional preprocessing time  : 0.000
% 0.41/0.88  #    Propositional encoding time       : 0.000
% 0.41/0.88  #    Propositional solver time         : 0.000
% 0.41/0.88  #    Success case prop preproc time    : 0.000
% 0.41/0.88  #    Success case prop encoding time   : 0.000
% 0.41/0.88  #    Success case prop solver time     : 0.000
% 0.41/0.88  # Current number of processed clauses  : 640
% 0.41/0.88  #    Positive orientable unit clauses  : 71
% 0.41/0.88  #    Positive unorientable unit clauses: 21
% 0.41/0.88  #    Negative unit clauses             : 31
% 0.41/0.88  #    Non-unit-clauses                  : 517
% 0.41/0.88  # Current number of unprocessed clauses: 3371
% 0.41/0.88  # ...number of literals in the above   : 10904
% 0.41/0.88  # Current number of archived formulas  : 0
% 0.41/0.88  # Current number of archived clauses   : 5
% 0.41/0.88  # Clause-clause subsumption calls (NU) : 161402
% 0.41/0.88  # Rec. Clause-clause subsumption calls : 54328
% 0.41/0.88  # Non-unit clause-clause subsumptions  : 75
% 0.41/0.88  # Unit Clause-clause subsumption calls : 4630
% 0.41/0.88  # Rewrite failures with RHS unbound    : 0
% 0.41/0.88  # BW rewrite match attempts            : 8
% 0.41/0.88  # BW rewrite match successes           : 1
% 0.41/0.88  # Condensation attempts                : 1038
% 0.41/0.88  # Condensation successes               : 0
% 0.41/0.88  # Termbank termtop insertions          : 164381
% 0.41/0.88  # Search garbage collected termcells   : 23533
% 0.41/0.88  
% 0.41/0.88  # -------------------------------------------------
% 0.41/0.88  # User time                : 0.273 s
% 0.41/0.88  # System time              : 0.019 s
% 0.41/0.88  # Total time               : 0.292 s
% 0.41/0.88  # Maximum resident set size: 7856 pages
% 0.41/0.88  
% 0.41/0.88  # -------------------------------------------------
% 0.41/0.88  # User time                : 1.111 s
% 0.41/0.88  # System time              : 0.068 s
% 0.41/0.88  # Total time               : 1.178 s
% 0.41/0.88  # Maximum resident set size: 3328 pages
% 0.41/0.88  % E---3.1 exiting
% 0.41/0.88  % E exiting
%------------------------------------------------------------------------------