TSTP Solution File: GRP124-9.004 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP124-9.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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:22 EDT 2022
% Result : Unsatisfiable 0.71s 1.02s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP124-9.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 11:46:52 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.71/0.99 ============================== Prover9 ===============================
% 0.71/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.99 Process 16537 was started by sandbox on n015.cluster.edu,
% 0.71/0.99 Mon Jun 13 11:46:53 2022
% 0.71/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_16383_n015.cluster.edu".
% 0.71/0.99 ============================== end of head ===========================
% 0.71/0.99
% 0.71/0.99 ============================== INPUT =================================
% 0.71/0.99
% 0.71/0.99 % Reading from file /tmp/Prover9_16383_n015.cluster.edu
% 0.71/0.99
% 0.71/0.99 set(prolog_style_variables).
% 0.71/0.99 set(auto2).
% 0.71/0.99 % set(auto2) -> set(auto).
% 0.71/0.99 % set(auto) -> set(auto_inference).
% 0.71/0.99 % set(auto) -> set(auto_setup).
% 0.71/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.71/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.99 % set(auto) -> set(auto_limits).
% 0.71/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.99 % set(auto) -> set(auto_denials).
% 0.71/0.99 % set(auto) -> set(auto_process).
% 0.71/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.71/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.71/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.71/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.71/0.99 % set(auto2) -> assign(stats, some).
% 0.71/0.99 % set(auto2) -> clear(echo_input).
% 0.71/0.99 % set(auto2) -> set(quiet).
% 0.71/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.99 % set(auto2) -> clear(print_given).
% 0.71/0.99 assign(lrs_ticks,-1).
% 0.71/0.99 assign(sos_limit,10000).
% 0.71/0.99 assign(order,kbo).
% 0.71/0.99 set(lex_order_vars).
% 0.71/0.99 clear(print_given).
% 0.71/0.99
% 0.71/0.99 % formulas(sos). % not echoed (29 formulas)
% 0.71/0.99
% 0.71/0.99 ============================== end of input ==========================
% 0.71/0.99
% 0.71/0.99 % From the command line: assign(max_seconds, 300).
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.99
% 0.71/0.99 % Formulas that are not ordinary clauses:
% 0.71/0.99
% 0.71/0.99 ============================== end of process non-clausal formulas ===
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.99
% 0.71/0.99 ============================== PREDICATE ELIMINATION =================
% 0.71/0.99 1 -product1(A,B,C) | -product1(A,B,D) | equalish(C,D) # label(product1_total_function2) # label(axiom). [assumption].
% 0.71/0.99 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.71/0.99 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.71/0.99 4 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom). [assumption].
% 0.71/0.99 5 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.71/0.99 6 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.71/0.99 7 -equalish(e_2,e_4) # label(e_2_is_not_e_4) # label(axiom). [assumption].
% 0.71/0.99 8 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.71/0.99 9 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.71/0.99 10 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom). [assumption].
% 0.71/0.99 11 -equalish(e_4,e_1) # label(e_4_is_not_e_1) # label(axiom). [assumption].
% 0.71/0.99 12 -equalish(e_4,e_2) # label(e_4_is_not_e_2) # label(axiom). [assumption].
% 0.71/0.99 13 -equalish(e_4,e_3) # label(e_4_is_not_e_3) # label(axiom). [assumption].
% 0.71/0.99 Derived: -product1(A,B,e_1) | -product1(A,B,e_2). [resolve(1,c,2,a)].
% 0.71/0.99 Derived: -product1(A,B,e_1) | -product1(A,B,e_3). [resolve(1,c,3,a)].
% 0.71/0.99 Derived: -product1(A,B,e_1) | -product1(A,B,e_4). [resolve(1,c,4,a)].
% 0.71/0.99 Derived: -product1(A,B,e_2) | -product1(A,B,e_3). [resolve(1,c,6,a)].
% 0.71/0.99 Derived: -product1(A,B,e_2) | -product1(A,B,e_4). [resolve(1,c,7,a)].
% 0.71/0.99 Derived: -product1(A,B,e_3) | -product1(A,B,e_4). [resolve(1,c,10,a)].
% 0.71/0.99 14 -product1(A,B,C) | -product1(A,D,C) | equalish(B,D) # label(product1_right_cancellation) # label(axiom). [assumption].
% 0.71/0.99 Derived: -product1(A,e_1,B) | -product1(A,e_2,B). [resolve(14,c,2,a)].
% 0.71/0.99 Derived: -product1(A,e_1,B) | -product1(A,e_3,B). [resolve(14,c,3,a)].
% 0.71/0.99 Derived: -product1(A,e_1,B) | -product1(A,e_4,B). [resolve(14,c,4,a)].
% 0.71/1.02 Derived: -product1(A,e_2,B) | -product1(A,e_3,B). [resolve(14,c,6,a)].
% 0.71/1.02 Derived: -product1(A,e_2,B) | -product1(A,e_4,B). [resolve(14,c,7,a)].
% 0.71/1.02 Derived: -product1(A,e_3,B) | -product1(A,e_4,B). [resolve(14,c,10,a)].
% 0.71/1.02 15 -product1(A,B,C) | -product1(D,B,C) | equalish(A,D) # label(product1_left_cancellation) # label(axiom). [assumption].
% 0.71/1.02 Derived: -product1(e_1,A,B) | -product1(e_2,A,B). [resolve(15,c,2,a)].
% 0.71/1.02 Derived: -product1(e_1,A,B) | -product1(e_3,A,B). [resolve(15,c,3,a)].
% 0.71/1.02 Derived: -product1(e_1,A,B) | -product1(e_4,A,B). [resolve(15,c,4,a)].
% 0.71/1.02 Derived: -product1(e_2,A,B) | -product1(e_3,A,B). [resolve(15,c,6,a)].
% 0.71/1.02 Derived: -product1(e_2,A,B) | -product1(e_4,A,B). [resolve(15,c,7,a)].
% 0.71/1.02 Derived: -product1(e_3,A,B) | -product1(e_4,A,B). [resolve(15,c,10,a)].
% 0.71/1.02 16 -product2(A,B,C) | -product2(A,B,D) | equalish(C,D) # label(product2_total_function2) # label(axiom). [assumption].
% 0.71/1.02 Derived: -product2(A,B,e_1) | -product2(A,B,e_2). [resolve(16,c,2,a)].
% 0.71/1.02 Derived: -product2(A,B,e_1) | -product2(A,B,e_3). [resolve(16,c,3,a)].
% 0.71/1.02 Derived: -product2(A,B,e_1) | -product2(A,B,e_4). [resolve(16,c,4,a)].
% 0.71/1.02 Derived: -product2(A,B,e_2) | -product2(A,B,e_3). [resolve(16,c,6,a)].
% 0.71/1.02 Derived: -product2(A,B,e_2) | -product2(A,B,e_4). [resolve(16,c,7,a)].
% 0.71/1.02 Derived: -product2(A,B,e_3) | -product2(A,B,e_4). [resolve(16,c,10,a)].
% 0.71/1.02 17 -product2(A,B,C) | -product2(A,D,C) | equalish(B,D) # label(product2_right_cancellation) # label(axiom). [assumption].
% 0.71/1.02 Derived: -product2(A,e_1,B) | -product2(A,e_2,B). [resolve(17,c,2,a)].
% 0.71/1.02 Derived: -product2(A,e_1,B) | -product2(A,e_3,B). [resolve(17,c,3,a)].
% 0.71/1.02 Derived: -product2(A,e_1,B) | -product2(A,e_4,B). [resolve(17,c,4,a)].
% 0.71/1.02 Derived: -product2(A,e_2,B) | -product2(A,e_3,B). [resolve(17,c,6,a)].
% 0.71/1.02 Derived: -product2(A,e_2,B) | -product2(A,e_4,B). [resolve(17,c,7,a)].
% 0.71/1.02 Derived: -product2(A,e_3,B) | -product2(A,e_4,B). [resolve(17,c,10,a)].
% 0.71/1.02 18 -product2(A,B,C) | -product2(D,B,C) | equalish(A,D) # label(product2_left_cancellation) # label(axiom). [assumption].
% 0.71/1.02 Derived: -product2(e_1,A,B) | -product2(e_2,A,B). [resolve(18,c,2,a)].
% 0.71/1.02 Derived: -product2(e_1,A,B) | -product2(e_3,A,B). [resolve(18,c,3,a)].
% 0.71/1.02 Derived: -product2(e_1,A,B) | -product2(e_4,A,B). [resolve(18,c,4,a)].
% 0.71/1.02 Derived: -product2(e_2,A,B) | -product2(e_3,A,B). [resolve(18,c,6,a)].
% 0.71/1.02 Derived: -product2(e_2,A,B) | -product2(e_4,A,B). [resolve(18,c,7,a)].
% 0.71/1.02 Derived: -product2(e_3,A,B) | -product2(e_4,A,B). [resolve(18,c,10,a)].
% 0.71/1.02
% 0.71/1.02 ============================== end predicate elimination =============
% 0.71/1.02
% 0.71/1.02 Auto_denials: (non-Horn, no changes).
% 0.71/1.02
% 0.71/1.02 Term ordering decisions:
% 0.71/1.02 Function symbol KB weights: e_1=1. e_2=1. e_3=1. e_4=1.
% 0.71/1.02
% 0.71/1.02 ============================== end of process initial clauses ========
% 0.71/1.02
% 0.71/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.02
% 0.71/1.02 ============================== end of clauses for search =============
% 0.71/1.02
% 0.71/1.02 ============================== SEARCH ================================
% 0.71/1.02
% 0.71/1.02 % Starting search at 0.02 seconds.
% 0.71/1.02
% 0.71/1.02 ============================== PROOF =================================
% 0.71/1.02 % SZS status Unsatisfiable
% 0.71/1.02 % SZS output start Refutation
% 0.71/1.02
% 0.71/1.02 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.71/1.02 % Length of proof is 78.
% 0.71/1.02 % Level of proof is 12.
% 0.71/1.02 % Maximum clause weight is 20.000.
% 0.71/1.02 % Given clauses 310.
% 0.71/1.02
% 0.71/1.02 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.71/1.02 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.71/1.02 4 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom). [assumption].
% 0.71/1.02 6 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.71/1.02 7 -equalish(e_2,e_4) # label(e_2_is_not_e_4) # label(axiom). [assumption].
% 0.71/1.02 10 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom). [assumption].
% 0.71/1.02 14 -product1(A,B,C) | -product1(A,D,C) | equalish(B,D) # label(product1_right_cancellation) # label(axiom). [assumption].
% 0.71/1.02 15 -product1(A,B,C) | -product1(D,B,C) | equalish(A,D) # label(product1_left_cancellation) # label(axiom). [assumption].
% 0.71/1.02 16 -product2(A,B,C) | -product2(A,B,D) | equalish(C,D) # label(product2_total_function2) # label(axiom). [assumption].
% 0.71/1.02 19 group_element(e_1) # label(element_1) # label(axiom). [assumption].
% 0.71/1.02 20 group_element(e_2) # label(element_2) # label(axiom). [assumption].
% 0.71/1.02 21 group_element(e_3) # label(element_3) # label(axiom). [assumption].
% 0.71/1.02 22 group_element(e_4) # label(element_4) # label(axiom). [assumption].
% 0.71/1.02 23 product1(A,A,A) # label(product1_idempotence) # label(axiom). [assumption].
% 0.71/1.02 24 product2(A,A,A) # label(product2_idempotence) # label(axiom). [assumption].
% 0.71/1.02 25 -product1(A,B,C) | -product1(C,A,D) | product2(D,B,A) # label(qg2a) # label(negated_conjecture). [assumption].
% 0.71/1.02 28 -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.71/1.02 36 -product1(A,e_1,B) | -product1(A,e_2,B). [resolve(14,c,2,a)].
% 0.71/1.02 37 -product1(A,e_1,B) | -product1(A,e_3,B). [resolve(14,c,3,a)].
% 0.71/1.02 38 -product1(A,e_1,B) | -product1(A,e_4,B). [resolve(14,c,4,a)].
% 0.71/1.02 39 -product1(A,e_2,B) | -product1(A,e_3,B). [resolve(14,c,6,a)].
% 0.71/1.02 40 -product1(A,e_2,B) | -product1(A,e_4,B). [resolve(14,c,7,a)].
% 0.71/1.02 41 -product1(A,e_3,B) | -product1(A,e_4,B). [resolve(14,c,10,a)].
% 0.71/1.02 42 -product1(e_1,A,B) | -product1(e_2,A,B). [resolve(15,c,2,a)].
% 0.71/1.02 43 -product1(e_1,A,B) | -product1(e_3,A,B). [resolve(15,c,3,a)].
% 0.71/1.02 44 -product1(e_1,A,B) | -product1(e_4,A,B). [resolve(15,c,4,a)].
% 0.71/1.02 45 -product1(e_2,A,B) | -product1(e_3,A,B). [resolve(15,c,6,a)].
% 0.71/1.02 46 -product1(e_2,A,B) | -product1(e_4,A,B). [resolve(15,c,7,a)].
% 0.71/1.02 47 -product1(e_3,A,B) | -product1(e_4,A,B). [resolve(15,c,10,a)].
% 0.71/1.02 49 -product2(A,B,e_1) | -product2(A,B,e_3). [resolve(16,c,3,a)].
% 0.71/1.02 50 -product2(A,B,e_1) | -product2(A,B,e_4). [resolve(16,c,4,a)].
% 0.71/1.02 88 -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(28,a,22,a)].
% 0.71/1.02 89 -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(28,a,21,a)].
% 0.71/1.02 90 -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(28,a,20,a)].
% 0.71/1.02 116 -product1(e_2,e_1,e_2). [resolve(36,b,23,a)].
% 0.71/1.02 118 -product1(e_3,e_1,e_3). [resolve(37,b,23,a)].
% 0.71/1.02 120 -product1(e_4,e_1,e_4). [resolve(38,b,23,a)].
% 0.71/1.02 122 -product1(e_3,e_2,e_3). [resolve(39,b,23,a)].
% 0.71/1.02 124 -product1(e_4,e_2,e_4). [resolve(40,b,23,a)].
% 0.71/1.02 126 -product1(e_4,e_3,e_4). [resolve(41,b,23,a)].
% 0.71/1.02 127 -product1(e_3,e_4,e_3). [ur(41,a,23,a)].
% 0.71/1.02 129 -product1(e_2,e_1,e_1). [ur(42,a,23,a)].
% 0.71/1.02 131 -product1(e_3,e_1,e_1). [ur(43,a,23,a)].
% 0.71/1.02 133 -product1(e_4,e_1,e_1). [ur(44,a,23,a)].
% 0.71/1.02 135 -product1(e_3,e_2,e_2). [ur(45,a,23,a)].
% 0.71/1.02 137 -product1(e_4,e_2,e_2). [ur(46,a,23,a)].
% 0.71/1.02 138 -product1(e_3,e_4,e_4). [resolve(47,b,23,a)].
% 0.71/1.02 139 -product1(e_4,e_3,e_3). [ur(47,a,23,a)].
% 0.71/1.02 143 -product2(e_1,e_1,e_3). [ur(49,a,24,a)].
% 0.71/1.02 145 -product2(e_1,e_1,e_4). [ur(50,a,24,a)].
% 0.71/1.02 208 product1(e_4,e_3,e_1) | product1(e_4,e_3,e_2). [resolve(88,a,21,a),unit_del(c,139),unit_del(d,126)].
% 0.71/1.02 209 product1(e_4,e_2,e_1) | product1(e_4,e_2,e_3). [resolve(88,a,20,a),unit_del(b,137),unit_del(d,124)].
% 0.71/1.02 210 product1(e_4,e_1,e_2) | product1(e_4,e_1,e_3). [resolve(88,a,19,a),unit_del(a,133),unit_del(d,120)].
% 0.71/1.02 212 product1(e_4,e_3,e_1) | -product1(e_4,e_1,e_2). [resolve(208,b,37,b)].
% 0.71/1.02 216 product1(e_4,e_2,e_1) | -product1(e_4,e_1,e_3). [resolve(209,b,36,b)].
% 0.71/1.02 219 product1(e_4,e_1,e_2) | -product1(e_2,e_1,e_3). [resolve(210,b,46,b)].
% 0.71/1.02 221 product1(e_4,e_1,e_2) | -product1(e_3,e_4,A) | product2(A,e_1,e_4). [resolve(210,b,25,a)].
% 0.71/1.02 222 product1(e_3,e_4,e_1) | product1(e_3,e_4,e_2). [resolve(89,a,22,a),unit_del(c,127),unit_del(d,138)].
% 0.71/1.02 223 product1(e_3,e_2,e_1) | product1(e_3,e_2,e_4). [resolve(89,a,20,a),unit_del(b,135),unit_del(c,122)].
% 0.71/1.02 224 product1(e_3,e_1,e_2) | product1(e_3,e_1,e_4). [resolve(89,a,19,a),unit_del(a,131),unit_del(c,118)].
% 0.71/1.02 225 product1(e_4,e_2,e_1) | product1(e_4,e_1,e_2). [resolve(216,b,210,b)].
% 0.71/1.02 228 product1(e_2,e_1,e_3) | product1(e_2,e_1,e_4). [resolve(90,a,19,a),unit_del(a,129),unit_del(b,116)].
% 0.71/1.02 230 product1(e_3,e_4,e_1) | -product1(e_3,e_1,e_2). [resolve(222,b,38,b)].
% 0.71/1.02 234 product1(e_3,e_2,e_1) | -product1(e_3,e_1,e_4). [resolve(223,b,36,b)].
% 0.71/1.02 237 product1(e_3,e_1,e_2) | -product1(e_2,e_1,e_4). [resolve(224,b,45,b)].
% 0.71/1.02 239 product1(e_3,e_1,e_2) | -product1(e_4,e_3,A) | product2(A,e_1,e_3). [resolve(224,b,25,a)].
% 0.71/1.02 240 product1(e_4,e_1,e_2) | -product1(e_3,e_2,e_1). [resolve(225,a,47,b)].
% 0.71/1.02 256 product1(e_3,e_2,e_1) | product1(e_3,e_1,e_2). [resolve(234,b,224,b)].
% 0.71/1.02 257 product1(e_3,e_1,e_2) | product1(e_2,e_1,e_3). [resolve(237,b,228,b)].
% 0.71/1.02 270 product1(e_3,e_1,e_2) | product1(e_4,e_1,e_2). [resolve(256,a,240,b)].
% 0.71/1.02 273 product1(e_2,e_1,e_3) | product1(e_3,e_4,e_1). [resolve(257,a,230,b)].
% 0.71/1.02 293 product1(e_3,e_1,e_2) | product1(e_4,e_3,e_1). [resolve(270,b,212,b)].
% 0.71/1.02 375 product1(e_4,e_1,e_2) | product1(e_2,e_1,e_3). [resolve(221,b,273,b),unit_del(b,145)].
% 0.71/1.02 417 product1(e_2,e_1,e_3) | -product1(e_3,e_1,e_2). [resolve(375,a,47,b)].
% 0.71/1.02 433 product1(e_3,e_1,e_2). [resolve(239,b,293,b),merge(c),unit_del(b,143)].
% 0.71/1.02 434 product1(e_2,e_1,e_3). [back_unit_del(417),unit_del(b,433)].
% 0.71/1.02 440 product1(e_4,e_1,e_2). [back_unit_del(219),unit_del(b,434)].
% 0.71/1.02 447 $F. [ur(47,a,433,a),unit_del(a,440)].
% 0.71/1.02
% 0.71/1.02 % SZS output end Refutation
% 0.71/1.02 ============================== end of proof ==========================
% 0.71/1.02
% 0.71/1.02 ============================== STATISTICS ============================
% 0.71/1.02
% 0.71/1.02 Given=310. Generated=850. Kept=428. proofs=1.
% 0.71/1.02 Usable=227. Sos=16. Demods=0. Limbo=2, Disabled=248. Hints=0.
% 0.71/1.02 Megabytes=0.28.
% 0.71/1.02 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.71/1.02
% 0.71/1.02 ============================== end of statistics =====================
% 0.71/1.02
% 0.71/1.02 ============================== end of search =========================
% 0.71/1.02
% 0.71/1.02 THEOREM PROVED
% 0.71/1.02 % SZS status Unsatisfiable
% 0.71/1.02
% 0.71/1.02 Exiting with 1 proof.
% 0.71/1.02
% 0.71/1.02 Process 16537 exit (max_proofs) Mon Jun 13 11:46:53 2022
% 0.71/1.02 Prover9 interrupted
%------------------------------------------------------------------------------