TSTP Solution File: KLE030+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KLE030+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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 : Sun Jul 17 02:21:52 EDT 2022
% Result : Unknown 72.86s 73.17s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KLE030+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n006.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 : Thu Jun 16 10:10:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.74/1.01 ============================== Prover9 ===============================
% 0.74/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.01 Process 10707 was started by sandbox2 on n006.cluster.edu,
% 0.74/1.01 Thu Jun 16 10:10:42 2022
% 0.74/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_10553_n006.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_10553_n006.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 (19 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 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 2 (all C all B all A addition(A,addition(B,C)) = addition(addition(A,B),C)) # label(additive_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 5 (all A all B all C multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C)) # label(multiplicative_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 8 (all A all B all C multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C))) # label(right_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 9 (all A all B all C multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C))) # label(left_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 11 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 13 (all X0 (test(X0) <-> (exists X1 complement(X1,X0)))) # label(test_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 14 (all X0 all X1 (complement(X1,X0) <-> multiplication(X0,X1) = zero & multiplication(X1,X0) = zero & addition(X0,X1) = one)) # label(test_2) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 15 (all X0 all X1 (test(X0) -> (c(X0) = X1 <-> complement(X0,X1)))) # label(test_3) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 16 (all X0 (-test(X0) -> c(X0) = zero)) # label(test_4) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 17 (all X0 all X1 all X2 (ismeet(X2,X0,X1) <-> leq(X2,X0) & leq(X2,X1) & (all X3 (leq(X3,X0) & leq(X3,X1) -> leq(X3,X2))))) # label(ismeet) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 18 (all X0 all X1 all X2 (ismeetu(X2,X0,X1) <-> (all X3 (leq(X3,X0) & leq(X3,X1) <-> leq(X3,X2))))) # label(ismeetu) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 19 -(all X0 all X1 all X2 all X3 (test(X3) & ismeet(X0,X1,X2) -> ismeet(multiplication(X3,X0),multiplication(X3,X1),X2))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 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 20 -test(A) | complement(f1(A),A) # label(test_1) # label(axiom). [clausify(13)].
% 0.74/1.01 21 test(c4) # label(goals) # label(negated_conjecture). [clausify(19)].
% 0.74/1.01 22 test(A) | c(A) = zero # label(test_4) # label(axiom). [clausify(16)].
% 0.74/1.01 23 test(A) | -complement(B,A) # label(test_1) # label(axiom). [clausify(13)].
% 0.74/1.01 Derived: complement(f1(c4),c4). [resolve(20,a,21,a)].
% 0.74/1.01 Derived: complement(f1(A),A) | c(A) = zero. [resolve(20,a,22,a)].
% 0.74/1.01 Derived: complement(f1(A),A) | -complement(B,A). [resolve(20,a,23,a)].
% 0.74/1.01 24 -test(A) | c(A) != B | complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.74/1.01 Derived: c(c4) != A | complement(c4,A). [resolve(24,a,21,a)].
% 0.74/1.01 Derived: c(A) != B | complement(A,B) | c(A) = zero. [resolve(24,a,22,a)].
% 0.74/1.01 Derived: c(A) != B | complement(A,B) | -complement(C,A). [resolve(24,a,23,a)].
% 0.74/1.01 25 -test(A) | c(A) = B | -complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.74/1.01 Derived: c(c4) = A | -complement(c4,A). [resolve(25,a,21,a)].
% 0.74/1.01 Derived: c(A) = B | -complement(A,B) | c(A) = zero. [resolve(25,a,22,a)].
% 0.74/1.01 Derived: c(A) = B | -complement(A,B) | -complement(C,A). [resolve(25,a,23,a)].
% 0.74/1.01 26 -ismeetu(A,B,C) | leq(D,B) | -leq(D,A) # label(ismeetu) # label(axiom). [clausify(18)].
% 0.74/1.01 27 ismeetu(A,B,C) | leq(f3(B,C,A),B) | leq(f3(B,C,A),A) # label(ismeetu) # label(axiom). [clausify(18)].
% 0.74/1.01 28 ismeetu(A,B,C) | leq(f3(B,C,A),C) | leq(f3(B,C,A),A) # label(ismeetu) # label(axiom). [clausify(18)].
% 0.74/1.01 Derived: leq(A,B) | -leq(A,C) | leq(f3(B,D,C),B) | leq(f3(B,D,C),C). [resolve(26,a,27,a)].
% 0.74/1.01 Derived: leq(A,B) | -leq(A,C) | leq(f3(B,D,C),D) | leq(f3(B,D,C),C). [resolve(26,a,28,a)].
% 0.74/1.01 29 -ismeetu(A,B,C) | leq(D,C) | -leq(D,A) # label(ismeetu) # label(axiom). [clausify(18)].
% 0.74/1.01 Derived: leq(A,B) | -leq(A,C) | leq(f3(D,B,C),D) | leq(f3(D,B,C),C). [resolve(29,a,27,a)].
% 0.74/1.01 Derived: leq(A,B) | -leq(A,C) | leq(f3(D,B,C),B) | leq(f3(D,B,C),C). [resolve(29,a,28,a)].
% 0.74/1.01 30 -ismeetu(A,B,C) | -leq(D,B) | -leq(D,C) | leq(D,A) # label(ismeetu) # label(axiom). [clausify(18)].
% 0.74/1.01 Derived: -leq(A,B) | -leq(A,C) | leq(A,D) | leq(f3(B,C,D),B) | leq(f3(B,C,D),D). [resolve(30,a,27,a)].
% 0.74/1.01 Derived: -leq(A,B) | -leq(A,C) | leq(A,D) | leq(f3(B,C,D),C) | leq(f3(B,C,D),D). [resolve(30,a,28,a)].
% 0.74/1.01 31 ismeetu(A,B,C) | -leq(f3(B,C,A),B) | -leq(f3(B,C,A),C) | -leq(f3(B,C,A),A) # label(ismeetu) # label(axiom). [clausify(18)].
% 0.74/1.01 Derived: -leq(f3(A,B,C),A) | -leq(f3(A,B,C),B) | -leq(f3(A,B,C),C) | leq(D,A) | -leq(D,C). [resolve(31,a,26,a)].
% 0.74/1.01 Derived: -leq(f3(A,B,C),A) | -leq(f3(A,B,C),B) | -leq(f3(A,B,C),C) | leq(D,B) | -leq(D,C). [resolve(31,a,29,a)].
% 0.74/1.01 Derived: -leq(f3(A,B,C),A) | -leq(f3(A,B,C),B) | -leq(f3(A,B,C),C) | -leq(D,A) | -leq(D,B) | leq(D,C). [resolve(31,a,30,a)].
% 0.74/1.01
% 0.74/1.01 ============================== end predicate elimination =============
% 0.74/1.01
% 0.74/1.01 Auto_denials: (non-Horn, no changes).
% 0.74/1.01
% 0.74/1.01 Term ordering decisions:
% 0.74/1.01 Function symbol KB weights: zero=1. one=1. c1=1. c2=1. c3=1. c4=1. multiplication=1. addition=1. c=1. f1=1. f2=1. f3=1.
% 0.74/1.01
% 0.74/1.01 ============================== end of process initial clauses ========
% 0.74/1.01
% 0.74/1.01 ============================== CLAUSES FOR SEARCH ====================
% 72.86/73.16
% 72.86/73.16 ============================== end of clauses for search =============
% 72.86/73.16
% 72.86/73.16 ============================== SEARCH ================================
% 72.86/73.16
% 72.86/73.16 % Starting search at 0.02 seconds.
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=46.000, iters=3355
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=39.000, iters=3388
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=36.000, iters=3339
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=35.000, iters=3423
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=33.000, iters=3340
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=32.000, iters=3411
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=31.000, iters=3412
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=30.000, iters=3341
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=29.000, iters=3395
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=28.000, iters=3356
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=27.000, iters=3362
% 72.86/73.16
% 72.86/73.16 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 62 (0.00 of 0.99 sec).
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=26.000, iters=3335
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=25.000, iters=3385
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=24.000, iters=3336
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=23.000, iters=3365
% 72.86/73.16
% 72.86/73.16 Low Water (displace): id=3359, wt=56.000
% 72.86/73.16
% 72.86/73.16 Low Water (displace): id=4197, wt=52.000
% 72.86/73.16
% 72.86/73.16 Low Water (displace): id=10829, wt=18.000
% 72.86/73.16
% 72.86/73.16 Low Water (displace): id=10831, wt=17.000
% 72.86/73.16
% 72.86/73.16 Low Water (displace): id=10895, wt=13.000
% 72.86/73.16
% 72.86/73.16 Low Water (displace): id=11093, wt=12.000
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=22.000, iters=3340
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=21.000, iters=3349
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=20.000, iters=3333
% 72.86/73.16
% 72.86/73.16 Low Water (displace): id=15243, wt=11.000
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=19.000, iters=3339
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=18.000, iters=3338
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=17.000, iters=3335
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=16.000, iters=3400
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=15.000, iters=3336
% 72.86/73.16
% 72.86/73.16 Low Water (displace): id=24769, wt=9.000
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=14.000, iters=3333
% 72.86/73.16
% 72.86/73.16 Low Water (keep): wt=13.000, iters=3408
% 72.86/73.16
% 72.86/73.16 ============================== STATISTICS ============================
% 72.86/73.16
% 72.86/73.16 Given=7558. Generated=1931908. Kept=240748. proofs=0.
% 72.86/73.16 Usable=7092. Sos=9999. Demods=263. Limbo=832, Disabled=222880. Hints=0.
% 72.86/73.16 Kept_by_rule=0, Deleted_by_rule=0.
% 72.86/73.16 Forward_subsumed=537255. Back_subsumed=144.
% 72.86/73.16 Sos_limit_deleted=1153905. Sos_displaced=221128. Sos_removed=0.
% 72.86/73.16 New_demodulators=580 (8 lex), Back_demodulated=1545. Back_unit_deleted=8.
% 72.86/73.16 Demod_attempts=53849193. Demod_rewrites=2156558.
% 72.86/73.16 Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0.
% 72.86/73.16 Nonunit_fsub_feature_tests=2584164. Nonunit_bsub_feature_tests=251997.
% 72.86/73.16 Megabytes=419.43.
% 72.86/73.16 User_CPU=71.06, System_CPU=1.12, Wall_clock=72.
% 72.86/73.16
% 72.86/73.16 Megs malloced by palloc(): 400.
% 72.86/73.16 type (bytes each) gets frees in use bytes
% 72.86/73.16 chunk ( 104) 543 543 0 0.0 K
% 72.86/73.16 string_buf ( 8) 500 500 0 0.0 K
% 72.86/73.16 token ( 20) 1161 1161 0 0.0 K
% 72.86/73.16 pterm ( 16) 629 629 0 0.0 K
% 72.86/73.16 hashtab ( 8) 19 19 0 0.0 K
% 72.86/73.16 hashnode ( 8) 69 69 0 0.0 K
% 72.86/73.16 term ( 20) 70537802 58671463 11866339 231764.4 K
% 72.86/73.16 term arg arrays: 48113.2 K
% 72.86/73.16 attribute ( 12) 171 0 171 2.0 K
% 72.86/73.16 ilist ( 8) 288713599 286502086 2211513 17277.4 K
% 72.86/73.16 plist ( 8) 12576087 12313547 262540 2051.1 K
% 72.86/73.16 i2list ( 12) 47594281 47594281 0 0.0 K
% 72.86/73.16 just ( 12) 2910528 2555030 355498 4166.0 K
% 72.86/73.16 parajust ( 16) 1005094 983368 21726 339.5 K
% 72.86/73.16 instancejust ( 8) 0 0 0 0.0 K
% 72.86/73.16 ivyjust ( 24) 0 0 0 0.0 K
% 72.86/73.16 formula ( 28) 713 521 192 5.2 K
% 72.86/73.16 formula arg arrays: 0.6 K
% 72.86/73.16 topform ( 52) 1931983 1691160 240823 12229.3 K
% 72.86/73.16 clist_pos ( 20) 711762 470696 241066 4708.3 K
% 72.86/73.16 clist ( 16) 8 1 7 0.1 K
% 72.86/73.16 context ( 808) 13725895 13725891 4 3.2 K
% 72.86/73.16 trail ( 12) 192996346 192996340 6 0.1 K
% 72.86/73.16 ac_match_pos (70044) 0 0 0 0.0 K
% 72.86/73.16 ac_match_free_vars_pos (20020)
% 72.86/73.16 0 0 0 0.0 K
% 72.86/73.17 btm_state ( 60) 0 0 0 0.0 K
% 72.86/73.17 btu_state ( 60) 0 0 0 0.0 K
% 72.86/73.17 ac_position (285432) 0 0 0 0.0 K
% 72.86/73.17 fpa_trie ( 20) 4641245 4596560 44685 872.8 K
% 72.86/73.17 fpa_state ( 28) 4972737 4972510 227 6.2 K
% 72.86/73.17 fpa_index ( 12) 10 0 10 0.1 K
% 72.86/73.17 fpa_chunk ( 20) 5879553 5845791 33762 659.4 K
% 72.86/73.17 fpa_list ( 16) 4611173 0 4611173 72049.6 K
% 72.86/73.17 fpa_list chunks: 2692.8 K
% 72.86/73.17 discrim ( 12) 3465004 3392083 72921 854.5 K
% 72.86/73.17 discrim_pos ( 16) 10835519 10835519 0 0.0 K
% 72.86/73.17 flat2 ( 32) 30150877 30150877 0 0.0 K
% 72.86/73.17 flat ( 48) 0 0 0 0.0 K
% 72.86/73.17 flatterm ( 32) 184625656 184625656 0 0.0 K
% 72.86/73.17 mindex ( 28) 13 0 13 0.4 K
% 72.86/73.17 mindex_pos ( 56) 8248703 8248700 3 0.2 K
% 72.86/73.17 lindex ( 12) 5 0 5 0.1 K
% 72.86/73.17 clash ( 40) 372724 372720 4 0.2 K
% 72.86/73.17 di_tree ( 12) 378467 182355 196112 2298.2 K
% 72.86/73.17 avl_node ( 20) 479776 459778 19998 390.6 K
% 72.86/73.17
% 72.86/73.17 Memory report, 20 @ 20 = 400 megs (400.00 megs used).
% 72.86/73.17 List 1, length 14, 0.1 K
% 72.86/73.17 List 2, length 55, 0.4 K
% 72.86/73.17 List 3, length 98957, 1159.7 K
% 72.86/73.17 List 4, length 1, 0.0 K
% 72.86/73.17 List 6, length 4, 0.1 K
% 72.86/73.17 List 8, length 104, 3.2 K
% 72.86/73.17 List 10, length 2, 0.1 K
% 72.86/73.17 List 14, length 1, 0.1 K
% 72.86/73.17 List 16, length 2483, 155.2 K
% 72.86/73.17 List 26, length 41, 4.2 K
% 72.86/73.17 List 32, length 2040, 255.0 K
% 72.86/73.17 List 64, length 2285, 571.2 K
% 72.86/73.17 List 128, length 381, 190.5 K
% 72.86/73.17 List 202, length 2, 1.6 K
% 72.86/73.17
% 72.86/73.17 ============================== SELECTOR REPORT =======================
% 72.86/73.17 Sos_deleted=1153905, Sos_displaced=221128, Sos_size=9999
% 72.86/73.17 SELECTOR PART PRIORITY ORDER SIZE SELECTED
% 72.86/73.17 I 2147483647 high age 0 56
% 72.86/73.17 H 1 high weight 0 0
% 72.86/73.17 A 1 low age 9999 1380
% 72.86/73.17 F 4 low weight 915 604
% 72.86/73.17 T 4 low weight 9084 5518
% 72.86/73.17 ============================== end of selector report ================
% 72.86/73.17
% 72.86/73.17 ============================== end of statistics =====================
% 72.86/73.17
% 72.86/73.17 Exiting with failure.
% 72.86/73.17
% 72.86/73.17 Process 10707 exit (max_megs) Thu Jun 16 10:11:54 2022
% 72.86/73.17 Prover9 interrupted
%------------------------------------------------------------------------------