TSTP Solution File: GRP336-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP336-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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:40 EDT 2022
% Result : Unsatisfiable 1.66s 1.94s
% Output : Refutation 1.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP336-1 : TPTP v8.1.0. Released v2.5.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n007.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 11:00:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.66/1.94 ============================== Prover9 ===============================
% 1.66/1.94 Prover9 (32) version 2009-11A, November 2009.
% 1.66/1.94 Process 3699 was started by sandbox on n007.cluster.edu,
% 1.66/1.94 Mon Jun 13 11:00:39 2022
% 1.66/1.94 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3546_n007.cluster.edu".
% 1.66/1.94 ============================== end of head ===========================
% 1.66/1.94
% 1.66/1.94 ============================== INPUT =================================
% 1.66/1.94
% 1.66/1.94 % Reading from file /tmp/Prover9_3546_n007.cluster.edu
% 1.66/1.94
% 1.66/1.94 set(prolog_style_variables).
% 1.66/1.94 set(auto2).
% 1.66/1.94 % set(auto2) -> set(auto).
% 1.66/1.94 % set(auto) -> set(auto_inference).
% 1.66/1.94 % set(auto) -> set(auto_setup).
% 1.66/1.94 % set(auto_setup) -> set(predicate_elim).
% 1.66/1.94 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.66/1.94 % set(auto) -> set(auto_limits).
% 1.66/1.94 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.66/1.94 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.66/1.94 % set(auto) -> set(auto_denials).
% 1.66/1.94 % set(auto) -> set(auto_process).
% 1.66/1.94 % set(auto2) -> assign(new_constants, 1).
% 1.66/1.94 % set(auto2) -> assign(fold_denial_max, 3).
% 1.66/1.94 % set(auto2) -> assign(max_weight, "200.000").
% 1.66/1.94 % set(auto2) -> assign(max_hours, 1).
% 1.66/1.94 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.66/1.94 % set(auto2) -> assign(max_seconds, 0).
% 1.66/1.94 % set(auto2) -> assign(max_minutes, 5).
% 1.66/1.94 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.66/1.94 % set(auto2) -> set(sort_initial_sos).
% 1.66/1.94 % set(auto2) -> assign(sos_limit, -1).
% 1.66/1.94 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.66/1.94 % set(auto2) -> assign(max_megs, 400).
% 1.66/1.94 % set(auto2) -> assign(stats, some).
% 1.66/1.94 % set(auto2) -> clear(echo_input).
% 1.66/1.94 % set(auto2) -> set(quiet).
% 1.66/1.94 % set(auto2) -> clear(print_initial_clauses).
% 1.66/1.94 % set(auto2) -> clear(print_given).
% 1.66/1.94 assign(lrs_ticks,-1).
% 1.66/1.94 assign(sos_limit,10000).
% 1.66/1.94 assign(order,kbo).
% 1.66/1.94 set(lex_order_vars).
% 1.66/1.94 clear(print_given).
% 1.66/1.94
% 1.66/1.94 % formulas(sos). % not echoed (52 formulas)
% 1.66/1.94
% 1.66/1.94 ============================== end of input ==========================
% 1.66/1.94
% 1.66/1.94 % From the command line: assign(max_seconds, 300).
% 1.66/1.94
% 1.66/1.94 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.66/1.94
% 1.66/1.94 % Formulas that are not ordinary clauses:
% 1.66/1.94
% 1.66/1.94 ============================== end of process non-clausal formulas ===
% 1.66/1.94
% 1.66/1.94 ============================== PROCESS INITIAL CLAUSES ===============
% 1.66/1.94
% 1.66/1.94 ============================== PREDICATE ELIMINATION =================
% 1.66/1.94
% 1.66/1.94 ============================== end predicate elimination =============
% 1.66/1.94
% 1.66/1.94 Auto_denials: (non-Horn, no changes).
% 1.66/1.94
% 1.66/1.94 Term ordering decisions:
% 1.66/1.94
% 1.66/1.94 % Assigning unary symbol inverse kb_weight 0 and highest precedence (14).
% 1.66/1.94 Function symbol KB weights: sk_c10=1. sk_c9=1. sk_c3=1. sk_c8=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.
% 1.66/1.94
% 1.66/1.94 ============================== end of process initial clauses ========
% 1.66/1.94
% 1.66/1.94 ============================== CLAUSES FOR SEARCH ====================
% 1.66/1.94
% 1.66/1.94 ============================== end of clauses for search =============
% 1.66/1.94
% 1.66/1.94 ============================== SEARCH ================================
% 1.66/1.94
% 1.66/1.94 % Starting search at 0.04 seconds.
% 1.66/1.94
% 1.66/1.94 Low Water (keep): wt=39.000, iters=3382
% 1.66/1.94
% 1.66/1.94 ============================== PROOF =================================
% 1.66/1.94 % SZS status Unsatisfiable
% 1.66/1.94 % SZS output start Refutation
% 1.66/1.94
% 1.66/1.94 % Proof 1 at 0.94 (+ 0.01) seconds.
% 1.66/1.94 % Length of proof is 108.
% 1.66/1.94 % Level of proof is 24.
% 1.66/1.94 % Maximum clause weight is 65.000.
% 1.66/1.94 % Given clauses 369.
% 1.66/1.94
% 1.66/1.94 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 1.66/1.94 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 1.66/1.94 6 inverse(sk_c2) = sk_c3 | inverse(sk_c4) = sk_c10 # label(prove_this_34) # label(negated_conjecture). [assumption].
% 1.66/1.94 8 inverse(sk_c2) = sk_c3 | inverse(sk_c6) = sk_c7 # label(prove_this_39) # label(negated_conjecture). [assumption].
% 1.66/1.94 10 multiply(sk_c9,sk_c10) = sk_c8 | inverse(sk_c5) = sk_c10 # label(prove_this_4) # label(negated_conjecture). [assumption].
% 1.66/1.94 13 inverse(sk_c1) = sk_c10 | multiply(sk_c10,sk_c8) = sk_c9 # label(prove_this_11) # label(negated_conjecture). [assumption].
% 1.66/1.94 15 inverse(sk_c1) = sk_c10 | multiply(sk_c6,sk_c7) = sk_c9 # label(prove_this_14) # label(negated_conjecture). [assumption].
% 1.66/1.94 16 inverse(sk_c1) = sk_c10 | multiply(sk_c7,sk_c8) = sk_c9 # label(prove_this_16) # label(negated_conjecture). [assumption].
% 1.66/1.94 18 multiply(sk_c1,sk_c9) = sk_c10 | inverse(sk_c5) = sk_c10 # label(prove_this_20) # label(negated_conjecture). [assumption].
% 1.66/1.94 19 multiply(sk_c1,sk_c9) = sk_c10 | inverse(sk_c6) = sk_c7 # label(prove_this_23) # label(negated_conjecture). [assumption].
% 1.66/1.94 20 multiply(sk_c2,sk_c3) = sk_c9 | inverse(sk_c4) = sk_c10 # label(prove_this_26) # label(negated_conjecture). [assumption].
% 1.66/1.94 23 inverse(sk_c2) = sk_c3 | multiply(sk_c4,sk_c10) = sk_c9 # label(prove_this_33) # label(negated_conjecture). [assumption].
% 1.66/1.94 24 inverse(sk_c2) = sk_c3 | multiply(sk_c10,sk_c8) = sk_c9 # label(prove_this_35) # label(negated_conjecture). [assumption].
% 1.66/1.94 32 multiply(sk_c9,sk_c10) = sk_c8 | multiply(sk_c10,sk_c8) = sk_c9 # label(prove_this_3) # label(negated_conjecture). [assumption].
% 1.66/1.94 33 multiply(sk_c9,sk_c10) = sk_c8 | multiply(sk_c5,sk_c9) = sk_c10 # label(prove_this_5) # label(negated_conjecture). [assumption].
% 1.66/1.94 37 multiply(sk_c1,sk_c9) = sk_c10 | multiply(sk_c10,sk_c8) = sk_c9 # label(prove_this_19) # label(negated_conjecture). [assumption].
% 1.66/1.94 38 multiply(sk_c1,sk_c9) = sk_c10 | multiply(sk_c5,sk_c9) = sk_c10 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 1.66/1.94 41 multiply(sk_c2,sk_c3) = sk_c9 | multiply(sk_c4,sk_c10) = sk_c9 # label(prove_this_25) # label(negated_conjecture). [assumption].
% 1.66/1.94 42 multiply(sk_c2,sk_c3) = sk_c9 | multiply(sk_c10,sk_c8) = sk_c9 # label(prove_this_27) # label(negated_conjecture). [assumption].
% 1.66/1.94 47 multiply(sk_c3,sk_c10) = sk_c9 | multiply(sk_c10,sk_c8) = sk_c9 # label(prove_this_43) # label(negated_conjecture). [assumption].
% 1.66/1.94 51 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 1.66/1.94 52 multiply(sk_c9,sk_c10) != sk_c8 | inverse(A) != sk_c10 | multiply(A,sk_c9) != sk_c10 | multiply(B,C) != sk_c9 | inverse(B) != C | multiply(C,sk_c10) != sk_c9 | multiply(D,sk_c10) != sk_c9 | inverse(D) != sk_c10 | multiply(sk_c10,sk_c8) != sk_c9 | inverse(E) != sk_c10 | multiply(E,sk_c9) != sk_c10 | multiply(F,V6) != sk_c9 | inverse(F) != V6 | multiply(V6,sk_c8) != sk_c9 # label(prove_this_49) # label(negated_conjecture). [assumption].
% 1.66/1.94 55 multiply(sk_c9,sk_c10) != sk_c8 | inverse(A) != sk_c10 | multiply(A,sk_c9) != sk_c10 | multiply(B,C) != sk_c9 | inverse(B) != C | multiply(C,sk_c10) != sk_c9 | multiply(D,sk_c10) != sk_c9 | inverse(D) != sk_c10 | multiply(sk_c10,sk_c8) != sk_c9 | multiply(E,F) != sk_c9 | inverse(E) != F | multiply(F,sk_c8) != sk_c9. [factor(52,b,j),merge(j)].
% 1.66/1.94 69 multiply(sk_c9,sk_c10) != sk_c8 | inverse(A) != sk_c10 | multiply(A,sk_c9) != sk_c10 | multiply(B,C) != sk_c9 | inverse(B) != C | multiply(C,sk_c10) != sk_c9 | multiply(D,sk_c10) != sk_c9 | inverse(D) != sk_c10 | multiply(sk_c10,sk_c8) != sk_c9. [factor(55,g,j),merge(j),merge(k)].
% 1.66/1.94 92 inverse(sk_c2) = sk_c3 | multiply(sk_c7,sk_c6) = identity. [para(8(b,1),2(a,1,1))].
% 1.66/1.94 93 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),51(a,1,1)),rewrite([1(2)]),flip(a)].
% 1.66/1.94 102 inverse(sk_c1) = sk_c10 | multiply(sk_c10,multiply(sk_c8,A)) = multiply(sk_c9,A). [para(13(b,1),51(a,1,1)),flip(b)].
% 1.66/1.94 106 inverse(sk_c1) = sk_c10 | multiply(sk_c6,multiply(sk_c7,A)) = multiply(sk_c9,A). [para(15(b,1),51(a,1,1)),flip(b)].
% 1.66/1.94 112 inverse(sk_c5) = sk_c10 | multiply(sk_c1,multiply(sk_c9,A)) = multiply(sk_c10,A). [para(18(a,1),51(a,1,1)),flip(b)].
% 1.66/1.94 224 multiply(sk_c9,sk_c10) != sk_c8 | inverse(A) != sk_c10 | multiply(A,sk_c9) != sk_c10 | identity != sk_c9 | inverse(inverse(B)) != B | multiply(B,sk_c10) != sk_c9 | multiply(C,sk_c10) != sk_c9 | inverse(C) != sk_c10 | multiply(sk_c10,sk_c8) != sk_c9. [para(2(a,1),69(d,1))].
% 1.66/1.94 382 multiply(sk_c9,sk_c10) != sk_c8 | inverse(A) != sk_c10 | multiply(A,sk_c9) != sk_c10 | identity != sk_c9 | inverse(inverse(B)) != B | multiply(B,sk_c10) != sk_c9 | inverse(B) != sk_c10 | multiply(sk_c10,sk_c8) != sk_c9. [factor(224,f,g)].
% 1.66/1.94 618 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),93(a,1,2))].
% 1.66/1.94 625 inverse(sk_c5) = sk_c10 | multiply(inverse(sk_c9),sk_c8) = sk_c10. [para(10(a,1),93(a,1,2))].
% 1.66/1.94 634 inverse(sk_c6) = sk_c7 | multiply(inverse(sk_c1),sk_c10) = sk_c9. [para(19(a,1),93(a,1,2))].
% 1.66/1.94 647 multiply(sk_c10,sk_c8) = sk_c9 | multiply(inverse(sk_c9),sk_c8) = sk_c10. [para(32(a,1),93(a,1,2))].
% 1.66/1.94 652 multiply(sk_c10,sk_c8) = sk_c9 | multiply(inverse(sk_c1),sk_c10) = sk_c9. [para(37(a,1),93(a,1,2))].
% 1.66/1.94 662 multiply(sk_c10,sk_c8) = sk_c9 | multiply(inverse(sk_c3),sk_c9) = sk_c10. [para(47(a,1),93(a,1,2))].
% 1.66/1.94 672 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(93(a,1),93(a,1,2))].
% 1.66/1.94 673 multiply(A,identity) = A. [back_rewrite(618),rewrite([672(4)])].
% 1.66/1.94 693 inverse(identity) = identity. [para(673(a,1),2(a,1))].
% 1.66/1.94 780 inverse(sk_c2) = sk_c3 | inverse(sk_c7) = sk_c6. [para(92(b,1),93(a,1,2)),rewrite([673(8)])].
% 1.66/1.94 808 multiply(A,inverse(A)) = identity. [para(672(a,1),2(a,1))].
% 1.66/1.94 835 multiply(A,multiply(inverse(A),B)) = B. [para(672(a,1),93(a,1))].
% 1.66/1.94 836 inverse(inverse(A)) = A. [para(672(a,1),673(a,1)),rewrite([673(2)]),flip(a)].
% 1.66/1.94 859 multiply(sk_c9,sk_c10) != sk_c8 | inverse(A) != sk_c10 | multiply(A,sk_c9) != sk_c10 | identity != sk_c9 | multiply(B,sk_c10) != sk_c9 | inverse(B) != sk_c10 | multiply(sk_c10,sk_c8) != sk_c9. [back_rewrite(382),rewrite([836(17)]),xx(e)].
% 1.66/1.94 872 inverse(sk_c7) = sk_c6 | inverse(sk_c3) = sk_c2. [para(780(a,1),836(a,1,1))].
% 1.66/1.94 877 inverse(sk_c2) = sk_c3 | multiply(sk_c4,sk_c10) = identity. [para(6(b,1),808(a,1,2))].
% 1.66/1.94 1058 inverse(sk_c3) = sk_c2 | multiply(sk_c7,sk_c6) = identity. [para(872(a,1),808(a,1,2))].
% 1.66/1.94 1264 multiply(sk_c9,sk_c10) != sk_c8 | inverse(A) != sk_c10 | multiply(A,sk_c9) != sk_c10 | identity != sk_c9 | multiply(sk_c10,sk_c8) != sk_c9. [para(2(a,1),859(e,1)),rewrite([836(21)]),xx(f),merge(e)].
% 1.66/1.94 1311 multiply(sk_c9,sk_c10) != sk_c8 | inverse(multiply(A,B)) != sk_c10 | multiply(A,multiply(B,sk_c9)) != sk_c10 | identity != sk_c9 | multiply(sk_c10,sk_c8) != sk_c9. [para(51(a,1),1264(c,1))].
% 1.66/1.94 1312 multiply(sk_c9,sk_c10) != sk_c8 | inverse(multiply(A,inverse(sk_c9))) != sk_c10 | sk_c10 != A | identity != sk_c9 | multiply(sk_c10,sk_c8) != sk_c9. [para(2(a,1),1311(c,1,2)),rewrite([673(13)]),flip(c)].
% 1.66/1.94 1331 multiply(sk_c9,sk_c10) != sk_c8 | inverse(multiply(A,multiply(B,inverse(sk_c9)))) != sk_c10 | multiply(A,B) != sk_c10 | identity != sk_c9 | multiply(sk_c10,sk_c8) != sk_c9. [para(51(a,1),1312(b,1,1)),flip(c)].
% 1.66/1.94 1377 multiply(sk_c9,sk_c10) != sk_c8 | inverse(multiply(A,multiply(B,multiply(C,inverse(sk_c9))))) != sk_c10 | multiply(A,multiply(B,C)) != sk_c10 | identity != sk_c9 | multiply(sk_c10,sk_c8) != sk_c9. [para(51(a,1),1331(b,1,1,2))].
% 1.66/1.94 1525 inverse(sk_c2) = sk_c3 | identity = sk_c9. [para(877(b,1),23(b,1)),merge(b)].
% 1.66/1.94 1537 inverse(sk_c1) = sk_c10 | multiply(sk_c9,inverse(sk_c8)) = sk_c10. [para(808(a,1),102(b,1,2)),rewrite([673(7)]),flip(b)].
% 1.66/1.94 1599 multiply(sk_c9,sk_c10) != sk_c8 | inverse(A) != sk_c10 | multiply(A,multiply(inverse(multiply(B,inverse(sk_c9))),B)) != sk_c10 | identity != sk_c9 | multiply(sk_c10,sk_c8) != sk_c9. [para(2(a,1),1377(b,1,1,2)),rewrite([673(7)])].
% 1.66/1.94 1615 identity = sk_c9 | multiply(sk_c2,sk_c3) = identity. [para(1525(a,1),808(a,1,2))].
% 1.66/1.94 1622 identity = sk_c9 | inverse(sk_c4) = sk_c10. [para(1615(b,1),20(a,1)),merge(b)].
% 1.66/1.94 1646 multiply(sk_c9,sk_c10) != sk_c8 | inverse(multiply(sk_c10,inverse(sk_c9))) != sk_c10 | identity != sk_c9 | multiply(sk_c10,sk_c8) != sk_c9. [resolve(1599,c,835,a)].
% 1.66/1.94 1753 identity = sk_c9 | multiply(sk_c4,sk_c10) = identity. [para(1622(b,1),808(a,1,2))].
% 1.66/1.94 2073 inverse(sk_c1) = sk_c10 | multiply(sk_c6,sk_c9) = multiply(sk_c9,sk_c8). [para(16(b,1),106(b,1,2)),merge(b)].
% 1.66/1.94 2373 identity = sk_c9 | multiply(sk_c2,sk_c3) = sk_c9. [para(1753(b,1),41(b,1)),merge(c)].
% 1.66/1.94 3933 inverse(sk_c5) = sk_c10 | multiply(sk_c10,inverse(sk_c9)) = sk_c1. [para(808(a,1),112(b,1,2)),rewrite([673(7)]),flip(b)].
% 1.66/1.94 4143 identity = sk_c9. [para(2373(b,1),1615(b,1)),flip(c),merge(b),merge(c)].
% 1.66/1.94 5748 multiply(sk_c9,sk_c10) != sk_c8 | inverse(multiply(sk_c10,inverse(sk_c9))) != sk_c10 | multiply(sk_c10,sk_c8) != sk_c9. [back_rewrite(1646),rewrite([4143(13)]),xx(c)].
% 1.66/1.94 6125 inverse(sk_c3) = sk_c2 | multiply(sk_c7,sk_c6) = sk_c9. [back_rewrite(1058),rewrite([4143(8)])].
% 1.66/1.94 6201 multiply(A,inverse(A)) = sk_c9. [back_rewrite(808),rewrite([4143(3)])].
% 1.66/1.94 6237 inverse(sk_c9) = sk_c9. [back_rewrite(693),rewrite([4143(1),4143(3)])].
% 1.66/1.94 6238 multiply(A,sk_c9) = A. [back_rewrite(673),rewrite([4143(1)])].
% 1.66/1.94 6246 multiply(sk_c9,A) = A. [back_rewrite(1),rewrite([4143(1)])].
% 1.66/1.94 6344 sk_c8 != sk_c10 | inverse(sk_c10) != sk_c10 | multiply(sk_c10,sk_c8) != sk_c9. [back_rewrite(5748),rewrite([6246(3),6237(6),6238(6)]),flip(a)].
% 1.66/1.94 6496 inverse(sk_c5) = sk_c10 | sk_c1 = sk_c10. [back_rewrite(3933),rewrite([6237(7),6238(7)]),flip(b)].
% 1.66/1.94 6506 multiply(sk_c10,sk_c8) = sk_c9 | sk_c8 = sk_c10. [back_rewrite(647),rewrite([6237(7),6246(8)])].
% 1.66/1.94 6508 inverse(sk_c5) = sk_c10 | sk_c8 = sk_c10. [back_rewrite(625),rewrite([6237(6),6246(7)])].
% 1.66/1.94 6767 inverse(sk_c1) = sk_c10 | sk_c6 = sk_c8. [back_rewrite(2073),rewrite([6238(7),6246(8)])].
% 1.66/1.94 6787 multiply(sk_c10,sk_c8) = sk_c9 | inverse(sk_c3) = sk_c10. [back_rewrite(662),rewrite([6238(9)])].
% 1.66/1.94 6840 sk_c1 = sk_c10 | sk_c5 = sk_c10. [back_rewrite(38),rewrite([6238(3),6238(6)])].
% 1.66/1.94 6843 sk_c8 = sk_c10 | sk_c5 = sk_c10. [back_rewrite(33),rewrite([6246(3),6238(6)]),flip(a)].
% 1.66/1.94 6974 inverse(sk_c1) = sk_c10 | inverse(sk_c8) = sk_c10. [back_rewrite(1537),rewrite([6246(8)])].
% 1.66/1.94 7035 sk_c8 != sk_c10 | inverse(sk_c10) != sk_c10 | inverse(sk_c2) = sk_c3. [resolve(6344,c,24,b)].
% 1.66/1.94 7073 sk_c1 = sk_c10 | inverse(sk_c10) = sk_c10. [para(6840(b,1),6496(a,1,1)),merge(c)].
% 1.66/1.94 7094 sk_c8 = sk_c10 | inverse(sk_c10) = sk_c10. [para(6843(b,1),6508(a,1,1)),merge(c)].
% 1.66/1.94 7142 sk_c1 = sk_c10 | multiply(sk_c10,sk_c10) = sk_c9. [para(7073(b,1),6201(a,1,2))].
% 1.66/1.94 7245 sk_c6 = sk_c8 | multiply(sk_c10,sk_c8) = sk_c9 | multiply(sk_c10,sk_c10) = sk_c9. [para(6767(a,1),652(b,1,1))].
% 1.66/1.94 7249 sk_c8 = sk_c10 | inverse(sk_c10) = sk_c8. [para(6506(a,1),93(a,1,2)),rewrite([6238(7)])].
% 1.66/1.94 7255 sk_c8 = sk_c10. [para(7249(b,1),7094(b,1)),merge(b),merge(c)].
% 1.66/1.94 7257 sk_c6 = sk_c10 | multiply(sk_c10,sk_c10) = sk_c9. [back_rewrite(7245),rewrite([7255(2),7255(5)]),merge(c)].
% 1.66/1.94 7314 inverse(sk_c10) != sk_c10 | inverse(sk_c2) = sk_c3. [back_rewrite(7035),rewrite([7255(1)]),xx(a)].
% 1.66/1.94 7327 inverse(sk_c1) = sk_c10 | inverse(sk_c10) = sk_c10. [back_rewrite(6974),rewrite([7255(5)])].
% 1.66/1.94 7435 multiply(sk_c10,sk_c10) = sk_c9 | inverse(sk_c3) = sk_c10. [back_rewrite(6787),rewrite([7255(2)])].
% 1.66/1.94 7730 inverse(sk_c10) != sk_c10 | multiply(sk_c10,sk_c10) != sk_c9. [back_rewrite(6344),rewrite([7255(1),7255(9)]),xx(a)].
% 1.66/1.94 7747 multiply(sk_c2,sk_c3) = sk_c9 | multiply(sk_c10,sk_c10) = sk_c9. [back_rewrite(42),rewrite([7255(7)])].
% 1.66/1.94 7859 sk_c1 = sk_c10 | inverse(sk_c10) != sk_c10. [resolve(7142,b,7730,b)].
% 1.66/1.94 7861 sk_c1 = sk_c10. [resolve(7859,b,7073,b),merge(b)].
% 1.66/1.94 8040 inverse(sk_c10) = sk_c10. [back_rewrite(7327),rewrite([7861(1)]),merge(b)].
% 1.66/1.94 8063 inverse(sk_c6) = sk_c7 | multiply(sk_c10,sk_c10) = sk_c9. [back_rewrite(634),rewrite([7861(5),8040(6)])].
% 1.66/1.94 8067 multiply(sk_c10,sk_c10) != sk_c9. [back_rewrite(7730),rewrite([8040(2)]),xx(a)].
% 1.66/1.94 8068 inverse(sk_c2) = sk_c3. [back_rewrite(7314),rewrite([8040(2)]),xx(a)].
% 1.66/1.94 8071 inverse(sk_c6) = sk_c7. [back_unit_del(8063),unit_del(b,8067)].
% 1.66/1.94 8074 multiply(sk_c2,sk_c3) = sk_c9. [back_unit_del(7747),unit_del(b,8067)].
% 1.66/1.94 8076 inverse(sk_c3) = sk_c10. [back_unit_del(7435),unit_del(a,8067)].
% 1.66/1.94 8080 sk_c6 = sk_c10. [back_unit_del(7257),unit_del(b,8067)].
% 1.66/1.94 8082 sk_c2 = sk_c10 | multiply(sk_c7,sk_c10) = sk_c9. [back_rewrite(6125),rewrite([8076(2),8080(5)]),flip(a)].
% 1.66/1.94 8086 sk_c7 = sk_c10. [back_rewrite(8071),rewrite([8080(1),8040(2)]),flip(a)].
% 1.66/1.94 8087 sk_c2 = sk_c10. [back_rewrite(8082),rewrite([8086(4)]),unit_del(b,8067)].
% 1.66/1.94 8089 multiply(sk_c10,sk_c3) = sk_c9. [back_rewrite(8074),rewrite([8087(1)])].
% 1.66/1.94 8090 sk_c3 = sk_c10. [back_rewrite(8068),rewrite([8087(1),8040(2)]),flip(a)].
% 1.66/1.94 8091 $F. [back_rewrite(8089),rewrite([8090(2)]),unit_del(a,8067)].
% 1.66/1.94
% 1.66/1.94 % SZS output end Refutation
% 1.66/1.94 ============================== end of proof ==========================
% 1.66/1.94
% 1.66/1.94 ============================== STATISTICS ============================
% 1.66/1.94
% 1.66/1.94 Given=369. Generated=17021. Kept=8090. proofs=1.
% 1.66/1.94 Usable=11. Sos=18. Demods=29. Limbo=1, Disabled=8112. Hints=0.
% 1.66/1.94 Megabytes=8.52.
% 1.66/1.94 User_CPU=0.94, System_CPU=0.01, Wall_clock=1.
% 1.66/1.94
% 1.66/1.94 ============================== end of statistics =====================
% 1.66/1.94
% 1.66/1.94 ============================== end of search =========================
% 1.66/1.94
% 1.66/1.94 THEOREM PROVED
% 1.66/1.94 % SZS status Unsatisfiable
% 1.66/1.94
% 1.66/1.94 Exiting with 1 proof.
% 1.66/1.94
% 1.66/1.94 Process 3699 exit (max_proofs) Mon Jun 13 11:00:40 2022
% 1.66/1.94 Prover9 interrupted
%------------------------------------------------------------------------------