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

View Problem - Process Solution

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

% Computer : n003.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:40 EDT 2024

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

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

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

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

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

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

thf(decl_32,type,
    hilbert_Eps_b: ( b > $o ) > b ).

thf(decl_34,type,
    standard_S_Idt_a: standard_Constant_a ).

thf(decl_35,type,
    getRel904497637nt_a_b: standard_Constant_a > labele1159362096nt_a_b > set_Product_prod_b_b ).

thf(decl_58,type,
    bot_bot_set_b: set_b ).

thf(decl_82,type,
    image_b_b: set_Product_prod_b_b > set_b > set_b ).

thf(decl_99,type,
    insert_b: b > set_b > set_b ).

thf(decl_117,type,
    member_b: b > set_b > $o ).

thf(decl_118,type,
    g: labele1159362096nt_a_b ).

thf(decl_121,type,
    x: b ).

thf(decl_122,type,
    y: b ).

thf(conj_0,conjecture,
    ( ( hilbert_Eps_b
      @ ^ [X3: b] : ( member_b @ X3 @ ( image_b_b @ ( getRel904497637nt_a_b @ standard_S_Idt_a @ g ) @ ( insert_b @ x @ bot_bot_set_b ) ) ) )
    = ( hilbert_Eps_b
      @ ^ [X3: b] : ( member_b @ X3 @ ( image_b_b @ ( getRel904497637nt_a_b @ standard_S_Idt_a @ g ) @ ( insert_b @ y @ bot_bot_set_b ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

thf(fact_0__092_060open_062getRel_AS__Idt_AG_A_096_096_A_123x_125_A_061_AgetRel_AS__Idt_AG_A_096_096_A_123y_125_092_060close_062,axiom,
    ( ( image_b_b @ ( getRel904497637nt_a_b @ standard_S_Idt_a @ g ) @ ( insert_b @ x @ bot_bot_set_b ) )
    = ( image_b_b @ ( getRel904497637nt_a_b @ standard_S_Idt_a @ g ) @ ( insert_b @ y @ bot_bot_set_b ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0__092_060open_062getRel_AS__Idt_AG_A_096_096_A_123x_125_A_061_AgetRel_AS__Idt_AG_A_096_096_A_123y_125_092_060close_062) ).

thf(c_0_2,negated_conjecture,
    ( ( hilbert_Eps_b
      @ ^ [Z0: b] : ( member_b @ Z0 @ ( image_b_b @ ( getRel904497637nt_a_b @ standard_S_Idt_a @ g ) @ ( insert_b @ x @ bot_bot_set_b ) ) ) )
   != ( hilbert_Eps_b
      @ ^ [Z0: b] : ( member_b @ Z0 @ ( image_b_b @ ( getRel904497637nt_a_b @ standard_S_Idt_a @ g ) @ ( insert_b @ y @ bot_bot_set_b ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])]) ).

thf(c_0_3,negated_conjecture,
    ( ( hilbert_Eps_b
      @ ^ [Z0: b] : ( member_b @ Z0 @ ( image_b_b @ ( getRel904497637nt_a_b @ standard_S_Idt_a @ g ) @ ( insert_b @ x @ bot_bot_set_b ) ) ) )
   != ( hilbert_Eps_b
      @ ^ [Z0: b] : ( member_b @ Z0 @ ( image_b_b @ ( getRel904497637nt_a_b @ standard_S_Idt_a @ g ) @ ( insert_b @ y @ bot_bot_set_b ) ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ( ( ^ [Z0: b] : ( member_b @ Z0 @ ( image_b_b @ ( getRel904497637nt_a_b @ standard_S_Idt_a @ g ) @ ( insert_b @ y @ bot_bot_set_b ) ) ) )
   != ( ^ [Z0: b] : ( member_b @ Z0 @ ( image_b_b @ ( getRel904497637nt_a_b @ standard_S_Idt_a @ g ) @ ( insert_b @ x @ bot_bot_set_b ) ) ) ) ),
    inference(ext_eqres,[status(thm)],[c_0_3]) ).

thf(c_0_5,plain,
    ( ( image_b_b @ ( getRel904497637nt_a_b @ standard_S_Idt_a @ g ) @ ( insert_b @ x @ bot_bot_set_b ) )
    = ( image_b_b @ ( getRel904497637nt_a_b @ standard_S_Idt_a @ g ) @ ( insert_b @ y @ bot_bot_set_b ) ) ),
    inference(split_conjunct,[status(thm)],[fact_0__092_060open_062getRel_AS__Idt_AG_A_096_096_A_123x_125_A_061_AgetRel_AS__Idt_AG_A_096_096_A_123y_125_092_060close_062]) ).

thf(c_0_6,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_4]),c_0_5])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : ITP176^1 : TPTP v8.2.0. Released v7.5.0.
% 0.14/0.14  % Command    : run_E %s %d THM
% 0.15/0.36  % Computer : n003.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Sat May 18 16:27:08 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.22/0.50  Running higher-order theorem proving
% 0.22/0.50  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.63/0.65  # Version: 3.1.0-ho
% 0.63/0.65  # Preprocessing class: HSLMSMSMSSLCSSA.
% 0.63/0.65  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.65  # Starting new_ho_11 with 1200s (4) cores
% 0.63/0.65  # Starting new_bool_2 with 600s (2) cores
% 0.63/0.65  # Starting new_bool_4 with 300s (1) cores
% 0.63/0.65  # Starting post_as_ho5 with 300s (1) cores
% 0.63/0.65  # new_bool_2 with pid 5643 completed with status 0
% 0.63/0.65  # Result found by new_bool_2
% 0.63/0.65  # Preprocessing class: HSLMSMSMSSLCSSA.
% 0.63/0.65  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.65  # Starting new_ho_11 with 1200s (4) cores
% 0.63/0.65  # Starting new_bool_2 with 600s (2) cores
% 0.63/0.65  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.63/0.65  # Search class: HGHSM-FSLM31-DSSFFSBC
% 0.63/0.65  # partial match(1): HGHSM-FSLM31-DSSFFSBN
% 0.63/0.65  # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.63/0.65  # Starting new_ho_10 with 241s (1) cores
% 0.63/0.65  # Starting new_bool_1 with 91s (1) cores
% 0.63/0.65  # new_bool_1 with pid 5649 completed with status 0
% 0.63/0.65  # Result found by new_bool_1
% 0.63/0.65  # Preprocessing class: HSLMSMSMSSLCSSA.
% 0.63/0.65  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.65  # Starting new_ho_11 with 1200s (4) cores
% 0.63/0.65  # Starting new_bool_2 with 600s (2) cores
% 0.63/0.65  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.63/0.65  # Search class: HGHSM-FSLM31-DSSFFSBC
% 0.63/0.65  # partial match(1): HGHSM-FSLM31-DSSFFSBN
% 0.63/0.65  # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.63/0.65  # Starting new_ho_10 with 241s (1) cores
% 0.63/0.65  # Starting new_bool_1 with 91s (1) cores
% 0.63/0.65  # Preprocessing time       : 0.006 s
% 0.63/0.65  # Presaturation interreduction done
% 0.63/0.65  
% 0.63/0.65  # Proof found!
% 0.63/0.65  # SZS status Theorem
% 0.63/0.65  # SZS output start CNFRefutation
% See solution above
% 0.63/0.65  # Parsed axioms                        : 489
% 0.63/0.65  # Removed by relevancy pruning/SinE    : 315
% 0.63/0.65  # Initial clauses                      : 292
% 0.63/0.65  # Removed in clause preprocessing      : 15
% 0.63/0.65  # Initial clauses in saturation        : 277
% 0.63/0.65  # Processed clauses                    : 334
% 0.63/0.65  # ...of these trivial                  : 5
% 0.63/0.65  # ...subsumed                          : 61
% 0.63/0.65  # ...remaining for further processing  : 268
% 0.63/0.65  # Other redundant clauses eliminated   : 45
% 0.63/0.65  # Clauses deleted for lack of memory   : 0
% 0.63/0.65  # Backward-subsumed                    : 2
% 0.63/0.65  # Backward-rewritten                   : 2
% 0.63/0.65  # Generated clauses                    : 74
% 0.63/0.65  # ...of the previous two non-redundant : 51
% 0.63/0.65  # ...aggressively subsumed             : 0
% 0.63/0.65  # Contextual simplify-reflections      : 4
% 0.63/0.65  # Paramodulations                      : 3
% 0.63/0.65  # Factorizations                       : 0
% 0.63/0.65  # NegExts                              : 5
% 0.63/0.65  # Equation resolutions                 : 45
% 0.63/0.65  # Disequality decompositions           : 0
% 0.63/0.65  # Total rewrite steps                  : 26
% 0.63/0.65  # ...of those cached                   : 10
% 0.63/0.65  # Propositional unsat checks           : 0
% 0.63/0.65  #    Propositional check models        : 0
% 0.63/0.65  #    Propositional check unsatisfiable : 0
% 0.63/0.65  #    Propositional clauses             : 0
% 0.63/0.65  #    Propositional clauses after purity: 0
% 0.63/0.65  #    Propositional unsat core size     : 0
% 0.63/0.65  #    Propositional preprocessing time  : 0.000
% 0.63/0.65  #    Propositional encoding time       : 0.000
% 0.63/0.65  #    Propositional solver time         : 0.000
% 0.63/0.65  #    Success case prop preproc time    : 0.000
% 0.63/0.65  #    Success case prop encoding time   : 0.000
% 0.63/0.65  #    Success case prop solver time     : 0.000
% 0.63/0.65  # Current number of processed clauses  : 32
% 0.63/0.65  #    Positive orientable unit clauses  : 13
% 0.63/0.65  #    Positive unorientable unit clauses: 0
% 0.63/0.65  #    Negative unit clauses             : 11
% 0.63/0.65  #    Non-unit-clauses                  : 8
% 0.63/0.65  # Current number of unprocessed clauses: 191
% 0.63/0.65  # ...number of literals in the above   : 419
% 0.63/0.65  # Current number of archived formulas  : 0
% 0.63/0.65  # Current number of archived clauses   : 201
% 0.63/0.65  # Clause-clause subsumption calls (NU) : 5203
% 0.63/0.65  # Rec. Clause-clause subsumption calls : 2922
% 0.63/0.65  # Non-unit clause-clause subsumptions  : 53
% 0.63/0.65  # Unit Clause-clause subsumption calls : 98
% 0.63/0.65  # Rewrite failures with RHS unbound    : 0
% 0.63/0.65  # BW rewrite match attempts            : 453
% 0.63/0.65  # BW rewrite match successes           : 93
% 0.63/0.65  # Condensation attempts                : 0
% 0.63/0.65  # Condensation successes               : 0
% 0.63/0.65  # Termbank termtop insertions          : 30055
% 0.63/0.65  # Search garbage collected termcells   : 6724
% 0.63/0.65  
% 0.63/0.65  # -------------------------------------------------
% 0.63/0.65  # User time                : 0.045 s
% 0.63/0.65  # System time              : 0.008 s
% 0.63/0.65  # Total time               : 0.052 s
% 0.63/0.65  # Maximum resident set size: 3784 pages
% 0.63/0.65  
% 0.63/0.65  # -------------------------------------------------
% 0.63/0.65  # User time                : 0.088 s
% 0.63/0.65  # System time              : 0.016 s
% 0.63/0.65  # Total time               : 0.104 s
% 0.63/0.65  # Maximum resident set size: 2708 pages
% 0.63/0.65  % E---3.1 exiting
% 0.63/0.65  % E exiting
%------------------------------------------------------------------------------