↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEU968^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/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 : Wed Sep 30 08:26:01 AM UTC 2026

% Result   : Theorem 0.18s 0.28s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   17 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   24 (   4 equ;   0 cnn)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :  227 (  18   ~;  20   |;  19   &; 146   @)
%                                         (   0 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   9 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   56 (  56   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   6 usr;   1 con; 0-2 aty)
%            Number of variables   :   89 (  48   ^;  41   !;   0   ?;  89   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    a: $tType ).

thf(decl_23,type,
    esk1_0: a > a ).

thf(decl_24,type,
    esk2_0: a > a ).

thf(decl_25,type,
    esk3_0: a > a ).

thf(decl_26,type,
    esk4_1: ( ( a > a ) > $o ) > a > a ).

thf(decl_27,type,
    esk5_1: ( ( a > a ) > $o ) > a > a ).

thf(decl_28,type,
    epred1_0: ( a > a ) > $o ).

thf(cTHM135C_pme,conjecture,
    ( ! [X1: a > a] :
        ( ( ^ [X2: a] : ( X1 @ X2 ) )
        = X1 )
   => ! [X3: a > a,X4: a > a,X5: a > a] :
        ( ( ! [X6: ( a > a ) > $o] :
              ( ( ( X6
                  @ ^ [X7: a] : X7 )
                & ! [X8: a > a] :
                    ( ( X6 @ X8 )
                   => ( X6
                      @ ^ [X2: a] : ( X3 @ ( X8 @ X2 ) ) ) ) )
             => ( X6 @ X4 ) )
          & ! [X6: ( a > a ) > $o] :
              ( ( ( X6
                  @ ^ [X7: a] : X7 )
                & ! [X8: a > a] :
                    ( ( X6 @ X8 )
                   => ( X6
                      @ ^ [X2: a] : ( X3 @ ( X8 @ X2 ) ) ) ) )
             => ( X6 @ X5 ) ) )
       => ! [X6: ( a > a ) > $o] :
            ( ( ( X6
                @ ^ [X7: a] : X7 )
              & ! [X8: a > a] :
                  ( ( X6 @ X8 )
                 => ( X6
                    @ ^ [X2: a] : ( X3 @ ( X8 @ X2 ) ) ) ) )
           => ( X6
              @ ^ [X2: a] : ( X4 @ ( X5 @ X2 ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.UQsRMRLvl1/E---3.1_3462534.p',cTHM135C_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ( ! [X1: a > a] :
          ( ( ^ [X2: a] : ( X1 @ X2 ) )
          = X1 )
     => ! [X3: a > a,X4: a > a,X5: a > a] :
          ( ( ! [X6: ( a > a ) > $o] :
                ( ( ( X6
                    @ ^ [X7: a] : X7 )
                  & ! [X8: a > a] :
                      ( ( X6 @ X8 )
                     => ( X6
                        @ ^ [X2: a] : ( X3 @ ( X8 @ X2 ) ) ) ) )
               => ( X6 @ X4 ) )
            & ! [X6: ( a > a ) > $o] :
                ( ( ( X6
                    @ ^ [X7: a] : X7 )
                  & ! [X8: a > a] :
                      ( ( X6 @ X8 )
                     => ( X6
                        @ ^ [X2: a] : ( X3 @ ( X8 @ X2 ) ) ) ) )
               => ( X6 @ X5 ) ) )
         => ! [X6: ( a > a ) > $o] :
              ( ( ( X6
                  @ ^ [X7: a] : X7 )
                & ! [X8: a > a] :
                    ( ( X6 @ X8 )
                   => ( X6
                      @ ^ [X2: a] : ( X3 @ ( X8 @ X2 ) ) ) ) )
             => ( X6
                @ ^ [X2: a] : ( X4 @ ( X5 @ X2 ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[cTHM135C_pme]) ).

thf(c_0_2,negated_conjecture,
    ~ ( ! [X1: a > a,X19: a] :
          ( ( X1 @ X19 )
          = ( X1 @ X19 ) )
     => ! [X3: a > a,X4: a > a,X5: a > a] :
          ( ( ! [X6: ( a > a ) > $o] :
                ( ( ( X6
                    @ ^ [Z0: a] : Z0 )
                  & ! [X8: a > a] :
                      ( ( X6 @ X8 )
                     => ( X6
                        @ ^ [Z0: a] : ( X3 @ ( X8 @ Z0 ) ) ) ) )
               => ( X6 @ X4 ) )
            & ! [X6: ( a > a ) > $o] :
                ( ( ( X6
                    @ ^ [Z0: a] : Z0 )
                  & ! [X8: a > a] :
                      ( ( X6 @ X8 )
                     => ( X6
                        @ ^ [Z0: a] : ( X3 @ ( X8 @ Z0 ) ) ) ) )
               => ( X6 @ X5 ) ) )
         => ! [X6: ( a > a ) > $o] :
              ( ( ( X6
                  @ ^ [Z0: a] : Z0 )
                & ! [X8: a > a] :
                    ( ( X6 @ X8 )
                   => ( X6
                      @ ^ [Z0: a] : ( X3 @ ( X8 @ Z0 ) ) ) ) )
             => ( X6
                @ ^ [Z0: a] : ( X4 @ ( X5 @ Z0 ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).

thf(c_0_3,negated_conjecture,
    ! [X20: a > a,X21: a,X25: ( a > a ) > $o,X27: ( a > a ) > $o,X30: a > a] :
      ( ( ( X20 @ X21 )
        = ( X20 @ X21 ) )
      & ( ( X25 @ ( esk4_1 @ X25 ) )
        | ~ ( X25
            @ ^ [Z0: a] : Z0 )
        | ( X25 @ esk2_0 ) )
      & ( ~ ( X25
            @ ^ [Z0: a] : ( esk1_0 @ ( esk4_1 @ X25 @ Z0 ) ) )
        | ~ ( X25
            @ ^ [Z0: a] : Z0 )
        | ( X25 @ esk2_0 ) )
      & ( ( X27 @ ( esk5_1 @ X27 ) )
        | ~ ( X27
            @ ^ [Z0: a] : Z0 )
        | ( X27 @ esk3_0 ) )
      & ( ~ ( X27
            @ ^ [Z0: a] : ( esk1_0 @ ( esk5_1 @ X27 @ Z0 ) ) )
        | ~ ( X27
            @ ^ [Z0: a] : Z0 )
        | ( X27 @ esk3_0 ) )
      & ( epred1_0
        @ ^ [Z0: a] : Z0 )
      & ( ~ ( epred1_0 @ X30 )
        | ( epred1_0
          @ ^ [Z0: a] : ( esk1_0 @ ( X30 @ Z0 ) ) ) )
      & ~ ( epred1_0
          @ ^ [Z0: a] : ( esk2_0 @ ( esk3_0 @ Z0 ) ) ) ),
    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_2])])])])])]) ).

thf(c_0_4,negated_conjecture,
    ! [X6: ( a > a ) > $o] :
      ( ( X6 @ ( esk5_1 @ X6 ) )
      | ( X6 @ esk3_0 )
      | ~ ( X6
          @ ^ [Z0: a] : Z0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ( epred1_0
    @ ^ [Z0: a] : Z0 ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_6,negated_conjecture,
    ! [X1: a > a] :
      ( ( epred1_0
        @ ^ [Z0: a] : ( esk1_0 @ ( X1 @ Z0 ) ) )
      | ~ ( epred1_0 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_7,negated_conjecture,
    ( ( epred1_0 @ ( esk5_1 @ epred1_0 ) )
    | ( epred1_0 @ esk3_0 ) ),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

thf(c_0_8,negated_conjecture,
    ! [X6: ( a > a ) > $o] :
      ( ( X6 @ esk3_0 )
      | ~ ( X6
          @ ^ [Z0: a] : ( esk1_0 @ ( esk5_1 @ X6 @ Z0 ) ) )
      | ~ ( X6
          @ ^ [Z0: a] : Z0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_9,negated_conjecture,
    ( ( epred1_0
      @ ^ [Z0: a] : ( esk1_0 @ ( esk5_1 @ epred1_0 @ Z0 ) ) )
    | ( epred1_0 @ esk3_0 ) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

thf(c_0_10,negated_conjecture,
    ! [X6: ( a > a ) > $o] :
      ( ( X6 @ ( esk4_1 @ X6 ) )
      | ( X6 @ esk2_0 )
      | ~ ( X6
          @ ^ [Z0: a] : Z0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_11,negated_conjecture,
    epred1_0 @ esk3_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_5])]) ).

thf(c_0_12,negated_conjecture,
    ~ ( epred1_0
      @ ^ [Z0: a] : ( esk2_0 @ ( esk3_0 @ Z0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_13,negated_conjecture,
    ( epred1_0
    @ ^ [Z0: a] :
        ( esk4_1
        @ ^ [Z1: a > a] :
            ( epred1_0
            @ ^ [Z2: a] : ( Z1 @ ( esk3_0 @ Z2 ) ) )
        @ ( esk3_0 @ Z0 ) ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).

thf(c_0_14,negated_conjecture,
    ! [X6: ( a > a ) > $o] :
      ( ( X6 @ esk2_0 )
      | ~ ( X6
          @ ^ [Z0: a] : ( esk1_0 @ ( esk4_1 @ X6 @ Z0 ) ) )
      | ~ ( X6
          @ ^ [Z0: a] : Z0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_15,negated_conjecture,
    ( epred1_0
    @ ^ [Z0: a] :
        ( esk1_0
        @ ( esk4_1
          @ ^ [Z1: a > a] :
              ( epred1_0
              @ ^ [Z2: a] : ( Z1 @ ( esk3_0 @ Z2 ) ) )
          @ ( esk3_0 @ Z0 ) ) ) ),
    inference(spm,[status(thm)],[c_0_6,c_0_13]) ).

thf(c_0_16,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11])]),c_0_12]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU968^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20  % Computer : n007.cluster.edu
% 0.08/0.20  % Model    : x86_64 x86_64
% 0.08/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20  % Memory   : 8046.5625MB
% 0.08/0.20  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.21  % DateTime : Tue Sep 29 14:51:34 UTC 2026
% 0.08/0.21  % CPUTime  : 
% 0.08/0.21  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.24  Running higher-order theorem proving
% 0.08/0.26  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.UQsRMRLvl1/E---3.1_3462534.p
% 0.18/0.28  % Version: 3.5.1-ho
% 0.18/0.28  % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.18/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.28  % Starting post_as_ho5 with 1500s (5) cores
% 0.18/0.28  % Starting sh2lt with 300s (1) cores
% 0.18/0.28  % Starting ehoh_best8_lambda with 300s (1) cores
% 0.18/0.28  % Starting post_as_ho10 with 300s (1) cores
% 0.18/0.28  % post_as_ho5 with pid 3462547 completed with status 0
% 0.18/0.28  % Result found by post_as_ho5
% 0.18/0.28  % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.18/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.28  % Starting post_as_ho5 with 1500s (5) cores
% 0.18/0.28  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.18/0.28  % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.18/0.28  % Search class: HGUNF-FFSF11-MHHFFMBN
% 0.18/0.28  % partial match(1): HGUNF-FFSF11-SHHFFMBN
% 0.18/0.28  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.28  % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.28  % Starting post_as_ho5 with 151s (1) cores
% 0.18/0.28  % Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.18/0.28  % Starting sh5l with 136s (1) cores
% 0.18/0.28  % Starting new_bool_3 with 136s (1) cores
% 0.18/0.28  % SubtermCWHack with pid 3462551 completed with status 10
% 0.18/0.28  % Starting new_bool_1 with 136s (1) cores
% 0.18/0.28  % post_as_ho5 with pid 3462552 completed with status 0
% 0.18/0.28  % Result found by post_as_ho5
% 0.18/0.28  % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.18/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.28  % Starting post_as_ho5 with 1500s (5) cores
% 0.18/0.28  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.18/0.28  % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.18/0.28  % Search class: HGUNF-FFSF11-MHHFFMBN
% 0.18/0.28  % partial match(1): HGUNF-FFSF11-SHHFFMBN
% 0.18/0.28  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.28  % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.28  % Starting post_as_ho5 with 151s (1) cores
% 0.18/0.28  % Preprocessing time       : 0.001 s
% 0.18/0.28  % Presaturation interreduction done
% 0.18/0.28  
% 0.18/0.28  % Proof found!
% 0.18/0.28  % SZS status Theorem
% 0.18/0.28  % SZS output start CNFRefutation
% See solution above
% 0.18/0.28  % Parsed axioms                        : 2
% 0.18/0.28  % Removed by relevancy pruning/SinE    : 1
% 0.18/0.28  % Initial clauses                      : 8
% 0.18/0.28  % Removed in clause preprocessing      : 1
% 0.18/0.28  % Initial clauses in saturation        : 7
% 0.18/0.28  % Processed clauses                    : 69
% 0.18/0.28  % ...of these trivial                  : 0
% 0.18/0.28  % ...subsumed                          : 0
% 0.18/0.28  % ...remaining for further processing  : 69
% 0.18/0.28  % Other redundant clauses eliminated   : 0
% 0.18/0.28  % Clauses deleted for lack of memory   : 0
% 0.18/0.28  % Backward-subsumed                    : 0
% 0.18/0.28  % Backward-rewritten                   : 13
% 0.18/0.28  % Generated clauses                    : 133
% 0.18/0.28  % ...of the previous two non-redundant : 97
% 0.18/0.28  % ...aggressively subsumed             : 0
% 0.18/0.28  % Contextual simplify-reflections      : 0
% 0.18/0.28  % Paramodulations                      : 94
% 0.18/0.28  % Factorizations                       : 0
% 0.18/0.28  % NegExts                              : 11
% 0.18/0.28  % Equation resolutions                 : 4
% 0.18/0.28  % Disequality decompositions           : 0
% 0.18/0.28  % Total rewrite steps                  : 61
% 0.18/0.28  % ...of those cached                   : 54
% 0.18/0.28  % Propositional unsat checks           : 0
% 0.18/0.28  %    Propositional check models        : 0
% 0.18/0.28  %    Propositional check unsatisfiable : 0
% 0.18/0.28  %    Propositional clauses             : 0
% 0.18/0.28  %    Propositional clauses after purity: 0
% 0.18/0.28  %    Propositional unsat core size     : 0
% 0.18/0.28  %    Propositional preprocessing time  : 0.000
% 0.18/0.28  %    Propositional encoding time       : 0.000
% 0.18/0.28  %    Propositional solver time         : 0.000
% 0.18/0.28  %    Success case prop preproc time    : 0.000
% 0.18/0.28  %    Success case prop encoding time   : 0.000
% 0.18/0.28  %    Success case prop solver time     : 0.000
% 0.18/0.28  % Current number of processed clauses  : 48
% 0.18/0.28  %    Positive orientable unit clauses  : 22
% 0.18/0.28  %    Positive unorientable unit clauses: 0
% 0.18/0.28  %    Negative unit clauses             : 5
% 0.18/0.28  %    Non-unit-clauses                  : 21
% 0.18/0.28  % Current number of unprocessed clauses: 40
% 0.18/0.28  % ...number of literals in the above   : 78
% 0.18/0.28  % Current number of archived formulas  : 0
% 0.18/0.28  % Current number of archived clauses   : 21
% 0.18/0.28  % Clause-clause subsumption calls (NU) : 54
% 0.18/0.28  % Rec. Clause-clause subsumption calls : 49
% 0.18/0.28  % Non-unit clause-clause subsumptions  : 0
% 0.18/0.28  % Unit Clause-clause subsumption calls : 4
% 0.18/0.29  % Rewrite failures with RHS unbound    : 0
% 0.18/0.29  % BW rewrite match attempts            : 107
% 0.18/0.29  % BW rewrite match successes           : 2
% 0.18/0.29  % Condensation attempts                : 0
% 0.18/0.29  % Condensation successes               : 0
% 0.18/0.29  % Termbank termtop insertions          : 12314
% 0.18/0.29  % Search garbage collected termcells   : 348
% 0.18/0.29  
% 0.18/0.29  % -------------------------------------------------
% 0.18/0.29  % User time                : 0.010 s
% 0.18/0.29  % System time              : 0.007 s
% 0.18/0.29  % Total time               : 0.016 s
% 0.18/0.29  % Maximum resident set size: 3636 pages
% 0.18/0.29  
% 0.18/0.29  % -------------------------------------------------
% 0.18/0.29  % User time                : 0.040 s
% 0.18/0.29  % System time              : 0.018 s
% 0.18/0.29  % Total time               : 0.058 s
% 0.18/0.29  % Maximum resident set size: 4608 pages
% 0.18/0.29  % E exiting
%------------------------------------------------------------------------------