TSTP Solution File: SWV014+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV014+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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 : Wed Jul 20 21:10:14 EDT 2022
% Result : Unknown 158.14s 158.43s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV014+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n029.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 : Wed Jun 15 09:26:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.01 ============================== Prover9 ===============================
% 0.45/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.01 Process 26034 was started by sandbox2 on n029.cluster.edu,
% 0.45/1.01 Wed Jun 15 09:26:12 2022
% 0.45/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_25881_n029.cluster.edu".
% 0.45/1.01 ============================== end of head ===========================
% 0.45/1.01
% 0.45/1.01 ============================== INPUT =================================
% 0.45/1.01
% 0.45/1.01 % Reading from file /tmp/Prover9_25881_n029.cluster.edu
% 0.45/1.01
% 0.45/1.01 set(prolog_style_variables).
% 0.45/1.01 set(auto2).
% 0.45/1.01 % set(auto2) -> set(auto).
% 0.45/1.01 % set(auto) -> set(auto_inference).
% 0.45/1.01 % set(auto) -> set(auto_setup).
% 0.45/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.01 % set(auto) -> set(auto_limits).
% 0.45/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.01 % set(auto) -> set(auto_denials).
% 0.45/1.01 % set(auto) -> set(auto_process).
% 0.45/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.01 % set(auto2) -> assign(stats, some).
% 0.45/1.01 % set(auto2) -> clear(echo_input).
% 0.45/1.01 % set(auto2) -> set(quiet).
% 0.45/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.01 % set(auto2) -> clear(print_given).
% 0.45/1.01 assign(lrs_ticks,-1).
% 0.45/1.01 assign(sos_limit,10000).
% 0.45/1.01 assign(order,kbo).
% 0.45/1.01 set(lex_order_vars).
% 0.45/1.01 clear(print_given).
% 0.45/1.01
% 0.45/1.01 % formulas(sos). % not echoed (29 formulas)
% 0.45/1.01
% 0.45/1.01 ============================== end of input ==========================
% 0.45/1.01
% 0.45/1.01 % From the command line: assign(max_seconds, 300).
% 0.45/1.01
% 0.45/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.01
% 0.45/1.01 % Formulas that are not ordinary clauses:
% 0.45/1.01 1 (all U all V all W all X all Y all Z (message(sent(t,a,triple(encrypt(quadruple(Y,Z,W,V),at),X,U))) & a_stored(pair(Y,Z)) -> message(sent(a,Y,pair(X,encrypt(U,W)))) & a_holds(key(W,Y)))) # label(a_forwards_secure) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 2 (all U all V (message(sent(U,b,pair(U,V))) & fresh_to_b(V) -> message(sent(b,t,triple(b,generate_b_nonce(V),encrypt(triple(U,V,generate_expiration_time(V)),bt)))) & b_stored(pair(U,V)))) # label(b_creates_freash_nonces_in_time) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 3 (all V all X all Y (message(sent(X,b,pair(encrypt(triple(X,V,generate_expiration_time(Y)),bt),encrypt(generate_b_nonce(Y),V)))) & b_stored(pair(X,Y)) -> b_holds(key(V,X)))) # label(b_accepts_secure_session_key) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 4 (all U all V all W all X all Y all Z all X1 (message(sent(U,t,triple(U,V,encrypt(triple(W,X,Y),Z)))) & t_holds(key(Z,U)) & t_holds(key(X1,W)) & a_nonce(X) -> message(sent(t,W,triple(encrypt(quadruple(U,X,generate_key(X),Y),X1),encrypt(triple(W,generate_key(X),Y),Z),V))))) # label(server_t_generates_key) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 5 (all U all V all W (message(sent(U,V,W)) -> intruder_message(W))) # label(intruder_can_record) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 6 (all U all V (intruder_message(pair(U,V)) -> intruder_message(U) & intruder_message(V))) # label(intruder_decomposes_pairs) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 7 (all U all V all W (intruder_message(triple(U,V,W)) -> intruder_message(U) & intruder_message(V) & intruder_message(W))) # label(intruder_decomposes_triples) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 8 (all U all V all W all X (intruder_message(quadruple(U,V,W,X)) -> intruder_message(U) & intruder_message(V) & intruder_message(W) & intruder_message(X))) # label(intruder_decomposes_quadruples) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 9 (all U all V (intruder_message(U) & intruder_message(V) -> intruder_message(pair(U,V)))) # label(intruder_composes_pairs) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 10 (all U all V all W (intruder_message(U) & intruder_message(V) & intruder_message(W) -> intruder_message(triple(U,V,W)))) # label(intruder_composes_triples) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 11 (all U all V all W all X (intruder_message(U) & intruder_message(V) & intruder_message(W) & intruder_message(X) -> intruder_message(quadruple(U,V,W,X)))) # label(intruder_composes_quadruples) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 12 (all U all V all W (intruder_message(encrypt(U,V)) & intruder_holds(key(V,W)) & party_of_protocol(W) -> intruder_message(V))) # label(intruder_interception) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 13 (all U all V all W (intruder_message(U) & party_of_protocol(V) & party_of_protocol(W) -> message(sent(V,W,U)))) # label(intruder_message_sent) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 14 (all V all W (intruder_message(V) & party_of_protocol(W) -> intruder_holds(key(V,W)))) # label(intruder_holds_key) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 15 (all U all V all W (intruder_message(U) & intruder_holds(key(V,W)) & party_of_protocol(W) -> intruder_message(encrypt(U,V)))) # label(intruder_key_encrypts) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 16 (all U -a_nonce(generate_key(U))) # label(generated_keys_are_not_nonces) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 17 (all U (a_nonce(generate_expiration_time(U)) & a_nonce(generate_b_nonce(U)))) # label(generated_times_and_nonces_are_nonces) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.01 18 -(exists U (intruder_holds(key(U,b)) & b_holds(key(U,a)))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.01
% 0.45/1.01 ============================== end of process non-clausal formulas ===
% 0.45/1.01
% 0.45/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.01
% 0.45/1.01 ============================== PREDICATE ELIMINATION =================
% 0.45/1.01 19 -message(sent(A,b,pair(A,B))) | -fresh_to_b(B) | b_stored(pair(A,B)) # label(b_creates_freash_nonces_in_time) # label(axiom). [clausify(2)].
% 0.45/1.01 20 fresh_to_b(an_a_nonce) # label(nonce_a_is_fresh_to_b) # label(axiom). [assumption].
% 0.45/1.01 Derived: -message(sent(A,b,pair(A,an_a_nonce))) | b_stored(pair(A,an_a_nonce)). [resolve(19,b,20,a)].
% 0.45/1.01 21 -message(sent(A,b,pair(A,B))) | -fresh_to_b(B) | message(sent(b,t,triple(b,generate_b_nonce(B),encrypt(triple(A,B,generate_expiration_time(B)),bt)))) # label(b_creates_freash_nonces_in_time) # label(axiom). [clausify(2)].
% 0.45/1.01 Derived: -message(sent(A,b,pair(A,an_a_nonce))) | message(sent(b,t,triple(b,generate_b_nonce(an_a_nonce),encrypt(triple(A,an_a_nonce,generate_expiration_time(an_a_nonce)),bt)))). [resolve(21,b,20,a)].
% 0.45/1.01 22 -a_nonce(generate_key(A)) # label(generated_keys_are_not_nonces) # label(axiom). [clausify(16)].
% 0.45/1.01 23 a_nonce(an_a_nonce) # label(an_a_nonce_is_a_nonce) # label(axiom). [assumption].
% 0.45/1.01 24 a_nonce(generate_expiration_time(A)) # label(generated_times_and_nonces_are_nonces) # label(axiom). [clausify(17)].
% 0.45/1.01 25 a_nonce(generate_b_nonce(A)) # label(generated_times_and_nonces_are_nonces) # label(axiom). [clausify(17)].
% 0.45/1.01 26 -message(sent(A,t,triple(A,B,encrypt(triple(C,D,E),F)))) | -t_holds(key(F,A)) | -t_holds(key(V6,C)) | -a_nonce(D) | message(sent(t,C,triple(encrypt(quadruple(A,D,generate_key(D),E),V6),encrypt(triple(C,generate_key(D),E),F),B))) # label(server_t_generates_key) # label(axiom). [clausify(4)].
% 0.45/1.01 Derived: -message(sent(A,t,triple(A,B,encrypt(triple(C,an_a_nonce,D),E)))) | -t_holds(key(E,A)) | -t_holds(key(F,C)) | message(sent(t,C,triple(encrypt(quadruple(A,an_a_nonce,generate_key(an_a_nonce),D),F),encrypt(triple(C,generate_key(an_a_nonce),D),E),B))). [resolve(26,d,23,a)].
% 0.45/1.01 Derived: -message(sent(A,t,triple(A,B,encrypt(triple(C,generate_expiration_time(D),E),F)))) | -t_holds(key(F,A)) | -t_holds(key(V6,C)) | message(sent(t,C,triple(encrypt(quadruple(A,generate_expiration_time(D),generate_key(generate_expiration_time(D)),E),V6),encrypt(triple(C,generate_key(generate_expiration_time(D)),E),F),B))). [resolve(26,d,24,a)].
% 6.25/6.58 Derived: -message(sent(A,t,triple(A,B,encrypt(triple(C,generate_b_nonce(D),E),F)))) | -t_holds(key(F,A)) | -t_holds(key(V6,C)) | message(sent(t,C,triple(encrypt(quadruple(A,generate_b_nonce(D),generate_key(generate_b_nonce(D)),E),V6),encrypt(triple(C,generate_key(generate_b_nonce(D)),E),F),B))). [resolve(26,d,25,a)].
% 6.25/6.58 27 -message(sent(t,a,triple(encrypt(quadruple(A,B,C,D),at),E,F))) | -a_stored(pair(A,B)) | message(sent(a,A,pair(E,encrypt(F,C)))) # label(a_forwards_secure) # label(axiom). [clausify(1)].
% 6.25/6.58 28 a_stored(pair(b,an_a_nonce)) # label(a_stored_message_i) # label(axiom). [assumption].
% 6.25/6.58 Derived: -message(sent(t,a,triple(encrypt(quadruple(b,an_a_nonce,A,B),at),C,D))) | message(sent(a,b,pair(C,encrypt(D,A)))). [resolve(27,b,28,a)].
% 6.25/6.58 29 -intruder_holds(key(A,b)) | -b_holds(key(A,a)) # label(co1) # label(negated_conjecture). [clausify(18)].
% 6.25/6.58 30 b_holds(key(bt,t)) # label(b_hold_key_bt_for_t) # label(axiom). [assumption].
% 6.25/6.58 31 -message(sent(A,b,pair(encrypt(triple(A,B,generate_expiration_time(C)),bt),encrypt(generate_b_nonce(C),B)))) | -b_stored(pair(A,C)) | b_holds(key(B,A)) # label(b_accepts_secure_session_key) # label(axiom). [clausify(3)].
% 6.25/6.58 Derived: -message(sent(a,b,pair(encrypt(triple(a,A,generate_expiration_time(B)),bt),encrypt(generate_b_nonce(B),A)))) | -b_stored(pair(a,B)) | -intruder_holds(key(A,b)). [resolve(31,c,29,b)].
% 6.25/6.58 32 -intruder_message(encrypt(A,B)) | -intruder_holds(key(B,C)) | -party_of_protocol(C) | intruder_message(B) # label(intruder_interception) # label(axiom). [clausify(12)].
% 6.25/6.58 33 -intruder_message(A) | -party_of_protocol(B) | intruder_holds(key(A,B)) # label(intruder_holds_key) # label(axiom). [clausify(14)].
% 6.25/6.58 34 -intruder_message(A) | -intruder_holds(key(B,C)) | -party_of_protocol(C) | intruder_message(encrypt(A,B)) # label(intruder_key_encrypts) # label(axiom). [clausify(15)].
% 6.25/6.58 Derived: -intruder_message(A) | -party_of_protocol(B) | intruder_message(encrypt(A,C)) | -intruder_message(C) | -party_of_protocol(B). [resolve(34,b,33,c)].
% 6.25/6.58 35 -message(sent(a,b,pair(encrypt(triple(a,A,generate_expiration_time(B)),bt),encrypt(generate_b_nonce(B),A)))) | -b_stored(pair(a,B)) | -intruder_holds(key(A,b)). [resolve(31,c,29,b)].
% 6.25/6.58 Derived: -message(sent(a,b,pair(encrypt(triple(a,A,generate_expiration_time(B)),bt),encrypt(generate_b_nonce(B),A)))) | -b_stored(pair(a,B)) | -intruder_message(A) | -party_of_protocol(b). [resolve(35,c,33,c)].
% 6.25/6.58 36 -message(sent(a,b,pair(encrypt(triple(a,A,generate_expiration_time(B)),bt),encrypt(generate_b_nonce(B),A)))) | -b_stored(pair(a,B)) | -intruder_message(A) | -party_of_protocol(b). [resolve(35,c,33,c)].
% 6.25/6.58 37 -message(sent(A,b,pair(A,an_a_nonce))) | b_stored(pair(A,an_a_nonce)). [resolve(19,b,20,a)].
% 6.25/6.58 Derived: -message(sent(a,b,pair(encrypt(triple(a,A,generate_expiration_time(an_a_nonce)),bt),encrypt(generate_b_nonce(an_a_nonce),A)))) | -intruder_message(A) | -party_of_protocol(b) | -message(sent(a,b,pair(a,an_a_nonce))). [resolve(36,b,37,b)].
% 6.25/6.58
% 6.25/6.58 ============================== end predicate elimination =============
% 6.25/6.58
% 6.25/6.58 Auto_denials: (no changes).
% 6.25/6.58
% 6.25/6.58 Term ordering decisions:
% 6.25/6.58 Function symbol KB weights: an_a_nonce=1. t=1. b=1. a=1. at=1. bt=1. encrypt=1. key=1. pair=1. generate_key=1. generate_b_nonce=1. generate_expiration_time=1. triple=1. sent=1. quadruple=1.
% 6.25/6.58
% 6.25/6.58 ============================== end of process initial clauses ========
% 6.25/6.58
% 6.25/6.58 ============================== CLAUSES FOR SEARCH ====================
% 6.25/6.58
% 6.25/6.58 ============================== end of clauses for search =============
% 6.25/6.58
% 6.25/6.58 ============================== SEARCH ================================
% 6.25/6.58
% 6.25/6.58 % Starting search at 0.02 seconds.
% 6.25/6.58
% 6.25/6.58 Low Water (keep): wt=14.000, iters=5402
% 6.25/6.58
% 6.25/6.58 Low Water (keep): wt=12.000, iters=3944
% 6.25/6.58
% 6.25/6.58 Low Water (displace): id=6785, wt=46.000
% 6.25/6.58
% 6.25/6.58 Low Water (displace): id=6786, wt=42.000
% 6.25/6.58
% 6.25/6.58 Low Water (displace): id=10147, wt=40.000
% 6.25/6.58
% 6.25/6.58 Low Water (displace): id=6787, wt=38.000
% 6.25/6.58
% 6.25/6.58 Low Water (displace): id=5754, wt=37.000
% 6.25/6.58
% 6.25/6.58 Low Water (displace): id=13667, wt=36.000
% 6.25/6.58
% 6.25/6.58 Low Water (keep): wt=11.000, iters=3465
% 6.25/6.58
% 6.25/6.58 Low Water (displace): id=1079, wt=24.000
% 158.14/158.42
% 158.14/158.42 Low Water (displace): id=4943, wt=14.000
% 158.14/158.42
% 158.14/158.42 Low Water (keep): wt=10.000, iters=3533
% 158.14/158.42
% 158.14/158.42 ============================== STATISTICS ============================
% 158.14/158.42
% 158.14/158.42 Given=199. Generated=31696710. Kept=177481. proofs=0.
% 158.14/158.42 Usable=196. Sos=9999. Demods=0. Limbo=154894, Disabled=12440. Hints=0.
% 158.14/158.42 Kept_by_rule=0, Deleted_by_rule=0.
% 158.14/158.42 Forward_subsumed=3371784. Back_subsumed=39.
% 158.14/158.42 Sos_limit_deleted=28147445. Sos_displaced=12353. Sos_removed=0.
% 158.14/158.42 New_demodulators=0 (0 lex), Back_demodulated=0. Back_unit_deleted=0.
% 158.14/158.42 Demod_attempts=0. Demod_rewrites=0.
% 158.14/158.42 Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0.
% 158.14/158.42 Nonunit_fsub_feature_tests=26074. Nonunit_bsub_feature_tests=9543.
% 158.14/158.42 Megabytes=419.43.
% 158.14/158.42 User_CPU=141.41, System_CPU=16.01, Wall_clock=157.
% 158.14/158.42
% 158.14/158.42 Megs malloced by palloc(): 400.
% 158.14/158.42 type (bytes each) gets frees in use bytes
% 158.14/158.42 chunk ( 104) 833 833 0 0.0 K
% 158.14/158.42 string_buf ( 8) 738 738 0 0.0 K
% 158.14/158.42 token ( 20) 1842 1842 0 0.0 K
% 158.14/158.42 pterm ( 16) 1026 1026 0 0.0 K
% 158.14/158.42 hashtab ( 8) 18 18 0 0.0 K
% 158.14/158.42 hashnode ( 8) 99 99 0 0.0 K
% 158.14/158.42 term ( 20) 1028295348 1017003080 11292268 220552.1 K
% 158.14/158.42 term arg arrays: 43442.1 K
% 158.14/158.42 attribute ( 12) 170 0 170 2.0 K
% 158.14/158.42 ilist ( 8) 466083713 463842696 2241017 17507.9 K
% 158.14/158.42 plist ( 8) 774648 431570 343078 2680.3 K
% 158.14/158.42 i2list ( 12) 3316 3316 0 0.0 K
% 158.14/158.42 just ( 12) 31696844 31519286 177558 2080.8 K
% 158.14/158.42 parajust ( 16) 0 0 0 0.0 K
% 158.14/158.42 instancejust ( 8) 0 0 0 0.0 K
% 158.14/158.42 ivyjust ( 24) 0 0 0 0.0 K
% 158.14/158.42 formula ( 28) 891 591 300 8.2 K
% 158.14/158.42 formula arg arrays: 1.0 K
% 158.14/158.42 topform ( 52) 31696778 31519230 177548 9016.1 K
% 158.14/158.42 clist_pos ( 20) 212772 35243 177529 3467.4 K
% 158.14/158.42 clist ( 16) 8 1 7 0.1 K
% 158.14/158.42 context ( 808) 67554269 67554264 5 3.9 K
% 158.14/158.42 trail ( 12) 103949501 103949497 4 0.0 K
% 158.14/158.42 ac_match_pos (70044) 0 0 0 0.0 K
% 158.14/158.42 ac_match_free_vars_pos (20020)
% 158.14/158.42 0 0 0 0.0 K
% 158.14/158.42 btm_state ( 60) 0 0 0 0.0 K
% 158.14/158.42 btu_state ( 60) 0 0 0 0.0 K
% 158.14/158.42 ac_position (285432) 0 0 0 0.0 K
% 158.14/158.42 fpa_trie ( 20) 19590 1022 18568 362.7 K
% 158.14/158.42 fpa_state ( 28) 34423893 34423761 132 3.6 K
% 158.14/158.42 fpa_index ( 12) 10 0 10 0.1 K
% 158.14/158.42 fpa_chunk ( 20) 186932 132943 53989 1054.5 K
% 158.14/158.42 fpa_list ( 16) 9249 0 9249 144.5 K
% 158.14/158.42 fpa_list chunks: 27044.5 K
% 158.14/158.42 discrim ( 12) 7743231 211982 7531249 88256.8 K
% 158.14/158.42 discrim_pos ( 16) 3371781 3371781 0 0.0 K
% 158.14/158.42 flat2 ( 32) 372937704 372937704 0 0.0 K
% 158.14/158.42 flat ( 48) 0 0 0 0.0 K
% 158.14/158.42 flatterm ( 32) 0 0 0 0.0 K
% 158.14/158.42 mindex ( 28) 13 0 13 0.4 K
% 158.14/158.42 mindex_pos ( 56) 37065520 37065516 4 0.2 K
% 158.14/158.42 lindex ( 12) 5 0 5 0.1 K
% 158.14/158.42 clash ( 40) 20093 20088 5 0.2 K
% 158.14/158.42 di_tree ( 12) 10769 2158 8611 100.9 K
% 158.14/158.42 avl_node ( 20) 45147 25149 19998 390.6 K
% 158.14/158.42
% 158.14/158.42 Memory report, 20 @ 20 = 400 megs (400.00 megs used).
% 158.14/158.42 List 1, length 7, 0.0 K
% 158.14/158.42 List 2, length 67, 0.5 K
% 158.14/158.42 List 4, length 25, 0.4 K
% 158.14/158.42 List 8, length 22, 0.7 K
% 158.14/158.42 List 14, length 1, 0.1 K
% 158.14/158.42 List 16, length 1318, 82.4 K
% 158.14/158.42 List 26, length 73, 7.4 K
% 158.14/158.42 List 32, length 2385, 298.1 K
% 158.14/158.42 List 64, length 4637, 1159.2 K
% 158.14/158.42 List 128, length 3353, 1676.5 K
% 158.14/158.42 List 202, length 2, 1.6 K
% 158.14/158.42 List 256, length 1227, 1227.0 K
% 158.14/158.42
% 158.14/158.42 ============================== SELECTOR REPORT =======================
% 158.14/158.42 Sos_deleted=28147445, Sos_displaced=12353, Sos_size=9999
% 158.14/158.42 SELECTOR PART PRIORITY ORDER SIZE SELECTED
% 158.14/158.42 I 2147483647 high age 0 27
% 158.14/158.42 H 1 high weight 0 0
% 158.14/158.42 A 1 low age 9999 20
% 158.14/158.42 F 4 low weight 2939 76
% 158.14/158.42 T 4 low weight 7060 76
% 158.14/158.42 ============================== end of selector report ================
% 158.14/158.42
% 158.14/158.42 ============================== end of statistics =====================
% 158.14/158.42
% 158.14/158.42 Exiting with failure.
% 158.14/158.42
% 158.14/158.42 Process 26034 exit (max_megs) Wed Jun 15 09:28:49 2022
% 158.14/158.42 Prover9 interrupted
%------------------------------------------------------------------------------