TSTP Solution File: KLE031+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KLE031+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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 123.04s 123.38s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE031+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 10:22:56 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.42/1.02 ============================== Prover9 ===============================
% 0.42/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.02 Process 31557 was started by sandbox2 on n025.cluster.edu,
% 0.42/1.02 Thu Jun 16 10:22:57 2022
% 0.42/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_31404_n025.cluster.edu".
% 0.42/1.02 ============================== end of head ===========================
% 0.42/1.02
% 0.42/1.02 ============================== INPUT =================================
% 0.42/1.02
% 0.42/1.02 % Reading from file /tmp/Prover9_31404_n025.cluster.edu
% 0.42/1.02
% 0.42/1.02 set(prolog_style_variables).
% 0.42/1.02 set(auto2).
% 0.42/1.02 % set(auto2) -> set(auto).
% 0.42/1.02 % set(auto) -> set(auto_inference).
% 0.42/1.02 % set(auto) -> set(auto_setup).
% 0.42/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.02 % set(auto) -> set(auto_limits).
% 0.42/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.02 % set(auto) -> set(auto_denials).
% 0.42/1.02 % set(auto) -> set(auto_process).
% 0.42/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.02 % set(auto2) -> assign(stats, some).
% 0.42/1.02 % set(auto2) -> clear(echo_input).
% 0.42/1.02 % set(auto2) -> set(quiet).
% 0.42/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.02 % set(auto2) -> clear(print_given).
% 0.42/1.02 assign(lrs_ticks,-1).
% 0.42/1.02 assign(sos_limit,10000).
% 0.42/1.02 assign(order,kbo).
% 0.42/1.02 set(lex_order_vars).
% 0.42/1.02 clear(print_given).
% 0.42/1.02
% 0.42/1.02 % formulas(sos). % not echoed (19 formulas)
% 0.42/1.02
% 0.42/1.02 ============================== end of input ==========================
% 0.42/1.02
% 0.42/1.02 % From the command line: assign(max_seconds, 300).
% 0.42/1.02
% 0.42/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.02
% 0.42/1.02 % Formulas that are not ordinary clauses:
% 0.42/1.02 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 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.42/1.02 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 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.42/1.02 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 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.42/1.02 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.42/1.02 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 11 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 13 (all X0 (test(X0) <-> (exists X1 complement(X1,X0)))) # label(test_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 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.42/1.03 15 (all X0 all X1 (test(X0) -> (c(X0) = X1 <-> complement(X0,X1)))) # label(test_3) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.03 16 (all X0 (-test(X0) -> c(X0) = zero)) # label(test_4) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.03 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.42/1.03 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.42/1.03 19 -(all X0 all X1 all X2 all X3 (test(X3) & ismeet(X0,X1,X2) -> ismeet(multiplication(X3,X0),multiplication(X3,X1),multiplication(X3,X2)))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/1.03
% 0.42/1.03 ============================== end of process non-clausal formulas ===
% 0.42/1.03
% 0.42/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.03
% 0.42/1.03 ============================== PREDICATE ELIMINATION =================
% 0.42/1.03 20 -test(A) | complement(f1(A),A) # label(test_1) # label(axiom). [clausify(13)].
% 0.42/1.03 21 test(c4) # label(goals) # label(negated_conjecture). [clausify(19)].
% 0.42/1.03 22 test(A) | c(A) = zero # label(test_4) # label(axiom). [clausify(16)].
% 0.42/1.03 23 test(A) | -complement(B,A) # label(test_1) # label(axiom). [clausify(13)].
% 0.42/1.03 Derived: complement(f1(c4),c4). [resolve(20,a,21,a)].
% 0.42/1.03 Derived: complement(f1(A),A) | c(A) = zero. [resolve(20,a,22,a)].
% 0.42/1.03 Derived: complement(f1(A),A) | -complement(B,A). [resolve(20,a,23,a)].
% 0.42/1.03 24 -test(A) | c(A) != B | complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.42/1.03 Derived: c(c4) != A | complement(c4,A). [resolve(24,a,21,a)].
% 0.42/1.03 Derived: c(A) != B | complement(A,B) | c(A) = zero. [resolve(24,a,22,a)].
% 0.42/1.03 Derived: c(A) != B | complement(A,B) | -complement(C,A). [resolve(24,a,23,a)].
% 0.42/1.03 25 -test(A) | c(A) = B | -complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.42/1.03 Derived: c(c4) = A | -complement(c4,A). [resolve(25,a,21,a)].
% 0.42/1.03 Derived: c(A) = B | -complement(A,B) | c(A) = zero. [resolve(25,a,22,a)].
% 0.42/1.03 Derived: c(A) = B | -complement(A,B) | -complement(C,A). [resolve(25,a,23,a)].
% 0.42/1.03 26 -ismeetu(A,B,C) | leq(D,B) | -leq(D,A) # label(ismeetu) # label(axiom). [clausify(18)].
% 0.42/1.03 27 ismeetu(A,B,C) | leq(f3(B,C,A),B) | leq(f3(B,C,A),A) # label(ismeetu) # label(axiom). [clausify(18)].
% 0.42/1.03 28 ismeetu(A,B,C) | leq(f3(B,C,A),C) | leq(f3(B,C,A),A) # label(ismeetu) # label(axiom). [clausify(18)].
% 0.42/1.03 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.42/1.03 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.42/1.03 29 -ismeetu(A,B,C) | leq(D,C) | -leq(D,A) # label(ismeetu) # label(axiom). [clausify(18)].
% 0.42/1.03 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.42/1.03 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.42/1.03 30 -ismeetu(A,B,C) | -leq(D,B) | -leq(D,C) | leq(D,A) # label(ismeetu) # label(axiom). [clausify(18)].
% 0.42/1.03 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.42/1.03 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.42/1.03 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.42/1.03 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.42/1.03 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.42/1.03 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.42/1.03
% 0.42/1.03 ============================== end predicate elimination =============
% 0.42/1.03
% 0.42/1.03 Auto_denials: (non-Horn, no changes).
% 0.42/1.03
% 0.42/1.03 Term ordering decisions:
% 0.42/1.03 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.42/1.03
% 0.42/1.03 ============================== end of process initial clauses ========
% 0.42/1.03
% 0.42/1.03 ============================== CLAUSES FOR SEARCH ====================
% 123.04/123.38
% 123.04/123.38 ============================== end of clauses for search =============
% 123.04/123.38
% 123.04/123.38 ============================== SEARCH ================================
% 123.04/123.38
% 123.04/123.38 % Starting search at 0.02 seconds.
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=41.000, iters=3582
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=39.000, iters=3605
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=33.000, iters=3386
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=32.000, iters=3339
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=31.000, iters=3450
% 123.04/123.38
% 123.04/123.38 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 35 (0.00 of 0.64 sec).
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=29.000, iters=3345
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=28.000, iters=3441
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=27.000, iters=3357
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=26.000, iters=3382
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=25.000, iters=3382
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=24.000, iters=3396
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=23.000, iters=3339
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=22.000, iters=3341
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=21.000, iters=3373
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=20.000, iters=3355
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=19.000, iters=3345
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=18.000, iters=3369
% 123.04/123.38
% 123.04/123.38 Low Water (displace): id=3697, wt=56.000
% 123.04/123.38
% 123.04/123.38 Low Water (displace): id=3926, wt=52.000
% 123.04/123.38
% 123.04/123.38 Low Water (displace): id=11350, wt=17.000
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=17.000, iters=3337
% 123.04/123.38
% 123.04/123.38 Low Water (displace): id=15194, wt=16.000
% 123.04/123.38
% 123.04/123.38 Low Water (displace): id=15730, wt=15.000
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=16.000, iters=3360
% 123.04/123.38
% 123.04/123.38 Low Water (displace): id=24796, wt=14.000
% 123.04/123.38
% 123.04/123.38 Low Water (displace): id=51814, wt=13.000
% 123.04/123.38
% 123.04/123.38 Low Water (keep): wt=15.000, iters=3334
% 123.04/123.38
% 123.04/123.38 ============================== STATISTICS ============================
% 123.04/123.38
% 123.04/123.38 Given=7526. Generated=1674999. Kept=145503. proofs=0.
% 123.04/123.38 Usable=7311. Sos=10000. Demods=284. Limbo=1420, Disabled=126827. Hints=0.
% 123.04/123.38 Kept_by_rule=0, Deleted_by_rule=218161.
% 123.04/123.38 Forward_subsumed=418907. Back_subsumed=124.
% 123.04/123.38 Sos_limit_deleted=892428. Sos_displaced=125983. Sos_removed=0.
% 123.04/123.38 New_demodulators=374 (8 lex), Back_demodulated=657. Back_unit_deleted=8.
% 123.04/123.38 Demod_attempts=125173099. Demod_rewrites=2276298.
% 123.04/123.38 Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0.
% 123.04/123.38 Nonunit_fsub_feature_tests=1329921. Nonunit_bsub_feature_tests=57385.
% 123.04/123.38 Megabytes=419.43.
% 123.04/123.38 User_CPU=121.27, System_CPU=1.07, Wall_clock=122.
% 123.04/123.38
% 123.04/123.38 Megs malloced by palloc(): 400.
% 123.04/123.38 type (bytes each) gets frees in use bytes
% 123.04/123.38 chunk ( 104) 545 545 0 0.0 K
% 123.04/123.38 string_buf ( 8) 502 502 0 0.0 K
% 123.04/123.38 token ( 20) 1166 1166 0 0.0 K
% 123.04/123.38 pterm ( 16) 633 633 0 0.0 K
% 123.04/123.38 hashtab ( 8) 19 19 0 0.0 K
% 123.04/123.38 hashnode ( 8) 69 69 0 0.0 K
% 123.04/123.38 term ( 20) 177271778 164679309 12592469 245946.7 K
% 123.04/123.38 term arg arrays: 50626.1 K
% 123.04/123.38 attribute ( 12) 171 0 171 2.0 K
% 123.04/123.38 ilist ( 8) 317023349 315758569 1264780 9881.1 K
% 123.04/123.38 plist ( 8) 12831303 12664687 166616 1301.7 K
% 123.04/123.38 i2list ( 12) 57067781 57067781 0 0.0 K
% 123.04/123.38 just ( 12) 2563915 2345400 218515 2560.7 K
% 123.04/123.38 parajust ( 16) 815484 780823 34661 541.6 K
% 123.04/123.38 instancejust ( 8) 0 0 0 0.0 K
% 123.04/123.38 ivyjust ( 24) 0 0 0 0.0 K
% 123.04/123.38 formula ( 28) 713 521 192 5.2 K
% 123.04/123.38 formula arg arrays: 0.6 K
% 123.04/123.38 topform ( 52) 1675073 1529496 145577 7392.6 K
% 123.04/123.38 clist_pos ( 20) 424393 278551 145842 2848.5 K
% 123.04/123.38 clist ( 16) 8 1 7 0.1 K
% 123.04/123.38 context ( 808) 11490669 11490669 0 0.0 K
% 123.04/123.38 trail ( 12) 161950307 161950307 0 0.0 K
% 123.04/123.38 ac_match_pos (70044) 0 0 0 0.0 K
% 123.04/123.38 ac_match_free_vars_pos (20020)
% 123.04/123.38 0 0 0 0.0 K
% 123.04/123.38 btm_state ( 60) 0 0 0 0.0 K
% 123.04/123.38 btu_state ( 60) 0 0 0 0.0 K
% 123.04/123.38 ac_position (285432) 0 0 0 0.0 K
% 123.04/123.38 fpa_trie ( 20) 4529297 4411930 117367 2292.3 K
% 123.04/123.38 fpa_state ( 28) 5025903 5025903 0 0.0 K
% 123.04/123.38 fpa_index ( 12) 10 0 10 0.1 K
% 123.04/123.38 fpa_chunk ( 20) 5851886 5789486 62400 1218.8 K
% 123.04/123.38 fpa_list ( 16) 4441305 0 4441305 69395.4 K
% 123.04/123.38 fpa_list chunks: 5311.0 K
% 123.04/123.38 discrim ( 12) 6091522 5909437 182085 2133.8 K
% 123.04/123.38 discrim_pos ( 16) 12600606 12600606 0 0.0 K
% 123.04/123.38 flat2 ( 32) 33894491 33894491 0 0.0 K
% 123.04/123.38 flat ( 48) 0 0 0 0.0 K
% 123.04/123.38 flatterm ( 32) 523932092 523932092 0 0.0 K
% 123.04/123.38 mindex ( 28) 13 0 13 0.4 K
% 123.04/123.38 mindex_pos ( 56) 6155311 6155311 0 0.0 K
% 123.04/123.38 lindex ( 12) 5 0 5 0.1 K
% 123.04/123.38 clash ( 40) 455099 455099 0 0.0 K
% 123.04/123.38 di_tree ( 12) 226564 78065 148499 1740.2 K
% 123.04/123.38 avl_node ( 20) 288110 268110 20000 390.6 K
% 123.04/123.38
% 123.04/123.38 Memory report, 20 @ 20 = 400 megs (400.00 megs used).
% 123.04/123.38 List 1, length 14, 0.1 K
% 123.04/123.38 List 2, length 290, 2.3 K
% 123.04/123.38 List 3, length 18250, 213.9 K
% 123.04/123.38 List 5, length 413, 8.1 K
% 123.04/123.38 List 6, length 9, 0.2 K
% 123.04/123.38 List 7, length 91, 2.5 K
% 123.04/123.38 List 8, length 856, 26.8 K
% 123.04/123.38 List 10, length 7, 0.3 K
% 123.04/123.38 List 13, length 1, 0.1 K
% 123.04/123.38 List 14, length 4, 0.2 K
% 123.04/123.38 List 16, length 4077, 254.8 K
% 123.04/123.38 List 26, length 41, 4.2 K
% 123.04/123.38 List 32, length 1412, 176.5 K
% 123.04/123.38 List 64, length 379, 94.8 K
% 123.04/123.38 List 128, length 698, 349.0 K
% 123.04/123.38 List 202, length 7, 5.5 K
% 123.04/123.38 List 256, length 518, 518.0 K
% 123.04/123.38
% 123.04/123.38 ============================== SELECTOR REPORT =======================
% 123.04/123.38 Sos_deleted=892428, Sos_displaced=125983, Sos_size=10000
% 123.04/123.38 SELECTOR PART PRIORITY ORDER SIZE SELECTED
% 123.04/123.38 I 2147483647 high age 0 56
% 123.04/123.38 H 1 high weight 0 0
% 123.04/123.38 A 1 low age 10000 836
% 123.04/123.38 F 4 low weight 1284 3292
% 123.04/123.38 T 4 low weight 8716 3342
% 123.04/123.38 ============================== end of selector report ================
% 123.04/123.38
% 123.04/123.38 ============================== end of statistics =====================
% 123.04/123.38
% 123.04/123.38 Exiting with failure.
% 123.04/123.38
% 123.04/123.38 Process 31557 exit (max_megs) Thu Jun 16 10:24:59 2022
% 123.04/123.38 Prover9 interrupted
%------------------------------------------------------------------------------