TSTP Solution File: GRP329-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP329-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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:39 EDT 2022
% Result : Unsatisfiable 2.07s 2.39s
% Output : Refutation 2.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP329-1 : TPTP v8.1.0. Released v2.5.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 13 03:50:59 EDT 2022
% 0.14/0.34 % CPUTime :
% 2.07/2.39 ============================== Prover9 ===============================
% 2.07/2.39 Prover9 (32) version 2009-11A, November 2009.
% 2.07/2.39 Process 19031 was started by sandbox on n013.cluster.edu,
% 2.07/2.39 Mon Jun 13 03:50:59 2022
% 2.07/2.39 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_18878_n013.cluster.edu".
% 2.07/2.39 ============================== end of head ===========================
% 2.07/2.39
% 2.07/2.39 ============================== INPUT =================================
% 2.07/2.39
% 2.07/2.39 % Reading from file /tmp/Prover9_18878_n013.cluster.edu
% 2.07/2.39
% 2.07/2.39 set(prolog_style_variables).
% 2.07/2.39 set(auto2).
% 2.07/2.39 % set(auto2) -> set(auto).
% 2.07/2.39 % set(auto) -> set(auto_inference).
% 2.07/2.39 % set(auto) -> set(auto_setup).
% 2.07/2.39 % set(auto_setup) -> set(predicate_elim).
% 2.07/2.39 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.07/2.39 % set(auto) -> set(auto_limits).
% 2.07/2.39 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.07/2.39 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.07/2.39 % set(auto) -> set(auto_denials).
% 2.07/2.39 % set(auto) -> set(auto_process).
% 2.07/2.39 % set(auto2) -> assign(new_constants, 1).
% 2.07/2.39 % set(auto2) -> assign(fold_denial_max, 3).
% 2.07/2.39 % set(auto2) -> assign(max_weight, "200.000").
% 2.07/2.39 % set(auto2) -> assign(max_hours, 1).
% 2.07/2.39 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.07/2.39 % set(auto2) -> assign(max_seconds, 0).
% 2.07/2.39 % set(auto2) -> assign(max_minutes, 5).
% 2.07/2.39 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.07/2.39 % set(auto2) -> set(sort_initial_sos).
% 2.07/2.39 % set(auto2) -> assign(sos_limit, -1).
% 2.07/2.39 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.07/2.39 % set(auto2) -> assign(max_megs, 400).
% 2.07/2.39 % set(auto2) -> assign(stats, some).
% 2.07/2.39 % set(auto2) -> clear(echo_input).
% 2.07/2.39 % set(auto2) -> set(quiet).
% 2.07/2.39 % set(auto2) -> clear(print_initial_clauses).
% 2.07/2.39 % set(auto2) -> clear(print_given).
% 2.07/2.39 assign(lrs_ticks,-1).
% 2.07/2.39 assign(sos_limit,10000).
% 2.07/2.39 assign(order,kbo).
% 2.07/2.39 set(lex_order_vars).
% 2.07/2.39 clear(print_given).
% 2.07/2.39
% 2.07/2.39 % formulas(sos). % not echoed (46 formulas)
% 2.07/2.39
% 2.07/2.39 ============================== end of input ==========================
% 2.07/2.39
% 2.07/2.39 % From the command line: assign(max_seconds, 300).
% 2.07/2.39
% 2.07/2.39 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.07/2.39
% 2.07/2.39 % Formulas that are not ordinary clauses:
% 2.07/2.39
% 2.07/2.39 ============================== end of process non-clausal formulas ===
% 2.07/2.39
% 2.07/2.39 ============================== PROCESS INITIAL CLAUSES ===============
% 2.07/2.39
% 2.07/2.39 ============================== PREDICATE ELIMINATION =================
% 2.07/2.39
% 2.07/2.39 ============================== end predicate elimination =============
% 2.07/2.39
% 2.07/2.39 Auto_denials: (non-Horn, no changes).
% 2.07/2.39
% 2.07/2.39 Term ordering decisions:
% 2.07/2.39
% 2.07/2.39 % Assigning unary symbol inverse kb_weight 0 and highest precedence (13).
% 2.07/2.39 Function symbol KB weights: sk_c8=1. sk_c9=1. sk_c7=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.
% 2.07/2.39
% 2.07/2.39 ============================== end of process initial clauses ========
% 2.07/2.39
% 2.07/2.39 ============================== CLAUSES FOR SEARCH ====================
% 2.07/2.39
% 2.07/2.39 ============================== end of clauses for search =============
% 2.07/2.39
% 2.07/2.39 ============================== SEARCH ================================
% 2.07/2.39
% 2.07/2.39 % Starting search at 0.02 seconds.
% 2.07/2.39
% 2.07/2.39 Low Water (keep): wt=48.000, iters=3442
% 2.07/2.39
% 2.07/2.39 Low Water (keep): wt=47.000, iters=3354
% 2.07/2.39
% 2.07/2.39 Low Water (keep): wt=44.000, iters=3475
% 2.07/2.39
% 2.07/2.39 Low Water (keep): wt=43.000, iters=3366
% 2.07/2.39
% 2.07/2.39 Low Water (keep): wt=42.000, iters=3402
% 2.07/2.39
% 2.07/2.39 Low Water (keep): wt=40.000, iters=3394
% 2.07/2.39
% 2.07/2.39 Low Water (keep): wt=39.000, iters=3397
% 2.07/2.39
% 2.07/2.39 Low Water (keep): wt=37.000, iters=3384
% 2.07/2.39
% 2.07/2.39 Low Water (keep): wt=36.000, iters=3359
% 2.07/2.39
% 2.07/2.39 Low Water (keep): wt=35.000, iters=3334
% 2.07/2.39
% 2.07/2.39 Low Water (keep): wt=34.000, iters=3337
% 2.07/2.39
% 2.07/2.39 ============================== PROOF =================================
% 2.07/2.39 % SZS status Unsatisfiable
% 2.07/2.39 % SZS output start Refutation
% 2.07/2.39
% 2.07/2.39 % Proof 1 at 1.36 (+ 0.02) seconds.
% 2.07/2.39 % Length of proof is 112.
% 2.07/2.39 % Level of proof is 21.
% 2.07/2.39 % Maximum clause weight is 59.000.
% 2.07/2.39 % Given clauses 452.
% 2.07/2.39
% 2.07/2.39 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 2.07/2.39 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 2.07/2.39 5 inverse(sk_c1) = sk_c8 | inverse(sk_c5) = sk_c8 # label(prove_this_19) # label(negated_conjecture). [assumption].
% 2.07/2.39 7 inverse(sk_c2) = sk_c9 | inverse(sk_c8) = sk_c7 # label(prove_this_36) # label(negated_conjecture). [assumption].
% 2.07/2.39 10 inverse(sk_c2) = sk_c9 | inverse(sk_c6) = sk_c9 # label(prove_this_42) # label(negated_conjecture). [assumption].
% 2.07/2.39 11 multiply(sk_c8,sk_c9) = sk_c7 | inverse(sk_c8) = sk_c7 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 2.07/2.39 13 multiply(sk_c8,sk_c9) = sk_c7 | inverse(sk_c5) = sk_c8 # label(prove_this_5) # label(negated_conjecture). [assumption].
% 2.07/2.39 14 multiply(sk_c8,sk_c9) = sk_c7 | inverse(sk_c6) = sk_c9 # label(prove_this_7) # label(negated_conjecture). [assumption].
% 2.07/2.39 15 multiply(sk_c1,sk_c8) = sk_c9 | inverse(sk_c8) = sk_c7 # label(prove_this_8) # label(negated_conjecture). [assumption].
% 2.07/2.39 17 multiply(sk_c1,sk_c8) = sk_c9 | inverse(sk_c5) = sk_c8 # label(prove_this_12) # label(negated_conjecture). [assumption].
% 2.07/2.39 20 inverse(sk_c1) = sk_c8 | multiply(sk_c5,sk_c8) = sk_c9 # label(prove_this_18) # label(negated_conjecture). [assumption].
% 2.07/2.39 22 multiply(sk_c9,sk_c3) = sk_c8 | inverse(sk_c8) = sk_c7 # label(prove_this_22) # label(negated_conjecture). [assumption].
% 2.07/2.39 25 multiply(sk_c9,sk_c3) = sk_c8 | inverse(sk_c6) = sk_c9 # label(prove_this_28) # label(negated_conjecture). [assumption].
% 2.07/2.39 26 multiply(sk_c2,sk_c9) = sk_c3 | inverse(sk_c8) = sk_c7 # label(prove_this_29) # label(negated_conjecture). [assumption].
% 2.07/2.39 29 multiply(sk_c2,sk_c9) = sk_c3 | inverse(sk_c6) = sk_c9 # label(prove_this_35) # label(negated_conjecture). [assumption].
% 2.07/2.39 32 inverse(sk_c2) = sk_c9 | multiply(sk_c6,sk_c9) = sk_c7 # label(prove_this_41) # label(negated_conjecture). [assumption].
% 2.07/2.39 35 multiply(sk_c8,sk_c9) = sk_c7 | multiply(sk_c6,sk_c9) = sk_c7 # label(prove_this_6) # label(negated_conjecture). [assumption].
% 2.07/2.39 37 multiply(sk_c1,sk_c8) = sk_c9 | multiply(sk_c5,sk_c8) = sk_c9 # label(prove_this_11) # label(negated_conjecture). [assumption].
% 2.07/2.39 41 multiply(sk_c9,sk_c3) = sk_c8 | multiply(sk_c6,sk_c9) = sk_c7 # label(prove_this_27) # label(negated_conjecture). [assumption].
% 2.07/2.39 44 multiply(sk_c2,sk_c9) = sk_c3 | multiply(sk_c6,sk_c9) = sk_c7 # label(prove_this_34) # label(negated_conjecture). [assumption].
% 2.07/2.39 45 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 2.07/2.39 46 multiply(sk_c8,sk_c9) != sk_c7 | multiply(A,sk_c8) != sk_c9 | inverse(A) != sk_c8 | multiply(sk_c9,B) != sk_c8 | multiply(C,sk_c9) != B | inverse(C) != sk_c9 | inverse(sk_c8) != sk_c7 | multiply(D,sk_c8) != sk_c7 | inverse(D) != sk_c8 | multiply(E,sk_c8) != sk_c9 | inverse(E) != sk_c8 | multiply(F,sk_c9) != sk_c7 | inverse(F) != sk_c9 # label(prove_this_43) # label(negated_conjecture). [assumption].
% 2.07/2.39 49 multiply(sk_c8,sk_c9) != sk_c7 | multiply(A,sk_c8) != sk_c9 | inverse(A) != sk_c8 | multiply(sk_c9,B) != sk_c8 | multiply(C,sk_c9) != B | inverse(C) != sk_c9 | inverse(sk_c8) != sk_c7 | multiply(D,sk_c8) != sk_c7 | inverse(D) != sk_c8 | multiply(E,sk_c9) != sk_c7 | inverse(E) != sk_c9. [factor(46,b,j),merge(j)].
% 2.07/2.39 68 inverse(sk_c8) = sk_c7 | multiply(sk_c9,sk_c2) = identity. [para(7(a,1),2(a,1,1))].
% 2.07/2.39 71 inverse(sk_c2) = sk_c9 | multiply(sk_c9,sk_c6) = identity. [para(10(b,1),2(a,1,1))].
% 2.07/2.39 72 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),45(a,1,1)),rewrite([1(2)]),flip(a)].
% 2.07/2.39 73 inverse(sk_c8) = sk_c7 | multiply(sk_c8,multiply(sk_c9,A)) = multiply(sk_c7,A). [para(11(a,1),45(a,1,1)),flip(b)].
% 2.07/2.39 77 inverse(sk_c5) = sk_c8 | multiply(sk_c8,multiply(sk_c9,A)) = multiply(sk_c7,A). [para(13(a,1),45(a,1,1)),flip(b)].
% 2.07/2.39 79 inverse(sk_c6) = sk_c9 | multiply(sk_c8,multiply(sk_c9,A)) = multiply(sk_c7,A). [para(14(a,1),45(a,1,1)),flip(b)].
% 2.07/2.39 82 inverse(sk_c8) = sk_c7 | multiply(A,multiply(sk_c1,sk_c8)) = multiply(A,sk_c9). [para(15(a,1),45(a,2,2)),rewrite([45(8)])].
% 2.07/2.39 96 inverse(sk_c8) = sk_c7 | multiply(A,multiply(sk_c9,sk_c3)) = multiply(A,sk_c8). [para(22(a,1),45(a,2,2)),rewrite([45(8)])].
% 2.07/2.39 159 multiply(sk_c8,sk_c9) != sk_c7 | multiply(A,sk_c8) != sk_c9 | inverse(A) != sk_c8 | multiply(sk_c9,identity) != sk_c8 | inverse(inverse(sk_c9)) != sk_c9 | inverse(sk_c8) != sk_c7 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | multiply(C,sk_c9) != sk_c7 | inverse(C) != sk_c9. [resolve(49,e,2,a)].
% 2.07/2.39 176 multiply(sk_c8,sk_c9) != sk_c7 | identity != sk_c9 | inverse(inverse(sk_c8)) != sk_c8 | multiply(sk_c9,A) != sk_c8 | multiply(B,sk_c9) != A | inverse(B) != sk_c9 | inverse(sk_c8) != sk_c7 | multiply(C,sk_c8) != sk_c7 | inverse(C) != sk_c8 | multiply(D,sk_c9) != sk_c7 | inverse(D) != sk_c9. [para(2(a,1),49(b,1))].
% 2.07/2.39 282 multiply(sk_c8,sk_c9) != sk_c7 | multiply(A,sk_c8) != sk_c9 | inverse(A) != sk_c8 | multiply(sk_c9,identity) != sk_c8 | inverse(inverse(sk_c9)) != sk_c9 | inverse(sk_c8) != sk_c7 | multiply(A,sk_c8) != sk_c7 | multiply(B,sk_c9) != sk_c7 | inverse(B) != sk_c9. [factor(159,c,h)].
% 2.07/2.39 340 multiply(sk_c8,sk_c9) != sk_c7 | identity != sk_c9 | inverse(inverse(sk_c8)) != sk_c8 | multiply(sk_c9,A) != sk_c8 | multiply(B,sk_c9) != A | inverse(B) != sk_c9 | inverse(sk_c8) != sk_c7 | identity != sk_c7 | multiply(C,sk_c9) != sk_c7 | inverse(C) != sk_c9. [factor(176,c,i),rewrite([2(31)])].
% 2.07/2.39 579 multiply(sk_c8,sk_c9) != sk_c7 | identity != sk_c9 | inverse(inverse(sk_c8)) != sk_c8 | multiply(sk_c9,sk_c7) != sk_c8 | multiply(A,sk_c9) != sk_c7 | inverse(A) != sk_c9 | inverse(sk_c8) != sk_c7 | identity != sk_c7. [factor(340,e,i),merge(i)].
% 2.07/2.39 792 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),72(a,1,2))].
% 2.07/2.39 814 inverse(sk_c6) = sk_c9 | multiply(inverse(sk_c9),sk_c8) = sk_c3. [para(25(a,1),72(a,1,2))].
% 2.07/2.39 836 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(72(a,1),72(a,1,2))].
% 2.07/2.39 837 multiply(A,identity) = A. [back_rewrite(792),rewrite([836(4)])].
% 2.07/2.39 843 multiply(sk_c8,sk_c9) != sk_c7 | multiply(A,sk_c8) != sk_c9 | inverse(A) != sk_c8 | sk_c9 != sk_c8 | inverse(inverse(sk_c9)) != sk_c9 | inverse(sk_c8) != sk_c7 | multiply(A,sk_c8) != sk_c7 | multiply(B,sk_c9) != sk_c7 | inverse(B) != sk_c9. [back_rewrite(282),rewrite([837(15)])].
% 2.07/2.39 846 inverse(identity) = identity. [para(837(a,1),2(a,1))].
% 2.07/2.39 936 inverse(sk_c8) = sk_c7 | inverse(sk_c9) = sk_c2. [para(68(b,1),72(a,1,2)),rewrite([837(8)])].
% 2.07/2.39 957 inverse(sk_c8) = sk_c7 | multiply(sk_c2,sk_c9) = identity. [para(936(b,1),2(a,1,1))].
% 2.07/2.39 986 multiply(sk_c8,sk_c9) != sk_c7 | identity != sk_c9 | inverse(inverse(sk_c8)) != sk_c8 | multiply(sk_c9,sk_c7) != sk_c8 | identity != sk_c7 | inverse(inverse(sk_c9)) != sk_c9 | inverse(sk_c8) != sk_c7. [para(2(a,1),579(e,1)),merge(h)].
% 2.07/2.39 1002 inverse(sk_c2) = sk_c9 | inverse(sk_c9) = sk_c6. [para(71(b,1),72(a,1,2)),rewrite([837(8)])].
% 2.07/2.39 1004 inverse(sk_c9) = sk_c6 | multiply(sk_c9,sk_c2) = identity. [para(1002(a,1),2(a,1,1))].
% 2.07/2.39 1012 multiply(A,inverse(A)) = identity. [para(836(a,1),2(a,1))].
% 2.07/2.39 1050 inverse(inverse(A)) = A. [para(836(a,1),837(a,1)),rewrite([837(2)]),flip(a)].
% 2.07/2.39 1064 multiply(sk_c8,sk_c9) != sk_c7 | identity != sk_c9 | multiply(sk_c9,sk_c7) != sk_c8 | identity != sk_c7 | inverse(sk_c8) != sk_c7. [back_rewrite(986),rewrite([1050(11),1050(22)]),xx(c),xx(f)].
% 2.07/2.39 1070 multiply(sk_c8,sk_c9) != sk_c7 | multiply(A,sk_c8) != sk_c9 | inverse(A) != sk_c8 | sk_c9 != sk_c8 | inverse(sk_c8) != sk_c7 | multiply(A,sk_c8) != sk_c7 | multiply(B,sk_c9) != sk_c7 | inverse(B) != sk_c9. [back_rewrite(843),rewrite([1050(18)]),xx(e)].
% 2.07/2.39 1111 inverse(sk_c1) = sk_c8 | multiply(sk_c5,sk_c8) = identity. [para(5(b,1),1012(a,1,2))].
% 2.07/2.39 1132 inverse(sk_c8) = sk_c7 | multiply(sk_c7,inverse(sk_c9)) = sk_c8. [para(1012(a,1),73(b,1,2)),rewrite([837(7)]),flip(b)].
% 2.07/2.39 1342 inverse(sk_c5) = sk_c8 | multiply(sk_c7,inverse(sk_c9)) = sk_c8. [para(1012(a,1),77(b,1,2)),rewrite([837(7)]),flip(b)].
% 2.07/2.39 1497 inverse(sk_c6) = sk_c9 | multiply(sk_c7,inverse(sk_c9)) = sk_c8. [para(1012(a,1),79(b,1,2)),rewrite([837(7)]),flip(b)].
% 2.07/2.39 1620 inverse(sk_c8) = sk_c7 | identity = sk_c3. [para(957(b,1),26(a,1)),merge(c)].
% 2.07/2.39 1802 inverse(sk_c8) = sk_c7 | multiply(inverse(multiply(sk_c1,sk_c8)),sk_c9) = identity. [para(82(b,1),2(a,1))].
% 2.07/2.39 1854 inverse(sk_c1) = sk_c8 | identity = sk_c9. [para(1111(b,1),20(b,1)),merge(b)].
% 2.07/2.39 1946 identity = sk_c9 | multiply(sk_c1,sk_c8) = identity. [para(1854(a,1),1012(a,1,2))].
% 2.07/2.39 2182 identity = sk_c9 | inverse(sk_c5) = sk_c8. [para(1946(b,1),17(a,1)),merge(b)].
% 2.07/2.39 2265 identity = sk_c9 | multiply(sk_c5,sk_c8) = identity. [para(2182(b,1),1012(a,1,2))].
% 2.07/2.39 3632 identity = sk_c9 | multiply(sk_c1,sk_c8) = sk_c9. [para(2265(b,1),37(b,1)),merge(c)].
% 2.07/2.39 5277 inverse(sk_c8) = sk_c7 | multiply(sk_c1,multiply(sk_c9,sk_c3)) = sk_c9. [para(15(a,1),96(b,2)),merge(b)].
% 2.07/2.39 5552 multiply(sk_c8,sk_c9) != sk_c7 | sk_c9 != sk_c8 | identity != sk_c8 | inverse(sk_c8) != sk_c7 | sk_c7 != sk_c8 | multiply(A,sk_c9) != sk_c7 | inverse(A) != sk_c9. [para(1(a,1),1070(f,1)),rewrite([1(8),846(10)]),flip(b),flip(f),merge(d)].
% 2.07/2.39 5574 multiply(sk_c8,sk_c9) != sk_c7 | sk_c9 != sk_c8 | identity != sk_c8 | inverse(sk_c8) != sk_c7 | sk_c7 != sk_c8 | multiply(A,multiply(B,sk_c9)) != sk_c7 | inverse(multiply(A,B)) != sk_c9. [para(45(a,1),5552(f,1))].
% 2.07/2.39 5703 multiply(sk_c8,sk_c9) != sk_c7 | sk_c9 != sk_c8 | identity != sk_c8 | inverse(sk_c8) != sk_c7 | sk_c7 != sk_c8 | sk_c7 != A | inverse(multiply(A,inverse(sk_c9))) != sk_c9. [para(2(a,1),5574(f,1,2)),rewrite([837(20)]),flip(f)].
% 2.07/2.39 5820 identity = sk_c9. [para(3632(b,1),1946(b,1)),flip(c),merge(b),merge(c)].
% 2.07/2.39 5907 multiply(sk_c8,sk_c9) != sk_c7 | sk_c9 != sk_c8 | inverse(sk_c8) != sk_c7 | sk_c7 != sk_c8 | sk_c7 != A | inverse(multiply(A,inverse(sk_c9))) != sk_c9. [back_rewrite(5703),rewrite([5820(9)]),merge(c)].
% 2.07/2.39 7415 inverse(sk_c8) = sk_c7 | multiply(inverse(multiply(sk_c1,sk_c8)),sk_c9) = sk_c9. [back_rewrite(1802),rewrite([5820(11)])].
% 2.07/2.39 7490 inverse(sk_c8) = sk_c7 | sk_c3 = sk_c9. [back_rewrite(1620),rewrite([5820(5)]),flip(b)].
% 2.07/2.39 7739 multiply(sk_c8,sk_c9) != sk_c7 | multiply(sk_c9,sk_c7) != sk_c8 | sk_c7 != sk_c9 | inverse(sk_c8) != sk_c7. [back_rewrite(1064),rewrite([5820(6),5820(14)]),flip(d),xx(b)].
% 2.07/2.39 7741 inverse(sk_c9) = sk_c6 | multiply(sk_c9,sk_c2) = sk_c9. [back_rewrite(1004),rewrite([5820(8)])].
% 2.07/2.39 7748 inverse(sk_c9) = sk_c9. [back_rewrite(846),rewrite([5820(1),5820(3)])].
% 2.07/2.39 7749 multiply(A,sk_c9) = A. [back_rewrite(837),rewrite([5820(1)])].
% 2.07/2.39 7759 multiply(sk_c9,A) = A. [back_rewrite(1),rewrite([5820(1)])].
% 2.07/2.39 7899 sk_c6 = sk_c9 | sk_c2 = sk_c9. [back_rewrite(7741),rewrite([7748(2),7759(6)]),flip(a)].
% 2.07/2.39 7925 sk_c7 != sk_c8 | sk_c9 != sk_c8 | inverse(sk_c8) != sk_c7 | sk_c7 != A | inverse(A) != sk_c9. [back_rewrite(5907),rewrite([7749(3),7748(17),7749(17)]),flip(a),merge(d)].
% 2.07/2.39 7941 inverse(sk_c6) = sk_c9 | sk_c7 = sk_c8. [back_rewrite(1497),rewrite([7748(7),7749(7)])].
% 2.07/2.39 7943 inverse(sk_c5) = sk_c8 | sk_c7 = sk_c8. [back_rewrite(1342),rewrite([7748(7),7749(7)])].
% 2.07/2.39 7951 inverse(sk_c8) = sk_c7 | sk_c7 = sk_c8. [back_rewrite(1132),rewrite([7748(7),7749(7)])].
% 2.07/2.39 7965 inverse(sk_c6) = sk_c9 | sk_c3 = sk_c8. [back_rewrite(814),rewrite([7748(6),7759(7)]),flip(b)].
% 2.07/2.39 7969 sk_c7 != sk_c8 | sk_c7 != sk_c9 | inverse(sk_c8) != sk_c7. [back_rewrite(7739),rewrite([7749(3),7759(6)]),flip(a),merge(b)].
% 2.07/2.39 7983 inverse(sk_c8) = sk_c7 | inverse(multiply(sk_c1,sk_c8)) = sk_c9. [back_rewrite(7415),rewrite([7749(10)])].
% 2.07/2.39 8268 sk_c3 = sk_c2 | sk_c6 = sk_c7. [back_rewrite(44),rewrite([7749(3),7749(6)]),flip(a)].
% 2.07/2.39 8271 sk_c3 = sk_c8 | sk_c6 = sk_c7. [back_rewrite(41),rewrite([7759(3),7749(6)])].
% 2.07/2.39 8273 sk_c7 = sk_c8 | sk_c6 = sk_c7. [back_rewrite(35),rewrite([7749(3),7749(6)]),flip(a)].
% 2.07/2.39 8276 inverse(sk_c2) = sk_c9 | sk_c6 = sk_c7. [back_rewrite(32),rewrite([7749(7)])].
% 2.07/2.39 8277 sk_c3 = sk_c2 | inverse(sk_c6) = sk_c9. [back_rewrite(29),rewrite([7749(3)]),flip(a)].
% 2.07/2.39 8318 inverse(sk_c8) = sk_c7 | multiply(sk_c1,sk_c3) = sk_c9. [back_rewrite(5277),rewrite([7759(8)])].
% 2.07/2.39 8515 sk_c7 != sk_c8 | sk_c9 != sk_c8 | inverse(sk_c8) != sk_c7 | inverse(A) != sk_c7 | sk_c9 != A. [para(1050(a,1),7925(e,1)),flip(d),flip(e)].
% 2.07/2.39 8525 sk_c7 != sk_c8 | sk_c9 != sk_c8 | inverse(sk_c8) != sk_c7. [factor(8515,b,e),merge(d)].
% 2.07/2.39 8622 sk_c3 = sk_c9 | sk_c7 != sk_c8 | sk_c7 != sk_c9. [resolve(7490,a,7969,c)].
% 2.07/2.39 8705 sk_c7 = sk_c8 | sk_c6 = sk_c9. [para(7941(a,1),1050(a,1,1)),rewrite([7748(5)]),flip(b)].
% 2.07/2.39 8711 sk_c7 = sk_c8 | sk_c7 = sk_c9. [para(8705(b,1),8273(b,1)),flip(c),merge(b)].
% 2.07/2.39 8719 sk_c7 = sk_c8 | inverse(sk_c8) = sk_c5. [para(7943(a,1),1050(a,1,1))].
% 2.07/2.39 9178 sk_c3 = sk_c8 | sk_c6 = sk_c9. [para(7965(a,1),1050(a,1,1)),rewrite([7748(5)]),flip(b)].
% 2.07/2.39 9182 sk_c3 = sk_c8 | sk_c7 = sk_c9. [para(9178(b,1),8271(b,1)),flip(c),merge(b)].
% 2.07/2.39 9439 sk_c6 = sk_c7 | sk_c2 = sk_c9. [para(8276(a,1),1050(a,1,1)),rewrite([7748(5)]),flip(b)].
% 2.07/2.39 9447 sk_c2 = sk_c9 | sk_c7 = sk_c9. [para(9439(a,1),7899(a,1)),merge(c)].
% 2.07/2.39 9525 sk_c3 = sk_c2 | sk_c6 = sk_c9. [para(8277(b,1),1050(a,1,1)),rewrite([7748(5)]),flip(b)].
% 2.07/2.39 9527 sk_c3 = sk_c2 | sk_c7 = sk_c9. [para(9525(b,1),8268(b,1)),flip(c),merge(b)].
% 2.07/2.39 9528 sk_c7 = sk_c9 | sk_c2 = sk_c8. [para(9527(a,1),9182(a,1)),merge(c)].
% 2.07/2.39 9536 sk_c7 = sk_c9 | sk_c9 = sk_c8. [para(9528(b,1),9447(a,1)),flip(b),merge(c)].
% 2.07/2.39 9862 sk_c7 = sk_c8 | sk_c5 = sk_c7. [para(8719(b,1),7951(a,1)),merge(c)].
% 2.07/2.39 9967 sk_c7 = sk_c8 | sk_c5 = sk_c9. [para(8711(b,1),9862(b,2)),merge(b)].
% 2.07/2.39 9972 sk_c7 = sk_c8 | sk_c9 = sk_c8. [para(9967(b,1),7943(a,1,1)),rewrite([7748(5)]),merge(c)].
% 2.07/2.39 9997 sk_c9 = sk_c8. [para(9972(a,1),9536(a,1)),flip(b),merge(b),merge(c)].
% 2.07/2.39 10977 sk_c7 = sk_c8. [back_rewrite(8711),rewrite([9997(5)]),merge(b)].
% 2.07/2.39 11031 sk_c3 = sk_c8. [back_rewrite(8622),rewrite([9997(2),10977(4),10977(7),9997(8)]),xx(b),xx(c)].
% 2.07/2.39 11099 inverse(sk_c8) != sk_c8. [back_rewrite(8525),rewrite([10977(1),9997(4),10977(9)]),xx(a),xx(b)].
% 2.07/2.39 11114 multiply(sk_c1,sk_c8) = sk_c8. [back_rewrite(8318),rewrite([10977(3),11031(6),9997(8)]),unit_del(a,11099)].
% 2.07/2.39 11135 $F. [back_rewrite(7983),rewrite([10977(3),11114(7),9997(7)]),merge(b),unit_del(a,11099)].
% 2.07/2.39
% 2.07/2.39 % SZS output end Refutation
% 2.07/2.39 ============================== end of proof ==========================
% 2.07/2.39
% 2.07/2.39 ============================== STATISTICS ============================
% 2.07/2.39
% 2.07/2.39 Given=452. Generated=27971. Kept=11134. proofs=1.
% 2.07/2.39 Usable=95. Sos=428. Demods=22. Limbo=1138, Disabled=9519. Hints=0.
% 2.07/2.39 Megabytes=11.25.
% 2.07/2.39 User_CPU=1.36, System_CPU=0.02, Wall_clock=2.
% 2.07/2.39
% 2.07/2.39 ============================== end of statistics =====================
% 2.07/2.39
% 2.07/2.39 ============================== end of search =========================
% 2.07/2.39
% 2.07/2.39 THEOREM PROVED
% 2.07/2.39 % SZS status Unsatisfiable
% 2.07/2.39
% 2.07/2.39 Exiting with 1 proof.
% 2.07/2.39
% 2.07/2.39 Process 19031 exit (max_proofs) Mon Jun 13 03:51:01 2022
% 2.07/2.39 Prover9 interrupted
%------------------------------------------------------------------------------