↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEV290^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n015.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:35:20 AM UTC 2026

% Result   : Theorem 0.12s 0.26s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   31 (  11 equ;   0 cnn)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   96 (  10   ~;   1   |;  19   &;  55   @)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   65 (  65   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   43 (  20   ^;  14   !;   9   ?;  43   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_23,type,
    c0: ( $i > $o ) > $o ).

thf(decl_24,type,
    cSUCC: ( ( $i > $o ) > $o ) > ( $i > $o ) > $o ).

thf(decl_25,type,
    c_less__eq_: ( ( $i > $o ) > $o ) > ( ( $i > $o ) > $o ) > $o ).

thf(decl_26,type,
    epred1_1: ( ( ( $i > $o ) > $o ) > $o ) > ( $i > $o ) > $o ).

thf(decl_27,type,
    epred2_1: ( ( ( $i > $o ) > $o ) > $o ) > ( ( $i > $o ) > $o ) > $o ).

thf(c_less__eq__def,axiom,
    ( c_less__eq_
    = ( ^ [X5: ( $i > $o ) > $o,X6: ( $i > $o ) > $o] :
        ! [X7: ( ( $i > $o ) > $o ) > $o] :
          ( ( ( X7 @ X5 )
            & ! [X8: ( $i > $o ) > $o] :
                ( ( X7 @ X8 )
               => ( X7 @ ( cSUCC @ X8 ) ) ) )
         => ( X7 @ X6 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.caGBTEN1nk/E---3.1_3665817.p',c_less__eq__def) ).

thf(cSUCC_def,axiom,
    ( cSUCC
    = ( ^ [X1: ( $i > $o ) > $o,X2: $i > $o] :
        ? [X3: $i] :
          ( ( X2 @ X3 )
          & ( X1
            @ ^ [X4: $i] :
                ( ( X4 != X3 )
                & ( X2 @ X4 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.caGBTEN1nk/E---3.1_3665817.p',cSUCC_def) ).

thf(cBLEDSOE1,conjecture,
    ? [X9: ( ( $i > $o ) > $o ) > $o] :
    ! [X10: ( $i > $o ) > $o] :
      ( ( X9 @ X10 )
     => ( c_less__eq_ @ X10 @ c0 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.caGBTEN1nk/E---3.1_3665817.p',cBLEDSOE1) ).

thf(c_0_3,plain,
    ( c_less__eq_
    = ( ^ [Z0: ( $i > $o ) > $o,Z1: ( $i > $o ) > $o] :
        ! [X7: ( ( $i > $o ) > $o ) > $o] :
          ( ( ( X7 @ Z0 )
            & ! [X8: ( $i > $o ) > $o] :
                ( ( X7 @ X8 )
               => ( X7
                  @ ^ [Z2: $i > $o] :
                    ? [X13: $i] :
                      ( ( Z2 @ X13 )
                      & ( X8
                        @ ^ [Z3: $i] :
                            ( ( Z3 != X13 )
                            & ( Z2 @ Z3 ) ) ) ) ) ) )
         => ( X7 @ Z1 ) ) ) ),
    inference(fof_simplification,[status(thm)],[c_less__eq__def]) ).

thf(c_0_4,plain,
    ( cSUCC
    = ( ^ [Z0: ( $i > $o ) > $o,Z1: $i > $o] :
        ? [X3: $i] :
          ( ( Z1 @ X3 )
          & ( Z0
            @ ^ [Z2: $i] :
                ( ( Z2 != X3 )
                & ( Z1 @ Z2 ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[cSUCC_def]) ).

thf(c_0_5,negated_conjecture,
    ~ ? [X9: ( ( $i > $o ) > $o ) > $o] :
      ! [X10: ( $i > $o ) > $o] :
        ( ( X9 @ X10 )
       => ( c_less__eq_ @ X10 @ c0 ) ),
    inference(assume_negation,[status(cth)],[cBLEDSOE1]) ).

thf(c_0_6,plain,
    ( c_less__eq_
    = ( ^ [Z0: ( $i > $o ) > $o,Z1: ( $i > $o ) > $o] :
        ! [X7: ( ( $i > $o ) > $o ) > $o] :
          ( ( ( X7 @ Z0 )
            & ! [X8: ( $i > $o ) > $o] :
                ( ( X7 @ X8 )
               => ( X7
                  @ ^ [Z2: $i > $o] :
                    ? [X13: $i] :
                      ( ( Z2 @ X13 )
                      & ( X8
                        @ ^ [Z3: $i] :
                            ( ( Z3 != X13 )
                            & ( Z2 @ Z3 ) ) ) ) ) ) )
         => ( X7 @ Z1 ) ) ) ),
    inference(apply_def,[status(thm)],[c_0_3,c_0_4]) ).

thf(c_0_7,negated_conjecture,
    ~ ? [X9: ( ( $i > $o ) > $o ) > $o] :
      ! [X10: ( $i > $o ) > $o] :
        ( ( X9 @ X10 )
       => ! [X14: ( ( $i > $o ) > $o ) > $o] :
            ( ( ( X14 @ X10 )
              & ! [X15: ( $i > $o ) > $o] :
                  ( ( X14 @ X15 )
                 => ( X14
                    @ ^ [Z0: $i > $o] :
                      ? [X16: $i] :
                        ( ( Z0 @ X16 )
                        & ( X15
                          @ ^ [Z1: $i] :
                              ( ( Z1 != X16 )
                              & ( Z0 @ Z1 ) ) ) ) ) ) )
           => ( X14 @ c0 ) ) ),
    inference(apply_def,[status(thm)],[c_0_5,c_0_6]) ).

thf(c_0_8,negated_conjecture,
    ! [X17: ( ( $i > $o ) > $o ) > $o,X20: ( $i > $o ) > $o] :
      ( ( X17 @ ( epred1_1 @ X17 ) )
      & ( epred2_1 @ X17 @ ( epred1_1 @ X17 ) )
      & ( ~ ( epred2_1 @ X17 @ X20 )
        | ( epred2_1 @ X17
          @ ^ [Z0: $i > $o] :
            ? [X16: $i] :
              ( ( Z0 @ X16 )
              & ( X20
                @ ^ [Z1: $i] :
                    ( ( Z1 != X16 )
                    & ( Z0 @ Z1 ) ) ) ) ) )
      & ~ ( epred2_1 @ X17 @ c0 ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).

thf(c_0_9,negated_conjecture,
    ! [X7: ( ( $i > $o ) > $o ) > $o] : ( X7 @ ( epred1_1 @ X7 ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_10,negated_conjecture,
    $false,
    inference(flex_resolve,[status(thm)],[c_0_9]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV290^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.19  % Computer : n015.cluster.edu
% 0.12/0.19  % Model    : x86_64 x86_64
% 0.12/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.19  % Memory   : 8046.5625MB
% 0.12/0.19  % OS       : Linux 6.8.0-71-generic
% 0.12/0.19  % CPULimit : 300
% 0.12/0.19  % WCLimit  : 300
% 0.12/0.19  % DateTime : Tue Sep 29 15:34:48 UTC 2026
% 0.12/0.19  % CPUTime  : 
% 0.12/0.19  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.23  Running higher-order theorem proving
% 0.12/0.24  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.caGBTEN1nk/E---3.1_3665817.p
% 0.12/0.26  % Version: 3.5.1-ho
% 0.12/0.26  % Preprocessing class: HSSSSMSSSLSNHHA.
% 0.12/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.26  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.12/0.26  % Starting sh3l with 300s (1) cores
% 0.12/0.26  % Starting lpo6_lambda_fix with 300s (1) cores
% 0.12/0.26  % Starting full_lambda_8 with 300s (1) cores
% 0.12/0.26  % sh3l with pid 3665844 completed with status 0
% 0.12/0.26  % Result found by sh3l
% 0.12/0.26  % Preprocessing class: HSSSSMSSSLSNHHA.
% 0.12/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.26  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.12/0.26  % Starting sh3l with 300s (1) cores
% 0.12/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = gf120_gu_RUU_F100_L01000)
% 0.12/0.26  % SinE strategy is gf120_gu_RUU_F100_L01000
% 0.12/0.26  % Search class: HHUNS-FFSF00-DHHFMSBN
% 0.12/0.26  % partial match(3): HHUNF-FFSF00-SHSFMSBN
% 0.12/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.26  % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.26  % SubtermCWHack with pid 3665847 completed with status 0
% 0.12/0.26  % Result found by SubtermCWHack
% 0.12/0.26  % Preprocessing class: HSSSSMSSSLSNHHA.
% 0.12/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.26  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.12/0.26  % Starting sh3l with 300s (1) cores
% 0.12/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = gf120_gu_RUU_F100_L01000)
% 0.12/0.26  % SinE strategy is gf120_gu_RUU_F100_L01000
% 0.12/0.26  % Search class: HHUNS-FFSF00-DHHFMSBN
% 0.12/0.26  % partial match(3): HHUNF-FFSF00-SHSFMSBN
% 0.12/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.26  % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.26  % Preprocessing time       : 0.001 s
% 0.12/0.26  
% 0.12/0.26  % Proof found!
% 0.12/0.26  % SZS status Theorem
% 0.12/0.26  % SZS output start CNFRefutation
% See solution above
% 0.12/0.26  % Parsed axioms                        : 6
% 0.12/0.26  % Removed by relevancy pruning/SinE    : 3
% 0.12/0.26  % Initial clauses                      : 4
% 0.12/0.26  % Removed in clause preprocessing      : 0
% 0.12/0.26  % Initial clauses in saturation        : 4
% 0.12/0.26  % Processed clauses                    : 2
% 0.12/0.26  % ...of these trivial                  : 0
% 0.12/0.26  % ...subsumed                          : 0
% 0.12/0.26  % ...remaining for further processing  : 1
% 0.12/0.26  % Other redundant clauses eliminated   : 0
% 0.12/0.26  % Clauses deleted for lack of memory   : 0
% 0.12/0.26  % Backward-subsumed                    : 0
% 0.12/0.26  % Backward-rewritten                   : 0
% 0.12/0.26  % Generated clauses                    : 0
% 0.12/0.26  % ...of the previous two non-redundant : 0
% 0.12/0.26  % ...aggressively subsumed             : 0
% 0.12/0.26  % Contextual simplify-reflections      : 0
% 0.12/0.26  % Paramodulations                      : 0
% 0.12/0.26  % Factorizations                       : 0
% 0.12/0.26  % NegExts                              : 0
% 0.12/0.26  % Equation resolutions                 : 0
% 0.12/0.26  % Disequality decompositions           : 0
% 0.12/0.26  % Total rewrite steps                  : 0
% 0.12/0.26  % ...of those cached                   : 0
% 0.12/0.26  % Propositional unsat checks           : 0
% 0.12/0.26  %    Propositional check models        : 0
% 0.12/0.26  %    Propositional check unsatisfiable : 0
% 0.12/0.26  %    Propositional clauses             : 0
% 0.12/0.26  %    Propositional clauses after purity: 0
% 0.12/0.26  %    Propositional unsat core size     : 0
% 0.12/0.26  %    Propositional preprocessing time  : 0.000
% 0.12/0.26  %    Propositional encoding time       : 0.000
% 0.12/0.26  %    Propositional solver time         : 0.000
% 0.12/0.26  %    Success case prop preproc time    : 0.000
% 0.12/0.26  %    Success case prop encoding time   : 0.000
% 0.12/0.26  %    Success case prop solver time     : 0.000
% 0.12/0.26  % Current number of processed clauses  : 1
% 0.12/0.26  %    Positive orientable unit clauses  : 0
% 0.12/0.26  %    Positive unorientable unit clauses: 0
% 0.12/0.26  %    Negative unit clauses             : 1
% 0.12/0.26  %    Non-unit-clauses                  : 0
% 0.12/0.26  % Current number of unprocessed clauses: 2
% 0.12/0.26  % ...number of literals in the above   : 3
% 0.12/0.26  % Current number of archived formulas  : 0
% 0.12/0.26  % Current number of archived clauses   : 0
% 0.12/0.26  % Clause-clause subsumption calls (NU) : 0
% 0.12/0.26  % Rec. Clause-clause subsumption calls : 0
% 0.12/0.26  % Non-unit clause-clause subsumptions  : 0
% 0.12/0.26  % Unit Clause-clause subsumption calls : 0
% 0.12/0.26  % Rewrite failures with RHS unbound    : 0
% 0.12/0.26  % BW rewrite match attempts            : 0
% 0.12/0.26  % BW rewrite match successes           : 0
% 0.12/0.26  % Condensation attempts                : 0
% 0.12/0.26  % Condensation successes               : 0
% 0.12/0.26  % Termbank termtop insertions          : 496
% 0.12/0.26  % Search garbage collected termcells   : 167
% 0.12/0.26  
% 0.12/0.26  % -------------------------------------------------
% 0.12/0.26  % User time                : 0.002 s
% 0.12/0.26  % System time              : 0.001 s
% 0.12/0.26  % Total time               : 0.004 s
% 0.12/0.26  % Maximum resident set size: 3640 pages
% 0.12/0.26  
% 0.12/0.26  % -------------------------------------------------
% 0.12/0.26  % User time                : 0.004 s
% 0.12/0.26  % System time              : 0.006 s
% 0.12/0.26  % Total time               : 0.010 s
% 0.12/0.26  % Maximum resident set size: 4864 pages
% 0.12/0.26  % E exiting
%------------------------------------------------------------------------------