TSTP Solution File: GRP246-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP246-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:19 EDT 2022
% Result : Unsatisfiable 2.82s 3.14s
% Output : Refutation 2.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP246-1 : TPTP v8.1.0. Released v2.5.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n008.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 06:07:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.82/3.14 ============================== Prover9 ===============================
% 2.82/3.14 Prover9 (32) version 2009-11A, November 2009.
% 2.82/3.14 Process 11350 was started by sandbox on n008.cluster.edu,
% 2.82/3.14 Mon Jun 13 06:07:23 2022
% 2.82/3.14 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_11197_n008.cluster.edu".
% 2.82/3.14 ============================== end of head ===========================
% 2.82/3.14
% 2.82/3.14 ============================== INPUT =================================
% 2.82/3.14
% 2.82/3.14 % Reading from file /tmp/Prover9_11197_n008.cluster.edu
% 2.82/3.14
% 2.82/3.14 set(prolog_style_variables).
% 2.82/3.14 set(auto2).
% 2.82/3.14 % set(auto2) -> set(auto).
% 2.82/3.14 % set(auto) -> set(auto_inference).
% 2.82/3.14 % set(auto) -> set(auto_setup).
% 2.82/3.14 % set(auto_setup) -> set(predicate_elim).
% 2.82/3.14 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.82/3.14 % set(auto) -> set(auto_limits).
% 2.82/3.14 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.82/3.14 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.82/3.14 % set(auto) -> set(auto_denials).
% 2.82/3.14 % set(auto) -> set(auto_process).
% 2.82/3.14 % set(auto2) -> assign(new_constants, 1).
% 2.82/3.14 % set(auto2) -> assign(fold_denial_max, 3).
% 2.82/3.14 % set(auto2) -> assign(max_weight, "200.000").
% 2.82/3.14 % set(auto2) -> assign(max_hours, 1).
% 2.82/3.14 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.82/3.14 % set(auto2) -> assign(max_seconds, 0).
% 2.82/3.14 % set(auto2) -> assign(max_minutes, 5).
% 2.82/3.14 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.82/3.14 % set(auto2) -> set(sort_initial_sos).
% 2.82/3.14 % set(auto2) -> assign(sos_limit, -1).
% 2.82/3.14 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.82/3.14 % set(auto2) -> assign(max_megs, 400).
% 2.82/3.14 % set(auto2) -> assign(stats, some).
% 2.82/3.14 % set(auto2) -> clear(echo_input).
% 2.82/3.14 % set(auto2) -> set(quiet).
% 2.82/3.14 % set(auto2) -> clear(print_initial_clauses).
% 2.82/3.14 % set(auto2) -> clear(print_given).
% 2.82/3.14 assign(lrs_ticks,-1).
% 2.82/3.14 assign(sos_limit,10000).
% 2.82/3.14 assign(order,kbo).
% 2.82/3.14 set(lex_order_vars).
% 2.82/3.14 clear(print_given).
% 2.82/3.14
% 2.82/3.14 % formulas(sos). % not echoed (58 formulas)
% 2.82/3.14
% 2.82/3.14 ============================== end of input ==========================
% 2.82/3.14
% 2.82/3.14 % From the command line: assign(max_seconds, 300).
% 2.82/3.14
% 2.82/3.14 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.82/3.14
% 2.82/3.14 % Formulas that are not ordinary clauses:
% 2.82/3.14
% 2.82/3.14 ============================== end of process non-clausal formulas ===
% 2.82/3.14
% 2.82/3.14 ============================== PROCESS INITIAL CLAUSES ===============
% 2.82/3.14
% 2.82/3.14 ============================== PREDICATE ELIMINATION =================
% 2.82/3.14
% 2.82/3.14 ============================== end predicate elimination =============
% 2.82/3.14
% 2.82/3.14 Auto_denials: (non-Horn, no changes).
% 2.82/3.14
% 2.82/3.14 Term ordering decisions:
% 2.82/3.14
% 2.82/3.14 % Assigning unary symbol inverse kb_weight 0 and highest precedence (15).
% 2.82/3.14 Function symbol KB weights: sk_c10=1. sk_c11=1. sk_c9=1. sk_c1=1. sk_c2=1. sk_c3=1. sk_c8=1. sk_c4=1. sk_c5=1. sk_c6=1. sk_c7=1. identity=1. multiply=1. inverse=0.
% 2.82/3.14
% 2.82/3.14 ============================== end of process initial clauses ========
% 2.82/3.14
% 2.82/3.14 ============================== CLAUSES FOR SEARCH ====================
% 2.82/3.14
% 2.82/3.14 ============================== end of clauses for search =============
% 2.82/3.14
% 2.82/3.14 ============================== SEARCH ================================
% 2.82/3.14
% 2.82/3.14 % Starting search at 0.03 seconds.
% 2.82/3.14
% 2.82/3.14 Low Water (keep): wt=58.000, iters=3625
% 2.82/3.14
% 2.82/3.14 Low Water (keep): wt=54.000, iters=3610
% 2.82/3.14
% 2.82/3.14 Low Water (keep): wt=50.000, iters=3499
% 2.82/3.14
% 2.82/3.14 Low Water (keep): wt=40.000, iters=3477
% 2.82/3.14
% 2.82/3.14 Low Water (keep): wt=37.000, iters=3360
% 2.82/3.14
% 2.82/3.14 Low Water (keep): wt=36.000, iters=3384
% 2.82/3.14
% 2.82/3.14 Low Water (keep): wt=34.000, iters=3447
% 2.82/3.14
% 2.82/3.14 Low Water (keep): wt=33.000, iters=3378
% 2.82/3.14
% 2.82/3.14 Low Water (keep): wt=32.000, iters=3426
% 2.82/3.14
% 2.82/3.14 Low Water (keep): wt=31.000, iters=3359
% 2.82/3.14
% 2.82/3.14 Low Water (keep): wt=30.000, iters=3351
% 2.82/3.14
% 2.82/3.14 ============================== PROOF =================================
% 2.82/3.14 % SZS status Unsatisfiable
% 2.82/3.14 % SZS output start Refutation
% 2.82/3.14
% 2.82/3.14 % Proof 1 at 2.16 (+ 0.03) seconds.
% 2.82/3.14 % Length of proof is 90.
% 2.82/3.14 % Level of proof is 22.
% 2.82/3.14 % Maximum clause weight is 68.000.
% 2.82/3.14 % Given clauses 499.
% 2.82/3.14
% 2.82/3.14 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 2.82/3.14 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 2.82/3.14 6 inverse(sk_c1) = sk_c11 | inverse(sk_c7) = sk_c8 # label(prove_this_17) # label(negated_conjecture). [assumption].
% 2.82/3.14 8 inverse(sk_c2) = sk_c10 | inverse(sk_c5) = sk_c10 # label(prove_this_31) # label(negated_conjecture). [assumption].
% 2.82/3.14 11 inverse(sk_c3) = sk_c11 | inverse(sk_c4) = sk_c11 # label(prove_this_38) # label(negated_conjecture). [assumption].
% 2.82/3.14 13 inverse(sk_c3) = sk_c11 | inverse(sk_c6) = sk_c11 # label(prove_this_41) # label(negated_conjecture). [assumption].
% 2.82/3.14 15 multiply(sk_c1,sk_c11) = sk_c10 | inverse(sk_c4) = sk_c11 # label(prove_this_2) # label(negated_conjecture). [assumption].
% 2.82/3.14 22 inverse(sk_c1) = sk_c11 | multiply(sk_c7,sk_c8) = sk_c10 # label(prove_this_16) # label(negated_conjecture). [assumption].
% 2.82/3.14 25 multiply(sk_c2,sk_c10) = sk_c9 | inverse(sk_c5) = sk_c10 # label(prove_this_22) # label(negated_conjecture). [assumption].
% 2.82/3.14 29 inverse(sk_c2) = sk_c10 | multiply(sk_c5,sk_c10) = sk_c9 # label(prove_this_30) # label(negated_conjecture). [assumption].
% 2.82/3.14 35 inverse(sk_c3) = sk_c11 | multiply(sk_c6,sk_c10) = sk_c11 # label(prove_this_42) # label(negated_conjecture). [assumption].
% 2.82/3.14 40 multiply(sk_c3,sk_c9) = sk_c11 | inverse(sk_c6) = sk_c11 # label(prove_this_50) # label(negated_conjecture). [assumption].
% 2.82/3.14 42 multiply(sk_c1,sk_c11) = sk_c10 | multiply(sk_c4,sk_c11) = sk_c10 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 2.82/3.14 48 multiply(sk_c2,sk_c10) = sk_c9 | multiply(sk_c5,sk_c10) = sk_c9 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 2.82/3.14 54 multiply(sk_c3,sk_c9) = sk_c11 | multiply(sk_c6,sk_c10) = sk_c11 # label(prove_this_51) # label(negated_conjecture). [assumption].
% 2.82/3.14 57 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 2.82/3.14 58 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | multiply(B,sk_c10) != sk_c9 | inverse(B) != sk_c10 | inverse(C) != sk_c11 | multiply(C,sk_c9) != sk_c11 | multiply(D,sk_c11) != sk_c10 | inverse(D) != sk_c11 | multiply(E,sk_c10) != sk_c9 | inverse(E) != sk_c10 | inverse(F) != sk_c11 | multiply(F,sk_c10) != sk_c11 | multiply(V6,V7) != sk_c10 | inverse(V6) != V7 | multiply(V7,sk_c9) != sk_c10 # label(prove_this_55) # label(negated_conjecture). [assumption].
% 2.82/3.14 59 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | multiply(B,sk_c10) != sk_c9 | inverse(B) != sk_c10 | inverse(C) != sk_c11 | multiply(C,sk_c9) != sk_c11 | multiply(D,sk_c10) != sk_c9 | inverse(D) != sk_c10 | inverse(E) != sk_c11 | multiply(E,sk_c10) != sk_c11 | multiply(F,V6) != sk_c10 | inverse(F) != V6 | multiply(V6,sk_c9) != sk_c10. [factor(58,a,g),merge(g)].
% 2.82/3.14 64 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | multiply(B,sk_c10) != sk_c9 | inverse(B) != sk_c10 | inverse(C) != sk_c11 | multiply(C,sk_c9) != sk_c11 | inverse(D) != sk_c11 | multiply(D,sk_c10) != sk_c11 | multiply(E,F) != sk_c10 | inverse(E) != F | multiply(F,sk_c9) != sk_c10. [factor(59,c,g),merge(g)].
% 2.82/3.14 93 inverse(sk_c1) = sk_c11 | multiply(sk_c8,sk_c7) = identity. [para(6(b,1),2(a,1,1))].
% 2.82/3.14 95 inverse(sk_c2) = sk_c10 | multiply(sk_c10,sk_c5) = identity. [para(8(b,1),2(a,1,1))].
% 2.82/3.14 98 inverse(sk_c3) = sk_c11 | multiply(sk_c11,sk_c4) = identity. [para(11(b,1),2(a,1,1))].
% 2.82/3.14 100 inverse(sk_c3) = sk_c11 | multiply(sk_c11,sk_c6) = identity. [para(13(b,1),2(a,1,1))].
% 2.82/3.14 102 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),57(a,1,1)),rewrite([1(2)]),flip(a)].
% 2.82/3.14 123 inverse(sk_c5) = sk_c10 | multiply(sk_c2,multiply(sk_c10,A)) = multiply(sk_c9,A). [para(25(a,1),57(a,1,1)),flip(b)].
% 2.82/3.14 153 inverse(sk_c6) = sk_c11 | multiply(sk_c3,multiply(sk_c9,A)) = multiply(sk_c11,A). [para(40(a,1),57(a,1,1)),flip(b)].
% 2.82/3.14 242 identity != sk_c10 | inverse(inverse(sk_c11)) != sk_c11 | multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | inverse(B) != sk_c11 | multiply(B,sk_c9) != sk_c11 | inverse(C) != sk_c11 | multiply(C,sk_c10) != sk_c11 | multiply(D,E) != sk_c10 | inverse(D) != E | multiply(E,sk_c9) != sk_c10. [para(2(a,1),64(a,1))].
% 2.82/3.14 548 identity != sk_c10 | inverse(inverse(sk_c11)) != sk_c11 | multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | inverse(B) != sk_c11 | multiply(B,sk_c9) != sk_c11 | multiply(inverse(sk_c11),sk_c10) != sk_c11 | multiply(C,D) != sk_c10 | inverse(C) != D | multiply(D,sk_c9) != sk_c10. [factor(242,b,g)].
% 2.82/3.14 1795 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),102(a,1,2))].
% 2.82/3.14 1856 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(102(a,1),102(a,1,2))].
% 2.82/3.14 1857 multiply(A,identity) = A. [back_rewrite(1795),rewrite([1856(4)])].
% 2.82/3.14 1870 inverse(identity) = identity. [para(1857(a,1),2(a,1))].
% 2.82/3.14 1981 inverse(sk_c1) = sk_c11 | inverse(sk_c8) = sk_c7. [para(93(b,1),102(a,1,2)),rewrite([1857(8)])].
% 2.82/3.14 2011 inverse(sk_c1) = sk_c11 | multiply(sk_c7,sk_c8) = identity. [para(1981(b,1),2(a,1,1))].
% 2.82/3.14 2021 inverse(sk_c2) = sk_c10 | inverse(sk_c10) = sk_c5. [para(95(b,1),102(a,1,2)),rewrite([1857(8)])].
% 2.82/3.14 2022 inverse(sk_c10) = sk_c5 | multiply(sk_c10,sk_c2) = identity. [para(2021(a,1),2(a,1,1))].
% 2.82/3.14 2084 inverse(sk_c3) = sk_c11 | inverse(sk_c11) = sk_c4. [para(98(b,1),102(a,1,2)),rewrite([1857(8)])].
% 2.82/3.14 2107 inverse(sk_c3) = sk_c11 | inverse(sk_c11) = sk_c6. [para(100(b,1),102(a,1,2)),rewrite([1857(8)])].
% 2.82/3.14 2158 multiply(A,inverse(A)) = identity. [para(1856(a,1),2(a,1))].
% 2.82/3.14 2242 inverse(inverse(A)) = A. [para(1856(a,1),1857(a,1)),rewrite([1857(2)]),flip(a)].
% 2.82/3.14 2329 identity != sk_c10 | multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | inverse(B) != sk_c11 | multiply(B,sk_c9) != sk_c11 | multiply(inverse(sk_c11),sk_c10) != sk_c11 | multiply(C,D) != sk_c10 | inverse(C) != D | multiply(D,sk_c9) != sk_c10. [back_rewrite(548),rewrite([2242(6)]),xx(b)].
% 2.82/3.14 2333 identity != sk_c10 | multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | inverse(B) != sk_c11 | multiply(B,sk_c9) != sk_c11 | inverse(C) != sk_c11 | multiply(C,sk_c10) != sk_c11 | multiply(D,E) != sk_c10 | inverse(D) != E | multiply(E,sk_c9) != sk_c10. [back_rewrite(242),rewrite([2242(6)]),xx(b)].
% 2.82/3.14 3583 inverse(sk_c1) = sk_c11 | identity = sk_c10. [para(2011(b,1),22(b,1)),merge(b)].
% 2.82/3.14 3594 identity = sk_c10 | multiply(sk_c1,sk_c11) = identity. [para(3583(a,1),2158(a,1,2))].
% 2.82/3.14 3692 identity = sk_c10 | inverse(sk_c4) = sk_c11. [para(3594(b,1),15(a,1)),merge(b)].
% 2.82/3.14 3703 identity = sk_c10 | multiply(sk_c4,sk_c11) = identity. [para(3692(b,1),2158(a,1,2))].
% 2.82/3.14 4796 identity = sk_c10 | multiply(sk_c1,sk_c11) = sk_c10. [para(3703(b,1),42(b,1)),merge(c)].
% 2.82/3.14 5358 inverse(sk_c5) = sk_c10 | multiply(sk_c9,inverse(sk_c10)) = sk_c2. [para(2158(a,1),123(b,1,2)),rewrite([1857(7)]),flip(b)].
% 2.82/3.14 7300 identity = sk_c10. [para(4796(b,1),3594(b,1)),flip(c),merge(b),merge(c)].
% 2.82/3.14 9639 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | inverse(B) != sk_c11 | multiply(B,sk_c9) != sk_c11 | inverse(C) != sk_c11 | multiply(C,sk_c10) != sk_c11 | multiply(D,E) != sk_c10 | inverse(D) != E | multiply(E,sk_c9) != sk_c10. [back_rewrite(2333),rewrite([7300(1)]),xx(a)].
% 2.82/3.14 9643 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | inverse(B) != sk_c11 | multiply(B,sk_c9) != sk_c11 | multiply(inverse(sk_c11),sk_c10) != sk_c11 | multiply(C,D) != sk_c10 | inverse(C) != D | multiply(D,sk_c9) != sk_c10. [back_rewrite(2329),rewrite([7300(1)]),xx(a)].
% 2.82/3.14 9691 multiply(A,inverse(A)) = sk_c10. [back_rewrite(2158),rewrite([7300(3)])].
% 2.82/3.14 9718 inverse(sk_c10) = sk_c5 | multiply(sk_c10,sk_c2) = sk_c10. [back_rewrite(2022),rewrite([7300(8)])].
% 2.82/3.14 9727 inverse(sk_c10) = sk_c10. [back_rewrite(1870),rewrite([7300(1),7300(3)])].
% 2.82/3.14 9733 multiply(A,sk_c10) = A. [back_rewrite(1857),rewrite([7300(1)])].
% 2.82/3.14 9751 multiply(inverse(A),A) = sk_c10. [back_rewrite(2),rewrite([7300(3)])].
% 2.82/3.14 9752 multiply(sk_c10,A) = A. [back_rewrite(1),rewrite([7300(1)])].
% 2.82/3.14 9827 sk_c9 != A | inverse(A) != sk_c10 | inverse(B) != sk_c11 | multiply(B,sk_c9) != sk_c11 | inverse(C) != sk_c11 | sk_c11 != C | sk_c10 != A | sk_c9 != sk_c10. [factor(9639,b,h),rewrite([9733(2),9733(17),9733(19),9752(22)]),flip(a),flip(f),flip(g)].
% 2.82/3.14 9843 sk_c9 != A | inverse(A) != sk_c10 | inverse(B) != sk_c11 | multiply(B,sk_c9) != sk_c11 | inverse(sk_c11) != sk_c11 | sk_c10 != A | sk_c9 != sk_c10. [factor(9643,b,g),rewrite([9733(2),9733(16),9733(18),9752(21)]),flip(a),flip(f)].
% 2.82/3.14 9872 sk_c5 = sk_c10 | sk_c2 = sk_c10. [back_rewrite(9718),rewrite([9727(2),9752(6)]),flip(a)].
% 2.82/3.14 10009 inverse(sk_c5) = sk_c10 | sk_c2 = sk_c9. [back_rewrite(5358),rewrite([9727(7),9733(7)]),flip(b)].
% 2.82/3.14 11638 multiply(sk_c3,sk_c9) = sk_c11 | sk_c6 = sk_c11. [back_rewrite(54),rewrite([9733(8)])].
% 2.82/3.14 11643 sk_c2 = sk_c9 | sk_c5 = sk_c9. [back_rewrite(48),rewrite([9733(3),9733(6)])].
% 2.82/3.14 11647 inverse(sk_c3) = sk_c11 | sk_c6 = sk_c11. [back_rewrite(35),rewrite([9733(7)])].
% 2.82/3.14 11650 inverse(sk_c2) = sk_c10 | sk_c5 = sk_c9. [back_rewrite(29),rewrite([9733(7)])].
% 2.82/3.14 11934 sk_c9 != sk_c10 | inverse(A) != sk_c11 | multiply(A,sk_c9) != sk_c11 | inverse(B) != sk_c11 | sk_c11 != B. [factor(9827,a,h),rewrite([9727(5)]),xx(b),xx(g)].
% 2.82/3.14 11936 sk_c9 != sk_c10 | inverse(A) != sk_c11 | multiply(A,sk_c9) != sk_c11 | inverse(sk_c11) != sk_c11. [factor(9843,a,g),rewrite([9727(5)]),xx(b),xx(f)].
% 2.82/3.14 12268 sk_c9 != sk_c10 | inverse(sk_c11) != sk_c11 | multiply(sk_c11,sk_c9) != sk_c11. [factor(11936,b,d)].
% 2.82/3.14 12453 sk_c2 = sk_c9 | sk_c5 = sk_c10. [para(10009(a,1),2242(a,1,1)),rewrite([9727(5)]),flip(b)].
% 2.82/3.14 12509 sk_c9 != sk_c10 | inverse(multiply(A,B)) != sk_c11 | multiply(A,multiply(B,sk_c9)) != sk_c11 | inverse(C) != sk_c11 | sk_c11 != C. [para(57(a,1),11934(c,1))].
% 2.82/3.14 12539 sk_c2 = sk_c9 | sk_c9 = sk_c10. [para(12453(b,1),11643(b,1)),flip(c),merge(b)].
% 2.82/3.14 12577 inverse(sk_c6) = sk_c11 | multiply(sk_c11,inverse(sk_c9)) = sk_c3. [para(9691(a,1),153(b,1,2)),rewrite([9733(7)]),flip(b)].
% 2.82/3.14 13081 sk_c9 != sk_c10 | inverse(multiply(A,inverse(sk_c9))) != sk_c11 | sk_c11 != A | inverse(B) != sk_c11 | sk_c11 != B. [para(9751(a,1),12509(c,1,2)),rewrite([9733(11)]),flip(c)].
% 2.82/3.14 13093 sk_c9 != sk_c10 | inverse(multiply(A,inverse(sk_c9))) != sk_c11 | sk_c11 != A | inverse(A) != sk_c11. [factor(13081,c,e)].
% 2.82/3.14 13112 sk_c5 = sk_c9 | sk_c2 = sk_c10. [para(11650(a,1),2242(a,1,1)),rewrite([9727(5)]),flip(b)].
% 2.82/3.14 13124 sk_c2 = sk_c10 | sk_c9 = sk_c10. [para(13112(a,1),9872(a,1)),merge(c)].
% 2.82/3.14 13216 sk_c9 = sk_c10. [para(13124(a,1),12539(a,1)),flip(b),merge(b),merge(c)].
% 2.82/3.14 13295 inverse(A) != sk_c11 | sk_c11 != A. [back_rewrite(13093),rewrite([13216(1),13216(4),9727(5),9733(5)]),xx(a),merge(c)].
% 2.82/3.14 13465 inverse(sk_c6) = sk_c11 | sk_c3 = sk_c11. [back_rewrite(12577),rewrite([13216(6),9727(7),9733(7)]),flip(b)].
% 2.82/3.14 13543 inverse(sk_c11) != sk_c11. [back_rewrite(12268),rewrite([13216(1),13216(9),9733(10)]),xx(a),xx(c)].
% 2.82/3.14 13587 sk_c3 = sk_c11 | sk_c6 = sk_c11. [back_rewrite(11638),rewrite([13216(2),9733(3)])].
% 2.82/3.14 13686 sk_c3 != sk_c11 | sk_c6 = sk_c11. [resolve(13295,a,11647,a),flip(a)].
% 2.82/3.14 13688 sk_c3 != sk_c11 | inverse(sk_c11) = sk_c6. [resolve(13295,a,2107,a),flip(a)].
% 2.82/3.14 13689 sk_c3 != sk_c11 | inverse(sk_c11) = sk_c4. [resolve(13295,a,2084,a),flip(a)].
% 2.82/3.14 13693 sk_c4 != sk_c11 | inverse(sk_c3) = sk_c11. [resolve(13295,a,11,b),flip(a)].
% 2.82/3.14 13737 sk_c3 = sk_c11. [para(13587(b,1),13465(a,1,1)),merge(c),unit_del(b,13543)].
% 2.82/3.14 13752 sk_c4 != sk_c11. [back_rewrite(13693),rewrite([13737(4)]),unit_del(b,13543)].
% 2.82/3.14 13754 inverse(sk_c11) = sk_c4. [back_rewrite(13689),rewrite([13737(1)]),xx(a)].
% 2.82/3.14 13755 sk_c6 = sk_c4. [back_rewrite(13688),rewrite([13737(1),13754(5)]),flip(b),xx(a)].
% 2.82/3.14 13756 $F. [back_rewrite(13686),rewrite([13737(1),13755(4)]),xx(a),unit_del(a,13752)].
% 2.82/3.14
% 2.82/3.14 % SZS output end Refutation
% 2.82/3.14 ============================== end of proof ==========================
% 2.82/3.14
% 2.82/3.14 ============================== STATISTICS ============================
% 2.82/3.14
% 2.82/3.14 Given=499. Generated=35592. Kept=13755. proofs=1.
% 2.82/3.14 Usable=82. Sos=323. Demods=24. Limbo=19, Disabled=13389. Hints=0.
% 2.82/3.14 Megabytes=14.43.
% 2.82/3.14 User_CPU=2.16, System_CPU=0.03, Wall_clock=2.
% 2.82/3.14
% 2.82/3.14 ============================== end of statistics =====================
% 2.82/3.14
% 2.82/3.14 ============================== end of search =========================
% 2.82/3.14
% 2.82/3.14 THEOREM PROVED
% 2.82/3.14 % SZS status Unsatisfiable
% 2.82/3.14
% 2.82/3.14 Exiting with 1 proof.
% 2.82/3.14
% 2.82/3.14 Process 11350 exit (max_proofs) Mon Jun 13 06:07:25 2022
% 2.82/3.14 Prover9 interrupted
%------------------------------------------------------------------------------