↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP327_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 : n007.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:55:25 PM UTC 2026

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

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

tff(decl_sort2,type,
    'A$': $tType ).

tff(decl_sort3,type,
    'A_a_fun$': $tType ).

tff(decl_sort4,type,
    'A_n_vec$': $tType ).

tff(decl_sort5,type,
    'N$': $tType ).

tff(decl_sort6,type,
    'N_a_fun$': $tType ).

tff(decl_sort7,type,
    'N_bool_fun$': $tType ).

tff(decl_28,type,
    'fun_app$n': ( 'A$' * 'A_a_a_fun_fun$' ) > 'A_a_fun$' ).

tff(decl_105,type,
    'the$': 'N_bool_fun$' > 'N$' ).

tff(decl_107,type,
    'i$': 'N$' ).

tff(decl_123,type,
    'vec_nth$b': 'A_n_vec$' > 'N_a_fun$' ).

tff(decl_135,type,
    'times$e': 'A_a_a_fun_fun$' ).

tff(decl_185,type,
    'uu$': 'N_bool_fun$' ).

tff(decl_199,type,
    'fun_app$m': ( 'A$' * 'A_a_fun$' ) > 'A$' ).

tff(decl_213,type,
    'xa$': 'A_n_vec$' ).

tff(decl_257,type,
    'zero$': 'A$' ).

tff(decl_267,type,
    'fun_app$d': ( 'N$' * 'N_a_fun$' ) > 'A$' ).

tff(decl_279,type,
    'x$': 'A_n_vec$' ).

tff(conjecture118,conjecture,
    'fun_app$m'('fun_app$n'('times$e','fun_app$d'('vec_nth$b'('x$'),'the$'('uu$'))),'fun_app$d'('vec_nth$b'('xa$'),'i$')) = 'zero$',
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture118) ).

tff(axiom142,axiom,
    ! [X308: 'A$'] : ( 'fun_app$m'('fun_app$n'('times$e',X308),'zero$') = 'zero$' ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom142) ).

tff(axiom119,axiom,
    'fun_app$d'('vec_nth$b'('xa$'),'i$') = 'zero$',
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom119) ).

tff(c_0_3,negated_conjecture,
    'fun_app$m'('fun_app$n'('times$e','fun_app$d'('vec_nth$b'('x$'),'the$'('uu$'))),'fun_app$d'('vec_nth$b'('xa$'),'i$')) != 'zero$',
    inference(assume_negation,[status(cth)],[conjecture118]) ).

tff(c_0_4,negated_conjecture,
    'fun_app$m'('fun_app$n'('times$e','fun_app$d'('vec_nth$b'('x$'),'the$'('uu$'))),'fun_app$d'('vec_nth$b'('xa$'),'i$')) != 'zero$',
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

tff(c_0_5,negated_conjecture,
    'fun_app$m'('fun_app$n'('times$e','fun_app$d'('vec_nth$b'('x$'),'the$'('uu$'))),'fun_app$d'('vec_nth$b'('xa$'),'i$')) != 'zero$',
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

tff(c_0_6,plain,
    ! [X1615: 'A$'] : ( 'fun_app$m'('fun_app$n'('times$e',X1615),'zero$') = 'zero$' ),
    inference(variable_rename,[status(thm)],[axiom142]) ).

tcf(c_0_7,negated_conjecture,
    'fun_app$m'('fun_app$n'('times$e','fun_app$d'('vec_nth$b'('x$'),'the$'('uu$'))),'fun_app$d'('vec_nth$b'('xa$'),'i$')) != 'zero$',
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

tcf(c_0_8,plain,
    'fun_app$d'('vec_nth$b'('xa$'),'i$') = 'zero$',
    inference(split_conjunct,[status(thm)],[axiom119]) ).

tcf(c_0_9,plain,
    ! [X21: 'A$'] : 'fun_app$m'('fun_app$n'('times$e',X21),'zero$') = 'zero$',
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ITP327_1 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.37  % Computer : n007.cluster.edu
% 0.11/5.37  % Model    : x86_64 x86_64
% 0.11/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.37  % Memory   : 8046.5625MB
% 0.11/5.37  % OS       : Linux 6.8.0-71-generic
% 0.11/5.37  % CPULimit : 300
% 0.11/5.37  % WCLimit  : 300
% 0.11/5.37  % DateTime : Sun Sep 20 22:32:25 UTC 2026
% 0.11/5.37  % CPUTime  : 
% 0.11/5.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.42  Running first-order theorem proving
% 0.14/5.42  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
% 0.14/5.56  % Version: 3.5.1
% 0.14/5.56  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.14/5.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.56  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.56  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.56  % Starting new_bool_1 with 300s (1) cores
% 0.14/5.56  % Starting sh5l with 300s (1) cores
% 0.14/5.56  % new_bool_1 with pid 3724671 completed with status 0
% 0.14/5.56  % Result found by new_bool_1
% 0.14/5.56  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.14/5.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.56  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.56  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.56  % Starting new_bool_1 with 300s (1) cores
% 0.14/5.56  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.56  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.56  % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.14/5.56  % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.56  % Starting SubtermCWHack with 28s (1) cores
% 0.14/5.56  % SubtermCWHack with pid 3724673 completed with status 0
% 0.14/5.56  % Result found by SubtermCWHack
% 0.14/5.56  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.14/5.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.56  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.56  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.56  % Starting new_bool_1 with 300s (1) cores
% 0.14/5.56  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.56  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.56  % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.14/5.56  % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.56  % Starting SubtermCWHack with 28s (1) cores
% 0.14/5.56  % Preprocessing time       : 0.004 s
% 0.14/5.56  
% 0.14/5.56  % Proof found!
% 0.14/5.56  % SZS status Theorem
% 0.14/5.56  % SZS output start CNFRefutation
% See solution above
% 0.14/5.56  % Parsed axioms                        : 1128
% 0.14/5.56  % Removed by relevancy pruning/SinE    : 921
% 0.14/5.56  % Initial clauses                      : 396
% 0.14/5.56  % Removed in clause preprocessing      : 41
% 0.14/5.56  % Initial clauses in saturation        : 355
% 0.14/5.56  % Processed clauses                    : 1551
% 0.14/5.56  % ...of these trivial                  : 33
% 0.14/5.56  % ...subsumed                          : 1029
% 0.14/5.56  % ...remaining for further processing  : 488
% 0.14/5.56  % Other redundant clauses eliminated   : 133
% 0.14/5.56  % Clauses deleted for lack of memory   : 0
% 0.14/5.56  % Backward-subsumed                    : 12
% 0.14/5.56  % Backward-rewritten                   : 2
% 0.14/5.56  % Generated clauses                    : 6705
% 0.14/5.56  % ...of the previous two non-redundant : 4012
% 0.14/5.56  % ...aggressively subsumed             : 0
% 0.14/5.56  % Contextual simplify-reflections      : 0
% 0.14/5.56  % Paramodulations                      : 6561
% 0.14/5.56  % Factorizations                       : 2
% 0.14/5.56  % NegExts                              : 0
% 0.14/5.56  % Equation resolutions                 : 145
% 0.14/5.56  % Disequality decompositions           : 0
% 0.14/5.56  % Total rewrite steps                  : 2818
% 0.14/5.56  % ...of those cached                   : 2628
% 0.14/5.56  % Propositional unsat checks           : 0
% 0.14/5.56  %    Propositional check models        : 0
% 0.14/5.56  %    Propositional check unsatisfiable : 0
% 0.14/5.56  %    Propositional clauses             : 0
% 0.14/5.56  %    Propositional clauses after purity: 0
% 0.14/5.56  %    Propositional unsat core size     : 0
% 0.14/5.56  %    Propositional preprocessing time  : 0.000
% 0.14/5.56  %    Propositional encoding time       : 0.000
% 0.14/5.56  %    Propositional solver time         : 0.000
% 0.14/5.56  %    Success case prop preproc time    : 0.000
% 0.14/5.56  %    Success case prop encoding time   : 0.000
% 0.14/5.56  %    Success case prop solver time     : 0.000
% 0.14/5.56  % Current number of processed clauses  : 416
% 0.14/5.56  %    Positive orientable unit clauses  : 89
% 0.14/5.56  %    Positive unorientable unit clauses: 4
% 0.14/5.56  %    Negative unit clauses             : 19
% 0.14/5.56  %    Non-unit-clauses                  : 304
% 0.14/5.56  % Current number of unprocessed clauses: 2801
% 0.14/5.56  % ...number of literals in the above   : 8649
% 0.14/5.56  % Current number of archived formulas  : 0
% 0.14/5.56  % Current number of archived clauses   : 14
% 0.14/5.56  % Clause-clause subsumption calls (NU) : 13509
% 0.14/5.56  % Rec. Clause-clause subsumption calls : 10835
% 0.14/5.56  % Non-unit clause-clause subsumptions  : 786
% 0.14/5.56  % Unit Clause-clause subsumption calls : 295
% 0.14/5.56  % Rewrite failures with RHS unbound    : 0
% 0.14/5.56  % BW rewrite match attempts            : 49
% 0.14/5.56  % BW rewrite match successes           : 23
% 0.14/5.56  % Condensation attempts                : 0
% 0.14/5.56  % Condensation successes               : 0
% 0.14/5.56  % Termbank termtop insertions          : 111015
% 0.14/5.56  % Search garbage collected termcells   : 11595
% 0.14/5.56  
% 0.14/5.56  % -------------------------------------------------
% 0.14/5.56  % User time                : 0.069 s
% 0.14/5.56  % System time              : 0.011 s
% 0.14/5.56  % Total time               : 0.080 s
% 0.14/5.56  % Maximum resident set size: 6604 pages
% 0.14/5.56  
% 0.14/5.56  % -------------------------------------------------
% 0.14/5.56  % User time                : 0.107 s
% 0.14/5.56  % System time              : 0.019 s
% 0.14/5.56  % Total time               : 0.126 s
% 0.14/5.56  % Maximum resident set size: 6400 pages
% 0.14/5.56  % E exiting
%------------------------------------------------------------------------------