TSTP Solution File: GRP390-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP390-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:53 EDT 2022
% Result : Unsatisfiable 2.03s 2.37s
% Output : Refutation 2.03s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP390-1 : TPTP v8.1.0. Released v2.5.0.
% 0.08/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 03:18:54 EDT 2022
% 0.13/0.35 % CPUTime :
% 2.03/2.37 ============================== Prover9 ===============================
% 2.03/2.37 Prover9 (32) version 2009-11A, November 2009.
% 2.03/2.37 Process 16126 was started by sandbox2 on n025.cluster.edu,
% 2.03/2.37 Tue Jun 14 03:18:55 2022
% 2.03/2.37 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15973_n025.cluster.edu".
% 2.03/2.37 ============================== end of head ===========================
% 2.03/2.37
% 2.03/2.37 ============================== INPUT =================================
% 2.03/2.37
% 2.03/2.37 % Reading from file /tmp/Prover9_15973_n025.cluster.edu
% 2.03/2.37
% 2.03/2.37 set(prolog_style_variables).
% 2.03/2.37 set(auto2).
% 2.03/2.37 % set(auto2) -> set(auto).
% 2.03/2.37 % set(auto) -> set(auto_inference).
% 2.03/2.37 % set(auto) -> set(auto_setup).
% 2.03/2.37 % set(auto_setup) -> set(predicate_elim).
% 2.03/2.37 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.03/2.37 % set(auto) -> set(auto_limits).
% 2.03/2.37 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.03/2.37 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.03/2.37 % set(auto) -> set(auto_denials).
% 2.03/2.37 % set(auto) -> set(auto_process).
% 2.03/2.37 % set(auto2) -> assign(new_constants, 1).
% 2.03/2.37 % set(auto2) -> assign(fold_denial_max, 3).
% 2.03/2.37 % set(auto2) -> assign(max_weight, "200.000").
% 2.03/2.37 % set(auto2) -> assign(max_hours, 1).
% 2.03/2.37 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.03/2.37 % set(auto2) -> assign(max_seconds, 0).
% 2.03/2.37 % set(auto2) -> assign(max_minutes, 5).
% 2.03/2.37 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.03/2.37 % set(auto2) -> set(sort_initial_sos).
% 2.03/2.37 % set(auto2) -> assign(sos_limit, -1).
% 2.03/2.37 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.03/2.37 % set(auto2) -> assign(max_megs, 400).
% 2.03/2.37 % set(auto2) -> assign(stats, some).
% 2.03/2.37 % set(auto2) -> clear(echo_input).
% 2.03/2.37 % set(auto2) -> set(quiet).
% 2.03/2.37 % set(auto2) -> clear(print_initial_clauses).
% 2.03/2.37 % set(auto2) -> clear(print_given).
% 2.03/2.37 assign(lrs_ticks,-1).
% 2.03/2.37 assign(sos_limit,10000).
% 2.03/2.37 assign(order,kbo).
% 2.03/2.37 set(lex_order_vars).
% 2.03/2.37 clear(print_given).
% 2.03/2.37
% 2.03/2.37 % formulas(sos). % not echoed (40 formulas)
% 2.03/2.37
% 2.03/2.37 ============================== end of input ==========================
% 2.03/2.37
% 2.03/2.37 % From the command line: assign(max_seconds, 300).
% 2.03/2.37
% 2.03/2.37 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.03/2.37
% 2.03/2.37 % Formulas that are not ordinary clauses:
% 2.03/2.37
% 2.03/2.37 ============================== end of process non-clausal formulas ===
% 2.03/2.37
% 2.03/2.37 ============================== PROCESS INITIAL CLAUSES ===============
% 2.03/2.37
% 2.03/2.37 ============================== PREDICATE ELIMINATION =================
% 2.03/2.37
% 2.03/2.37 ============================== end predicate elimination =============
% 2.03/2.37
% 2.03/2.37 Auto_denials: (non-Horn, no changes).
% 2.03/2.37
% 2.03/2.37 Term ordering decisions:
% 2.03/2.37
% 2.03/2.37 % Assigning unary symbol inverse kb_weight 0 and highest precedence (13).
% 2.03/2.37 Function symbol KB weights: sk_c8=1. sk_c9=1. sk_c3=1. sk_c7=1. sk_c1=1. sk_c2=1. sk_c4=1. sk_c5=1. sk_c6=1. identity=1. multiply=1. inverse=0.
% 2.03/2.37
% 2.03/2.37 ============================== end of process initial clauses ========
% 2.03/2.37
% 2.03/2.37 ============================== CLAUSES FOR SEARCH ====================
% 2.03/2.37
% 2.03/2.37 ============================== end of clauses for search =============
% 2.03/2.37
% 2.03/2.37 ============================== SEARCH ================================
% 2.03/2.37
% 2.03/2.37 % Starting search at 0.02 seconds.
% 2.03/2.37
% 2.03/2.37 Low Water (keep): wt=43.000, iters=3510
% 2.03/2.37
% 2.03/2.37 Low Water (keep): wt=42.000, iters=3460
% 2.03/2.37
% 2.03/2.37 Low Water (keep): wt=41.000, iters=3433
% 2.03/2.37
% 2.03/2.37 Low Water (keep): wt=39.000, iters=3436
% 2.03/2.37
% 2.03/2.37 Low Water (keep): wt=38.000, iters=3386
% 2.03/2.37
% 2.03/2.37 Low Water (keep): wt=37.000, iters=3351
% 2.03/2.37
% 2.03/2.37 Low Water (keep): wt=35.000, iters=3360
% 2.03/2.37
% 2.03/2.37 Low Water (keep): wt=34.000, iters=3378
% 2.03/2.37
% 2.03/2.37 Low Water (keep): wt=33.000, iters=3371
% 2.03/2.37
% 2.03/2.37 Low Water (keep): wt=32.000, iters=3429
% 2.03/2.37
% 2.03/2.37 Low Water (keep): wt=31.000, iters=3352
% 2.03/2.37
% 2.03/2.37 Low Water (keep): wt=30.000, iters=3333
% 2.03/2.37
% 2.03/2.37 ============================== PROOF =================================
% 2.03/2.37 % SZS status Unsatisfiable
% 2.03/2.37 % SZS output start Refutation
% 2.03/2.37
% 2.03/2.37 % Proof 1 at 1.32 (+ 0.02) seconds.
% 2.03/2.37 % Length of proof is 97.
% 2.03/2.37 % Level of proof is 21.
% 2.03/2.37 % Maximum clause weight is 54.000.
% 2.03/2.37 % Given clauses 453.
% 2.03/2.37
% 2.03/2.37 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 2.03/2.37 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 2.03/2.37 3 inverse(sk_c8) = sk_c7 | inverse(sk_c4) = sk_c9 # label(prove_this_2) # label(negated_conjecture). [assumption].
% 2.03/2.37 4 inverse(sk_c8) = sk_c7 | inverse(sk_c5) = sk_c8 # label(prove_this_4) # label(negated_conjecture). [assumption].
% 2.03/2.37 6 inverse(sk_c1) = sk_c9 | inverse(sk_c4) = sk_c9 # label(prove_this_8) # label(negated_conjecture). [assumption].
% 2.03/2.37 8 inverse(sk_c1) = sk_c9 | inverse(sk_c6) = sk_c9 # label(prove_this_11) # label(negated_conjecture). [assumption].
% 2.03/2.37 9 inverse(sk_c2) = sk_c3 | inverse(sk_c4) = sk_c9 # label(prove_this_26) # label(negated_conjecture). [assumption].
% 2.03/2.37 12 inverse(sk_c8) = sk_c7 | multiply(sk_c4,sk_c9) = sk_c8 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 2.03/2.37 13 inverse(sk_c8) = sk_c7 | multiply(sk_c5,sk_c8) = sk_c7 # label(prove_this_3) # label(negated_conjecture). [assumption].
% 2.03/2.37 15 inverse(sk_c1) = sk_c9 | multiply(sk_c4,sk_c9) = sk_c8 # label(prove_this_7) # label(negated_conjecture). [assumption].
% 2.03/2.37 17 inverse(sk_c1) = sk_c9 | multiply(sk_c6,sk_c8) = sk_c9 # label(prove_this_12) # label(negated_conjecture). [assumption].
% 2.03/2.37 20 multiply(sk_c1,sk_c8) = sk_c9 | inverse(sk_c6) = sk_c9 # label(prove_this_17) # label(negated_conjecture). [assumption].
% 2.03/2.37 21 multiply(sk_c2,sk_c3) = sk_c8 | inverse(sk_c4) = sk_c9 # label(prove_this_20) # label(negated_conjecture). [assumption].
% 2.03/2.37 22 multiply(sk_c2,sk_c3) = sk_c8 | inverse(sk_c5) = sk_c8 # label(prove_this_22) # label(negated_conjecture). [assumption].
% 2.03/2.37 24 inverse(sk_c2) = sk_c3 | multiply(sk_c4,sk_c9) = sk_c8 # label(prove_this_25) # label(negated_conjecture). [assumption].
% 2.03/2.37 32 multiply(sk_c1,sk_c8) = sk_c9 | multiply(sk_c6,sk_c8) = sk_c9 # label(prove_this_18) # label(negated_conjecture). [assumption].
% 2.03/2.37 33 multiply(sk_c2,sk_c3) = sk_c8 | multiply(sk_c4,sk_c9) = sk_c8 # label(prove_this_19) # label(negated_conjecture). [assumption].
% 2.03/2.37 39 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 2.03/2.37 40 inverse(sk_c8) != sk_c7 | inverse(A) != sk_c9 | multiply(A,sk_c8) != sk_c9 | multiply(B,C) != sk_c8 | inverse(B) != C | multiply(C,sk_c7) != sk_c8 | multiply(D,sk_c9) != sk_c8 | inverse(D) != sk_c9 | multiply(E,sk_c8) != sk_c7 | inverse(E) != sk_c8 | inverse(F) != sk_c9 | multiply(F,sk_c8) != sk_c9 # label(prove_this_37) # label(negated_conjecture). [assumption].
% 2.03/2.37 44 inverse(sk_c8) != sk_c7 | inverse(A) != sk_c9 | multiply(A,sk_c8) != sk_c9 | multiply(B,C) != sk_c8 | inverse(B) != C | multiply(C,sk_c7) != sk_c8 | multiply(D,sk_c9) != sk_c8 | inverse(D) != sk_c9 | multiply(E,sk_c8) != sk_c7 | inverse(E) != sk_c8. [factor(40,b,k),merge(k)].
% 2.03/2.37 56 inverse(sk_c8) = sk_c7 | multiply(sk_c9,sk_c4) = identity. [para(3(b,1),2(a,1,1))].
% 2.03/2.37 57 inverse(sk_c8) = sk_c7 | multiply(sk_c8,sk_c5) = identity. [para(4(b,1),2(a,1,1))].
% 2.03/2.37 59 inverse(sk_c1) = sk_c9 | multiply(sk_c9,sk_c4) = identity. [para(6(b,1),2(a,1,1))].
% 2.03/2.37 61 inverse(sk_c1) = sk_c9 | multiply(sk_c9,sk_c6) = identity. [para(8(b,1),2(a,1,1))].
% 2.03/2.37 65 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),39(a,1,1)),rewrite([1(2)]),flip(a)].
% 2.03/2.37 72 inverse(sk_c1) = sk_c9 | multiply(sk_c4,multiply(sk_c9,A)) = multiply(sk_c8,A). [para(15(b,1),39(a,1,1)),flip(b)].
% 2.03/2.37 73 inverse(sk_c1) = sk_c9 | multiply(A,multiply(sk_c4,sk_c9)) = multiply(A,sk_c8). [para(15(b,1),39(a,2,2)),rewrite([39(8)])].
% 2.03/2.37 76 inverse(sk_c1) = sk_c9 | multiply(sk_c6,multiply(sk_c8,A)) = multiply(sk_c9,A). [para(17(b,1),39(a,1,1)),flip(b)].
% 2.03/2.37 82 inverse(sk_c6) = sk_c9 | multiply(sk_c1,multiply(sk_c8,A)) = multiply(sk_c9,A). [para(20(a,1),39(a,1,1)),flip(b)].
% 2.03/2.37 156 inverse(sk_c8) != sk_c7 | inverse(A) != sk_c9 | multiply(A,sk_c8) != sk_c9 | multiply(B,C) != sk_c8 | inverse(B) != C | multiply(C,sk_c7) != sk_c8 | identity != sk_c8 | inverse(inverse(sk_c9)) != sk_c9 | multiply(D,sk_c8) != sk_c7 | inverse(D) != sk_c8. [para(2(a,1),44(g,1))].
% 2.03/2.37 319 inverse(sk_c8) != sk_c7 | inverse(inverse(sk_c9)) != sk_c9 | multiply(inverse(sk_c9),sk_c8) != sk_c9 | multiply(A,B) != sk_c8 | inverse(A) != B | multiply(B,sk_c7) != sk_c8 | identity != sk_c8 | multiply(C,sk_c8) != sk_c7 | inverse(C) != sk_c8. [factor(156,b,h)].
% 2.03/2.37 659 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),65(a,1,2))].
% 2.03/2.37 698 inverse(sk_c8) = sk_c7 | multiply(inverse(sk_c9),identity) = sk_c4. [para(56(b,1),65(a,1,2))].
% 2.03/2.37 699 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(65(a,1),65(a,1,2))].
% 2.03/2.37 700 multiply(A,identity) = A. [back_rewrite(659),rewrite([699(4)])].
% 2.03/2.37 701 inverse(sk_c8) = sk_c7 | inverse(sk_c9) = sk_c4. [back_rewrite(698),rewrite([700(8)])].
% 2.03/2.37 707 inverse(identity) = identity. [para(700(a,1),2(a,1))].
% 2.03/2.37 757 inverse(sk_c8) = sk_c7 | multiply(sk_c4,sk_c9) = identity. [para(701(b,1),2(a,1,1))].
% 2.03/2.37 760 inverse(sk_c8) = sk_c7 | inverse(sk_c8) = sk_c5. [para(57(b,1),65(a,1,2)),rewrite([700(8)])].
% 2.03/2.37 761 inverse(sk_c8) = sk_c7 | multiply(sk_c5,sk_c8) = identity. [para(760(b,1),2(a,1,1))].
% 2.03/2.37 773 inverse(sk_c1) = sk_c9 | inverse(sk_c9) = sk_c4. [para(59(b,1),65(a,1,2)),rewrite([700(8)])].
% 2.03/2.37 858 inverse(sk_c1) = sk_c9 | inverse(sk_c9) = sk_c6. [para(61(b,1),65(a,1,2)),rewrite([700(8)])].
% 2.03/2.37 932 multiply(A,inverse(A)) = identity. [para(699(a,1),2(a,1))].
% 2.03/2.37 972 inverse(inverse(A)) = A. [para(699(a,1),700(a,1)),rewrite([700(2)]),flip(a)].
% 2.03/2.37 1009 inverse(sk_c8) != sk_c7 | multiply(inverse(sk_c9),sk_c8) != sk_c9 | multiply(A,B) != sk_c8 | inverse(A) != B | multiply(B,sk_c7) != sk_c8 | identity != sk_c8 | multiply(C,sk_c8) != sk_c7 | inverse(C) != sk_c8. [back_rewrite(319),rewrite([972(7)]),xx(b)].
% 2.03/2.37 1015 inverse(sk_c8) != sk_c7 | inverse(A) != sk_c9 | multiply(A,sk_c8) != sk_c9 | multiply(B,C) != sk_c8 | inverse(B) != C | multiply(C,sk_c7) != sk_c8 | identity != sk_c8 | multiply(D,sk_c8) != sk_c7 | inverse(D) != sk_c8. [back_rewrite(156),rewrite([972(26)]),xx(h)].
% 2.03/2.37 1032 inverse(sk_c2) = sk_c3 | multiply(sk_c4,sk_c9) = identity. [para(9(b,1),932(a,1,2))].
% 2.03/2.37 1227 inverse(sk_c8) = sk_c7 | identity = sk_c8. [para(757(b,1),12(b,1)),merge(b)].
% 2.03/2.37 1298 inverse(sk_c8) = sk_c7 | identity = sk_c7. [para(761(b,1),13(b,1)),merge(b)].
% 2.03/2.37 1313 inverse(sk_c1) = sk_c9 | multiply(inverse(sk_c4),multiply(sk_c8,A)) = multiply(sk_c9,A). [para(72(b,1),65(a,1,2))].
% 2.03/2.37 1430 inverse(sk_c1) = sk_c9 | multiply(sk_c4,multiply(sk_c9,multiply(sk_c4,sk_c9))) = multiply(sk_c8,sk_c8). [para(73(b,1),72(b,2)),merge(b)].
% 2.03/2.37 1727 inverse(sk_c1) = sk_c9 | multiply(A,multiply(sk_c6,multiply(sk_c8,B))) = multiply(A,multiply(sk_c9,B)). [para(76(b,1),39(a,2,2)),rewrite([39(9)])].
% 2.03/2.37 1730 inverse(sk_c1) = sk_c9 | multiply(inverse(sk_c6),multiply(sk_c9,A)) = multiply(sk_c8,A). [para(76(b,1),65(a,1,2))].
% 2.03/2.37 1744 inverse(sk_c1) = sk_c9 | multiply(sk_c6,multiply(sk_c8,sk_c8)) = multiply(sk_c9,multiply(sk_c4,sk_c9)). [para(73(b,1),76(b,1,2)),merge(b)].
% 2.03/2.37 2093 inverse(sk_c2) = sk_c3 | identity = sk_c8. [para(1032(b,1),24(b,1)),merge(b)].
% 2.03/2.37 2104 identity = sk_c8 | multiply(sk_c2,sk_c3) = identity. [para(2093(a,1),932(a,1,2))].
% 2.03/2.37 2210 identity = sk_c8 | inverse(sk_c4) = sk_c9. [para(2104(b,1),21(a,1)),merge(b)].
% 2.03/2.37 2211 identity = sk_c8 | inverse(sk_c5) = sk_c8. [para(2104(b,1),22(a,1)),merge(b)].
% 2.03/2.37 2217 identity = sk_c8 | multiply(sk_c4,sk_c9) = identity. [para(2210(b,1),932(a,1,2))].
% 2.03/2.37 2311 identity = sk_c8 | inverse(sk_c8) = sk_c5. [para(2211(b,1),972(a,1,1))].
% 2.03/2.37 2495 identity = sk_c8 | sk_c5 = sk_c7. [para(2311(b,1),1227(a,1)),merge(c)].
% 2.03/2.37 2500 sk_c5 = sk_c7 | inverse(sk_c8) = identity. [para(2495(a,1),707(a,1,1))].
% 2.03/2.37 2766 inverse(sk_c6) = sk_c9 | multiply(sk_c9,inverse(sk_c8)) = sk_c1. [para(932(a,1),82(b,1,2)),rewrite([700(7)]),flip(b)].
% 2.03/2.37 2847 sk_c5 = sk_c7 | identity = sk_c7. [para(2500(b,1),1298(a,1)),merge(c)].
% 2.03/2.37 2881 sk_c5 = sk_c7 | sk_c7 = sk_c8. [para(2847(b,1),2495(a,1)),merge(c)].
% 2.03/2.37 2890 sk_c7 = sk_c8 | inverse(sk_c8) = sk_c7. [para(2881(a,1),760(b,2)),merge(c)].
% 2.03/2.37 4123 identity = sk_c8 | multiply(sk_c2,sk_c3) = sk_c8. [para(2217(b,1),33(b,1)),merge(c)].
% 2.03/2.37 7042 identity = sk_c8. [para(4123(b,1),2104(b,1)),flip(c),merge(b),merge(c)].
% 2.03/2.37 9039 inverse(sk_c8) != sk_c7 | inverse(A) != sk_c9 | multiply(A,sk_c8) != sk_c9 | multiply(B,C) != sk_c8 | inverse(B) != C | multiply(C,sk_c7) != sk_c8 | multiply(D,sk_c8) != sk_c7 | inverse(D) != sk_c8. [back_rewrite(1015),rewrite([7042(21)]),xx(g)].
% 2.03/2.37 9045 inverse(sk_c8) != sk_c7 | multiply(inverse(sk_c9),sk_c8) != sk_c9 | multiply(A,B) != sk_c8 | inverse(A) != B | multiply(B,sk_c7) != sk_c8 | multiply(C,sk_c8) != sk_c7 | inverse(C) != sk_c8. [back_rewrite(1009),rewrite([7042(20)]),xx(f)].
% 2.03/2.37 9070 inverse(sk_c8) = sk_c8. [back_rewrite(707),rewrite([7042(1),7042(3)])].
% 2.03/2.37 9073 multiply(A,sk_c8) = A. [back_rewrite(700),rewrite([7042(1)])].
% 2.03/2.37 9086 multiply(sk_c8,A) = A. [back_rewrite(1),rewrite([7042(1)])].
% 2.03/2.37 9101 sk_c7 != sk_c8 | inverse(A) != sk_c9 | sk_c9 != A | multiply(sk_c7,sk_c7) != sk_c8 | sk_c7 != B | inverse(B) != sk_c8. [factor(9039,a,e),rewrite([9070(2),9073(8),9086(11),9073(18)]),flip(a),flip(c),flip(f),merge(d)].
% 2.03/2.37 9108 sk_c7 != sk_c8 | inverse(sk_c9) != sk_c9 | multiply(sk_c7,sk_c7) != sk_c8 | sk_c7 != A | inverse(A) != sk_c8. [factor(9045,a,d),rewrite([9070(2),9073(7),9086(10),9073(17)]),flip(a),flip(e),merge(c)].
% 2.03/2.37 9307 sk_c7 = sk_c8. [back_rewrite(2890),rewrite([9070(5)]),flip(b),merge(b)].
% 2.03/2.37 9310 inverse(sk_c6) = sk_c9 | sk_c1 = sk_c9. [back_rewrite(2766),rewrite([9070(7),9073(7)]),flip(b)].
% 2.03/2.37 9521 inverse(sk_c1) = sk_c9 | multiply(sk_c9,multiply(sk_c4,sk_c9)) = sk_c6. [back_rewrite(1744),rewrite([9073(8),9073(7)]),flip(b)].
% 2.03/2.37 9525 inverse(sk_c1) = sk_c9 | multiply(sk_c4,multiply(sk_c9,multiply(sk_c4,sk_c9))) = sk_c8. [back_rewrite(1430),rewrite([9073(14)])].
% 2.03/2.37 9555 sk_c1 = sk_c9 | sk_c6 = sk_c9. [back_rewrite(32),rewrite([9073(3),9073(6)])].
% 2.03/2.37 9627 inverse(sk_c1) = sk_c9 | multiply(inverse(sk_c6),multiply(sk_c9,A)) = A. [back_rewrite(1730),rewrite([9086(11)])].
% 2.03/2.37 9628 inverse(sk_c1) = sk_c9 | multiply(A,multiply(sk_c6,B)) = multiply(A,multiply(sk_c9,B)). [back_rewrite(1727),rewrite([9086(7)])].
% 2.03/2.37 9631 inverse(sk_c1) = sk_c9 | multiply(inverse(sk_c4),A) = multiply(sk_c9,A). [back_rewrite(1313),rewrite([9086(8)])].
% 2.03/2.37 9639 inverse(A) != sk_c9 | sk_c9 != A. [factor(9101,a,e),rewrite([9307(1),9307(9),9307(10),9073(11),9070(13)]),xx(a),xx(d),xx(e)].
% 2.03/2.37 9640 inverse(sk_c9) != sk_c9. [factor(9108,a,d),rewrite([9307(1),9307(8),9307(9),9073(10),9070(12)]),xx(a),xx(c),xx(d)].
% 2.03/2.37 9740 sk_c1 != sk_c9 | inverse(sk_c9) = sk_c6. [resolve(9639,a,858,a),flip(a)].
% 2.03/2.37 9741 sk_c1 != sk_c9 | inverse(sk_c9) = sk_c4. [resolve(9639,a,773,a),flip(a)].
% 2.03/2.37 9745 sk_c4 != sk_c9 | inverse(sk_c1) = sk_c9. [resolve(9639,a,6,b),flip(a)].
% 2.03/2.37 9818 sk_c1 = sk_c9. [para(9555(b,1),9310(a,1,1)),merge(c),unit_del(b,9640)].
% 2.03/2.37 9824 sk_c4 != sk_c9. [back_rewrite(9745),rewrite([9818(4)]),unit_del(b,9640)].
% 2.03/2.37 9826 inverse(sk_c9) = sk_c4. [back_rewrite(9741),rewrite([9818(1)]),xx(a)].
% 2.03/2.37 9827 sk_c6 = sk_c4. [back_rewrite(9740),rewrite([9818(1),9826(5)]),flip(b),xx(a)].
% 2.03/2.37 9831 multiply(inverse(sk_c4),A) = multiply(sk_c9,A). [back_rewrite(9631),rewrite([9818(1),9826(2)]),unit_del(a,9824)].
% 2.03/2.37 9832 multiply(A,multiply(sk_c4,B)) = multiply(A,multiply(sk_c9,B)). [back_rewrite(9628),rewrite([9818(1),9826(2),9827(4)]),unit_del(a,9824)].
% 2.03/2.37 9833 multiply(sk_c9,multiply(sk_c9,A)) = A. [back_rewrite(9627),rewrite([9818(1),9826(2),9827(4),9831(8)]),unit_del(a,9824)].
% 2.03/2.37 9839 multiply(sk_c4,sk_c9) = sk_c8. [back_rewrite(9525),rewrite([9818(1),9826(2),9832(9),9833(9)]),unit_del(a,9824)].
% 2.03/2.37 9840 $F. [back_rewrite(9521),rewrite([9818(1),9826(2),9839(7),9073(6),9827(5)]),flip(b),merge(b),unit_del(a,9824)].
% 2.03/2.37
% 2.03/2.37 % SZS output end Refutation
% 2.03/2.37 ============================== end of proof ==========================
% 2.03/2.37
% 2.03/2.37 ============================== STATISTICS ============================
% 2.03/2.37
% 2.03/2.37 Given=453. Generated=31111. Kept=9839. proofs=1.
% 2.03/2.37 Usable=48. Sos=292. Demods=31. Limbo=22, Disabled=9517. Hints=0.
% 2.03/2.37 Megabytes=10.46.
% 2.03/2.37 User_CPU=1.32, System_CPU=0.02, Wall_clock=1.
% 2.03/2.37
% 2.03/2.37 ============================== end of statistics =====================
% 2.03/2.37
% 2.03/2.37 ============================== end of search =========================
% 2.03/2.37
% 2.03/2.37 THEOREM PROVED
% 2.03/2.37 % SZS status Unsatisfiable
% 2.03/2.37
% 2.03/2.37 Exiting with 1 proof.
% 2.03/2.37
% 2.03/2.37 Process 16126 exit (max_proofs) Tue Jun 14 03:18:56 2022
% 2.03/2.37 Prover9 interrupted
%------------------------------------------------------------------------------