↑ Up

E---3.5.1.THM-CRf.s

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

% Result   : Theorem 0.36s 0.47s
% Output   : CNFRefutation 0.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   16 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   37 (   0 equ;   0 cnn)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  107 (  16   ~;  11   |;   6   &;  70   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :    5 (   0   ^;   4   !;   1   ?;   5   :)

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

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

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

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

thf(decl_39,type,
    ord_less_eq_set_a: set_a > set_a > $o ).

thf(decl_57,type,
    produc1040928388_a_a_e: produc715398134_a_a_e > set_a ).

thf(decl_80,type,
    image_64240033_set_a: ( produc715398134_a_a_e > set_a ) > set_Pr204296108_a_a_e > set_set_a ).

thf(decl_100,type,
    member_set_a: set_a > set_set_a > $o ).

thf(decl_102,type,
    c: set_Pr204296108_a_a_e ).

thf(decl_103,type,
    a1: set_a ).

thf(decl_104,type,
    a2: set_a ).

thf(decl_105,type,
    a3: set_a ).

thf(decl_109,type,
    thesis: $o ).

thf(decl_118,type,
    esk9_0: set_a ).

thf(conj_1,conjecture,
    thesis,
    file('/export/starexec/sandbox2/tmp/tmp.wVHCm3W2cB/E---3.1_547663.p',conj_1) ).

thf(conj_0,hypothesis,
    ! [X891: set_a] :
      ( ( member_set_a @ X891 @ ( image_64240033_set_a @ produc1040928388_a_a_e @ c ) )
     => ( ( ord_less_eq_set_a @ a1 @ X891 )
       => ( ( ord_less_eq_set_a @ a2 @ X891 )
         => ( ( ord_less_eq_set_a @ a3 @ X891 )
           => thesis ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.wVHCm3W2cB/E---3.1_547663.p',conj_0) ).

thf(fact_1__092_060open_062_092_060exists_062a_092_060in_062fst_A_096_AC_O_Aa1_A_092_060subseteq_062_Aa_A_092_060and_062_Aa2_A_092_060subseteq_062_Aa_A_092_060and_062_Aa3_A_092_060subseteq_062_Aa_092_060close_062,axiom,
    ? [X3: set_a] :
      ( ( member_set_a @ X3 @ ( image_64240033_set_a @ produc1040928388_a_a_e @ c ) )
      & ( ord_less_eq_set_a @ a1 @ X3 )
      & ( ord_less_eq_set_a @ a2 @ X3 )
      & ( ord_less_eq_set_a @ a3 @ X3 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.wVHCm3W2cB/E---3.1_547663.p',fact_1__092_060open_062_092_060exists_062a_092_060in_062fst_A_096_AC_O_Aa1_A_092_060subseteq_062_Aa_A_092_060and_062_Aa2_A_092_060subseteq_062_Aa_A_092_060and_062_Aa3_A_092_060subseteq_062_Aa_092_060close_062) ).

thf(c_0_3,negated_conjecture,
    ~ thesis,
    inference(assume_negation,[status(cth)],[conj_1]) ).

thf(c_0_4,negated_conjecture,
    ~ thesis,
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

thf(c_0_5,hypothesis,
    ! [X1246: set_a] :
      ( ~ ( member_set_a @ X1246 @ ( image_64240033_set_a @ produc1040928388_a_a_e @ c ) )
      | ~ ( ord_less_eq_set_a @ a1 @ X1246 )
      | ~ ( ord_less_eq_set_a @ a2 @ X1246 )
      | ~ ( ord_less_eq_set_a @ a3 @ X1246 )
      | thesis ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_0])])]) ).

thf(c_0_6,negated_conjecture,
    ~ thesis,
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

thf(c_0_7,hypothesis,
    ! [X3: set_a] :
      ( thesis
      | ~ ( member_set_a @ X3 @ ( image_64240033_set_a @ produc1040928388_a_a_e @ c ) )
      | ~ ( ord_less_eq_set_a @ a1 @ X3 )
      | ~ ( ord_less_eq_set_a @ a2 @ X3 )
      | ~ ( ord_less_eq_set_a @ a3 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_8,negated_conjecture,
    ~ thesis,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_9,plain,
    ( ( member_set_a @ esk9_0 @ ( image_64240033_set_a @ produc1040928388_a_a_e @ c ) )
    & ( ord_less_eq_set_a @ a1 @ esk9_0 )
    & ( ord_less_eq_set_a @ a2 @ esk9_0 )
    & ( ord_less_eq_set_a @ a3 @ esk9_0 ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[fact_1__092_060open_062_092_060exists_062a_092_060in_062fst_A_096_AC_O_Aa1_A_092_060subseteq_062_Aa_A_092_060and_062_Aa2_A_092_060subseteq_062_Aa_A_092_060and_062_Aa3_A_092_060subseteq_062_Aa_092_060close_062])]) ).

thf(c_0_10,hypothesis,
    ! [X3: set_a] :
      ( ~ ( member_set_a @ X3 @ ( image_64240033_set_a @ produc1040928388_a_a_e @ c ) )
      | ~ ( ord_less_eq_set_a @ a1 @ X3 )
      | ~ ( ord_less_eq_set_a @ a2 @ X3 )
      | ~ ( ord_less_eq_set_a @ a3 @ X3 ) ),
    inference(sr,[status(thm)],[c_0_7,c_0_8]) ).

thf(c_0_11,plain,
    member_set_a @ esk9_0 @ ( image_64240033_set_a @ produc1040928388_a_a_e @ c ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_12,plain,
    ord_less_eq_set_a @ a1 @ esk9_0,
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_13,plain,
    ord_less_eq_set_a @ a2 @ esk9_0,
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_14,plain,
    ord_less_eq_set_a @ a3 @ esk9_0,
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP028^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.10/0.21  % Computer : n018.cluster.edu
% 0.10/0.21  % Model    : x86_64 x86_64
% 0.10/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.21  % Memory   : 8046.5625MB
% 0.10/0.21  % OS       : Linux 6.8.0-71-generic
% 0.10/0.21  % CPULimit : 300
% 0.10/0.21  % WCLimit  : 300
% 0.10/0.21  % DateTime : Tue Sep 29 19:40:41 UTC 2026
% 0.10/0.21  % CPUTime  : 
% 0.10/0.21  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.28  Running higher-order theorem proving
% 0.27/0.37  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.wVHCm3W2cB/E---3.1_547663.p
% 0.36/0.47  % Version: 3.5.1-ho
% 0.36/0.47  % Preprocessing class: HSLSSMSMSSMCHSA.
% 0.36/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.47  % Starting post_as_ho6 with 1500s (5) cores
% 0.36/0.47  % Starting post_as_ho8 with 300s (1) cores
% 0.36/0.47  % Starting new_bool_3 with 300s (1) cores
% 0.36/0.47  % Starting new_bool_1 with 300s (1) cores
% 0.36/0.47  % post_as_ho6 with pid 547676 completed with status 0
% 0.36/0.47  % Result found by post_as_ho6
% 0.36/0.47  % Preprocessing class: HSLSSMSMSSMCHSA.
% 0.36/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.47  % Starting post_as_ho6 with 1500s (5) cores
% 0.36/0.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true))
% 0.36/0.47  % SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true)
% 0.36/0.47  % Search class: HGUSM-FSLM32-SHSFFSBN
% 0.36/0.47  % partial match(1): HGUSM-FSLM32-MHSFFSBN
% 0.36/0.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/0.47  % Starting SubtermCWHack with 136s (1) cores
% 0.36/0.47  % Starting post_as_ho6 with 151s (1) cores
% 0.36/0.47  % Starting almost_fo_3 with 136s (1) cores
% 0.36/0.47  % Starting lpo6_lambda_fix with 136s (1) cores
% 0.36/0.47  % Starting additional_ho_6 with 136s (1) cores
% 0.36/0.47  % almost_fo_3 with pid 547685 completed with status 0
% 0.36/0.47  % Result found by almost_fo_3
% 0.36/0.47  % Preprocessing class: HSLSSMSMSSMCHSA.
% 0.36/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.47  % Starting post_as_ho6 with 1500s (5) cores
% 0.36/0.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true))
% 0.36/0.47  % SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true)
% 0.36/0.47  % Search class: HGUSM-FSLM32-SHSFFSBN
% 0.36/0.47  % partial match(1): HGUSM-FSLM32-MHSFFSBN
% 0.36/0.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/0.47  % Starting SubtermCWHack with 136s (1) cores
% 0.36/0.47  % Starting post_as_ho6 with 151s (1) cores
% 0.36/0.47  % Starting almost_fo_3 with 136s (1) cores
% 0.36/0.47  % Preprocessing time       : 0.004 s
% 0.36/0.47  % Presaturation interreduction done
% 0.36/0.47  
% 0.36/0.47  % Proof found!
% 0.36/0.47  % SZS status Theorem
% 0.36/0.47  % SZS output start CNFRefutation
% See solution above
% 0.36/0.47  % Parsed axioms                        : 456
% 0.36/0.47  % Removed by relevancy pruning/SinE    : 330
% 0.36/0.47  % Initial clauses                      : 205
% 0.36/0.47  % Removed in clause preprocessing      : 20
% 0.36/0.47  % Initial clauses in saturation        : 185
% 0.36/0.47  % Processed clauses                    : 283
% 0.36/0.47  % ...of these trivial                  : 7
% 0.36/0.47  % ...subsumed                          : 51
% 0.36/0.47  % ...remaining for further processing  : 225
% 0.36/0.47  % Other redundant clauses eliminated   : 66
% 0.36/0.47  % Clauses deleted for lack of memory   : 0
% 0.36/0.47  % Backward-subsumed                    : 0
% 0.36/0.47  % Backward-rewritten                   : 4
% 0.36/0.47  % Generated clauses                    : 163
% 0.36/0.47  % ...of the previous two non-redundant : 75
% 0.36/0.47  % ...aggressively subsumed             : 0
% 0.36/0.47  % Contextual simplify-reflections      : 0
% 0.36/0.47  % Paramodulations                      : 71
% 0.36/0.47  % Factorizations                       : 0
% 0.36/0.47  % NegExts                              : 0
% 0.36/0.47  % Equation resolutions                 : 69
% 0.36/0.47  % Disequality decompositions           : 0
% 0.36/0.47  % Total rewrite steps                  : 78
% 0.36/0.47  % ...of those cached                   : 56
% 0.36/0.47  % Propositional unsat checks           : 0
% 0.36/0.47  %    Propositional check models        : 0
% 0.36/0.47  %    Propositional check unsatisfiable : 0
% 0.36/0.47  %    Propositional clauses             : 0
% 0.36/0.47  %    Propositional clauses after purity: 0
% 0.36/0.47  %    Propositional unsat core size     : 0
% 0.36/0.47  %    Propositional preprocessing time  : 0.000
% 0.36/0.47  %    Propositional encoding time       : 0.000
% 0.36/0.47  %    Propositional solver time         : 0.000
% 0.36/0.47  %    Success case prop preproc time    : 0.000
% 0.36/0.47  %    Success case prop encoding time   : 0.000
% 0.36/0.47  %    Success case prop solver time     : 0.000
% 0.36/0.47  % Current number of processed clauses  : 70
% 0.36/0.47  %    Positive orientable unit clauses  : 25
% 0.36/0.47  %    Positive unorientable unit clauses: 0
% 0.36/0.47  %    Negative unit clauses             : 1
% 0.36/0.47  %    Non-unit-clauses                  : 44
% 0.36/0.47  % Current number of unprocessed clauses: 71
% 0.36/0.47  % ...number of literals in the above   : 183
% 0.36/0.47  % Current number of archived formulas  : 0
% 0.36/0.47  % Current number of archived clauses   : 105
% 0.36/0.47  % Clause-clause subsumption calls (NU) : 719
% 0.36/0.47  % Rec. Clause-clause subsumption calls : 604
% 0.36/0.47  % Non-unit clause-clause subsumptions  : 51
% 0.36/0.47  % Unit Clause-clause subsumption calls : 7
% 0.36/0.47  % Rewrite failures with RHS unbound    : 0
% 0.36/0.47  % BW rewrite match attempts            : 15
% 0.36/0.47  % BW rewrite match successes           : 4
% 0.36/0.47  % Condensation attempts                : 0
% 0.36/0.47  % Condensation successes               : 0
% 0.36/0.47  % Termbank termtop insertions          : 22294
% 0.36/0.47  % Search garbage collected termcells   : 7859
% 0.36/0.47  
% 0.36/0.47  % -------------------------------------------------
% 0.36/0.47  % User time                : 0.034 s
% 0.36/0.47  % System time              : 0.009 s
% 0.36/0.47  % Total time               : 0.042 s
% 0.36/0.47  % Maximum resident set size: 5532 pages
% 0.36/0.47  
% 0.36/0.47  % -------------------------------------------------
% 0.36/0.47  % User time                : 0.109 s
% 0.36/0.47  % System time              : 0.047 s
% 0.36/0.47  % Total time               : 0.155 s
% 0.36/0.47  % Maximum resident set size: 5888 pages
% 0.36/0.47  % E exiting
%------------------------------------------------------------------------------