TSTP Solution File: GRP124-6.004 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP124-6.004 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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:21 EDT 2022
% Result : Unsatisfiable 0.42s 1.01s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP124-6.004 : TPTP v8.1.0. Released v1.2.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n015.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 14:06:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/0.99 ============================== Prover9 ===============================
% 0.42/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.99 Process 10263 was started by sandbox on n015.cluster.edu,
% 0.42/0.99 Mon Jun 13 14:06:08 2022
% 0.42/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_10110_n015.cluster.edu".
% 0.42/0.99 ============================== end of head ===========================
% 0.42/0.99
% 0.42/0.99 ============================== INPUT =================================
% 0.42/0.99
% 0.42/0.99 % Reading from file /tmp/Prover9_10110_n015.cluster.edu
% 0.42/0.99
% 0.42/0.99 set(prolog_style_variables).
% 0.42/0.99 set(auto2).
% 0.42/0.99 % set(auto2) -> set(auto).
% 0.42/0.99 % set(auto) -> set(auto_inference).
% 0.42/0.99 % set(auto) -> set(auto_setup).
% 0.42/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.99 % set(auto) -> set(auto_limits).
% 0.42/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.99 % set(auto) -> set(auto_denials).
% 0.42/0.99 % set(auto) -> set(auto_process).
% 0.42/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.99 % set(auto2) -> assign(stats, some).
% 0.42/0.99 % set(auto2) -> clear(echo_input).
% 0.42/0.99 % set(auto2) -> set(quiet).
% 0.42/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.99 % set(auto2) -> clear(print_given).
% 0.42/0.99 assign(lrs_ticks,-1).
% 0.42/0.99 assign(sos_limit,10000).
% 0.42/0.99 assign(order,kbo).
% 0.42/0.99 set(lex_order_vars).
% 0.42/0.99 clear(print_given).
% 0.42/0.99
% 0.42/0.99 % formulas(sos). % not echoed (27 formulas)
% 0.42/0.99
% 0.42/0.99 ============================== end of input ==========================
% 0.42/0.99
% 0.42/0.99 % From the command line: assign(max_seconds, 300).
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.99
% 0.42/0.99 % Formulas that are not ordinary clauses:
% 0.42/0.99
% 0.42/0.99 ============================== end of process non-clausal formulas ===
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.99
% 0.42/0.99 ============================== PREDICATE ELIMINATION =================
% 0.42/0.99 1 -product1(A,B,C) | -product1(A,B,D) | equalish(C,D) # label(product1_total_function2) # label(axiom). [assumption].
% 0.42/0.99 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.42/0.99 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.42/0.99 4 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom). [assumption].
% 0.42/0.99 5 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.42/0.99 6 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.42/0.99 7 -equalish(e_2,e_4) # label(e_2_is_not_e_4) # label(axiom). [assumption].
% 0.42/0.99 8 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.42/0.99 9 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.42/0.99 10 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom). [assumption].
% 0.42/0.99 11 -equalish(e_4,e_1) # label(e_4_is_not_e_1) # label(axiom). [assumption].
% 0.42/0.99 12 -equalish(e_4,e_2) # label(e_4_is_not_e_2) # label(axiom). [assumption].
% 0.42/0.99 13 -equalish(e_4,e_3) # label(e_4_is_not_e_3) # label(axiom). [assumption].
% 0.42/0.99 Derived: -product1(A,B,e_1) | -product1(A,B,e_2). [resolve(1,c,2,a)].
% 0.42/0.99 Derived: -product1(A,B,e_1) | -product1(A,B,e_3). [resolve(1,c,3,a)].
% 0.42/0.99 Derived: -product1(A,B,e_1) | -product1(A,B,e_4). [resolve(1,c,4,a)].
% 0.42/0.99 Derived: -product1(A,B,e_2) | -product1(A,B,e_3). [resolve(1,c,6,a)].
% 0.42/0.99 Derived: -product1(A,B,e_2) | -product1(A,B,e_4). [resolve(1,c,7,a)].
% 0.42/0.99 Derived: -product1(A,B,e_3) | -product1(A,B,e_4). [resolve(1,c,10,a)].
% 0.42/0.99 14 -product1(A,B,C) | -product1(A,D,C) | equalish(B,D) # label(product1_right_cancellation) # label(axiom). [assumption].
% 0.42/0.99 Derived: -product1(A,e_1,B) | -product1(A,e_2,B). [resolve(14,c,2,a)].
% 0.42/0.99 Derived: -product1(A,e_1,B) | -product1(A,e_3,B). [resolve(14,c,3,a)].
% 0.42/0.99 Derived: -product1(A,e_1,B) | -product1(A,e_4,B). [resolve(14,c,4,a)].
% 0.42/1.01 Derived: -product1(A,e_2,B) | -product1(A,e_3,B). [resolve(14,c,6,a)].
% 0.42/1.01 Derived: -product1(A,e_2,B) | -product1(A,e_4,B). [resolve(14,c,7,a)].
% 0.42/1.01 Derived: -product1(A,e_3,B) | -product1(A,e_4,B). [resolve(14,c,10,a)].
% 0.42/1.01 15 -product1(A,B,C) | -product1(D,B,C) | equalish(A,D) # label(product1_left_cancellation) # label(axiom). [assumption].
% 0.42/1.01 Derived: -product1(e_1,A,B) | -product1(e_2,A,B). [resolve(15,c,2,a)].
% 0.42/1.01 Derived: -product1(e_1,A,B) | -product1(e_3,A,B). [resolve(15,c,3,a)].
% 0.42/1.01 Derived: -product1(e_1,A,B) | -product1(e_4,A,B). [resolve(15,c,4,a)].
% 0.42/1.01 Derived: -product1(e_2,A,B) | -product1(e_3,A,B). [resolve(15,c,6,a)].
% 0.42/1.01 Derived: -product1(e_2,A,B) | -product1(e_4,A,B). [resolve(15,c,7,a)].
% 0.42/1.01 Derived: -product1(e_3,A,B) | -product1(e_4,A,B). [resolve(15,c,10,a)].
% 0.42/1.01 16 -product2(A,B,C) | -product2(A,B,D) | equalish(C,D) # label(product2_total_function2) # label(axiom). [assumption].
% 0.42/1.01 Derived: -product2(A,B,e_1) | -product2(A,B,e_2). [resolve(16,c,2,a)].
% 0.42/1.01 Derived: -product2(A,B,e_1) | -product2(A,B,e_3). [resolve(16,c,3,a)].
% 0.42/1.01 Derived: -product2(A,B,e_1) | -product2(A,B,e_4). [resolve(16,c,4,a)].
% 0.42/1.01 Derived: -product2(A,B,e_2) | -product2(A,B,e_3). [resolve(16,c,6,a)].
% 0.42/1.01 Derived: -product2(A,B,e_2) | -product2(A,B,e_4). [resolve(16,c,7,a)].
% 0.42/1.01 Derived: -product2(A,B,e_3) | -product2(A,B,e_4). [resolve(16,c,10,a)].
% 0.42/1.01 17 -product2(A,B,C) | -product2(A,D,C) | equalish(B,D) # label(product2_right_cancellation) # label(axiom). [assumption].
% 0.42/1.01 Derived: -product2(A,e_1,B) | -product2(A,e_2,B). [resolve(17,c,2,a)].
% 0.42/1.01 Derived: -product2(A,e_1,B) | -product2(A,e_3,B). [resolve(17,c,3,a)].
% 0.42/1.01 Derived: -product2(A,e_1,B) | -product2(A,e_4,B). [resolve(17,c,4,a)].
% 0.42/1.01 Derived: -product2(A,e_2,B) | -product2(A,e_3,B). [resolve(17,c,6,a)].
% 0.42/1.01 Derived: -product2(A,e_2,B) | -product2(A,e_4,B). [resolve(17,c,7,a)].
% 0.42/1.01 Derived: -product2(A,e_3,B) | -product2(A,e_4,B). [resolve(17,c,10,a)].
% 0.42/1.01 18 -product2(A,B,C) | -product2(D,B,C) | equalish(A,D) # label(product2_left_cancellation) # label(axiom). [assumption].
% 0.42/1.01 Derived: -product2(e_1,A,B) | -product2(e_2,A,B). [resolve(18,c,2,a)].
% 0.42/1.01 Derived: -product2(e_1,A,B) | -product2(e_3,A,B). [resolve(18,c,3,a)].
% 0.42/1.01 Derived: -product2(e_1,A,B) | -product2(e_4,A,B). [resolve(18,c,4,a)].
% 0.42/1.01 Derived: -product2(e_2,A,B) | -product2(e_3,A,B). [resolve(18,c,6,a)].
% 0.42/1.01 Derived: -product2(e_2,A,B) | -product2(e_4,A,B). [resolve(18,c,7,a)].
% 0.42/1.01 Derived: -product2(e_3,A,B) | -product2(e_4,A,B). [resolve(18,c,10,a)].
% 0.42/1.01
% 0.42/1.01 ============================== end predicate elimination =============
% 0.42/1.01
% 0.42/1.01 Auto_denials: (non-Horn, no changes).
% 0.42/1.01
% 0.42/1.01 Term ordering decisions:
% 0.42/1.01 Function symbol KB weights: e_1=1. e_2=1. e_3=1. e_4=1.
% 0.42/1.01
% 0.42/1.01 ============================== end of process initial clauses ========
% 0.42/1.01
% 0.42/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.42/1.01
% 0.42/1.01 ============================== end of clauses for search =============
% 0.42/1.01
% 0.42/1.01 ============================== SEARCH ================================
% 0.42/1.01
% 0.42/1.01 % Starting search at 0.01 seconds.
% 0.42/1.01
% 0.42/1.01 ============================== PROOF =================================
% 0.42/1.01 % SZS status Unsatisfiable
% 0.42/1.01 % SZS output start Refutation
% 0.42/1.01
% 0.42/1.01 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.42/1.01 % Length of proof is 72.
% 0.42/1.01 % Level of proof is 13.
% 0.42/1.01 % Maximum clause weight is 20.000.
% 0.42/1.01 % Given clauses 262.
% 0.42/1.01
% 0.42/1.01 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.42/1.01 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.42/1.01 4 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom). [assumption].
% 0.42/1.01 6 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.42/1.01 7 -equalish(e_2,e_4) # label(e_2_is_not_e_4) # label(axiom). [assumption].
% 0.42/1.01 10 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom). [assumption].
% 0.42/1.01 14 -product1(A,B,C) | -product1(A,D,C) | equalish(B,D) # label(product1_right_cancellation) # label(axiom). [assumption].
% 0.42/1.01 15 -product1(A,B,C) | -product1(D,B,C) | equalish(A,D) # label(product1_left_cancellation) # label(axiom). [assumption].
% 0.42/1.01 16 -product2(A,B,C) | -product2(A,B,D) | equalish(C,D) # label(product2_total_function2) # label(axiom). [assumption].
% 0.42/1.01 19 group_element(e_1) # label(element_1) # label(axiom). [assumption].
% 0.42/1.01 20 group_element(e_2) # label(element_2) # label(axiom). [assumption].
% 0.42/1.01 21 group_element(e_3) # label(element_3) # label(axiom). [assumption].
% 0.42/1.01 22 group_element(e_4) # label(element_4) # label(axiom). [assumption].
% 0.42/1.01 23 product1(A,A,A) # label(product1_idempotence) # label(axiom). [assumption].
% 0.42/1.01 24 product2(A,A,A) # label(product2_idempotence) # label(axiom). [assumption].
% 0.42/1.01 25 -product1(A,B,C) | -product1(C,A,D) | product2(D,B,A) # label(qg2a) # label(negated_conjecture). [assumption].
% 0.42/1.01 26 -group_element(A) | -group_element(B) | product1(A,B,e_1) | product1(A,B,e_2) | product1(A,B,e_3) | product1(A,B,e_4) # label(product1_total_function1) # label(axiom). [assumption].
% 0.42/1.01 34 -product1(A,e_1,B) | -product1(A,e_2,B). [resolve(14,c,2,a)].
% 0.42/1.01 35 -product1(A,e_1,B) | -product1(A,e_3,B). [resolve(14,c,3,a)].
% 0.42/1.01 37 -product1(A,e_2,B) | -product1(A,e_3,B). [resolve(14,c,6,a)].
% 0.42/1.01 38 -product1(A,e_2,B) | -product1(A,e_4,B). [resolve(14,c,7,a)].
% 0.42/1.01 39 -product1(A,e_3,B) | -product1(A,e_4,B). [resolve(14,c,10,a)].
% 0.42/1.01 40 -product1(e_1,A,B) | -product1(e_2,A,B). [resolve(15,c,2,a)].
% 0.42/1.01 41 -product1(e_1,A,B) | -product1(e_3,A,B). [resolve(15,c,3,a)].
% 0.42/1.01 42 -product1(e_1,A,B) | -product1(e_4,A,B). [resolve(15,c,4,a)].
% 0.42/1.01 43 -product1(e_2,A,B) | -product1(e_3,A,B). [resolve(15,c,6,a)].
% 0.42/1.01 44 -product1(e_2,A,B) | -product1(e_4,A,B). [resolve(15,c,7,a)].
% 0.42/1.01 45 -product1(e_3,A,B) | -product1(e_4,A,B). [resolve(15,c,10,a)].
% 0.42/1.01 49 -product2(A,B,e_2) | -product2(A,B,e_3). [resolve(16,c,6,a)].
% 0.42/1.01 68 -group_element(A) | product1(e_4,A,e_1) | product1(e_4,A,e_2) | product1(e_4,A,e_3) | product1(e_4,A,e_4). [resolve(26,a,22,a)].
% 0.42/1.01 69 -group_element(A) | product1(e_3,A,e_1) | product1(e_3,A,e_2) | product1(e_3,A,e_3) | product1(e_3,A,e_4). [resolve(26,a,21,a)].
% 0.42/1.01 70 -group_element(A) | product1(e_2,A,e_1) | product1(e_2,A,e_2) | product1(e_2,A,e_3) | product1(e_2,A,e_4). [resolve(26,a,20,a)].
% 0.42/1.01 71 -group_element(A) | product1(e_1,A,e_1) | product1(e_1,A,e_2) | product1(e_1,A,e_3) | product1(e_1,A,e_4). [resolve(26,a,19,a)].
% 0.42/1.01 97 -product1(e_1,e_2,e_1). [ur(34,a,23,a)].
% 0.42/1.01 99 -product1(e_1,e_3,e_1). [ur(35,a,23,a)].
% 0.42/1.01 102 -product1(e_3,e_2,e_3). [resolve(37,b,23,a)].
% 0.42/1.01 103 -product1(e_2,e_3,e_2). [ur(37,a,23,a)].
% 0.42/1.01 104 -product1(e_4,e_2,e_4). [resolve(38,b,23,a)].
% 0.42/1.01 106 -product1(e_4,e_3,e_4). [resolve(39,b,23,a)].
% 0.42/1.01 108 -product1(e_1,e_2,e_2). [resolve(40,b,23,a)].
% 0.42/1.01 110 -product1(e_1,e_3,e_3). [resolve(41,b,23,a)].
% 0.42/1.01 114 -product1(e_2,e_3,e_3). [resolve(43,b,23,a)].
% 0.42/1.01 115 -product1(e_3,e_2,e_2). [ur(43,a,23,a)].
% 0.42/1.01 117 -product1(e_4,e_2,e_2). [ur(44,a,23,a)].
% 0.42/1.01 119 -product1(e_4,e_3,e_3). [ur(45,a,23,a)].
% 0.42/1.01 126 -product2(e_3,e_3,e_2). [resolve(49,b,24,a)].
% 0.42/1.01 127 -product2(e_2,e_2,e_3). [ur(49,a,24,a)].
% 0.42/1.01 156 product1(e_4,e_3,e_1) | product1(e_4,e_3,e_2). [resolve(68,a,21,a),unit_del(c,119),unit_del(d,106)].
% 0.42/1.01 157 product1(e_4,e_2,e_1) | product1(e_4,e_2,e_3). [resolve(68,a,20,a),unit_del(b,117),unit_del(d,104)].
% 0.42/1.01 159 product1(e_4,e_3,e_1) | -product1(e_1,e_3,e_2). [resolve(156,b,42,b)].
% 0.42/1.01 161 product1(e_4,e_3,e_1) | -product1(e_3,A,e_4) | product2(e_2,A,e_3). [resolve(156,b,25,b)].
% 0.42/1.01 163 product1(e_4,e_2,e_1) | -product1(e_1,e_2,e_3). [resolve(157,b,42,b)].
% 0.42/1.01 165 product1(e_4,e_2,e_1) | -product1(e_2,A,e_4) | product2(e_3,A,e_2). [resolve(157,b,25,b)].
% 0.42/1.01 168 product1(e_3,e_2,e_1) | product1(e_3,e_2,e_4). [resolve(69,a,20,a),unit_del(b,115),unit_del(c,102)].
% 0.42/1.01 174 product1(e_2,e_3,e_1) | product1(e_2,e_3,e_4). [resolve(70,a,21,a),unit_del(b,103),unit_del(c,114)].
% 0.42/1.01 189 product1(e_1,e_3,e_2) | product1(e_1,e_3,e_4). [resolve(71,a,21,a),unit_del(a,99),unit_del(c,110)].
% 0.42/1.01 190 product1(e_1,e_2,e_3) | product1(e_1,e_2,e_4). [resolve(71,a,20,a),unit_del(a,97),unit_del(b,108)].
% 0.42/1.01 209 product1(e_1,e_3,e_2) | -product1(e_1,e_2,e_4). [resolve(189,b,37,b)].
% 0.42/1.01 227 product1(e_1,e_3,e_2) | product1(e_1,e_2,e_3). [resolve(209,b,190,b)].
% 0.42/1.01 256 product1(e_1,e_2,e_3) | product1(e_4,e_3,e_1). [resolve(227,a,159,b)].
% 0.42/1.01 282 product1(e_1,e_2,e_3) | -product1(e_2,e_3,e_1). [resolve(256,b,44,b)].
% 0.42/1.01 283 product1(e_1,e_2,e_3) | -product1(e_4,e_2,e_1). [resolve(256,b,37,b)].
% 0.42/1.01 297 product1(e_4,e_3,e_1) | product1(e_3,e_2,e_1). [resolve(161,b,168,b),unit_del(b,127)].
% 0.42/1.01 309 product1(e_4,e_2,e_1) | product1(e_2,e_3,e_1). [resolve(165,b,174,b),unit_del(b,126)].
% 0.42/1.01 325 product1(e_3,e_2,e_1) | -product1(e_4,e_2,e_1). [resolve(297,a,37,b)].
% 0.42/1.01 341 product1(e_2,e_3,e_1) | product1(e_1,e_2,e_3). [resolve(309,a,283,b)].
% 0.42/1.01 343 product1(e_2,e_3,e_1) | -product1(e_3,e_2,e_1). [resolve(309,a,45,b)].
% 0.42/1.01 385 product1(e_1,e_2,e_3). [resolve(341,a,282,b),merge(b)].
% 0.42/1.01 387 product1(e_4,e_2,e_1). [back_unit_del(163),unit_del(b,385)].
% 0.42/1.01 390 product1(e_3,e_2,e_1). [back_unit_del(325),unit_del(b,387)].
% 0.42/1.01 394 product1(e_2,e_3,e_1). [back_unit_del(343),unit_del(b,390)].
% 0.42/1.01 402 $F. [ur(25,b,385,a,c,126,a),unit_del(a,394)].
% 0.42/1.01
% 0.42/1.01 % SZS output end Refutation
% 0.42/1.01 ============================== end of proof ==========================
% 0.42/1.01
% 0.42/1.01 ============================== STATISTICS ============================
% 0.42/1.01
% 0.42/1.01 Given=262. Generated=794. Kept=383. proofs=1.
% 0.42/1.01 Usable=179. Sos=18. Demods=0. Limbo=5, Disabled=244. Hints=0.
% 0.42/1.01 Megabytes=0.24.
% 0.42/1.01 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.42/1.01
% 0.42/1.01 ============================== end of statistics =====================
% 0.42/1.01
% 0.42/1.01 ============================== end of search =========================
% 0.42/1.01
% 0.42/1.01 THEOREM PROVED
% 0.42/1.01 % SZS status Unsatisfiable
% 0.42/1.01
% 0.42/1.01 Exiting with 1 proof.
% 0.42/1.01
% 0.42/1.01 Process 10263 exit (max_proofs) Mon Jun 13 14:06:08 2022
% 0.42/1.01 Prover9 interrupted
%------------------------------------------------------------------------------