↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP233^1 : TPTP v9.3.1. Bugfixed v9.2.1.
% 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:04:50 AM UTC 2026

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

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

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

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

thf(decl_507,type,
    list_u1324408373059187874T_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT > list_VEBT_VEBT ).

thf(decl_540,type,
    nth_VEBT_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT ).

thf(decl_1059,type,
    vEBT_V8194947554948674370ptions: vEBT_VEBT > nat > $o ).

thf(decl_1062,type,
    vEBT_VEBT_high: nat > nat > nat ).

thf(decl_1064,type,
    vEBT_VEBT_low: nat > nat > nat ).

thf(decl_1075,type,
    vEBT_vebt_insert: vEBT_VEBT > nat > vEBT_VEBT ).

thf(decl_1136,type,
    i: nat ).

thf(decl_1140,type,
    na: nat ).

thf(decl_1142,type,
    treeList: list_VEBT_VEBT ).

thf(decl_1143,type,
    xa: nat ).

thf(conj_0,conjecture,
    ? [X234: nat] : ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ i ) @ X234 ),
    file('/export/starexec/sandbox2/tmp/tmp.DuiBYRRbMt/E---3.1_867758.p',conj_0) ).

thf(fact_3__C164_C,axiom,
    ( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ i )
    = ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.DuiBYRRbMt/E---3.1_867758.p',fact_3__C164_C) ).

thf(fact_0_True,axiom,
    ( i
    = ( vEBT_VEBT_high @ xa @ na ) ),
    file('/export/starexec/sandbox2/tmp/tmp.DuiBYRRbMt/E---3.1_867758.p',fact_0_True) ).

thf(fact_1__C166_C,axiom,
    vEBT_V8194947554948674370ptions @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ),
    file('/export/starexec/sandbox2/tmp/tmp.DuiBYRRbMt/E---3.1_867758.p',fact_1__C166_C) ).

thf(c_0_4,negated_conjecture,
    ~ ? [X234: nat] : ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ i ) @ X234 ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_5,negated_conjecture,
    ! [X22586: nat] :
      ~ ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ i ) @ X22586 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).

thf(c_0_6,plain,
    ( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ i )
    = ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ),
    inference(split_conjunct,[status(thm)],[fact_3__C164_C]) ).

thf(c_0_7,plain,
    ( i
    = ( vEBT_VEBT_high @ xa @ na ) ),
    inference(split_conjunct,[status(thm)],[fact_0_True]) ).

thf(c_0_8,plain,
    vEBT_V8194947554948674370ptions @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ),
    inference(split_conjunct,[status(thm)],[fact_1__C166_C]) ).

thf(c_0_9,negated_conjecture,
    ! [X1: nat] :
      ~ ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ i ) @ X1 ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_10,plain,
    ( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ i @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ i ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ i )
    = ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ i ) @ ( vEBT_VEBT_low @ xa @ na ) ) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]),c_0_7]) ).

thf(c_0_11,plain,
    vEBT_V8194947554948674370ptions @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ i ) @ ( vEBT_VEBT_low @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ),
    inference(rw,[status(thm)],[c_0_8,c_0_7]) ).

thf(c_0_12,negated_conjecture,
    ! [X1: nat] :
      ~ ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ i ) @ ( vEBT_VEBT_low @ xa @ na ) ) @ X1 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_7]),c_0_7]),c_0_10]) ).

thf(c_0_13,plain,
    $false,
    inference(sr,[status(thm)],[c_0_11,c_0_12]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP233^1 : TPTP v9.3.1. Bugfixed v9.2.1.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.21  % Computer : n016.cluster.edu
% 0.09/0.21  % Model    : x86_64 x86_64
% 0.09/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21  % Memory   : 8046.5625MB
% 0.09/0.21  % OS       : Linux 6.8.0-71-generic
% 0.09/0.21  % CPULimit : 300
% 0.09/0.21  % WCLimit  : 300
% 0.09/0.21  % DateTime : Tue Sep 29 20:30:05 UTC 2026
% 0.09/0.21  % CPUTime  : 
% 0.09/0.21  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.26  Running higher-order theorem proving
% 3.84/4.01  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.DuiBYRRbMt/E---3.1_867758.p
% 28.39/13.05  % Version: 3.5.1-ho
% 28.39/13.05  % partial match(2): HMLMSMSMSSLCHFA
% 28.39/13.05  % Preprocessing class: HMLLSMLMSSLCHFA.
% 28.39/13.05  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 28.39/13.05  % Starting new_ho_10 with 1495s (5) cores
% 28.39/13.05  % Starting sh5l with 299s (1) cores
% 28.39/13.05  % Starting new_bool_1 with 299s (1) cores
% 28.39/13.05  % Starting new_bool_2 with 299s (1) cores
% 28.39/13.05  % new_bool_2 with pid 867775 completed with status 0
% 28.39/13.05  % Result found by new_bool_2
% 28.39/13.05  % partial match(2): HMLMSMSMSSLCHFA
% 28.39/13.05  % Preprocessing class: HMLLSMLMSSLCHFA.
% 28.39/13.05  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 28.39/13.05  % Starting new_ho_10 with 1495s (5) cores
% 28.39/13.05  % Starting sh5l with 299s (1) cores
% 28.39/13.05  % Starting new_bool_1 with 299s (1) cores
% 28.39/13.05  % Starting new_bool_2 with 299s (1) cores
% 28.39/13.05  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 28.39/13.05  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 28.39/13.05  % Search class: HGHSM-SMLM32-DHFFFSBN
% 28.39/13.05  % Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 28.39/13.05  % Starting SubtermCWHack with 30s (1) cores
% 28.39/13.06  % SubtermCWHack with pid 867776 completed with status 0
% 28.39/13.06  % Result found by SubtermCWHack
% 28.39/13.06  % partial match(2): HMLMSMSMSSLCHFA
% 28.39/13.06  % Preprocessing class: HMLLSMLMSSLCHFA.
% 28.39/13.06  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 28.39/13.06  % Starting new_ho_10 with 1495s (5) cores
% 28.39/13.06  % Starting sh5l with 299s (1) cores
% 28.39/13.06  % Starting new_bool_1 with 299s (1) cores
% 28.39/13.06  % Starting new_bool_2 with 299s (1) cores
% 28.39/13.06  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 28.39/13.06  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 28.39/13.06  % Search class: HGHSM-SMLM32-DHFFFSBN
% 28.39/13.06  % Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 28.39/13.06  % Starting SubtermCWHack with 30s (1) cores
% 28.39/13.06  % Preprocessing time       : 0.099 s
% 28.39/13.06  
% 28.39/13.06  % Proof found!
% 28.39/13.06  % SZS status Theorem
% 28.39/13.06  % SZS output start CNFRefutation
% See solution above
% 28.39/13.06  % Parsed axioms                        : 10382
% 28.39/13.06  % Removed by relevancy pruning/SinE    : 8298
% 28.39/13.06  % Initial clauses                      : 6346
% 28.39/13.06  % Removed in clause preprocessing      : 1815
% 28.39/13.06  % Initial clauses in saturation        : 4531
% 28.39/13.06  % Processed clauses                    : 32560
% 28.39/13.06  % ...of these trivial                  : 7144
% 28.39/13.06  % ...subsumed                          : 17172
% 28.39/13.06  % ...remaining for further processing  : 8244
% 28.39/13.06  % Other redundant clauses eliminated   : 1701
% 28.39/13.06  % Clauses deleted for lack of memory   : 0
% 28.39/13.06  % Backward-subsumed                    : 305
% 28.39/13.06  % Backward-rewritten                   : 473
% 28.39/13.06  % Generated clauses                    : 197990
% 28.39/13.06  % ...of the previous two non-redundant : 165769
% 28.39/13.06  % ...aggressively subsumed             : 0
% 28.39/13.06  % Contextual simplify-reflections      : 55
% 28.39/13.06  % Paramodulations                      : 196158
% 28.39/13.06  % Factorizations                       : 22
% 28.39/13.06  % NegExts                              : 0
% 28.39/13.06  % Equation resolutions                 : 1734
% 28.39/13.06  % Disequality decompositions           : 0
% 28.39/13.06  % Total rewrite steps                  : 67862
% 28.39/13.06  % ...of those cached                   : 58089
% 28.39/13.06  % Propositional unsat checks           : 0
% 28.39/13.06  %    Propositional check models        : 0
% 28.39/13.06  %    Propositional check unsatisfiable : 0
% 28.39/13.06  %    Propositional clauses             : 0
% 28.39/13.06  %    Propositional clauses after purity: 0
% 28.39/13.06  %    Propositional unsat core size     : 0
% 28.39/13.06  %    Propositional preprocessing time  : 0.000
% 28.39/13.06  %    Propositional encoding time       : 0.000
% 28.39/13.06  %    Propositional solver time         : 0.000
% 28.39/13.06  %    Success case prop preproc time    : 0.000
% 28.39/13.06  %    Success case prop encoding time   : 0.000
% 28.39/13.06  %    Success case prop solver time     : 0.000
% 28.39/13.06  % Current number of processed clauses  : 7128
% 28.39/13.06  %    Positive orientable unit clauses  : 2743
% 28.39/13.06  %    Positive unorientable unit clauses: 20
% 28.39/13.06  %    Negative unit clauses             : 2375
% 28.39/13.06  %    Non-unit-clauses                  : 1990
% 28.39/13.06  % Current number of unprocessed clauses: 136975
% 28.39/13.06  % ...number of literals in the above   : 364106
% 28.39/13.06  % Current number of archived formulas  : 0
% 28.39/13.06  % Current number of archived clauses   : 782
% 28.39/13.06  % Clause-clause subsumption calls (NU) : 1186195
% 28.39/13.06  % Rec. Clause-clause subsumption calls : 533847
% 28.39/13.06  % Non-unit clause-clause subsumptions  : 2661
% 28.39/13.06  % Unit Clause-clause subsumption calls : 1886317
% 28.39/13.06  % Rewrite failures with RHS unbound    : 0
% 28.39/13.06  % BW rewrite match attempts            : 5800
% 28.39/13.06  % BW rewrite match successes           : 547
% 28.39/13.06  % Condensation attempts                : 0
% 28.39/13.06  % Condensation successes               : 0
% 28.39/13.06  % Termbank termtop insertions          : 3067094
% 28.39/13.06  % Search garbage collected termcells   : 157622
% 28.39/13.06  
% 28.39/13.06  % -------------------------------------------------
% 28.39/13.06  % User time                : 7.485 s
% 28.39/13.06  % System time              : 0.215 s
% 28.39/13.06  % Total time               : 7.700 s
% 28.39/13.06  % Maximum resident set size: 38792 pages
% 28.39/13.06  
% 28.39/13.06  % -------------------------------------------------
% 28.39/13.06  % User time                : 8.721 s
% 28.39/13.06  % System time              : 0.257 s
% 28.39/13.06  % Total time               : 8.978 s
% 28.39/13.06  % Maximum resident set size: 28416 pages
% 28.39/13.06  % E exiting
%------------------------------------------------------------------------------