TSTP Solution File: GRP369-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP369-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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:47 EDT 2022
% Result : Unsatisfiable 2.80s 3.12s
% Output : Refutation 2.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP369-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 14:05:54 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.80/3.12 ============================== Prover9 ===============================
% 2.80/3.12 Prover9 (32) version 2009-11A, November 2009.
% 2.80/3.12 Process 31251 was started by sandbox on n004.cluster.edu,
% 2.80/3.12 Tue Jun 14 14:05:54 2022
% 2.80/3.12 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_30875_n004.cluster.edu".
% 2.80/3.12 ============================== end of head ===========================
% 2.80/3.12
% 2.80/3.12 ============================== INPUT =================================
% 2.80/3.12
% 2.80/3.12 % Reading from file /tmp/Prover9_30875_n004.cluster.edu
% 2.80/3.12
% 2.80/3.12 set(prolog_style_variables).
% 2.80/3.12 set(auto2).
% 2.80/3.12 % set(auto2) -> set(auto).
% 2.80/3.12 % set(auto) -> set(auto_inference).
% 2.80/3.12 % set(auto) -> set(auto_setup).
% 2.80/3.12 % set(auto_setup) -> set(predicate_elim).
% 2.80/3.12 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.80/3.12 % set(auto) -> set(auto_limits).
% 2.80/3.12 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.80/3.12 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.80/3.12 % set(auto) -> set(auto_denials).
% 2.80/3.12 % set(auto) -> set(auto_process).
% 2.80/3.12 % set(auto2) -> assign(new_constants, 1).
% 2.80/3.12 % set(auto2) -> assign(fold_denial_max, 3).
% 2.80/3.12 % set(auto2) -> assign(max_weight, "200.000").
% 2.80/3.12 % set(auto2) -> assign(max_hours, 1).
% 2.80/3.12 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.80/3.12 % set(auto2) -> assign(max_seconds, 0).
% 2.80/3.12 % set(auto2) -> assign(max_minutes, 5).
% 2.80/3.12 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.80/3.12 % set(auto2) -> set(sort_initial_sos).
% 2.80/3.12 % set(auto2) -> assign(sos_limit, -1).
% 2.80/3.12 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.80/3.12 % set(auto2) -> assign(max_megs, 400).
% 2.80/3.12 % set(auto2) -> assign(stats, some).
% 2.80/3.12 % set(auto2) -> clear(echo_input).
% 2.80/3.12 % set(auto2) -> set(quiet).
% 2.80/3.12 % set(auto2) -> clear(print_initial_clauses).
% 2.80/3.12 % set(auto2) -> clear(print_given).
% 2.80/3.12 assign(lrs_ticks,-1).
% 2.80/3.12 assign(sos_limit,10000).
% 2.80/3.12 assign(order,kbo).
% 2.80/3.12 set(lex_order_vars).
% 2.80/3.12 clear(print_given).
% 2.80/3.12
% 2.80/3.12 % formulas(sos). % not echoed (46 formulas)
% 2.80/3.12
% 2.80/3.12 ============================== end of input ==========================
% 2.80/3.12
% 2.80/3.12 % From the command line: assign(max_seconds, 300).
% 2.80/3.12
% 2.80/3.12 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.80/3.12
% 2.80/3.12 % Formulas that are not ordinary clauses:
% 2.80/3.12
% 2.80/3.12 ============================== end of process non-clausal formulas ===
% 2.80/3.12
% 2.80/3.12 ============================== PROCESS INITIAL CLAUSES ===============
% 2.80/3.12
% 2.80/3.12 ============================== PREDICATE ELIMINATION =================
% 2.80/3.12
% 2.80/3.12 ============================== end predicate elimination =============
% 2.80/3.12
% 2.80/3.12 Auto_denials: (non-Horn, no changes).
% 2.80/3.12
% 2.80/3.12 Term ordering decisions:
% 2.80/3.12
% 2.80/3.12 % Assigning unary symbol inverse kb_weight 0 and highest precedence (13).
% 2.80/3.12 Function symbol KB weights: sk_c9=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.
% 2.80/3.12
% 2.80/3.12 ============================== end of process initial clauses ========
% 2.80/3.12
% 2.80/3.12 ============================== CLAUSES FOR SEARCH ====================
% 2.80/3.12
% 2.80/3.12 ============================== end of clauses for search =============
% 2.80/3.12
% 2.80/3.12 ============================== SEARCH ================================
% 2.80/3.12
% 2.80/3.12 % Starting search at 0.02 seconds.
% 2.80/3.12
% 2.80/3.12 Low Water (keep): wt=58.000, iters=3481
% 2.80/3.12
% 2.80/3.12 Low Water (keep): wt=57.000, iters=3665
% 2.80/3.12
% 2.80/3.12 Low Water (keep): wt=53.000, iters=3367
% 2.80/3.12
% 2.80/3.12 Low Water (keep): wt=50.000, iters=3375
% 2.80/3.12
% 2.80/3.12 Low Water (keep): wt=45.000, iters=3421
% 2.80/3.12
% 2.80/3.12 Low Water (keep): wt=44.000, iters=3540
% 2.80/3.12
% 2.80/3.12 Low Water (keep): wt=43.000, iters=3384
% 2.80/3.12
% 2.80/3.12 Low Water (keep): wt=42.000, iters=3465
% 2.80/3.12
% 2.80/3.12 Low Water (keep): wt=41.000, iters=3388
% 2.80/3.12
% 2.80/3.12 Low Water (keep): wt=40.000, iters=3384
% 2.80/3.12
% 2.80/3.12 Low Water (keep): wt=39.000, iters=3341
% 2.80/3.12
% 2.80/3.12 Low Water (keep): wt=38.000, iters=3344
% 2.80/3.12
% 2.80/3.12 Low Water (keep): wt=37.000, iters=3381
% 2.80/3.12
% 2.80/3.12 ============================== PROOF =================================
% 2.80/3.12 % SZS status Unsatisfiable
% 2.80/3.12 % SZS output start Refutation
% 2.80/3.12
% 2.80/3.12 % Proof 1 at 2.16 (+ 0.03) seconds.
% 2.80/3.12 % Length of proof is 80.
% 2.80/3.12 % Level of proof is 26.
% 2.80/3.12 % Maximum clause weight is 59.000.
% 2.80/3.12 % Given clauses 576.
% 2.80/3.12
% 2.80/3.12 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 2.80/3.12 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 2.80/3.12 3 inverse(sk_c1) = sk_c9 | inverse(sk_c8) = sk_c7 # label(prove_this_22) # label(negated_conjecture). [assumption].
% 2.80/3.12 4 inverse(sk_c1) = sk_c9 | inverse(sk_c4) = sk_c8 # label(prove_this_24) # label(negated_conjecture). [assumption].
% 2.80/3.12 9 inverse(sk_c3) = sk_c7 | inverse(sk_c5) = sk_c8 # label(prove_this_40) # label(negated_conjecture). [assumption].
% 2.80/3.12 11 multiply(sk_c7,sk_c9) = sk_c8 | inverse(sk_c8) = sk_c7 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 2.80/3.12 18 multiply(sk_c9,sk_c2) = sk_c8 | inverse(sk_c6) = sk_c9 # label(prove_this_14) # label(negated_conjecture). [assumption].
% 2.80/3.12 22 multiply(sk_c1,sk_c9) = sk_c2 | inverse(sk_c6) = sk_c9 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 2.80/3.12 23 inverse(sk_c1) = sk_c9 | multiply(sk_c4,sk_c8) = sk_c7 # label(prove_this_23) # label(negated_conjecture). [assumption].
% 2.80/3.12 28 multiply(sk_c3,sk_c7) = sk_c9 | inverse(sk_c5) = sk_c8 # label(prove_this_33) # label(negated_conjecture). [assumption].
% 2.80/3.12 31 inverse(sk_c3) = sk_c7 | multiply(sk_c5,sk_c8) = sk_c9 # label(prove_this_39) # label(negated_conjecture). [assumption].
% 2.80/3.12 38 multiply(sk_c9,sk_c2) = sk_c8 | multiply(sk_c6,sk_c9) = sk_c7 # label(prove_this_13) # label(negated_conjecture). [assumption].
% 2.80/3.12 41 multiply(sk_c1,sk_c9) = sk_c2 | multiply(sk_c6,sk_c9) = sk_c7 # label(prove_this_20) # label(negated_conjecture). [assumption].
% 2.80/3.12 43 multiply(sk_c3,sk_c7) = sk_c9 | multiply(sk_c5,sk_c8) = sk_c9 # label(prove_this_32) # label(negated_conjecture). [assumption].
% 2.80/3.12 45 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 2.80/3.12 46 multiply(sk_c7,sk_c9) != sk_c8 | multiply(sk_c9,A) != sk_c8 | multiply(B,sk_c9) != A | inverse(B) != sk_c9 | multiply(C,sk_c7) != sk_c9 | inverse(C) != sk_c7 | 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.80/3.12 66 inverse(sk_c8) = sk_c7 | multiply(sk_c9,sk_c1) = identity. [para(3(a,1),2(a,1,1))].
% 2.80/3.12 74 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),45(a,1,1)),rewrite([1(2)]),flip(a)].
% 2.80/3.12 75 inverse(sk_c8) = sk_c7 | multiply(sk_c7,multiply(sk_c9,A)) = multiply(sk_c8,A). [para(11(a,1),45(a,1,1)),flip(b)].
% 2.80/3.12 97 inverse(sk_c6) = sk_c9 | multiply(sk_c1,multiply(sk_c9,A)) = multiply(sk_c2,A). [para(22(a,1),45(a,1,1)),flip(b)].
% 2.80/3.12 180 multiply(sk_c7,sk_c9) != sk_c8 | multiply(sk_c9,A) != sk_c8 | multiply(B,sk_c9) != A | inverse(B) != sk_c9 | identity != sk_c9 | inverse(inverse(sk_c7)) != sk_c7 | inverse(sk_c8) != sk_c7 | multiply(C,sk_c8) != sk_c7 | inverse(C) != sk_c8 | multiply(D,sk_c8) != sk_c9 | inverse(D) != sk_c8 | multiply(E,sk_c9) != sk_c7 | inverse(E) != sk_c9. [para(2(a,1),46(e,1))].
% 2.80/3.12 1186 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),74(a,1,2))].
% 2.80/3.12 1201 inverse(sk_c6) = sk_c9 | multiply(inverse(sk_c9),sk_c8) = sk_c2. [para(18(a,1),74(a,1,2))].
% 2.80/3.12 1230 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(74(a,1),74(a,1,2))].
% 2.80/3.12 1231 multiply(A,identity) = A. [back_rewrite(1186),rewrite([1230(4)])].
% 2.80/3.12 1242 inverse(identity) = identity. [para(1231(a,1),2(a,1))].
% 2.80/3.12 1461 multiply(A,inverse(A)) = identity. [para(1230(a,1),2(a,1))].
% 2.80/3.12 1531 inverse(inverse(A)) = A. [para(1230(a,1),1231(a,1)),rewrite([1231(2)]),flip(a)].
% 2.80/3.12 1636 multiply(sk_c7,sk_c9) != sk_c8 | multiply(sk_c9,A) != sk_c8 | multiply(B,sk_c9) != A | inverse(B) != sk_c9 | identity != sk_c9 | inverse(sk_c8) != sk_c7 | multiply(C,sk_c8) != sk_c7 | inverse(C) != sk_c8 | multiply(D,sk_c8) != sk_c9 | inverse(D) != sk_c8 | multiply(E,sk_c9) != sk_c7 | inverse(E) != sk_c9. [back_rewrite(180),rewrite([1531(21)]),xx(f)].
% 2.80/3.12 1640 inverse(sk_c8) = sk_c7 | multiply(sk_c8,sk_c1) = sk_c7. [para(66(b,1),75(b,1,2)),rewrite([1231(11)]),flip(c),merge(b)].
% 2.80/3.12 1650 inverse(sk_c1) = sk_c9 | multiply(sk_c4,sk_c8) = identity. [para(4(b,1),1461(a,1,2))].
% 2.80/3.12 1654 inverse(sk_c3) = sk_c7 | multiply(sk_c5,sk_c8) = identity. [para(9(b,1),1461(a,1,2))].
% 2.80/3.12 1672 inverse(sk_c8) = sk_c7 | multiply(sk_c8,inverse(sk_c9)) = sk_c7. [para(1461(a,1),75(b,1,2)),rewrite([1231(7)]),flip(b)].
% 2.80/3.12 2621 inverse(sk_c1) = sk_c9 | identity = sk_c7. [para(1650(b,1),23(b,1)),merge(b)].
% 2.80/3.12 2699 identity = sk_c7 | inverse(sk_c9) = sk_c1. [para(2621(a,1),1531(a,1,1))].
% 2.80/3.12 3256 inverse(sk_c3) = sk_c7 | identity = sk_c9. [para(1654(b,1),31(b,1)),merge(b)].
% 2.80/3.12 3342 identity = sk_c9 | multiply(sk_c3,sk_c7) = identity. [para(3256(a,1),1461(a,1,2))].
% 2.80/3.12 3509 identity = sk_c9 | inverse(sk_c5) = sk_c8. [para(3342(b,1),28(a,1)),merge(b)].
% 2.80/3.12 3619 identity = sk_c9 | multiply(sk_c5,sk_c8) = identity. [para(3509(b,1),1461(a,1,2))].
% 2.80/3.12 4664 inverse(sk_c6) = sk_c9 | multiply(sk_c2,inverse(sk_c9)) = sk_c1. [para(1461(a,1),97(b,1,2)),rewrite([1231(7)]),flip(b)].
% 2.80/3.12 5631 identity = sk_c9 | multiply(sk_c3,sk_c7) = sk_c9. [para(3619(b,1),43(b,1)),merge(c)].
% 2.80/3.12 7343 identity = sk_c9. [para(5631(b,1),3342(b,1)),flip(c),merge(b),merge(c)].
% 2.80/3.12 9656 sk_c7 = sk_c9 | inverse(sk_c9) = sk_c1. [back_rewrite(2699),rewrite([7343(1)]),flip(a)].
% 2.80/3.12 10081 multiply(sk_c7,sk_c9) != 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_c8) != sk_c9 | inverse(D) != sk_c8 | multiply(E,sk_c9) != sk_c7 | inverse(E) != sk_c9. [back_rewrite(1636),rewrite([7343(16)]),xx(e)].
% 2.80/3.12 10138 inverse(sk_c9) = sk_c9. [back_rewrite(1242),rewrite([7343(1),7343(3)])].
% 2.80/3.12 10139 multiply(A,sk_c9) = A. [back_rewrite(1231),rewrite([7343(1)])].
% 2.80/3.12 10148 multiply(inverse(A),A) = sk_c9. [back_rewrite(2),rewrite([7343(3)])].
% 2.80/3.12 10149 multiply(sk_c9,A) = A. [back_rewrite(1),rewrite([7343(1)])].
% 2.80/3.12 10197 sk_c7 != sk_c8 | sk_c7 != A | inverse(A) != sk_c9 | inverse(sk_c8) != sk_c7 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | multiply(C,sk_c8) != sk_c9 | inverse(C) != sk_c8. [factor(10081,c,j),rewrite([10139(3),10149(6),10139(8)]),flip(c),merge(b),merge(j)].
% 2.80/3.12 10238 sk_c7 = sk_c9 | sk_c1 = sk_c9. [back_rewrite(9656),rewrite([10138(5)]),flip(b)].
% 2.80/3.12 10306 inverse(sk_c6) = sk_c9 | sk_c2 = sk_c1. [back_rewrite(4664),rewrite([10138(7),10139(7)])].
% 2.80/3.12 10346 inverse(sk_c8) = sk_c7 | sk_c7 = sk_c8. [back_rewrite(1672),rewrite([10138(7),10139(7)]),flip(b)].
% 2.80/3.12 10363 inverse(sk_c6) = sk_c9 | sk_c2 = sk_c8. [back_rewrite(1201),rewrite([10138(6),10149(7)]),flip(b)].
% 2.80/3.12 10815 sk_c2 = sk_c1 | sk_c6 = sk_c7. [back_rewrite(41),rewrite([10139(3),10139(6)]),flip(a)].
% 2.80/3.12 10818 sk_c2 = sk_c8 | sk_c6 = sk_c7. [back_rewrite(38),rewrite([10149(3),10139(6)])].
% 2.80/3.12 11027 sk_c7 != sk_c8 | inverse(sk_c8) != sk_c9 | inverse(sk_c8) != sk_c7 | multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | multiply(B,sk_c8) != sk_c9 | inverse(B) != sk_c8. [factor(10197,a,b)].
% 2.80/3.12 11548 sk_c2 = sk_c1 | sk_c6 = sk_c9. [para(10306(a,1),1531(a,1,1)),rewrite([10138(5)]),flip(b)].
% 2.80/3.12 11550 sk_c2 = sk_c1 | sk_c7 = sk_c9. [para(11548(b,1),10815(b,1)),flip(c),merge(b)].
% 2.80/3.12 11551 sk_c7 = sk_c9 | sk_c2 = sk_c9. [para(10238(b,1),11550(a,2)),merge(c)].
% 2.80/3.12 11684 sk_c7 != sk_c8 | inverse(sk_c8) != sk_c9 | inverse(sk_c8) != sk_c7 | multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8. [resolve(11027,f,10148,a),rewrite([1531(21)]),xx(f)].
% 2.80/3.12 11692 sk_c7 != sk_c8 | inverse(sk_c8) != sk_c9 | inverse(sk_c8) != sk_c7 | multiply(A,multiply(B,sk_c8)) != sk_c7 | inverse(multiply(A,B)) != sk_c8. [para(45(a,1),11684(d,1))].
% 2.80/3.12 11711 sk_c7 != sk_c8 | inverse(sk_c8) != sk_c9 | inverse(sk_c8) != sk_c7 | sk_c7 != A | inverse(multiply(A,inverse(sk_c8))) != sk_c8. [para(10148(a,1),11692(d,1,2)),rewrite([10139(13)]),flip(d)].
% 2.80/3.12 11771 sk_c7 != sk_c8 | inverse(sk_c8) != sk_c9 | inverse(sk_c8) != sk_c7 | multiply(A,B) != sk_c7 | inverse(multiply(A,multiply(B,inverse(sk_c8)))) != sk_c8. [para(45(a,1),11711(e,1,1)),flip(d)].
% 2.80/3.12 11779 sk_c7 != sk_c8 | inverse(sk_c8) != sk_c9 | inverse(sk_c8) != sk_c7 | multiply(A,multiply(B,C)) != sk_c7 | inverse(multiply(A,multiply(B,multiply(C,inverse(sk_c8))))) != sk_c8. [para(45(a,1),11771(e,1,1,2))].
% 2.80/3.12 11844 sk_c7 = sk_c8 | inverse(sk_c7) = sk_c8. [para(10346(a,1),1531(a,1,1))].
% 2.80/3.12 12072 sk_c2 = sk_c8 | sk_c6 = sk_c9. [para(10363(a,1),1531(a,1,1)),rewrite([10138(5)]),flip(b)].
% 2.80/3.12 12102 sk_c7 != sk_c8 | inverse(sk_c8) != sk_c9 | inverse(sk_c8) != sk_c7 | multiply(A,multiply(inverse(multiply(B,inverse(sk_c8))),B)) != sk_c7 | inverse(A) != sk_c8. [para(10148(a,1),11779(e,1,1,2)),rewrite([10139(21)])].
% 2.80/3.12 12120 sk_c7 != sk_c8 | inverse(sk_c8) != sk_c9 | inverse(sk_c8) != sk_c7 | multiply(A,multiply(B,multiply(inverse(multiply(C,inverse(sk_c8))),C))) != sk_c7 | inverse(multiply(A,B)) != sk_c8. [para(45(a,1),12102(d,1))].
% 2.80/3.12 12180 sk_c2 = sk_c8 | sk_c7 = sk_c9. [para(12072(b,1),10818(b,1)),flip(c),merge(b)].
% 2.80/3.12 12181 sk_c7 = sk_c9 | sk_c1 = sk_c8. [para(12180(a,1),11550(a,1)),flip(b),merge(c)].
% 2.80/3.12 12182 sk_c7 = sk_c9 | sk_c8 = sk_c9. [para(12180(a,1),11551(b,1)),merge(b)].
% 2.80/3.12 12189 sk_c7 = sk_c9 | inverse(sk_c8) = sk_c7 | multiply(sk_c8,sk_c8) = sk_c7. [para(12181(b,1),1640(b,1,2))].
% 2.80/3.12 12805 sk_c7 != sk_c8 | inverse(sk_c8) != sk_c9 | inverse(sk_c8) != sk_c7 | sk_c7 != A | inverse(multiply(A,inverse(multiply(inverse(multiply(B,inverse(sk_c8))),B)))) != sk_c8. [para(10148(a,1),12120(d,1,2)),rewrite([10139(13)]),flip(d)].
% 2.80/3.12 12817 sk_c7 != sk_c8 | inverse(sk_c8) != sk_c9 | inverse(sk_c8) != sk_c7 | inverse(multiply(sk_c8,inverse(multiply(inverse(multiply(A,inverse(sk_c8))),A)))) != sk_c8. [factor(12805,a,d)].
% 2.80/3.12 12818 sk_c7 != sk_c8 | inverse(sk_c8) != sk_c9 | inverse(sk_c8) != sk_c7 | inverse(multiply(sk_c8,inverse(multiply(inverse(multiply(A,multiply(B,inverse(sk_c8)))),multiply(A,B))))) != sk_c8. [para(45(a,1),12817(d,1,1,2,1,1,1))].
% 2.80/3.12 12856 sk_c7 != sk_c8 | inverse(sk_c8) != sk_c9 | inverse(sk_c8) != sk_c7 | inverse(multiply(sk_c8,inverse(multiply(inverse(multiply(A,multiply(B,multiply(C,inverse(sk_c8))))),multiply(A,multiply(B,C)))))) != sk_c8. [para(45(a,1),12818(d,1,1,2,1,1,1,2))].
% 2.80/3.12 13691 sk_c8 = sk_c9 | sk_c7 = sk_c8. [para(12182(a,1),11844(b,1,1)),rewrite([10138(8)]),flip(c),merge(c)].
% 2.80/3.12 13709 sk_c8 = sk_c9. [para(13691(b,1),12182(a,1)),merge(b),merge(c)].
% 2.80/3.12 14000 sk_c7 != sk_c9. [back_rewrite(12856),rewrite([13709(2),13709(4),10138(5),13709(7),10138(8),13709(10),13709(11),10138(12),10139(12),10148(16),10138(12),10139(12),10138(11),13709(11)]),flip(c),xx(b),xx(d),merge(b)].
% 2.80/3.12 14024 $F. [back_rewrite(12189),rewrite([13709(4),10138(5),13709(7),13709(8),10139(9)]),flip(b),flip(c),merge(b),merge(c),unit_del(a,14000)].
% 2.80/3.12
% 2.80/3.12 % SZS output end Refutation
% 2.80/3.12 ============================== end of proof ==========================
% 2.80/3.12
% 2.80/3.12 ============================== STATISTICS ============================
% 2.80/3.12
% 2.80/3.12 Given=576. Generated=39052. Kept=14023. proofs=1.
% 2.80/3.12 Usable=170. Sos=1596. Demods=17. Limbo=315, Disabled=11988. Hints=0.
% 2.80/3.12 Megabytes=16.00.
% 2.80/3.12 User_CPU=2.16, System_CPU=0.03, Wall_clock=2.
% 2.80/3.12
% 2.80/3.12 ============================== end of statistics =====================
% 2.80/3.12
% 2.80/3.12 ============================== end of search =========================
% 2.80/3.12
% 2.80/3.12 THEOREM PROVED
% 2.80/3.12 % SZS status Unsatisfiable
% 2.80/3.12
% 2.80/3.12 Exiting with 1 proof.
% 2.80/3.12
% 2.80/3.12 Process 31251 exit (max_proofs) Tue Jun 14 14:05:56 2022
% 2.80/3.12 Prover9 interrupted
%------------------------------------------------------------------------------