↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP162^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:04:33 AM UTC 2026

% Result   : Theorem 0.20s 0.35s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   32 (   7 equ;   0 cnn)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :  115 (   4   ~;   0   |;   9   &; 102   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   8 usr;   2 con; 0-2 aty)
%            Number of variables   :   23 (   9   ^;  14   !;   0   ?;  23   :)

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

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

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

thf(decl_28,type,
    inf_in262696383nres_a: refine424419629nres_a > refine424419629nres_a > refine424419629nres_a ).

thf(decl_29,type,
    inf_inf_set_a: set_a > set_a > set_a ).

thf(decl_34,type,
    ord_le519537037nres_a: refine424419629nres_a > refine424419629nres_a > $o ).

thf(decl_44,type,
    refine1198353288_RES_a: set_a > refine424419629nres_a ).

thf(decl_46,type,
    collect_a: ( a > $o ) > set_a ).

thf(decl_48,type,
    a2: refine424419629nres_a ).

thf(decl_49,type,
    p: a > $o ).

thf(decl_50,type,
    q: a > $o ).

thf(conj_0,conjecture,
    ( ord_le519537037nres_a @ a2
    @ ( refine1198353288_RES_a
      @ ( collect_a
        @ ^ [X746: a] :
            ( ( p @ X746 )
            & ( q @ X746 ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.J2rH5bkx7N/E---3.1_3859327.p',conj_0) ).

thf(fact_272_Collect__conj__eq,axiom,
    ! [X644: a > $o,X12: a > $o] :
      ( ( collect_a
        @ ^ [X53: a] :
            ( ( X644 @ X53 )
            & ( X12 @ X53 ) ) )
      = ( inf_inf_set_a @ ( collect_a @ X644 ) @ ( collect_a @ X12 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.J2rH5bkx7N/E---3.1_3859327.p',fact_272_Collect__conj__eq) ).

thf(fact_148_inf__nres_Osimps_I3_J,axiom,
    ! [X401: set_a,X402: set_a] :
      ( ( inf_in262696383nres_a @ ( refine1198353288_RES_a @ X401 ) @ ( refine1198353288_RES_a @ X402 ) )
      = ( refine1198353288_RES_a @ ( inf_inf_set_a @ X401 @ X402 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.J2rH5bkx7N/E---3.1_3859327.p',fact_148_inf__nres_Osimps_I3_J) ).

thf(fact_4__092_060open_062A_A_092_060le_062_Ainf_A_ISPEC_AP_J_A_ISPEC_AQ_J_092_060close_062,axiom,
    ord_le519537037nres_a @ a2 @ ( inf_in262696383nres_a @ ( refine1198353288_RES_a @ ( collect_a @ p ) ) @ ( refine1198353288_RES_a @ ( collect_a @ q ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.J2rH5bkx7N/E---3.1_3859327.p',fact_4__092_060open_062A_A_092_060le_062_Ainf_A_ISPEC_AP_J_A_ISPEC_AQ_J_092_060close_062) ).

thf(c_0_4,negated_conjecture,
    ~ ( ord_le519537037nres_a @ a2
      @ ( refine1198353288_RES_a
        @ ( collect_a
          @ ^ [X746: a] :
              ( ( p @ X746 )
              & ( q @ X746 ) ) ) ) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_5,negated_conjecture,
    ~ ( ord_le519537037nres_a @ a2
      @ ( refine1198353288_RES_a
        @ ( collect_a
          @ ^ [Z0: a] :
              ( ( p @ Z0 )
              & ( q @ Z0 ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])]) ).

thf(c_0_6,plain,
    ! [X644: a > $o,X12: a > $o] :
      ( ( collect_a
        @ ^ [Z0: a] :
            ( ( X644 @ Z0 )
            & ( X12 @ Z0 ) ) )
      = ( inf_inf_set_a @ ( collect_a @ X644 ) @ ( collect_a @ X12 ) ) ),
    inference(fof_simplification,[status(thm)],[fact_272_Collect__conj__eq]) ).

thf(c_0_7,plain,
    ! [X1276: set_a,X1277: set_a] :
      ( ( inf_in262696383nres_a @ ( refine1198353288_RES_a @ X1276 ) @ ( refine1198353288_RES_a @ X1277 ) )
      = ( refine1198353288_RES_a @ ( inf_inf_set_a @ X1276 @ X1277 ) ) ),
    inference(variable_rename,[status(thm)],[fact_148_inf__nres_Osimps_I3_J]) ).

thf(c_0_8,negated_conjecture,
    ~ ( ord_le519537037nres_a @ a2
      @ ( refine1198353288_RES_a
        @ ( collect_a
          @ ^ [Z0: a] :
              ( ( p @ Z0 )
              & ( q @ Z0 ) ) ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_5]) ).

thf(c_0_9,plain,
    ! [X1300: a > $o,X1301: a > $o] :
      ( ( collect_a
        @ ^ [Z0: a] :
            ( ( X1300 @ Z0 )
            & ( X1301 @ Z0 ) ) )
      = ( inf_inf_set_a @ ( collect_a @ X1300 ) @ ( collect_a @ X1301 ) ) ),
    inference(variable_rename,[status(thm)],[c_0_6]) ).

thf(c_0_10,plain,
    ord_le519537037nres_a @ a2 @ ( inf_in262696383nres_a @ ( refine1198353288_RES_a @ ( collect_a @ p ) ) @ ( refine1198353288_RES_a @ ( collect_a @ q ) ) ),
    inference(split_conjunct,[status(thm)],[fact_4__092_060open_062A_A_092_060le_062_Ainf_A_ISPEC_AP_J_A_ISPEC_AQ_J_092_060close_062]) ).

thf(c_0_11,plain,
    ! [X1: set_a,X2: set_a] :
      ( ( inf_in262696383nres_a @ ( refine1198353288_RES_a @ X1 ) @ ( refine1198353288_RES_a @ X2 ) )
      = ( refine1198353288_RES_a @ ( inf_inf_set_a @ X1 @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_12,negated_conjecture,
    ~ ( ord_le519537037nres_a @ a2
      @ ( refine1198353288_RES_a
        @ ( collect_a
          @ ^ [Z0: a] :
              ( ( p @ Z0 )
              & ( q @ Z0 ) ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_13,plain,
    ! [X7: a > $o,X12: a > $o] :
      ( ( collect_a
        @ ^ [Z0: a] :
            ( ( X7 @ Z0 )
            & ( X12 @ Z0 ) ) )
      = ( inf_inf_set_a @ ( collect_a @ X7 ) @ ( collect_a @ X12 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_14,plain,
    ord_le519537037nres_a @ a2 @ ( refine1198353288_RES_a @ ( inf_inf_set_a @ ( collect_a @ p ) @ ( collect_a @ q ) ) ),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

thf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP162^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.09/0.18  % Computer : n007.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Tue Sep 29 20:02:11 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23  Running higher-order theorem proving
% 0.20/0.28  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.J2rH5bkx7N/E---3.1_3859327.p
% 0.20/0.35  % Version: 3.5.1-ho
% 0.20/0.35  % Preprocessing class: HSLSSMSSSSLCHSA.
% 0.20/0.35  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.35  % Starting sh2 with 1200s (4) cores
% 0.20/0.35  % Starting full_lambda_3 with 300s (1) cores
% 0.20/0.35  % Starting ehoh_best7_lambda with 300s (1) cores
% 0.20/0.35  % Starting post_as_ho9 with 300s (1) cores
% 0.20/0.35  % Starting almost_fo_4 with 300s (1) cores
% 0.20/0.35  % post_as_ho9 with pid 3859352 completed with status 0
% 0.20/0.35  % Result found by post_as_ho9
% 0.20/0.35  % Preprocessing class: HSLSSMSSSSLCHSA.
% 0.20/0.35  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.35  % Starting sh2 with 1200s (4) cores
% 0.20/0.35  % Starting full_lambda_3 with 300s (1) cores
% 0.20/0.35  % Starting ehoh_best7_lambda with 300s (1) cores
% 0.20/0.35  % Starting post_as_ho9 with 300s (1) cores
% 0.20/0.35  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,,true,1,0,2,20000,1.0,true))
% 0.20/0.35  % SinE strategy is GSinE(CountFormulas,,true,1,0,2,20000,1.0,true)
% 0.20/0.35  % Search class: HGUSM-FSLS32-DHSFFSBN
% 0.20/0.35  % partial match(1): HGUSM-FSLM32-DHSFFSBN
% 0.20/0.35  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.35  % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.35  % SubtermCWHack with pid 3859358 completed with status 0
% 0.20/0.35  % Result found by SubtermCWHack
% 0.20/0.35  % Preprocessing class: HSLSSMSSSSLCHSA.
% 0.20/0.35  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.35  % Starting sh2 with 1200s (4) cores
% 0.20/0.35  % Starting full_lambda_3 with 300s (1) cores
% 0.20/0.35  % Starting ehoh_best7_lambda with 300s (1) cores
% 0.20/0.35  % Starting post_as_ho9 with 300s (1) cores
% 0.20/0.35  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,,true,1,0,2,20000,1.0,true))
% 0.20/0.35  % SinE strategy is GSinE(CountFormulas,,true,1,0,2,20000,1.0,true)
% 0.20/0.35  % Search class: HGUSM-FSLS32-DHSFFSBN
% 0.20/0.35  % partial match(1): HGUSM-FSLM32-DHSFFSBN
% 0.20/0.35  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.35  % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.35  % Preprocessing time       : 0.005 s
% 0.20/0.35  
% 0.20/0.35  % Proof found!
% 0.20/0.35  % SZS status Theorem
% 0.20/0.35  % SZS output start CNFRefutation
% See solution above
% 0.20/0.35  % Parsed axioms                        : 388
% 0.20/0.35  % Removed by relevancy pruning/SinE    : 227
% 0.20/0.35  % Initial clauses                      : 229
% 0.20/0.35  % Removed in clause preprocessing      : 9
% 0.20/0.35  % Initial clauses in saturation        : 220
% 0.20/0.35  % Processed clauses                    : 436
% 0.20/0.35  % ...of these trivial                  : 152
% 0.20/0.35  % ...subsumed                          : 156
% 0.20/0.35  % ...remaining for further processing  : 128
% 0.20/0.35  % Other redundant clauses eliminated   : 22
% 0.20/0.35  % Clauses deleted for lack of memory   : 0
% 0.20/0.35  % Backward-subsumed                    : 0
% 0.20/0.35  % Backward-rewritten                   : 12
% 0.20/0.35  % Generated clauses                    : 1861
% 0.20/0.35  % ...of the previous two non-redundant : 972
% 0.20/0.35  % ...aggressively subsumed             : 0
% 0.20/0.35  % Contextual simplify-reflections      : 0
% 0.20/0.35  % Paramodulations                      : 1838
% 0.20/0.35  % Factorizations                       : 0
% 0.20/0.35  % NegExts                              : 0
% 0.20/0.35  % Equation resolutions                 : 23
% 0.20/0.35  % Disequality decompositions           : 0
% 0.20/0.35  % Total rewrite steps                  : 1286
% 0.20/0.35  % ...of those cached                   : 894
% 0.20/0.35  % Propositional unsat checks           : 0
% 0.20/0.35  %    Propositional check models        : 0
% 0.20/0.35  %    Propositional check unsatisfiable : 0
% 0.20/0.35  %    Propositional clauses             : 0
% 0.20/0.35  %    Propositional clauses after purity: 0
% 0.20/0.35  %    Propositional unsat core size     : 0
% 0.20/0.35  %    Propositional preprocessing time  : 0.000
% 0.20/0.35  %    Propositional encoding time       : 0.000
% 0.20/0.35  %    Propositional solver time         : 0.000
% 0.20/0.35  %    Success case prop preproc time    : 0.000
% 0.20/0.35  %    Success case prop encoding time   : 0.000
% 0.20/0.35  %    Success case prop solver time     : 0.000
% 0.20/0.35  % Current number of processed clauses  : 98
% 0.20/0.35  %    Positive orientable unit clauses  : 54
% 0.20/0.35  %    Positive unorientable unit clauses: 4
% 0.20/0.35  %    Negative unit clauses             : 1
% 0.20/0.35  %    Non-unit-clauses                  : 39
% 0.20/0.35  % Current number of unprocessed clauses: 752
% 0.20/0.35  % ...number of literals in the above   : 1278
% 0.20/0.35  % Current number of archived formulas  : 0
% 0.20/0.35  % Current number of archived clauses   : 12
% 0.20/0.35  % Clause-clause subsumption calls (NU) : 450
% 0.20/0.35  % Rec. Clause-clause subsumption calls : 450
% 0.20/0.35  % Non-unit clause-clause subsumptions  : 143
% 0.20/0.35  % Unit Clause-clause subsumption calls : 17
% 0.20/0.35  % Rewrite failures with RHS unbound    : 0
% 0.20/0.35  % BW rewrite match attempts            : 144
% 0.20/0.35  % BW rewrite match successes           : 34
% 0.20/0.35  % Condensation attempts                : 0
% 0.20/0.35  % Condensation successes               : 0
% 0.20/0.35  % Termbank termtop insertions          : 33389
% 0.20/0.35  % Search garbage collected termcells   : 7554
% 0.20/0.35  
% 0.20/0.35  % -------------------------------------------------
% 0.20/0.35  % User time                : 0.031 s
% 0.20/0.35  % System time              : 0.008 s
% 0.20/0.35  % Total time               : 0.039 s
% 0.20/0.35  % Maximum resident set size: 5556 pages
% 0.20/0.35  
% 0.20/0.35  % -------------------------------------------------
% 0.20/0.35  % User time                : 0.046 s
% 0.20/0.35  % System time              : 0.012 s
% 0.20/0.35  % Total time               : 0.058 s
% 0.20/0.35  % Maximum resident set size: 5632 pages
% 0.20/0.35  % E exiting
%------------------------------------------------------------------------------