TSTP Solution File: GRP375-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP375-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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:49 EDT 2022
% Result : Unsatisfiable 10.46s 10.77s
% Output : Refutation 10.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP375-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 : n004.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 01:23:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 6.14/6.49 ============================== Prover9 ===============================
% 6.14/6.49 Prover9 (32) version 2009-11A, November 2009.
% 6.14/6.49 Process 3163 was started by sandbox on n004.cluster.edu,
% 6.14/6.49 Tue Jun 14 01:23:09 2022
% 6.14/6.49 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3010_n004.cluster.edu".
% 6.14/6.49 ============================== end of head ===========================
% 6.14/6.49
% 6.14/6.49 ============================== INPUT =================================
% 6.14/6.49
% 6.14/6.49 % Reading from file /tmp/Prover9_3010_n004.cluster.edu
% 6.14/6.49
% 6.14/6.49 set(prolog_style_variables).
% 6.14/6.49 set(auto2).
% 6.14/6.49 % set(auto2) -> set(auto).
% 6.14/6.49 % set(auto) -> set(auto_inference).
% 6.14/6.49 % set(auto) -> set(auto_setup).
% 6.14/6.49 % set(auto_setup) -> set(predicate_elim).
% 6.14/6.49 % set(auto_setup) -> assign(eq_defs, unfold).
% 6.14/6.49 % set(auto) -> set(auto_limits).
% 6.14/6.49 % set(auto_limits) -> assign(max_weight, "100.000").
% 6.14/6.49 % set(auto_limits) -> assign(sos_limit, 20000).
% 6.14/6.49 % set(auto) -> set(auto_denials).
% 6.14/6.49 % set(auto) -> set(auto_process).
% 6.14/6.49 % set(auto2) -> assign(new_constants, 1).
% 6.14/6.49 % set(auto2) -> assign(fold_denial_max, 3).
% 6.14/6.49 % set(auto2) -> assign(max_weight, "200.000").
% 6.14/6.49 % set(auto2) -> assign(max_hours, 1).
% 6.14/6.49 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 6.14/6.49 % set(auto2) -> assign(max_seconds, 0).
% 6.14/6.49 % set(auto2) -> assign(max_minutes, 5).
% 6.14/6.49 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 6.14/6.49 % set(auto2) -> set(sort_initial_sos).
% 6.14/6.49 % set(auto2) -> assign(sos_limit, -1).
% 6.14/6.49 % set(auto2) -> assign(lrs_ticks, 3000).
% 6.14/6.49 % set(auto2) -> assign(max_megs, 400).
% 6.14/6.49 % set(auto2) -> assign(stats, some).
% 6.14/6.49 % set(auto2) -> clear(echo_input).
% 6.14/6.49 % set(auto2) -> set(quiet).
% 6.14/6.49 % set(auto2) -> clear(print_initial_clauses).
% 6.14/6.49 % set(auto2) -> clear(print_given).
% 6.14/6.49 assign(lrs_ticks,-1).
% 6.14/6.49 assign(sos_limit,10000).
% 6.14/6.49 assign(order,kbo).
% 6.14/6.49 set(lex_order_vars).
% 6.14/6.49 clear(print_given).
% 6.14/6.49
% 6.14/6.49 % formulas(sos). % not echoed (44 formulas)
% 6.14/6.49
% 6.14/6.49 ============================== end of input ==========================
% 6.14/6.49
% 6.14/6.49 % From the command line: assign(max_seconds, 300).
% 6.14/6.49
% 6.14/6.49 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 6.14/6.49
% 6.14/6.49 % Formulas that are not ordinary clauses:
% 6.14/6.49
% 6.14/6.49 ============================== end of process non-clausal formulas ===
% 6.14/6.49
% 6.14/6.49 ============================== PROCESS INITIAL CLAUSES ===============
% 6.14/6.49
% 6.14/6.49 ============================== PREDICATE ELIMINATION =================
% 6.14/6.49
% 6.14/6.49 ============================== end predicate elimination =============
% 6.14/6.49
% 6.14/6.49 Auto_denials: (non-Horn, no changes).
% 6.14/6.49
% 6.14/6.49 Term ordering decisions:
% 6.14/6.49
% 6.14/6.49 % Assigning unary symbol inverse kb_weight 0 and highest precedence (14).
% 6.14/6.49 Function symbol KB weights: sk_c10=1. sk_c9=1. sk_c1=1. sk_c7=1. sk_c8=1. sk_c5=1. sk_c2=1. sk_c3=1. sk_c4=1. sk_c6=1. identity=1. multiply=1. inverse=0.
% 6.14/6.49
% 6.14/6.49 ============================== end of process initial clauses ========
% 6.14/6.49
% 6.14/6.49 ============================== CLAUSES FOR SEARCH ====================
% 6.14/6.49
% 6.14/6.49 ============================== end of clauses for search =============
% 6.14/6.49
% 6.14/6.49 ============================== SEARCH ================================
% 6.14/6.49
% 6.14/6.49 % Starting search at 0.14 seconds.
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=50.000, iters=4372
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=49.000, iters=4276
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=48.000, iters=3888
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=47.000, iters=3477
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=45.000, iters=3392
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=44.000, iters=3382
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=43.000, iters=3427
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=42.000, iters=3382
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=41.000, iters=3345
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=40.000, iters=3361
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=39.000, iters=3385
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=38.000, iters=3359
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=37.000, iters=3362
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=36.000, iters=3632
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=35.000, iters=3366
% 6.14/6.49
% 6.14/6.49 Low Water (displace): id=10192, wt=69.000
% 6.14/6.49
% 6.14/6.49 Low Water (displace): id=9675, wt=66.000
% 6.14/6.49
% 6.14/6.49 Low Water (displace): id=10186, wt=65.000
% 6.14/6.49
% 6.14/6.49 Low Water (displace): id=14329, wt=15.000
% 6.14/6.49
% 6.14/6.49 Low Water (displace): id=14358, wt=12.000
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=34.000, iters=3336
% 6.14/6.49
% 6.14/6.49 Low Water (displace): id=14777, wt=11.000
% 6.14/6.49
% 6.14/6.49 Low Water (displace): id=15537, wt=10.000
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=33.000, iters=3333
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=32.000, iters=3373
% 6.14/6.49
% 6.14/6.49 Low Water (keep): wt=31.000, iters=3342
% 10.46/10.77
% 10.46/10.77 Low Water (keep): wt=30.000, iters=3344
% 10.46/10.77
% 10.46/10.77 Low Water (keep): wt=29.000, iters=3368
% 10.46/10.77
% 10.46/10.77 Low Water (keep): wt=28.000, iters=3355
% 10.46/10.77
% 10.46/10.77 Low Water (keep): wt=27.000, iters=3351
% 10.46/10.77
% 10.46/10.77 Low Water (keep): wt=26.000, iters=3362
% 10.46/10.77
% 10.46/10.77 ============================== PROOF =================================
% 10.46/10.77 % SZS status Unsatisfiable
% 10.46/10.77 % SZS output start Refutation
% 10.46/10.77
% 10.46/10.77 % Proof 1 at 9.65 (+ 0.12) seconds.
% 10.46/10.77 % Length of proof is 72.
% 10.46/10.77 % Level of proof is 24.
% 10.46/10.77 % Maximum clause weight is 63.000.
% 10.46/10.77 % Given clauses 1500.
% 10.46/10.77
% 10.46/10.77 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 10.46/10.77 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 10.46/10.77 5 inverse(sk_c10) = sk_c9 | inverse(sk_c4) = sk_c7 # label(prove_this_6) # label(negated_conjecture). [assumption].
% 10.46/10.77 8 inverse(sk_c1) = sk_c10 | inverse(sk_c2) = sk_c10 # label(prove_this_22) # label(negated_conjecture). [assumption].
% 10.46/10.77 10 inverse(sk_c1) = sk_c10 | inverse(sk_c4) = sk_c7 # label(prove_this_26) # label(negated_conjecture). [assumption].
% 10.46/10.77 15 inverse(sk_c10) = sk_c9 | multiply(sk_c4,sk_c7) = sk_c10 # label(prove_this_5) # label(negated_conjecture). [assumption].
% 10.46/10.77 18 multiply(sk_c1,sk_c10) = sk_c9 | inverse(sk_c2) = sk_c10 # label(prove_this_12) # label(negated_conjecture). [assumption].
% 10.46/10.77 23 inverse(sk_c1) = sk_c10 | multiply(sk_c2,sk_c10) = sk_c9 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 10.46/10.77 25 inverse(sk_c1) = sk_c10 | multiply(sk_c4,sk_c7) = sk_c10 # label(prove_this_25) # label(negated_conjecture). [assumption].
% 10.46/10.77 29 multiply(sk_c8,sk_c10) = sk_c9 | inverse(sk_c3) = sk_c9 # label(prove_this_34) # label(negated_conjecture). [assumption].
% 10.46/10.77 33 multiply(sk_c1,sk_c10) = sk_c9 | multiply(sk_c2,sk_c10) = sk_c9 # label(prove_this_11) # label(negated_conjecture). [assumption].
% 10.46/10.77 39 multiply(sk_c8,sk_c10) = sk_c9 | multiply(sk_c3,sk_c9) = sk_c8 # label(prove_this_33) # label(negated_conjecture). [assumption].
% 10.46/10.77 43 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 10.46/10.77 44 inverse(sk_c10) != sk_c9 | multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | multiply(sk_c8,sk_c10) != sk_c9 | multiply(B,sk_c10) != sk_c9 | inverse(B) != sk_c10 | multiply(C,sk_c9) != sk_c8 | inverse(C) != sk_c9 | multiply(D,E) != sk_c10 | inverse(D) != E | multiply(E,sk_c9) != sk_c10 | inverse(F) != V6 | inverse(V6) != E | multiply(F,E) != V6 # label(prove_this_41) # label(negated_conjecture). [assumption].
% 10.46/10.77 50 inverse(sk_c10) != sk_c9 | multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | multiply(sk_c8,sk_c10) != sk_c9 | multiply(B,sk_c9) != sk_c8 | inverse(B) != sk_c9 | multiply(C,D) != sk_c10 | inverse(C) != D | multiply(D,sk_c9) != sk_c10 | inverse(E) != F | inverse(F) != D | multiply(E,D) != F. [factor(44,b,e),merge(e)].
% 10.46/10.77 348 inverse(sk_c10) = sk_c9 | multiply(sk_c7,sk_c4) = identity. [para(5(b,1),2(a,1,1))].
% 10.46/10.77 353 inverse(sk_c1) = sk_c10 | multiply(sk_c7,sk_c4) = identity. [para(10(b,1),2(a,1,1))].
% 10.46/10.77 356 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),43(a,1,1)),rewrite([1(2)]),flip(a)].
% 10.46/10.77 389 inverse(sk_c3) = sk_c9 | multiply(sk_c8,multiply(sk_c10,A)) = multiply(sk_c9,A). [para(29(a,1),43(a,1,1)),flip(b)].
% 10.46/10.77 409 multiply(sk_c8,sk_c10) = sk_c9 | multiply(sk_c3,multiply(sk_c9,A)) = multiply(sk_c8,A). [para(39(b,1),43(a,1,1)),flip(b)].
% 10.46/10.77 471 inverse(sk_c10) != sk_c9 | multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | multiply(sk_c8,sk_c10) != sk_c9 | identity != sk_c8 | inverse(inverse(sk_c9)) != sk_c9 | multiply(B,C) != sk_c10 | inverse(B) != C | multiply(C,sk_c9) != sk_c10 | inverse(D) != E | inverse(E) != C | multiply(D,C) != E. [para(2(a,1),50(e,1))].
% 10.46/10.77 1089 inverse(sk_c10) != sk_c9 | multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | multiply(sk_c8,sk_c10) != sk_c9 | identity != sk_c8 | inverse(inverse(sk_c9)) != sk_c9 | multiply(B,C) != sk_c10 | inverse(B) != C | multiply(C,sk_c9) != sk_c10 | inverse(sk_c9) != C | multiply(sk_c10,C) != sk_c9. [factor(471,a,j)].
% 10.46/10.77 3129 inverse(sk_c10) != sk_c9 | multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | multiply(sk_c8,sk_c10) != sk_c9 | identity != sk_c8 | inverse(inverse(sk_c9)) != sk_c9 | multiply(sk_c9,B) != sk_c10 | inverse(sk_c9) != B | multiply(B,sk_c9) != sk_c10 | multiply(sk_c10,B) != sk_c9. [factor(1089,h,j)].
% 10.46/10.77 7273 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),356(a,1,2))].
% 10.46/10.77 7363 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(356(a,1),356(a,1,2))].
% 10.46/10.77 7458 multiply(A,identity) = A. [back_rewrite(7273),rewrite([7363(4)])].
% 10.46/10.77 7557 inverse(identity) = identity. [para(7458(a,1),2(a,1))].
% 10.46/10.77 8032 inverse(sk_c10) = sk_c9 | inverse(sk_c7) = sk_c4. [para(348(b,1),356(a,1,2)),rewrite([7458(8)])].
% 10.46/10.77 8033 inverse(sk_c10) = sk_c9 | multiply(sk_c4,sk_c7) = identity. [para(8032(b,1),2(a,1,1))].
% 10.46/10.77 8625 inverse(sk_c1) = sk_c10 | inverse(sk_c7) = sk_c4. [para(353(b,1),356(a,1,2)),rewrite([7458(8)])].
% 10.46/10.77 8667 inverse(sk_c1) = sk_c10 | multiply(sk_c4,sk_c7) = identity. [para(8625(b,1),2(a,1,1))].
% 10.46/10.77 9020 multiply(A,inverse(A)) = identity. [para(7363(a,1),2(a,1))].
% 10.46/10.77 9489 inverse(inverse(A)) = A. [para(7363(a,1),7458(a,1)),rewrite([7458(2)]),flip(a)].
% 10.46/10.77 9995 inverse(sk_c10) != sk_c9 | multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | multiply(sk_c8,sk_c10) != sk_c9 | identity != sk_c8 | multiply(sk_c9,B) != sk_c10 | inverse(sk_c9) != B | multiply(B,sk_c9) != sk_c10 | multiply(sk_c10,B) != sk_c9. [back_rewrite(3129),rewrite([9489(22)]),xx(f)].
% 10.46/10.77 10472 inverse(sk_c1) = sk_c10 | multiply(sk_c2,sk_c10) = identity. [para(8(b,1),9020(a,1,2))].
% 10.46/10.77 10847 inverse(sk_c10) = sk_c9 | identity = sk_c10. [para(8033(b,1),15(b,1)),merge(b)].
% 10.46/10.77 10853 identity = sk_c10 | inverse(sk_c9) = sk_c10. [para(10847(a,1),9489(a,1,1))].
% 10.46/10.77 10975 inverse(sk_c1) = sk_c10 | identity = sk_c10. [para(8667(b,1),25(b,1)),merge(b)].
% 10.46/10.77 10982 identity = sk_c10 | multiply(sk_c1,sk_c10) = identity. [para(10975(a,1),9020(a,1,2))].
% 10.46/10.77 14022 inverse(sk_c3) = sk_c9 | multiply(sk_c8,multiply(sk_c10,inverse(sk_c9))) = identity. [para(9020(a,1),389(b,2))].
% 10.46/10.77 15520 inverse(sk_c1) = sk_c10 | identity = sk_c9. [para(10472(b,1),23(b,1)),merge(b)].
% 10.46/10.77 15535 identity = sk_c9 | inverse(sk_c10) = sk_c1. [para(15520(a,1),9489(a,1,1))].
% 10.46/10.77 15536 identity = sk_c9 | multiply(sk_c1,sk_c10) = identity. [para(15520(a,1),9020(a,1,2))].
% 10.46/10.77 15656 identity = sk_c9 | inverse(sk_c2) = sk_c10. [para(15536(b,1),18(a,1)),merge(b)].
% 10.46/10.77 15671 identity = sk_c9 | inverse(sk_c10) = sk_c2. [para(15656(b,1),9489(a,1,1))].
% 10.46/10.77 15672 identity = sk_c9 | multiply(sk_c2,sk_c10) = identity. [para(15656(b,1),9020(a,1,2))].
% 10.46/10.77 15836 identity = sk_c9 | sk_c2 = sk_c1. [para(15671(b,1),15535(b,1)),merge(b)].
% 10.46/10.77 16067 sk_c2 = sk_c1 | inverse(sk_c9) = identity. [para(15836(a,1),7557(a,1,1))].
% 10.46/10.77 16530 sk_c2 = sk_c1 | identity = sk_c10. [para(16067(b,1),10853(b,1)),merge(c)].
% 10.46/10.77 16680 sk_c2 = sk_c1 | sk_c9 = sk_c10. [para(16530(b,1),15836(a,1)),flip(b),merge(c)].
% 10.46/10.77 16683 sk_c9 = sk_c10 | multiply(sk_c1,sk_c10) = sk_c9. [para(16680(a,1),33(b,1,1)),merge(c)].
% 10.46/10.77 17152 multiply(sk_c8,sk_c10) = sk_c9 | multiply(sk_c8,inverse(sk_c9)) = sk_c3. [para(9020(a,1),409(b,1,2)),rewrite([7458(8)]),flip(b)].
% 10.46/10.77 18261 identity = sk_c9 | multiply(sk_c1,sk_c10) = sk_c9. [para(15672(b,1),33(b,1)),merge(c)].
% 10.46/10.77 19830 sk_c9 = sk_c10 | identity = sk_c9. [para(16683(b,1),15536(b,1)),flip(c),merge(c)].
% 10.46/10.77 19834 sk_c9 = sk_c10 | inverse(sk_c9) = identity. [para(19830(b,1),7557(a,1,1))].
% 10.46/10.77 19853 sk_c9 = sk_c10 | identity = sk_c10. [para(19834(b,1),10853(b,1)),merge(c)].
% 10.46/10.77 19865 sk_c9 = sk_c10. [para(19853(b,1),19830(b,1)),flip(c),merge(b),merge(c)].
% 10.46/10.77 20088 identity = sk_c10 | multiply(sk_c1,sk_c10) = sk_c10. [back_rewrite(18261),rewrite([19865(2),19865(7)])].
% 10.46/10.77 20284 multiply(sk_c8,sk_c10) = sk_c10 | multiply(sk_c8,inverse(sk_c10)) = sk_c3. [back_rewrite(17152),rewrite([19865(4),19865(7)])].
% 10.46/10.77 20900 inverse(sk_c3) = sk_c10 | identity = sk_c8. [back_rewrite(14022),rewrite([19865(3),19865(7),9020(9),7458(7)]),flip(b)].
% 10.46/10.77 22262 inverse(sk_c10) != sk_c10 | multiply(A,sk_c10) != sk_c10 | inverse(A) != sk_c10 | multiply(sk_c8,sk_c10) != sk_c10 | identity != sk_c8 | multiply(sk_c10,B) != sk_c10 | inverse(sk_c10) != B | multiply(B,sk_c10) != sk_c10. [back_rewrite(9995),rewrite([19865(3),19865(7),19865(15),19865(20),19865(24),19865(27),19865(33)]),merge(i)].
% 10.46/10.77 25489 identity = sk_c8 | inverse(sk_c10) = sk_c3. [para(20900(a,1),9489(a,1,1))].
% 10.46/10.77 28135 inverse(sk_c10) != sk_c10 | multiply(A,multiply(B,sk_c10)) != sk_c10 | inverse(multiply(A,B)) != sk_c10 | multiply(sk_c8,sk_c10) != sk_c10 | identity != sk_c8 | multiply(sk_c10,C) != sk_c10 | inverse(sk_c10) != C | multiply(C,sk_c10) != sk_c10. [para(43(a,1),22262(b,1))].
% 10.46/10.77 28138 inverse(sk_c10) != sk_c10 | multiply(sk_c10,multiply(A,sk_c10)) != sk_c10 | inverse(multiply(sk_c10,A)) != sk_c10 | multiply(sk_c8,sk_c10) != sk_c10 | identity != sk_c8 | multiply(A,sk_c10) != inverse(sk_c10) | multiply(A,multiply(sk_c10,sk_c10)) != sk_c10. [factor(28135,b,f),rewrite([43(32)]),flip(f)].
% 10.46/10.77 28211 identity = sk_c10. [para(20088(b,1),10982(b,1)),flip(c),merge(b),merge(c)].
% 10.46/10.77 28218 inverse(sk_c10) != sk_c10 | multiply(sk_c10,multiply(A,sk_c10)) != sk_c10 | inverse(multiply(sk_c10,A)) != sk_c10 | multiply(sk_c8,sk_c10) != sk_c10 | sk_c8 != sk_c10 | multiply(A,sk_c10) != inverse(sk_c10) | multiply(A,multiply(sk_c10,sk_c10)) != sk_c10. [back_rewrite(28138),rewrite([28211(21)]),flip(e)].
% 10.46/10.77 28977 sk_c8 = sk_c10 | inverse(sk_c10) = sk_c3. [back_rewrite(25489),rewrite([28211(1)]),flip(a)].
% 10.46/10.77 29764 inverse(sk_c10) = sk_c10. [back_rewrite(7557),rewrite([28211(1),28211(3)])].
% 10.46/10.77 29765 multiply(A,sk_c10) = A. [back_rewrite(7458),rewrite([28211(1)])].
% 10.46/10.77 29773 sk_c8 != sk_c10. [factor(28218,b,g),rewrite([29764(2),29765(7),29765(6),29765(9),29764(8),29765(12),29765(18),29764(18)]),xx(a),xx(b),xx(c),xx(f),merge(b)].
% 10.46/10.77 29786 sk_c3 = sk_c10. [back_rewrite(28977),rewrite([29764(5)]),flip(b),unit_del(a,29773)].
% 10.46/10.77 29803 $F. [back_rewrite(20284),rewrite([29765(3),29764(6),29765(6),29786(5)]),merge(b),unit_del(a,29773)].
% 10.46/10.77
% 10.46/10.77 % SZS output end Refutation
% 10.46/10.77 ============================== end of proof ==========================
% 10.46/10.77
% 10.46/10.77 ============================== STATISTICS ============================
% 10.46/10.77
% 10.46/10.77 Given=1500. Generated=214630. Kept=29802. proofs=1.
% 10.46/10.77 Usable=182. Sos=1359. Demods=25. Limbo=39, Disabled=28266. Hints=0.
% 10.46/10.77 Megabytes=31.84.
% 10.46/10.77 User_CPU=9.65, System_CPU=0.12, Wall_clock=10.
% 10.46/10.77
% 10.46/10.77 ============================== end of statistics =====================
% 10.46/10.77
% 10.46/10.77 ============================== end of search =========================
% 10.46/10.77
% 10.46/10.77 THEOREM PROVED
% 10.46/10.77 % SZS status Unsatisfiable
% 10.46/10.77
% 10.46/10.77 Exiting with 1 proof.
% 10.46/10.77
% 10.46/10.77 Process 3163 exit (max_proofs) Tue Jun 14 01:23:19 2022
% 10.46/10.77 Prover9 interrupted
%------------------------------------------------------------------------------