↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEU484^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n017.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:24:04 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(decl_28,type,
    refl: ( $i > $i > $o ) > $o ).

thf(decl_42,type,
    term: ( $i > $i > $o ) > $o ).

thf(decl_52,type,
    epred1_0: $i > $i > $o ).

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

thf(reflexive_implies_non_terminating,conjecture,
    ! [X1: $i > $i > $o] :
      ( ( refl @ X1 )
     => ~ ( term @ X1 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.vvg0jJDbuw/E---3.1_353682.p',reflexive_implies_non_terminating) ).

thf(reflexive,axiom,
    ( refl
    = ( ^ [X1: $i > $i > $o] :
        ! [X3: $i] : ( X1 @ X3 @ X3 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.vvg0jJDbuw/E---3.1_353682.p',reflexive) ).

thf(terminating,axiom,
    ( term
    = ( ^ [X1: $i > $i > $o] :
        ! [X7: $i > $o] :
          ( ? [X3: $i] : ( X7 @ X3 )
         => ? [X3: $i] :
              ( ( X7 @ X3 )
              & ! [X4: $i] :
                  ( ( X7 @ X4 )
                 => ~ ( X1 @ X3 @ X4 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.vvg0jJDbuw/E---3.1_353682.p',terminating) ).

thf(c_0_3,negated_conjecture,
    ~ ! [X1: $i > $i > $o] :
        ( ( refl @ X1 )
       => ~ ( term @ X1 ) ),
    inference(assume_negation,[status(cth)],[reflexive_implies_non_terminating]) ).

thf(c_0_4,plain,
    ( refl
    = ( ^ [Z0: $i > $i > $o] :
        ! [X3: $i] : ( Z0 @ X3 @ X3 ) ) ),
    inference(fof_simplification,[status(thm)],[reflexive]) ).

thf(c_0_5,plain,
    ( term
    = ( ^ [Z0: $i > $i > $o] :
        ! [X7: $i > $o] :
          ( ? [X3: $i] : ( X7 @ X3 )
         => ? [X3: $i] :
              ( ( X7 @ X3 )
              & ! [X4: $i] :
                  ( ( X7 @ X4 )
                 => ~ ( Z0 @ X3 @ X4 ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[terminating]) ).

thf(c_0_6,negated_conjecture,
    ~ ! [X1: $i > $i > $o] :
        ( ! [X158: $i] : ( X1 @ X158 @ X158 )
       => ~ ! [X159: $i > $o] :
              ( ? [X160: $i] : ( X159 @ X160 )
             => ? [X161: $i] :
                  ( ( X159 @ X161 )
                  & ! [X162: $i] :
                      ( ( X159 @ X162 )
                     => ~ ( X1 @ X161 @ X162 ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).

thf(c_0_7,negated_conjecture,
    ! [X164: $i,X165: $i > $o,X166: $i,X168: $i] :
      ( ( epred1_0 @ X164 @ X164 )
      & ( ( X165 @ ( esk1_1 @ X165 ) )
        | ~ ( X165 @ X166 ) )
      & ( ~ ( X165 @ X168 )
        | ~ ( epred1_0 @ ( esk1_1 @ X165 ) @ X168 )
        | ~ ( X165 @ X166 ) ) ),
    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_6])])])])])]) ).

thf(c_0_8,negated_conjecture,
    ! [X3: $i,X7: $i > $o,X4: $i] :
      ( ~ ( X7 @ X3 )
      | ~ ( epred1_0 @ ( esk1_1 @ X7 ) @ X3 )
      | ~ ( X7 @ X4 ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_9,negated_conjecture,
    ! [X3: $i] : ( epred1_0 @ X3 @ X3 ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_10,negated_conjecture,
    $false,
    inference(flex_resolve,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU484^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19  % Computer : n017.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Tue Sep 29 13:38:52 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.24  Running higher-order theorem proving
% 0.08/0.26  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.vvg0jJDbuw/E---3.1_353682.p
% 0.23/0.28  % Version: 3.5.1-ho
% 0.23/0.28  % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.23/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.28  % Starting new_ho_9 with 1500s (5) cores
% 0.23/0.28  % Starting post_as_ho1 with 300s (1) cores
% 0.23/0.28  % Starting sh1l with 300s (1) cores
% 0.23/0.28  % Starting post_as_ho10 with 300s (1) cores
% 0.23/0.28  % post_as_ho1 with pid 353716 completed with status 0
% 0.23/0.28  % Result found by post_as_ho1
% 0.23/0.28  % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.23/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.28  % Starting new_ho_9 with 1500s (5) cores
% 0.23/0.28  % Starting post_as_ho1 with 300s (1) cores
% 0.23/0.28  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.28  % No SInE strategy applied
% 0.23/0.28  % Search class: HHHNF-FFSF11-SHSSMMBC
% 0.23/0.28  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.28  % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.28  % SubtermCWHack with pid 353722 completed with status 0
% 0.23/0.28  % Result found by SubtermCWHack
% 0.23/0.28  % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.23/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.28  % Starting new_ho_9 with 1500s (5) cores
% 0.23/0.28  % Starting post_as_ho1 with 300s (1) cores
% 0.23/0.28  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.28  % No SInE strategy applied
% 0.23/0.28  % Search class: HHHNF-FFSF11-SHSSMMBC
% 0.23/0.28  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.28  % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.28  % Preprocessing time       : 0.001 s
% 0.23/0.28  
% 0.23/0.28  % Proof found!
% 0.23/0.28  % SZS status Theorem
% 0.23/0.28  % SZS output start CNFRefutation
% See solution above
% 0.23/0.28  % Parsed axioms                        : 59
% 0.23/0.28  % Removed by relevancy pruning/SinE    : 0
% 0.23/0.28  % Initial clauses                      : 32
% 0.23/0.28  % Removed in clause preprocessing      : 29
% 0.23/0.28  % Initial clauses in saturation        : 3
% 0.23/0.28  % Processed clauses                    : 5
% 0.23/0.28  % ...of these trivial                  : 0
% 0.23/0.28  % ...subsumed                          : 0
% 0.23/0.28  % ...remaining for further processing  : 4
% 0.23/0.28  % Other redundant clauses eliminated   : 0
% 0.23/0.28  % Clauses deleted for lack of memory   : 0
% 0.23/0.28  % Backward-subsumed                    : 0
% 0.23/0.28  % Backward-rewritten                   : 0
% 0.23/0.28  % Generated clauses                    : 4
% 0.23/0.28  % ...of the previous two non-redundant : 3
% 0.23/0.28  % ...aggressively subsumed             : 0
% 0.23/0.28  % Contextual simplify-reflections      : 0
% 0.23/0.28  % Paramodulations                      : 4
% 0.23/0.28  % Factorizations                       : 0
% 0.23/0.28  % NegExts                              : 0
% 0.23/0.28  % Equation resolutions                 : 0
% 0.23/0.28  % Disequality decompositions           : 0
% 0.23/0.28  % Total rewrite steps                  : 1
% 0.23/0.28  % ...of those cached                   : 0
% 0.23/0.28  % Propositional unsat checks           : 0
% 0.23/0.28  %    Propositional check models        : 0
% 0.23/0.28  %    Propositional check unsatisfiable : 0
% 0.23/0.28  %    Propositional clauses             : 0
% 0.23/0.28  %    Propositional clauses after purity: 0
% 0.23/0.28  %    Propositional unsat core size     : 0
% 0.23/0.28  %    Propositional preprocessing time  : 0.000
% 0.23/0.28  %    Propositional encoding time       : 0.000
% 0.23/0.28  %    Propositional solver time         : 0.000
% 0.23/0.28  %    Success case prop preproc time    : 0.000
% 0.23/0.28  %    Success case prop encoding time   : 0.000
% 0.23/0.28  %    Success case prop solver time     : 0.000
% 0.23/0.28  % Current number of processed clauses  : 4
% 0.23/0.28  %    Positive orientable unit clauses  : 2
% 0.23/0.28  %    Positive unorientable unit clauses: 0
% 0.23/0.28  %    Negative unit clauses             : 0
% 0.23/0.28  %    Non-unit-clauses                  : 2
% 0.23/0.28  % Current number of unprocessed clauses: 1
% 0.23/0.28  % ...number of literals in the above   : 2
% 0.23/0.28  % Current number of archived formulas  : 0
% 0.23/0.28  % Current number of archived clauses   : 0
% 0.23/0.28  % Clause-clause subsumption calls (NU) : 1
% 0.23/0.28  % Rec. Clause-clause subsumption calls : 1
% 0.23/0.28  % Non-unit clause-clause subsumptions  : 0
% 0.23/0.28  % Unit Clause-clause subsumption calls : 0
% 0.23/0.28  % Rewrite failures with RHS unbound    : 0
% 0.23/0.28  % BW rewrite match attempts            : 0
% 0.23/0.28  % BW rewrite match successes           : 0
% 0.23/0.28  % Condensation attempts                : 0
% 0.23/0.28  % Condensation successes               : 0
% 0.23/0.28  % Termbank termtop insertions          : 3034
% 0.23/0.28  % Search garbage collected termcells   : 703
% 0.23/0.28  
% 0.23/0.28  % -------------------------------------------------
% 0.23/0.28  % User time                : 0.005 s
% 0.23/0.28  % System time              : 0.003 s
% 0.23/0.28  % Total time               : 0.008 s
% 0.23/0.28  % Maximum resident set size: 3944 pages
% 0.23/0.28  
% 0.23/0.28  % -------------------------------------------------
% 0.23/0.28  % User time                : 0.006 s
% 0.23/0.28  % System time              : 0.008 s
% 0.23/0.28  % Total time               : 0.014 s
% 0.23/0.28  % Maximum resident set size: 4864 pages
% 0.23/0.28  % E exiting
%------------------------------------------------------------------------------