↑ 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  : ITP177^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n016.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.27s 0.36s
% Output   : CNFRefutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   14 (   0 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   53 (   6   ~;   2   |;   0   &;  44   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :    3 (   0   ^;   3   !;   0   ?;   3   :)

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

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

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

thf(decl_55,type,
    labele1424214014nt_a_b: labele1159362096nt_a_b > set_b ).

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

thf(decl_167,type,
    g: labele1159362096nt_a_b ).

thf(decl_170,type,
    f: b > b ).

thf(decl_172,type,
    x: b ).

thf(conj_0,conjecture,
    member_b @ x @ ( labele1424214014nt_a_b @ g ),
    file('/export/starexec/sandbox2/tmp/tmp.cExgmNdoNN/E---3.1_847103.p',conj_0) ).

thf(fact_0__092_060open_062_092_060And_062xa_O_A_092_060lbrakk_062f_Axa_A_092_060in_062_Avertices_AG_059_Axa_A_092_060notin_062_Avertices_AG_092_060rbrakk_062_A_092_060Longrightarrow_062_AFalse_092_060close_062,axiom,
    ! [X1: b] :
      ( ( member_b @ ( f @ X1 ) @ ( labele1424214014nt_a_b @ g ) )
     => ( member_b @ X1 @ ( labele1424214014nt_a_b @ g ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.cExgmNdoNN/E---3.1_847103.p',fact_0__092_060open_062_092_060And_062xa_O_A_092_060lbrakk_062f_Axa_A_092_060in_062_Avertices_AG_059_Axa_A_092_060notin_062_Avertices_AG_092_060rbrakk_062_A_092_060Longrightarrow_062_AFalse_092_060close_062) ).

thf(fact_2_fv_I1_J,axiom,
    member_b @ ( f @ x ) @ ( labele1424214014nt_a_b @ g ),
    file('/export/starexec/sandbox2/tmp/tmp.cExgmNdoNN/E---3.1_847103.p',fact_2_fv_I1_J) ).

thf(c_0_3,negated_conjecture,
    ~ ( member_b @ x @ ( labele1424214014nt_a_b @ g ) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_4,negated_conjecture,
    ~ ( member_b @ x @ ( labele1424214014nt_a_b @ g ) ),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

thf(c_0_5,plain,
    ! [X1634: b] :
      ( ~ ( member_b @ ( f @ X1634 ) @ ( labele1424214014nt_a_b @ g ) )
      | ( member_b @ X1634 @ ( labele1424214014nt_a_b @ g ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0__092_060open_062_092_060And_062xa_O_A_092_060lbrakk_062f_Axa_A_092_060in_062_Avertices_AG_059_Axa_A_092_060notin_062_Avertices_AG_092_060rbrakk_062_A_092_060Longrightarrow_062_AFalse_092_060close_062])])]) ).

thf(c_0_6,negated_conjecture,
    ~ ( member_b @ x @ ( labele1424214014nt_a_b @ g ) ),
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

thf(c_0_7,plain,
    ! [X1: b] :
      ( ( member_b @ X1 @ ( labele1424214014nt_a_b @ g ) )
      | ~ ( member_b @ ( f @ X1 ) @ ( labele1424214014nt_a_b @ g ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_8,plain,
    member_b @ ( f @ x ) @ ( labele1424214014nt_a_b @ g ),
    inference(split_conjunct,[status(thm)],[fact_2_fv_I1_J]) ).

thf(c_0_9,negated_conjecture,
    ~ ( member_b @ x @ ( labele1424214014nt_a_b @ g ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_10,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP177^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.17  % Computer : n016.cluster.edu
% 0.08/0.17  % Model    : x86_64 x86_64
% 0.08/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17  % Memory   : 8046.5625MB
% 0.08/0.17  % OS       : Linux 6.8.0-71-generic
% 0.08/0.17  % CPULimit : 300
% 0.08/0.17  % WCLimit  : 300
% 0.08/0.17  % DateTime : Tue Sep 29 20:10:49 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.18  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running higher-order theorem proving
% 0.22/0.29  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.cExgmNdoNN/E---3.1_847103.p
% 0.27/0.36  % Version: 3.5.1-ho
% 0.27/0.36  % partial match(1): HSLMSMSMSSMNSFA
% 0.27/0.36  % Preprocessing class: HSLMSMSMSSMCSFA.
% 0.27/0.36  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.36  % Starting ho_unfolding_3 with 1500s (5) cores
% 0.27/0.36  % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.27/0.36  % Starting full_lambda_6 with 300s (1) cores
% 0.27/0.36  % Starting ehoh_best_sine with 300s (1) cores
% 0.27/0.36  % ehoh_best_sine with pid 847119 completed with status 0
% 0.27/0.36  % Result found by ehoh_best_sine
% 0.27/0.36  % partial match(1): HSLMSMSMSSMNSFA
% 0.27/0.36  % Preprocessing class: HSLMSMSMSSMCSFA.
% 0.27/0.36  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.36  % Starting ho_unfolding_3 with 1500s (5) cores
% 0.27/0.36  % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.27/0.36  % Starting full_lambda_6 with 300s (1) cores
% 0.27/0.36  % Starting ehoh_best_sine with 300s (1) cores
% 0.27/0.36  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = gf500_gu_R04_F100_L20000)
% 0.27/0.36  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.27/0.36  % Search class: HGHSM-FSLM32-MSFFFFBN
% 0.27/0.36  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.36  % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.36  % SubtermCWHack with pid 847120 completed with status 0
% 0.27/0.36  % Result found by SubtermCWHack
% 0.27/0.36  % partial match(1): HSLMSMSMSSMNSFA
% 0.27/0.36  % Preprocessing class: HSLMSMSMSSMCSFA.
% 0.27/0.36  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.36  % Starting ho_unfolding_3 with 1500s (5) cores
% 0.27/0.36  % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.27/0.36  % Starting full_lambda_6 with 300s (1) cores
% 0.27/0.36  % Starting ehoh_best_sine with 300s (1) cores
% 0.27/0.36  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = gf500_gu_R04_F100_L20000)
% 0.27/0.36  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.27/0.36  % Search class: HGHSM-FSLM32-MSFFFFBN
% 0.27/0.36  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.36  % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.36  % Preprocessing time       : 0.007 s
% 0.27/0.36  
% 0.27/0.36  % Proof found!
% 0.27/0.36  % SZS status Theorem
% 0.27/0.36  % SZS output start CNFRefutation
% See solution above
% 0.27/0.36  % Parsed axioms                        : 563
% 0.27/0.36  % Removed by relevancy pruning/SinE    : 313
% 0.27/0.36  % Initial clauses                      : 415
% 0.27/0.36  % Removed in clause preprocessing      : 19
% 0.27/0.36  % Initial clauses in saturation        : 396
% 0.27/0.36  % Processed clauses                    : 214
% 0.27/0.36  % ...of these trivial                  : 6
% 0.27/0.36  % ...subsumed                          : 42
% 0.27/0.36  % ...remaining for further processing  : 166
% 0.27/0.36  % Other redundant clauses eliminated   : 37
% 0.27/0.36  % Clauses deleted for lack of memory   : 0
% 0.27/0.36  % Backward-subsumed                    : 2
% 0.27/0.36  % Backward-rewritten                   : 8
% 0.27/0.36  % Generated clauses                    : 212
% 0.27/0.36  % ...of the previous two non-redundant : 106
% 0.27/0.36  % ...aggressively subsumed             : 0
% 0.27/0.36  % Contextual simplify-reflections      : 0
% 0.27/0.36  % Paramodulations                      : 168
% 0.27/0.36  % Factorizations                       : 0
% 0.27/0.36  % NegExts                              : 0
% 0.27/0.36  % Equation resolutions                 : 44
% 0.27/0.36  % Disequality decompositions           : 0
% 0.27/0.36  % Total rewrite steps                  : 95
% 0.27/0.36  % ...of those cached                   : 47
% 0.27/0.36  % Propositional unsat checks           : 0
% 0.27/0.36  %    Propositional check models        : 0
% 0.27/0.36  %    Propositional check unsatisfiable : 0
% 0.27/0.36  %    Propositional clauses             : 0
% 0.27/0.36  %    Propositional clauses after purity: 0
% 0.27/0.36  %    Propositional unsat core size     : 0
% 0.27/0.36  %    Propositional preprocessing time  : 0.000
% 0.27/0.36  %    Propositional encoding time       : 0.000
% 0.27/0.36  %    Propositional solver time         : 0.000
% 0.27/0.36  %    Success case prop preproc time    : 0.000
% 0.27/0.36  %    Success case prop encoding time   : 0.000
% 0.27/0.36  %    Success case prop solver time     : 0.000
% 0.27/0.36  % Current number of processed clauses  : 135
% 0.27/0.36  %    Positive orientable unit clauses  : 59
% 0.27/0.36  %    Positive unorientable unit clauses: 0
% 0.27/0.36  %    Negative unit clauses             : 7
% 0.27/0.36  %    Non-unit-clauses                  : 69
% 0.27/0.36  % Current number of unprocessed clauses: 285
% 0.27/0.36  % ...number of literals in the above   : 774
% 0.27/0.36  % Current number of archived formulas  : 0
% 0.27/0.36  % Current number of archived clauses   : 10
% 0.27/0.36  % Clause-clause subsumption calls (NU) : 540
% 0.27/0.36  % Rec. Clause-clause subsumption calls : 530
% 0.27/0.36  % Non-unit clause-clause subsumptions  : 21
% 0.27/0.36  % Unit Clause-clause subsumption calls : 311
% 0.27/0.36  % Rewrite failures with RHS unbound    : 0
% 0.27/0.36  % BW rewrite match attempts            : 18
% 0.27/0.36  % BW rewrite match successes           : 8
% 0.27/0.36  % Condensation attempts                : 0
% 0.27/0.36  % Condensation successes               : 0
% 0.27/0.36  % Termbank termtop insertions          : 36463
% 0.27/0.36  % Search garbage collected termcells   : 10735
% 0.27/0.36  
% 0.27/0.36  % -------------------------------------------------
% 0.27/0.36  % User time                : 0.030 s
% 0.27/0.36  % System time              : 0.010 s
% 0.27/0.36  % Total time               : 0.040 s
% 0.27/0.36  % Maximum resident set size: 6616 pages
% 0.27/0.36  
% 0.27/0.36  % -------------------------------------------------
% 0.27/0.36  % User time                : 0.045 s
% 0.27/0.36  % System time              : 0.019 s
% 0.27/0.36  % Total time               : 0.064 s
% 0.27/0.36  % Maximum resident set size: 6144 pages
% 0.27/0.36  % E exiting
%------------------------------------------------------------------------------