TSTP Solution File: GRP129-4.004 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP129-4.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n009.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:34 EDT 2022
% Result : Unsatisfiable 0.70s 1.03s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP129-4.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 07:14:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/0.96 ============================== Prover9 ===============================
% 0.41/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.96 Process 15624 was started by sandbox on n009.cluster.edu,
% 0.41/0.96 Mon Jun 13 07:14:53 2022
% 0.41/0.96 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15471_n009.cluster.edu".
% 0.41/0.96 ============================== end of head ===========================
% 0.41/0.96
% 0.41/0.96 ============================== INPUT =================================
% 0.41/0.96
% 0.41/0.96 % Reading from file /tmp/Prover9_15471_n009.cluster.edu
% 0.41/0.96
% 0.41/0.96 set(prolog_style_variables).
% 0.41/0.96 set(auto2).
% 0.41/0.96 % set(auto2) -> set(auto).
% 0.41/0.96 % set(auto) -> set(auto_inference).
% 0.41/0.96 % set(auto) -> set(auto_setup).
% 0.41/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.96 % set(auto) -> set(auto_limits).
% 0.41/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.96 % set(auto) -> set(auto_denials).
% 0.41/0.96 % set(auto) -> set(auto_process).
% 0.41/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.96 % set(auto2) -> assign(stats, some).
% 0.41/0.96 % set(auto2) -> clear(echo_input).
% 0.41/0.96 % set(auto2) -> set(quiet).
% 0.41/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.96 % set(auto2) -> clear(print_given).
% 0.41/0.96 assign(lrs_ticks,-1).
% 0.41/0.96 assign(sos_limit,10000).
% 0.41/0.96 assign(order,kbo).
% 0.41/0.96 set(lex_order_vars).
% 0.41/0.96 clear(print_given).
% 0.41/0.96
% 0.41/0.96 % formulas(sos). % not echoed (25 formulas)
% 0.41/0.96
% 0.41/0.96 ============================== end of input ==========================
% 0.41/0.96
% 0.41/0.96 % From the command line: assign(max_seconds, 300).
% 0.41/0.96
% 0.41/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.96
% 0.41/0.96 % Formulas that are not ordinary clauses:
% 0.41/0.96
% 0.41/0.96 ============================== end of process non-clausal formulas ===
% 0.41/0.96
% 0.41/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.96
% 0.41/0.96 ============================== PREDICATE ELIMINATION =================
% 0.41/0.96 1 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.41/0.96 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.41/0.96 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.41/0.96 4 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom). [assumption].
% 0.41/0.96 5 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.41/0.96 6 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.41/0.96 7 -equalish(e_2,e_4) # label(e_2_is_not_e_4) # label(axiom). [assumption].
% 0.41/0.96 8 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.41/0.96 9 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.41/0.96 10 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom). [assumption].
% 0.41/0.96 11 -equalish(e_4,e_1) # label(e_4_is_not_e_1) # label(axiom). [assumption].
% 0.41/0.96 12 -equalish(e_4,e_2) # label(e_4_is_not_e_2) # label(axiom). [assumption].
% 0.41/0.96 13 -equalish(e_4,e_3) # label(e_4_is_not_e_3) # label(axiom). [assumption].
% 0.41/0.96 Derived: -product(A,B,e_1) | -product(A,B,e_2). [resolve(1,c,2,a)].
% 0.41/0.96 Derived: -product(A,B,e_1) | -product(A,B,e_3). [resolve(1,c,3,a)].
% 0.41/0.96 Derived: -product(A,B,e_1) | -product(A,B,e_4). [resolve(1,c,4,a)].
% 0.41/0.96 Derived: -product(A,B,e_2) | -product(A,B,e_3). [resolve(1,c,6,a)].
% 0.41/0.96 Derived: -product(A,B,e_2) | -product(A,B,e_4). [resolve(1,c,7,a)].
% 0.41/0.96 Derived: -product(A,B,e_3) | -product(A,B,e_4). [resolve(1,c,10,a)].
% 0.41/0.96 14 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.41/0.96 Derived: -product(A,e_1,B) | -product(A,e_2,B). [resolve(14,c,2,a)].
% 0.41/0.96 Derived: -product(A,e_1,B) | -product(A,e_3,B). [resolve(14,c,3,a)].
% 0.41/0.96 Derived: -product(A,e_1,B) | -product(A,e_4,B). [resolve(14,c,4,a)].
% 0.70/1.03 Derived: -product(A,e_2,B) | -product(A,e_3,B). [resolve(14,c,6,a)].
% 0.70/1.03 Derived: -product(A,e_2,B) | -product(A,e_4,B). [resolve(14,c,7,a)].
% 0.70/1.03 Derived: -product(A,e_3,B) | -product(A,e_4,B). [resolve(14,c,10,a)].
% 0.70/1.03 15 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.70/1.03 Derived: -product(e_1,A,B) | -product(e_2,A,B). [resolve(15,c,2,a)].
% 0.70/1.03 Derived: -product(e_1,A,B) | -product(e_3,A,B). [resolve(15,c,3,a)].
% 0.70/1.03 Derived: -product(e_1,A,B) | -product(e_4,A,B). [resolve(15,c,4,a)].
% 0.70/1.03 Derived: -product(e_2,A,B) | -product(e_3,A,B). [resolve(15,c,6,a)].
% 0.70/1.03 Derived: -product(e_2,A,B) | -product(e_4,A,B). [resolve(15,c,7,a)].
% 0.70/1.03 Derived: -product(e_3,A,B) | -product(e_4,A,B). [resolve(15,c,10,a)].
% 0.70/1.03
% 0.70/1.03 ============================== end predicate elimination =============
% 0.70/1.03
% 0.70/1.03 Auto_denials: (non-Horn, no changes).
% 0.70/1.03
% 0.70/1.03 Term ordering decisions:
% 0.70/1.03 Function symbol KB weights: e_1=1. e_2=1. e_3=1. e_4=1.
% 0.70/1.03
% 0.70/1.03 ============================== end of process initial clauses ========
% 0.70/1.03
% 0.70/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.70/1.03
% 0.70/1.03 ============================== end of clauses for search =============
% 0.70/1.03
% 0.70/1.03 ============================== SEARCH ================================
% 0.70/1.03
% 0.70/1.03 % Starting search at 0.01 seconds.
% 0.70/1.03
% 0.70/1.03 ============================== PROOF =================================
% 0.70/1.03 % SZS status Unsatisfiable
% 0.70/1.03 % SZS output start Refutation
% 0.70/1.03
% 0.70/1.03 % Proof 1 at 0.08 (+ 0.01) seconds.
% 0.70/1.03 % Length of proof is 85.
% 0.70/1.03 % Level of proof is 26.
% 0.70/1.03 % Maximum clause weight is 20.000.
% 0.70/1.03 % Given clauses 313.
% 0.70/1.03
% 0.70/1.03 1 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.70/1.03 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.70/1.03 4 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom). [assumption].
% 0.70/1.03 6 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.70/1.03 10 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom). [assumption].
% 0.70/1.03 14 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.70/1.03 15 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.70/1.03 16 group_element(e_1) # label(element_1) # label(axiom). [assumption].
% 0.70/1.03 18 group_element(e_3) # label(element_3) # label(axiom). [assumption].
% 0.70/1.03 19 group_element(e_4) # label(element_4) # label(axiom). [assumption].
% 0.70/1.03 20 product(A,B,C) | -product(C,A,D) | -product(B,C,D) # label(qg3_1) # label(negated_conjecture). [assumption].
% 0.70/1.03 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.70/1.03 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.70/1.03 25 -group_element(A) | -group_element(B) | product(A,B,e_1) | product(A,B,e_2) | product(A,B,e_3) | product(A,B,e_4) # label(product_total_function1) # label(axiom). [assumption].
% 0.70/1.03 27 -product(A,B,e_1) | -product(A,B,e_3). [resolve(1,c,3,a)].
% 0.70/1.03 28 -product(A,B,e_1) | -product(A,B,e_4). [resolve(1,c,4,a)].
% 0.70/1.03 31 -product(A,B,e_3) | -product(A,B,e_4). [resolve(1,c,10,a)].
% 0.70/1.03 33 -product(A,e_1,B) | -product(A,e_3,B). [resolve(14,c,3,a)].
% 0.70/1.03 34 -product(A,e_1,B) | -product(A,e_4,B). [resolve(14,c,4,a)].
% 0.70/1.03 35 -product(A,e_2,B) | -product(A,e_3,B). [resolve(14,c,6,a)].
% 0.70/1.03 37 -product(A,e_3,B) | -product(A,e_4,B). [resolve(14,c,10,a)].
% 0.70/1.03 39 -product(e_1,A,B) | -product(e_3,A,B). [resolve(15,c,3,a)].
% 0.70/1.03 40 -product(e_1,A,B) | -product(e_4,A,B). [resolve(15,c,4,a)].
% 0.70/1.03 41 -product(e_2,A,B) | -product(e_3,A,B). [resolve(15,c,6,a)].
% 0.70/1.03 43 -product(e_3,A,B) | -product(e_4,A,B). [resolve(15,c,10,a)].
% 0.70/1.03 44 product(A,A,A) | -product(A,A,B). [factor(20,b,c)].
% 0.70/1.03 47 -group_element(A) | product(A,A,e_1) | product(A,A,e_2) | product(A,A,e_3) | product(A,A,e_4). [factor(25,a,b)].
% 0.70/1.03 48 -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,19,a)].
% 0.70/1.03 49 -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,18,a)].
% 0.70/1.03 56 -group_element(A) | product(e_4,e_1,A) | product(e_4,e_2,A) | product(e_4,e_3,A) | product(e_4,e_4,A). [resolve(24,a,19,a)].
% 0.70/1.03 57 -group_element(A) | product(e_3,e_1,A) | product(e_3,e_2,A) | product(e_3,e_3,A) | product(e_3,e_4,A). [resolve(24,a,18,a)].
% 0.70/1.03 83 product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | product(e_1,e_1,e_3) | product(e_1,e_1,e_4). [resolve(47,a,16,a)].
% 0.70/1.03 86 product(e_1,e_4,e_1) | product(e_2,e_4,e_1) | product(e_3,e_4,e_1) | product(e_4,e_4,e_1). [resolve(48,a,16,a)].
% 0.70/1.03 121 product(e_1,e_3,e_1) | product(e_2,e_3,e_1) | product(e_3,e_3,e_1) | product(e_4,e_3,e_1). [resolve(49,a,16,a)].
% 0.70/1.03 181 product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | product(e_1,e_1,e_3). [resolve(83,d,44,b),merge(d)].
% 0.70/1.03 182 product(e_1,e_1,e_1) | product(e_1,e_1,e_2). [resolve(181,c,44,b),merge(c)].
% 0.70/1.03 183 product(e_1,e_1,e_1). [resolve(182,b,44,b),merge(b)].
% 0.70/1.03 186 -product(e_4,e_1,e_1). [ur(40,a,183,a)].
% 0.70/1.03 187 -product(e_3,e_1,e_1). [ur(39,a,183,a)].
% 0.70/1.03 189 -product(e_1,e_4,e_1). [ur(34,a,183,a)].
% 0.70/1.03 190 -product(e_1,e_3,e_1). [ur(33,a,183,a)].
% 0.70/1.03 195 product(e_2,e_4,e_1) | product(e_3,e_4,e_1) | product(e_4,e_4,e_1). [back_unit_del(86),unit_del(a,189)].
% 0.70/1.03 196 product(e_2,e_3,e_1) | product(e_3,e_3,e_1) | product(e_4,e_3,e_1). [back_unit_del(121),unit_del(a,190)].
% 0.70/1.03 201 product(e_2,e_4,e_1) | product(e_3,e_4,e_1) | product(e_4,e_4,e_4). [resolve(195,c,44,b)].
% 0.70/1.03 212 product(e_2,e_3,e_1) | product(e_3,e_3,e_1) | -product(e_4,e_2,e_1). [resolve(196,c,35,b)].
% 0.70/1.03 237 product(e_4,e_2,e_1) | product(e_4,e_3,e_1) | product(e_4,e_4,e_1). [resolve(56,a,16,a),unit_del(a,186)].
% 0.70/1.03 257 product(e_2,e_4,e_1) | product(e_3,e_4,e_1) | -product(e_4,e_4,e_1). [resolve(201,c,28,b)].
% 0.70/1.03 263 product(e_3,e_2,e_1) | product(e_3,e_3,e_1) | product(e_3,e_4,e_1). [resolve(57,a,16,a),unit_del(a,187)].
% 0.70/1.03 275 product(e_4,e_2,e_1) | product(e_4,e_3,e_1) | product(e_4,e_4,e_4). [resolve(237,c,44,b)].
% 0.70/1.03 289 product(e_2,e_4,e_1) | product(e_3,e_4,e_1). [resolve(257,c,195,c),merge(c),merge(d)].
% 0.70/1.03 290 product(e_2,e_4,e_1) | -product(e_3,e_3,e_1). [resolve(289,b,37,b)].
% 0.70/1.03 296 product(e_2,e_4,e_1) | product(A,e_3,e_4) | -product(e_4,A,e_1). [resolve(289,b,20,c)].
% 0.70/1.03 297 product(e_2,e_4,e_1) | product(e_4,A,e_3) | -product(A,e_3,e_1). [resolve(289,b,20,b)].
% 0.70/1.03 298 product(e_3,e_2,e_1) | product(e_3,e_3,e_1) | -product(e_2,e_4,e_1). [resolve(263,c,41,b)].
% 0.70/1.03 340 product(e_4,e_2,e_1) | product(e_4,e_3,e_1) | -product(e_4,e_4,e_1). [resolve(275,c,28,b)].
% 0.70/1.03 372 product(e_4,e_2,e_1) | product(e_4,e_3,e_1). [resolve(340,c,237,c),merge(c),merge(d)].
% 0.70/1.03 373 product(e_4,e_2,e_1) | product(e_2,e_4,e_1) | product(e_4,e_4,e_3). [resolve(372,b,297,c)].
% 0.70/1.03 375 product(e_4,e_2,e_1) | -product(e_3,e_3,e_1). [resolve(372,b,43,b)].
% 0.70/1.03 382 product(e_4,e_2,e_1) | product(e_3,A,e_4) | -product(A,e_4,e_1). [resolve(372,b,20,b)].
% 0.70/1.03 436 product(e_4,e_2,e_1) | product(e_2,e_4,e_1) | product(e_4,e_4,e_4). [resolve(373,c,44,b)].
% 0.70/1.03 523 product(e_4,e_2,e_1) | product(e_2,e_4,e_1) | -product(e_4,e_4,e_3). [resolve(436,c,31,b)].
% 0.70/1.03 573 product(e_4,e_2,e_1) | product(e_2,e_4,e_1). [resolve(523,c,373,c),merge(c),merge(d)].
% 0.70/1.03 574 product(e_2,e_4,e_1) | product(e_2,e_3,e_4). [resolve(573,a,296,c),merge(b)].
% 0.70/1.03 575 product(e_2,e_4,e_1) | product(e_2,e_3,e_1) | product(e_3,e_3,e_1). [resolve(573,a,212,c)].
% 0.70/1.03 585 product(e_2,e_3,e_4) | product(e_4,e_2,e_1) | product(e_3,e_2,e_4). [resolve(574,a,382,c)].
% 0.70/1.03 586 product(e_2,e_3,e_4) | product(e_3,e_2,e_1) | product(e_3,e_3,e_1). [resolve(574,a,298,c)].
% 0.70/1.03 598 product(e_2,e_4,e_1) | product(e_2,e_3,e_1). [resolve(575,c,290,b),merge(c)].
% 0.70/1.03 599 product(e_2,e_3,e_1) | product(e_4,e_2,e_1) | product(e_3,e_2,e_4). [resolve(598,a,382,c)].
% 0.70/1.03 600 product(e_2,e_3,e_1) | product(e_3,e_2,e_1) | product(e_3,e_3,e_1). [resolve(598,a,298,c)].
% 0.70/1.03 606 product(e_2,e_3,e_1) | product(A,e_2,e_4) | -product(e_4,A,e_1). [resolve(598,a,20,c)].
% 0.70/1.03 620 product(e_2,e_3,e_4) | product(e_3,e_2,e_4) | -product(e_3,e_2,e_1). [resolve(585,b,43,b)].
% 0.70/1.03 630 product(e_2,e_3,e_4) | product(e_3,e_2,e_1) | product(e_3,e_3,e_3). [resolve(586,c,44,b)].
% 0.70/1.03 665 product(e_2,e_3,e_1) | product(e_3,e_2,e_1) | product(e_4,e_2,e_1). [resolve(600,c,375,b)].
% 0.70/1.03 683 product(e_2,e_3,e_1) | product(e_2,e_2,e_4) | product(e_3,e_2,e_4). [resolve(606,c,599,b),merge(c)].
% 0.70/1.03 728 product(e_2,e_3,e_4) | product(e_3,e_2,e_1) | -product(e_3,e_3,e_1). [resolve(630,c,27,b)].
% 0.70/1.03 802 product(e_2,e_3,e_1) | product(e_3,e_2,e_1) | product(e_2,e_2,e_4). [resolve(665,c,606,c),merge(c)].
% 0.70/1.03 843 product(e_2,e_3,e_1) | product(e_2,e_2,e_4) | -product(e_3,e_2,e_1). [resolve(683,c,28,b)].
% 0.70/1.03 896 product(e_2,e_3,e_4) | product(e_3,e_2,e_1). [resolve(728,c,586,c),merge(c),merge(d)].
% 0.70/1.03 898 product(e_2,e_3,e_4) | product(e_3,e_2,e_4). [resolve(896,b,620,c),merge(b)].
% 0.70/1.03 918 product(e_2,e_3,e_4) | -product(e_3,e_2,e_1). [resolve(898,b,28,b)].
% 0.70/1.03 973 product(e_2,e_3,e_4). [resolve(918,b,896,b),merge(b)].
% 0.70/1.03 976 -product(e_2,e_2,e_4). [resolve(973,a,35,b)].
% 0.70/1.03 980 -product(e_2,e_3,e_1). [resolve(973,a,28,b)].
% 0.70/1.03 1012 -product(e_3,e_2,e_1). [back_unit_del(843),unit_del(a,980),unit_del(b,976)].
% 0.70/1.03 1019 $F. [back_unit_del(802),unit_del(a,980),unit_del(b,1012),unit_del(c,976)].
% 0.70/1.03
% 0.70/1.03 % SZS output end Refutation
% 0.70/1.03 ============================== end of proof ==========================
% 0.70/1.03
% 0.70/1.03 ============================== STATISTICS ============================
% 0.70/1.03
% 0.70/1.03 Given=313. Generated=1604. Kept=1003. proofs=1.
% 0.70/1.03 Usable=209. Sos=353. Demods=0. Limbo=43, Disabled=441. Hints=0.
% 0.70/1.03 Megabytes=0.67.
% 0.70/1.03 User_CPU=0.08, System_CPU=0.01, Wall_clock=0.
% 0.70/1.03
% 0.70/1.03 ============================== end of statistics =====================
% 0.70/1.03
% 0.70/1.03 ============================== end of search =========================
% 0.70/1.03
% 0.70/1.03 THEOREM PROVED
% 0.70/1.03 % SZS status Unsatisfiable
% 0.70/1.03
% 0.70/1.03 Exiting with 1 proof.
% 0.70/1.03
% 0.70/1.03 Process 15624 exit (max_proofs) Mon Jun 13 07:14:53 2022
% 0.70/1.03 Prover9 interrupted
%------------------------------------------------------------------------------