TSTP Solution File: GRP248-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP248-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:19 EDT 2022
% Result : Unsatisfiable 6.29s 6.59s
% Output : Refutation 6.29s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP248-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n014.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 08:28:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 6.29/6.59 ============================== Prover9 ===============================
% 6.29/6.59 Prover9 (32) version 2009-11A, November 2009.
% 6.29/6.59 Process 14883 was started by sandbox2 on n014.cluster.edu,
% 6.29/6.59 Mon Jun 13 08:28:38 2022
% 6.29/6.59 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_14730_n014.cluster.edu".
% 6.29/6.59 ============================== end of head ===========================
% 6.29/6.59
% 6.29/6.59 ============================== INPUT =================================
% 6.29/6.59
% 6.29/6.59 % Reading from file /tmp/Prover9_14730_n014.cluster.edu
% 6.29/6.59
% 6.29/6.59 set(prolog_style_variables).
% 6.29/6.59 set(auto2).
% 6.29/6.59 % set(auto2) -> set(auto).
% 6.29/6.59 % set(auto) -> set(auto_inference).
% 6.29/6.59 % set(auto) -> set(auto_setup).
% 6.29/6.59 % set(auto_setup) -> set(predicate_elim).
% 6.29/6.59 % set(auto_setup) -> assign(eq_defs, unfold).
% 6.29/6.59 % set(auto) -> set(auto_limits).
% 6.29/6.59 % set(auto_limits) -> assign(max_weight, "100.000").
% 6.29/6.59 % set(auto_limits) -> assign(sos_limit, 20000).
% 6.29/6.59 % set(auto) -> set(auto_denials).
% 6.29/6.59 % set(auto) -> set(auto_process).
% 6.29/6.59 % set(auto2) -> assign(new_constants, 1).
% 6.29/6.59 % set(auto2) -> assign(fold_denial_max, 3).
% 6.29/6.59 % set(auto2) -> assign(max_weight, "200.000").
% 6.29/6.59 % set(auto2) -> assign(max_hours, 1).
% 6.29/6.59 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 6.29/6.59 % set(auto2) -> assign(max_seconds, 0).
% 6.29/6.59 % set(auto2) -> assign(max_minutes, 5).
% 6.29/6.59 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 6.29/6.59 % set(auto2) -> set(sort_initial_sos).
% 6.29/6.59 % set(auto2) -> assign(sos_limit, -1).
% 6.29/6.59 % set(auto2) -> assign(lrs_ticks, 3000).
% 6.29/6.59 % set(auto2) -> assign(max_megs, 400).
% 6.29/6.59 % set(auto2) -> assign(stats, some).
% 6.29/6.59 % set(auto2) -> clear(echo_input).
% 6.29/6.59 % set(auto2) -> set(quiet).
% 6.29/6.59 % set(auto2) -> clear(print_initial_clauses).
% 6.29/6.59 % set(auto2) -> clear(print_given).
% 6.29/6.59 assign(lrs_ticks,-1).
% 6.29/6.59 assign(sos_limit,10000).
% 6.29/6.59 assign(order,kbo).
% 6.29/6.59 set(lex_order_vars).
% 6.29/6.59 clear(print_given).
% 6.29/6.59
% 6.29/6.59 % formulas(sos). % not echoed (46 formulas)
% 6.29/6.59
% 6.29/6.59 ============================== end of input ==========================
% 6.29/6.59
% 6.29/6.59 % From the command line: assign(max_seconds, 300).
% 6.29/6.59
% 6.29/6.59 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 6.29/6.59
% 6.29/6.59 % Formulas that are not ordinary clauses:
% 6.29/6.59
% 6.29/6.59 ============================== end of process non-clausal formulas ===
% 6.29/6.59
% 6.29/6.59 ============================== PROCESS INITIAL CLAUSES ===============
% 6.29/6.59
% 6.29/6.59 ============================== PREDICATE ELIMINATION =================
% 6.29/6.59
% 6.29/6.59 ============================== end predicate elimination =============
% 6.29/6.59
% 6.29/6.59 Auto_denials: (non-Horn, no changes).
% 6.29/6.59
% 6.29/6.59 Term ordering decisions:
% 6.29/6.59
% 6.29/6.59 % Assigning unary symbol inverse kb_weight 0 and highest precedence (14).
% 6.29/6.59 Function symbol KB weights: sk_c9=1. sk_c10=1. sk_c8=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.
% 6.29/6.59
% 6.29/6.59 ============================== end of process initial clauses ========
% 6.29/6.59
% 6.29/6.59 ============================== CLAUSES FOR SEARCH ====================
% 6.29/6.59
% 6.29/6.59 ============================== end of clauses for search =============
% 6.29/6.59
% 6.29/6.59 ============================== SEARCH ================================
% 6.29/6.59
% 6.29/6.59 % Starting search at 0.06 seconds.
% 6.29/6.59
% 6.29/6.59 Low Water (keep): wt=50.000, iters=3874
% 6.29/6.59
% 6.29/6.59 Low Water (keep): wt=49.000, iters=3348
% 6.29/6.59
% 6.29/6.59 Low Water (keep): wt=48.000, iters=3404
% 6.29/6.59
% 6.29/6.59 Low Water (keep): wt=47.000, iters=3370
% 6.29/6.59
% 6.29/6.59 Low Water (keep): wt=46.000, iters=3415
% 6.29/6.59
% 6.29/6.59 Low Water (keep): wt=45.000, iters=3758
% 6.29/6.59
% 6.29/6.59 Low Water (keep): wt=44.000, iters=3353
% 6.29/6.59
% 6.29/6.59 ============================== PROOF =================================
% 6.29/6.59 % SZS status Unsatisfiable
% 6.29/6.59 % SZS output start Refutation
% 6.29/6.59
% 6.29/6.59 % Proof 1 at 5.54 (+ 0.06) seconds.
% 6.29/6.59 % Length of proof is 85.
% 6.29/6.59 % Level of proof is 21.
% 6.29/6.59 % Maximum clause weight is 59.000.
% 6.29/6.59 % Given clauses 528.
% 6.29/6.59
% 6.29/6.59 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 6.29/6.59 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 6.29/6.59 5 inverse(sk_c1) = sk_c10 | inverse(sk_c6) = sk_c7 # label(prove_this_13) # label(negated_conjecture). [assumption].
% 6.29/6.59 7 inverse(sk_c2) = sk_c9 | inverse(sk_c5) = sk_c9 # label(prove_this_24) # label(negated_conjecture). [assumption].
% 6.29/6.59 9 inverse(sk_c3) = sk_c10 | inverse(sk_c4) = sk_c10 # label(prove_this_29) # label(negated_conjecture). [assumption].
% 6.29/6.59 14 multiply(sk_c1,sk_c10) = sk_c9 | inverse(sk_c6) = sk_c7 # label(prove_this_6) # label(negated_conjecture). [assumption].
% 6.29/6.59 17 inverse(sk_c1) = sk_c10 | multiply(sk_c6,sk_c7) = sk_c9 # label(prove_this_12) # label(negated_conjecture). [assumption].
% 6.29/6.59 20 multiply(sk_c2,sk_c9) = sk_c8 | inverse(sk_c5) = sk_c9 # label(prove_this_17) # label(negated_conjecture). [assumption].
% 6.29/6.59 23 inverse(sk_c2) = sk_c9 | multiply(sk_c5,sk_c8) = sk_c9 # label(prove_this_25) # label(negated_conjecture). [assumption].
% 6.29/6.59 26 inverse(sk_c3) = sk_c10 | multiply(sk_c4,sk_c9) = sk_c10 # label(prove_this_30) # label(negated_conjecture). [assumption].
% 6.29/6.59 30 multiply(sk_c3,sk_c8) = sk_c10 | inverse(sk_c4) = sk_c10 # label(prove_this_36) # label(negated_conjecture). [assumption].
% 6.29/6.59 35 multiply(sk_c1,sk_c10) = sk_c9 | multiply(sk_c6,sk_c7) = sk_c9 # label(prove_this_5) # label(negated_conjecture). [assumption].
% 6.29/6.59 38 multiply(sk_c2,sk_c9) = sk_c8 | multiply(sk_c5,sk_c8) = sk_c9 # label(prove_this_18) # label(negated_conjecture). [assumption].
% 6.29/6.59 41 multiply(sk_c3,sk_c8) = sk_c10 | multiply(sk_c4,sk_c9) = sk_c10 # label(prove_this_37) # label(negated_conjecture). [assumption].
% 6.29/6.59 45 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 6.29/6.59 46 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | multiply(B,sk_c9) != sk_c8 | inverse(B) != sk_c9 | inverse(C) != sk_c10 | multiply(C,sk_c8) != sk_c10 | inverse(D) != sk_c10 | multiply(D,sk_c9) != sk_c10 | inverse(E) != sk_c9 | multiply(E,sk_c8) != sk_c9 | multiply(F,V6) != sk_c9 | inverse(F) != V6 | multiply(V6,sk_c8) != sk_c9 # label(prove_this_43) # label(negated_conjecture). [assumption].
% 6.29/6.59 50 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | multiply(B,sk_c9) != sk_c8 | inverse(B) != sk_c9 | inverse(C) != sk_c10 | multiply(C,sk_c8) != sk_c10 | inverse(D) != sk_c10 | multiply(D,sk_c9) != sk_c10 | multiply(B,sk_c8) != sk_c9 | multiply(E,F) != sk_c9 | inverse(E) != F | multiply(F,sk_c8) != sk_c9. [factor(46,d,i)].
% 6.29/6.59 78 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | multiply(B,sk_c9) != sk_c8 | inverse(B) != sk_c9 | inverse(C) != sk_c10 | multiply(C,sk_c8) != sk_c10 | inverse(D) != sk_c10 | multiply(D,sk_c9) != sk_c10 | multiply(B,sk_c8) != sk_c9 | multiply(E,B) != sk_c9 | inverse(E) != B. [factor(50,i,l)].
% 6.29/6.59 155 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),45(a,1,1)),rewrite([1(2)]),flip(a)].
% 6.29/6.59 172 inverse(sk_c5) = sk_c9 | multiply(sk_c2,multiply(sk_c9,A)) = multiply(sk_c8,A). [para(20(a,1),45(a,1,1)),flip(b)].
% 6.29/6.59 192 inverse(sk_c4) = sk_c10 | multiply(sk_c3,multiply(sk_c8,A)) = multiply(sk_c10,A). [para(30(a,1),45(a,1,1)),flip(b)].
% 6.29/6.59 281 identity != sk_c9 | inverse(inverse(sk_c10)) != sk_c10 | multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | inverse(B) != sk_c10 | multiply(B,sk_c8) != sk_c10 | inverse(C) != sk_c10 | multiply(C,sk_c9) != sk_c10 | inverse(D) != sk_c9 | multiply(D,sk_c8) != sk_c9 | multiply(E,F) != sk_c9 | inverse(E) != F | multiply(F,sk_c8) != sk_c9. [para(2(a,1),46(a,1))].
% 6.29/6.59 736 identity != sk_c9 | inverse(inverse(sk_c10)) != sk_c10 | multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | inverse(B) != sk_c10 | multiply(B,sk_c8) != sk_c10 | inverse(C) != sk_c10 | multiply(C,sk_c9) != sk_c10 | multiply(A,sk_c8) != sk_c9 | multiply(D,E) != sk_c9 | inverse(D) != E | multiply(E,sk_c8) != sk_c9. [factor(281,d,i)].
% 6.29/6.59 2123 identity != sk_c9 | inverse(inverse(sk_c10)) != sk_c10 | multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | inverse(B) != sk_c10 | multiply(B,sk_c8) != sk_c10 | inverse(C) != sk_c10 | multiply(C,sk_c9) != sk_c10 | multiply(A,sk_c8) != sk_c9 | multiply(A,sk_c9) != sk_c9 | multiply(sk_c9,sk_c8) != sk_c9. [factor(736,d,k)].
% 6.29/6.59 6514 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),155(a,1,2))].
% 6.29/6.59 6534 inverse(sk_c2) = sk_c9 | multiply(inverse(sk_c5),sk_c9) = sk_c8. [para(23(b,1),155(a,1,2))].
% 6.29/6.59 6549 multiply(sk_c2,sk_c9) = sk_c8 | multiply(inverse(sk_c5),sk_c9) = sk_c8. [para(38(b,1),155(a,1,2))].
% 6.29/6.59 6578 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(155(a,1),155(a,1,2))].
% 6.29/6.59 6579 multiply(A,identity) = A. [back_rewrite(6514),rewrite([6578(4)])].
% 6.29/6.59 6602 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | sk_c8 != sk_c9 | inverse(identity) != sk_c9 | inverse(B) != sk_c10 | multiply(B,sk_c8) != sk_c10 | inverse(C) != sk_c10 | multiply(C,sk_c9) != sk_c10 | inverse(sk_c9) != identity. [resolve(6579,a,78,j),rewrite([1(10),1(31)]),flip(c),merge(i)].
% 6.29/6.59 6612 inverse(identity) = identity. [para(6579(a,1),2(a,1))].
% 6.29/6.59 6625 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | sk_c8 != sk_c9 | identity != sk_c9 | inverse(B) != sk_c10 | multiply(B,sk_c8) != sk_c10 | multiply(A,sk_c9) != sk_c10 | inverse(sk_c9) != identity. [factor(6602,b,g),rewrite([6612(12)])].
% 6.29/6.59 6940 multiply(A,inverse(A)) = identity. [para(6578(a,1),2(a,1))].
% 6.29/6.59 7300 multiply(A,multiply(inverse(A),B)) = B. [para(6578(a,1),155(a,1))].
% 6.29/6.59 7301 inverse(inverse(A)) = A. [para(6578(a,1),6579(a,1)),rewrite([6579(2)]),flip(a)].
% 6.29/6.59 7625 identity != sk_c9 | multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | inverse(B) != sk_c10 | multiply(B,sk_c8) != sk_c10 | inverse(C) != sk_c10 | multiply(C,sk_c9) != sk_c10 | multiply(A,sk_c8) != sk_c9 | multiply(A,sk_c9) != sk_c9 | multiply(sk_c9,sk_c8) != sk_c9. [back_rewrite(2123),rewrite([7301(6)]),xx(b)].
% 6.29/6.59 7766 inverse(sk_c1) = sk_c10 | multiply(sk_c6,sk_c7) = identity. [para(5(b,1),6940(a,1,2))].
% 6.29/6.59 8411 inverse(sk_c1) = sk_c10 | identity = sk_c9. [para(7766(b,1),17(b,1)),merge(b)].
% 6.29/6.59 8416 identity = sk_c9 | multiply(sk_c1,sk_c10) = identity. [para(8411(a,1),6940(a,1,2))].
% 6.29/6.59 8471 identity = sk_c9 | inverse(sk_c6) = sk_c7. [para(8416(b,1),14(a,1)),merge(b)].
% 6.29/6.59 8487 identity = sk_c9 | multiply(sk_c6,sk_c7) = identity. [para(8471(b,1),6940(a,1,2))].
% 6.29/6.59 8891 identity != sk_c9 | sk_c8 != sk_c9 | inverse(A) != sk_c10 | multiply(A,sk_c8) != sk_c10 | multiply(inverse(sk_c10),sk_c9) != sk_c10 | inverse(sk_c9) != identity. [para(2(a,1),6625(a,1)),rewrite([7301(6)]),xx(b),merge(c)].
% 6.29/6.59 8937 identity != sk_c9 | sk_c8 != sk_c9 | inverse(multiply(A,B)) != sk_c10 | multiply(A,multiply(B,sk_c8)) != sk_c10 | multiply(inverse(sk_c10),sk_c9) != sk_c10 | inverse(sk_c9) != identity. [para(45(a,1),8891(d,1))].
% 6.29/6.59 8950 identity = sk_c9 | multiply(sk_c1,sk_c10) = sk_c9. [para(8487(b,1),35(b,1)),merge(c)].
% 6.29/6.59 9106 inverse(sk_c5) = sk_c9 | multiply(sk_c8,inverse(sk_c9)) = sk_c2. [para(6940(a,1),172(b,1,2)),rewrite([6579(7)]),flip(b)].
% 6.29/6.59 9122 identity != sk_c9 | sk_c8 != sk_c9 | inverse(multiply(A,inverse(sk_c8))) != sk_c10 | sk_c10 != A | multiply(inverse(sk_c10),sk_c9) != sk_c10 | inverse(sk_c9) != identity. [para(2(a,1),8937(d,1,2)),rewrite([6579(14)]),flip(d)].
% 6.29/6.59 9156 identity != sk_c9 | sk_c8 != sk_c9 | inverse(multiply(A,multiply(B,inverse(sk_c8)))) != sk_c10 | multiply(A,B) != sk_c10 | multiply(inverse(sk_c10),sk_c9) != sk_c10 | inverse(sk_c9) != identity. [para(45(a,1),9122(c,1,1)),flip(d)].
% 6.29/6.59 9472 identity != sk_c9 | sk_c8 != sk_c9 | inverse(multiply(A,multiply(B,multiply(C,inverse(sk_c8))))) != sk_c10 | multiply(A,multiply(B,C)) != sk_c10 | multiply(inverse(sk_c10),sk_c9) != sk_c10 | inverse(sk_c9) != identity. [para(45(a,1),9156(c,1,1,2))].
% 6.29/6.59 10097 identity = sk_c9. [para(8950(b,1),8416(b,1)),flip(c),merge(b),merge(c)].
% 6.29/6.59 10413 sk_c8 != sk_c9 | inverse(multiply(A,multiply(B,multiply(C,inverse(sk_c8))))) != sk_c10 | multiply(A,multiply(B,C)) != sk_c10 | multiply(inverse(sk_c10),sk_c9) != sk_c10 | inverse(sk_c9) != sk_c9. [back_rewrite(9472),rewrite([10097(1),10097(27)]),xx(a)].
% 6.29/6.59 11489 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | inverse(B) != sk_c10 | multiply(B,sk_c8) != sk_c10 | inverse(C) != sk_c10 | multiply(C,sk_c9) != sk_c10 | multiply(A,sk_c8) != sk_c9 | multiply(A,sk_c9) != sk_c9 | multiply(sk_c9,sk_c8) != sk_c9. [back_rewrite(7625),rewrite([10097(1)]),xx(a)].
% 6.29/6.59 11700 multiply(A,inverse(A)) = sk_c9. [back_rewrite(6940),rewrite([10097(3)])].
% 6.29/6.59 11805 inverse(sk_c9) = sk_c9. [back_rewrite(6612),rewrite([10097(1),10097(3)])].
% 6.29/6.59 11806 multiply(A,sk_c9) = A. [back_rewrite(6579),rewrite([10097(1)])].
% 6.29/6.59 11816 multiply(inverse(A),A) = sk_c9. [back_rewrite(2),rewrite([10097(3)])].
% 6.29/6.59 11817 multiply(sk_c9,A) = A. [back_rewrite(1),rewrite([10097(1)])].
% 6.29/6.59 12024 sk_c8 != sk_c9 | inverse(A) != sk_c10 | multiply(A,sk_c8) != sk_c10 | inverse(B) != sk_c10 | sk_c10 != B. [factor(11489,g,i),rewrite([11806(3),11805(5),11806(18),11817(21),11806(24)]),flip(a),flip(f),xx(b),xx(h),merge(f)].
% 6.29/6.59 12428 sk_c8 != sk_c9 | inverse(multiply(A,multiply(B,multiply(C,inverse(sk_c8))))) != sk_c10 | multiply(A,multiply(B,C)) != sk_c10 | inverse(sk_c10) != sk_c10. [back_rewrite(10413),rewrite([11806(19),11805(21)]),xx(e)].
% 6.29/6.59 12448 inverse(sk_c5) = sk_c9 | sk_c2 = sk_c8. [back_rewrite(9106),rewrite([11805(7),11806(7)]),flip(b)].
% 6.29/6.59 12741 sk_c2 = sk_c8 | inverse(sk_c5) = sk_c8. [back_rewrite(6549),rewrite([11806(3),11806(7)])].
% 6.29/6.59 12747 inverse(sk_c2) = sk_c9 | inverse(sk_c5) = sk_c8. [back_rewrite(6534),rewrite([11806(8)])].
% 6.29/6.59 15457 multiply(sk_c3,sk_c8) = sk_c10 | sk_c4 = sk_c10. [back_rewrite(41),rewrite([11806(8)])].
% 6.29/6.59 15463 inverse(sk_c3) = sk_c10 | sk_c4 = sk_c10. [back_rewrite(26),rewrite([11806(7)])].
% 6.29/6.59 15853 inverse(sk_c4) = sk_c10 | multiply(sk_c10,inverse(sk_c8)) = sk_c3. [para(11700(a,1),192(b,1,2)),rewrite([11806(7)]),flip(b)].
% 6.29/6.59 15949 sk_c8 != sk_c9 | inverse(multiply(A,B)) != sk_c10 | multiply(A,multiply(B,sk_c8)) != sk_c10 | inverse(C) != sk_c10 | sk_c10 != C. [para(45(a,1),12024(c,1))].
% 6.29/6.59 16022 sk_c2 = sk_c8 | sk_c8 = sk_c9. [para(12741(b,1),12448(a,1)),merge(c)].
% 6.29/6.59 16064 sk_c4 = sk_c10 | inverse(sk_c10) = sk_c3. [para(15463(a,1),7301(a,1,1))].
% 6.29/6.59 16337 sk_c8 != sk_c9 | inverse(multiply(A,inverse(sk_c8))) != sk_c10 | sk_c10 != A | inverse(B) != sk_c10 | sk_c10 != B. [para(11816(a,1),15949(c,1,2)),rewrite([11806(11)]),flip(c)].
% 6.29/6.59 16351 sk_c8 != sk_c9 | inverse(multiply(A,inverse(sk_c8))) != sk_c10 | sk_c10 != A | inverse(A) != sk_c10. [factor(16337,c,e)].
% 6.29/6.59 16352 sk_c8 != sk_c9 | inverse(multiply(A,multiply(B,inverse(sk_c8)))) != sk_c10 | multiply(A,B) != sk_c10 | inverse(multiply(A,B)) != sk_c10. [para(45(a,1),16351(b,1,1)),flip(c)].
% 6.29/6.59 16470 sk_c8 != sk_c9 | inverse(A) != sk_c10 | multiply(A,sk_c8) != sk_c10 | inverse(multiply(A,sk_c8)) != sk_c10. [para(11700(a,1),16352(b,1,1,2)),rewrite([11806(5)])].
% 6.29/6.59 17317 inverse(sk_c2) = sk_c9 | sk_c8 = sk_c9. [para(12747(b,1),7(b,1)),merge(b)].
% 6.29/6.59 17364 sk_c8 != sk_c9 | inverse(A) != sk_c10 | multiply(A,multiply(inverse(multiply(B,inverse(sk_c8))),B)) != sk_c10 | inverse(sk_c10) != sk_c10. [para(11816(a,1),12428(b,1,1,2)),rewrite([11806(5)])].
% 6.29/6.59 17405 sk_c8 != sk_c9 | inverse(multiply(sk_c10,inverse(sk_c8))) != sk_c10 | inverse(sk_c10) != sk_c10. [resolve(17364,c,7300,a)].
% 6.29/6.59 17422 sk_c8 = sk_c9 | sk_c2 = sk_c9. [para(17317(a,1),7301(a,1,1)),rewrite([11805(5)]),flip(b)].
% 6.29/6.59 17425 sk_c8 = sk_c9. [para(17422(b,1),16022(a,1)),flip(b),merge(b),merge(c)].
% 6.29/6.59 17441 inverse(sk_c10) != sk_c10. [back_rewrite(17405),rewrite([17425(1),17425(5),11805(6),11806(6)]),xx(a),merge(b)].
% 6.29/6.59 17612 inverse(A) != sk_c10 | sk_c10 != A. [back_rewrite(16470),rewrite([17425(1),17425(7),11806(8),17425(9),11806(10)]),flip(c),xx(a),merge(c)].
% 6.29/6.59 17676 inverse(sk_c4) = sk_c10 | sk_c3 = sk_c10. [back_rewrite(15853),rewrite([17425(6),11805(7),11806(7)]),flip(b)].
% 6.29/6.59 17694 sk_c3 = sk_c10 | sk_c4 = sk_c10. [back_rewrite(15457),rewrite([17425(2),11806(3)])].
% 6.29/6.59 17787 sk_c4 = sk_c10 | sk_c3 != sk_c10. [para(16064(b,1),17441(a,1))].
% 6.29/6.59 17792 sk_c4 != sk_c10 | inverse(sk_c3) = sk_c10. [resolve(17612,a,9,b),flip(a)].
% 6.29/6.59 17855 sk_c3 = sk_c10. [para(17694(b,1),17676(a,1,1)),merge(c),unit_del(b,17441)].
% 6.29/6.59 17869 sk_c4 != sk_c10. [back_rewrite(17792),rewrite([17855(4)]),unit_del(b,17441)].
% 6.29/6.59 17872 $F. [back_rewrite(17787),rewrite([17855(4)]),xx(b),unit_del(a,17869)].
% 6.29/6.59
% 6.29/6.59 % SZS output end Refutation
% 6.29/6.59 ============================== end of proof ==========================
% 6.29/6.59
% 6.29/6.59 ============================== STATISTICS ============================
% 6.29/6.59
% 6.29/6.59 Given=528. Generated=70269. Kept=17871. proofs=1.
% 6.29/6.59 Usable=74. Sos=318. Demods=24. Limbo=17, Disabled=17508. Hints=0.
% 6.29/6.59 Megabytes=22.14.
% 6.29/6.59 User_CPU=5.54, System_CPU=0.06, Wall_clock=5.
% 6.29/6.59
% 6.29/6.59 ============================== end of statistics =====================
% 6.29/6.59
% 6.29/6.59 ============================== end of search =========================
% 6.29/6.59
% 6.29/6.59 THEOREM PROVED
% 6.29/6.59 % SZS status Unsatisfiable
% 6.29/6.59
% 6.29/6.59 Exiting with 1 proof.
% 6.29/6.59
% 6.29/6.59 Process 14883 exit (max_proofs) Mon Jun 13 08:28:43 2022
% 6.29/6.59 Prover9 interrupted
%------------------------------------------------------------------------------