↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP236_1 : TPTP v9.3.1. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n012.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 : Thu Sep 24 12:54:49 PM UTC 2026

% Result   : Theorem 2.65s 1.91s
% Output   : CNFRefutation 2.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   16 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   10 (   7   ~;   2   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    7 (   6 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   2 prp; 0-1 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :    5 (   0 sgn   4   !;   1   ?;   5   :)

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

tff(decl_sort2,type,
    fun_nat_bool: $tType ).

tff(decl_sort3,type,
    list_VEBT_VEBT: $tType ).

tff(decl_sort4,type,
    bool: $tType ).

tff(decl_sort5,type,
    fun_VE3763956218935105199t_bool: $tType ).

tff(decl_sort6,type,
    vEBT_VEBT: $tType ).

tff(decl_1193,type,
    nth_VEBT_VEBT: ( nat * list_VEBT_VEBT ) > vEBT_VEBT ).

tff(decl_1729,type,
    vEBT_V8194947554948674370ptions: fun_VE3763956218935105199t_bool ).

tff(decl_1861,type,
    aa_nat_bool: ( nat * fun_nat_bool ) > bool ).

tff(decl_2024,type,
    aa_VEB4832260192069861672t_bool: ( vEBT_VEBT * fun_VE3763956218935105199t_bool ) > fun_nat_bool ).

tff(decl_2303,type,
    pp: bool > $o ).

tff(decl_2307,type,
    maxs: nat ).

tff(decl_2311,type,
    thesis: $o ).

tff(decl_2312,type,
    treeList: list_VEBT_VEBT ).

tff(decl_2355,type,
    esk38_0: nat ).

fof(conj_1,conjecture,
    thesis,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).

tff(conj_0,hypothesis,
    ! [X19779: nat] :
      ( pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,maxs)),X19779))
     => thesis ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(fact_0__092_060open_062_092_060exists_062x_O_Aboth__member__options_A_ItreeList_A_B_Amaxs_J_Ax_092_060close_062,axiom,
    ? [X1: nat] : pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,maxs)),X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0__092_060open_062_092_060exists_062x_O_Aboth__member__options_A_ItreeList_A_B_Amaxs_J_Ax_092_060close_062) ).

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

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

tff(c_0_5,hypothesis,
    ! [X19780: nat] :
      ( thesis
      | ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,maxs)),X19780)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_0])])]) ).

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

tff(c_0_7,plain,
    pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,maxs)),esk38_0)),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[fact_0__092_060open_062_092_060exists_062x_O_Aboth__member__options_A_ItreeList_A_B_Amaxs_J_Ax_092_060close_062])]) ).

tcf(c_0_8,hypothesis,
    ! [X1: nat] :
      ( ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,maxs)),X1))
      | thesis ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    ~ thesis,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

tcf(c_0_10,plain,
    pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,maxs)),esk38_0)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

tcf(c_0_11,hypothesis,
    ! [X1: nat] : ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,maxs)),X1)),
    inference(sr,[status(thm)],[c_0_8,c_0_9]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : ITP236_1 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.03  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.05/0.32  % Computer : n012.cluster.edu
% 0.05/0.32  % Model    : x86_64 x86_64
% 0.05/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.32  % Memory   : 8046.5625MB
% 0.05/0.32  % OS       : Linux 6.8.0-71-generic
% 0.05/0.32  % CPULimit : 300
% 0.05/0.32  % WCLimit  : 300
% 0.05/0.32  % DateTime : Sun Sep 20 22:14:24 UTC 2026
% 0.05/0.32  % CPUTime  : 
% 0.05/0.32  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.34  Running first-order theorem proving
% 0.07/0.34  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.65/1.91  % Version: 3.5.1
% 2.65/1.91  % Preprocessing class: FMLLSMLLSSSNFFN.
% 2.65/1.91  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.65/1.91  % Starting new_bool_3 with 900s (3) cores
% 2.65/1.91  % Starting new_bool_1 with 900s (3) cores
% 2.65/1.91  % Starting sh5l with 300s (1) cores
% 2.65/1.91  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 2.65/1.91  % new_bool_1 with pid 963527 completed with status 0
% 2.65/1.91  % Result found by new_bool_1
% 2.65/1.91  % Preprocessing class: FMLLSMLLSSSNFFN.
% 2.65/1.91  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.65/1.91  % Starting new_bool_3 with 900s (3) cores
% 2.65/1.91  % Starting new_bool_1 with 900s (3) cores
% 2.65/1.91  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.65/1.91  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.65/1.91  % Search class: FGHSM-SMLM32-DFFFFFNN
% 2.65/1.91  % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 2.65/1.91  % Starting SubtermCWHack with 82s (1) cores
% 2.65/1.91  % Starting new_bool_1 with 91s (1) cores
% 2.65/1.91  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 68s (1) cores
% 2.65/1.91  % SubtermCWHack with pid 963533 completed with status 0
% 2.65/1.91  % Result found by SubtermCWHack
% 2.65/1.91  % Preprocessing class: FMLLSMLLSSSNFFN.
% 2.65/1.91  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.65/1.91  % Starting new_bool_3 with 900s (3) cores
% 2.65/1.91  % Starting new_bool_1 with 900s (3) cores
% 2.65/1.91  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.65/1.91  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.65/1.91  % Search class: FGHSM-SMLM32-DFFFFFNN
% 2.65/1.91  % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 2.65/1.91  % Starting SubtermCWHack with 82s (1) cores
% 2.65/1.91  % Preprocessing time       : 0.082 s
% 2.65/1.91  
% 2.65/1.91  % Proof found!
% 2.65/1.91  % SZS status Theorem
% 2.65/1.91  % SZS output start CNFRefutation
% See solution above
% 2.65/1.91  % Parsed axioms                        : 13486
% 2.65/1.91  % Removed by relevancy pruning/SinE    : 11346
% 2.65/1.91  % Initial clauses                      : 6943
% 2.65/1.91  % Removed in clause preprocessing      : 1808
% 2.65/1.91  % Initial clauses in saturation        : 5135
% 2.65/1.91  % Processed clauses                    : 631
% 2.65/1.91  % ...of these trivial                  : 50
% 2.65/1.91  % ...subsumed                          : 175
% 2.65/1.91  % ...remaining for further processing  : 406
% 2.65/1.91  % Other redundant clauses eliminated   : 156
% 2.65/1.91  % Clauses deleted for lack of memory   : 0
% 2.65/1.91  % Backward-subsumed                    : 8
% 2.65/1.91  % Backward-rewritten                   : 12
% 2.65/1.91  % Generated clauses                    : 401
% 2.65/1.91  % ...of the previous two non-redundant : 244
% 2.65/1.91  % ...aggressively subsumed             : 0
% 2.65/1.91  % Contextual simplify-reflections      : 0
% 2.65/1.91  % Paramodulations                      : 242
% 2.65/1.91  % Factorizations                       : 0
% 2.65/1.91  % NegExts                              : 0
% 2.65/1.91  % Equation resolutions                 : 159
% 2.65/1.91  % Disequality decompositions           : 0
% 2.65/1.91  % Total rewrite steps                  : 197
% 2.65/1.91  % ...of those cached                   : 114
% 2.65/1.91  % Propositional unsat checks           : 0
% 2.65/1.91  %    Propositional check models        : 0
% 2.65/1.91  %    Propositional check unsatisfiable : 0
% 2.65/1.91  %    Propositional clauses             : 0
% 2.65/1.91  %    Propositional clauses after purity: 0
% 2.65/1.91  %    Propositional unsat core size     : 0
% 2.65/1.91  %    Propositional preprocessing time  : 0.000
% 2.65/1.91  %    Propositional encoding time       : 0.000
% 2.65/1.91  %    Propositional solver time         : 0.000
% 2.65/1.91  %    Success case prop preproc time    : 0.000
% 2.65/1.91  %    Success case prop encoding time   : 0.000
% 2.65/1.91  %    Success case prop solver time     : 0.000
% 2.65/1.91  % Current number of processed clauses  : 246
% 2.65/1.91  %    Positive orientable unit clauses  : 129
% 2.65/1.91  %    Positive unorientable unit clauses: 0
% 2.65/1.91  %    Negative unit clauses             : 55
% 2.65/1.91  %    Non-unit-clauses                  : 62
% 2.65/1.91  % Current number of unprocessed clauses: 4748
% 2.65/1.91  % ...number of literals in the above   : 22604
% 2.65/1.91  % Current number of archived formulas  : 0
% 2.65/1.91  % Current number of archived clauses   : 21
% 2.65/1.91  % Clause-clause subsumption calls (NU) : 2967
% 2.65/1.91  % Rec. Clause-clause subsumption calls : 2843
% 2.65/1.91  % Non-unit clause-clause subsumptions  : 55
% 2.65/1.91  % Unit Clause-clause subsumption calls : 256
% 2.65/1.91  % Rewrite failures with RHS unbound    : 0
% 2.65/1.91  % BW rewrite match attempts            : 181
% 2.65/1.91  % BW rewrite match successes           : 12
% 2.65/1.91  % Condensation attempts                : 0
% 2.65/1.91  % Condensation successes               : 0
% 2.65/1.91  % Termbank termtop insertions          : 850154
% 2.65/1.91  % Search garbage collected termcells   : 191108
% 2.65/1.91  
% 2.65/1.91  % -------------------------------------------------
% 2.65/1.91  % User time                : 0.626 s
% 2.65/1.91  % System time              : 0.067 s
% 2.65/1.91  % Total time               : 0.694 s
% 2.65/1.91  % Maximum resident set size: 45720 pages
% 2.65/1.91  
% 2.65/1.91  % -------------------------------------------------
% 2.65/1.91  % User time                : 1.562 s
% 2.65/1.91  % System time              : 0.149 s
% 2.65/1.91  % Total time               : 1.710 s
% 2.65/1.91  % Maximum resident set size: 33280 pages
% 2.65/1.91  % E exiting
%------------------------------------------------------------------------------