TSTP Solution File: SET099-6 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET099-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 04:27:14 EDT 2022
% Result : Timeout 291.05s 291.44s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET099-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 9 21:32:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.74/1.01 ============================== Prover9 ===============================
% 0.74/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.01 Process 22247 was started by sandbox on n018.cluster.edu,
% 0.74/1.01 Sat Jul 9 21:32:57 2022
% 0.74/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22093_n018.cluster.edu".
% 0.74/1.01 ============================== end of head ===========================
% 0.74/1.01
% 0.74/1.01 ============================== INPUT =================================
% 0.74/1.01
% 0.74/1.01 % Reading from file /tmp/Prover9_22093_n018.cluster.edu
% 0.74/1.01
% 0.74/1.01 set(prolog_style_variables).
% 0.74/1.01 set(auto2).
% 0.74/1.01 % set(auto2) -> set(auto).
% 0.74/1.01 % set(auto) -> set(auto_inference).
% 0.74/1.01 % set(auto) -> set(auto_setup).
% 0.74/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.01 % set(auto) -> set(auto_limits).
% 0.74/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.01 % set(auto) -> set(auto_denials).
% 0.74/1.01 % set(auto) -> set(auto_process).
% 0.74/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.01 % set(auto2) -> assign(stats, some).
% 0.74/1.01 % set(auto2) -> clear(echo_input).
% 0.74/1.01 % set(auto2) -> set(quiet).
% 0.74/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.01 % set(auto2) -> clear(print_given).
% 0.74/1.01 assign(lrs_ticks,-1).
% 0.74/1.01 assign(sos_limit,10000).
% 0.74/1.01 assign(order,kbo).
% 0.74/1.01 set(lex_order_vars).
% 0.74/1.01 clear(print_given).
% 0.74/1.01
% 0.74/1.01 % formulas(sos). % not echoed (94 formulas)
% 0.74/1.01
% 0.74/1.01 ============================== end of input ==========================
% 0.74/1.01
% 0.74/1.01 % From the command line: assign(max_seconds, 300).
% 0.74/1.01
% 0.74/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.01
% 0.74/1.01 % Formulas that are not ordinary clauses:
% 0.74/1.01
% 0.74/1.01 ============================== end of process non-clausal formulas ===
% 0.74/1.01
% 0.74/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.01
% 0.74/1.01 ============================== PREDICATE ELIMINATION =================
% 0.74/1.01 1 -inductive(A) | member(null_class,A) # label(inductive1) # label(axiom). [assumption].
% 0.74/1.01 2 inductive(omega) # label(omega_is_inductive1) # label(axiom). [assumption].
% 0.74/1.01 Derived: member(null_class,omega). [resolve(1,a,2,a)].
% 0.74/1.01 3 -inductive(A) | subclass(omega,A) # label(omega_is_inductive2) # label(axiom). [assumption].
% 0.74/1.01 Derived: subclass(omega,omega). [resolve(3,a,2,a)].
% 0.74/1.01 4 -inductive(A) | subclass(image(successor_relation,A),A) # label(inductive2) # label(axiom). [assumption].
% 0.74/1.01 Derived: subclass(image(successor_relation,omega),omega). [resolve(4,a,2,a)].
% 0.74/1.01 5 -member(null_class,A) | -subclass(image(successor_relation,A),A) | inductive(A) # label(inductive3) # label(axiom). [assumption].
% 0.74/1.01 Derived: -member(null_class,A) | -subclass(image(successor_relation,A),A) | subclass(omega,A). [resolve(5,c,3,a)].
% 0.74/1.01 6 -function(inverse(A)) | -function(A) | one_to_one(A) # label(one_to_one3) # label(axiom). [assumption].
% 0.74/1.01 7 -one_to_one(A) | function(A) # label(one_to_one1) # label(axiom). [assumption].
% 0.74/1.01 8 -one_to_one(A) | function(inverse(A)) # label(one_to_one2) # label(axiom). [assumption].
% 0.74/1.01 9 -function(A) | subclass(A,cross_product(universal_class,universal_class)) # label(function1) # label(axiom). [assumption].
% 0.74/1.01 10 function(choice) # label(choice1) # label(axiom). [assumption].
% 0.74/1.01 11 -operation(A) | function(A) # label(operation1) # label(axiom). [assumption].
% 0.74/1.01 12 -compatible(A,B,C) | function(A) # label(compatible1) # label(axiom). [assumption].
% 0.74/1.01 Derived: subclass(choice,cross_product(universal_class,universal_class)). [resolve(9,a,10,a)].
% 0.74/1.01 Derived: subclass(A,cross_product(universal_class,universal_class)) | -operation(A). [resolve(9,a,11,b)].
% 0.74/1.01 Derived: subclass(A,cross_product(universal_class,universal_class)) | -compatible(A,B,C). [resolve(9,a,12,b)].
% 0.74/1.01 13 -function(A) | subclass(compose(A,inverse(A)),identity_relation) # label(function2) # label(axiom). [assumption].
% 0.74/1.01 Derived: subclass(compose(choice,inverse(choice)),identity_relation). [resolve(13,a,10,a)].
% 0.74/1.01 Derived: subclass(compose(A,inverse(A)),identity_relation) | -operation(A). [resolve(13,a,11,b)].
% 0.74/1.01 Derived: subclass(compose(A,inverse(A)),identity_relation) | -compatible(A,B,C). [resolve(13,a,12,b)].
% 0.74/1.01 14 -function(A) | -member(B,universal_class) | member(image(A,B),universal_class) # label(replacement) # label(axiom). [assumption].
% 0.74/1.01 Derived: -member(A,universal_class) | member(image(choice,A),universal_class). [resolve(14,a,10,a)].
% 0.74/1.01 Derived: -member(A,universal_class) | member(image(B,A),universal_class) | -operation(B). [resolve(14,a,11,b)].
% 0.74/1.01 Derived: -member(A,universal_class) | member(image(B,A),universal_class) | -compatible(B,C,D). [resolve(14,a,12,b)].
% 0.74/1.01 15 -subclass(A,cross_product(universal_class,universal_class)) | -subclass(compose(A,inverse(A)),identity_relation) | function(A) # label(function3) # label(axiom). [assumption].
% 0.74/1.01 Derived: -subclass(A,cross_product(universal_class,universal_class)) | -subclass(compose(A,inverse(A)),identity_relation) | -member(B,universal_class) | member(image(A,B),universal_class). [resolve(15,c,14,a)].
% 0.74/1.01 16 -function(A) | domain_of(domain_of(B)) != domain_of(A) | -subclass(range_of(A),domain_of(domain_of(C))) | compatible(A,B,C) # label(compatible4) # label(axiom). [assumption].
% 0.74/1.01 Derived: domain_of(domain_of(A)) != domain_of(choice) | -subclass(range_of(choice),domain_of(domain_of(B))) | compatible(choice,A,B). [resolve(16,a,10,a)].
% 0.74/1.01 Derived: domain_of(domain_of(A)) != domain_of(B) | -subclass(range_of(B),domain_of(domain_of(C))) | compatible(B,A,C) | -operation(B). [resolve(16,a,11,b)].
% 0.74/1.01 Derived: domain_of(domain_of(A)) != domain_of(B) | -subclass(range_of(B),domain_of(domain_of(C))) | compatible(B,A,C) | -compatible(B,D,E). [resolve(16,a,12,b)].
% 0.74/1.01 Derived: domain_of(domain_of(A)) != domain_of(B) | -subclass(range_of(B),domain_of(domain_of(C))) | compatible(B,A,C) | -subclass(B,cross_product(universal_class,universal_class)) | -subclass(compose(B,inverse(B)),identity_relation). [resolve(16,a,15,c)].
% 0.74/1.01 17 -function(A) | cross_product(domain_of(domain_of(A)),domain_of(domain_of(A))) != domain_of(A) | -subclass(range_of(A),domain_of(domain_of(A))) | operation(A) # label(operation4) # label(axiom). [assumption].
% 0.74/1.01 Derived: cross_product(domain_of(domain_of(choice)),domain_of(domain_of(choice))) != domain_of(choice) | -subclass(range_of(choice),domain_of(domain_of(choice))) | operation(choice). [resolve(17,a,10,a)].
% 0.74/1.01 Derived: cross_product(domain_of(domain_of(A)),domain_of(domain_of(A))) != domain_of(A) | -subclass(range_of(A),domain_of(domain_of(A))) | operation(A) | -compatible(A,B,C). [resolve(17,a,12,b)].
% 0.74/1.01 Derived: cross_product(domain_of(domain_of(A)),domain_of(domain_of(A))) != domain_of(A) | -subclass(range_of(A),domain_of(domain_of(A))) | operation(A) | -subclass(A,cross_product(universal_class,universal_class)) | -subclass(compose(A,inverse(A)),identity_relation). [resolve(17,a,15,c)].
% 0.74/1.01 18 -operation(A) | -operation(B) | -compatible(C,A,B) | member(ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B)),domain_of(A)) | homomorphism(C,A,B) # label(homomorphism5) # label(axiom). [assumption].
% 0.74/1.01 19 -homomorphism(A,B,C) | operation(B) # label(homomorphism1) # label(axiom). [assumption].
% 0.74/1.01 20 -homomorphism(A,B,C) | operation(C) # label(homomorphism2) # label(axiom). [assumption].
% 0.74/1.01 21 -homomorphism(A,B,C) | compatible(A,B,C) # label(homomorphism3) # label(axiom). [assumption].
% 0.74/1.01 22 -homomorphism(A,B,C) | -member(ordered_pair(D,E),domain_of(B)) | apply(C,ordered_pair(apply(A,D),apply(A,E))) = apply(A,apply(B,ordered_pair(D,E))) # label(homomorphism4) # label(axiom). [assumption].
% 0.74/1.01 Derived: -member(ordered_pair(A,B),domain_of(C)) | apply(D,ordered_pair(apply(E,A),apply(E,B))) = apply(E,apply(C,ordered_pair(A,B))) | -operation(C) | -operation(D) | -compatible(E,C,D) | member(ordered_pair(not_homomorphism1(E,C,D),not_homomorphism2(E,C,D)),domain_of(C)). [resolve(22,a,18,e)].
% 291.05/291.44 23 -operation(A) | -operation(B) | -compatible(C,A,B) | apply(B,ordered_pair(apply(C,not_homomorphism1(C,A,B)),apply(C,not_homomorphism2(C,A,B)))) != apply(C,apply(A,ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B)))) | homomorphism(C,A,B) # label(homomorphism6) # label(axiom). [assumption].
% 291.05/291.44 Derived: -operation(A) | -operation(B) | -compatible(C,A,B) | apply(B,ordered_pair(apply(C,not_homomorphism1(C,A,B)),apply(C,not_homomorphism2(C,A,B)))) != apply(C,apply(A,ordered_pair(not_homomorphism1(C,A,B),not_homomorphism2(C,A,B)))) | -member(ordered_pair(D,E),domain_of(A)) | apply(B,ordered_pair(apply(C,D),apply(C,E))) = apply(C,apply(A,ordered_pair(D,E))). [resolve(23,e,22,a)].
% 291.05/291.44 24 -subclass(compose(A,inverse(A)),identity_relation) | single_valued_class(A) # label(single_valued_class2) # label(axiom). [assumption].
% 291.05/291.44 25 -single_valued_class(A) | subclass(compose(A,inverse(A)),identity_relation) # label(single_valued_class1) # label(axiom). [assumption].
% 291.05/291.44
% 291.05/291.44 ============================== end predicate elimination =============
% 291.05/291.44
% 291.05/291.44 Auto_denials: (non-Horn, no changes).
% 291.05/291.44
% 291.05/291.44 Term ordering decisions:
% 291.05/291.44 Function symbol KB weights: universal_class=1. choice=1. null_class=1. element_relation=1. identity_relation=1. omega=1. successor_relation=1. subset_relation=1. x=1. ordered_pair=1. cross_product=1. apply=1. intersection=1. image=1. compose=1. not_subclass_element=1. unordered_pair=1. union=1. symmetric_difference=1. domain_of=1. complement=1. inverse=1. range_of=1. singleton=1. flip=1. rotate=1. successor=1. sum_class=1. diagonalise=1. first=1. power_class=1. regular=1. second=1. cantor=1. restrict=1. not_homomorphism1=1. not_homomorphism2=1. domain=1. range=1.
% 291.05/291.44
% 291.05/291.44 ============================== end of process initial clauses ========
% 291.05/291.44
% 291.05/291.44 ============================== CLAUSES FOR SEARCH ====================
% 291.05/291.44
% 291.05/291.44 ============================== end of clauses for search =============
% 291.05/291.44
% 291.05/291.44 ============================== SEARCH ================================
% 291.05/291.44
% 291.05/291.44 % Starting search at 0.04 seconds.
% 291.05/291.44
% 291.05/291.44 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 100 (0.00 of 0.41 sec).
% 291.05/291.44
% 291.05/291.44 Low Water (keep): wt=84.000, iters=3339
% 291.05/291.44
% 291.05/291.44 Low Water (keep): wt=33.000, iters=3353
% 291.05/291.44
% 291.05/291.44 Low Water (keep): wt=31.000, iters=3553
% 291.05/291.44
% 291.05/291.44 Low Water (keep): wt=28.000, iters=3357
% 291.05/291.44
% 291.05/291.44 Low Water (keep): wt=19.000, iters=3447
% 291.05/291.44
% 291.05/291.44 Low Water (keep): wt=17.000, iters=3414
% 291.05/291.44
% 291.05/291.44 Low Water (keep): wt=13.000, iters=3339
% 291.05/291.44
% 291.05/291.44 Low Water (keep): wt=12.000, iters=3474
% 291.05/291.44
% 291.05/291.44 Low Water (keep): wt=11.000, iters=3355
% 291.05/291.44
% 291.05/291.44 Low Water (keep): wt=10.000, iters=3361
% 291.05/291.44
% 291.05/291.44 Low Water (displace): id=4914, wt=171.000
% 291.05/291.44
% 291.05/291.44 Low Water (displace): id=4911, wt=155.000
% 291.05/291.44
% 291.05/291.44 Low Water (displace): id=4088, wt=39.000
% 291.05/291.44
% 291.05/291.44 Low Water (displace): id=11326, wt=9.000
% 291.05/291.44
% 291.05/291.44 Low Water (displace): id=11839, wt=7.000
% 291.05/291.44
% 291.05/291.44 Low Water (keep): wt=9.000, iters=3337
% 291.05/291.44
% 291.05/291.44 Low Water (keep): wt=8.000, iters=3352
% 291.05/291.44
% 291.05/291.44 ============================== STATISTICS ============================
% 291.05/291.44
% 291.05/291.44 Given=41374. Generated=14405553. Kept=901750. proofs=0.
% 291.05/291.44 Usable=39134. Sos=9999. Demods=5550. Limbo=2055, Disabled=850679. Hints=0.
% 291.05/291.44 Kept_by_rule=0, Deleted_by_rule=28.
% 291.05/291.44 Forward_subsumed=2106369. Back_subsumed=54.
% 291.05/291.44 Sos_limit_deleted=11397406. Sos_displaced=843687. Sos_removed=0.
% 291.05/291.44 New_demodulators=9527 (1 lex), Back_demodulated=6714. Back_unit_deleted=107.
% 291.05/291.44 Demod_attempts=284735600. Demod_rewrites=1316834.
% 291.05/291.44 Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0.
% 291.05/291.44 Nonunit_fsub_feature_tests=138444. Nonunit_bsub_feature_tests=14708.
% 291.05/291.44 Megabytes=419.43.
% 291.05/291.44 User_CPU=282.79, System_CPU=7.58, Wall_clock=291.
% 291.05/291.44
% 291.05/291.44 Megs malloced by palloc(): 400.
% 291.05/291.44 type (bytes each) gets frees in use bytes
% 291.05/291.44 chunk ( 104) 1964 1964 0 0.0 K
% 291.05/291.44 string_buf ( 8) 1858 1858 0 0.0 K
% 291.05/291.44 token ( 20) 3906 3906 0 0.0 K
% 291.05/291.44 pterm ( 16) 2575 2575 0 0.0 K
% 291.05/291.44 hashtab ( 8) 0 0 0 0.0 K
% 291.05/291.44 hashnode ( 8) 0 0 0 0.0 K
% 291.05/291.44 term ( 20) 302197070 291733557 10463513 204365.5 K
% 291.05/291.44 term arg arrays: 40335.7 K
% 291.05/291.44 attribute ( 12) 240 0 240 2.8 K
% 291.05/291.44 ilist ( 8) 1524979200 1518843142 6136058 47938.0 K
% 291.05/291.44 plist ( 8) 12551665 11588310 963355 7526.2 K
% 291.05/291.44 i2list ( 12) 4176227 4176227 0 0.0 K
% 291.05/291.44 just ( 12) 16467835 15555258 912577 10694.3 K
% 291.05/291.44 parajust ( 16) 1008037 1006558 1479 23.1 K
% 291.05/291.44 instancejust ( 8) 0 0 0 0.0 K
% 291.05/291.44 ivyjust ( 24) 0 0 0 0.0 K
% 291.05/291.44 formula ( 28) 388 388 0 0.0 K
% 291.05/291.44 formula arg arrays: 0.0 K
% 291.05/291.44 topform ( 52) 14405685 13503817 901868 45798.0 K
% 291.05/291.44 clist_pos ( 20) 2703211 1795794 907417 17723.0 K
% 291.05/291.44 clist ( 16) 8 1 7 0.1 K
% 291.05/291.44 context ( 808) 56761926 56761923 3 2.4 K
% 291.05/291.44 trail ( 12) 164124360 164124357 3 0.0 K
% 291.05/291.44 ac_match_pos (70044) 0 0 0 0.0 K
% 291.05/291.44 ac_match_free_vars_pos (20020)
% 291.05/291.44 0 0 0 0.0 K
% 291.05/291.44 btm_state ( 60) 0 0 0 0.0 K
% 291.05/291.44 btu_state ( 60) 0 0 0 0.0 K
% 291.05/291.44 ac_position (285432) 0 0 0 0.0 K
% 291.05/291.44 fpa_trie ( 20) 743658 690619 53039 1035.9 K
% 291.05/291.44 fpa_state ( 28) 8379330 8379319 11 0.3 K
% 291.05/291.44 fpa_index ( 12) 10 0 10 0.1 K
% 291.05/291.44 fpa_chunk ( 20) 1540050 1472628 67422 1316.8 K
% 291.05/291.44 fpa_list ( 16) 715299 0 715299 11176.5 K
% 291.05/291.44 fpa_list chunks: 5778.4 K
% 291.05/291.44 discrim ( 12) 2811115 2684153 126962 1487.8 K
% 291.05/291.44 discrim_pos ( 16) 4613406 4613406 0 0.0 K
% 291.05/291.44 flat2 ( 32) 138120542 138120542 0 0.0 K
% 291.05/291.44 flat ( 48) 0 0 0 0.0 K
% 291.05/291.44 flatterm ( 32) 312265313 312265313 0 0.0 K
% 291.05/291.44 mindex ( 28) 13 0 13 0.4 K
% 291.05/291.44 mindex_pos ( 56) 23922380 23922378 2 0.1 K
% 291.05/291.44 lindex ( 12) 5 0 5 0.1 K
% 291.05/291.44 clash ( 40) 1011474 1011471 3 0.1 K
% 291.05/291.44 di_tree ( 12) 419363 133915 285448 3345.1 K
% 291.05/291.44 avl_node ( 20) 1799284 1779286 19998 390.6 K
% 291.05/291.44
% 291.05/291.44 Memory report, 20 @ 20 = 400 megs (400.00 megs used).
% 291.05/291.44 List 1, length 86, 0.3 K
% 291.05/291.44 List 2, length 165, 1.3 K
% 291.05/291.44 List 8, length 59, 1.8 K
% 291.05/291.44 List 10, length 3, 0.1 K
% 291.05/291.44 List 14, length 1, 0.1 K
% 291.05/291.44 List 16, length 65, 4.1 K
% 291.05/291.44 List 26, length 58, 5.9 K
% 291.05/291.44 List 32, length 41, 5.1 K
% 291.05/291.44 List 64, length 24, 6.0 K
% 291.05/291.44 List 128, length 4, 2.0 K
% 291.05/291.44 List 202, length 3, 2.4 K
% 291.05/291.44 List 256, length 235, 235.0 K
% 291.05/291.44
% 291.05/291.44 ============================== SELECTOR REPORT =======================
% 291.05/291.44 Sos_deleted=11397406, Sos_displaced=843687, Sos_size=9999
% 291.05/291.44 SELECTOR PART PRIORITY ORDER SIZE SELECTED
% 291.05/291.44 I 2147483647 high age 0 98
% 291.05/291.44 H 1 high weight 0 0
% 291.05/291.44 A 1 low age 9999 4587
% 291.05/291.44 F 4 low weight 2926 18345
% 291.05/291.44 T 4 low weight 7073 18344
% 291.05/291.44 ============================== end of selector report ================
% 291.05/291.44
% 291.05/291.44 ============================== end of statistics =====================
% 291.05/291.44
% 291.05/291.44 Exiting with failure.
% 291.05/291.44
% 291.05/291.44 Process 22247 exit (max_megs) Sat Jul 9 21:37:48 2022
% 291.05/291.44 Prover9 interrupted
%------------------------------------------------------------------------------