TSTP Solution File: SET021-6 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET021-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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:25:55 EDT 2022
% Result : Unknown 164.83s 165.09s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET021-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 18:56:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.76/1.02 ============================== Prover9 ===============================
% 0.76/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.02 Process 9700 was started by sandbox2 on n004.cluster.edu,
% 0.76/1.02 Sun Jul 10 18:56:53 2022
% 0.76/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_9547_n004.cluster.edu".
% 0.76/1.02 ============================== end of head ===========================
% 0.76/1.02
% 0.76/1.02 ============================== INPUT =================================
% 0.76/1.02
% 0.76/1.02 % Reading from file /tmp/Prover9_9547_n004.cluster.edu
% 0.76/1.02
% 0.76/1.02 set(prolog_style_variables).
% 0.76/1.02 set(auto2).
% 0.76/1.02 % set(auto2) -> set(auto).
% 0.76/1.02 % set(auto) -> set(auto_inference).
% 0.76/1.02 % set(auto) -> set(auto_setup).
% 0.76/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.02 % set(auto) -> set(auto_limits).
% 0.76/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.02 % set(auto) -> set(auto_denials).
% 0.76/1.02 % set(auto) -> set(auto_process).
% 0.76/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.02 % set(auto2) -> assign(stats, some).
% 0.76/1.02 % set(auto2) -> clear(echo_input).
% 0.76/1.02 % set(auto2) -> set(quiet).
% 0.76/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.02 % set(auto2) -> clear(print_given).
% 0.76/1.02 assign(lrs_ticks,-1).
% 0.76/1.02 assign(sos_limit,10000).
% 0.76/1.02 assign(order,kbo).
% 0.76/1.02 set(lex_order_vars).
% 0.76/1.02 clear(print_given).
% 0.76/1.02
% 0.76/1.02 % formulas(sos). % not echoed (93 formulas)
% 0.76/1.02
% 0.76/1.02 ============================== end of input ==========================
% 0.76/1.02
% 0.76/1.02 % From the command line: assign(max_seconds, 300).
% 0.76/1.02
% 0.76/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.02
% 0.76/1.02 % Formulas that are not ordinary clauses:
% 0.76/1.02
% 0.76/1.02 ============================== end of process non-clausal formulas ===
% 0.76/1.02
% 0.76/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.02
% 0.76/1.02 ============================== PREDICATE ELIMINATION =================
% 0.76/1.02 1 -inductive(A) | member(null_class,A) # label(inductive1) # label(axiom). [assumption].
% 0.76/1.02 2 inductive(omega) # label(omega_is_inductive1) # label(axiom). [assumption].
% 0.76/1.02 Derived: member(null_class,omega). [resolve(1,a,2,a)].
% 0.76/1.02 3 -inductive(A) | subclass(omega,A) # label(omega_is_inductive2) # label(axiom). [assumption].
% 0.76/1.02 Derived: subclass(omega,omega). [resolve(3,a,2,a)].
% 0.76/1.02 4 -inductive(A) | subclass(image(successor_relation,A),A) # label(inductive2) # label(axiom). [assumption].
% 0.76/1.02 Derived: subclass(image(successor_relation,omega),omega). [resolve(4,a,2,a)].
% 0.76/1.02 5 -member(null_class,A) | -subclass(image(successor_relation,A),A) | inductive(A) # label(inductive3) # label(axiom). [assumption].
% 0.76/1.02 Derived: -member(null_class,A) | -subclass(image(successor_relation,A),A) | subclass(omega,A). [resolve(5,c,3,a)].
% 0.76/1.02 6 -function(inverse(A)) | -function(A) | one_to_one(A) # label(one_to_one3) # label(axiom). [assumption].
% 0.76/1.02 7 -one_to_one(A) | function(A) # label(one_to_one1) # label(axiom). [assumption].
% 0.76/1.02 8 -one_to_one(A) | function(inverse(A)) # label(one_to_one2) # label(axiom). [assumption].
% 0.76/1.02 9 -function(A) | subclass(A,cross_product(universal_class,universal_class)) # label(function1) # label(axiom). [assumption].
% 0.76/1.02 10 function(choice) # label(choice1) # label(axiom). [assumption].
% 0.76/1.02 11 -operation(A) | function(A) # label(operation1) # label(axiom). [assumption].
% 0.76/1.02 12 -compatible(A,B,C) | function(A) # label(compatible1) # label(axiom). [assumption].
% 0.76/1.02 Derived: subclass(choice,cross_product(universal_class,universal_class)). [resolve(9,a,10,a)].
% 0.76/1.02 Derived: subclass(A,cross_product(universal_class,universal_class)) | -operation(A). [resolve(9,a,11,b)].
% 0.76/1.02 Derived: subclass(A,cross_product(universal_class,universal_class)) | -compatible(A,B,C). [resolve(9,a,12,b)].
% 0.76/1.02 13 -function(A) | subclass(compose(A,inverse(A)),identity_relation) # label(function2) # label(axiom). [assumption].
% 0.76/1.02 Derived: subclass(compose(choice,inverse(choice)),identity_relation). [resolve(13,a,10,a)].
% 0.76/1.02 Derived: subclass(compose(A,inverse(A)),identity_relation) | -operation(A). [resolve(13,a,11,b)].
% 0.76/1.02 Derived: subclass(compose(A,inverse(A)),identity_relation) | -compatible(A,B,C). [resolve(13,a,12,b)].
% 0.76/1.02 14 -function(A) | -member(B,universal_class) | member(image(A,B),universal_class) # label(replacement) # label(axiom). [assumption].
% 0.76/1.02 Derived: -member(A,universal_class) | member(image(choice,A),universal_class). [resolve(14,a,10,a)].
% 0.76/1.02 Derived: -member(A,universal_class) | member(image(B,A),universal_class) | -operation(B). [resolve(14,a,11,b)].
% 0.76/1.02 Derived: -member(A,universal_class) | member(image(B,A),universal_class) | -compatible(B,C,D). [resolve(14,a,12,b)].
% 0.76/1.02 15 -subclass(A,cross_product(universal_class,universal_class)) | -subclass(compose(A,inverse(A)),identity_relation) | function(A) # label(function3) # label(axiom). [assumption].
% 0.76/1.02 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.76/1.02 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.76/1.02 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.76/1.02 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.76/1.02 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.76/1.02 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.76/1.02 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.76/1.02 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.76/1.02 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.76/1.02 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.76/1.02 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.76/1.02 19 -homomorphism(A,B,C) | operation(B) # label(homomorphism1) # label(axiom). [assumption].
% 0.76/1.02 20 -homomorphism(A,B,C) | operation(C) # label(homomorphism2) # label(axiom). [assumption].
% 0.76/1.02 21 -homomorphism(A,B,C) | compatible(A,B,C) # label(homomorphism3) # label(axiom). [assumption].
% 0.76/1.02 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.76/1.02 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)].
% 164.83/165.09 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].
% 164.83/165.09 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)].
% 164.83/165.09 24 -subclass(compose(A,inverse(A)),identity_relation) | single_valued_class(A) # label(single_valued_class2) # label(axiom). [assumption].
% 164.83/165.09 25 -single_valued_class(A) | subclass(compose(A,inverse(A)),identity_relation) # label(single_valued_class1) # label(axiom). [assumption].
% 164.83/165.09
% 164.83/165.09 ============================== end predicate elimination =============
% 164.83/165.09
% 164.83/165.09 Auto_denials: (non-Horn, no changes).
% 164.83/165.09
% 164.83/165.09 Term ordering decisions:
% 164.83/165.09 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. u=1. v=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.
% 164.83/165.09
% 164.83/165.09 ============================== end of process initial clauses ========
% 164.83/165.09
% 164.83/165.09 ============================== CLAUSES FOR SEARCH ====================
% 164.83/165.09
% 164.83/165.09 ============================== end of clauses for search =============
% 164.83/165.09
% 164.83/165.09 ============================== SEARCH ================================
% 164.83/165.09
% 164.83/165.09 % Starting search at 0.04 seconds.
% 164.83/165.09
% 164.83/165.09 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 86 (0.00 of 0.48 sec).
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=80.000, iters=3377
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=46.000, iters=3339
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=37.000, iters=3396
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=33.000, iters=3388
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=32.000, iters=3369
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=31.000, iters=3389
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=30.000, iters=3333
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=29.000, iters=3351
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=28.000, iters=3405
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=27.000, iters=3422
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=25.000, iters=3335
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=24.000, iters=3402
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=23.000, iters=3337
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=19.000, iters=3355
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=17.000, iters=3447
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=13.000, iters=3364
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=12.000, iters=3334
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=11.000, iters=3336
% 164.83/165.09
% 164.83/165.09 Low Water (displace): id=4396, wt=171.000
% 164.83/165.09
% 164.83/165.09 Low Water (displace): id=4393, wt=155.000
% 164.83/165.09
% 164.83/165.09 Low Water (displace): id=3545, wt=51.000
% 164.83/165.09
% 164.83/165.09 Low Water (displace): id=3398, wt=42.000
% 164.83/165.09
% 164.83/165.09 Low Water (displace): id=8002, wt=38.000
% 164.83/165.09
% 164.83/165.09 Low Water (displace): id=11486, wt=9.000
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=10.000, iters=3354
% 164.83/165.09
% 164.83/165.09 Low Water (displace): id=11821, wt=8.000
% 164.83/165.09
% 164.83/165.09 Low Water (displace): id=11824, wt=7.000
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=9.000, iters=3335
% 164.83/165.09
% 164.83/165.09 Low Water (keep): wt=8.000, iters=3333
% 164.83/165.09
% 164.83/165.09 ============================== STATISTICS ============================
% 164.83/165.09
% 164.83/165.09 Given=31948. Generated=8460827. Kept=858284. proofs=0.
% 164.83/165.09 Usable=29791. Sos=9999. Demods=5500. Limbo=166, Disabled=818444. Hints=0.
% 164.83/165.09 Kept_by_rule=0, Deleted_by_rule=47.
% 164.83/165.09 Forward_subsumed=1437287. Back_subsumed=60.
% 164.83/165.09 Sos_limit_deleted=6165209. Sos_displaced=811890. Sos_removed=0.
% 164.83/165.09 New_demodulators=7666 (1 lex), Back_demodulated=6286. Back_unit_deleted=92.
% 164.83/165.09 Demod_attempts=144629693. Demod_rewrites=701069.
% 164.83/165.09 Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0.
% 164.83/165.09 Nonunit_fsub_feature_tests=95245. Nonunit_bsub_feature_tests=13654.
% 164.83/165.09 Megabytes=419.43.
% 164.83/165.09 User_CPU=159.57, System_CPU=4.53, Wall_clock=164.
% 164.83/165.09
% 164.83/165.09 Megs malloced by palloc(): 400.
% 164.83/165.09 type (bytes each) gets frees in use bytes
% 164.83/165.09 chunk ( 104) 1946 1946 0 0.0 K
% 164.83/165.09 string_buf ( 8) 1842 1842 0 0.0 K
% 164.83/165.09 token ( 20) 3871 3871 0 0.0 K
% 164.83/165.09 pterm ( 16) 2554 2554 0 0.0 K
% 164.83/165.09 hashtab ( 8) 0 0 0 0.0 K
% 164.83/165.09 hashnode ( 8) 0 0 0 0.0 K
% 164.83/165.09 term ( 20) 150695414 139782251 10913163 213147.7 K
% 164.83/165.09 term arg arrays: 42415.0 K
% 164.83/165.09 attribute ( 12) 238 0 238 2.8 K
% 164.83/165.09 ilist ( 8) 1139066108 1133202659 5863449 45808.2 K
% 164.83/165.09 plist ( 8) 13044045 12135479 908566 7098.2 K
% 164.83/165.09 i2list ( 12) 2707728 2707728 0 0.0 K
% 164.83/165.09 just ( 12) 9423277 8555693 867584 10167.0 K
% 164.83/165.09 parajust ( 16) 568667 566635 2032 31.8 K
% 164.83/165.09 instancejust ( 8) 0 0 0 0.0 K
% 164.83/165.09 ivyjust ( 24) 0 0 0 0.0 K
% 164.83/165.09 formula ( 28) 386 386 0 0.0 K
% 164.83/165.09 formula arg arrays: 0.0 K
% 164.83/165.09 topform ( 52) 8460958 7602557 858401 43590.7 K
% 164.83/165.09 clist_pos ( 20) 2574644 1710744 863900 16873.0 K
% 164.83/165.09 clist ( 16) 8 1 7 0.1 K
% 164.83/165.09 context ( 808) 34586532 34586529 3 2.4 K
% 164.83/165.09 trail ( 12) 85410499 85410496 3 0.0 K
% 164.83/165.09 ac_match_pos (70044) 0 0 0 0.0 K
% 164.83/165.09 ac_match_free_vars_pos (20020)
% 164.83/165.09 0 0 0 0.0 K
% 164.83/165.09 btm_state ( 60) 0 0 0 0.0 K
% 164.83/165.09 btu_state ( 60) 0 0 0 0.0 K
% 164.83/165.09 ac_position (285432) 0 0 0 0.0 K
% 164.83/165.09 fpa_trie ( 20) 585813 531767 54046 1055.6 K
% 164.83/165.09 fpa_state ( 28) 6691116 6691104 12 0.3 K
% 164.83/165.09 fpa_index ( 12) 10 0 10 0.1 K
% 164.83/165.09 fpa_chunk ( 20) 1533791 1473783 60008 1172.0 K
% 164.83/165.09 fpa_list ( 16) 555828 0 555828 8684.8 K
% 164.83/165.09 fpa_list chunks: 4651.8 K
% 164.83/165.09 discrim ( 12) 3093235 2989017 104218 1221.3 K
% 164.83/165.09 discrim_pos ( 16) 2635813 2635813 0 0.0 K
% 164.83/165.09 flat2 ( 32) 81548963 81548963 0 0.0 K
% 164.83/165.09 flat ( 48) 0 0 0 0.0 K
% 164.83/165.09 flatterm ( 32) 161551863 161551863 0 0.0 K
% 164.83/165.09 mindex ( 28) 13 0 13 0.4 K
% 164.83/165.09 mindex_pos ( 56) 14516649 14516647 2 0.1 K
% 164.83/165.09 lindex ( 12) 5 0 5 0.1 K
% 164.83/165.09 clash ( 40) 747315 747312 3 0.1 K
% 164.83/165.09 di_tree ( 12) 396572 158125 238447 2794.3 K
% 164.83/165.09 avl_node ( 20) 1716130 1696132 19998 390.6 K
% 164.83/165.09
% 164.83/165.09 Memory report, 20 @ 20 = 400 megs (400.00 megs used).
% 164.83/165.09 List 1, length 85, 0.3 K
% 164.83/165.09 List 2, length 169, 1.3 K
% 164.83/165.09 List 3, length 19917, 233.4 K
% 164.83/165.09 List 4, length 94, 1.5 K
% 164.83/165.09 List 8, length 411, 12.8 K
% 164.83/165.09 List 10, length 3, 0.1 K
% 164.83/165.09 List 14, length 1, 0.1 K
% 164.83/165.09 List 16, length 129, 8.1 K
% 164.83/165.09 List 26, length 58, 5.9 K
% 164.83/165.09 List 32, length 453, 56.6 K
% 164.83/165.09 List 64, length 74, 18.5 K
% 164.83/165.09 List 202, length 3, 2.4 K
% 164.83/165.09
% 164.83/165.09 ============================== SELECTOR REPORT =======================
% 164.83/165.09 Sos_deleted=6165209, Sos_displaced=811890, Sos_size=9999
% 164.83/165.09 SELECTOR PART PRIORITY ORDER SIZE SELECTED
% 164.83/165.09 I 2147483647 high age 0 97
% 164.83/165.09 H 1 high weight 0 0
% 164.83/165.09 A 1 low age 9999 3539
% 164.83/165.09 F 4 low weight 2677 14156
% 164.83/165.09 T 4 low weight 7322 14156
% 164.83/165.09 ============================== end of selector report ================
% 164.83/165.09
% 164.83/165.09 ============================== end of statistics =====================
% 164.83/165.09
% 164.83/165.09 Exiting with failure.
% 164.83/165.09
% 164.83/165.09 Process 9700 exit (max_megs) Sun Jul 10 18:59:37 2022
% 164.83/165.09 Prover9 interrupted
%------------------------------------------------------------------------------