↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : ITP234^1 : TPTP v9.3.1. Bugfixed v9.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n010.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:05:59 AM UTC 2026

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

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

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

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

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

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

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

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

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

thf(decl_817,type,
    i: nat ).

thf(decl_820,type,
    mi: nat ).

thf(decl_821,type,
    na: nat ).

thf(decl_823,type,
    treeList: list_VEBT_VEBT ).

thf(conj_0,conjecture,
    ( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ) @ i )
    = ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.sHfp2QTjN3/E---3.1_3362832.p',conj_0) ).

thf(fact_0_True,axiom,
    ( i
    = ( vEBT_VEBT_high @ mi @ na ) ),
    file('/export/starexec/sandbox/tmp/tmp.sHfp2QTjN3/E---3.1_3362832.p',fact_0_True) ).

thf(fact_1_insprop,axiom,
    ( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ) @ ( vEBT_VEBT_high @ mi @ na ) )
    = ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.sHfp2QTjN3/E---3.1_3362832.p',fact_1_insprop) ).

thf(c_0_3,negated_conjecture,
    ( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ) @ i )
   != ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_4,negated_conjecture,
    ( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ) @ i )
   != ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ) @ i )
   != ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

thf(c_0_6,negated_conjecture,
    ( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ) @ i )
   != ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

thf(c_0_8,plain,
    ( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ) @ ( vEBT_VEBT_high @ mi @ na ) )
    = ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ ( vEBT_VEBT_low @ mi @ na ) ) ),
    inference(split_conjunct,[status(thm)],[fact_1_insprop]) ).

thf(c_0_9,negated_conjecture,
    ( ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ i @ ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ i ) @ ( vEBT_VEBT_low @ mi @ na ) ) ) @ i )
   != ( vEBT_vebt_insert @ ( nth_VEBT_VEBT @ treeList @ i ) @ ( vEBT_VEBT_low @ mi @ 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_10,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_9]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ITP234^1 : TPTP v9.3.1. Bugfixed v9.2.1.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18  % Computer : n010.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Tue Sep 29 20:25:48 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23  Running higher-order theorem proving
% 2.16/2.26  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.sHfp2QTjN3/E---3.1_3362832.p
% 26.31/9.73  % Version: 3.5.1-ho
% 26.31/9.73  % partial match(1): HMLMSMSMSSLCHFA
% 26.31/9.73  % Preprocessing class: HMLMSMLMSSLCHFA.
% 26.31/9.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.31/9.73  % Starting new_ho_10 with 1500s (5) cores
% 26.31/9.73  % Starting sh5l with 300s (1) cores
% 26.31/9.73  % Starting new_bool_1 with 300s (1) cores
% 26.31/9.73  % Starting new_bool_2 with 300s (1) cores
% 26.31/9.73  % new_ho_10 with pid 3362845 completed with status 0
% 26.31/9.73  % Result found by new_ho_10
% 26.31/9.73  % partial match(1): HMLMSMSMSSLCHFA
% 26.31/9.73  % Preprocessing class: HMLMSMLMSSLCHFA.
% 26.31/9.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.31/9.73  % Starting new_ho_10 with 1500s (5) cores
% 26.31/9.73  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 26.31/9.73  % No SInE strategy applied
% 26.31/9.73  % Search class: HGHSM-SMLM32-DHFFFSBC
% 26.31/9.73  % Scheduled 7 strats onto 5 cores with 1495 seconds (1495 total)
% 26.31/9.73  % Starting SubtermCWHack with 135s (1) cores
% 26.31/9.73  % Starting new_ho_10 with 150s (1) cores
% 26.31/9.73  % Starting ehoh_best_sine_rwall with 193s (1) cores
% 26.31/9.73  % Starting full_lambda_6 with 193s (1) cores
% 26.31/9.73  % Starting ehoh_best_sine with 193s (1) cores
% 26.31/9.73  % ehoh_best_sine with pid 3362855 completed with status 0
% 26.31/9.73  % Result found by ehoh_best_sine
% 26.31/9.73  % partial match(1): HMLMSMSMSSLCHFA
% 26.31/9.73  % Preprocessing class: HMLMSMLMSSLCHFA.
% 26.31/9.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.31/9.73  % Starting new_ho_10 with 1500s (5) cores
% 26.31/9.73  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 26.31/9.73  % No SInE strategy applied
% 26.31/9.73  % Search class: HGHSM-SMLM32-DHFFFSBC
% 26.31/9.73  % Scheduled 7 strats onto 5 cores with 1495 seconds (1495 total)
% 26.31/9.73  % Starting SubtermCWHack with 135s (1) cores
% 26.31/9.73  % Starting new_ho_10 with 150s (1) cores
% 26.31/9.73  % Starting ehoh_best_sine_rwall with 193s (1) cores
% 26.31/9.73  % Starting full_lambda_6 with 193s (1) cores
% 26.31/9.73  % Starting ehoh_best_sine with 193s (1) cores
% 26.31/9.73  % Preprocessing time       : 0.871 s
% 26.31/9.73  % Presaturation interreduction done
% 26.31/9.73  
% 26.31/9.73  % Proof found!
% 26.31/9.73  % SZS status Theorem
% 26.31/9.73  % SZS output start CNFRefutation
% See solution above
% 26.31/9.73  % Parsed axioms                        : 9032
% 26.31/9.73  % Removed by relevancy pruning/SinE    : 0
% 26.31/9.73  % Initial clauses                      : 58206
% 26.31/9.73  % Removed in clause preprocessing      : 29215
% 26.31/9.73  % Initial clauses in saturation        : 28991
% 26.31/9.73  % Processed clauses                    : 124
% 26.31/9.73  % ...of these trivial                  : 0
% 26.31/9.73  % ...subsumed                          : 22
% 26.31/9.73  % ...remaining for further processing  : 101
% 26.31/9.73  % Other redundant clauses eliminated   : 0
% 26.31/9.73  % Clauses deleted for lack of memory   : 0
% 26.31/9.73  % Backward-subsumed                    : 0
% 26.31/9.73  % Backward-rewritten                   : 0
% 26.31/9.73  % Generated clauses                    : 0
% 26.31/9.73  % ...of the previous two non-redundant : 0
% 26.31/9.73  % ...aggressively subsumed             : 0
% 26.31/9.73  % Contextual simplify-reflections      : 0
% 26.31/9.73  % Paramodulations                      : 0
% 26.31/9.73  % Factorizations                       : 0
% 26.31/9.73  % NegExts                              : 0
% 26.31/9.73  % Equation resolutions                 : 0
% 26.31/9.73  % Disequality decompositions           : 0
% 26.31/9.73  % Total rewrite steps                  : 12
% 26.31/9.73  % ...of those cached                   : 10
% 26.31/9.73  % Propositional unsat checks           : 0
% 26.31/9.73  %    Propositional check models        : 0
% 26.31/9.73  %    Propositional check unsatisfiable : 0
% 26.31/9.73  %    Propositional clauses             : 0
% 26.31/9.73  %    Propositional clauses after purity: 0
% 26.31/9.73  %    Propositional unsat core size     : 0
% 26.31/9.73  %    Propositional preprocessing time  : 0.000
% 26.31/9.73  %    Propositional encoding time       : 0.000
% 26.31/9.73  %    Propositional solver time         : 0.000
% 26.31/9.73  %    Success case prop preproc time    : 0.000
% 26.31/9.73  %    Success case prop encoding time   : 0.000
% 26.31/9.73  %    Success case prop solver time     : 0.000
% 26.31/9.73  % Current number of processed clauses  : 101
% 26.31/9.73  %    Positive orientable unit clauses  : 38
% 26.31/9.73  %    Positive unorientable unit clauses: 0
% 26.31/9.73  %    Negative unit clauses             : 63
% 26.31/9.73  %    Non-unit-clauses                  : 0
% 26.31/9.73  % Current number of unprocessed clauses: 28867
% 26.31/9.73  % ...number of literals in the above   : 169074
% 26.31/9.73  % Current number of archived formulas  : 0
% 26.31/9.73  % Current number of archived clauses   : 0
% 26.31/9.73  % Clause-clause subsumption calls (NU) : 0
% 26.31/9.73  % Rec. Clause-clause subsumption calls : 0
% 26.31/9.73  % Non-unit clause-clause subsumptions  : 0
% 26.31/9.73  % Unit Clause-clause subsumption calls : 509
% 26.31/9.73  % Rewrite failures with RHS unbound    : 0
% 26.31/9.73  % BW rewrite match attempts            : 0
% 26.31/9.73  % BW rewrite match successes           : 0
% 26.31/9.73  % Condensation attempts                : 0
% 26.31/9.73  % Condensation successes               : 0
% 26.31/9.73  % Termbank termtop insertions          : 7346916
% 26.31/9.73  % Search garbage collected termcells   : 605160
% 26.31/9.73  
% 26.31/9.73  % -------------------------------------------------
% 26.31/9.73  % User time                : 6.098 s
% 26.31/9.73  % System time              : 0.229 s
% 26.31/9.73  % Total time               : 6.328 s
% 26.31/9.73  % Maximum resident set size: 148092 pages
% 26.31/9.73  
% 26.31/9.73  % -------------------------------------------------
% 26.31/9.73  % User time                : 10.167 s
% 26.31/9.73  % System time              : 1.017 s
% 26.31/9.73  % Total time               : 11.184 s
% 26.31/9.73  % Maximum resident set size: 24576 pages
% 26.31/9.73  % E exiting
%------------------------------------------------------------------------------