↑ 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  : NUM814^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 : n020.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:17:46 AM UTC 2026

% Result   : Theorem 0.07s 0.25s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   18 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   41 (  26 equ;   0 cnn)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  179 (  23   ~;  13   |;  19   &; 100   @)
%                                         (   2 <=>;  22  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   11 (  11   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   52 (   7   ^;  42   !;   3   ?;  52   :)

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

thf(decl_24,type,
    cS: $i > $i ).

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

thf(decl_26,type,
    cIND: $o ).

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

thf(decl_28,type,
    cPEANO1: $o ).

thf(decl_29,type,
    esk1_1: ( $i > $o ) > $i ).

thf(decl_30,type,
    esk2_2: $i > ( $i > $o ) > $i ).

thf(cODD1_def,axiom,
    ( cODD1
    = ( ^ [X1: $i] :
          ~ ( cEVEN1 @ X1 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.wvHTUhyWDw/E---3.1_1016058.p',cODD1_def) ).

thf(cEVEN1_def,axiom,
    ( cEVEN1
    = ( ^ [X1: $i] :
        ! [X2: $i > $o] :
          ( ( ( X2 @ c0 )
            & ! [X3: $i] :
                ( ( X2 @ X3 )
               => ( X2 @ ( cS @ ( cS @ X3 ) ) ) ) )
         => ( X2 @ X1 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.wvHTUhyWDw/E---3.1_1016058.p',cEVEN1_def) ).

thf(cTHM404,conjecture,
    ( cPEANO1
   => ? [X1: $i] : ( cODD1 @ X1 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.wvHTUhyWDw/E---3.1_1016058.p',cTHM404) ).

thf(cPEANO1_def,axiom,
    ( cPEANO1
  <=> ( ! [X4: $i] :
          ( ( cS @ X4 )
         != c0 )
      & ! [X5: $i,X6: $i] :
          ( ( ( cS @ X5 )
            = ( cS @ X6 ) )
         => ( X5 = X6 ) )
      & cIND ) ),
    file('/export/starexec/sandbox2/tmp/tmp.wvHTUhyWDw/E---3.1_1016058.p',cPEANO1_def) ).

thf(cIND_def,axiom,
    ( cIND
  <=> ! [X2: $i > $o] :
        ( ( ( X2 @ c0 )
          & ! [X3: $i] :
              ( ( X2 @ X3 )
             => ( X2 @ ( cS @ X3 ) ) ) )
       => ! [X3: $i] : ( X2 @ X3 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.wvHTUhyWDw/E---3.1_1016058.p',cIND_def) ).

thf(c_0_5,plain,
    ( cODD1
    = ( ^ [Z0: $i] :
          ~ ! [X14: $i > $o] :
              ( ( ( X14 @ c0 )
                & ! [X15: $i] :
                    ( ( X14 @ X15 )
                   => ( X14 @ ( cS @ ( cS @ X15 ) ) ) ) )
             => ( X14 @ Z0 ) ) ) ),
    inference(fof_simplification,[status(thm)],[cODD1_def]) ).

thf(c_0_6,plain,
    ( cEVEN1
    = ( ^ [Z0: $i] :
        ! [X2: $i > $o] :
          ( ( ( X2 @ c0 )
            & ! [X3: $i] :
                ( ( X2 @ X3 )
               => ( X2 @ ( cS @ ( cS @ X3 ) ) ) ) )
         => ( X2 @ Z0 ) ) ) ),
    inference(fof_simplification,[status(thm)],[cEVEN1_def]) ).

thf(c_0_7,negated_conjecture,
    ~ ( cPEANO1
     => ? [X1: $i] : ( cODD1 @ X1 ) ),
    inference(assume_negation,[status(cth)],[cTHM404]) ).

thf(c_0_8,axiom,
    ( cPEANO1
    = ( ! [X4: $i] :
          ( ( cS @ X4 )
         != c0 )
      & ! [X5: $i,X6: $i] :
          ( ( ( cS @ X5 )
            = ( cS @ X6 ) )
         => ( X5 = X6 ) )
      & ! [X16: $i > $o] :
          ( ( ( X16 @ c0 )
            & ! [X17: $i] :
                ( ( X16 @ X17 )
               => ( X16 @ ( cS @ X17 ) ) ) )
         => ! [X18: $i] : ( X16 @ X18 ) ) ) ),
    inference(apply_def,[status(thm)],[cPEANO1_def,cIND_def]) ).

thf(c_0_9,plain,
    ( cODD1
    = ( ^ [Z0: $i] :
          ~ ! [X14: $i > $o] :
              ( ( ( X14 @ c0 )
                & ! [X15: $i] :
                    ( ( X14 @ X15 )
                   => ( X14 @ ( cS @ ( cS @ X15 ) ) ) ) )
             => ( X14 @ Z0 ) ) ) ),
    inference(apply_def,[status(thm)],[c_0_5,c_0_6]) ).

thf(c_0_10,negated_conjecture,
    ~ ( ( ! [X19: $i] :
            ( ( cS @ X19 )
           != c0 )
        & ! [X20: $i,X21: $i] :
            ( ( ( cS @ X20 )
              = ( cS @ X21 ) )
           => ( X20 = X21 ) )
        & ! [X22: $i > $o] :
            ( ( ( X22 @ c0 )
              & ! [X23: $i] :
                  ( ( X22 @ X23 )
                 => ( X22 @ ( cS @ X23 ) ) ) )
           => ! [X24: $i] : ( X22 @ X24 ) ) )
     => ? [X1: $i] :
          ~ ! [X25: $i > $o] :
              ( ( ( X25 @ c0 )
                & ! [X26: $i] :
                    ( ( X25 @ X26 )
                   => ( X25 @ ( cS @ ( cS @ X26 ) ) ) ) )
             => ( X25 @ X1 ) ) ),
    inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).

thf(c_0_11,negated_conjecture,
    ! [X27: $i,X28: $i,X29: $i,X30: $i > $o,X32: $i,X33: $i,X34: $i > $o] :
      ( ( ( cS @ X27 )
       != c0 )
      & ( ( ( cS @ X28 )
         != ( cS @ X29 ) )
        | ( X28 = X29 ) )
      & ( ( X30 @ ( esk1_1 @ X30 ) )
        | ~ ( X30 @ c0 )
        | ( X30 @ X32 ) )
      & ( ~ ( X30 @ ( cS @ ( esk1_1 @ X30 ) ) )
        | ~ ( X30 @ c0 )
        | ( X30 @ X32 ) )
      & ( ( X34 @ ( esk2_2 @ X33 @ X34 ) )
        | ~ ( X34 @ c0 )
        | ( X34 @ X33 ) )
      & ( ~ ( X34 @ ( cS @ ( cS @ ( esk2_2 @ X33 @ X34 ) ) ) )
        | ~ ( X34 @ c0 )
        | ( X34 @ X33 ) ) ),
    inference(distribute,[status(thm)],[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_10])])])])])]) ).

thf(c_0_12,negated_conjecture,
    ! [X1: $i,X2: $i > $o] :
      ( ( X2 @ X1 )
      | ~ ( X2 @ ( cS @ ( cS @ ( esk2_2 @ X1 @ X2 ) ) ) )
      | ~ ( X2 @ c0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

thf(c_0_13,negated_conjecture,
    ! [X1: $i,X3: $i] :
      ( ( X1 = X3 )
      | ( ( cS @ X1 )
       != ( cS @ X3 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

thf(c_0_14,negated_conjecture,
    ! [X1: $i] :
      ( ( ( cS
          @ ( cS
            @ ( esk2_2 @ X1
              @ ^ [Z0: $i] : ( Z0 != X1 ) ) ) )
        = X1 )
      | ( c0 = X1 ) ),
    inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_12]) ).

thf(c_0_15,negated_conjecture,
    ! [X1: $i] :
      ( ( cS @ X1 )
     != c0 ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

thf(c_0_16,negated_conjecture,
    ! [X1: $i] :
      ( ( cS
        @ ( esk2_2 @ ( cS @ X1 )
          @ ^ [Z0: $i] :
              ( Z0
             != ( cS @ X1 ) ) ) )
      = X1 ),
    inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14])]),c_0_15]) ).

thf(c_0_17,negated_conjecture,
    $false,
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM814^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.17  % Computer : n020.cluster.edu
% 0.07/0.17  % Model    : x86_64 x86_64
% 0.07/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17  % Memory   : 8046.5625MB
% 0.07/0.17  % OS       : Linux 6.8.0-71-generic
% 0.07/0.17  % CPULimit : 300
% 0.07/0.17  % WCLimit  : 300
% 0.07/0.17  % DateTime : Tue Sep 29 13:03:32 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.21  Running higher-order theorem proving
% 0.07/0.22  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.wvHTUhyWDw/E---3.1_1016058.p
% 0.07/0.25  % Version: 3.5.1-ho
% 0.07/0.25  % Preprocessing class: HSSSSLSSSLSNSFA.
% 0.07/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.25  % Starting post_as_ho5 with 1500s (5) cores
% 0.07/0.25  % Starting post_as_ho10 with 300s (1) cores
% 0.07/0.25  % Starting post_as_ho4 with 300s (1) cores
% 0.07/0.25  % Starting sh5l with 300s (1) cores
% 0.07/0.25  % post_as_ho5 with pid 1016071 completed with status 0
% 0.07/0.25  % Result found by post_as_ho5
% 0.07/0.25  % Preprocessing class: HSSSSLSSSLSNSFA.
% 0.07/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.25  % Starting post_as_ho5 with 1500s (5) cores
% 0.07/0.25  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.07/0.25  % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.07/0.25  % Search class: HGUSF-FFSF21-MSFFMMBN
% 0.07/0.25  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.25  % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.25  % Starting post_as_ho5 with 151s (1) cores
% 0.07/0.25  % Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.07/0.25  % Starting sh5l with 136s (1) cores
% 0.07/0.25  % Starting new_bool_3 with 136s (1) cores
% 0.07/0.25  % SubtermCWHack with pid 1016076 completed with status 10
% 0.07/0.25  % Starting new_bool_1 with 136s (1) cores
% 0.07/0.25  % post_as_ho5 with pid 1016077 completed with status 0
% 0.07/0.25  % Result found by post_as_ho5
% 0.07/0.25  % Preprocessing class: HSSSSLSSSLSNSFA.
% 0.07/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.25  % Starting post_as_ho5 with 1500s (5) cores
% 0.07/0.25  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.07/0.25  % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.07/0.25  % Search class: HGUSF-FFSF21-MSFFMMBN
% 0.07/0.25  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.25  % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.25  % Starting post_as_ho5 with 151s (1) cores
% 0.07/0.25  % Preprocessing time       : 0.001 s
% 0.07/0.25  % Presaturation interreduction done
% 0.07/0.25  
% 0.07/0.25  % Proof found!
% 0.07/0.25  % SZS status Theorem
% 0.07/0.25  % SZS output start CNFRefutation
% See solution above
% 0.07/0.25  % Parsed axioms                        : 11
% 0.07/0.25  % Removed by relevancy pruning/SinE    : 6
% 0.07/0.25  % Initial clauses                      : 6
% 0.07/0.25  % Removed in clause preprocessing      : 0
% 0.07/0.25  % Initial clauses in saturation        : 6
% 0.07/0.25  % Processed clauses                    : 41
% 0.07/0.25  % ...of these trivial                  : 0
% 0.07/0.25  % ...subsumed                          : 14
% 0.07/0.25  % ...remaining for further processing  : 27
% 0.07/0.25  % Other redundant clauses eliminated   : 9
% 0.07/0.25  % Clauses deleted for lack of memory   : 0
% 0.07/0.25  % Backward-subsumed                    : 1
% 0.07/0.25  % Backward-rewritten                   : 0
% 0.07/0.25  % Generated clauses                    : 123
% 0.07/0.25  % ...of the previous two non-redundant : 96
% 0.07/0.25  % ...aggressively subsumed             : 0
% 0.07/0.25  % Contextual simplify-reflections      : 0
% 0.07/0.25  % Paramodulations                      : 90
% 0.07/0.25  % Factorizations                       : 4
% 0.07/0.25  % NegExts                              : 1
% 0.07/0.25  % Equation resolutions                 : 15
% 0.07/0.25  % Disequality decompositions           : 0
% 0.07/0.25  % Total rewrite steps                  : 1
% 0.07/0.25  % ...of those cached                   : 0
% 0.07/0.25  % Propositional unsat checks           : 0
% 0.07/0.25  %    Propositional check models        : 0
% 0.07/0.25  %    Propositional check unsatisfiable : 0
% 0.07/0.25  %    Propositional clauses             : 0
% 0.07/0.25  %    Propositional clauses after purity: 0
% 0.07/0.25  %    Propositional unsat core size     : 0
% 0.07/0.25  %    Propositional preprocessing time  : 0.000
% 0.07/0.25  %    Propositional encoding time       : 0.000
% 0.07/0.25  %    Propositional solver time         : 0.000
% 0.07/0.25  %    Success case prop preproc time    : 0.000
% 0.07/0.25  %    Success case prop encoding time   : 0.000
% 0.07/0.25  %    Success case prop solver time     : 0.000
% 0.07/0.25  % Current number of processed clauses  : 20
% 0.07/0.25  %    Positive orientable unit clauses  : 2
% 0.07/0.25  %    Positive unorientable unit clauses: 1
% 0.07/0.25  %    Negative unit clauses             : 5
% 0.07/0.25  %    Non-unit-clauses                  : 12
% 0.07/0.25  % Current number of unprocessed clauses: 44
% 0.07/0.25  % ...number of literals in the above   : 99
% 0.07/0.25  % Current number of archived formulas  : 0
% 0.07/0.25  % Current number of archived clauses   : 7
% 0.07/0.25  % Clause-clause subsumption calls (NU) : 14
% 0.07/0.25  % Rec. Clause-clause subsumption calls : 14
% 0.07/0.25  % Non-unit clause-clause subsumptions  : 2
% 0.07/0.25  % Unit Clause-clause subsumption calls : 9
% 0.07/0.25  % Rewrite failures with RHS unbound    : 0
% 0.07/0.25  % BW rewrite match attempts            : 24
% 0.07/0.25  % BW rewrite match successes           : 15
% 0.07/0.25  % Condensation attempts                : 0
% 0.07/0.25  % Condensation successes               : 0
% 0.07/0.25  % Termbank termtop insertions          : 5058
% 0.07/0.25  % Search garbage collected termcells   : 348
% 0.07/0.25  
% 0.07/0.25  % -------------------------------------------------
% 0.07/0.25  % User time                : 0.005 s
% 0.07/0.25  % System time              : 0.006 s
% 0.07/0.25  % Total time               : 0.011 s
% 0.07/0.25  % Maximum resident set size: 3636 pages
% 0.07/0.25  
% 0.07/0.25  % -------------------------------------------------
% 0.07/0.25  % User time                : 0.013 s
% 0.07/0.25  % System time              : 0.014 s
% 0.07/0.25  % Total time               : 0.026 s
% 0.07/0.25  % Maximum resident set size: 4864 pages
% 0.07/0.25  % E exiting
%------------------------------------------------------------------------------