↑ Up

E---3.5.1.THM-CRf.s

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

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

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

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

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

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

thf(decl_24,type,
    edmond475474835dges_a: ( product_prod_nat_nat > a ) > nat > nat > set_Pr1986765409at_nat ).

thf(decl_26,type,
    finite772653738at_nat: set_Pr1986765409at_nat > $o ).

thf(decl_33,type,
    e_a: ( product_prod_nat_nat > a ) > set_Pr1986765409at_nat ).

thf(decl_52,type,
    ord_le841296385at_nat: set_Pr1986765409at_nat > set_Pr1986765409at_nat > $o ).

thf(decl_85,type,
    c: product_prod_nat_nat > a ).

thf(decl_86,type,
    s: nat ).

thf(decl_87,type,
    t: nat ).

thf(conj_0,conjecture,
    finite772653738at_nat @ ( edmond475474835dges_a @ c @ s @ t ),
    file('/export/starexec/sandbox2/tmp/tmp.UIQF2Hl5dA/E---3.1_4019858.p',conj_0) ).

thf(fact_56_rev__finite__subset,axiom,
    ! [X78: set_Pr1986765409at_nat,X31: set_Pr1986765409at_nat] :
      ( ( finite772653738at_nat @ X78 )
     => ( ( ord_le841296385at_nat @ X31 @ X78 )
       => ( finite772653738at_nat @ X31 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.UIQF2Hl5dA/E---3.1_4019858.p',fact_56_rev__finite__subset) ).

thf(fact_4_spEdges__ss__E,axiom,
    ord_le841296385at_nat @ ( edmond475474835dges_a @ c @ s @ t ) @ ( e_a @ c ),
    file('/export/starexec/sandbox2/tmp/tmp.UIQF2Hl5dA/E---3.1_4019858.p',fact_4_spEdges__ss__E) ).

thf(fact_3_finite__E,axiom,
    finite772653738at_nat @ ( e_a @ c ),
    file('/export/starexec/sandbox2/tmp/tmp.UIQF2Hl5dA/E---3.1_4019858.p',fact_3_finite__E) ).

thf(c_0_4,negated_conjecture,
    ~ ( finite772653738at_nat @ ( edmond475474835dges_a @ c @ s @ t ) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_5,negated_conjecture,
    ~ ( finite772653738at_nat @ ( edmond475474835dges_a @ c @ s @ t ) ),
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

thf(c_0_6,plain,
    ! [X896: set_Pr1986765409at_nat,X897: set_Pr1986765409at_nat] :
      ( ~ ( finite772653738at_nat @ X896 )
      | ~ ( ord_le841296385at_nat @ X897 @ X896 )
      | ( finite772653738at_nat @ X897 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_56_rev__finite__subset])])]) ).

thf(c_0_7,negated_conjecture,
    ~ ( finite772653738at_nat @ ( edmond475474835dges_a @ c @ s @ t ) ),
    inference(fof_nnf,[status(thm)],[c_0_5]) ).

thf(c_0_8,plain,
    ! [X31: set_Pr1986765409at_nat,X4: set_Pr1986765409at_nat] :
      ( ( finite772653738at_nat @ X31 )
      | ~ ( finite772653738at_nat @ X4 )
      | ~ ( ord_le841296385at_nat @ X31 @ X4 ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_9,plain,
    ord_le841296385at_nat @ ( edmond475474835dges_a @ c @ s @ t ) @ ( e_a @ c ),
    inference(split_conjunct,[status(thm)],[fact_4_spEdges__ss__E]) ).

thf(c_0_10,plain,
    finite772653738at_nat @ ( e_a @ c ),
    inference(split_conjunct,[status(thm)],[fact_3_finite__E]) ).

thf(c_0_11,negated_conjecture,
    ~ ( finite772653738at_nat @ ( edmond475474835dges_a @ c @ s @ t ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_12,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP049^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.07/0.18  % Computer : n015.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Tue Sep 29 19:46:47 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.22  Running higher-order theorem proving
% 0.07/0.25  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.UIQF2Hl5dA/E---3.1_4019858.p
% 0.24/0.29  % Version: 3.5.1-ho
% 0.24/0.29  % Preprocessing class: HSLSSMSSSSLNHSA.
% 0.24/0.29  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.29  % Starting pre_casc_6 with 1200s (4) cores
% 0.24/0.29  % Starting sh4 with 600s (2) cores
% 0.24/0.29  % Starting pre_casc_4 with 300s (1) cores
% 0.24/0.29  % Starting full_lambda_7 with 300s (1) cores
% 0.24/0.29  % pre_casc_4 with pid 4019887 completed with status 0
% 0.24/0.29  % Result found by pre_casc_4
% 0.24/0.29  % Preprocessing class: HSLSSMSSSSLNHSA.
% 0.24/0.29  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.29  % Starting pre_casc_6 with 1200s (4) cores
% 0.24/0.29  % Starting sh4 with 600s (2) cores
% 0.24/0.29  % Starting pre_casc_4 with 300s (1) cores
% 0.24/0.29  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.24/0.29  % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.24/0.29  % Search class: HGUSM-FFMS32-DHSFFSBN
% 0.24/0.29  % partial match(3): HGUSM-FFMF32-SHSFMSBN
% 0.24/0.29  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.29  % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.29  % SubtermCWHack with pid 4019889 completed with status 0
% 0.24/0.29  % Result found by SubtermCWHack
% 0.24/0.29  % Preprocessing class: HSLSSMSSSSLNHSA.
% 0.24/0.29  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.29  % Starting pre_casc_6 with 1200s (4) cores
% 0.24/0.29  % Starting sh4 with 600s (2) cores
% 0.24/0.29  % Starting pre_casc_4 with 300s (1) cores
% 0.24/0.29  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.24/0.29  % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.24/0.29  % Search class: HGUSM-FFMS32-DHSFFSBN
% 0.24/0.29  % partial match(3): HGUSM-FFMF32-SHSFMSBN
% 0.24/0.29  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.29  % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.29  % Preprocessing time       : 0.003 s
% 0.24/0.29  
% 0.24/0.29  % Proof found!
% 0.24/0.29  % SZS status Theorem
% 0.24/0.29  % SZS output start CNFRefutation
% See solution above
% 0.24/0.29  % Parsed axioms                        : 435
% 0.24/0.29  % Removed by relevancy pruning/SinE    : 367
% 0.24/0.29  % Initial clauses                      : 105
% 0.24/0.29  % Removed in clause preprocessing      : 11
% 0.24/0.29  % Initial clauses in saturation        : 94
% 0.24/0.29  % Processed clauses                    : 23
% 0.24/0.29  % ...of these trivial                  : 1
% 0.24/0.29  % ...subsumed                          : 2
% 0.24/0.29  % ...remaining for further processing  : 20
% 0.24/0.29  % Other redundant clauses eliminated   : 5
% 0.24/0.29  % Clauses deleted for lack of memory   : 0
% 0.24/0.29  % Backward-subsumed                    : 0
% 0.24/0.29  % Backward-rewritten                   : 1
% 0.24/0.29  % Generated clauses                    : 11
% 0.24/0.29  % ...of the previous two non-redundant : 0
% 0.24/0.29  % ...aggressively subsumed             : 0
% 0.24/0.29  % Contextual simplify-reflections      : 0
% 0.24/0.29  % Paramodulations                      : 6
% 0.24/0.29  % Factorizations                       : 0
% 0.24/0.29  % NegExts                              : 0
% 0.24/0.29  % Equation resolutions                 : 5
% 0.24/0.29  % Disequality decompositions           : 0
% 0.24/0.29  % Total rewrite steps                  : 8
% 0.24/0.29  % ...of those cached                   : 5
% 0.24/0.29  % Propositional unsat checks           : 0
% 0.24/0.29  %    Propositional check models        : 0
% 0.24/0.29  %    Propositional check unsatisfiable : 0
% 0.24/0.29  %    Propositional clauses             : 0
% 0.24/0.29  %    Propositional clauses after purity: 0
% 0.24/0.29  %    Propositional unsat core size     : 0
% 0.24/0.29  %    Propositional preprocessing time  : 0.000
% 0.24/0.29  %    Propositional encoding time       : 0.000
% 0.24/0.29  %    Propositional solver time         : 0.000
% 0.24/0.29  %    Success case prop preproc time    : 0.000
% 0.24/0.29  %    Success case prop encoding time   : 0.000
% 0.24/0.29  %    Success case prop solver time     : 0.000
% 0.24/0.29  % Current number of processed clauses  : 14
% 0.24/0.29  %    Positive orientable unit clauses  : 8
% 0.24/0.29  %    Positive unorientable unit clauses: 0
% 0.24/0.29  %    Negative unit clauses             : 1
% 0.24/0.29  %    Non-unit-clauses                  : 5
% 0.24/0.29  % Current number of unprocessed clauses: 71
% 0.24/0.29  % ...number of literals in the above   : 206
% 0.24/0.29  % Current number of archived formulas  : 0
% 0.24/0.29  % Current number of archived clauses   : 1
% 0.24/0.29  % Clause-clause subsumption calls (NU) : 2
% 0.24/0.29  % Rec. Clause-clause subsumption calls : 2
% 0.24/0.29  % Non-unit clause-clause subsumptions  : 2
% 0.24/0.29  % Unit Clause-clause subsumption calls : 3
% 0.24/0.29  % Rewrite failures with RHS unbound    : 0
% 0.24/0.29  % BW rewrite match attempts            : 1
% 0.24/0.29  % BW rewrite match successes           : 1
% 0.24/0.30  % Condensation attempts                : 0
% 0.24/0.30  % Condensation successes               : 0
% 0.24/0.30  % Termbank termtop insertions          : 15439
% 0.24/0.30  % Search garbage collected termcells   : 6501
% 0.24/0.30  
% 0.24/0.30  % -------------------------------------------------
% 0.24/0.30  % User time                : 0.015 s
% 0.24/0.30  % System time              : 0.005 s
% 0.24/0.30  % Total time               : 0.020 s
% 0.24/0.30  % Maximum resident set size: 5244 pages
% 0.24/0.30  
% 0.24/0.30  % -------------------------------------------------
% 0.24/0.30  % User time                : 0.024 s
% 0.24/0.30  % System time              : 0.009 s
% 0.24/0.30  % Total time               : 0.033 s
% 0.24/0.30  % Maximum resident set size: 5888 pages
% 0.24/0.30  % E exiting
%------------------------------------------------------------------------------