↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : ITP176^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Sep 30 08:05:45 AM UTC 2026

% Result   : Theorem 0.50s 0.46s
% Output   : CNFRefutation 0.50s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP176^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19  % Computer : n007.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Tue Sep 29 20:04:40 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.24  Running higher-order theorem proving
% 0.20/0.30  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/tmp/tmp.Zt1sWGZNOF/E---3.1_3864082.p
% 0.50/0.46  % Version: 3.5.1-ho
% 0.50/0.46  % Preprocessing class: HSLMSMSMSSLCSSA.
% 0.50/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.46  % Starting new_ho_11 with 1200s (4) cores
% 0.50/0.46  % Starting new_bool_2 with 600s (2) cores
% 0.50/0.46  % Starting new_bool_4 with 300s (1) cores
% 0.50/0.46  % Starting post_as_ho5 with 300s (1) cores
% 0.50/0.46  % new_ho_11 with pid 3864095 completed with status 0
% 0.50/0.46  % Result found by new_ho_11
% 0.50/0.46  % Preprocessing class: HSLMSMSMSSLCSSA.
% 0.50/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.46  % Starting new_ho_11 with 1200s (4) cores
% 0.50/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.50/0.46  % No SInE strategy applied
% 0.50/0.46  % Search class: HGHSM-FSLM31-MSSFFSBC
% 0.50/0.46  % partial match(1): HGHSM-FSLM31-MSSFFSBN
% 0.50/0.46  % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 0.50/0.46  % Starting SubtermCWHack with 109s (1) cores
% 0.50/0.46  % Starting new_ho_11 with 121s (1) cores
% 0.50/0.46  % Starting full_lambda_2 with 109s (1) cores
% 0.50/0.46  % Starting post_as_ho6 with 109s (1) cores
% 0.50/0.46  % new_ho_11 with pid 3864104 completed with status 0
% 0.50/0.46  % Result found by new_ho_11
% 0.50/0.46  % Preprocessing class: HSLMSMSMSSLCSSA.
% 0.50/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.46  % Starting new_ho_11 with 1200s (4) cores
% 0.50/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.50/0.46  % No SInE strategy applied
% 0.50/0.46  % Search class: HGHSM-FSLM31-MSSFFSBC
% 0.50/0.46  % partial match(1): HGHSM-FSLM31-MSSFFSBN
% 0.50/0.46  % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 0.50/0.46  % Starting SubtermCWHack with 109s (1) cores
% 0.50/0.46  % Starting new_ho_11 with 121s (1) cores
% 0.50/0.46  % Preprocessing time       : 0.011 s
% 0.50/0.46  % Presaturation interreduction done
% 0.50/0.46  
% 0.50/0.46  % Proof found!
% 0.50/0.46  % SZS status Theorem
% 0.50/0.46  % SZS output start CNFRefutation
% 0.50/0.46  thf(decl_sort1, type, set_Product_prod_b_b: $tType).
% 0.50/0.46  thf(decl_sort2, type, b: $tType).
% 0.50/0.46  thf(decl_sort3, type, set_b: $tType).
% 0.50/0.46  thf(decl_sort4, type, labele1159362096nt_a_b: $tType).
% 0.50/0.46  thf(decl_sort5, type, standard_Constant_a: $tType).
% 0.50/0.46  thf(decl_33, type, hilbert_Eps_b: (b > $o) > b).
% 0.50/0.46  thf(decl_35, type, standard_S_Idt_a: standard_Constant_a).
% 0.50/0.46  thf(decl_36, type, getRel904497637nt_a_b: standard_Constant_a > labele1159362096nt_a_b > set_Product_prod_b_b).
% 0.50/0.46  thf(decl_59, type, bot_bot_set_b: set_b).
% 0.50/0.46  thf(decl_83, type, image_b_b: set_Product_prod_b_b > set_b > set_b).
% 0.50/0.46  thf(decl_100, type, insert_b: b > set_b > set_b).
% 0.50/0.46  thf(decl_118, type, member_b: b > set_b > $o).
% 0.50/0.46  thf(decl_119, type, g: labele1159362096nt_a_b).
% 0.50/0.46  thf(decl_122, type, x: b).
% 0.50/0.46  thf(decl_123, type, y: b).
% 0.50/0.46  thf(decl_256, type, epred10_1: set_b > b > $o).
% 0.50/0.46  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/tmp/tmp.Zt1sWGZNOF/E---3.1_3864082.p', conj_0)).
% 0.50/0.46  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/tmp/tmp.Zt1sWGZNOF/E---3.1_3864082.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)).
% 0.50/0.46  thf(c_0_2, negated_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)))))))), inference(assume_negation,[status(cth)],[conj_0])).
% 0.50/0.46  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(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])])).
% 0.50/0.46  thf(c_0_4, 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_nnf,[status(thm)],[c_0_3])).
% 0.50/0.46  thf(c_0_5, plain, ![X2622:b, X16:set_b]:(((epred10_1 @ X16 @ X2622)<=>(member_b @ X2622 @ X16))), introduced(definition)).
% 0.50/0.46  thf(c_0_6, negated_conjecture, ((hilbert_Eps_b @ (epred10_1 @ (image_b_b @ (getRel904497637nt_a_b @ standard_S_Idt_a @ g) @ (insert_b @ x @ bot_bot_set_b))))!=(hilbert_Eps_b @ (epred10_1 @ (image_b_b @ (getRel904497637nt_a_b @ standard_S_Idt_a @ g) @ (insert_b @ y @ bot_bot_set_b))))), inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_4]), c_0_5]), c_0_5])).
% 0.50/0.46  thf(c_0_7, 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])).
% 0.50/0.46  thf(c_0_8, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_6, c_0_7]), ['proof']).
% 0.50/0.46  % SZS output end CNFRefutation
% 0.50/0.46  % Parsed axioms                        : 489
% 0.50/0.46  % Removed by relevancy pruning/SinE    : 0
% 0.50/0.46  % Initial clauses                      : 809
% 0.50/0.46  % Removed in clause preprocessing      : 157
% 0.50/0.46  % Initial clauses in saturation        : 652
% 0.50/0.46  % Processed clauses                    : 707
% 0.50/0.46  % ...of these trivial                  : 3
% 0.50/0.46  % ...subsumed                          : 119
% 0.50/0.46  % ...remaining for further processing  : 585
% 0.50/0.46  % Other redundant clauses eliminated   : 79
% 0.50/0.46  % Clauses deleted for lack of memory   : 0
% 0.50/0.46  % Backward-subsumed                    : 2
% 0.50/0.46  % Backward-rewritten                   : 3
% 0.50/0.46  % Generated clauses                    : 69
% 0.50/0.46  % ...of the previous two non-redundant : 49
% 0.50/0.46  % ...aggressively subsumed             : 0
% 0.50/0.46  % Contextual simplify-reflections      : 8
% 0.50/0.46  % Paramodulations                      : 1
% 0.50/0.46  % Factorizations                       : 0
% 0.50/0.46  % NegExts                              : 0
% 0.50/0.46  % Equation resolutions                 : 79
% 0.50/0.46  % Disequality decompositions           : 0
% 0.50/0.46  % Total rewrite steps                  : 31
% 0.50/0.46  % ...of those cached                   : 10
% 0.50/0.46  % Propositional unsat checks           : 0
% 0.50/0.46  %    Propositional check models        : 0
% 0.50/0.46  %    Propositional check unsatisfiable : 0
% 0.50/0.46  %    Propositional clauses             : 0
% 0.50/0.46  %    Propositional clauses after purity: 0
% 0.50/0.46  %    Propositional unsat core size     : 0
% 0.50/0.46  %    Propositional preprocessing time  : 0.000
% 0.50/0.46  %    Propositional encoding time       : 0.000
% 0.50/0.46  %    Propositional solver time         : 0.000
% 0.50/0.46  %    Success case prop preproc time    : 0.000
% 0.50/0.46  %    Success case prop encoding time   : 0.000
% 0.50/0.46  %    Success case prop solver time     : 0.000
% 1.09/0.46  % Current number of processed clauses  : 6
% 1.09/0.46  %    Positive orientable unit clauses  : 2
% 1.09/0.46  %    Positive unorientable unit clauses: 0
% 1.09/0.46  %    Negative unit clauses             : 4
% 1.09/0.46  %    Non-unit-clauses                  : 0
% 1.09/0.46  % Current number of unprocessed clauses: 500
% 1.09/0.46  % ...number of literals in the above   : 1082
% 1.09/0.46  % Current number of archived formulas  : 0
% 1.09/0.46  % Current number of archived clauses   : 511
% 1.09/0.46  % Clause-clause subsumption calls (NU) : 34318
% 1.09/0.46  % Rec. Clause-clause subsumption calls : 24025
% 1.09/0.46  % Non-unit clause-clause subsumptions  : 106
% 1.09/0.46  % Unit Clause-clause subsumption calls : 623
% 1.09/0.46  % Rewrite failures with RHS unbound    : 0
% 1.09/0.46  % BW rewrite match attempts            : 41
% 1.09/0.46  % BW rewrite match successes           : 25
% 1.09/0.46  % Condensation attempts                : 0
% 1.09/0.46  % Condensation successes               : 0
% 1.09/0.46  % Termbank termtop insertions          : 57841
% 1.09/0.46  % Search garbage collected termcells   : 14691
% 1.09/0.46  
% 1.09/0.46  % -------------------------------------------------
% 1.09/0.46  % User time                : 0.106 s
% 1.09/0.46  % System time              : 0.014 s
% 1.09/0.46  % Total time               : 0.120 s
% 1.09/0.46  % Maximum resident set size: 7392 pages
% 1.09/0.46  
% 1.09/0.46  % -------------------------------------------------
% 1.09/0.46  % User time                : 0.286 s
% 1.09/0.46  % System time              : 0.046 s
% 1.09/0.46  % Total time               : 0.332 s
% 1.09/0.46  % Maximum resident set size: 5888 pages
% 1.09/0.46  % E exiting
%------------------------------------------------------------------------------