↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n017.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:42 PM UTC 2026

% Result   : Theorem 5.54s 3.04s
% Output   : CNFRefutation 5.54s
% 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 (   2 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    :    3 (   2 avg)
%            Number of types       :    6 (   5 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :    3 (   0 sgn   3   !;   0   ?;   3   :)

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

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

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

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

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

tff(decl_817,type,
    zero_zero_nat: nat ).

tff(decl_1005,type,
    suc: fun_nat_nat ).

tff(decl_1113,type,
    ord_less_nat: fun_nat_fun_nat_bool ).

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

tff(decl_1488,type,
    aa_nat_nat: ( nat * fun_nat_nat ) > nat ).

tff(decl_1506,type,
    aa_nat_fun_nat_bool: ( nat * fun_nat_fun_nat_bool ) > fun_nat_bool ).

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

tff(decl_1683,type,
    m: nat ).

tff(decl_1684,type,
    na: nat ).

tff(conj_0,conjecture,
    pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,zero_zero_nat),m)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

tff(fact_16_zero__less__Suc,axiom,
    ! [X2: nat] : pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,zero_zero_nat),aa_nat_nat(suc,X2))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_16_zero__less__Suc) ).

tff(fact_4__C3_Ohyps_C_I3_J,axiom,
    m = aa_nat_nat(suc,na),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4__C3_Ohyps_C_I3_J) ).

tff(c_0_3,negated_conjecture,
    ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,zero_zero_nat),m)),
    inference(assume_negation,[status(cth)],[conj_0]) ).

tff(c_0_4,negated_conjecture,
    ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,zero_zero_nat),m)),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

tff(c_0_5,plain,
    ! [X14703: nat] : pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,zero_zero_nat),aa_nat_nat(suc,X14703))),
    inference(variable_rename,[status(thm)],[fact_16_zero__less__Suc]) ).

tff(c_0_6,negated_conjecture,
    ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,zero_zero_nat),m)),
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

tcf(c_0_7,plain,
    ! [X1: nat] : pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,zero_zero_nat),aa_nat_nat(suc,X1))),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

tcf(c_0_8,plain,
    m = aa_nat_nat(suc,na),
    inference(split_conjunct,[status(thm)],[fact_4__C3_Ohyps_C_I3_J]) ).

tcf(c_0_9,negated_conjecture,
    ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,zero_zero_nat),m)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP225_1 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.39  % Computer : n017.cluster.edu
% 0.11/0.39  % Model    : x86_64 x86_64
% 0.11/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39  % Memory   : 8046.5625MB
% 0.11/0.39  % OS       : Linux 6.8.0-71-generic
% 0.11/0.39  % CPULimit : 300
% 0.11/0.39  % WCLimit  : 300
% 0.11/0.39  % DateTime : Sun Sep 20 22:07:12 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.44  Running first-order theorem proving
% 0.11/0.44  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 5.54/3.04  % Version: 3.5.1
% 5.54/3.04  % Preprocessing class: FMLLSMLLSSSNFFN.
% 5.54/3.04  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 5.54/3.04  % Starting new_bool_3 with 897s (3) cores
% 5.54/3.04  % Starting new_bool_1 with 897s (3) cores
% 5.54/3.04  % Starting sh5l with 299s (1) cores
% 5.54/3.04  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 5.54/3.04  % new_bool_1 with pid 738080 completed with status 0
% 5.54/3.04  % Result found by new_bool_1
% 5.54/3.04  % Preprocessing class: FMLLSMLLSSSNFFN.
% 5.54/3.04  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 5.54/3.04  % Starting new_bool_3 with 897s (3) cores
% 5.54/3.04  % Starting new_bool_1 with 897s (3) cores
% 5.54/3.04  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.54/3.04  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.54/3.04  % Search class: FGHSM-SMLM32-DFFFFFNN
% 5.54/3.04  % Scheduled 13 strats onto 3 cores with 896 seconds (896 total)
% 5.54/3.04  % Starting SubtermCWHack with 81s (1) cores
% 5.54/3.04  % Starting new_bool_1 with 90s (1) cores
% 5.54/3.04  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 68s (1) cores
% 5.54/3.04  % SubtermCWHack with pid 738085 completed with status 0
% 5.54/3.04  % Result found by SubtermCWHack
% 5.54/3.04  % Preprocessing class: FMLLSMLLSSSNFFN.
% 5.54/3.04  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 5.54/3.04  % Starting new_bool_3 with 897s (3) cores
% 5.54/3.04  % Starting new_bool_1 with 897s (3) cores
% 5.54/3.04  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.54/3.04  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.54/3.04  % Search class: FGHSM-SMLM32-DFFFFFNN
% 5.54/3.04  % Scheduled 13 strats onto 3 cores with 896 seconds (896 total)
% 5.54/3.04  % Starting SubtermCWHack with 81s (1) cores
% 5.54/3.04  % Preprocessing time       : 0.083 s
% 5.54/3.04  
% 5.54/3.04  % Proof found!
% 5.54/3.04  % SZS status Theorem
% 5.54/3.04  % SZS output start CNFRefutation
% See solution above
% 5.54/3.04  % Parsed axioms                        : 12621
% 5.54/3.04  % Removed by relevancy pruning/SinE    : 10372
% 5.54/3.04  % Initial clauses                      : 6961
% 5.54/3.04  % Removed in clause preprocessing      : 1863
% 5.54/3.04  % Initial clauses in saturation        : 5098
% 5.54/3.04  % Processed clauses                    : 288
% 5.54/3.04  % ...of these trivial                  : 56
% 5.54/3.04  % ...subsumed                          : 49
% 5.54/3.04  % ...remaining for further processing  : 183
% 5.54/3.04  % Other redundant clauses eliminated   : 27
% 5.54/3.04  % Clauses deleted for lack of memory   : 0
% 5.54/3.04  % Backward-subsumed                    : 7
% 5.54/3.04  % Backward-rewritten                   : 5
% 5.54/3.04  % Generated clauses                    : 87
% 5.54/3.04  % ...of the previous two non-redundant : 38
% 5.54/3.04  % ...aggressively subsumed             : 0
% 5.54/3.04  % Contextual simplify-reflections      : 0
% 5.54/3.04  % Paramodulations                      : 60
% 5.54/3.04  % Factorizations                       : 0
% 5.54/3.04  % NegExts                              : 0
% 5.54/3.04  % Equation resolutions                 : 27
% 5.54/3.04  % Disequality decompositions           : 0
% 5.54/3.04  % Total rewrite steps                  : 110
% 5.54/3.04  % ...of those cached                   : 52
% 5.54/3.04  % Propositional unsat checks           : 0
% 5.54/3.04  %    Propositional check models        : 0
% 5.54/3.04  %    Propositional check unsatisfiable : 0
% 5.54/3.04  %    Propositional clauses             : 0
% 5.54/3.04  %    Propositional clauses after purity: 0
% 5.54/3.04  %    Propositional unsat core size     : 0
% 5.54/3.04  %    Propositional preprocessing time  : 0.000
% 5.54/3.04  %    Propositional encoding time       : 0.000
% 5.54/3.04  %    Propositional solver time         : 0.000
% 5.54/3.04  %    Success case prop preproc time    : 0.000
% 5.54/3.04  %    Success case prop encoding time   : 0.000
% 5.54/3.04  %    Success case prop solver time     : 0.000
% 5.54/3.04  % Current number of processed clauses  : 146
% 5.54/3.04  %    Positive orientable unit clauses  : 87
% 5.54/3.04  %    Positive unorientable unit clauses: 0
% 5.54/3.04  %    Negative unit clauses             : 38
% 5.54/3.04  %    Non-unit-clauses                  : 21
% 5.54/3.04  % Current number of unprocessed clauses: 4846
% 5.54/3.04  % ...number of literals in the above   : 22166
% 5.54/3.04  % Current number of archived formulas  : 0
% 5.54/3.04  % Current number of archived clauses   : 12
% 5.54/3.04  % Clause-clause subsumption calls (NU) : 164
% 5.54/3.04  % Rec. Clause-clause subsumption calls : 140
% 5.54/3.04  % Non-unit clause-clause subsumptions  : 11
% 5.54/3.04  % Unit Clause-clause subsumption calls : 155
% 5.54/3.04  % Rewrite failures with RHS unbound    : 0
% 5.54/3.04  % BW rewrite match attempts            : 65
% 5.54/3.04  % BW rewrite match successes           : 5
% 5.54/3.04  % Condensation attempts                : 0
% 5.54/3.04  % Condensation successes               : 0
% 5.54/3.04  % Termbank termtop insertions          : 823510
% 5.54/3.04  % Search garbage collected termcells   : 163683
% 5.54/3.04  
% 5.54/3.04  % -------------------------------------------------
% 5.54/3.04  % User time                : 1.055 s
% 5.54/3.04  % System time              : 0.106 s
% 5.54/3.04  % Total time               : 1.161 s
% 5.54/3.04  % Maximum resident set size: 41512 pages
% 5.54/3.04  
% 5.54/3.04  % -------------------------------------------------
% 5.54/3.04  % User time                : 2.556 s
% 5.54/3.04  % System time              : 0.215 s
% 5.54/3.04  % Total time               : 2.771 s
% 5.54/3.04  % Maximum resident set size: 27648 pages
% 5.54/3.04  % E exiting
%------------------------------------------------------------------------------