TSTP Solution File: GRP127-4.004 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP127-4.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:29 EDT 2022
% Result : Unsatisfiable 0.44s 1.04s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP127-4.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n028.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 : Tue Jun 14 11:56:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.01 ============================== Prover9 ===============================
% 0.44/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.01 Process 5847 was started by sandbox on n028.cluster.edu,
% 0.44/1.01 Tue Jun 14 11:56:39 2022
% 0.44/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5489_n028.cluster.edu".
% 0.44/1.01 ============================== end of head ===========================
% 0.44/1.01
% 0.44/1.01 ============================== INPUT =================================
% 0.44/1.01
% 0.44/1.01 % Reading from file /tmp/Prover9_5489_n028.cluster.edu
% 0.44/1.01
% 0.44/1.01 set(prolog_style_variables).
% 0.44/1.01 set(auto2).
% 0.44/1.01 % set(auto2) -> set(auto).
% 0.44/1.01 % set(auto) -> set(auto_inference).
% 0.44/1.01 % set(auto) -> set(auto_setup).
% 0.44/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.01 % set(auto) -> set(auto_limits).
% 0.44/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.01 % set(auto) -> set(auto_denials).
% 0.44/1.01 % set(auto) -> set(auto_process).
% 0.44/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.01 % set(auto2) -> assign(stats, some).
% 0.44/1.01 % set(auto2) -> clear(echo_input).
% 0.44/1.01 % set(auto2) -> set(quiet).
% 0.44/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.01 % set(auto2) -> clear(print_given).
% 0.44/1.01 assign(lrs_ticks,-1).
% 0.44/1.01 assign(sos_limit,10000).
% 0.44/1.01 assign(order,kbo).
% 0.44/1.01 set(lex_order_vars).
% 0.44/1.01 clear(print_given).
% 0.44/1.01
% 0.44/1.01 % formulas(sos). % not echoed (26 formulas)
% 0.44/1.01
% 0.44/1.01 ============================== end of input ==========================
% 0.44/1.01
% 0.44/1.01 % From the command line: assign(max_seconds, 300).
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.01
% 0.44/1.01 % Formulas that are not ordinary clauses:
% 0.44/1.01
% 0.44/1.01 ============================== end of process non-clausal formulas ===
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.01
% 0.44/1.01 ============================== PREDICATE ELIMINATION =================
% 0.44/1.01 1 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.44/1.01 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.44/1.01 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.44/1.01 4 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom). [assumption].
% 0.44/1.01 5 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.44/1.01 6 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.44/1.01 7 -equalish(e_2,e_4) # label(e_2_is_not_e_4) # label(axiom). [assumption].
% 0.44/1.01 8 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.44/1.01 9 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.44/1.01 10 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom). [assumption].
% 0.44/1.01 11 -equalish(e_4,e_1) # label(e_4_is_not_e_1) # label(axiom). [assumption].
% 0.44/1.01 12 -equalish(e_4,e_2) # label(e_4_is_not_e_2) # label(axiom). [assumption].
% 0.44/1.01 13 -equalish(e_4,e_3) # label(e_4_is_not_e_3) # label(axiom). [assumption].
% 0.44/1.01 Derived: -product(A,B,e_1) | -product(A,B,e_2). [resolve(1,c,2,a)].
% 0.44/1.01 Derived: -product(A,B,e_1) | -product(A,B,e_3). [resolve(1,c,3,a)].
% 0.44/1.01 Derived: -product(A,B,e_1) | -product(A,B,e_4). [resolve(1,c,4,a)].
% 0.44/1.01 Derived: -product(A,B,e_2) | -product(A,B,e_3). [resolve(1,c,6,a)].
% 0.44/1.01 Derived: -product(A,B,e_2) | -product(A,B,e_4). [resolve(1,c,7,a)].
% 0.44/1.01 Derived: -product(A,B,e_3) | -product(A,B,e_4). [resolve(1,c,10,a)].
% 0.44/1.01 14 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.44/1.01 Derived: -product(A,e_1,B) | -product(A,e_2,B). [resolve(14,c,2,a)].
% 0.44/1.01 Derived: -product(A,e_1,B) | -product(A,e_3,B). [resolve(14,c,3,a)].
% 0.44/1.01 Derived: -product(A,e_1,B) | -product(A,e_4,B). [resolve(14,c,4,a)].
% 0.44/1.04 Derived: -product(A,e_2,B) | -product(A,e_3,B). [resolve(14,c,6,a)].
% 0.44/1.04 Derived: -product(A,e_2,B) | -product(A,e_4,B). [resolve(14,c,7,a)].
% 0.44/1.04 Derived: -product(A,e_3,B) | -product(A,e_4,B). [resolve(14,c,10,a)].
% 0.44/1.04 15 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.44/1.04 Derived: -product(e_1,A,B) | -product(e_2,A,B). [resolve(15,c,2,a)].
% 0.44/1.04 Derived: -product(e_1,A,B) | -product(e_3,A,B). [resolve(15,c,3,a)].
% 0.44/1.04 Derived: -product(e_1,A,B) | -product(e_4,A,B). [resolve(15,c,4,a)].
% 0.44/1.04 Derived: -product(e_2,A,B) | -product(e_3,A,B). [resolve(15,c,6,a)].
% 0.44/1.04 Derived: -product(e_2,A,B) | -product(e_4,A,B). [resolve(15,c,7,a)].
% 0.44/1.04 Derived: -product(e_3,A,B) | -product(e_4,A,B). [resolve(15,c,10,a)].
% 0.44/1.04
% 0.44/1.04 ============================== end predicate elimination =============
% 0.44/1.04
% 0.44/1.04 Auto_denials: (non-Horn, no changes).
% 0.44/1.04
% 0.44/1.04 Term ordering decisions:
% 0.44/1.04 Function symbol KB weights: e_1=1. e_2=1. e_3=1. e_4=1.
% 0.44/1.04
% 0.44/1.04 ============================== end of process initial clauses ========
% 0.44/1.04
% 0.44/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.04
% 0.44/1.04 ============================== end of clauses for search =============
% 0.44/1.04
% 0.44/1.04 ============================== SEARCH ================================
% 0.44/1.04
% 0.44/1.04 % Starting search at 0.01 seconds.
% 0.44/1.04
% 0.44/1.04 ============================== PROOF =================================
% 0.44/1.04 % SZS status Unsatisfiable
% 0.44/1.04 % SZS output start Refutation
% 0.44/1.04
% 0.44/1.04 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.44/1.04 % Length of proof is 94.
% 0.44/1.04 % Level of proof is 13.
% 0.44/1.04 % Maximum clause weight is 20.000.
% 0.44/1.04 % Given clauses 192.
% 0.44/1.04
% 0.44/1.04 1 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.44/1.04 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.44/1.04 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.44/1.04 4 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom). [assumption].
% 0.44/1.04 6 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.44/1.04 7 -equalish(e_2,e_4) # label(e_2_is_not_e_4) # label(axiom). [assumption].
% 0.44/1.04 10 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom). [assumption].
% 0.44/1.04 14 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.44/1.04 15 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.44/1.04 16 group_element(e_1) # label(element_1) # label(axiom). [assumption].
% 0.44/1.04 17 group_element(e_2) # label(element_2) # label(axiom). [assumption].
% 0.44/1.04 18 group_element(e_3) # label(element_3) # label(axiom). [assumption].
% 0.44/1.04 19 group_element(e_4) # label(element_4) # label(axiom). [assumption].
% 0.44/1.04 20 product(A,A,A) # label(product_idempotence) # label(axiom). [assumption].
% 0.44/1.04 21 product(A,B,C) | -product(D,A,B) | -product(C,A,D) # label(qg3_1) # label(negated_conjecture). [assumption].
% 0.44/1.04 24 -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.44/1.04 25 -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.44/1.04 27 -product(A,B,e_1) | -product(A,B,e_2). [resolve(1,c,2,a)].
% 0.44/1.04 28 -product(A,B,e_1) | -product(A,B,e_3). [resolve(1,c,3,a)].
% 0.44/1.04 29 -product(A,B,e_1) | -product(A,B,e_4). [resolve(1,c,4,a)].
% 0.44/1.04 30 -product(A,B,e_2) | -product(A,B,e_3). [resolve(1,c,6,a)].
% 0.44/1.04 31 -product(A,B,e_2) | -product(A,B,e_4). [resolve(1,c,7,a)].
% 0.44/1.04 32 -product(A,B,e_3) | -product(A,B,e_4). [resolve(1,c,10,a)].
% 0.44/1.04 33 -product(A,e_1,B) | -product(A,e_2,B). [resolve(14,c,2,a)].
% 0.44/1.04 34 -product(A,e_1,B) | -product(A,e_3,B). [resolve(14,c,3,a)].
% 0.44/1.04 35 -product(A,e_1,B) | -product(A,e_4,B). [resolve(14,c,4,a)].
% 0.44/1.04 36 -product(A,e_2,B) | -product(A,e_3,B). [resolve(14,c,6,a)].
% 0.44/1.04 37 -product(A,e_2,B) | -product(A,e_4,B). [resolve(14,c,7,a)].
% 0.44/1.04 38 -product(A,e_3,B) | -product(A,e_4,B). [resolve(14,c,10,a)].
% 0.44/1.04 40 -product(e_1,A,B) | -product(e_3,A,B). [resolve(15,c,3,a)].
% 0.44/1.04 41 -product(e_1,A,B) | -product(e_4,A,B). [resolve(15,c,4,a)].
% 0.44/1.04 44 -product(e_3,A,B) | -product(e_4,A,B). [resolve(15,c,10,a)].
% 0.44/1.04 53 -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(24,a,19,a)].
% 0.44/1.04 54 -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(24,a,18,a)].
% 0.44/1.04 55 -group_element(A) | product(e_1,e_2,A) | product(e_2,e_2,A) | product(e_3,e_2,A) | product(e_4,e_2,A). [resolve(24,a,17,a)].
% 0.44/1.04 56 -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(24,a,16,a)].
% 0.44/1.04 61 -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(25,a,19,a)].
% 0.44/1.04 62 -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(25,a,18,a)].
% 0.44/1.04 78 -product(e_1,e_1,e_2). [ur(27,a,20,a)].
% 0.44/1.04 80 -product(e_1,e_1,e_3). [ur(28,a,20,a)].
% 0.44/1.04 81 -product(e_4,e_4,e_1). [resolve(29,b,20,a)].
% 0.44/1.04 82 -product(e_1,e_1,e_4). [ur(29,a,20,a)].
% 0.44/1.04 83 -product(e_3,e_3,e_2). [resolve(30,b,20,a)].
% 0.44/1.04 85 -product(e_4,e_4,e_2). [resolve(31,b,20,a)].
% 0.44/1.04 86 -product(e_2,e_2,e_4). [ur(31,a,20,a)].
% 0.44/1.04 87 -product(e_4,e_4,e_3). [resolve(32,b,20,a)].
% 0.44/1.04 88 -product(e_3,e_3,e_4). [ur(32,a,20,a)].
% 0.44/1.04 89 -product(e_2,e_1,e_2). [resolve(33,b,20,a)].
% 0.44/1.04 91 -product(e_3,e_1,e_3). [resolve(34,b,20,a)].
% 0.44/1.04 93 -product(e_4,e_1,e_4). [resolve(35,b,20,a)].
% 0.44/1.04 96 -product(e_2,e_3,e_2). [ur(36,a,20,a)].
% 0.44/1.04 97 -product(e_4,e_2,e_4). [resolve(37,b,20,a)].
% 0.44/1.04 98 -product(e_2,e_4,e_2). [ur(37,a,20,a)].
% 0.44/1.04 99 -product(e_4,e_3,e_4). [resolve(38,b,20,a)].
% 0.44/1.04 106 -product(e_4,e_1,e_1). [ur(41,a,20,a)].
% 0.44/1.04 111 -product(e_3,e_4,e_4). [resolve(44,b,20,a)].
% 0.44/1.04 112 -product(e_4,e_3,e_3). [ur(44,a,20,a)].
% 0.44/1.04 114 product(e_1,e_4,e_2) | product(e_3,e_4,e_2). [resolve(53,a,17,a),unit_del(b,98),unit_del(d,85)].
% 0.44/1.04 116 product(e_1,e_3,e_4) | product(e_2,e_3,e_4). [resolve(54,a,19,a),unit_del(c,88),unit_del(d,99)].
% 0.44/1.04 117 product(e_1,e_3,e_2) | product(e_4,e_3,e_2). [resolve(54,a,17,a),unit_del(b,96),unit_del(c,83)].
% 0.44/1.04 127 product(e_1,e_4,e_2) | -product(e_3,e_1,e_2). [resolve(114,b,35,b)].
% 0.44/1.04 142 product(e_1,e_3,e_4) | -product(e_2,e_1,e_4). [resolve(116,b,34,b)].
% 0.44/1.04 150 product(e_1,e_2,e_4) | product(e_3,e_2,e_4). [resolve(55,a,19,a),unit_del(b,86),unit_del(d,97)].
% 0.44/1.04 153 product(e_1,e_3,e_2) | -product(e_4,e_1,e_2). [resolve(117,b,34,b)].
% 0.44/1.04 154 product(e_1,e_3,e_2) | -product(e_4,e_3,e_1). [resolve(117,b,27,b)].
% 0.44/1.04 168 product(e_2,e_1,e_4) | product(e_3,e_1,e_4). [resolve(56,a,19,a),unit_del(a,82),unit_del(d,93)].
% 0.44/1.04 169 product(e_2,e_1,e_3) | product(e_4,e_1,e_3). [resolve(56,a,18,a),unit_del(a,80),unit_del(c,91)].
% 0.44/1.04 170 product(e_3,e_1,e_2) | product(e_4,e_1,e_2). [resolve(56,a,17,a),unit_del(a,78),unit_del(b,89)].
% 0.44/1.04 172 product(e_1,e_2,e_4) | -product(e_3,e_1,e_4). [resolve(150,b,33,b)].
% 0.44/1.04 196 product(e_2,e_1,e_4) | -product(e_3,e_1,e_2). [resolve(168,b,31,b)].
% 0.44/1.04 203 product(e_2,e_1,e_3) | -product(e_4,e_1,e_2). [resolve(169,b,30,b)].
% 0.44/1.04 210 product(e_3,e_1,e_2) | product(e_1,e_3,e_2). [resolve(170,b,153,b)].
% 0.44/1.04 225 product(e_1,e_2,e_4) | product(e_2,e_1,e_4). [resolve(172,b,168,b)].
% 0.44/1.04 235 product(e_4,e_1,e_3) | product(e_4,e_2,e_3). [resolve(61,a,18,a),unit_del(c,112),unit_del(d,87)].
% 0.44/1.04 237 product(e_4,e_2,e_1) | product(e_4,e_3,e_1). [resolve(61,a,16,a),unit_del(a,106),unit_del(d,81)].
% 0.44/1.04 246 product(e_2,e_1,e_3) | product(e_3,e_1,e_2). [resolve(203,b,170,b)].
% 0.44/1.04 247 product(e_1,e_3,e_2) | product(e_2,e_1,e_4). [resolve(210,a,196,b)].
% 0.44/1.04 255 product(e_3,e_1,e_4) | product(e_3,e_2,e_4). [resolve(62,a,19,a),unit_del(c,88),unit_del(d,111)].
% 0.44/1.04 265 product(e_1,e_2,e_4) | product(e_1,e_3,e_4). [resolve(225,b,142,b)].
% 0.44/1.04 298 product(e_4,e_1,e_3) | -product(e_4,e_2,e_1). [resolve(235,b,28,b)].
% 0.44/1.04 313 product(e_4,e_2,e_1) | product(e_1,e_3,e_2). [resolve(237,b,154,b)].
% 0.44/1.04 337 product(e_2,e_1,e_3) | product(e_1,e_4,e_2). [resolve(246,b,127,b)].
% 0.44/1.04 349 product(e_1,e_3,e_2) | product(e_1,A,e_2) | -product(e_4,e_1,A). [resolve(247,b,21,c)].
% 0.44/1.04 351 product(e_1,e_3,e_2) | -product(e_4,e_1,e_3). [factor(349,a,b)].
% 0.44/1.04 358 product(e_3,e_1,e_4) | -product(e_1,e_2,e_4). [resolve(255,b,40,b)].
% 0.44/1.04 382 product(e_1,e_2,e_4) | -product(e_1,e_3,e_2). [resolve(265,b,31,b)].
% 0.44/1.04 433 product(e_1,e_3,e_2) | product(e_4,e_1,e_3). [resolve(313,a,298,b)].
% 0.44/1.04 473 product(e_1,e_4,e_2) | product(e_1,A,e_2) | -product(e_3,e_1,A). [resolve(337,a,21,c)].
% 0.44/1.04 475 product(e_1,e_4,e_2) | -product(e_3,e_1,e_4). [factor(473,a,b)].
% 0.44/1.04 549 product(e_1,e_3,e_2). [resolve(433,b,351,b),merge(b)].
% 0.44/1.04 551 product(e_1,e_2,e_4). [back_unit_del(382),unit_del(b,549)].
% 0.44/1.04 553 product(e_3,e_1,e_4). [back_unit_del(358),unit_del(b,551)].
% 0.44/1.04 556 product(e_1,e_4,e_2). [back_unit_del(475),unit_del(b,553)].
% 0.44/1.04 573 $F. [ur(38,a,549,a),unit_del(a,556)].
% 0.44/1.04
% 0.44/1.04 % SZS output end Refutation
% 0.44/1.04 ============================== end of proof ==========================
% 0.44/1.04
% 0.44/1.04 ============================== STATISTICS ============================
% 0.44/1.04
% 0.44/1.04 Given=192. Generated=1059. Kept=557. proofs=1.
% 0.44/1.04 Usable=98. Sos=17. Demods=0. Limbo=7, Disabled=479. Hints=0.
% 0.44/1.04 Megabytes=0.32.
% 0.44/1.04 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.44/1.04
% 0.44/1.04 ============================== end of statistics =====================
% 0.44/1.04
% 0.44/1.04 ============================== end of search =========================
% 0.44/1.04
% 0.44/1.04 THEOREM PROVED
% 0.44/1.04 % SZS status Unsatisfiable
% 0.44/1.04
% 0.44/1.04 Exiting with 1 proof.
% 0.44/1.04
% 0.44/1.04 Process 5847 exit (max_proofs) Tue Jun 14 11:56:39 2022
% 0.44/1.04 Prover9 interrupted
%------------------------------------------------------------------------------