TSTP Solution File: SET116-6 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET116-6 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:27 EDT 2022
% Result : Unknown 132.47s 132.75s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET116-6 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.33 % Computer : n014.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Sat Jul 9 21:02:50 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.42/1.00 ============================== Prover9 ===============================
% 0.42/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.00 Process 13050 was started by sandbox2 on n014.cluster.edu,
% 0.42/1.00 Sat Jul 9 21:02:51 2022
% 0.42/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_12894_n014.cluster.edu".
% 0.42/1.00 ============================== end of head ===========================
% 0.42/1.00
% 0.42/1.00 ============================== INPUT =================================
% 0.42/1.00
% 0.42/1.00 % Reading from file /tmp/Prover9_12894_n014.cluster.edu
% 0.42/1.00
% 0.42/1.00 set(prolog_style_variables).
% 0.42/1.00 set(auto2).
% 0.42/1.00 % set(auto2) -> set(auto).
% 0.42/1.00 % set(auto) -> set(auto_inference).
% 0.42/1.00 % set(auto) -> set(auto_setup).
% 0.42/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.00 % set(auto) -> set(auto_limits).
% 0.42/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.00 % set(auto) -> set(auto_denials).
% 0.42/1.00 % set(auto) -> set(auto_process).
% 0.42/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.00 % set(auto2) -> assign(stats, some).
% 0.42/1.00 % set(auto2) -> clear(echo_input).
% 0.42/1.00 % set(auto2) -> set(quiet).
% 0.42/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.00 % set(auto2) -> clear(print_given).
% 0.42/1.00 assign(lrs_ticks,-1).
% 0.42/1.00 assign(sos_limit,10000).
% 0.42/1.00 assign(order,kbo).
% 0.42/1.00 set(lex_order_vars).
% 0.42/1.00 clear(print_given).
% 0.42/1.00
% 0.42/1.00 % formulas(sos). % not echoed (93 formulas)
% 0.42/1.00
% 0.42/1.00 ============================== end of input ==========================
% 0.42/1.00
% 0.42/1.00 % From the command line: assign(max_seconds, 300).
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.00
% 0.42/1.00 % Formulas that are not ordinary clauses:
% 0.42/1.00
% 0.42/1.00 ============================== end of process non-clausal formulas ===
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.00
% 0.42/1.00 ============================== PREDICATE ELIMINATION =================
% 0.42/1.00 1 -inductive(A) | member(null_class,A) # label(inductive1) # label(axiom). [assumption].
% 0.42/1.00 2 inductive(omega) # label(omega_is_inductive1) # label(axiom). [assumption].
% 0.42/1.00 Derived: member(null_class,omega). [resolve(1,a,2,a)].
% 0.42/1.00 3 -inductive(A) | subclass(omega,A) # label(omega_is_inductive2) # label(axiom). [assumption].
% 0.42/1.00 Derived: subclass(omega,omega). [resolve(3,a,2,a)].
% 0.42/1.00 4 -inductive(A) | subclass(image(successor_relation,A),A) # label(inductive2) # label(axiom). [assumption].
% 0.42/1.00 Derived: subclass(image(successor_relation,omega),omega). [resolve(4,a,2,a)].
% 0.42/1.00 5 -member(null_class,A) | -subclass(image(successor_relation,A),A) | inductive(A) # label(inductive3) # label(axiom). [assumption].
% 0.42/1.00 Derived: -member(null_class,A) | -subclass(image(successor_relation,A),A) | subclass(omega,A). [resolve(5,c,3,a)].
% 0.42/1.00 6 -function(inverse(A)) | -function(A) | one_to_one(A) # label(one_to_one3) # label(axiom). [assumption].
% 0.42/1.00 7 -one_to_one(A) | function(A) # label(one_to_one1) # label(axiom). [assumption].
% 0.42/1.00 8 -one_to_one(A) | function(inverse(A)) # label(one_to_one2) # label(axiom). [assumption].
% 0.42/1.00 9 -function(A) | subclass(A,cross_product(universal_class,universal_class)) # label(function1) # label(axiom). [assumption].
% 0.42/1.00 10 function(choice) # label(choice1) # label(axiom). [assumption].
% 0.42/1.00 11 -operation(A) | function(A) # label(operation1) # label(axiom). [assumption].
% 0.42/1.00 12 -compatible(A,B,C) | function(A) # label(compatible1) # label(axiom). [assumption].
% 0.42/1.00 Derived: subclass(choice,cross_product(universal_class,universal_class)). [resolve(9,a,10,a)].
% 0.42/1.00 Derived: subclass(A,cross_product(universal_class,universal_class)) | -operation(A). [resolve(9,a,11,b)].
% 0.42/1.00 Derived: subclass(A,cross_product(universal_class,universal_class)) | -compatible(A,B,C). [resolve(9,a,12,b)].
% 0.42/1.00 13 -function(A) | subclass(compose(A,inverse(A)),identity_relation) # label(function2) # label(axiom). [assumption].
% 0.42/1.00 Derived: subclass(compose(choice,inverse(choice)),identity_relation). [resolve(13,a,10,a)].
% 0.42/1.00 Derived: subclass(compose(A,inverse(A)),identity_relation) | -operation(A). [resolve(13,a,11,b)].
% 0.42/1.00 Derived: subclass(compose(A,inverse(A)),identity_relation) | -compatible(A,B,C). [resolve(13,a,12,b)].
% 0.42/1.00 14 -function(A) | -member(B,universal_class) | member(image(A,B),universal_class) # label(replacement) # label(axiom). [assumption].
% 0.42/1.00 Derived: -member(A,universal_class) | member(image(choice,A),universal_class). [resolve(14,a,10,a)].
% 0.42/1.00 Derived: -member(A,universal_class) | member(image(B,A),universal_class) | -operation(B). [resolve(14,a,11,b)].
% 0.42/1.00 Derived: -member(A,universal_class) | member(image(B,A),universal_class) | -compatible(B,C,D). [resolve(14,a,12,b)].
% 0.42/1.00 15 -subclass(A,cross_product(universal_class,universal_class)) | -subclass(compose(A,inverse(A)),identity_relation) | function(A) # label(function3) # label(axiom). [assumption].
% 0.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 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.42/1.00 19 -homomorphism(A,B,C) | operation(B) # label(homomorphism1) # label(axiom). [assumption].
% 0.42/1.00 20 -homomorphism(A,B,C) | operation(C) # label(homomorphism2) # label(axiom). [assumption].
% 0.42/1.00 21 -homomorphism(A,B,C) | compatible(A,B,C) # label(homomorphism3) # label(axiom). [assumption].
% 0.42/1.00 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.42/1.00 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)].
% 132.47/132.74 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].
% 132.47/132.74 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)].
% 132.47/132.74 24 -subclass(compose(A,inverse(A)),identity_relation) | single_valued_class(A) # label(single_valued_class2) # label(axiom). [assumption].
% 132.47/132.74 25 -single_valued_class(A) | subclass(compose(A,inverse(A)),identity_relation) # label(single_valued_class1) # label(axiom). [assumption].
% 132.47/132.74
% 132.47/132.74 ============================== end predicate elimination =============
% 132.47/132.74
% 132.47/132.74 Auto_denials: (non-Horn, no changes).
% 132.47/132.74
% 132.47/132.74 Term ordering decisions:
% 132.47/132.74 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. unordered_pair=1. not_subclass_element=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.
% 132.47/132.74
% 132.47/132.74 ============================== end of process initial clauses ========
% 132.47/132.74
% 132.47/132.74 ============================== CLAUSES FOR SEARCH ====================
% 132.47/132.74
% 132.47/132.74 ============================== end of clauses for search =============
% 132.47/132.74
% 132.47/132.74 ============================== SEARCH ================================
% 132.47/132.74
% 132.47/132.74 % Starting search at 0.04 seconds.
% 132.47/132.74
% 132.47/132.74 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 97 (0.00 of 0.44 sec).
% 132.47/132.74
% 132.47/132.74 Low Water (keep): wt=38.000, iters=3388
% 132.47/132.74
% 132.47/132.74 Low Water (keep): wt=31.000, iters=3368
% 132.47/132.74
% 132.47/132.74 Low Water (keep): wt=30.000, iters=3339
% 132.47/132.74
% 132.47/132.74 Low Water (keep): wt=29.000, iters=3342
% 132.47/132.74
% 132.47/132.74 Low Water (keep): wt=27.000, iters=3389
% 132.47/132.74
% 132.47/132.74 Low Water (keep): wt=25.000, iters=3344
% 132.47/132.74
% 132.47/132.74 Low Water (keep): wt=21.000, iters=3361
% 132.47/132.74
% 132.47/132.74 Low Water (keep): wt=19.000, iters=3337
% 132.47/132.74
% 132.47/132.74 Low Water (keep): wt=17.000, iters=3524
% 132.47/132.74
% 132.47/132.74 Low Water (keep): wt=13.000, iters=3351
% 132.47/132.74
% 132.47/132.74 Low Water (keep): wt=12.000, iters=3348
% 132.47/132.74
% 132.47/132.74 Low Water (keep): wt=11.000, iters=3355
% 132.47/132.74
% 132.47/132.74 Low Water (displace): id=4622, wt=171.000
% 132.47/132.74
% 132.47/132.74 Low Water (displace): id=4619, wt=155.000
% 132.47/132.74
% 132.47/132.74 Low Water (displace): id=3385, wt=67.000
% 132.47/132.74
% 132.47/132.74 Low Water (displace): id=3252, wt=54.000
% 132.47/132.74
% 132.47/132.74 Low Water (displace): id=3534, wt=43.000
% 132.47/132.74
% 132.47/132.74 Low Water (displace): id=3382, wt=41.000
% 132.47/132.74
% 132.47/132.74 Low Water (displace): id=5867, wt=38.000
% 132.47/132.74
% 132.47/132.74 Low Water (displace): id=11254, wt=17.000
% 132.47/132.74
% 132.47/132.74 Low Water (displace): id=11266, wt=9.000
% 132.47/132.74
% 132.47/132.74 Low Water (displace): id=11293, wt=8.000
% 132.47/132.74
% 132.47/132.74 Low Water (displace): id=12625, wt=7.000
% 132.47/132.75
% 132.47/132.75 Low Water (keep): wt=10.000, iters=3341
% 132.47/132.75
% 132.47/132.75 Low Water (keep): wt=9.000, iters=3352
% 132.47/132.75
% 132.47/132.75 Low Water (keep): wt=8.000, iters=3334
% 132.47/132.75
% 132.47/132.75 ============================== STATISTICS ============================
% 132.47/132.75
% 132.47/132.75 Given=30237. Generated=6379795. Kept=890691. proofs=0.
% 132.47/132.75 Usable=28172. Sos=9999. Demods=5363. Limbo=85, Disabled=852550. Hints=0.
% 132.47/132.75 Kept_by_rule=0, Deleted_by_rule=28.
% 132.47/132.75 Forward_subsumed=1503072. Back_subsumed=51.
% 132.47/132.75 Sos_limit_deleted=3986004. Sos_displaced=845565. Sos_removed=0.
% 132.47/132.75 New_demodulators=8378 (1 lex), Back_demodulated=6740. Back_unit_deleted=78.
% 132.47/132.75 Demod_attempts=96239405. Demod_rewrites=505656.
% 132.47/132.75 Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0.
% 132.47/132.75 Nonunit_fsub_feature_tests=106381. Nonunit_bsub_feature_tests=14460.
% 132.47/132.75 Megabytes=419.43.
% 132.47/132.75 User_CPU=128.06, System_CPU=3.70, Wall_clock=132.
% 132.47/132.75
% 132.47/132.75 Megs malloced by palloc(): 400.
% 132.47/132.75 type (bytes each) gets frees in use bytes
% 132.47/132.75 chunk ( 104) 1943 1943 0 0.0 K
% 132.47/132.75 string_buf ( 8) 1840 1840 0 0.0 K
% 132.47/132.75 token ( 20) 3866 3866 0 0.0 K
% 132.47/132.75 pterm ( 16) 2548 2548 0 0.0 K
% 132.47/132.75 hashtab ( 8) 0 0 0 0.0 K
% 132.47/132.75 hashnode ( 8) 0 0 0 0.0 K
% 132.47/132.75 term ( 20) 99775417 88892910 10882507 212549.0 K
% 132.47/132.75 term arg arrays: 42115.7 K
% 132.47/132.75 attribute ( 12) 238 0 238 2.8 K
% 132.47/132.75 ilist ( 8) 1008294297 1002222460 6071837 47436.2 K
% 132.47/132.75 plist ( 8) 13087617 12148310 939307 7338.3 K
% 132.47/132.75 i2list ( 12) 1440713 1440713 0 0.0 K
% 132.47/132.75 just ( 12) 7027764 6128637 899127 10536.6 K
% 132.47/132.75 parajust ( 16) 477454 475964 1490 23.3 K
% 132.47/132.75 instancejust ( 8) 0 0 0 0.0 K
% 132.47/132.75 ivyjust ( 24) 0 0 0 0.0 K
% 132.47/132.75 formula ( 28) 387 387 0 0.0 K
% 132.47/132.75 formula arg arrays: 0.0 K
% 132.47/132.75 topform ( 52) 6379925 5489118 890807 45236.3 K
% 132.47/132.75 clist_pos ( 20) 2672644 1776475 896169 17503.3 K
% 132.47/132.75 clist ( 16) 8 1 7 0.1 K
% 132.47/132.75 context ( 808) 28044714 28044709 5 3.9 K
% 132.47/132.75 trail ( 12) 63673579 63673576 3 0.0 K
% 132.47/132.75 ac_match_pos (70044) 0 0 0 0.0 K
% 132.47/132.75 ac_match_free_vars_pos (20020)
% 132.47/132.75 0 0 0 0.0 K
% 132.47/132.75 btm_state ( 60) 0 0 0 0.0 K
% 132.47/132.75 btu_state ( 60) 0 0 0 0.0 K
% 132.47/132.75 ac_position (285432) 0 0 0 0.0 K
% 132.47/132.75 fpa_trie ( 20) 388567 338208 50359 983.6 K
% 132.47/132.75 fpa_state ( 28) 6926445 6926431 14 0.4 K
% 132.47/132.75 fpa_index ( 12) 10 0 10 0.1 K
% 132.47/132.75 fpa_chunk ( 20) 1201349 1146234 55115 1076.5 K
% 132.47/132.75 fpa_list ( 16) 359446 0 359446 5616.3 K
% 132.47/132.75 fpa_list chunks: 4382.4 K
% 132.47/132.75 discrim ( 12) 2960230 2860215 100015 1172.1 K
% 132.47/132.75 discrim_pos ( 16) 2246558 2246558 0 0.0 K
% 132.47/132.75 flat2 ( 32) 61378813 61378813 0 0.0 K
% 132.47/132.75 flat ( 48) 0 0 0 0.0 K
% 132.47/132.75 flatterm ( 32) 106680116 106680116 0 0.0 K
% 132.47/132.75 mindex ( 28) 13 0 13 0.4 K
% 132.47/132.75 mindex_pos ( 56) 12149238 12149235 3 0.2 K
% 132.47/132.75 lindex ( 12) 5 0 5 0.1 K
% 132.47/132.75 clash ( 40) 709171 709168 3 0.1 K
% 132.47/132.75 di_tree ( 12) 395748 171458 224290 2628.4 K
% 132.47/132.75 avl_node ( 20) 1781105 1761107 19998 390.6 K
% 132.47/132.75
% 132.47/132.75 Memory report, 20 @ 20 = 400 megs (400.00 megs used).
% 132.47/132.75 List 1, length 86, 0.3 K
% 132.47/132.75 List 2, length 164, 1.3 K
% 132.47/132.75 List 3, length 471, 5.5 K
% 132.47/132.75 List 4, length 52, 0.8 K
% 132.47/132.75 List 8, length 268, 8.4 K
% 132.47/132.75 List 10, length 3, 0.1 K
% 132.47/132.75 List 16, length 59, 3.7 K
% 132.47/132.75 List 26, length 58, 5.9 K
% 132.47/132.75 List 32, length 174, 21.8 K
% 132.47/132.75 List 64, length 99, 24.8 K
% 132.47/132.75 List 202, length 1, 0.8 K
% 132.47/132.75
% 132.47/132.75 ============================== SELECTOR REPORT =======================
% 132.47/132.75 Sos_deleted=3986004, Sos_displaced=845565, Sos_size=9999
% 132.47/132.75 SELECTOR PART PRIORITY ORDER SIZE SELECTED
% 132.47/132.75 I 2147483647 high age 0 97
% 132.47/132.75 H 1 high weight 0 0
% 132.47/132.75 A 1 low age 9999 3349
% 132.47/132.75 F 4 low weight 2911 13396
% 132.47/132.75 T 4 low weight 7088 13395
% 132.47/132.75 ============================== end of selector report ================
% 132.47/132.75
% 132.47/132.75 ============================== end of statistics =====================
% 132.47/132.75
% 132.47/132.75 Exiting with failure.
% 132.47/132.75
% 132.47/132.75 Process 13050 exit (max_megs) Sat Jul 9 21:05:03 2022
% 132.47/132.75 Prover9 interrupted
%------------------------------------------------------------------------------