↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n005.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:28 AM UTC 2026

% Result   : Theorem 0.06s 0.25s
% Output   : CNFRefutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   13 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   27 (  14 equ;   0 cnn)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   53 (   7   ~;   3   |;   7   &;  24   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    5 (   5   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   22 (   4   ^;  15   !;   3   ?;  22   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_23,type,
    exu: ( $i > $o ) > $o ).

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

thf(decl_25,type,
    esk1_0: $i ).

thf(decl_26,type,
    esk2_0: $i ).

thf(decl_27,type,
    esk3_0: $i ).

thf(exuE3u,conjecture,
    ! [X1: $i > $o] :
      ( ( exu
        @ ^ [X2: $i] : ( X1 @ X2 ) )
     => ! [X2: $i,X3: $i] :
          ( ( X1 @ X2 )
         => ( ( X1 @ X3 )
           => ( X2 = X3 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.fHcznBemrR/E---3.1_1698072.p',exuE3u) ).

thf(exu,axiom,
    ( exu
    = ( ^ [X1: $i > $o] :
        ? [X2: $i] :
          ( ( X1 @ X2 )
          & ! [X3: $i] :
              ( ( X1 @ X3 )
             => ( X2 = X3 ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.fHcznBemrR/E---3.1_1698072.p',exu) ).

thf(c_0_2,negated_conjecture,
    ~ ! [X1: $i > $o] :
        ( ( exu
          @ ^ [X2: $i] : ( X1 @ X2 ) )
       => ! [X2: $i,X3: $i] :
            ( ( X1 @ X2 )
           => ( ( X1 @ X3 )
             => ( X2 = X3 ) ) ) ),
    inference(assume_negation,[status(cth)],[exuE3u]) ).

thf(c_0_3,plain,
    ( exu
    = ( ^ [Z0: $i > $o] :
        ? [X2: $i] :
          ( ( Z0 @ X2 )
          & ! [X3: $i] :
              ( ( Z0 @ X3 )
             => ( X2 = X3 ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[exu]) ).

thf(c_0_4,negated_conjecture,
    ~ ! [X1: $i > $o] :
        ( ? [X7: $i] :
            ( ( X1 @ X7 )
            & ! [X8: $i] :
                ( ( X1 @ X8 )
               => ( X7 = X8 ) ) )
       => ! [X2: $i,X3: $i] :
            ( ( X1 @ X2 )
           => ( ( X1 @ X3 )
             => ( X2 = X3 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2]),c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ! [X11: $i] :
      ( ( epred1_0 @ esk1_0 )
      & ( ~ ( epred1_0 @ X11 )
        | ( esk1_0 = X11 ) )
      & ( epred1_0 @ esk2_0 )
      & ( epred1_0 @ esk3_0 )
      & ( esk2_0 != esk3_0 ) ),
    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_4])])])])]) ).

thf(c_0_6,negated_conjecture,
    ! [X2: $i] :
      ( ( esk1_0 = X2 )
      | ~ ( epred1_0 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_7,negated_conjecture,
    epred1_0 @ esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_8,negated_conjecture,
    esk1_0 = esk3_0,
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

thf(c_0_9,negated_conjecture,
    ! [X2: $i] :
      ( ( esk3_0 = X2 )
      | ~ ( epred1_0 @ X2 ) ),
    inference(rw,[status(thm)],[c_0_6,c_0_8]) ).

thf(c_0_10,negated_conjecture,
    epred1_0 @ esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_11,negated_conjecture,
    esk2_0 != esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_12,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU549^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.17  % Computer : n005.cluster.edu
% 0.06/0.17  % Model    : x86_64 x86_64
% 0.06/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17  % Memory   : 8046.5625MB
% 0.06/0.17  % OS       : Linux 6.8.0-71-generic
% 0.06/0.17  % CPULimit : 300
% 0.06/0.17  % WCLimit  : 300
% 0.06/0.17  % DateTime : Tue Sep 29 13:49:31 UTC 2026
% 0.06/0.17  % CPUTime  : 
% 0.06/0.17  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.22  Running higher-order theorem proving
% 0.06/0.23  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.fHcznBemrR/E---3.1_1698072.p
% 0.06/0.25  % Version: 3.5.1-ho
% 0.06/0.25  % Preprocessing class: HSSSSMSSSLSNHSA.
% 0.06/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.25  % Starting post_as_ho12 with 1500s (5) cores
% 0.06/0.25  % Starting post_as_ho4 with 300s (1) cores
% 0.06/0.25  % Starting lpo8_s with 300s (1) cores
% 0.06/0.25  % Starting sh5l with 300s (1) cores
% 0.06/0.25  % lpo8_s with pid 1698087 completed with status 0
% 0.06/0.25  % Result found by lpo8_s
% 0.06/0.25  % Preprocessing class: HSSSSMSSSLSNHSA.
% 0.06/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.25  % Starting post_as_ho12 with 1500s (5) cores
% 0.06/0.25  % Starting post_as_ho4 with 300s (1) cores
% 0.06/0.25  % Starting lpo8_s with 300s (1) cores
% 0.06/0.25  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,4.0,,6,20000,1.0))
% 0.06/0.25  % SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.06/0.25  % Search class: HHUSF-FFSS00-SHSFMFNN
% 0.06/0.25  % partial match(2): HHUNF-FFSS00-SHSSMFNN
% 0.06/0.25  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.25  % Starting SubtermCWHack with 28s (1) cores
% 0.06/0.25  % SubtermCWHack with pid 1698089 completed with status 0
% 0.06/0.25  % Result found by SubtermCWHack
% 0.06/0.25  % Preprocessing class: HSSSSMSSSLSNHSA.
% 0.06/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.25  % Starting post_as_ho12 with 1500s (5) cores
% 0.06/0.25  % Starting post_as_ho4 with 300s (1) cores
% 0.06/0.25  % Starting lpo8_s with 300s (1) cores
% 0.06/0.25  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,4.0,,6,20000,1.0))
% 0.06/0.25  % SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.06/0.25  % Search class: HHUSF-FFSS00-SHSFMFNN
% 0.06/0.25  % partial match(2): HHUNF-FFSS00-SHSSMFNN
% 0.06/0.25  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.25  % Starting SubtermCWHack with 28s (1) cores
% 0.06/0.25  % Preprocessing time       : 0.001 s
% 0.06/0.25  
% 0.06/0.25  % Proof found!
% 0.06/0.25  % SZS status Theorem
% 0.06/0.25  % SZS output start CNFRefutation
% See solution above
% 0.06/0.25  % Parsed axioms                        : 3
% 0.06/0.25  % Removed by relevancy pruning/SinE    : 1
% 0.06/0.25  % Initial clauses                      : 5
% 0.06/0.25  % Removed in clause preprocessing      : 0
% 0.06/0.25  % Initial clauses in saturation        : 5
% 0.06/0.25  % Processed clauses                    : 7
% 0.06/0.25  % ...of these trivial                  : 0
% 0.06/0.25  % ...subsumed                          : 0
% 0.06/0.25  % ...remaining for further processing  : 7
% 0.06/0.25  % Other redundant clauses eliminated   : 0
% 0.06/0.25  % Clauses deleted for lack of memory   : 0
% 0.06/0.25  % Backward-subsumed                    : 0
% 0.06/0.25  % Backward-rewritten                   : 2
% 0.06/0.25  % Generated clauses                    : 3
% 0.06/0.25  % ...of the previous two non-redundant : 3
% 0.06/0.25  % ...aggressively subsumed             : 0
% 0.06/0.25  % Contextual simplify-reflections      : 0
% 0.06/0.25  % Paramodulations                      : 3
% 0.06/0.25  % Factorizations                       : 0
% 0.06/0.25  % NegExts                              : 0
% 0.06/0.25  % Equation resolutions                 : 0
% 0.06/0.25  % Disequality decompositions           : 0
% 0.06/0.25  % Total rewrite steps                  : 3
% 0.06/0.25  % ...of those cached                   : 1
% 0.06/0.25  % Propositional unsat checks           : 0
% 0.06/0.25  %    Propositional check models        : 0
% 0.06/0.25  %    Propositional check unsatisfiable : 0
% 0.06/0.25  %    Propositional clauses             : 0
% 0.06/0.25  %    Propositional clauses after purity: 0
% 0.06/0.25  %    Propositional unsat core size     : 0
% 0.06/0.25  %    Propositional preprocessing time  : 0.000
% 0.06/0.25  %    Propositional encoding time       : 0.000
% 0.06/0.25  %    Propositional solver time         : 0.000
% 0.06/0.25  %    Success case prop preproc time    : 0.000
% 0.06/0.25  %    Success case prop encoding time   : 0.000
% 0.06/0.25  %    Success case prop solver time     : 0.000
% 0.06/0.25  % Current number of processed clauses  : 5
% 0.06/0.25  %    Positive orientable unit clauses  : 3
% 0.06/0.25  %    Positive unorientable unit clauses: 0
% 0.06/0.25  %    Negative unit clauses             : 1
% 0.06/0.25  %    Non-unit-clauses                  : 1
% 0.06/0.25  % Current number of unprocessed clauses: 0
% 0.06/0.25  % ...number of literals in the above   : 0
% 0.06/0.25  % Current number of archived formulas  : 0
% 0.06/0.25  % Current number of archived clauses   : 2
% 0.06/0.25  % Clause-clause subsumption calls (NU) : 0
% 0.06/0.25  % Rec. Clause-clause subsumption calls : 0
% 0.06/0.25  % Non-unit clause-clause subsumptions  : 0
% 0.06/0.25  % Unit Clause-clause subsumption calls : 0
% 0.06/0.25  % Rewrite failures with RHS unbound    : 0
% 0.06/0.25  % BW rewrite match attempts            : 1
% 0.06/0.25  % BW rewrite match successes           : 1
% 0.06/0.25  % Condensation attempts                : 0
% 0.06/0.25  % Condensation successes               : 0
% 0.06/0.25  % Termbank termtop insertions          : 411
% 0.06/0.25  % Search garbage collected termcells   : 175
% 0.06/0.25  
% 0.06/0.25  % -------------------------------------------------
% 0.06/0.25  % User time                : 0.002 s
% 0.06/0.25  % System time              : 0.001 s
% 0.06/0.25  % Total time               : 0.004 s
% 0.06/0.25  % Maximum resident set size: 3884 pages
% 0.06/0.25  
% 0.06/0.25  % -------------------------------------------------
% 0.06/0.25  % User time                : 0.004 s
% 0.06/0.25  % System time              : 0.006 s
% 0.06/0.25  % Total time               : 0.010 s
% 0.06/0.25  % Maximum resident set size: 4608 pages
% 0.06/0.25  % E exiting
%------------------------------------------------------------------------------