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

View Problem - Process Solution

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

% Computer : n021.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:42 EDT 2024

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

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

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

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

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

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

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

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

thf(decl_27,type,
    bNF_Gr_V_V2: set_V > ( v > v ) > set_Product_prod_V_V ).

thf(decl_33,type,
    standard_S_Const_V: v2 > standard_Constant_V ).

thf(decl_38,type,
    getRel1432786916nt_V_V: standard_Constant_V > labele2115946735nt_V_V > set_Product_prod_V_V ).

thf(decl_47,type,
    graph_1808119_V_V_V: labele2115946735nt_V_V > labele2115946735nt_V_V > set_Product_prod_V_V > $o ).

thf(decl_60,type,
    labele1134902411nt_V_V: labele2115946735nt_V_V > set_V ).

thf(decl_64,type,
    map_gr907434255tant_V: set_Product_prod_V_V > labele2115946735nt_V_V > labele2115946735nt_V_V ).

thf(decl_104,type,
    product_Pair_V_V2: v > v > product_prod_V_V ).

thf(decl_110,type,
    id_on_V2: set_V > set_Product_prod_V_V ).

thf(decl_149,type,
    member2015049524od_V_V: product_prod_V_V > set_Product_prod_V_V > $o ).

thf(decl_153,type,
    g: labele2115946735nt_V_V ).

thf(decl_155,type,
    h: v > v ).

thf(decl_156,type,
    m: v2 > v ).

thf(decl_158,type,
    xa: v2 ).

thf(decl_159,type,
    y: v2 ).

thf(decl_161,type,
    esk2_1: product_prod_V_V > v ).

thf(decl_162,type,
    esk3_1: product_prod_V_V > v ).

thf(fact_38_getRel__subgraph,axiom,
    ! [X27: v,X28: v,X29: standard_Constant_V,X30: labele2115946735nt_V_V,X67: labele2115946735nt_V_V] :
      ( ( member2015049524od_V_V @ ( product_Pair_V_V2 @ X27 @ X28 ) @ ( getRel1432786916nt_V_V @ X29 @ X30 ) )
     => ( ( graph_1808119_V_V_V @ X30 @ X67 @ ( id_on_V2 @ ( labele1134902411nt_V_V @ X30 ) ) )
       => ( member2015049524od_V_V @ ( product_Pair_V_V2 @ X27 @ X28 ) @ ( getRel1432786916nt_V_V @ X29 @ X67 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_38_getRel__subgraph) ).

thf(fact_22_surj__pair,axiom,
    ! [X34: product_prod_V_V] :
    ? [X1: v,X35: v] :
      ( X34
      = ( product_Pair_V_V2 @ X1 @ X35 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_22_surj__pair) ).

thf(conj_0,conjecture,
    member2015049524od_V_V @ ( product_Pair_V_V2 @ ( m @ xa ) @ ( m @ xa ) ) @ ( getRel1432786916nt_V_V @ ( standard_S_Const_V @ y ) @ g ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

thf(fact_8_h_I3_J,axiom,
    graph_1808119_V_V_V @ ( map_gr907434255tant_V @ ( bNF_Gr_V_V2 @ ( labele1134902411nt_V_V @ g ) @ h ) @ g ) @ g @ ( id_on_V2 @ ( labele1134902411nt_V_V @ ( map_gr907434255tant_V @ ( bNF_Gr_V_V2 @ ( labele1134902411nt_V_V @ g ) @ h ) @ g ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_8_h_I3_J) ).

thf(fact_6__092_060open_062_Im_Ax_M_Am_Ax_J_A_092_060in_062_AgetRel_A_IS__Const_Ay_J_A_Imap__graph__fn_AG_H_Ah_J_092_060close_062,axiom,
    member2015049524od_V_V @ ( product_Pair_V_V2 @ ( m @ xa ) @ ( m @ xa ) ) @ ( getRel1432786916nt_V_V @ ( standard_S_Const_V @ y ) @ ( map_gr907434255tant_V @ ( bNF_Gr_V_V2 @ ( labele1134902411nt_V_V @ g ) @ h ) @ g ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_6__092_060open_062_Im_Ax_M_Am_Ax_J_A_092_060in_062_AgetRel_A_IS__Const_Ay_J_A_Imap__graph__fn_AG_H_Ah_J_092_060close_062) ).

thf(c_0_5,plain,
    ! [X933: v,X934: v,X935: standard_Constant_V,X936: labele2115946735nt_V_V,X937: labele2115946735nt_V_V] :
      ( ~ ( member2015049524od_V_V @ ( product_Pair_V_V2 @ X933 @ X934 ) @ ( getRel1432786916nt_V_V @ X935 @ X936 ) )
      | ~ ( graph_1808119_V_V_V @ X936 @ X937 @ ( id_on_V2 @ ( labele1134902411nt_V_V @ X936 ) ) )
      | ( member2015049524od_V_V @ ( product_Pair_V_V2 @ X933 @ X934 ) @ ( getRel1432786916nt_V_V @ X935 @ X937 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_38_getRel__subgraph])])]) ).

thf(c_0_6,plain,
    ! [X848: product_prod_V_V] :
      ( X848
      = ( product_Pair_V_V2 @ ( esk2_1 @ X848 ) @ ( esk3_1 @ X848 ) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[fact_22_surj__pair])]) ).

thf(c_0_7,plain,
    ! [X1: v,X4: v,X8: standard_Constant_V,X67: labele2115946735nt_V_V,X30: labele2115946735nt_V_V] :
      ( ( member2015049524od_V_V @ ( product_Pair_V_V2 @ X1 @ X4 ) @ ( getRel1432786916nt_V_V @ X8 @ X67 ) )
      | ~ ( member2015049524od_V_V @ ( product_Pair_V_V2 @ X1 @ X4 ) @ ( getRel1432786916nt_V_V @ X8 @ X30 ) )
      | ~ ( graph_1808119_V_V_V @ X30 @ X67 @ ( id_on_V2 @ ( labele1134902411nt_V_V @ X30 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_8,plain,
    ! [X9: product_prod_V_V] :
      ( X9
      = ( product_Pair_V_V2 @ ( esk2_1 @ X9 ) @ ( esk3_1 @ X9 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_9,negated_conjecture,
    ~ ( member2015049524od_V_V @ ( product_Pair_V_V2 @ ( m @ xa ) @ ( m @ xa ) ) @ ( getRel1432786916nt_V_V @ ( standard_S_Const_V @ y ) @ g ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

thf(c_0_10,plain,
    ! [X8: standard_Constant_V,X30: labele2115946735nt_V_V,X9: product_prod_V_V,X67: labele2115946735nt_V_V] :
      ( ( member2015049524od_V_V @ X9 @ ( getRel1432786916nt_V_V @ X8 @ X30 ) )
      | ~ ( graph_1808119_V_V_V @ X67 @ X30 @ ( id_on_V2 @ ( labele1134902411nt_V_V @ X67 ) ) )
      | ~ ( member2015049524od_V_V @ X9 @ ( getRel1432786916nt_V_V @ X8 @ X67 ) ) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

thf(c_0_11,plain,
    graph_1808119_V_V_V @ ( map_gr907434255tant_V @ ( bNF_Gr_V_V2 @ ( labele1134902411nt_V_V @ g ) @ h ) @ g ) @ g @ ( id_on_V2 @ ( labele1134902411nt_V_V @ ( map_gr907434255tant_V @ ( bNF_Gr_V_V2 @ ( labele1134902411nt_V_V @ g ) @ h ) @ g ) ) ),
    inference(split_conjunct,[status(thm)],[fact_8_h_I3_J]) ).

thf(c_0_12,negated_conjecture,
    ~ ( member2015049524od_V_V @ ( product_Pair_V_V2 @ ( m @ xa ) @ ( m @ xa ) ) @ ( getRel1432786916nt_V_V @ ( standard_S_Const_V @ y ) @ g ) ),
    inference(fof_nnf,[status(thm)],[c_0_9]) ).

thf(c_0_13,plain,
    ! [X9: product_prod_V_V,X8: standard_Constant_V] :
      ( ( member2015049524od_V_V @ X9 @ ( getRel1432786916nt_V_V @ X8 @ g ) )
      | ~ ( member2015049524od_V_V @ X9 @ ( getRel1432786916nt_V_V @ X8 @ ( map_gr907434255tant_V @ ( bNF_Gr_V_V2 @ ( labele1134902411nt_V_V @ g ) @ h ) @ g ) ) ) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

thf(c_0_14,plain,
    member2015049524od_V_V @ ( product_Pair_V_V2 @ ( m @ xa ) @ ( m @ xa ) ) @ ( getRel1432786916nt_V_V @ ( standard_S_Const_V @ y ) @ ( map_gr907434255tant_V @ ( bNF_Gr_V_V2 @ ( labele1134902411nt_V_V @ g ) @ h ) @ g ) ),
    inference(split_conjunct,[status(thm)],[fact_6__092_060open_062_Im_Ax_M_Am_Ax_J_A_092_060in_062_AgetRel_A_IS__Const_Ay_J_A_Imap__graph__fn_AG_H_Ah_J_092_060close_062]) ).

thf(c_0_15,negated_conjecture,
    ~ ( member2015049524od_V_V @ ( product_Pair_V_V2 @ ( m @ xa ) @ ( m @ xa ) ) @ ( getRel1432786916nt_V_V @ ( standard_S_Const_V @ y ) @ g ) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : ITP180^1 : TPTP v8.2.0. Released v7.5.0.
% 0.04/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n021.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat May 18 17:25:08 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.48  Running higher-order theorem proving
% 0.20/0.48  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/benchmark/theBenchmark.p
% 0.61/0.58  # Version: 3.1.0-ho
% 0.61/0.58  # Preprocessing class: HSLMSMSMSSMNHFA.
% 0.61/0.58  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.58  # Starting full_lambda_6 with 1200s (4) cores
% 0.61/0.58  # Starting additional_ho_6 with 300s (1) cores
% 0.61/0.58  # Starting new_ho_9 with 300s (1) cores
% 0.61/0.58  # Starting full_lambda_3 with 300s (1) cores
% 0.61/0.58  # Starting post_as_ho6 with 300s (1) cores
% 0.61/0.58  # post_as_ho6 with pid 29440 completed with status 0
% 0.61/0.58  # Result found by post_as_ho6
% 0.61/0.58  # Preprocessing class: HSLMSMSMSSMNHFA.
% 0.61/0.58  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.58  # Starting full_lambda_6 with 1200s (4) cores
% 0.61/0.58  # Starting additional_ho_6 with 300s (1) cores
% 0.61/0.58  # Starting new_ho_9 with 300s (1) cores
% 0.61/0.58  # Starting full_lambda_3 with 300s (1) cores
% 0.61/0.58  # Starting post_as_ho6 with 300s (1) cores
% 0.61/0.58  # SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true)
% 0.61/0.58  # Search class: HGHSM-FFMM31-MHFFFSBN
% 0.61/0.58  # partial match(2): HGHSM-FSLM31-MHFFFSBN
% 0.61/0.58  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.61/0.58  # Starting new_ho_10 with 163s (1) cores
% 0.61/0.58  # new_ho_10 with pid 29446 completed with status 0
% 0.61/0.59  # Result found by new_ho_10
% 0.61/0.59  # Preprocessing class: HSLMSMSMSSMNHFA.
% 0.61/0.59  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.59  # Starting full_lambda_6 with 1200s (4) cores
% 0.61/0.59  # Starting additional_ho_6 with 300s (1) cores
% 0.61/0.59  # Starting new_ho_9 with 300s (1) cores
% 0.61/0.59  # Starting full_lambda_3 with 300s (1) cores
% 0.61/0.59  # Starting post_as_ho6 with 300s (1) cores
% 0.61/0.59  # SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true)
% 0.61/0.59  # Search class: HGHSM-FFMM31-MHFFFSBN
% 0.61/0.59  # partial match(2): HGHSM-FSLM31-MHFFFSBN
% 0.61/0.59  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.61/0.59  # Starting new_ho_10 with 163s (1) cores
% 0.61/0.59  # Preprocessing time       : 0.005 s
% 0.61/0.59  # Presaturation interreduction done
% 0.61/0.59  
% 0.61/0.59  # Proof found!
% 0.61/0.59  # SZS status Theorem
% 0.61/0.59  # SZS output start CNFRefutation
% See solution above
% 0.61/0.59  # Parsed axioms                        : 537
% 0.61/0.59  # Removed by relevancy pruning/SinE    : 473
% 0.61/0.59  # Initial clauses                      : 83
% 0.61/0.59  # Removed in clause preprocessing      : 3
% 0.61/0.59  # Initial clauses in saturation        : 80
% 0.61/0.59  # Processed clauses                    : 279
% 0.61/0.59  # ...of these trivial                  : 10
% 0.61/0.59  # ...subsumed                          : 68
% 0.61/0.59  # ...remaining for further processing  : 201
% 0.61/0.59  # Other redundant clauses eliminated   : 27
% 0.61/0.59  # Clauses deleted for lack of memory   : 0
% 0.61/0.59  # Backward-subsumed                    : 1
% 0.61/0.59  # Backward-rewritten                   : 3
% 0.61/0.59  # Generated clauses                    : 596
% 0.61/0.59  # ...of the previous two non-redundant : 472
% 0.61/0.59  # ...aggressively subsumed             : 0
% 0.61/0.59  # Contextual simplify-reflections      : 0
% 0.61/0.59  # Paramodulations                      : 562
% 0.61/0.59  # Factorizations                       : 0
% 0.61/0.59  # NegExts                              : 0
% 0.61/0.59  # Equation resolutions                 : 31
% 0.61/0.59  # Disequality decompositions           : 0
% 0.61/0.59  # Total rewrite steps                  : 313
% 0.61/0.59  # ...of those cached                   : 251
% 0.61/0.59  # Propositional unsat checks           : 0
% 0.61/0.59  #    Propositional check models        : 0
% 0.61/0.59  #    Propositional check unsatisfiable : 0
% 0.61/0.59  #    Propositional clauses             : 0
% 0.61/0.59  #    Propositional clauses after purity: 0
% 0.61/0.59  #    Propositional unsat core size     : 0
% 0.61/0.59  #    Propositional preprocessing time  : 0.000
% 0.61/0.59  #    Propositional encoding time       : 0.000
% 0.61/0.59  #    Propositional solver time         : 0.000
% 0.61/0.59  #    Success case prop preproc time    : 0.000
% 0.61/0.59  #    Success case prop encoding time   : 0.000
% 0.61/0.59  #    Success case prop solver time     : 0.000
% 0.61/0.59  # Current number of processed clauses  : 127
% 0.61/0.59  #    Positive orientable unit clauses  : 31
% 0.61/0.59  #    Positive unorientable unit clauses: 0
% 0.61/0.59  #    Negative unit clauses             : 3
% 0.61/0.59  #    Non-unit-clauses                  : 93
% 0.61/0.59  # Current number of unprocessed clauses: 306
% 0.61/0.59  # ...number of literals in the above   : 1085
% 0.61/0.59  # Current number of archived formulas  : 0
% 0.61/0.59  # Current number of archived clauses   : 64
% 0.61/0.59  # Clause-clause subsumption calls (NU) : 2207
% 0.61/0.59  # Rec. Clause-clause subsumption calls : 1663
% 0.61/0.59  # Non-unit clause-clause subsumptions  : 47
% 0.61/0.59  # Unit Clause-clause subsumption calls : 37
% 0.61/0.59  # Rewrite failures with RHS unbound    : 0
% 0.61/0.59  # BW rewrite match attempts            : 6
% 0.61/0.59  # BW rewrite match successes           : 3
% 0.61/0.59  # Condensation attempts                : 279
% 0.61/0.59  # Condensation successes               : 4
% 0.61/0.59  # Termbank termtop insertions          : 25205
% 0.61/0.59  # Search garbage collected termcells   : 4611
% 0.61/0.59  
% 0.61/0.59  # -------------------------------------------------
% 0.61/0.59  # User time                : 0.060 s
% 0.61/0.59  # System time              : 0.005 s
% 0.61/0.59  # Total time               : 0.066 s
% 0.61/0.59  # Maximum resident set size: 3292 pages
% 0.61/0.59  
% 0.61/0.59  # -------------------------------------------------
% 0.61/0.59  # User time                : 0.077 s
% 0.61/0.59  # System time              : 0.011 s
% 0.61/0.59  # Total time               : 0.089 s
% 0.61/0.59  # Maximum resident set size: 2736 pages
% 0.61/0.59  % E---3.1 exiting
% 0.61/0.59  % E exiting
%------------------------------------------------------------------------------