↑ 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  : SEV189^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n018.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:36:15 AM UTC 2026

% Result   : Theorem 0.27s 0.40s
% Output   : CNFRefutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   21 (   1 unt;   0 typ;   0 def)
%            Number of atoms       :  101 (   0 equ;   0 cnn)
%            Maximal formula atoms :   18 (   4 avg)
%            Number of connectives :  253 (  25   ~;  19   |;  15   &; 147   @)
%                                         (   0 <=>;  47  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   7 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   68 (  68   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   79 (  26   ^;  53   !;   0   ?;  79   :)

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

thf(decl_23,type,
    cQ: ( b > $o ) > $o ).

thf(decl_24,type,
    cP: ( b > $o ) > $o ).

thf(decl_25,type,
    epred1_1: ( ( b > $o ) > $o ) > b > $o ).

thf(decl_26,type,
    epred2_1: ( ( b > $o ) > $o ) > b > $o ).

thf(decl_27,type,
    epred3_0: ( b > $o ) > $o ).

thf(cTHM567_pme,conjecture,
    ( ( ! [X1: ( b > $o ) > $o] :
          ( ! [X2: b > $o] :
              ( ( X1 @ X2 )
             => ( cP @ X2 ) )
         => ( cP
            @ ^ [X3: b] :
              ! [X4: b > $o] :
                ( ( X1 @ X4 )
               => ( X4 @ X3 ) ) ) )
      & ! [X1: ( b > $o ) > $o] :
          ( ! [X2: b > $o] :
              ( ( X1 @ X2 )
             => ( cQ @ X2 ) )
         => ( cQ
            @ ^ [X5: b] :
              ! [X4: b > $o] :
                ( ( X1 @ X4 )
               => ( X4 @ X5 ) ) ) ) )
   => ! [X1: ( b > $o ) > $o] :
        ( ! [X2: b > $o] :
            ( ( X1 @ X2 )
           => ( ( cP @ X2 )
              & ( cQ @ X2 ) ) )
       => ( ( cP
            @ ^ [X6: b] :
              ! [X4: b > $o] :
                ( ( X1 @ X4 )
               => ( X4 @ X6 ) ) )
          & ( cQ
            @ ^ [X7: b] :
              ! [X4: b > $o] :
                ( ( X1 @ X4 )
               => ( X4 @ X7 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.hVpOVKWLzP/E---3.1_214290.p',cTHM567_pme) ).

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

thf(c_0_2,negated_conjecture,
    ~ ( ( ! [X1: ( b > $o ) > $o] :
            ( ! [X2: b > $o] :
                ( ( X1 @ X2 )
               => ( cP @ X2 ) )
           => ( cP
              @ ^ [Z0: b] :
                ! [X4: b > $o] :
                  ( ( X1 @ X4 )
                 => ( X4 @ Z0 ) ) ) )
        & ! [X1: ( b > $o ) > $o] :
            ( ! [X2: b > $o] :
                ( ( X1 @ X2 )
               => ( cQ @ X2 ) )
           => ( cQ
              @ ^ [Z0: b] :
                ! [X4: b > $o] :
                  ( ( X1 @ X4 )
                 => ( X4 @ Z0 ) ) ) ) )
     => ! [X1: ( b > $o ) > $o] :
          ( ! [X2: b > $o] :
              ( ( X1 @ X2 )
             => ( ( cP @ X2 )
                & ( cQ @ X2 ) ) )
         => ( ( cP
              @ ^ [Z0: b] :
                ! [X4: b > $o] :
                  ( ( X1 @ X4 )
                 => ( X4 @ Z0 ) ) )
            & ( cQ
              @ ^ [Z0: b] :
                ! [X4: b > $o] :
                  ( ( X1 @ X4 )
                 => ( X4 @ Z0 ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_1]) ).

thf(c_0_3,negated_conjecture,
    ! [X14: ( b > $o ) > $o,X16: ( b > $o ) > $o,X19: b > $o] :
      ( ( ( X14 @ ( epred1_1 @ X14 ) )
        | ( cP
          @ ^ [Z0: b] :
            ! [X4: b > $o] :
              ( ( X14 @ X4 )
             => ( X4 @ Z0 ) ) ) )
      & ( ~ ( cP @ ( epred1_1 @ X14 ) )
        | ( cP
          @ ^ [Z0: b] :
            ! [X4: b > $o] :
              ( ( X14 @ X4 )
             => ( X4 @ Z0 ) ) ) )
      & ( ( X16 @ ( epred2_1 @ X16 ) )
        | ( cQ
          @ ^ [Z0: b] :
            ! [X4: b > $o] :
              ( ( X16 @ X4 )
             => ( X4 @ Z0 ) ) ) )
      & ( ~ ( cQ @ ( epred2_1 @ X16 ) )
        | ( cQ
          @ ^ [Z0: b] :
            ! [X4: b > $o] :
              ( ( X16 @ X4 )
             => ( X4 @ Z0 ) ) ) )
      & ( ( cP @ X19 )
        | ~ ( epred3_0 @ X19 ) )
      & ( ( cQ @ X19 )
        | ~ ( epred3_0 @ X19 ) )
      & ( ~ ( cP
            @ ^ [Z0: b] :
              ! [X4: b > $o] :
                ( ( epred3_0 @ X4 )
               => ( X4 @ Z0 ) ) )
        | ~ ( cQ
            @ ^ [Z0: b] :
              ! [X4: b > $o] :
                ( ( epred3_0 @ X4 )
               => ( X4 @ 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,
    ( ~ ( cP
        @ ^ [Z0: b] :
          ! [X20: b > $o] :
            ( ( epred3_0 @ X20 )
           => ( X20 @ Z0 ) ) )
    | ~ ( cQ
        @ ^ [Z0: b] :
          ! [X21: b > $o] :
            ( ( epred3_0 @ X21 )
           => ( X21 @ Z0 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ! [X1: ( b > $o ) > $o] :
      ( ( cQ
        @ ^ [Z0: b] :
          ! [X22: b > $o] :
            ( ( X1 @ X22 )
           => ( X22 @ Z0 ) ) )
      | ~ ( cQ @ ( epred2_1 @ X1 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_6,negated_conjecture,
    ( ~ ( cP
        @ ^ [Z0: b] :
          ! [X23: b > $o] :
            ( ( epred3_0 @ X23 )
           => ( X23 @ Z0 ) ) )
    | ~ ( cQ @ ( epred2_1 @ epred3_0 ) ) ),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

thf(c_0_7,negated_conjecture,
    ! [X1: ( b > $o ) > $o] :
      ( ( cP
        @ ^ [Z0: b] :
          ! [X24: b > $o] :
            ( ( X1 @ X24 )
           => ( X24 @ Z0 ) ) )
      | ~ ( cP @ ( epred1_1 @ X1 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_8,negated_conjecture,
    ! [X1: ( b > $o ) > $o] :
      ( ( X1 @ ( epred1_1 @ X1 ) )
      | ( cP
        @ ^ [Z0: b] :
          ! [X25: b > $o] :
            ( ( X1 @ X25 )
           => ( X25 @ Z0 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_9,negated_conjecture,
    ( ~ ( cQ @ ( epred2_1 @ epred3_0 ) )
    | ~ ( cP @ ( epred1_1 @ epred3_0 ) ) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

thf(c_0_10,negated_conjecture,
    ! [X2: b > $o] :
      ( ( cQ @ X2 )
      | ~ ( epred3_0 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_11,negated_conjecture,
    ( ( epred3_0 @ ( epred1_1 @ epred3_0 ) )
    | ~ ( cQ @ ( epred2_1 @ epred3_0 ) ) ),
    inference(spm,[status(thm)],[c_0_6,c_0_8]) ).

thf(c_0_12,negated_conjecture,
    ( ~ ( cP @ ( epred1_1 @ epred3_0 ) )
    | ~ ( epred3_0 @ ( epred2_1 @ epred3_0 ) ) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

thf(c_0_13,negated_conjecture,
    ! [X2: b > $o] :
      ( ( cP @ X2 )
      | ~ ( epred3_0 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_14,negated_conjecture,
    ( ( epred3_0 @ ( epred1_1 @ epred3_0 ) )
    | ~ ( epred3_0 @ ( epred2_1 @ epred3_0 ) ) ),
    inference(spm,[status(thm)],[c_0_11,c_0_10]) ).

thf(c_0_15,negated_conjecture,
    ! [X1: ( b > $o ) > $o] :
      ( ( X1 @ ( epred2_1 @ X1 ) )
      | ( cQ
        @ ^ [Z0: b] :
          ! [X26: b > $o] :
            ( ( X1 @ X26 )
           => ( X26 @ Z0 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_16,negated_conjecture,
    ~ ( epred3_0 @ ( epred2_1 @ epred3_0 ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

thf(c_0_17,negated_conjecture,
    ~ ( cP
      @ ^ [Z0: b] :
        ! [X27: b > $o] :
          ( ( epred3_0 @ X27 )
         => ( X27 @ Z0 ) ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_15]),c_0_16]) ).

thf(c_0_18,negated_conjecture,
    ~ ( cP @ ( epred1_1 @ epred3_0 ) ),
    inference(spm,[status(thm)],[c_0_17,c_0_7]) ).

thf(c_0_19,negated_conjecture,
    epred3_0 @ ( epred1_1 @ epred3_0 ),
    inference(spm,[status(thm)],[c_0_17,c_0_8]) ).

thf(c_0_20,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_13]),c_0_19])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SEV189^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.27  % Computer : n018.cluster.edu
% 0.10/0.27  % Model    : x86_64 x86_64
% 0.10/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.27  % Memory   : 8046.5625MB
% 0.10/0.27  % OS       : Linux 6.8.0-71-generic
% 0.10/0.28  % CPULimit : 300
% 0.10/0.28  % WCLimit  : 300
% 0.10/0.28  % DateTime : Tue Sep 29 15:21:56 UTC 2026
% 0.10/0.28  % CPUTime  : 
% 0.10/0.28  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.35  Running higher-order theorem proving
% 0.27/0.37  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.hVpOVKWLzP/E---3.1_214290.p
% 0.27/0.40  % Version: 3.5.1-ho
% 0.27/0.40  % Preprocessing class: HSMSSMSSSSMNHHA.
% 0.27/0.40  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.40  % Starting ehoh_best4_fo with 1200s (4) cores
% 0.27/0.40  % Starting ehoh_best_nonlift_rwall with 600s (2) cores
% 0.27/0.40  % Starting lpo1_lambda_fix with 300s (1) cores
% 0.27/0.40  % Starting full_lambda_9 with 300s (1) cores
% 0.27/0.40  % lpo1_lambda_fix with pid 214305 completed with status 0
% 0.27/0.40  % Result found by lpo1_lambda_fix
% 0.27/0.40  % Preprocessing class: HSMSSMSSSSMNHHA.
% 0.27/0.40  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.40  % Starting ehoh_best4_fo with 1200s (4) cores
% 0.27/0.40  % Starting ehoh_best_nonlift_rwall with 600s (2) cores
% 0.27/0.40  % Starting lpo1_lambda_fix with 300s (1) cores
% 0.27/0.40  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.27/0.40  % No SInE strategy applied
% 0.27/0.40  % Search class: HGHNF-FFSF00-MHHFFSBN
% 0.27/0.40  % partial match(1): HGHNF-FFSF00-SHHFFSBN
% 0.27/0.40  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.40  % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.40  % SubtermCWHack with pid 214307 completed with status 0
% 0.27/0.40  % Result found by SubtermCWHack
% 0.27/0.40  % Preprocessing class: HSMSSMSSSSMNHHA.
% 0.27/0.40  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.40  % Starting ehoh_best4_fo with 1200s (4) cores
% 0.27/0.40  % Starting ehoh_best_nonlift_rwall with 600s (2) cores
% 0.27/0.40  % Starting lpo1_lambda_fix with 300s (1) cores
% 0.27/0.40  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.27/0.40  % No SInE strategy applied
% 0.27/0.40  % Search class: HGHNF-FFSF00-MHHFFSBN
% 0.27/0.40  % partial match(1): HGHNF-FFSF00-SHHFFSBN
% 0.27/0.40  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.40  % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.40  % Preprocessing time       : 0.002 s
% 0.27/0.40  
% 0.27/0.40  % Proof found!
% 0.27/0.40  % SZS status Theorem
% 0.27/0.40  % SZS output start CNFRefutation
% See solution above
% 0.27/0.40  % Parsed axioms                        : 4
% 0.27/0.40  % Removed by relevancy pruning/SinE    : 0
% 0.27/0.40  % Initial clauses                      : 10
% 0.27/0.40  % Removed in clause preprocessing      : 3
% 0.27/0.40  % Initial clauses in saturation        : 7
% 0.27/0.40  % Processed clauses                    : 19
% 0.27/0.40  % ...of these trivial                  : 0
% 0.27/0.40  % ...subsumed                          : 0
% 0.27/0.40  % ...remaining for further processing  : 18
% 0.27/0.40  % Other redundant clauses eliminated   : 0
% 0.27/0.40  % Clauses deleted for lack of memory   : 0
% 0.27/0.40  % Backward-subsumed                    : 6
% 0.27/0.40  % Backward-rewritten                   : 1
% 0.27/0.40  % Generated clauses                    : 16
% 0.27/0.40  % ...of the previous two non-redundant : 16
% 0.27/0.40  % ...aggressively subsumed             : 0
% 0.27/0.40  % Contextual simplify-reflections      : 1
% 0.27/0.40  % Paramodulations                      : 16
% 0.27/0.40  % Factorizations                       : 0
% 0.27/0.40  % NegExts                              : 0
% 0.27/0.40  % Equation resolutions                 : 0
% 0.27/0.40  % Disequality decompositions           : 0
% 0.27/0.40  % Total rewrite steps                  : 2
% 0.27/0.40  % ...of those cached                   : 1
% 0.27/0.40  % Propositional unsat checks           : 0
% 0.27/0.40  %    Propositional check models        : 0
% 0.27/0.40  %    Propositional check unsatisfiable : 0
% 0.27/0.40  %    Propositional clauses             : 0
% 0.27/0.40  %    Propositional clauses after purity: 0
% 0.27/0.40  %    Propositional unsat core size     : 0
% 0.27/0.40  %    Propositional preprocessing time  : 0.000
% 0.27/0.40  %    Propositional encoding time       : 0.000
% 0.27/0.40  %    Propositional solver time         : 0.000
% 0.27/0.40  %    Success case prop preproc time    : 0.000
% 0.27/0.40  %    Success case prop encoding time   : 0.000
% 0.27/0.40  %    Success case prop solver time     : 0.000
% 0.27/0.40  % Current number of processed clauses  : 11
% 0.27/0.40  %    Positive orientable unit clauses  : 1
% 0.27/0.40  %    Positive unorientable unit clauses: 0
% 0.27/0.40  %    Negative unit clauses             : 4
% 0.27/0.40  %    Non-unit-clauses                  : 6
% 0.27/0.40  % Current number of unprocessed clauses: 4
% 0.27/0.40  % ...number of literals in the above   : 7
% 0.27/0.40  % Current number of archived formulas  : 0
% 0.27/0.40  % Current number of archived clauses   : 7
% 0.27/0.40  % Clause-clause subsumption calls (NU) : 13
% 0.27/0.40  % Rec. Clause-clause subsumption calls : 13
% 0.27/0.40  % Non-unit clause-clause subsumptions  : 1
% 0.27/0.40  % Unit Clause-clause subsumption calls : 10
% 0.27/0.40  % Rewrite failures with RHS unbound    : 0
% 0.27/0.40  % BW rewrite match attempts            : 1
% 0.27/0.40  % BW rewrite match successes           : 1
% 0.27/0.40  % Condensation attempts                : 0
% 0.27/0.40  % Condensation successes               : 0
% 0.27/0.40  % Termbank termtop insertions          : 1960
% 0.27/0.40  % Search garbage collected termcells   : 284
% 0.27/0.40  
% 0.27/0.40  % -------------------------------------------------
% 0.27/0.40  % User time                : 0.007 s
% 0.27/0.40  % System time              : 0.001 s
% 0.27/0.40  % Total time               : 0.008 s
% 0.27/0.40  % Maximum resident set size: 3636 pages
% 0.27/0.40  
% 0.27/0.40  % -------------------------------------------------
% 0.27/0.40  % User time                : 0.008 s
% 0.27/0.40  % System time              : 0.008 s
% 0.27/0.40  % Total time               : 0.017 s
% 0.27/0.40  % Maximum resident set size: 4864 pages
% 0.27/0.40  % E exiting
%------------------------------------------------------------------------------