↑ 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  : SEV120^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 : 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:09 AM UTC 2026

% Result   : Theorem 0.08s 0.24s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   20 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   47 (   0 equ;   0 cnn)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :  291 (  28   ~;  35   |;  22   &; 192   @)
%                                         (   0 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   8 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   34 (  34   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   12 (  11 usr;   4 con; 0-2 aty)
%            Number of variables   :   49 (   0   ^;  49   !;   0   ?;  49   :)

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

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

thf(decl_24,type,
    esk1_0: a ).

thf(decl_25,type,
    esk2_0: a ).

thf(decl_26,type,
    esk3_0: a ).

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

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

thf(decl_29,type,
    esk6_1: ( a > a > $o ) > a ).

thf(decl_30,type,
    esk7_1: ( a > a > $o ) > a ).

thf(decl_31,type,
    esk8_1: ( a > a > $o ) > a ).

thf(decl_32,type,
    esk9_1: ( a > a > $o ) > a ).

thf(decl_33,type,
    epred2_0: a > a > $o ).

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

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

thf(c_0_2,negated_conjecture,
    ! [X29: a > a > $o,X33: a > a > $o,X38: a,X39: a,X40: a] :
      ( ( ( X29 @ ( esk4_1 @ X29 ) @ ( esk5_1 @ X29 ) )
        | ~ ( epred1_0 @ X29 )
        | ( X29 @ esk1_0 @ esk2_0 ) )
      & ( ( X29 @ ( esk5_1 @ X29 ) @ ( esk6_1 @ X29 ) )
        | ~ ( epred1_0 @ X29 )
        | ( X29 @ esk1_0 @ esk2_0 ) )
      & ( ~ ( X29 @ ( esk4_1 @ X29 ) @ ( esk6_1 @ X29 ) )
        | ~ ( epred1_0 @ X29 )
        | ( X29 @ esk1_0 @ esk2_0 ) )
      & ( ( X33 @ ( esk7_1 @ X33 ) @ ( esk8_1 @ X33 ) )
        | ~ ( epred1_0 @ X33 )
        | ( X33 @ esk2_0 @ esk3_0 ) )
      & ( ( X33 @ ( esk8_1 @ X33 ) @ ( esk9_1 @ X33 ) )
        | ~ ( epred1_0 @ X33 )
        | ( X33 @ esk2_0 @ esk3_0 ) )
      & ( ~ ( X33 @ ( esk7_1 @ X33 ) @ ( esk9_1 @ X33 ) )
        | ~ ( epred1_0 @ X33 )
        | ( X33 @ esk2_0 @ esk3_0 ) )
      & ( ~ ( epred2_0 @ X38 @ X39 )
        | ~ ( epred2_0 @ X39 @ X40 )
        | ( epred2_0 @ X38 @ X40 ) )
      & ( epred1_0 @ epred2_0 )
      & ~ ( epred2_0 @ esk1_0 @ esk3_0 ) ),
    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_1])])])])])]) ).

thf(c_0_3,negated_conjecture,
    ! [X2: a,X3: a,X4: a] :
      ( ( epred2_0 @ X2 @ X4 )
      | ~ ( epred2_0 @ X2 @ X3 )
      | ~ ( epred2_0 @ X3 @ X4 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X5: a > a > $o] :
      ( ( X5 @ ( esk8_1 @ X5 ) @ ( esk9_1 @ X5 ) )
      | ( X5 @ esk2_0 @ esk3_0 )
      | ~ ( epred1_0 @ X5 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    epred1_0 @ epred2_0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    ! [X5: a > a > $o] :
      ( ( X5 @ esk2_0 @ esk3_0 )
      | ~ ( X5 @ ( esk7_1 @ X5 ) @ ( esk9_1 @ X5 ) )
      | ~ ( epred1_0 @ X5 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_7,negated_conjecture,
    ! [X2: a] :
      ( ( epred2_0 @ X2 @ ( esk9_1 @ epred2_0 ) )
      | ( epred2_0 @ esk2_0 @ esk3_0 )
      | ~ ( epred2_0 @ X2 @ ( esk8_1 @ epred2_0 ) ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5])]) ).

thf(c_0_8,negated_conjecture,
    ! [X5: a > a > $o] :
      ( ( X5 @ ( esk5_1 @ X5 ) @ ( esk6_1 @ X5 ) )
      | ( X5 @ esk1_0 @ esk2_0 )
      | ~ ( epred1_0 @ X5 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_9,negated_conjecture,
    ( ( epred2_0 @ esk2_0 @ esk3_0 )
    | ~ ( epred2_0 @ ( esk7_1 @ epred2_0 ) @ ( esk8_1 @ epred2_0 ) ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_5])]) ).

thf(c_0_10,negated_conjecture,
    ! [X5: a > a > $o] :
      ( ( X5 @ ( esk7_1 @ X5 ) @ ( esk8_1 @ X5 ) )
      | ( X5 @ esk2_0 @ esk3_0 )
      | ~ ( epred1_0 @ X5 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_11,negated_conjecture,
    ! [X5: a > a > $o] :
      ( ( X5 @ esk1_0 @ esk2_0 )
      | ~ ( X5 @ ( esk4_1 @ X5 ) @ ( esk6_1 @ X5 ) )
      | ~ ( epred1_0 @ X5 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_12,negated_conjecture,
    ! [X2: a] :
      ( ( epred2_0 @ X2 @ ( esk6_1 @ epred2_0 ) )
      | ( epred2_0 @ esk1_0 @ esk2_0 )
      | ~ ( epred2_0 @ X2 @ ( esk5_1 @ epred2_0 ) ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_8]),c_0_5])]) ).

thf(c_0_13,negated_conjecture,
    epred2_0 @ esk2_0 @ esk3_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_5])]) ).

thf(c_0_14,negated_conjecture,
    ( ( epred2_0 @ esk1_0 @ esk2_0 )
    | ~ ( epred2_0 @ ( esk4_1 @ epred2_0 ) @ ( esk5_1 @ epred2_0 ) ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_5])]) ).

thf(c_0_15,negated_conjecture,
    ! [X5: a > a > $o] :
      ( ( X5 @ ( esk4_1 @ X5 ) @ ( esk5_1 @ X5 ) )
      | ( X5 @ esk1_0 @ esk2_0 )
      | ~ ( epred1_0 @ X5 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_16,negated_conjecture,
    ~ ( epred2_0 @ esk1_0 @ esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_17,negated_conjecture,
    ! [X2: a] :
      ( ( epred2_0 @ X2 @ esk3_0 )
      | ~ ( epred2_0 @ X2 @ esk2_0 ) ),
    inference(spm,[status(thm)],[c_0_3,c_0_13]) ).

thf(c_0_18,negated_conjecture,
    epred2_0 @ esk1_0 @ esk2_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_5])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV120^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.16  % Computer : n018.cluster.edu
% 0.08/0.16  % Model    : x86_64 x86_64
% 0.08/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.16  % Memory   : 8046.5625MB
% 0.08/0.16  % OS       : Linux 6.8.0-71-generic
% 0.08/0.16  % CPULimit : 300
% 0.08/0.16  % WCLimit  : 300
% 0.08/0.16  % DateTime : Tue Sep 29 15:14:11 UTC 2026
% 0.08/0.16  % CPUTime  : 
% 0.08/0.17  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21  Running higher-order theorem proving
% 0.08/0.22  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.NReiIaH4Ym/E---3.1_206193.p
% 0.08/0.24  % Version: 3.5.1-ho
% 0.08/0.24  % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.08/0.24  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24  % Starting sh2lt with 1200s (4) cores
% 0.08/0.24  % Starting new_ho_10_unif with 300s (1) cores
% 0.08/0.24  % Starting full_lambda_6 with 300s (1) cores
% 0.08/0.24  % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.24  % Starting ehoh_best3_rw with 300s (1) cores
% 0.08/0.24  % full_lambda_6 with pid 206223 completed with status 0
% 0.08/0.24  % Result found by full_lambda_6
% 0.08/0.24  % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.08/0.24  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24  % Starting sh2lt with 1200s (4) cores
% 0.08/0.24  % Starting new_ho_10_unif with 300s (1) cores
% 0.08/0.24  % Starting full_lambda_6 with 300s (1) cores
% 0.08/0.24  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,4,,4,20000,1.0,true))
% 0.08/0.24  % SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.08/0.24  % Search class: HGUNF-FFSF11-SHHFFMBN
% 0.08/0.24  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.24  % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.24  % SubtermCWHack with pid 206227 completed with status 0
% 0.08/0.24  % Result found by SubtermCWHack
% 0.08/0.24  % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.08/0.24  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24  % Starting sh2lt with 1200s (4) cores
% 0.08/0.24  % Starting new_ho_10_unif with 300s (1) cores
% 0.08/0.24  % Starting full_lambda_6 with 300s (1) cores
% 0.08/0.24  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,4,,4,20000,1.0,true))
% 0.08/0.24  % SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.08/0.24  % Search class: HGUNF-FFSF11-SHHFFMBN
% 0.08/0.24  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.24  % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.24  % Preprocessing time       : 0.001 s
% 0.08/0.24  
% 0.08/0.24  % Proof found!
% 0.08/0.24  % SZS status Theorem
% 0.08/0.24  % SZS output start CNFRefutation
% See solution above
% 0.08/0.24  % Parsed axioms                        : 2
% 0.08/0.24  % Removed by relevancy pruning/SinE    : 1
% 0.08/0.24  % Initial clauses                      : 9
% 0.08/0.24  % Removed in clause preprocessing      : 0
% 0.08/0.24  % Initial clauses in saturation        : 9
% 0.08/0.24  % Processed clauses                    : 19
% 0.08/0.24  % ...of these trivial                  : 0
% 0.08/0.24  % ...subsumed                          : 0
% 0.08/0.24  % ...remaining for further processing  : 19
% 0.08/0.24  % Other redundant clauses eliminated   : 0
% 0.08/0.24  % Clauses deleted for lack of memory   : 0
% 0.08/0.24  % Backward-subsumed                    : 0
% 0.08/0.24  % Backward-rewritten                   : 6
% 0.08/0.24  % Generated clauses                    : 18
% 0.08/0.24  % ...of the previous two non-redundant : 16
% 0.08/0.24  % ...aggressively subsumed             : 0
% 0.08/0.24  % Contextual simplify-reflections      : 0
% 0.08/0.24  % Paramodulations                      : 18
% 0.08/0.24  % Factorizations                       : 0
% 0.08/0.24  % NegExts                              : 0
% 0.08/0.24  % Equation resolutions                 : 0
% 0.08/0.24  % Disequality decompositions           : 0
% 0.08/0.24  % Total rewrite steps                  : 15
% 0.08/0.24  % ...of those cached                   : 12
% 0.08/0.24  % Propositional unsat checks           : 0
% 0.08/0.24  %    Propositional check models        : 0
% 0.08/0.24  %    Propositional check unsatisfiable : 0
% 0.08/0.24  %    Propositional clauses             : 0
% 0.08/0.24  %    Propositional clauses after purity: 0
% 0.08/0.24  %    Propositional unsat core size     : 0
% 0.08/0.24  %    Propositional preprocessing time  : 0.000
% 0.08/0.24  %    Propositional encoding time       : 0.000
% 0.08/0.24  %    Propositional solver time         : 0.000
% 0.08/0.24  %    Success case prop preproc time    : 0.000
% 0.08/0.24  %    Success case prop encoding time   : 0.000
% 0.08/0.24  %    Success case prop solver time     : 0.000
% 0.08/0.24  % Current number of processed clauses  : 13
% 0.08/0.24  %    Positive orientable unit clauses  : 3
% 0.08/0.24  %    Positive unorientable unit clauses: 0
% 0.08/0.24  %    Negative unit clauses             : 1
% 0.08/0.24  %    Non-unit-clauses                  : 9
% 0.08/0.24  % Current number of unprocessed clauses: 5
% 0.08/0.24  % ...number of literals in the above   : 18
% 0.08/0.24  % Current number of archived formulas  : 0
% 0.08/0.24  % Current number of archived clauses   : 6
% 0.08/0.24  % Clause-clause subsumption calls (NU) : 13
% 0.08/0.24  % Rec. Clause-clause subsumption calls : 13
% 0.08/0.24  % Non-unit clause-clause subsumptions  : 0
% 0.08/0.24  % Unit Clause-clause subsumption calls : 0
% 0.08/0.24  % Rewrite failures with RHS unbound    : 0
% 0.08/0.24  % BW rewrite match attempts            : 2
% 0.08/0.24  % BW rewrite match successes           : 2
% 0.08/0.24  % Condensation attempts                : 0
% 0.08/0.24  % Condensation successes               : 0
% 0.08/0.24  % Termbank termtop insertions          : 1527
% 0.08/0.24  % Search garbage collected termcells   : 347
% 0.08/0.24  
% 0.08/0.24  % -------------------------------------------------
% 0.08/0.24  % User time                : 0.005 s
% 0.08/0.24  % System time              : 0.001 s
% 0.08/0.24  % Total time               : 0.005 s
% 0.08/0.24  % Maximum resident set size: 3584 pages
% 0.08/0.24  
% 0.08/0.24  % -------------------------------------------------
% 0.08/0.24  % User time                : 0.006 s
% 0.08/0.24  % System time              : 0.006 s
% 0.08/0.24  % Total time               : 0.011 s
% 0.08/0.24  % Maximum resident set size: 4864 pages
% 0.08/0.24  % E exiting
%------------------------------------------------------------------------------