TSTP Solution File: SET114-6 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET114-6 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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:26 EDT 2022
% Result : Timeout 296.67s 296.95s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET114-6 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n019.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 11:10:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.42/1.00 ============================== Prover9 ===============================
% 0.42/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.00 Process 23609 was started by sandbox on n019.cluster.edu,
% 0.42/1.00 Sun Jul 10 11:10:39 2022
% 0.42/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23449_n019.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_23449_n019.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)].
% 296.67/296.95 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].
% 296.67/296.95 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)].
% 296.67/296.95 24 -subclass(compose(A,inverse(A)),identity_relation) | single_valued_class(A) # label(single_valued_class2) # label(axiom). [assumption].
% 296.67/296.95 25 -single_valued_class(A) | subclass(compose(A,inverse(A)),identity_relation) # label(single_valued_class1) # label(axiom). [assumption].
% 296.67/296.95
% 296.67/296.95 ============================== end predicate elimination =============
% 296.67/296.95
% 296.67/296.95 Auto_denials: (non-Horn, no changes).
% 296.67/296.95
% 296.67/296.95 Term ordering decisions:
% 296.67/296.95 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.
% 296.67/296.95
% 296.67/296.95 ============================== end of process initial clauses ========
% 296.67/296.95
% 296.67/296.95 ============================== CLAUSES FOR SEARCH ====================
% 296.67/296.95
% 296.67/296.95 ============================== end of clauses for search =============
% 296.67/296.95
% 296.67/296.95 ============================== SEARCH ================================
% 296.67/296.95
% 296.67/296.95 % Starting search at 0.04 seconds.
% 296.67/296.95
% 296.67/296.95 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 95 (0.00 of 0.44 sec).
% 296.67/296.95
% 296.67/296.95 Low Water (keep): wt=84.000, iters=3411
% 296.67/296.95
% 296.67/296.95 Low Water (keep): wt=50.000, iters=3379
% 296.67/296.95
% 296.67/296.95 Low Water (keep): wt=46.000, iters=3655
% 296.67/296.95
% 296.67/296.95 Low Water (keep): wt=34.000, iters=3520
% 296.67/296.95
% 296.67/296.95 Low Water (keep): wt=33.000, iters=3800
% 296.67/296.95
% 296.67/296.95 Low Water (keep): wt=31.000, iters=3682
% 296.67/296.95
% 296.67/296.95 Low Water (keep): wt=27.000, iters=3414
% 296.67/296.95
% 296.67/296.95 Low Water (keep): wt=26.000, iters=3334
% 296.67/296.95
% 296.67/296.95 Low Water (keep): wt=19.000, iters=3396
% 296.67/296.95
% 296.67/296.95 Low Water (keep): wt=17.000, iters=3343
% 296.67/296.95
% 296.67/296.95 Low Water (keep): wt=13.000, iters=3400
% 296.67/296.95
% 296.67/296.95 Low Water (keep): wt=12.000, iters=3362
% 296.67/296.95
% 296.67/296.95 Low Water (keep): wt=11.000, iters=3343
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=4850, wt=171.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=4847, wt=155.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=1679, wt=143.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=4625, wt=122.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=3701, wt=111.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=3584, wt=85.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=3582, wt=66.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=1266, wt=62.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=1489, wt=58.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=3522, wt=56.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=3514, wt=55.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=2558, wt=54.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=2759, wt=52.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=3513, wt=51.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=2764, wt=50.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=3515, wt=48.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=3590, wt=43.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=2550, wt=41.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=2758, wt=39.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=7155, wt=38.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=11341, wt=17.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=11347, wt=9.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=11506, wt=8.000
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=11507, wt=7.000
% 296.67/296.95
% 296.67/296.95 Low Water (keep): wt=10.000, iters=3334
% 296.67/296.95
% 296.67/296.95 Low Water (keep): wt=9.000, iters=3396
% 296.67/296.95
% 296.67/296.95 Low Water (keep): wt=8.000, iters=3335
% 296.67/296.95
% 296.67/296.95 Low Water (displace): id=26652, wt=6.000
% 296.67/296.95
% 296.67/296.95 ============================== STATISTICS ============================
% 296.67/296.95
% 296.67/296.95 Given=35915. Generated=13797339. Kept=881743. proofs=0.
% 296.67/296.95 Usable=33811. Sos=9999. Demods=5577. Limbo=570, Disabled=837479. Hints=0.
% 296.67/296.95 Kept_by_rule=0, Deleted_by_rule=61.
% 296.67/296.95 Forward_subsumed=2158683. Back_subsumed=49.
% 296.67/296.95 Sos_limit_deleted=10756852. Sos_displaced=830538. Sos_removed=0.
% 296.67/296.95 New_demodulators=10146 (1 lex), Back_demodulated=6663. Back_unit_deleted=113.
% 296.67/296.95 Demod_attempts=327942677. Demod_rewrites=2455750.
% 296.67/296.95 Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0.
% 296.67/296.95 Nonunit_fsub_feature_tests=93316. Nonunit_bsub_feature_tests=13266.
% 296.67/296.95 Megabytes=419.43.
% 296.67/296.95 User_CPU=288.36, System_CPU=7.60, Wall_clock=296.
% 296.67/296.95
% 296.67/296.95 Megs malloced by palloc(): 400.
% 296.67/296.95 type (bytes each) gets frees in use bytes
% 296.67/296.95 chunk ( 104) 1946 1946 0 0.0 K
% 296.67/296.95 string_buf ( 8) 1843 1843 0 0.0 K
% 296.67/296.95 token ( 20) 3873 3873 0 0.0 K
% 296.67/296.95 pterm ( 16) 2555 2555 0 0.0 K
% 296.67/296.95 hashtab ( 8) 0 0 0 0.0 K
% 296.67/296.95 hashnode ( 8) 0 0 0 0.0 K
% 296.67/296.95 term ( 20) 365742370 355229462 10512908 205330.2 K
% 296.67/296.95 term arg arrays: 41524.0 K
% 296.67/296.95 attribute ( 12) 238 0 238 2.8 K
% 296.67/296.95 ilist ( 8) 1310852899 1304861198 5991701 46810.2 K
% 296.67/296.95 plist ( 8) 12867359 11930681 936678 7317.8 K
% 296.67/296.95 i2list ( 12) 6733509 6733509 0 0.0 K
% 296.67/296.95 just ( 12) 17491935 16597361 894574 10483.3 K
% 296.67/296.95 parajust ( 16) 1536441 1534646 1795 28.0 K
% 296.67/296.95 instancejust ( 8) 0 0 0 0.0 K
% 296.67/296.95 ivyjust ( 24) 0 0 0 0.0 K
% 296.67/296.95 formula ( 28) 387 387 0 0.0 K
% 296.67/296.95 formula arg arrays: 0.0 K
% 296.67/296.95 topform ( 52) 13797470 12915610 881860 44782.0 K
% 296.67/296.95 clist_pos ( 20) 2646640 1759204 887436 17332.7 K
% 296.67/296.95 clist ( 16) 8 1 7 0.1 K
% 296.67/296.95 context ( 808) 55147031 55147028 3 2.4 K
% 296.67/296.95 trail ( 12) 179775000 179774997 3 0.0 K
% 296.67/296.95 ac_match_pos (70044) 0 0 0 0.0 K
% 296.67/296.95 ac_match_free_vars_pos (20020)
% 296.67/296.95 0 0 0 0.0 K
% 296.67/296.95 btm_state ( 60) 0 0 0 0.0 K
% 296.67/296.95 btu_state ( 60) 0 0 0 0.0 K
% 296.67/296.95 ac_position (285432) 0 0 0 0.0 K
% 296.67/296.95 fpa_trie ( 20) 837686 781191 56495 1103.4 K
% 296.67/296.95 fpa_state ( 28) 7911162 7911149 13 0.4 K
% 296.67/296.95 fpa_index ( 12) 10 0 10 0.1 K
% 296.67/296.95 fpa_chunk ( 20) 1635875 1569774 66101 1291.0 K
% 296.67/296.95 fpa_list ( 16) 805965 0 805965 12593.2 K
% 296.67/296.95 fpa_list chunks: 5405.2 K
% 296.67/296.95 discrim ( 12) 3097423 2984911 112512 1318.5 K
% 296.67/296.95 discrim_pos ( 16) 6747011 6747011 0 0.0 K
% 296.67/296.95 flat2 ( 32) 149103700 149103700 0 0.0 K
% 296.67/296.95 flat ( 48) 0 0 0 0.0 K
% 296.67/296.95 flatterm ( 32) 365104881 365104881 0 0.0 K
% 296.67/296.95 mindex ( 28) 13 0 13 0.4 K
% 296.67/296.95 mindex_pos ( 56) 23758612 23758610 2 0.1 K
% 296.67/296.95 lindex ( 12) 5 0 5 0.1 K
% 296.67/296.95 clash ( 40) 935917 935914 3 0.1 K
% 296.67/296.95 di_tree ( 12) 382596 92138 290458 3403.8 K
% 296.67/296.95 avl_node ( 20) 1762241 1742243 19998 390.6 K
% 296.67/296.95
% 296.67/296.95 Memory report, 20 @ 20 = 400 megs (400.00 megs used).
% 296.67/296.95 List 1, length 86, 0.3 K
% 296.67/296.95 List 2, length 159, 1.2 K
% 296.67/296.95 List 4, length 18, 0.3 K
% 296.67/296.95 List 8, length 151, 4.7 K
% 296.67/296.95 List 10, length 3, 0.1 K
% 296.67/296.95 List 14, length 1, 0.1 K
% 296.67/296.95 List 16, length 56, 3.5 K
% 296.67/296.95 List 26, length 58, 5.9 K
% 296.67/296.95 List 32, length 165, 20.6 K
% 296.67/296.95 List 64, length 126, 31.5 K
% 296.67/296.95 List 128, length 1, 0.5 K
% 296.67/296.95 List 202, length 3, 2.4 K
% 296.67/296.95 List 256, length 483, 483.0 K
% 296.67/296.95
% 296.67/296.95 ============================== SELECTOR REPORT =======================
% 296.67/296.95 Sos_deleted=10756852, Sos_displaced=830538, Sos_size=9999
% 296.67/296.95 SELECTOR PART PRIORITY ORDER SIZE SELECTED
% 296.67/296.95 I 2147483647 high age 0 97
% 296.67/296.95 H 1 high weight 0 0
% 296.67/296.95 A 1 low age 9999 3980
% 296.67/296.95 F 4 low weight 2338 15920
% 296.67/296.95 T 4 low weight 7661 15918
% 296.67/296.95 ============================== end of selector report ================
% 296.67/296.95
% 296.67/296.95 ============================== end of statistics =====================
% 296.67/296.95
% 296.67/296.95 Exiting with failure.
% 296.67/296.95
% 296.67/296.95 Process 23609 exit (max_megs) Sun Jul 10 11:15:35 2022
% 296.67/296.95 Prover9 interrupted
%------------------------------------------------------------------------------