↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEV054^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 : n008.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:34:47 AM UTC 2026

% Result   : Theorem 0.23s 0.27s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    6 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   13 (   0 equ;   0 cnn)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  130 (   9   ~;   7   |;  11   &;  89   @)
%                                         (   0 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (  10 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   14 (  14   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   38 (   0   ^;  36   !;   2   ?;  38   :)

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

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

thf(decl_24,type,
    esk1_0: ( a > $o ) > a ).

thf(decl_25,type,
    esk2_2: ( a > $o ) > a > a ).

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

thf(cTHM403_pme,conjecture,
    ! [X1: a > a > $o,X2: ( a > $o ) > a] :
      ( ( ! [X3: a,X4: a,X5: a] :
            ( ( ( X1 @ X3 @ X4 )
              & ( X1 @ X4 @ X5 ) )
           => ( X1 @ X3 @ X5 ) )
        & ! [X6: a > $o] :
            ( ! [X5: a] :
                ( ( X6 @ X5 )
               => ( X1 @ X5 @ ( X2 @ X6 ) ) )
            & ! [X7: a] :
                ( ! [X8: a] :
                    ( ( X6 @ X8 )
                   => ( X1 @ X8 @ X7 ) )
               => ( X1 @ ( X2 @ X6 ) @ X7 ) ) ) )
     => ! [X9: a > a] :
          ( ! [X3: a,X4: a] :
              ( ( X1 @ X3 @ X4 )
             => ( X1 @ ( X9 @ X3 ) @ ( X9 @ X4 ) ) )
         => ? [X10: a] : ( X1 @ ( X9 @ X10 ) @ X10 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.Lc6kjy6dLm/E---3.1_3277363.p',cTHM403_pme) ).

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

thf(c_0_2,negated_conjecture,
    ! [X26: a,X27: a,X28: a,X29: a > $o,X30: a,X31: a,X34: a,X35: a,X36: a] :
      ( ( ~ ( epred1_0 @ X26 @ X27 )
        | ~ ( epred1_0 @ X27 @ X28 )
        | ( epred1_0 @ X26 @ X28 ) )
      & ( ~ ( X29 @ X30 )
        | ( epred1_0 @ X30 @ ( esk1_0 @ X29 ) ) )
      & ( ( X29 @ ( esk2_2 @ X29 @ X31 ) )
        | ( epred1_0 @ ( esk1_0 @ X29 ) @ X31 ) )
      & ( ~ ( epred1_0 @ ( esk2_2 @ X29 @ X31 ) @ X31 )
        | ( epred1_0 @ ( esk1_0 @ X29 ) @ X31 ) )
      & ( ~ ( epred1_0 @ X34 @ X35 )
        | ( epred1_0 @ ( esk3_0 @ X34 ) @ ( esk3_0 @ X35 ) ) )
      & ~ ( epred1_0 @ ( esk3_0 @ X36 ) @ X36 ) ),
    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,
    ! [X3: a] :
      ~ ( epred1_0 @ ( esk3_0 @ X3 ) @ X3 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X6: a > $o,X3: a] :
      ( ( epred1_0 @ X3 @ ( esk1_0 @ X6 ) )
      | ~ ( X6 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    $false,
    inference(flex_resolve,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4])]),
    [proof] ).

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