TSTP Solution File: GRP124-4.004 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP124-4.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.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 : Sat Jul 16 11:17:20 EDT 2022
% Result : Unsatisfiable 0.71s 1.06s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GRP124-4.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.32 % Computer : n010.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Tue Jun 14 07:23:24 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.67/0.97 ============================== Prover9 ===============================
% 0.67/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.67/0.97 Process 26726 was started by sandbox on n010.cluster.edu,
% 0.67/0.97 Tue Jun 14 07:23:25 2022
% 0.67/0.97 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26381_n010.cluster.edu".
% 0.67/0.97 ============================== end of head ===========================
% 0.67/0.97
% 0.67/0.97 ============================== INPUT =================================
% 0.67/0.97
% 0.67/0.97 % Reading from file /tmp/Prover9_26381_n010.cluster.edu
% 0.67/0.97
% 0.67/0.97 set(prolog_style_variables).
% 0.67/0.97 set(auto2).
% 0.67/0.97 % set(auto2) -> set(auto).
% 0.67/0.97 % set(auto) -> set(auto_inference).
% 0.67/0.97 % set(auto) -> set(auto_setup).
% 0.67/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.67/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/0.97 % set(auto) -> set(auto_limits).
% 0.67/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/0.97 % set(auto) -> set(auto_denials).
% 0.67/0.97 % set(auto) -> set(auto_process).
% 0.67/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.67/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.67/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.67/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.67/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.67/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.67/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.67/0.97 % set(auto2) -> assign(stats, some).
% 0.67/0.97 % set(auto2) -> clear(echo_input).
% 0.67/0.97 % set(auto2) -> set(quiet).
% 0.67/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.67/0.97 % set(auto2) -> clear(print_given).
% 0.67/0.97 assign(lrs_ticks,-1).
% 0.67/0.97 assign(sos_limit,10000).
% 0.67/0.97 assign(order,kbo).
% 0.67/0.97 set(lex_order_vars).
% 0.67/0.97 clear(print_given).
% 0.67/0.97
% 0.67/0.97 % formulas(sos). % not echoed (25 formulas)
% 0.67/0.97
% 0.67/0.97 ============================== end of input ==========================
% 0.67/0.97
% 0.67/0.97 % From the command line: assign(max_seconds, 300).
% 0.67/0.97
% 0.67/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/0.97
% 0.67/0.97 % Formulas that are not ordinary clauses:
% 0.67/0.97
% 0.67/0.97 ============================== end of process non-clausal formulas ===
% 0.67/0.97
% 0.67/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.67/0.97
% 0.67/0.97 ============================== PREDICATE ELIMINATION =================
% 0.67/0.97 1 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.67/0.97 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.67/0.97 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.67/0.97 4 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom). [assumption].
% 0.67/0.97 5 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.67/0.97 6 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.67/0.97 7 -equalish(e_2,e_4) # label(e_2_is_not_e_4) # label(axiom). [assumption].
% 0.67/0.97 8 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.67/0.97 9 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.67/0.97 10 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom). [assumption].
% 0.67/0.97 11 -equalish(e_4,e_1) # label(e_4_is_not_e_1) # label(axiom). [assumption].
% 0.67/0.97 12 -equalish(e_4,e_2) # label(e_4_is_not_e_2) # label(axiom). [assumption].
% 0.67/0.97 13 -equalish(e_4,e_3) # label(e_4_is_not_e_3) # label(axiom). [assumption].
% 0.67/0.97 Derived: -product(A,B,e_1) | -product(A,B,e_2). [resolve(1,c,2,a)].
% 0.67/0.97 Derived: -product(A,B,e_1) | -product(A,B,e_3). [resolve(1,c,3,a)].
% 0.67/0.97 Derived: -product(A,B,e_1) | -product(A,B,e_4). [resolve(1,c,4,a)].
% 0.67/0.97 Derived: -product(A,B,e_2) | -product(A,B,e_3). [resolve(1,c,6,a)].
% 0.67/0.97 Derived: -product(A,B,e_2) | -product(A,B,e_4). [resolve(1,c,7,a)].
% 0.67/0.97 Derived: -product(A,B,e_3) | -product(A,B,e_4). [resolve(1,c,10,a)].
% 0.67/0.97 14 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.67/0.97 Derived: -product(A,e_1,B) | -product(A,e_2,B). [resolve(14,c,2,a)].
% 0.67/0.97 Derived: -product(A,e_1,B) | -product(A,e_3,B). [resolve(14,c,3,a)].
% 0.67/0.97 Derived: -product(A,e_1,B) | -product(A,e_4,B). [resolve(14,c,4,a)].
% 0.71/1.06 Derived: -product(A,e_2,B) | -product(A,e_3,B). [resolve(14,c,6,a)].
% 0.71/1.06 Derived: -product(A,e_2,B) | -product(A,e_4,B). [resolve(14,c,7,a)].
% 0.71/1.06 Derived: -product(A,e_3,B) | -product(A,e_4,B). [resolve(14,c,10,a)].
% 0.71/1.06 15 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.71/1.06 Derived: -product(e_1,A,B) | -product(e_2,A,B). [resolve(15,c,2,a)].
% 0.71/1.06 Derived: -product(e_1,A,B) | -product(e_3,A,B). [resolve(15,c,3,a)].
% 0.71/1.06 Derived: -product(e_1,A,B) | -product(e_4,A,B). [resolve(15,c,4,a)].
% 0.71/1.06 Derived: -product(e_2,A,B) | -product(e_3,A,B). [resolve(15,c,6,a)].
% 0.71/1.06 Derived: -product(e_2,A,B) | -product(e_4,A,B). [resolve(15,c,7,a)].
% 0.71/1.06 Derived: -product(e_3,A,B) | -product(e_4,A,B). [resolve(15,c,10,a)].
% 0.71/1.06 16 -product(A,B,C) | -product(D,E,C) | -product(F,A,B) | -product(F,D,E) | equalish(A,D) # label(qg2_1) # label(negated_conjecture). [assumption].
% 0.71/1.06 Derived: -product(e_1,A,B) | -product(e_2,C,B) | -product(D,e_1,A) | -product(D,e_2,C). [resolve(16,e,2,a)].
% 0.71/1.06 Derived: -product(e_1,A,B) | -product(e_3,C,B) | -product(D,e_1,A) | -product(D,e_3,C). [resolve(16,e,3,a)].
% 0.71/1.06 Derived: -product(e_1,A,B) | -product(e_4,C,B) | -product(D,e_1,A) | -product(D,e_4,C). [resolve(16,e,4,a)].
% 0.71/1.06 Derived: -product(e_2,A,B) | -product(e_3,C,B) | -product(D,e_2,A) | -product(D,e_3,C). [resolve(16,e,6,a)].
% 0.71/1.06 Derived: -product(e_2,A,B) | -product(e_4,C,B) | -product(D,e_2,A) | -product(D,e_4,C). [resolve(16,e,7,a)].
% 0.71/1.06 Derived: -product(e_3,A,B) | -product(e_4,C,B) | -product(D,e_3,A) | -product(D,e_4,C). [resolve(16,e,10,a)].
% 0.71/1.06 17 -product(A,B,C) | -product(D,E,C) | -product(F,A,B) | -product(F,D,E) | equalish(B,E) # label(qg2_2) # label(negated_conjecture). [assumption].
% 0.71/1.06 Derived: -product(A,e_1,B) | -product(C,e_2,B) | -product(D,A,e_1) | -product(D,C,e_2). [resolve(17,e,2,a)].
% 0.71/1.06 Derived: -product(A,e_1,B) | -product(C,e_3,B) | -product(D,A,e_1) | -product(D,C,e_3). [resolve(17,e,3,a)].
% 0.71/1.06 Derived: -product(A,e_1,B) | -product(C,e_4,B) | -product(D,A,e_1) | -product(D,C,e_4). [resolve(17,e,4,a)].
% 0.71/1.06 Derived: -product(A,e_2,B) | -product(C,e_3,B) | -product(D,A,e_2) | -product(D,C,e_3). [resolve(17,e,6,a)].
% 0.71/1.06 Derived: -product(A,e_2,B) | -product(C,e_4,B) | -product(D,A,e_2) | -product(D,C,e_4). [resolve(17,e,7,a)].
% 0.71/1.06 Derived: -product(A,e_3,B) | -product(C,e_4,B) | -product(D,A,e_3) | -product(D,C,e_4). [resolve(17,e,10,a)].
% 0.71/1.06
% 0.71/1.06 ============================== end predicate elimination =============
% 0.71/1.06
% 0.71/1.06 Auto_denials: (non-Horn, no changes).
% 0.71/1.06
% 0.71/1.06 Term ordering decisions:
% 0.71/1.06 Function symbol KB weights: e_1=1. e_2=1. e_3=1. e_4=1.
% 0.71/1.06
% 0.71/1.06 ============================== end of process initial clauses ========
% 0.71/1.06
% 0.71/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.06
% 0.71/1.06 ============================== end of clauses for search =============
% 0.71/1.06
% 0.71/1.06 ============================== SEARCH ================================
% 0.71/1.06
% 0.71/1.06 % Starting search at 0.01 seconds.
% 0.71/1.06
% 0.71/1.06 ============================== PROOF =================================
% 0.71/1.06 % SZS status Unsatisfiable
% 0.71/1.06 % SZS output start Refutation
% 0.71/1.06
% 0.71/1.06 % Proof 1 at 0.10 (+ 0.01) seconds.
% 0.71/1.06 % Length of proof is 70.
% 0.71/1.06 % Level of proof is 10.
% 0.71/1.06 % Maximum clause weight is 20.000.
% 0.71/1.06 % Given clauses 266.
% 0.71/1.06
% 0.71/1.06 1 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.71/1.06 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.71/1.06 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.71/1.06 4 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom). [assumption].
% 0.71/1.06 6 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.71/1.06 7 -equalish(e_2,e_4) # label(e_2_is_not_e_4) # label(axiom). [assumption].
% 0.71/1.06 10 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom). [assumption].
% 0.71/1.06 14 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.71/1.06 15 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.71/1.06 16 -product(A,B,C) | -product(D,E,C) | -product(F,A,B) | -product(F,D,E) | equalish(A,D) # label(qg2_1) # label(negated_conjecture). [assumption].
% 0.71/1.06 17 -product(A,B,C) | -product(D,E,C) | -product(F,A,B) | -product(F,D,E) | equalish(B,E) # label(qg2_2) # label(negated_conjecture). [assumption].
% 0.71/1.06 18 group_element(e_1) # label(element_1) # label(axiom). [assumption].
% 0.71/1.06 19 group_element(e_2) # label(element_2) # label(axiom). [assumption].
% 0.71/1.06 20 group_element(e_3) # label(element_3) # label(axiom). [assumption].
% 0.71/1.06 21 group_element(e_4) # label(element_4) # label(axiom). [assumption].
% 0.71/1.06 22 product(A,A,A) # label(product_idempotence) # label(axiom). [assumption].
% 0.71/1.06 23 -group_element(A) | -group_element(B) | product(e_1,A,B) | product(e_2,A,B) | product(e_3,A,B) | product(e_4,A,B) # label(row_surjectivity) # label(axiom). [assumption].
% 0.71/1.06 24 -group_element(A) | -group_element(B) | product(A,e_1,B) | product(A,e_2,B) | product(A,e_3,B) | product(A,e_4,B) # label(column_surjectivity) # label(axiom). [assumption].
% 0.71/1.06 26 -product(A,B,e_1) | -product(A,B,e_2). [resolve(1,c,2,a)].
% 0.71/1.06 27 -product(A,B,e_1) | -product(A,B,e_3). [resolve(1,c,3,a)].
% 0.71/1.06 28 -product(A,B,e_1) | -product(A,B,e_4). [resolve(1,c,4,a)].
% 0.71/1.06 29 -product(A,B,e_2) | -product(A,B,e_3). [resolve(1,c,6,a)].
% 0.71/1.06 30 -product(A,B,e_2) | -product(A,B,e_4). [resolve(1,c,7,a)].
% 0.71/1.06 31 -product(A,B,e_3) | -product(A,B,e_4). [resolve(1,c,10,a)].
% 0.71/1.06 33 -product(A,e_1,B) | -product(A,e_3,B). [resolve(14,c,3,a)].
% 0.71/1.06 34 -product(A,e_1,B) | -product(A,e_4,B). [resolve(14,c,4,a)].
% 0.71/1.06 35 -product(A,e_2,B) | -product(A,e_3,B). [resolve(14,c,6,a)].
% 0.71/1.06 37 -product(A,e_3,B) | -product(A,e_4,B). [resolve(14,c,10,a)].
% 0.71/1.06 38 -product(e_1,A,B) | -product(e_2,A,B). [resolve(15,c,2,a)].
% 0.71/1.06 40 -product(e_1,A,B) | -product(e_4,A,B). [resolve(15,c,4,a)].
% 0.71/1.06 44 -product(e_1,A,B) | -product(e_2,C,B) | -product(D,e_1,A) | -product(D,e_2,C). [resolve(16,e,2,a)].
% 0.71/1.06 51 -product(A,e_1,B) | -product(C,e_3,B) | -product(D,A,e_1) | -product(D,C,e_3). [resolve(17,e,3,a)].
% 0.71/1.06 53 -product(A,e_2,B) | -product(C,e_3,B) | -product(D,A,e_2) | -product(D,C,e_3). [resolve(17,e,6,a)].
% 0.71/1.06 90 -product(A,e_1,e_3) | -product(e_3,A,e_1). [factor(51,b,d),unit_del(b,22)].
% 0.71/1.06 95 -product(A,e_3,e_2) | -product(e_2,A,e_3). [factor(53,a,c),unit_del(a,22)].
% 0.71/1.06 107 -group_element(A) | product(e_1,e_4,A) | product(e_2,e_4,A) | product(e_3,e_4,A) | product(e_4,e_4,A). [resolve(23,a,21,a)].
% 0.71/1.06 108 -group_element(A) | product(e_1,e_3,A) | product(e_2,e_3,A) | product(e_3,e_3,A) | product(e_4,e_3,A). [resolve(23,a,20,a)].
% 0.71/1.06 110 -group_element(A) | product(e_1,e_1,A) | product(e_2,e_1,A) | product(e_3,e_1,A) | product(e_4,e_1,A). [resolve(23,a,18,a)].
% 0.71/1.06 118 -group_element(A) | product(e_1,e_1,A) | product(e_1,e_2,A) | product(e_1,e_3,A) | product(e_1,e_4,A). [resolve(24,a,18,a)].
% 0.71/1.06 132 -product(e_1,e_1,e_2). [ur(26,a,22,a)].
% 0.71/1.06 134 -product(e_1,e_1,e_3). [ur(27,a,22,a)].
% 0.71/1.06 135 -product(e_4,e_4,e_1). [resolve(28,b,22,a)].
% 0.71/1.06 136 -product(e_1,e_1,e_4). [ur(28,a,22,a)].
% 0.71/1.06 137 -product(e_3,e_3,e_2). [resolve(29,b,22,a)].
% 0.71/1.06 141 -product(e_4,e_4,e_3). [resolve(31,b,22,a)].
% 0.71/1.06 145 -product(e_3,e_1,e_3). [resolve(33,b,22,a)].
% 0.71/1.06 148 -product(e_1,e_4,e_1). [ur(34,a,22,a)].
% 0.71/1.06 150 -product(e_2,e_3,e_2). [ur(35,a,22,a)].
% 0.71/1.06 154 -product(e_3,e_4,e_3). [ur(37,a,22,a)].
% 0.71/1.06 155 -product(e_1,e_2,e_2). [resolve(38,b,22,a)].
% 0.71/1.06 159 -product(e_1,e_4,e_4). [resolve(40,b,22,a)].
% 0.71/1.06 169 -product(e_1,e_1,A) | -product(e_2,B,A) | -product(e_1,e_2,B). [resolve(44,c,22,a)].
% 0.71/1.06 205 -product(e_2,e_2,A) | -product(B,e_3,A) | -product(e_2,B,e_3). [resolve(53,c,22,a)].
% 0.71/1.06 215 product(e_1,e_4,e_3) | product(e_2,e_4,e_3). [resolve(107,a,20,a),unit_del(c,154),unit_del(d,141)].
% 0.71/1.06 217 product(e_2,e_4,e_1) | product(e_3,e_4,e_1). [resolve(107,a,18,a),unit_del(a,148),unit_del(d,135)].
% 0.71/1.06 219 product(e_1,e_4,e_3) | -product(e_4,e_3,e_2). [resolve(215,b,95,b)].
% 0.71/1.06 251 product(e_2,e_4,e_1) | -product(e_4,e_1,e_3). [resolve(217,b,90,b)].
% 0.71/1.06 266 product(e_1,e_3,e_2) | product(e_4,e_3,e_2). [resolve(108,a,19,a),unit_del(b,150),unit_del(c,137)].
% 0.71/1.06 273 product(e_2,e_1,e_3) | product(e_4,e_1,e_3). [resolve(110,a,20,a),unit_del(a,134),unit_del(c,145)].
% 0.71/1.06 292 product(e_1,e_3,e_2) | product(e_1,e_4,e_3). [resolve(266,b,219,b)].
% 0.71/1.06 403 product(e_2,e_1,e_3) | product(e_2,e_4,e_1). [resolve(273,b,251,b)].
% 0.71/1.06 462 product(e_1,e_3,e_2) | -product(e_1,e_4,e_2). [resolve(292,b,29,b)].
% 0.71/1.06 515 product(e_1,e_2,e_4) | product(e_1,e_3,e_4). [resolve(118,a,21,a),unit_del(a,136),unit_del(d,159)].
% 0.71/1.06 517 product(e_1,e_3,e_2) | product(e_1,e_4,e_2). [resolve(118,a,19,a),unit_del(a,132),unit_del(b,155)].
% 0.71/1.06 571 product(e_2,e_1,e_3) | -product(e_1,e_2,e_4). [resolve(403,b,169,b),unit_del(b,22)].
% 0.71/1.06 918 product(e_1,e_2,e_4) | -product(e_1,e_3,e_2). [resolve(515,b,30,b)].
% 0.71/1.06 937 product(e_1,e_3,e_2). [resolve(517,b,462,b),merge(b)].
% 0.71/1.06 938 product(e_1,e_2,e_4). [back_unit_del(918),unit_del(b,937)].
% 0.71/1.06 944 product(e_2,e_1,e_3). [back_unit_del(571),unit_del(b,938)].
% 0.71/1.06 953 $F. [resolve(937,a,205,b),unit_del(a,22),unit_del(b,944)].
% 0.71/1.06
% 0.71/1.06 % SZS output end Refutation
% 0.71/1.06 ============================== end of proof ==========================
% 0.71/1.06
% 0.71/1.06 ============================== STATISTICS ============================
% 0.71/1.06
% 0.71/1.06 Given=266. Generated=2114. Kept=935. proofs=1.
% 0.71/1.06 Usable=174. Sos=17. Demods=0. Limbo=0, Disabled=799. Hints=0.
% 0.71/1.06 Megabytes=0.56.
% 0.71/1.06 User_CPU=0.10, System_CPU=0.01, Wall_clock=0.
% 0.71/1.06
% 0.71/1.06 ============================== end of statistics =====================
% 0.71/1.06
% 0.71/1.06 ============================== end of search =========================
% 0.71/1.06
% 0.71/1.06 THEOREM PROVED
% 0.71/1.06 % SZS status Unsatisfiable
% 0.71/1.06
% 0.71/1.06 Exiting with 1 proof.
% 0.71/1.06
% 0.71/1.06 Process 26726 exit (max_proofs) Tue Jun 14 07:23:25 2022
% 0.71/1.06 Prover9 interrupted
%------------------------------------------------------------------------------