↑ Up

E---3.5.1.THM-CRf.s

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

% Result   : Theorem 0.67s 0.39s
% Output   : CNFRefutation 0.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   15 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   21 (   8 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :  135 (   9   ~;   4   |;   0   &; 120   @)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   9 usr;   4 con; 0-2 aty)
%            Number of variables   :   12 (   0   ^;  12   !;   0   ?;  12   :)

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

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

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

thf(decl_27,type,
    minus_minus_nat: nat > nat > nat ).

thf(decl_28,type,
    one_one_nat: nat ).

thf(decl_36,type,
    nth_co1649820636t_unit: list_c1059388851t_unit > nat > config256849571t_unit ).

thf(decl_38,type,
    suc: nat > nat ).

thf(decl_39,type,
    size_s1406904903t_unit: list_c1059388851t_unit > nat ).

thf(decl_41,type,
    ord_less_nat: nat > nat > $o ).

thf(decl_43,type,
    fe: nat > list_c1059388851t_unit ).

thf(decl_45,type,
    index: nat ).

thf(decl_49,type,
    n1: nat ).

thf(conj_0,conjecture,
    ( ( nth_co1649820636t_unit @ ( fe @ ( suc @ index ) ) @ ( minus_minus_nat @ n1 @ one_one_nat ) )
    = ( nth_co1649820636t_unit @ ( fe @ index ) @ ( minus_minus_nat @ n1 @ one_one_nat ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.d0cRTw6sHB/E---3.1_1499914.p',conj_0) ).

thf(fact_1_SameCfgOnLow,axiom,
    ! [X1: nat] :
      ( ( ord_less_nat @ X1 @ ( size_s1406904903t_unit @ ( fe @ index ) ) )
     => ( ( nth_co1649820636t_unit @ ( fe @ index ) @ X1 )
        = ( nth_co1649820636t_unit @ ( fe @ ( suc @ index ) ) @ X1 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.d0cRTw6sHB/E---3.1_1499914.p',fact_1_SameCfgOnLow) ).

thf(fact_154_less__imp__diff__less,axiom,
    ! [X25: nat,X4: nat,X2: nat] :
      ( ( ord_less_nat @ X25 @ X4 )
     => ( ord_less_nat @ ( minus_minus_nat @ X25 @ X2 ) @ X4 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.d0cRTw6sHB/E---3.1_1499914.p',fact_154_less__imp__diff__less) ).

thf(fact_0_Occ3_H,axiom,
    ord_less_nat @ n1 @ ( size_s1406904903t_unit @ ( fe @ index ) ),
    file('/export/starexec/sandbox2/tmp/tmp.d0cRTw6sHB/E---3.1_1499914.p',fact_0_Occ3_H) ).

thf(c_0_4,negated_conjecture,
    ( ( nth_co1649820636t_unit @ ( fe @ ( suc @ index ) ) @ ( minus_minus_nat @ n1 @ one_one_nat ) )
   != ( nth_co1649820636t_unit @ ( fe @ index ) @ ( minus_minus_nat @ n1 @ one_one_nat ) ) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_5,negated_conjecture,
    ( ( nth_co1649820636t_unit @ ( fe @ ( suc @ index ) ) @ ( minus_minus_nat @ n1 @ one_one_nat ) )
   != ( nth_co1649820636t_unit @ ( fe @ index ) @ ( minus_minus_nat @ n1 @ one_one_nat ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

thf(c_0_6,negated_conjecture,
    ( ( nth_co1649820636t_unit @ ( fe @ ( suc @ index ) ) @ ( minus_minus_nat @ n1 @ one_one_nat ) )
   != ( nth_co1649820636t_unit @ ( fe @ index ) @ ( minus_minus_nat @ n1 @ one_one_nat ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_5]) ).

thf(c_0_7,plain,
    ! [X647: nat] :
      ( ~ ( ord_less_nat @ X647 @ ( size_s1406904903t_unit @ ( fe @ index ) ) )
      | ( ( nth_co1649820636t_unit @ ( fe @ index ) @ X647 )
        = ( nth_co1649820636t_unit @ ( fe @ ( suc @ index ) ) @ X647 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1_SameCfgOnLow])])]) ).

thf(c_0_8,negated_conjecture,
    ( ( nth_co1649820636t_unit @ ( fe @ ( suc @ index ) ) @ ( minus_minus_nat @ n1 @ one_one_nat ) )
   != ( nth_co1649820636t_unit @ ( fe @ index ) @ ( minus_minus_nat @ n1 @ one_one_nat ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_9,plain,
    ! [X1: nat] :
      ( ( ( nth_co1649820636t_unit @ ( fe @ index ) @ X1 )
        = ( nth_co1649820636t_unit @ ( fe @ ( suc @ index ) ) @ X1 ) )
      | ~ ( ord_less_nat @ X1 @ ( size_s1406904903t_unit @ ( fe @ index ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_10,plain,
    ! [X1028: nat,X1029: nat,X1030: nat] :
      ( ~ ( ord_less_nat @ X1028 @ X1029 )
      | ( ord_less_nat @ ( minus_minus_nat @ X1028 @ X1030 ) @ X1029 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_154_less__imp__diff__less])])]) ).

thf(c_0_11,negated_conjecture,
    ~ ( ord_less_nat @ ( minus_minus_nat @ n1 @ one_one_nat ) @ ( size_s1406904903t_unit @ ( fe @ index ) ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

thf(c_0_12,plain,
    ! [X1: nat,X3: nat,X2: nat] :
      ( ( ord_less_nat @ ( minus_minus_nat @ X1 @ X3 ) @ X2 )
      | ~ ( ord_less_nat @ X1 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_13,plain,
    ord_less_nat @ n1 @ ( size_s1406904903t_unit @ ( fe @ index ) ),
    inference(split_conjunct,[status(thm)],[fact_0_Occ3_H]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP060^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.09/0.18  % Computer : n020.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 19:45:49 UTC 2026
% 0.09/0.18  % CPUTime  : 
% 0.09/0.18  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22  Running higher-order theorem proving
% 0.21/0.26  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.d0cRTw6sHB/E---3.1_1499914.p
% 0.67/0.39  % Version: 3.5.1-ho
% 0.67/0.39  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.67/0.39  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.39  % Starting new_ho_10 with 1500s (5) cores
% 0.67/0.39  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.67/0.39  % Starting full_lambda_6 with 300s (1) cores
% 0.67/0.39  % Starting full_lambda_9 with 300s (1) cores
% 0.67/0.39  % new_ho_10 with pid 1499927 completed with status 0
% 0.67/0.39  % Result found by new_ho_10
% 0.67/0.39  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.67/0.39  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.39  % Starting new_ho_10 with 1500s (5) cores
% 0.67/0.39  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.67/0.39  % No SInE strategy applied
% 0.67/0.39  % Search class: HGHSM-FSLM31-MHFFFSBC
% 0.67/0.39  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.67/0.39  % Starting SubtermCWHack with 136s (1) cores
% 0.67/0.39  % Starting new_ho_10 with 151s (1) cores
% 0.67/0.39  % Starting almost_fo_4 with 136s (1) cores
% 0.67/0.39  % Starting new_ho_10_unif with 136s (1) cores
% 0.67/0.39  % Starting ehoh_best3_fo with 136s (1) cores
% 0.67/0.39  % new_ho_10 with pid 1499935 completed with status 0
% 0.67/0.39  % Result found by new_ho_10
% 0.67/0.39  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.67/0.39  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.39  % Starting new_ho_10 with 1500s (5) cores
% 0.67/0.39  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.67/0.39  % No SInE strategy applied
% 0.67/0.39  % Search class: HGHSM-FSLM31-MHFFFSBC
% 0.67/0.39  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.67/0.39  % Starting SubtermCWHack with 136s (1) cores
% 0.67/0.39  % Starting new_ho_10 with 151s (1) cores
% 0.67/0.39  % Preprocessing time       : 0.007 s
% 0.67/0.39  % Presaturation interreduction done
% 0.67/0.39  
% 0.67/0.39  % Proof found!
% 0.67/0.39  % SZS status Theorem
% 0.67/0.39  % SZS output start CNFRefutation
% See solution above
% 0.67/0.39  % Parsed axioms                        : 279
% 0.67/0.39  % Removed by relevancy pruning/SinE    : 0
% 0.67/0.39  % Initial clauses                      : 440
% 0.67/0.39  % Removed in clause preprocessing      : 49
% 0.67/0.39  % Initial clauses in saturation        : 391
% 0.67/0.39  % Processed clauses                    : 627
% 0.67/0.39  % ...of these trivial                  : 12
% 0.67/0.39  % ...subsumed                          : 103
% 0.67/0.39  % ...remaining for further processing  : 512
% 0.67/0.39  % Other redundant clauses eliminated   : 79
% 0.67/0.39  % Clauses deleted for lack of memory   : 0
% 0.67/0.39  % Backward-subsumed                    : 0
% 0.67/0.39  % Backward-rewritten                   : 3
% 0.67/0.39  % Generated clauses                    : 1146
% 0.67/0.39  % ...of the previous two non-redundant : 961
% 0.67/0.39  % ...aggressively subsumed             : 0
% 0.67/0.39  % Contextual simplify-reflections      : 1
% 0.67/0.39  % Paramodulations                      : 1062
% 0.67/0.39  % Factorizations                       : 0
% 0.67/0.39  % NegExts                              : 0
% 0.67/0.39  % Equation resolutions                 : 80
% 0.67/0.39  % Disequality decompositions           : 0
% 0.67/0.39  % Total rewrite steps                  : 286
% 0.67/0.39  % ...of those cached                   : 217
% 0.67/0.39  % Propositional unsat checks           : 0
% 0.67/0.39  %    Propositional check models        : 0
% 0.67/0.39  %    Propositional check unsatisfiable : 0
% 0.67/0.39  %    Propositional clauses             : 0
% 0.67/0.39  %    Propositional clauses after purity: 0
% 0.67/0.39  %    Propositional unsat core size     : 0
% 0.67/0.39  %    Propositional preprocessing time  : 0.000
% 0.67/0.39  %    Propositional encoding time       : 0.000
% 0.67/0.39  %    Propositional solver time         : 0.000
% 0.67/0.39  %    Success case prop preproc time    : 0.000
% 0.67/0.39  %    Success case prop encoding time   : 0.000
% 0.67/0.39  %    Success case prop solver time     : 0.000
% 0.67/0.39  % Current number of processed clauses  : 168
% 0.67/0.39  %    Positive orientable unit clauses  : 71
% 0.67/0.39  %    Positive unorientable unit clauses: 1
% 0.67/0.39  %    Negative unit clauses             : 18
% 0.67/0.39  %    Non-unit-clauses                  : 78
% 0.67/0.39  % Current number of unprocessed clauses: 999
% 0.67/0.39  % ...number of literals in the above   : 2490
% 0.67/0.39  % Current number of archived formulas  : 0
% 0.67/0.39  % Current number of archived clauses   : 303
% 0.67/0.39  % Clause-clause subsumption calls (NU) : 17172
% 0.67/0.39  % Rec. Clause-clause subsumption calls : 7313
% 0.67/0.39  % Non-unit clause-clause subsumptions  : 43
% 0.67/0.39  % Unit Clause-clause subsumption calls : 211
% 0.67/0.39  % Rewrite failures with RHS unbound    : 0
% 0.67/0.39  % BW rewrite match attempts            : 1297
% 0.67/0.39  % BW rewrite match successes           : 15
% 0.67/0.39  % Condensation attempts                : 627
% 0.67/0.39  % Condensation successes               : 0
% 0.67/0.39  % Termbank termtop insertions          : 57381
% 0.67/0.39  % Search garbage collected termcells   : 8792
% 0.67/0.39  
% 0.67/0.39  % -------------------------------------------------
% 0.67/0.39  % User time                : 0.091 s
% 0.67/0.39  % System time              : 0.011 s
% 0.67/0.39  % Total time               : 0.102 s
% 0.67/0.39  % Maximum resident set size: 5280 pages
% 0.67/0.39  
% 0.67/0.39  % -------------------------------------------------
% 0.67/0.39  % User time                : 0.327 s
% 0.67/0.39  % System time              : 0.044 s
% 0.67/0.39  % Total time               : 0.371 s
% 0.67/0.39  % Maximum resident set size: 5376 pages
% 0.67/0.39  % E exiting
%------------------------------------------------------------------------------