TSTP Solution File: GRP265-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP265-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:18:24 EDT 2022
% Result : Unsatisfiable 1.48s 1.76s
% Output : Refutation 1.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP265-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 09:00:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.48/1.76 ============================== Prover9 ===============================
% 1.48/1.76 Prover9 (32) version 2009-11A, November 2009.
% 1.48/1.76 Process 18607 was started by sandbox on n026.cluster.edu,
% 1.48/1.76 Mon Jun 13 09:00:06 2022
% 1.48/1.76 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_18234_n026.cluster.edu".
% 1.48/1.76 ============================== end of head ===========================
% 1.48/1.76
% 1.48/1.76 ============================== INPUT =================================
% 1.48/1.76
% 1.48/1.76 % Reading from file /tmp/Prover9_18234_n026.cluster.edu
% 1.48/1.76
% 1.48/1.76 set(prolog_style_variables).
% 1.48/1.76 set(auto2).
% 1.48/1.76 % set(auto2) -> set(auto).
% 1.48/1.76 % set(auto) -> set(auto_inference).
% 1.48/1.76 % set(auto) -> set(auto_setup).
% 1.48/1.76 % set(auto_setup) -> set(predicate_elim).
% 1.48/1.76 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.48/1.76 % set(auto) -> set(auto_limits).
% 1.48/1.76 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.48/1.76 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.48/1.76 % set(auto) -> set(auto_denials).
% 1.48/1.76 % set(auto) -> set(auto_process).
% 1.48/1.76 % set(auto2) -> assign(new_constants, 1).
% 1.48/1.76 % set(auto2) -> assign(fold_denial_max, 3).
% 1.48/1.76 % set(auto2) -> assign(max_weight, "200.000").
% 1.48/1.76 % set(auto2) -> assign(max_hours, 1).
% 1.48/1.76 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.48/1.76 % set(auto2) -> assign(max_seconds, 0).
% 1.48/1.76 % set(auto2) -> assign(max_minutes, 5).
% 1.48/1.76 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.48/1.76 % set(auto2) -> set(sort_initial_sos).
% 1.48/1.76 % set(auto2) -> assign(sos_limit, -1).
% 1.48/1.76 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.48/1.76 % set(auto2) -> assign(max_megs, 400).
% 1.48/1.76 % set(auto2) -> assign(stats, some).
% 1.48/1.76 % set(auto2) -> clear(echo_input).
% 1.48/1.76 % set(auto2) -> set(quiet).
% 1.48/1.76 % set(auto2) -> clear(print_initial_clauses).
% 1.48/1.76 % set(auto2) -> clear(print_given).
% 1.48/1.76 assign(lrs_ticks,-1).
% 1.48/1.76 assign(sos_limit,10000).
% 1.48/1.76 assign(order,kbo).
% 1.48/1.76 set(lex_order_vars).
% 1.48/1.76 clear(print_given).
% 1.48/1.76
% 1.48/1.76 % formulas(sos). % not echoed (32 formulas)
% 1.48/1.76
% 1.48/1.76 ============================== end of input ==========================
% 1.48/1.76
% 1.48/1.76 % From the command line: assign(max_seconds, 300).
% 1.48/1.76
% 1.48/1.76 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.48/1.76
% 1.48/1.76 % Formulas that are not ordinary clauses:
% 1.48/1.76
% 1.48/1.76 ============================== end of process non-clausal formulas ===
% 1.48/1.76
% 1.48/1.76 ============================== PROCESS INITIAL CLAUSES ===============
% 1.48/1.76
% 1.48/1.76 ============================== PREDICATE ELIMINATION =================
% 1.48/1.76
% 1.48/1.76 ============================== end predicate elimination =============
% 1.48/1.76
% 1.48/1.76 Auto_denials: (non-Horn, no changes).
% 1.48/1.76
% 1.48/1.76 Term ordering decisions:
% 1.48/1.76
% 1.48/1.76 % Assigning unary symbol inverse kb_weight 0 and highest precedence (13).
% 1.48/1.76 Function symbol KB weights: sk_c8=1. sk_c7=1. sk_c9=1. sk_c1=1. sk_c2=1. sk_c3=1. sk_c4=1. sk_c5=1. sk_c6=1. identity=1. multiply=1. inverse=0.
% 1.48/1.76
% 1.48/1.76 ============================== end of process initial clauses ========
% 1.48/1.76
% 1.48/1.76 ============================== CLAUSES FOR SEARCH ====================
% 1.48/1.76
% 1.48/1.76 ============================== end of clauses for search =============
% 1.48/1.76
% 1.48/1.76 ============================== SEARCH ================================
% 1.48/1.76
% 1.48/1.76 % Starting search at 0.02 seconds.
% 1.48/1.76
% 1.48/1.76 ============================== PROOF =================================
% 1.48/1.76 % SZS status Unsatisfiable
% 1.48/1.76 % SZS output start Refutation
% 1.48/1.76
% 1.48/1.76 % Proof 1 at 0.73 (+ 0.01) seconds.
% 1.48/1.76 % Length of proof is 96.
% 1.48/1.76 % Level of proof is 22.
% 1.48/1.76 % Maximum clause weight is 50.000.
% 1.48/1.76 % Given clauses 341.
% 1.48/1.76
% 1.48/1.76 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 1.48/1.76 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 1.48/1.76 3 inverse(sk_c1) = sk_c9 | inverse(sk_c3) = sk_c9 # label(prove_this_9) # label(negated_conjecture). [assumption].
% 1.48/1.76 7 inverse(sk_c2) = sk_c8 | inverse(sk_c4) = sk_c7 # label(prove_this_25) # label(negated_conjecture). [assumption].
% 1.48/1.76 8 inverse(sk_c2) = sk_c8 | inverse(sk_c5) = sk_c7 # label(prove_this_28) # label(negated_conjecture). [assumption].
% 1.48/1.76 9 multiply(sk_c1,sk_c9) = sk_c8 | inverse(sk_c3) = sk_c9 # label(prove_this_2) # label(negated_conjecture). [assumption].
% 1.48/1.76 10 multiply(sk_c1,sk_c9) = sk_c8 | inverse(sk_c4) = sk_c7 # label(prove_this_4) # label(negated_conjecture). [assumption].
% 1.48/1.76 11 multiply(sk_c1,sk_c9) = sk_c8 | inverse(sk_c5) = sk_c7 # label(prove_this_7) # label(negated_conjecture). [assumption].
% 1.48/1.76 12 inverse(sk_c1) = sk_c9 | multiply(sk_c3,sk_c9) = sk_c8 # label(prove_this_8) # label(negated_conjecture). [assumption].
% 1.48/1.76 17 multiply(sk_c2,sk_c8) = sk_c7 | inverse(sk_c4) = sk_c7 # label(prove_this_18) # label(negated_conjecture). [assumption].
% 1.48/1.76 18 multiply(sk_c2,sk_c8) = sk_c7 | inverse(sk_c5) = sk_c7 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 1.48/1.76 21 inverse(sk_c2) = sk_c8 | multiply(sk_c7,sk_c6) = sk_c8 # label(prove_this_26) # label(negated_conjecture). [assumption].
% 1.48/1.76 22 inverse(sk_c2) = sk_c8 | multiply(sk_c5,sk_c7) = sk_c6 # label(prove_this_27) # label(negated_conjecture). [assumption].
% 1.48/1.76 23 multiply(sk_c1,sk_c9) = sk_c8 | multiply(sk_c3,sk_c9) = sk_c8 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 1.48/1.76 28 multiply(sk_c2,sk_c8) = sk_c7 | multiply(sk_c4,sk_c7) = sk_c8 # label(prove_this_17) # label(negated_conjecture). [assumption].
% 1.48/1.76 29 multiply(sk_c2,sk_c8) = sk_c7 | multiply(sk_c7,sk_c6) = sk_c8 # label(prove_this_19) # label(negated_conjecture). [assumption].
% 1.48/1.76 30 multiply(sk_c2,sk_c8) = sk_c7 | multiply(sk_c5,sk_c7) = sk_c6 # label(prove_this_20) # label(negated_conjecture). [assumption].
% 1.48/1.76 31 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 1.48/1.76 32 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | multiply(C,sk_c9) != sk_c8 | inverse(C) != sk_c9 | multiply(D,sk_c7) != sk_c8 | inverse(D) != sk_c7 | multiply(sk_c7,E) != sk_c8 | multiply(F,sk_c7) != E | inverse(F) != sk_c7 # label(prove_this_29) # label(negated_conjecture). [assumption].
% 1.48/1.76 33 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | multiply(C,sk_c7) != sk_c8 | inverse(C) != sk_c7 | multiply(sk_c7,D) != sk_c8 | multiply(E,sk_c7) != D | inverse(E) != sk_c7. [factor(32,a,e),merge(e)].
% 1.48/1.76 46 inverse(sk_c2) = sk_c8 | multiply(sk_c7,sk_c4) = identity. [para(7(b,1),2(a,1,1))].
% 1.48/1.76 47 inverse(sk_c2) = sk_c8 | multiply(sk_c7,sk_c5) = identity. [para(8(b,1),2(a,1,1))].
% 1.48/1.76 48 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),31(a,1,1)),rewrite([1(2)]),flip(a)].
% 1.48/1.76 116 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | multiply(C,sk_c7) != sk_c8 | inverse(C) != sk_c7 | multiply(sk_c7,identity) != sk_c8 | inverse(inverse(sk_c7)) != sk_c7. [resolve(33,h,2,a)].
% 1.48/1.76 125 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | identity != sk_c8 | inverse(inverse(sk_c7)) != sk_c7 | multiply(sk_c7,C) != sk_c8 | multiply(D,sk_c7) != C | inverse(D) != sk_c7. [para(2(a,1),33(e,1))].
% 1.48/1.76 198 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | identity != sk_c8 | inverse(inverse(sk_c7)) != sk_c7 | multiply(sk_c7,identity) != sk_c8. [factor(116,f,h),rewrite([2(18)])].
% 1.48/1.76 220 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | identity != sk_c8 | inverse(inverse(sk_c7)) != sk_c7 | multiply(sk_c7,C) != sk_c8 | identity != C. [factor(125,f,i),rewrite([2(30)])].
% 1.48/1.76 342 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),48(a,1,2))].
% 1.48/1.76 360 inverse(sk_c2) = sk_c8 | multiply(inverse(sk_c7),sk_c8) = sk_c6. [para(21(b,1),48(a,1,2))].
% 1.48/1.76 372 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(48(a,1),48(a,1,2))].
% 1.48/1.76 373 multiply(A,identity) = A. [back_rewrite(342),rewrite([372(4)])].
% 1.48/1.76 376 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | identity != sk_c8 | inverse(inverse(sk_c7)) != sk_c7 | sk_c7 != sk_c8. [back_rewrite(198),rewrite([373(25)])].
% 1.48/1.76 378 inverse(identity) = identity. [para(373(a,1),2(a,1))].
% 1.48/1.76 430 inverse(sk_c2) = sk_c8 | inverse(sk_c7) = sk_c4. [para(46(b,1),48(a,1,2)),rewrite([373(8)])].
% 1.48/1.76 444 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | sk_c7 != sk_c8 | identity != sk_c8 | inverse(inverse(sk_c7)) != sk_c7. [para(1(a,1),376(c,1)),rewrite([378(12)]),flip(c),merge(e),merge(g)].
% 1.48/1.76 456 identity != sk_c8 | inverse(inverse(sk_c9)) != sk_c9 | sk_c7 != sk_c8 | inverse(inverse(sk_c7)) != sk_c7. [para(2(a,1),444(a,1)),merge(d)].
% 1.48/1.76 465 inverse(sk_c2) = sk_c8 | inverse(sk_c7) = sk_c5. [para(47(b,1),48(a,1,2)),rewrite([373(8)])].
% 1.48/1.76 497 multiply(A,inverse(A)) = identity. [para(372(a,1),2(a,1))].
% 1.48/1.76 526 inverse(inverse(A)) = A. [para(372(a,1),373(a,1)),rewrite([373(2)]),flip(a)].
% 1.48/1.76 559 identity != sk_c8 | sk_c7 != sk_c8. [back_rewrite(456),rewrite([526(6),526(12)]),xx(b),xx(d)].
% 1.48/1.76 573 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | identity != sk_c8 | multiply(sk_c7,C) != sk_c8 | identity != C. [back_rewrite(220),rewrite([526(20)]),xx(f)].
% 1.48/1.76 590 inverse(sk_c7) = sk_c4 | inverse(sk_c8) = sk_c2. [para(430(a,1),526(a,1,1))].
% 1.48/1.76 591 inverse(sk_c7) = sk_c5 | inverse(sk_c8) = sk_c2. [para(465(a,1),526(a,1,1))].
% 1.48/1.76 592 inverse(sk_c1) = sk_c9 | multiply(sk_c3,sk_c9) = identity. [para(3(b,1),497(a,1,2))].
% 1.48/1.76 692 inverse(sk_c8) = sk_c2 | sk_c5 = sk_c4. [para(591(a,1),590(a,1)),merge(c)].
% 1.48/1.76 1046 inverse(sk_c1) = sk_c9 | identity = sk_c8. [para(592(b,1),12(b,1)),merge(b)].
% 1.48/1.76 1055 identity = sk_c8 | multiply(sk_c1,sk_c9) = identity. [para(1046(a,1),497(a,1,2))].
% 1.48/1.76 1114 identity = sk_c8 | inverse(sk_c3) = sk_c9. [para(1055(b,1),9(a,1)),merge(b)].
% 1.48/1.76 1115 identity = sk_c8 | inverse(sk_c4) = sk_c7. [para(1055(b,1),10(a,1)),merge(b)].
% 1.48/1.76 1116 identity = sk_c8 | inverse(sk_c5) = sk_c7. [para(1055(b,1),11(a,1)),merge(b)].
% 1.48/1.76 1123 identity = sk_c8 | multiply(sk_c3,sk_c9) = identity. [para(1114(b,1),497(a,1,2))].
% 1.48/1.76 1127 identity = sk_c8 | inverse(sk_c7) = sk_c4. [para(1115(b,1),526(a,1,1))].
% 1.48/1.76 1132 identity = sk_c8 | inverse(sk_c7) = sk_c5. [para(1116(b,1),526(a,1,1))].
% 1.48/1.76 1306 identity = sk_c8 | sk_c5 = sk_c4. [para(1132(b,1),1127(b,1)),merge(b)].
% 1.48/1.76 1311 sk_c5 = sk_c4 | inverse(sk_c8) = identity. [para(1306(a,1),378(a,1,1))].
% 1.48/1.76 1462 sk_c5 = sk_c4 | identity = sk_c2. [para(1311(b,1),692(a,1)),merge(c)].
% 1.48/1.76 1467 sk_c5 = sk_c4 | multiply(sk_c2,A) = A. [para(1462(b,1),1(a,1,1))].
% 1.48/1.76 1806 identity = sk_c8 | multiply(sk_c1,sk_c9) = sk_c8. [para(1123(b,1),23(b,1)),merge(c)].
% 1.48/1.76 2538 sk_c5 = sk_c4 | sk_c7 = sk_c8 | inverse(sk_c4) = sk_c7. [para(1467(b,1),17(a,1)),flip(b)].
% 1.48/1.76 2539 sk_c5 = sk_c4 | sk_c7 = sk_c8 | inverse(sk_c5) = sk_c7. [para(1467(b,1),18(a,1)),flip(b)].
% 1.48/1.76 2997 identity = sk_c8. [para(1806(b,1),1055(b,1)),flip(c),merge(b),merge(c)].
% 1.48/1.76 4733 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | multiply(sk_c7,C) != sk_c8 | sk_c8 != C. [back_rewrite(573),rewrite([2997(15),2997(22)]),xx(e)].
% 1.48/1.76 4744 sk_c7 != sk_c8. [back_rewrite(559),rewrite([2997(1)]),xx(a)].
% 1.48/1.76 4746 multiply(A,inverse(A)) = sk_c8. [back_rewrite(497),rewrite([2997(3)])].
% 1.48/1.76 4761 inverse(sk_c8) = sk_c8. [back_rewrite(378),rewrite([2997(1),2997(3)])].
% 1.48/1.76 4762 multiply(A,sk_c8) = A. [back_rewrite(373),rewrite([2997(1)])].
% 1.48/1.76 4769 multiply(inverse(A),A) = sk_c8. [back_rewrite(2),rewrite([2997(3)])].
% 1.48/1.76 4779 sk_c5 = sk_c4 | inverse(sk_c5) = sk_c7. [back_unit_del(2539),unit_del(b,4744)].
% 1.48/1.76 4780 sk_c5 = sk_c4 | inverse(sk_c4) = sk_c7. [back_unit_del(2538),unit_del(b,4744)].
% 1.48/1.76 4813 inverse(sk_c7) = sk_c4 | sk_c2 = sk_c8. [back_rewrite(590),rewrite([4761(6)]),flip(b)].
% 1.48/1.76 4822 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | sk_c7 != B | inverse(B) != sk_c8 | multiply(sk_c7,C) != sk_c8 | sk_c8 != C. [back_rewrite(4733),rewrite([4762(9)]),flip(c)].
% 1.48/1.76 4909 inverse(sk_c2) = sk_c8 | inverse(sk_c7) = sk_c6. [back_rewrite(360),rewrite([4762(8)])].
% 1.48/1.76 4979 sk_c2 = sk_c7 | multiply(sk_c5,sk_c7) = sk_c6. [back_rewrite(30),rewrite([4762(3)])].
% 1.48/1.76 4980 sk_c2 = sk_c7 | multiply(sk_c7,sk_c6) = sk_c8. [back_rewrite(29),rewrite([4762(3)])].
% 1.48/1.76 4981 sk_c2 = sk_c7 | multiply(sk_c4,sk_c7) = sk_c8. [back_rewrite(28),rewrite([4762(3)])].
% 1.48/1.76 5103 sk_c5 = sk_c4 | inverse(sk_c7) = sk_c5. [para(4779(b,1),526(a,1,1))].
% 1.48/1.76 5110 sk_c5 = sk_c4 | inverse(sk_c7) = sk_c4. [para(4780(b,1),526(a,1,1))].
% 1.48/1.76 5174 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | sk_c7 != B | inverse(B) != sk_c8 | inverse(sk_c7) != sk_c8. [resolve(4822,e,4746,a),flip(e)].
% 1.48/1.76 5191 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | inverse(sk_c7) != sk_c8. [factor(5174,d,e),xx(c)].
% 1.48/1.76 5195 inverse(sk_c7) != sk_c8. [resolve(5191,a,4769,a),rewrite([526(3)]),xx(a)].
% 1.48/1.76 5499 sk_c5 = sk_c4. [para(5110(b,1),5103(b,1)),flip(c),merge(b),merge(c)].
% 1.48/1.76 5584 sk_c2 = sk_c7 | multiply(sk_c4,sk_c7) = sk_c6. [back_rewrite(4979),rewrite([5499(4)])].
% 1.48/1.76 5644 inverse(sk_c2) = sk_c8 | multiply(sk_c4,sk_c7) = sk_c6. [back_rewrite(22),rewrite([5499(5)])].
% 1.48/1.76 5845 inverse(sk_c7) = sk_c6 | sk_c2 = sk_c8. [para(4909(a,1),526(a,1,1)),rewrite([4761(6)]),flip(b)].
% 1.48/1.76 5851 sk_c2 = sk_c8 | multiply(sk_c6,sk_c7) = sk_c8. [para(5845(a,1),4769(a,1,1))].
% 1.48/1.76 5853 sk_c2 = sk_c8 | sk_c6 != sk_c8. [para(5845(a,1),5195(a,1))].
% 1.48/1.76 5855 sk_c2 = sk_c8 | sk_c6 = sk_c4. [para(5845(a,1),4813(a,1)),merge(c)].
% 1.48/1.76 5942 sk_c2 = sk_c7 | inverse(sk_c7) = sk_c6. [para(4980(b,1),48(a,1,2)),rewrite([4762(7)])].
% 1.48/1.76 5950 sk_c2 = sk_c7 | sk_c6 != sk_c8. [para(5942(b,1),5195(a,1))].
% 1.48/1.76 6184 sk_c2 = sk_c7 | sk_c6 = sk_c8. [para(5584(b,1),4981(b,1)),merge(b)].
% 1.48/1.76 6247 sk_c2 = sk_c7. [resolve(6184,b,5950,b),merge(b)].
% 1.48/1.76 6340 sk_c6 = sk_c4. [back_rewrite(5855),rewrite([6247(1)]),unit_del(a,4744)].
% 1.48/1.76 6341 sk_c4 != sk_c8. [back_rewrite(5853),rewrite([6247(1),6340(4)]),unit_del(a,4744)].
% 1.48/1.76 6342 multiply(sk_c4,sk_c7) = sk_c8. [back_rewrite(5851),rewrite([6247(1),6340(4)]),unit_del(a,4744)].
% 1.48/1.76 6347 inverse(sk_c7) = sk_c4. [back_rewrite(5845),rewrite([6340(3),6247(5)]),unit_del(b,4744)].
% 1.48/1.76 6362 $F. [back_rewrite(5644),rewrite([6247(1),6347(2),6342(6),6340(5)]),flip(b),merge(b),unit_del(a,6341)].
% 1.48/1.76
% 1.48/1.76 % SZS output end Refutation
% 1.48/1.76 ============================== end of proof ==========================
% 1.48/1.76
% 1.48/1.76 ============================== STATISTICS ============================
% 1.48/1.76
% 1.48/1.76 Given=341. Generated=13798. Kept=6361. proofs=1.
% 1.48/1.76 Usable=109. Sos=675. Demods=28. Limbo=115, Disabled=5494. Hints=0.
% 1.48/1.76 Megabytes=5.88.
% 1.48/1.76 User_CPU=0.73, System_CPU=0.01, Wall_clock=1.
% 1.48/1.76
% 1.48/1.76 ============================== end of statistics =====================
% 1.48/1.76
% 1.48/1.76 ============================== end of search =========================
% 1.48/1.76
% 1.48/1.76 THEOREM PROVED
% 1.48/1.76 % SZS status Unsatisfiable
% 1.48/1.76
% 1.48/1.76 Exiting with 1 proof.
% 1.48/1.76
% 1.48/1.76 Process 18607 exit (max_proofs) Mon Jun 13 09:00:07 2022
% 1.48/1.76 Prover9 interrupted
%------------------------------------------------------------------------------