TSTP Solution File: GRP389-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP389-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n009.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.07s 2.35s
% Output : Refutation 2.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP389-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 19:24:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.07/2.35 ============================== Prover9 ===============================
% 2.07/2.35 Prover9 (32) version 2009-11A, November 2009.
% 2.07/2.35 Process 6212 was started by sandbox2 on n009.cluster.edu,
% 2.07/2.35 Mon Jun 13 19:24:38 2022
% 2.07/2.35 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_6058_n009.cluster.edu".
% 2.07/2.35 ============================== end of head ===========================
% 2.07/2.35
% 2.07/2.35 ============================== INPUT =================================
% 2.07/2.35
% 2.07/2.35 % Reading from file /tmp/Prover9_6058_n009.cluster.edu
% 2.07/2.35
% 2.07/2.35 set(prolog_style_variables).
% 2.07/2.35 set(auto2).
% 2.07/2.35 % set(auto2) -> set(auto).
% 2.07/2.35 % set(auto) -> set(auto_inference).
% 2.07/2.35 % set(auto) -> set(auto_setup).
% 2.07/2.35 % set(auto_setup) -> set(predicate_elim).
% 2.07/2.35 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.07/2.35 % set(auto) -> set(auto_limits).
% 2.07/2.35 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.07/2.35 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.07/2.35 % set(auto) -> set(auto_denials).
% 2.07/2.35 % set(auto) -> set(auto_process).
% 2.07/2.35 % set(auto2) -> assign(new_constants, 1).
% 2.07/2.35 % set(auto2) -> assign(fold_denial_max, 3).
% 2.07/2.35 % set(auto2) -> assign(max_weight, "200.000").
% 2.07/2.35 % set(auto2) -> assign(max_hours, 1).
% 2.07/2.35 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.07/2.35 % set(auto2) -> assign(max_seconds, 0).
% 2.07/2.35 % set(auto2) -> assign(max_minutes, 5).
% 2.07/2.35 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.07/2.35 % set(auto2) -> set(sort_initial_sos).
% 2.07/2.35 % set(auto2) -> assign(sos_limit, -1).
% 2.07/2.35 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.07/2.35 % set(auto2) -> assign(max_megs, 400).
% 2.07/2.35 % set(auto2) -> assign(stats, some).
% 2.07/2.35 % set(auto2) -> clear(echo_input).
% 2.07/2.35 % set(auto2) -> set(quiet).
% 2.07/2.35 % set(auto2) -> clear(print_initial_clauses).
% 2.07/2.35 % set(auto2) -> clear(print_given).
% 2.07/2.35 assign(lrs_ticks,-1).
% 2.07/2.35 assign(sos_limit,10000).
% 2.07/2.35 assign(order,kbo).
% 2.07/2.35 set(lex_order_vars).
% 2.07/2.35 clear(print_given).
% 2.07/2.35
% 2.07/2.35 % formulas(sos). % not echoed (58 formulas)
% 2.07/2.35
% 2.07/2.35 ============================== end of input ==========================
% 2.07/2.35
% 2.07/2.35 % From the command line: assign(max_seconds, 300).
% 2.07/2.35
% 2.07/2.35 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.07/2.35
% 2.07/2.35 % Formulas that are not ordinary clauses:
% 2.07/2.35
% 2.07/2.35 ============================== end of process non-clausal formulas ===
% 2.07/2.35
% 2.07/2.35 ============================== PROCESS INITIAL CLAUSES ===============
% 2.07/2.35
% 2.07/2.35 ============================== PREDICATE ELIMINATION =================
% 2.07/2.35
% 2.07/2.35 ============================== end predicate elimination =============
% 2.07/2.35
% 2.07/2.35 Auto_denials: (non-Horn, no changes).
% 2.07/2.35
% 2.07/2.35 Term ordering decisions:
% 2.07/2.35
% 2.07/2.35 % Assigning unary symbol inverse kb_weight 0 and highest precedence (15).
% 2.07/2.35 Function symbol KB weights: sk_c10=1. sk_c11=1. sk_c9=1. sk_c3=1. sk_c1=1. sk_c2=1. sk_c8=1. sk_c4=1. sk_c5=1. sk_c6=1. sk_c7=1. identity=1. multiply=1. inverse=0.
% 2.07/2.35
% 2.07/2.35 ============================== end of process initial clauses ========
% 2.07/2.35
% 2.07/2.35 ============================== CLAUSES FOR SEARCH ====================
% 2.07/2.35
% 2.07/2.35 ============================== end of clauses for search =============
% 2.07/2.35
% 2.07/2.35 ============================== SEARCH ================================
% 2.07/2.35
% 2.07/2.35 % Starting search at 0.04 seconds.
% 2.07/2.35
% 2.07/2.35 Low Water (keep): wt=53.000, iters=3642
% 2.07/2.35
% 2.07/2.35 Low Water (keep): wt=49.000, iters=3627
% 2.07/2.35
% 2.07/2.35 Low Water (keep): wt=41.000, iters=3390
% 2.07/2.35
% 2.07/2.35 Low Water (keep): wt=39.000, iters=3540
% 2.07/2.35
% 2.07/2.35 Low Water (keep): wt=37.000, iters=3461
% 2.07/2.35
% 2.07/2.35 Low Water (keep): wt=35.000, iters=3399
% 2.07/2.35
% 2.07/2.35 Low Water (keep): wt=34.000, iters=3354
% 2.07/2.35
% 2.07/2.35 Low Water (keep): wt=33.000, iters=3342
% 2.07/2.35
% 2.07/2.35 Low Water (keep): wt=32.000, iters=3345
% 2.07/2.35
% 2.07/2.35 Low Water (keep): wt=31.000, iters=3348
% 2.07/2.35
% 2.07/2.35 Low Water (keep): wt=30.000, iters=3352
% 2.07/2.35
% 2.07/2.35 ============================== PROOF =================================
% 2.07/2.35 % SZS status Unsatisfiable
% 2.07/2.35 % SZS output start Refutation
% 2.07/2.35
% 2.07/2.35 % Proof 1 at 1.34 (+ 0.03) seconds.
% 2.07/2.35 % Length of proof is 96.
% 2.07/2.35 % Level of proof is 23.
% 2.07/2.35 % Maximum clause weight is 68.000.
% 2.07/2.35 % Given clauses 482.
% 2.07/2.35
% 2.07/2.35 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 2.07/2.35 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 2.07/2.35 3 inverse(sk_c10) = sk_c9 | inverse(sk_c4) = sk_c11 # label(prove_this_2) # label(negated_conjecture). [assumption].
% 2.07/2.35 4 inverse(sk_c10) = sk_c9 | inverse(sk_c5) = sk_c10 # label(prove_this_4) # label(negated_conjecture). [assumption].
% 2.07/2.35 7 inverse(sk_c1) = sk_c11 | inverse(sk_c4) = sk_c11 # label(prove_this_11) # label(negated_conjecture). [assumption].
% 2.07/2.35 9 inverse(sk_c1) = sk_c11 | inverse(sk_c6) = sk_c11 # label(prove_this_14) # label(negated_conjecture). [assumption].
% 2.07/2.35 14 inverse(sk_c2) = sk_c3 | inverse(sk_c7) = sk_c8 # label(prove_this_44) # label(negated_conjecture). [assumption].
% 2.07/2.35 15 inverse(sk_c10) = sk_c9 | multiply(sk_c4,sk_c11) = sk_c10 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 2.07/2.35 16 inverse(sk_c10) = sk_c9 | multiply(sk_c5,sk_c10) = sk_c9 # label(prove_this_3) # label(negated_conjecture). [assumption].
% 2.07/2.35 20 inverse(sk_c1) = sk_c11 | multiply(sk_c4,sk_c11) = sk_c10 # label(prove_this_10) # label(negated_conjecture). [assumption].
% 2.07/2.35 22 inverse(sk_c1) = sk_c11 | multiply(sk_c6,sk_c10) = sk_c11 # label(prove_this_15) # label(negated_conjecture). [assumption].
% 2.07/2.35 27 multiply(sk_c1,sk_c10) = sk_c11 | inverse(sk_c6) = sk_c11 # label(prove_this_23) # label(negated_conjecture). [assumption].
% 2.07/2.35 29 multiply(sk_c2,sk_c3) = sk_c10 | inverse(sk_c4) = sk_c11 # label(prove_this_29) # label(negated_conjecture). [assumption].
% 2.07/2.35 30 multiply(sk_c2,sk_c3) = sk_c10 | inverse(sk_c5) = sk_c10 # label(prove_this_31) # label(negated_conjecture). [assumption].
% 2.07/2.35 36 inverse(sk_c2) = sk_c3 | multiply(sk_c7,sk_c8) = sk_c10 # label(prove_this_43) # label(negated_conjecture). [assumption].
% 2.07/2.35 44 multiply(sk_c1,sk_c10) = sk_c11 | multiply(sk_c6,sk_c10) = sk_c11 # label(prove_this_24) # label(negated_conjecture). [assumption].
% 2.07/2.35 47 multiply(sk_c2,sk_c3) = sk_c10 | multiply(sk_c4,sk_c11) = sk_c10 # label(prove_this_28) # label(negated_conjecture). [assumption].
% 2.07/2.35 57 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 2.07/2.35 58 inverse(sk_c10) != sk_c9 | inverse(A) != sk_c11 | multiply(A,sk_c10) != sk_c11 | multiply(B,C) != sk_c10 | inverse(B) != C | multiply(C,sk_c9) != sk_c10 | 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.07/2.35 62 inverse(sk_c10) != sk_c9 | inverse(A) != sk_c11 | multiply(A,sk_c10) != sk_c11 | multiply(B,C) != sk_c10 | inverse(B) != C | multiply(C,sk_c9) != sk_c10 | multiply(D,sk_c11) != sk_c10 | inverse(D) != sk_c11 | multiply(E,sk_c10) != sk_c9 | inverse(E) != sk_c10 | multiply(F,V6) != sk_c10 | inverse(F) != V6 | multiply(V6,sk_c9) != sk_c10. [factor(58,b,k),merge(k)].
% 2.07/2.35 73 inverse(sk_c10) != sk_c9 | inverse(A) != sk_c11 | multiply(A,sk_c10) != sk_c11 | multiply(B,C) != sk_c10 | inverse(B) != C | multiply(C,sk_c9) != sk_c10 | multiply(D,sk_c11) != sk_c10 | inverse(D) != sk_c11 | multiply(E,sk_c10) != sk_c9 | inverse(E) != sk_c10. [factor(62,d,k),merge(k),merge(l)].
% 2.07/2.35 88 inverse(sk_c10) = sk_c9 | multiply(sk_c11,sk_c4) = identity. [para(3(b,1),2(a,1,1))].
% 2.07/2.35 89 inverse(sk_c10) = sk_c9 | multiply(sk_c10,sk_c5) = identity. [para(4(b,1),2(a,1,1))].
% 2.07/2.35 92 inverse(sk_c1) = sk_c11 | multiply(sk_c11,sk_c4) = identity. [para(7(b,1),2(a,1,1))].
% 2.07/2.35 94 inverse(sk_c1) = sk_c11 | multiply(sk_c11,sk_c6) = identity. [para(9(b,1),2(a,1,1))].
% 2.07/2.35 99 inverse(sk_c2) = sk_c3 | multiply(sk_c8,sk_c7) = identity. [para(14(b,1),2(a,1,1))].
% 2.07/2.35 100 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),57(a,1,1)),rewrite([1(2)]),flip(a)].
% 2.07/2.35 111 inverse(sk_c1) = sk_c11 | multiply(sk_c4,multiply(sk_c11,A)) = multiply(sk_c10,A). [para(20(b,1),57(a,1,1)),flip(b)].
% 2.07/2.35 112 inverse(sk_c1) = sk_c11 | multiply(A,multiply(sk_c4,sk_c11)) = multiply(A,sk_c10). [para(20(b,1),57(a,2,2)),rewrite([57(8)])].
% 2.07/2.35 115 inverse(sk_c1) = sk_c11 | multiply(sk_c6,multiply(sk_c10,A)) = multiply(sk_c11,A). [para(22(b,1),57(a,1,1)),flip(b)].
% 2.07/2.35 125 inverse(sk_c6) = sk_c11 | multiply(sk_c1,multiply(sk_c10,A)) = multiply(sk_c11,A). [para(27(a,1),57(a,1,1)),flip(b)].
% 2.07/2.35 240 inverse(sk_c10) != sk_c9 | inverse(A) != sk_c11 | multiply(A,sk_c10) != sk_c11 | multiply(B,C) != sk_c10 | inverse(B) != C | multiply(C,sk_c9) != sk_c10 | identity != sk_c10 | inverse(inverse(sk_c11)) != sk_c11 | multiply(D,sk_c10) != sk_c9 | inverse(D) != sk_c10. [para(2(a,1),73(g,1))].
% 2.07/2.35 429 inverse(sk_c10) != sk_c9 | inverse(inverse(sk_c11)) != sk_c11 | multiply(inverse(sk_c11),sk_c10) != sk_c11 | multiply(A,B) != sk_c10 | inverse(A) != B | multiply(B,sk_c9) != sk_c10 | identity != sk_c10 | multiply(C,sk_c10) != sk_c9 | inverse(C) != sk_c10. [factor(240,b,h)].
% 2.07/2.35 788 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),100(a,1,2))].
% 2.07/2.35 845 inverse(sk_c10) = sk_c9 | multiply(inverse(sk_c11),identity) = sk_c4. [para(88(b,1),100(a,1,2))].
% 2.07/2.35 846 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(100(a,1),100(a,1,2))].
% 2.07/2.35 847 multiply(A,identity) = A. [back_rewrite(788),rewrite([846(4)])].
% 2.07/2.35 848 inverse(sk_c10) = sk_c9 | inverse(sk_c11) = sk_c4. [back_rewrite(845),rewrite([847(8)])].
% 2.07/2.35 854 inverse(identity) = identity. [para(847(a,1),2(a,1))].
% 2.07/2.35 906 inverse(sk_c10) = sk_c9 | multiply(sk_c4,sk_c11) = identity. [para(848(b,1),2(a,1,1))].
% 2.07/2.35 909 inverse(sk_c10) = sk_c9 | inverse(sk_c10) = sk_c5. [para(89(b,1),100(a,1,2)),rewrite([847(8)])].
% 2.07/2.35 910 inverse(sk_c10) = sk_c9 | multiply(sk_c5,sk_c10) = identity. [para(909(b,1),2(a,1,1))].
% 2.07/2.35 978 inverse(sk_c1) = sk_c11 | inverse(sk_c11) = sk_c4. [para(92(b,1),100(a,1,2)),rewrite([847(8)])].
% 2.07/2.35 1013 inverse(sk_c1) = sk_c11 | inverse(sk_c11) = sk_c6. [para(94(b,1),100(a,1,2)),rewrite([847(8)])].
% 2.07/2.35 1093 inverse(sk_c2) = sk_c3 | inverse(sk_c8) = sk_c7. [para(99(b,1),100(a,1,2)),rewrite([847(8)])].
% 2.07/2.35 1108 inverse(sk_c2) = sk_c3 | multiply(sk_c7,sk_c8) = identity. [para(1093(b,1),2(a,1,1))].
% 2.07/2.35 1110 multiply(A,inverse(A)) = identity. [para(846(a,1),2(a,1))].
% 2.07/2.35 1153 inverse(inverse(A)) = A. [para(846(a,1),847(a,1)),rewrite([847(2)]),flip(a)].
% 2.07/2.35 1193 inverse(sk_c10) != sk_c9 | multiply(inverse(sk_c11),sk_c10) != sk_c11 | multiply(A,B) != sk_c10 | inverse(A) != B | multiply(B,sk_c9) != sk_c10 | identity != sk_c10 | multiply(C,sk_c10) != sk_c9 | inverse(C) != sk_c10. [back_rewrite(429),rewrite([1153(7)]),xx(b)].
% 2.07/2.35 1199 inverse(sk_c10) != sk_c9 | inverse(A) != sk_c11 | multiply(A,sk_c10) != sk_c11 | multiply(B,C) != sk_c10 | inverse(B) != C | multiply(C,sk_c9) != sk_c10 | identity != sk_c10 | multiply(D,sk_c10) != sk_c9 | inverse(D) != sk_c10. [back_rewrite(240),rewrite([1153(26)]),xx(h)].
% 2.07/2.35 1432 inverse(sk_c10) = sk_c9 | identity = sk_c10. [para(906(b,1),15(b,1)),merge(b)].
% 2.07/2.35 1489 inverse(sk_c10) = sk_c9 | identity = sk_c9. [para(910(b,1),16(b,1)),merge(b)].
% 2.07/2.35 2145 inverse(sk_c2) = sk_c3 | identity = sk_c10. [para(1108(b,1),36(b,1)),merge(b)].
% 2.07/2.35 2155 identity = sk_c10 | multiply(sk_c2,sk_c3) = identity. [para(2145(a,1),1110(a,1,2))].
% 2.07/2.35 2170 inverse(sk_c1) = sk_c11 | multiply(sk_c4,multiply(sk_c11,multiply(sk_c4,sk_c11))) = multiply(sk_c10,sk_c10). [para(112(b,1),111(b,2)),merge(b)].
% 2.07/2.35 2302 identity = sk_c10 | inverse(sk_c4) = sk_c11. [para(2155(b,1),29(a,1)),merge(b)].
% 2.07/2.35 2303 identity = sk_c10 | inverse(sk_c5) = sk_c10. [para(2155(b,1),30(a,1)),merge(b)].
% 2.07/2.35 2310 identity = sk_c10 | multiply(sk_c4,sk_c11) = identity. [para(2302(b,1),1110(a,1,2))].
% 2.07/2.35 2394 identity = sk_c10 | inverse(sk_c10) = sk_c5. [para(2303(b,1),1153(a,1,1))].
% 2.07/2.35 2537 identity = sk_c10 | sk_c5 = sk_c9. [para(2394(b,1),1432(a,1)),merge(c)].
% 2.07/2.35 2542 sk_c5 = sk_c9 | inverse(sk_c10) = identity. [para(2537(a,1),854(a,1,1))].
% 2.07/2.35 2573 inverse(sk_c1) = sk_c11 | multiply(A,multiply(sk_c6,multiply(sk_c10,B))) = multiply(A,multiply(sk_c11,B)). [para(115(b,1),57(a,2,2)),rewrite([57(9)])].
% 2.07/2.35 2605 inverse(sk_c1) = sk_c11 | multiply(sk_c6,multiply(sk_c10,sk_c10)) = multiply(sk_c11,multiply(sk_c4,sk_c11)). [para(112(b,1),115(b,1,2)),merge(b)].
% 2.07/2.35 2959 sk_c5 = sk_c9 | identity = sk_c9. [para(2542(b,1),1489(a,1)),merge(c)].
% 2.07/2.35 2995 sk_c5 = sk_c9 | sk_c9 = sk_c10. [para(2959(b,1),2537(a,1)),merge(c)].
% 2.07/2.35 3097 sk_c9 = sk_c10 | inverse(sk_c10) = sk_c9. [para(2995(a,1),909(b,2)),merge(c)].
% 2.07/2.35 4205 identity = sk_c10 | multiply(sk_c2,sk_c3) = sk_c10. [para(2310(b,1),47(b,1)),merge(c)].
% 2.07/2.35 4218 inverse(sk_c6) = sk_c11 | multiply(sk_c11,inverse(sk_c10)) = sk_c1. [para(1110(a,1),125(b,1,2)),rewrite([847(7)]),flip(b)].
% 2.07/2.35 7068 identity = sk_c10. [para(4205(b,1),2155(b,1)),flip(c),merge(b),merge(c)].
% 2.07/2.35 9063 inverse(sk_c10) != sk_c9 | inverse(A) != sk_c11 | multiply(A,sk_c10) != sk_c11 | multiply(B,C) != sk_c10 | inverse(B) != C | multiply(C,sk_c9) != sk_c10 | multiply(D,sk_c10) != sk_c9 | inverse(D) != sk_c10. [back_rewrite(1199),rewrite([7068(21)]),xx(g)].
% 2.07/2.35 9069 inverse(sk_c10) != sk_c9 | multiply(inverse(sk_c11),sk_c10) != sk_c11 | multiply(A,B) != sk_c10 | inverse(A) != B | multiply(B,sk_c9) != sk_c10 | multiply(C,sk_c10) != sk_c9 | inverse(C) != sk_c10. [back_rewrite(1193),rewrite([7068(20)]),xx(f)].
% 2.07/2.35 9094 inverse(sk_c10) = sk_c10. [back_rewrite(854),rewrite([7068(1),7068(3)])].
% 2.07/2.35 9097 multiply(A,sk_c10) = A. [back_rewrite(847),rewrite([7068(1)])].
% 2.07/2.35 9113 multiply(sk_c10,A) = A. [back_rewrite(1),rewrite([7068(1)])].
% 2.07/2.35 9127 sk_c9 != sk_c10 | inverse(A) != sk_c11 | sk_c11 != A | multiply(sk_c9,sk_c9) != sk_c10 | sk_c9 != B | inverse(B) != sk_c10. [factor(9063,a,e),rewrite([9094(2),9097(8),9113(11),9097(18)]),flip(a),flip(c),flip(f),merge(d)].
% 2.07/2.35 9134 sk_c9 != sk_c10 | inverse(sk_c11) != sk_c11 | multiply(sk_c9,sk_c9) != sk_c10 | sk_c9 != A | inverse(A) != sk_c10. [factor(9069,a,d),rewrite([9094(2),9097(7),9113(10),9097(17)]),flip(a),flip(e),merge(c)].
% 2.07/2.35 9328 inverse(sk_c6) = sk_c11 | sk_c1 = sk_c11. [back_rewrite(4218),rewrite([9094(7),9097(7)]),flip(b)].
% 2.07/2.35 9337 sk_c9 = sk_c10. [back_rewrite(3097),rewrite([9094(5)]),flip(b),merge(b)].
% 2.07/2.35 9504 inverse(sk_c1) = sk_c11 | multiply(sk_c11,multiply(sk_c4,sk_c11)) = sk_c6. [back_rewrite(2605),rewrite([9097(8),9097(7)]),flip(b)].
% 2.07/2.35 9509 inverse(sk_c1) = sk_c11 | multiply(sk_c4,multiply(sk_c11,multiply(sk_c4,sk_c11))) = sk_c10. [back_rewrite(2170),rewrite([9097(14)])].
% 2.07/2.35 9561 inverse(sk_c1) = sk_c11 | multiply(A,multiply(sk_c4,sk_c11)) = A. [back_rewrite(112),rewrite([9097(10)])].
% 2.07/2.35 9567 sk_c1 = sk_c11 | sk_c6 = sk_c11. [back_rewrite(44),rewrite([9097(3),9097(6)])].
% 2.07/2.35 9626 inverse(sk_c1) = sk_c11 | multiply(A,multiply(sk_c6,B)) = multiply(A,multiply(sk_c11,B)). [back_rewrite(2573),rewrite([9113(7)])].
% 2.07/2.35 9647 inverse(A) != sk_c11 | sk_c11 != A. [factor(9127,a,e),rewrite([9337(1),9337(9),9337(10),9097(11),9094(13)]),xx(a),xx(d),xx(e)].
% 2.07/2.35 9648 inverse(sk_c11) != sk_c11. [factor(9134,a,d),rewrite([9337(1),9337(8),9337(9),9097(10),9094(12)]),xx(a),xx(c),xx(d)].
% 2.07/2.35 9752 sk_c1 != sk_c11 | inverse(sk_c11) = sk_c6. [resolve(9647,a,1013,a),flip(a)].
% 2.07/2.35 9753 sk_c1 != sk_c11 | inverse(sk_c11) = sk_c4. [resolve(9647,a,978,a),flip(a)].
% 2.07/2.35 9757 sk_c4 != sk_c11 | inverse(sk_c1) = sk_c11. [resolve(9647,a,7,b),flip(a)].
% 2.07/2.35 9836 sk_c1 = sk_c11. [para(9567(b,1),9328(a,1,1)),merge(c),unit_del(b,9648)].
% 2.07/2.35 9845 sk_c4 != sk_c11. [back_rewrite(9757),rewrite([9836(4)]),unit_del(b,9648)].
% 2.07/2.35 9847 inverse(sk_c11) = sk_c4. [back_rewrite(9753),rewrite([9836(1)]),xx(a)].
% 2.07/2.35 9848 sk_c6 = sk_c4. [back_rewrite(9752),rewrite([9836(1),9847(5)]),flip(b),xx(a)].
% 2.07/2.35 9853 multiply(A,multiply(sk_c4,B)) = multiply(A,multiply(sk_c11,B)). [back_rewrite(9626),rewrite([9836(1),9847(2),9848(4)]),unit_del(a,9845)].
% 2.07/2.35 9864 multiply(A,multiply(sk_c11,sk_c11)) = A. [back_rewrite(9561),rewrite([9836(1),9847(2),9853(7)]),unit_del(a,9845)].
% 2.07/2.35 9866 multiply(sk_c4,sk_c11) = sk_c10. [back_rewrite(9509),rewrite([9836(1),9847(2),9853(9),9864(9)]),unit_del(a,9845)].
% 2.07/2.35 9867 $F. [back_rewrite(9504),rewrite([9836(1),9847(2),9866(7),9097(6),9848(5)]),flip(b),merge(b),unit_del(a,9845)].
% 2.07/2.35
% 2.07/2.35 % SZS output end Refutation
% 2.07/2.35 ============================== end of proof ==========================
% 2.07/2.35
% 2.07/2.35 ============================== STATISTICS ============================
% 2.07/2.35
% 2.07/2.35 Given=482. Generated=32258. Kept=9866. proofs=1.
% 2.07/2.35 Usable=56. Sos=308. Demods=37. Limbo=31, Disabled=9529. Hints=0.
% 2.07/2.35 Megabytes=10.95.
% 2.07/2.35 User_CPU=1.35, System_CPU=0.03, Wall_clock=2.
% 2.07/2.35
% 2.07/2.35 ============================== end of statistics =====================
% 2.07/2.35
% 2.07/2.35 ============================== end of search =========================
% 2.07/2.35
% 2.07/2.35 THEOREM PROVED
% 2.07/2.35 % SZS status Unsatisfiable
% 2.07/2.35
% 2.07/2.35 Exiting with 1 proof.
% 2.07/2.35
% 2.07/2.35 Process 6212 exit (max_proofs) Mon Jun 13 19:24:40 2022
% 2.07/2.35 Prover9 interrupted
%------------------------------------------------------------------------------