TSTP Solution File: GRP260-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP260-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:23 EDT 2022
% Result : Unsatisfiable 4.81s 5.15s
% Output : Refutation 4.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP260-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n029.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 : Tue Jun 14 03:03:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 4.81/5.15 ============================== Prover9 ===============================
% 4.81/5.15 Prover9 (32) version 2009-11A, November 2009.
% 4.81/5.15 Process 30301 was started by sandbox on n029.cluster.edu,
% 4.81/5.15 Tue Jun 14 03:03:41 2022
% 4.81/5.15 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_30148_n029.cluster.edu".
% 4.81/5.15 ============================== end of head ===========================
% 4.81/5.15
% 4.81/5.15 ============================== INPUT =================================
% 4.81/5.15
% 4.81/5.15 % Reading from file /tmp/Prover9_30148_n029.cluster.edu
% 4.81/5.15
% 4.81/5.15 set(prolog_style_variables).
% 4.81/5.15 set(auto2).
% 4.81/5.15 % set(auto2) -> set(auto).
% 4.81/5.15 % set(auto) -> set(auto_inference).
% 4.81/5.15 % set(auto) -> set(auto_setup).
% 4.81/5.15 % set(auto_setup) -> set(predicate_elim).
% 4.81/5.15 % set(auto_setup) -> assign(eq_defs, unfold).
% 4.81/5.15 % set(auto) -> set(auto_limits).
% 4.81/5.15 % set(auto_limits) -> assign(max_weight, "100.000").
% 4.81/5.15 % set(auto_limits) -> assign(sos_limit, 20000).
% 4.81/5.15 % set(auto) -> set(auto_denials).
% 4.81/5.15 % set(auto) -> set(auto_process).
% 4.81/5.15 % set(auto2) -> assign(new_constants, 1).
% 4.81/5.15 % set(auto2) -> assign(fold_denial_max, 3).
% 4.81/5.15 % set(auto2) -> assign(max_weight, "200.000").
% 4.81/5.15 % set(auto2) -> assign(max_hours, 1).
% 4.81/5.15 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 4.81/5.15 % set(auto2) -> assign(max_seconds, 0).
% 4.81/5.15 % set(auto2) -> assign(max_minutes, 5).
% 4.81/5.15 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 4.81/5.15 % set(auto2) -> set(sort_initial_sos).
% 4.81/5.15 % set(auto2) -> assign(sos_limit, -1).
% 4.81/5.15 % set(auto2) -> assign(lrs_ticks, 3000).
% 4.81/5.15 % set(auto2) -> assign(max_megs, 400).
% 4.81/5.15 % set(auto2) -> assign(stats, some).
% 4.81/5.15 % set(auto2) -> clear(echo_input).
% 4.81/5.15 % set(auto2) -> set(quiet).
% 4.81/5.15 % set(auto2) -> clear(print_initial_clauses).
% 4.81/5.15 % set(auto2) -> clear(print_given).
% 4.81/5.15 assign(lrs_ticks,-1).
% 4.81/5.15 assign(sos_limit,10000).
% 4.81/5.15 assign(order,kbo).
% 4.81/5.15 set(lex_order_vars).
% 4.81/5.15 clear(print_given).
% 4.81/5.15
% 4.81/5.15 % formulas(sos). % not echoed (54 formulas)
% 4.81/5.15
% 4.81/5.15 ============================== end of input ==========================
% 4.81/5.15
% 4.81/5.15 % From the command line: assign(max_seconds, 300).
% 4.81/5.15
% 4.81/5.15 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 4.81/5.15
% 4.81/5.15 % Formulas that are not ordinary clauses:
% 4.81/5.15
% 4.81/5.15 ============================== end of process non-clausal formulas ===
% 4.81/5.15
% 4.81/5.15 ============================== PROCESS INITIAL CLAUSES ===============
% 4.81/5.15
% 4.81/5.15 ============================== PREDICATE ELIMINATION =================
% 4.81/5.15
% 4.81/5.15 ============================== end predicate elimination =============
% 4.81/5.15
% 4.81/5.15 Auto_denials: (non-Horn, no changes).
% 4.81/5.15
% 4.81/5.15 Term ordering decisions:
% 4.81/5.15
% 4.81/5.15 % Assigning unary symbol inverse kb_weight 0 and highest precedence (15).
% 4.81/5.15 Function symbol KB weights: sk_c10=1. sk_c11=1. sk_c8=1. sk_c9=1. sk_c1=1. sk_c2=1. sk_c6=1. sk_c3=1. sk_c4=1. sk_c5=1. sk_c7=1. identity=1. multiply=1. inverse=0.
% 4.81/5.15
% 4.81/5.15 ============================== end of process initial clauses ========
% 4.81/5.15
% 4.81/5.15 ============================== CLAUSES FOR SEARCH ====================
% 4.81/5.15
% 4.81/5.15 ============================== end of clauses for search =============
% 4.81/5.15
% 4.81/5.15 ============================== SEARCH ================================
% 4.81/5.15
% 4.81/5.15 % Starting search at 0.08 seconds.
% 4.81/5.15
% 4.81/5.15 Low Water (keep): wt=45.000, iters=4356
% 4.81/5.15
% 4.81/5.15 Low Water (keep): wt=44.000, iters=3921
% 4.81/5.15
% 4.81/5.15 Low Water (keep): wt=43.000, iters=3421
% 4.81/5.15
% 4.81/5.15 Low Water (keep): wt=42.000, iters=3376
% 4.81/5.15
% 4.81/5.15 Low Water (keep): wt=41.000, iters=3342
% 4.81/5.15
% 4.81/5.15 Low Water (keep): wt=40.000, iters=3376
% 4.81/5.15
% 4.81/5.15 Low Water (keep): wt=39.000, iters=3696
% 4.81/5.15
% 4.81/5.15 Low Water (keep): wt=38.000, iters=3337
% 4.81/5.15
% 4.81/5.15 Low Water (keep): wt=37.000, iters=3343
% 4.81/5.15
% 4.81/5.15 Low Water (keep): wt=36.000, iters=3501
% 4.81/5.15
% 4.81/5.15 Low Water (keep): wt=35.000, iters=3348
% 4.81/5.15
% 4.81/5.15 Low Water (keep): wt=34.000, iters=3429
% 4.81/5.15
% 4.81/5.15 Low Water (keep): wt=33.000, iters=3397
% 4.81/5.15
% 4.81/5.15 Low Water (keep): wt=31.000, iters=3339
% 4.81/5.15
% 4.81/5.15 ============================== PROOF =================================
% 4.81/5.15 % SZS status Unsatisfiable
% 4.81/5.15 % SZS output start Refutation
% 4.81/5.15
% 4.81/5.15 % Proof 1 at 4.12 (+ 0.04) seconds.
% 4.81/5.15 % Length of proof is 86.
% 4.81/5.15 % Level of proof is 20.
% 4.81/5.15 % Maximum clause weight is 68.000.
% 4.81/5.15 % Given clauses 591.
% 4.81/5.15
% 4.81/5.15 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 4.81/5.15 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 4.81/5.15 3 inverse(sk_c1) = sk_c11 | inverse(sk_c3) = sk_c11 # label(prove_this_12) # label(negated_conjecture). [assumption].
% 4.81/5.15 9 inverse(sk_c2) = sk_c10 | inverse(sk_c4) = sk_c10 # label(prove_this_34) # label(negated_conjecture). [assumption].
% 4.81/5.15 10 inverse(sk_c2) = sk_c10 | inverse(sk_c5) = sk_c8 # label(prove_this_36) # label(negated_conjecture). [assumption].
% 4.81/5.15 13 multiply(sk_c1,sk_c11) = sk_c10 | inverse(sk_c3) = sk_c11 # label(prove_this_2) # label(negated_conjecture). [assumption].
% 4.81/5.15 18 inverse(sk_c1) = sk_c11 | multiply(sk_c3,sk_c11) = sk_c10 # label(prove_this_11) # label(negated_conjecture). [assumption].
% 4.81/5.15 24 multiply(sk_c2,sk_c10) = sk_c9 | inverse(sk_c4) = sk_c10 # label(prove_this_24) # label(negated_conjecture). [assumption].
% 4.81/5.15 25 multiply(sk_c2,sk_c10) = sk_c9 | inverse(sk_c5) = sk_c8 # label(prove_this_26) # label(negated_conjecture). [assumption].
% 4.81/5.15 29 inverse(sk_c2) = sk_c10 | multiply(sk_c4,sk_c10) = sk_c9 # label(prove_this_33) # label(negated_conjecture). [assumption].
% 4.81/5.15 31 inverse(sk_c2) = sk_c10 | multiply(sk_c8,sk_c10) = sk_c11 # label(prove_this_37) # label(negated_conjecture). [assumption].
% 4.81/5.15 35 multiply(sk_c9,sk_c11) = sk_c10 | inverse(sk_c5) = sk_c8 # label(prove_this_46) # label(negated_conjecture). [assumption].
% 4.81/5.15 38 multiply(sk_c1,sk_c11) = sk_c10 | multiply(sk_c3,sk_c11) = sk_c10 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 4.81/5.15 44 multiply(sk_c2,sk_c10) = sk_c9 | multiply(sk_c4,sk_c10) = sk_c9 # label(prove_this_23) # label(negated_conjecture). [assumption].
% 4.81/5.15 46 multiply(sk_c2,sk_c10) = sk_c9 | multiply(sk_c8,sk_c10) = sk_c11 # label(prove_this_27) # label(negated_conjecture). [assumption].
% 4.81/5.15 50 multiply(sk_c9,sk_c11) = sk_c10 | multiply(sk_c5,sk_c8) = sk_c11 # label(prove_this_45) # label(negated_conjecture). [assumption].
% 4.81/5.15 51 multiply(sk_c9,sk_c11) = sk_c10 | multiply(sk_c8,sk_c10) = sk_c11 # label(prove_this_47) # label(negated_conjecture). [assumption].
% 4.81/5.15 53 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 4.81/5.15 54 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | multiply(B,sk_c10) != sk_c9 | inverse(B) != sk_c10 | multiply(sk_c9,sk_c11) != sk_c10 | multiply(C,sk_c11) != sk_c10 | inverse(C) != sk_c11 | multiply(D,sk_c10) != sk_c9 | inverse(D) != sk_c10 | multiply(E,F) != sk_c11 | inverse(E) != F | multiply(F,sk_c10) != sk_c11 | inverse(V6) != V7 | inverse(V7) != F | multiply(V6,F) != V7 # label(prove_this_51) # label(negated_conjecture). [assumption].
% 4.81/5.15 56 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | multiply(B,sk_c10) != sk_c9 | inverse(B) != sk_c10 | multiply(sk_c9,sk_c11) != sk_c10 | multiply(C,sk_c10) != sk_c9 | inverse(C) != sk_c10 | multiply(D,E) != sk_c11 | inverse(D) != E | multiply(E,sk_c10) != sk_c11 | inverse(F) != V6 | inverse(V6) != E | multiply(F,E) != V6. [factor(54,a,f),merge(f)].
% 4.81/5.15 64 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | multiply(B,sk_c10) != sk_c9 | inverse(B) != sk_c10 | multiply(sk_c9,sk_c11) != sk_c10 | multiply(C,D) != sk_c11 | inverse(C) != D | multiply(D,sk_c10) != sk_c11 | inverse(E) != F | inverse(F) != D | multiply(E,D) != F. [factor(56,c,f),merge(f)].
% 4.81/5.15 236 inverse(sk_c2) = sk_c10 | multiply(sk_c10,sk_c4) = identity. [para(9(b,1),2(a,1,1))].
% 4.81/5.15 237 inverse(sk_c2) = sk_c10 | multiply(sk_c8,sk_c5) = identity. [para(10(b,1),2(a,1,1))].
% 4.81/5.15 240 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),53(a,1,1)),rewrite([1(2)]),flip(a)].
% 4.81/5.15 263 inverse(sk_c4) = sk_c10 | multiply(sk_c2,multiply(sk_c10,A)) = multiply(sk_c9,A). [para(24(a,1),53(a,1,1)),flip(b)].
% 4.81/5.15 265 inverse(sk_c5) = sk_c8 | multiply(sk_c2,multiply(sk_c10,A)) = multiply(sk_c9,A). [para(25(a,1),53(a,1,1)),flip(b)].
% 4.81/5.15 315 multiply(sk_c9,sk_c11) = sk_c10 | multiply(sk_c5,multiply(sk_c8,A)) = multiply(sk_c11,A). [para(50(b,1),53(a,1,1)),flip(b)].
% 4.81/5.15 6489 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),240(a,1,2))].
% 4.81/5.15 6537 multiply(sk_c8,sk_c10) = sk_c11 | multiply(inverse(sk_c9),sk_c10) = sk_c11. [para(51(a,1),240(a,1,2))].
% 4.81/5.15 6566 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(240(a,1),240(a,1,2))].
% 4.81/5.15 6615 multiply(A,identity) = A. [back_rewrite(6489),rewrite([6566(4)])].
% 4.81/5.15 6691 inverse(identity) = identity. [para(6615(a,1),2(a,1))].
% 4.81/5.15 7211 inverse(sk_c2) = sk_c10 | inverse(sk_c10) = sk_c4. [para(236(b,1),240(a,1,2)),rewrite([6615(8)])].
% 4.81/5.15 7215 inverse(sk_c2) = sk_c10 | inverse(sk_c8) = sk_c5. [para(237(b,1),240(a,1,2)),rewrite([6615(8)])].
% 4.81/5.15 7230 inverse(sk_c10) = sk_c4 | multiply(sk_c10,sk_c2) = identity. [para(7211(a,1),2(a,1,1))].
% 4.81/5.15 7495 multiply(A,inverse(A)) = identity. [para(6566(a,1),2(a,1))].
% 4.81/5.15 7509 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | multiply(B,sk_c10) != sk_c9 | inverse(B) != sk_c10 | multiply(sk_c9,sk_c11) != sk_c10 | multiply(C,inverse(inverse(D))) != sk_c11 | inverse(inverse(D)) != inverse(C) | multiply(D,sk_c10) != sk_c11 | inverse(E) != F | inverse(inverse(D)) != inverse(F) | multiply(E,inverse(inverse(D))) != F. [para(6566(a,1),64(h,1)),flip(g),flip(j)].
% 4.81/5.15 7771 inverse(inverse(A)) = A. [para(6566(a,1),6615(a,1)),rewrite([6615(2)]),flip(a)].
% 4.81/5.15 7792 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | multiply(B,sk_c10) != sk_c9 | inverse(B) != sk_c10 | multiply(sk_c9,sk_c11) != sk_c10 | multiply(C,D) != sk_c11 | inverse(C) != D | multiply(D,sk_c10) != sk_c11 | D != C | inverse(C) != identity. [factor(7509,g,i),rewrite([7771(21),7771(24),7771(30),7771(30),7771(32),2(31)]),flip(g),flip(j)].
% 4.81/5.15 8186 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | multiply(B,sk_c10) != sk_c9 | inverse(B) != sk_c10 | multiply(sk_c9,sk_c11) != sk_c10 | multiply(sk_c10,multiply(sk_c9,sk_c11)) != sk_c11 | multiply(sk_c9,sk_c11) != inverse(sk_c10) | multiply(sk_c9,multiply(sk_c11,sk_c10)) != sk_c11 | inverse(sk_c10) != identity. [factor(7792,e,i),rewrite([53(37)]),flip(g)].
% 4.81/5.15 8328 inverse(sk_c8) = sk_c5 | inverse(sk_c10) = sk_c2. [para(7215(a,1),7771(a,1,1))].
% 4.81/5.15 8364 inverse(sk_c1) = sk_c11 | multiply(sk_c3,sk_c11) = identity. [para(3(b,1),7495(a,1,2))].
% 4.81/5.15 8579 inverse(sk_c10) = sk_c2 | inverse(sk_c5) = sk_c8. [para(8328(a,1),7771(a,1,1))].
% 4.81/5.15 9089 inverse(sk_c1) = sk_c11 | identity = sk_c10. [para(8364(b,1),18(b,1)),merge(b)].
% 4.81/5.15 9097 identity = sk_c10 | multiply(sk_c1,sk_c11) = identity. [para(9089(a,1),7495(a,1,2))].
% 4.81/5.15 9179 identity = sk_c10 | inverse(sk_c3) = sk_c11. [para(9097(b,1),13(a,1)),merge(b)].
% 4.81/5.15 9192 identity = sk_c10 | multiply(sk_c3,sk_c11) = identity. [para(9179(b,1),7495(a,1,2))].
% 4.81/5.15 10162 identity = sk_c10 | multiply(sk_c1,sk_c11) = sk_c10. [para(9192(b,1),38(b,1)),merge(c)].
% 4.81/5.15 10846 inverse(sk_c4) = sk_c10 | multiply(sk_c9,inverse(sk_c10)) = sk_c2. [para(7495(a,1),263(b,1,2)),rewrite([6615(7)]),flip(b)].
% 4.81/5.15 11502 inverse(sk_c5) = sk_c8 | multiply(sk_c2,multiply(sk_c10,sk_c11)) = sk_c10. [para(35(a,1),265(b,2)),merge(b)].
% 4.81/5.15 12413 identity = sk_c10. [para(10162(b,1),9097(b,1)),flip(c),merge(b),merge(c)].
% 4.81/5.15 14197 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | multiply(B,sk_c10) != sk_c9 | inverse(B) != sk_c10 | multiply(sk_c9,sk_c11) != sk_c10 | multiply(sk_c10,multiply(sk_c9,sk_c11)) != sk_c11 | multiply(sk_c9,sk_c11) != inverse(sk_c10) | multiply(sk_c9,multiply(sk_c11,sk_c10)) != sk_c11 | inverse(sk_c10) != sk_c10. [back_rewrite(8186),rewrite([12413(42)])].
% 4.81/5.15 14344 multiply(A,inverse(A)) = sk_c10. [back_rewrite(7495),rewrite([12413(3)])].
% 4.81/5.15 14354 inverse(sk_c10) = sk_c4 | multiply(sk_c10,sk_c2) = sk_c10. [back_rewrite(7230),rewrite([12413(8)])].
% 4.81/5.15 14416 inverse(sk_c10) = sk_c10. [back_rewrite(6691),rewrite([12413(1),12413(3)])].
% 4.81/5.15 14417 multiply(A,sk_c10) = A. [back_rewrite(6615),rewrite([12413(1)])].
% 4.81/5.15 14442 multiply(inverse(A),A) = sk_c10. [back_rewrite(2),rewrite([12413(3)])].
% 4.81/5.15 14443 multiply(sk_c10,A) = A. [back_rewrite(1),rewrite([12413(1)])].
% 4.81/5.15 14485 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | sk_c9 != sk_c10 | multiply(sk_c9,sk_c11) != sk_c10 | multiply(sk_c9,sk_c11) != sk_c11. [factor(14197,d,i),rewrite([14417(10),14416(12),14443(23),14416(28),14417(32)]),flip(c),xx(d),merge(f),merge(g)].
% 4.81/5.15 14599 sk_c4 = sk_c10 | sk_c2 = sk_c10. [back_rewrite(14354),rewrite([14416(2),14443(6)]),flip(a)].
% 4.81/5.15 14795 inverse(sk_c4) = sk_c10 | sk_c2 = sk_c9. [back_rewrite(10846),rewrite([14416(7),14417(7)]),flip(b)].
% 4.81/5.15 14812 sk_c2 = sk_c10 | inverse(sk_c5) = sk_c8. [back_rewrite(8579),rewrite([14416(2)]),flip(a)].
% 4.81/5.16 15589 sk_c8 = sk_c11 | inverse(sk_c9) = sk_c11. [back_rewrite(6537),rewrite([14417(3),14417(7)])].
% 4.81/5.16 16947 multiply(sk_c9,sk_c11) = sk_c10 | sk_c8 = sk_c11. [back_rewrite(51),rewrite([14417(8)])].
% 4.81/5.16 16950 sk_c2 = sk_c9 | sk_c8 = sk_c11. [back_rewrite(46),rewrite([14417(3),14417(6)])].
% 4.81/5.16 16952 sk_c2 = sk_c9 | sk_c4 = sk_c9. [back_rewrite(44),rewrite([14417(3),14417(6)])].
% 4.81/5.16 16956 inverse(sk_c2) = sk_c10 | sk_c8 = sk_c11. [back_rewrite(31),rewrite([14417(7)])].
% 4.81/5.16 16957 inverse(sk_c2) = sk_c10 | sk_c4 = sk_c9. [back_rewrite(29),rewrite([14417(7)])].
% 4.81/5.16 16981 inverse(sk_c5) = sk_c8 | multiply(sk_c2,sk_c11) = sk_c10. [back_rewrite(11502),rewrite([14443(8)])].
% 4.81/5.16 17604 sk_c2 = sk_c9 | sk_c4 = sk_c10. [para(14795(a,1),7771(a,1,1)),rewrite([14416(5)]),flip(b)].
% 4.81/5.16 17607 sk_c2 = sk_c9 | sk_c9 = sk_c10. [para(17604(b,1),16952(b,1)),flip(c),merge(b)].
% 4.81/5.16 17848 sk_c9 != sk_c10 | multiply(sk_c9,sk_c11) != sk_c10 | multiply(sk_c9,sk_c11) != sk_c11. [resolve(14485,a,14442,a),rewrite([7771(3)]),xx(a)].
% 4.81/5.16 18046 sk_c8 = sk_c11 | sk_c2 = sk_c10. [para(16956(a,1),7771(a,1,1)),rewrite([14416(5)]),flip(b)].
% 4.81/5.16 18048 sk_c8 = sk_c11 | sk_c9 = sk_c10. [para(18046(b,1),16950(a,1)),flip(b),merge(c)].
% 4.81/5.16 18213 sk_c8 = sk_c11 | sk_c11 = sk_c10. [para(18048(b,1),15589(b,1,1)),rewrite([14416(8)]),flip(c),merge(b)].
% 4.81/5.16 18243 sk_c11 = sk_c10 | sk_c2 = sk_c10 | inverse(sk_c5) = sk_c11. [para(18213(a,1),14812(b,2))].
% 4.81/5.16 18254 sk_c4 = sk_c9 | sk_c2 = sk_c10. [para(16957(a,1),7771(a,1,1)),rewrite([14416(5)]),flip(b)].
% 4.81/5.16 18264 sk_c2 = sk_c10 | sk_c9 = sk_c10. [para(18254(a,1),14599(a,1)),merge(c)].
% 4.81/5.16 18279 multiply(sk_c9,sk_c11) = sk_c10 | multiply(sk_c11,inverse(sk_c8)) = sk_c5. [para(14344(a,1),315(b,1,2)),rewrite([14417(8)]),flip(b)].
% 4.81/5.16 18360 sk_c9 = sk_c10. [para(18264(a,1),17607(a,1)),flip(b),merge(b),merge(c)].
% 4.81/5.16 18403 sk_c11 = sk_c10 | multiply(sk_c11,inverse(sk_c8)) = sk_c5. [back_rewrite(18279),rewrite([18360(1),14443(3)])].
% 4.81/5.16 18597 sk_c11 != sk_c10. [back_rewrite(17848),rewrite([18360(1),18360(4),14443(6),18360(7),14443(9)]),xx(a),xx(c)].
% 4.81/5.16 18639 sk_c8 = sk_c11. [back_rewrite(16947),rewrite([18360(1),14443(3)]),unit_del(a,18597)].
% 4.81/5.16 18739 sk_c5 = sk_c10. [back_unit_del(18403),rewrite([18639(5),14344(7)]),flip(b),unit_del(a,18597)].
% 4.81/5.16 18742 sk_c2 = sk_c10. [back_unit_del(18243),rewrite([18739(7),14416(8)]),flip(c),merge(c),unit_del(a,18597)].
% 4.81/5.16 18761 $F. [back_rewrite(16981),rewrite([18739(1),14416(2),18639(2),18742(4),14443(6)]),flip(a),merge(b),unit_del(a,18597)].
% 4.81/5.16
% 4.81/5.16 % SZS output end Refutation
% 4.81/5.16 ============================== end of proof ==========================
% 4.81/5.16
% 4.81/5.16 ============================== STATISTICS ============================
% 4.81/5.16
% 4.81/5.16 Given=591. Generated=72193. Kept=18760. proofs=1.
% 4.81/5.16 Usable=85. Sos=299. Demods=40. Limbo=122, Disabled=18308. Hints=0.
% 4.81/5.16 Megabytes=21.80.
% 4.81/5.16 User_CPU=4.12, System_CPU=0.04, Wall_clock=4.
% 4.81/5.16
% 4.81/5.16 ============================== end of statistics =====================
% 4.81/5.16
% 4.81/5.16 ============================== end of search =========================
% 4.81/5.16
% 4.81/5.16 THEOREM PROVED
% 4.81/5.16 % SZS status Unsatisfiable
% 4.81/5.16
% 4.81/5.16 Exiting with 1 proof.
% 4.81/5.16
% 4.81/5.16 Process 30301 exit (max_proofs) Tue Jun 14 03:03:45 2022
% 4.81/5.16 Prover9 interrupted
%------------------------------------------------------------------------------