TSTP Solution File: GRP266-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP266-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:24 EDT 2022
% Result : Unsatisfiable 2.43s 2.75s
% Output : Refutation 2.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP266-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n008.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 : Mon Jun 13 20:11:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.43/2.75 ============================== Prover9 ===============================
% 2.43/2.75 Prover9 (32) version 2009-11A, November 2009.
% 2.43/2.75 Process 12533 was started by sandbox on n008.cluster.edu,
% 2.43/2.75 Mon Jun 13 20:11:23 2022
% 2.43/2.75 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12377_n008.cluster.edu".
% 2.43/2.75 ============================== end of head ===========================
% 2.43/2.75
% 2.43/2.75 ============================== INPUT =================================
% 2.43/2.75
% 2.43/2.75 % Reading from file /tmp/Prover9_12377_n008.cluster.edu
% 2.43/2.75
% 2.43/2.75 set(prolog_style_variables).
% 2.43/2.75 set(auto2).
% 2.43/2.75 % set(auto2) -> set(auto).
% 2.43/2.75 % set(auto) -> set(auto_inference).
% 2.43/2.75 % set(auto) -> set(auto_setup).
% 2.43/2.75 % set(auto_setup) -> set(predicate_elim).
% 2.43/2.75 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.43/2.75 % set(auto) -> set(auto_limits).
% 2.43/2.75 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.43/2.75 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.43/2.75 % set(auto) -> set(auto_denials).
% 2.43/2.75 % set(auto) -> set(auto_process).
% 2.43/2.75 % set(auto2) -> assign(new_constants, 1).
% 2.43/2.75 % set(auto2) -> assign(fold_denial_max, 3).
% 2.43/2.75 % set(auto2) -> assign(max_weight, "200.000").
% 2.43/2.75 % set(auto2) -> assign(max_hours, 1).
% 2.43/2.75 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.43/2.75 % set(auto2) -> assign(max_seconds, 0).
% 2.43/2.75 % set(auto2) -> assign(max_minutes, 5).
% 2.43/2.75 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.43/2.75 % set(auto2) -> set(sort_initial_sos).
% 2.43/2.75 % set(auto2) -> assign(sos_limit, -1).
% 2.43/2.75 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.43/2.75 % set(auto2) -> assign(max_megs, 400).
% 2.43/2.75 % set(auto2) -> assign(stats, some).
% 2.43/2.75 % set(auto2) -> clear(echo_input).
% 2.43/2.75 % set(auto2) -> set(quiet).
% 2.43/2.75 % set(auto2) -> clear(print_initial_clauses).
% 2.43/2.75 % set(auto2) -> clear(print_given).
% 2.43/2.75 assign(lrs_ticks,-1).
% 2.43/2.75 assign(sos_limit,10000).
% 2.43/2.75 assign(order,kbo).
% 2.43/2.75 set(lex_order_vars).
% 2.43/2.75 clear(print_given).
% 2.43/2.75
% 2.43/2.75 % formulas(sos). % not echoed (53 formulas)
% 2.43/2.75
% 2.43/2.75 ============================== end of input ==========================
% 2.43/2.75
% 2.43/2.75 % From the command line: assign(max_seconds, 300).
% 2.43/2.75
% 2.43/2.75 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.43/2.75
% 2.43/2.75 % Formulas that are not ordinary clauses:
% 2.43/2.75
% 2.43/2.75 ============================== end of process non-clausal formulas ===
% 2.43/2.75
% 2.43/2.75 ============================== PROCESS INITIAL CLAUSES ===============
% 2.43/2.75
% 2.43/2.75 ============================== PREDICATE ELIMINATION =================
% 2.43/2.75
% 2.43/2.75 ============================== end predicate elimination =============
% 2.43/2.75
% 2.43/2.75 Auto_denials: (non-Horn, no changes).
% 2.43/2.75
% 2.43/2.75 Term ordering decisions:
% 2.43/2.75
% 2.43/2.75 % Assigning unary symbol inverse kb_weight 0 and highest precedence (15).
% 2.43/2.75 Function symbol KB weights: sk_c10=1. sk_c9=1. sk_c11=1. sk_c1=1. sk_c2=1. sk_c3=1. sk_c4=1. sk_c5=1. sk_c6=1. sk_c7=1. sk_c8=1. identity=1. multiply=1. inverse=0.
% 2.43/2.75
% 2.43/2.75 ============================== end of process initial clauses ========
% 2.43/2.75
% 2.43/2.75 ============================== CLAUSES FOR SEARCH ====================
% 2.43/2.75
% 2.43/2.75 ============================== end of clauses for search =============
% 2.43/2.75
% 2.43/2.75 ============================== SEARCH ================================
% 2.43/2.75
% 2.43/2.75 % Starting search at 0.02 seconds.
% 2.43/2.75
% 2.43/2.75 Low Water (keep): wt=44.000, iters=3405
% 2.43/2.75
% 2.43/2.75 Low Water (keep): wt=43.000, iters=3368
% 2.43/2.75
% 2.43/2.75 Low Water (keep): wt=42.000, iters=3388
% 2.43/2.75
% 2.43/2.75 Low Water (keep): wt=40.000, iters=3334
% 2.43/2.75
% 2.43/2.75 Low Water (keep): wt=35.000, iters=3355
% 2.43/2.75
% 2.43/2.75 Low Water (keep): wt=34.000, iters=3454
% 2.43/2.75
% 2.43/2.75 Low Water (keep): wt=32.000, iters=3364
% 2.43/2.75
% 2.43/2.75 Low Water (keep): wt=29.000, iters=3363
% 2.43/2.75
% 2.43/2.75 Low Water (keep): wt=28.000, iters=3344
% 2.43/2.75
% 2.43/2.75 Low Water (keep): wt=27.000, iters=3538
% 2.43/2.75
% 2.43/2.75 Low Water (keep): wt=26.000, iters=3490
% 2.43/2.75
% 2.43/2.75 Low Water (keep): wt=25.000, iters=3423
% 2.43/2.75
% 2.43/2.75 Low Water (keep): wt=24.000, iters=3459
% 2.43/2.75
% 2.43/2.75 ============================== PROOF =================================
% 2.43/2.75 % SZS status Unsatisfiable
% 2.43/2.75 % SZS output start Refutation
% 2.43/2.75
% 2.43/2.75 % Proof 1 at 1.74 (+ 0.03) seconds.
% 2.43/2.75 % Length of proof is 96.
% 2.43/2.75 % Level of proof is 20.
% 2.43/2.75 % Maximum clause weight is 64.000.
% 2.43/2.75 % Given clauses 611.
% 2.43/2.75
% 2.43/2.75 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 2.43/2.75 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 2.43/2.75 3 inverse(sk_c1) = sk_c11 | inverse(sk_c5) = sk_c11 # label(prove_this_9) # label(negated_conjecture). [assumption].
% 2.43/2.75 11 inverse(sk_c3) = sk_c10 | inverse(sk_c7) = sk_c9 # label(prove_this_49) # label(negated_conjecture). [assumption].
% 2.43/2.75 12 multiply(sk_c1,sk_c11) = sk_c10 | inverse(sk_c5) = sk_c11 # label(prove_this_2) # label(negated_conjecture). [assumption].
% 2.43/2.75 15 inverse(sk_c1) = sk_c11 | multiply(sk_c5,sk_c11) = sk_c10 # label(prove_this_8) # label(negated_conjecture). [assumption].
% 2.43/2.75 28 multiply(sk_c10,sk_c4) = sk_c9 | inverse(sk_c7) = sk_c9 # label(prove_this_35) # label(negated_conjecture). [assumption].
% 2.43/2.75 31 multiply(sk_c3,sk_c10) = sk_c4 | inverse(sk_c7) = sk_c9 # label(prove_this_42) # label(negated_conjecture). [assumption].
% 2.43/2.75 34 inverse(sk_c3) = sk_c10 | multiply(sk_c9,sk_c8) = sk_c10 # label(prove_this_47) # label(negated_conjecture). [assumption].
% 2.43/2.75 35 inverse(sk_c3) = sk_c10 | multiply(sk_c7,sk_c9) = sk_c8 # label(prove_this_48) # label(negated_conjecture). [assumption].
% 2.43/2.75 36 multiply(sk_c1,sk_c11) = sk_c10 | multiply(sk_c5,sk_c11) = sk_c10 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 2.43/2.75 46 multiply(sk_c10,sk_c4) = sk_c9 | multiply(sk_c9,sk_c8) = sk_c10 # label(prove_this_33) # label(negated_conjecture). [assumption].
% 2.43/2.75 47 multiply(sk_c10,sk_c4) = sk_c9 | multiply(sk_c7,sk_c9) = sk_c8 # label(prove_this_34) # label(negated_conjecture). [assumption].
% 2.43/2.75 49 multiply(sk_c3,sk_c10) = sk_c4 | multiply(sk_c6,sk_c9) = sk_c10 # label(prove_this_38) # label(negated_conjecture). [assumption].
% 2.43/2.75 50 multiply(sk_c3,sk_c10) = sk_c4 | multiply(sk_c9,sk_c8) = sk_c10 # label(prove_this_40) # label(negated_conjecture). [assumption].
% 2.43/2.75 51 multiply(sk_c3,sk_c10) = sk_c4 | multiply(sk_c7,sk_c9) = sk_c8 # label(prove_this_41) # label(negated_conjecture). [assumption].
% 2.43/2.75 52 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 2.43/2.75 53 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | multiply(B,sk_c9) != sk_c10 | inverse(B) != sk_c9 | multiply(sk_c10,C) != sk_c9 | multiply(D,sk_c10) != C | inverse(D) != sk_c10 | multiply(E,sk_c11) != sk_c10 | inverse(E) != sk_c11 | multiply(F,sk_c9) != sk_c10 | inverse(F) != sk_c9 | multiply(sk_c9,V6) != sk_c10 | multiply(V7,sk_c9) != V6 | inverse(V7) != sk_c9 # label(prove_this_50) # label(negated_conjecture). [assumption].
% 2.43/2.75 54 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | multiply(B,sk_c9) != sk_c10 | inverse(B) != sk_c9 | multiply(sk_c10,C) != sk_c9 | multiply(D,sk_c10) != C | inverse(D) != sk_c10 | multiply(E,sk_c9) != sk_c10 | inverse(E) != sk_c9 | multiply(sk_c9,F) != sk_c10 | multiply(V6,sk_c9) != F | inverse(V6) != sk_c9. [factor(53,a,h),merge(h)].
% 2.43/2.75 57 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | multiply(B,sk_c9) != sk_c10 | inverse(B) != sk_c9 | multiply(sk_c10,C) != sk_c9 | multiply(D,sk_c10) != C | inverse(D) != sk_c10 | multiply(sk_c9,E) != sk_c10 | multiply(F,sk_c9) != E | inverse(F) != sk_c9. [factor(54,c,h),merge(h)].
% 2.43/2.75 78 inverse(sk_c3) = sk_c10 | multiply(sk_c9,sk_c7) = identity. [para(11(b,1),2(a,1,1))].
% 2.43/2.75 79 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),52(a,1,1)),rewrite([1(2)]),flip(a)].
% 2.43/2.75 205 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | multiply(B,sk_c9) != sk_c10 | inverse(B) != sk_c9 | multiply(sk_c10,C) != sk_c9 | multiply(D,sk_c10) != C | inverse(D) != sk_c10 | multiply(sk_c9,identity) != sk_c10 | inverse(inverse(sk_c9)) != sk_c9. [resolve(57,i,2,a)].
% 2.43/2.75 213 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | identity != sk_c10 | inverse(inverse(sk_c9)) != sk_c9 | multiply(sk_c10,B) != sk_c9 | multiply(C,sk_c10) != B | inverse(C) != sk_c10 | multiply(sk_c9,D) != sk_c10 | multiply(E,sk_c9) != D | inverse(E) != sk_c9. [para(2(a,1),57(c,1))].
% 2.43/2.75 382 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | identity != sk_c10 | inverse(inverse(sk_c9)) != sk_c9 | multiply(sk_c10,B) != sk_c9 | multiply(C,sk_c10) != B | inverse(C) != sk_c10 | multiply(sk_c9,identity) != sk_c10. [factor(205,d,i),rewrite([2(11)])].
% 2.43/2.75 403 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | identity != sk_c10 | inverse(inverse(sk_c9)) != sk_c9 | multiply(sk_c10,B) != sk_c9 | multiply(C,sk_c10) != B | inverse(C) != sk_c10 | multiply(sk_c9,D) != sk_c10 | identity != D. [factor(213,d,j),rewrite([2(33)])].
% 2.43/2.75 754 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),79(a,1,2))].
% 2.43/2.75 779 inverse(sk_c7) = sk_c9 | multiply(inverse(sk_c10),sk_c9) = sk_c4. [para(28(a,1),79(a,1,2))].
% 2.43/2.75 785 inverse(sk_c3) = sk_c10 | multiply(inverse(sk_c9),sk_c10) = sk_c8. [para(34(b,1),79(a,1,2))].
% 2.43/2.75 786 inverse(sk_c3) = sk_c10 | multiply(inverse(sk_c7),sk_c8) = sk_c9. [para(35(b,1),79(a,1,2))].
% 2.43/2.75 797 multiply(sk_c10,sk_c4) = sk_c9 | multiply(inverse(sk_c9),sk_c10) = sk_c8. [para(46(b,1),79(a,1,2))].
% 2.43/2.75 800 multiply(sk_c3,sk_c10) = sk_c4 | multiply(inverse(sk_c6),sk_c10) = sk_c9. [para(49(b,1),79(a,1,2))].
% 2.43/2.75 805 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(79(a,1),79(a,1,2))].
% 2.43/2.75 806 multiply(A,identity) = A. [back_rewrite(754),rewrite([805(4)])].
% 2.43/2.75 811 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | identity != sk_c10 | inverse(inverse(sk_c9)) != sk_c9 | multiply(sk_c10,B) != sk_c9 | multiply(C,sk_c10) != B | inverse(C) != sk_c10 | sk_c9 != sk_c10. [back_rewrite(382),rewrite([806(28)])].
% 2.43/2.75 818 inverse(identity) = identity. [para(806(a,1),2(a,1))].
% 2.43/2.75 1009 inverse(sk_c3) = sk_c10 | inverse(sk_c9) = sk_c7. [para(78(b,1),79(a,1,2)),rewrite([806(8)])].
% 2.43/2.75 1082 multiply(A,inverse(A)) = identity. [para(805(a,1),2(a,1))].
% 2.43/2.75 1122 inverse(inverse(A)) = A. [para(805(a,1),806(a,1)),rewrite([806(2)]),flip(a)].
% 2.43/2.75 1247 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | identity != sk_c10 | multiply(sk_c10,B) != sk_c9 | multiply(C,sk_c10) != B | inverse(C) != sk_c10 | sk_c9 != sk_c10. [back_rewrite(811),rewrite([1122(13)]),xx(d)].
% 2.43/2.75 1264 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | identity != sk_c10 | multiply(sk_c10,B) != sk_c9 | multiply(C,sk_c10) != B | inverse(C) != sk_c10 | multiply(sk_c9,D) != sk_c10 | identity != D. [back_rewrite(403),rewrite([1122(13)]),xx(d)].
% 2.43/2.75 1282 inverse(sk_c9) = sk_c7 | inverse(sk_c10) = sk_c3. [para(1009(a,1),1122(a,1,1))].
% 2.43/2.75 1283 inverse(sk_c1) = sk_c11 | multiply(sk_c5,sk_c11) = identity. [para(3(b,1),1082(a,1,2))].
% 2.43/2.75 2062 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | identity != sk_c10 | sk_c9 != sk_c10. [resolve(1247,e,2,a),rewrite([806(13),1122(16)]),flip(d),xx(e),merge(e)].
% 2.43/2.75 2077 identity != sk_c10 | sk_c9 != sk_c10. [para(2(a,1),2062(a,1)),rewrite([1122(6)]),xx(b),merge(b)].
% 2.43/2.75 2201 inverse(sk_c1) = sk_c11 | identity = sk_c10. [para(1283(b,1),15(b,1)),merge(b)].
% 2.43/2.75 2213 identity = sk_c10 | multiply(sk_c1,sk_c11) = identity. [para(2201(a,1),1082(a,1,2))].
% 2.43/2.75 2294 identity = sk_c10 | inverse(sk_c5) = sk_c11. [para(2213(b,1),12(a,1)),merge(b)].
% 2.43/2.75 2305 identity = sk_c10 | multiply(sk_c5,sk_c11) = identity. [para(2294(b,1),1082(a,1,2))].
% 2.43/2.75 2970 identity = sk_c10 | multiply(sk_c1,sk_c11) = sk_c10. [para(2305(b,1),36(b,1)),merge(c)].
% 2.43/2.75 4629 identity = sk_c10. [para(2970(b,1),2213(b,1)),flip(c),merge(b),merge(c)].
% 2.43/2.75 5562 sk_c9 != sk_c10. [back_rewrite(2077),rewrite([4629(1)]),xx(a)].
% 2.43/2.75 5615 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | multiply(sk_c10,B) != sk_c9 | multiply(C,sk_c10) != B | inverse(C) != sk_c10 | multiply(sk_c9,D) != sk_c10 | sk_c10 != D. [back_rewrite(1264),rewrite([4629(8),4629(25)]),xx(c)].
% 2.43/2.75 5630 multiply(A,inverse(A)) = sk_c10. [back_rewrite(1082),rewrite([4629(3)])].
% 2.43/2.75 5652 inverse(sk_c10) = sk_c10. [back_rewrite(818),rewrite([4629(1),4629(3)])].
% 2.43/2.75 5653 multiply(A,sk_c10) = A. [back_rewrite(806),rewrite([4629(1)])].
% 2.43/2.75 5663 multiply(inverse(A),A) = sk_c10. [back_rewrite(2),rewrite([4629(3)])].
% 2.43/2.75 5664 multiply(sk_c10,A) = A. [back_rewrite(1),rewrite([4629(1)])].
% 2.43/2.75 5792 inverse(sk_c9) = sk_c7 | sk_c3 = sk_c10. [back_rewrite(1282),rewrite([5652(6)]),flip(b)].
% 2.43/2.75 5804 inverse(sk_c7) = sk_c9 | sk_c4 = sk_c9. [back_rewrite(779),rewrite([5652(6),5664(7)]),flip(b)].
% 2.43/2.75 5813 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | sk_c9 != B | C != B | inverse(C) != sk_c10 | multiply(sk_c9,D) != sk_c10 | sk_c10 != D. [back_rewrite(5615),rewrite([5664(9),5653(11)]),flip(c)].
% 2.43/2.75 5938 sk_c4 = sk_c3 | inverse(sk_c6) = sk_c9. [back_rewrite(800),rewrite([5653(3),5653(7)]),flip(a)].
% 2.43/2.75 5940 sk_c4 = sk_c9 | inverse(sk_c9) = sk_c8. [back_rewrite(797),rewrite([5664(3),5653(7)])].
% 2.43/2.75 5941 inverse(sk_c3) = sk_c10 | inverse(sk_c9) = sk_c8. [back_rewrite(785),rewrite([5653(8)])].
% 2.43/2.75 6071 sk_c4 = sk_c3 | multiply(sk_c7,sk_c9) = sk_c8. [back_rewrite(51),rewrite([5653(3)]),flip(a)].
% 2.43/2.75 6072 sk_c4 = sk_c3 | multiply(sk_c9,sk_c8) = sk_c10. [back_rewrite(50),rewrite([5653(3)]),flip(a)].
% 2.43/2.75 6073 sk_c4 = sk_c3 | multiply(sk_c6,sk_c9) = sk_c10. [back_rewrite(49),rewrite([5653(3)]),flip(a)].
% 2.43/2.75 6075 sk_c4 = sk_c3 | inverse(sk_c7) = sk_c9. [back_rewrite(31),rewrite([5653(3)]),flip(a)].
% 2.43/2.75 6317 sk_c4 = sk_c9 | multiply(sk_c7,sk_c9) = sk_c8. [back_rewrite(47),rewrite([5664(3)])].
% 2.43/2.75 6453 multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | inverse(sk_c9) != sk_c10 | multiply(sk_c9,B) != sk_c10 | sk_c10 != B. [factor(5813,c,d),xx(c)].
% 2.43/2.75 6965 sk_c4 = sk_c9 | multiply(sk_c7,sk_c9) = sk_c10. [para(5804(a,1),5630(a,1,2))].
% 2.43/2.75 7040 sk_c4 = sk_c3 | inverse(sk_c9) = sk_c6. [para(5938(b,1),1122(a,1,1))].
% 2.43/2.75 7106 sk_c4 = sk_c3 | inverse(sk_c9) = sk_c7. [para(6075(b,1),1122(a,1,1))].
% 2.43/2.75 7125 inverse(sk_c9) != sk_c10 | multiply(sk_c9,A) != sk_c10 | sk_c10 != A. [resolve(6453,a,5663,a),rewrite([1122(3)]),xx(a)].
% 2.43/2.75 7127 inverse(sk_c9) != sk_c10. [resolve(7125,b,5630,a),flip(b),merge(b)].
% 2.43/2.75 7133 sk_c4 = sk_c9 | sk_c8 != sk_c10. [para(5940(b,1),7127(a,1))].
% 2.43/2.75 7529 sk_c4 = sk_c3 | sk_c6 != sk_c10. [para(7040(b,1),7127(a,1))].
% 2.43/2.75 7620 sk_c4 = sk_c3 | sk_c7 = sk_c6. [para(7106(b,1),7040(b,1)),merge(b)].
% 2.43/2.75 8215 inverse(sk_c9) = sk_c8 | sk_c3 = sk_c10. [para(5941(a,1),1122(a,1,1)),rewrite([5652(6)]),flip(b)].
% 2.43/2.75 8224 sk_c3 = sk_c10 | sk_c8 = sk_c7. [para(8215(a,1),5792(a,1)),merge(c)].
% 2.43/2.75 8778 sk_c4 = sk_c3 | multiply(sk_c6,sk_c9) = sk_c8. [para(7620(b,1),6071(b,1,1)),merge(b)].
% 2.43/2.75 8798 sk_c4 = sk_c3 | inverse(sk_c9) = sk_c8. [para(6072(b,1),79(a,1,2)),rewrite([5653(7)])].
% 2.43/2.75 10061 sk_c3 = sk_c10 | inverse(sk_c3) = sk_c10. [para(8224(b,1),786(b,1,2)),rewrite([5663(11)]),flip(c),unit_del(c,5562)].
% 2.43/2.75 10496 sk_c3 = sk_c10. [para(10061(b,1),1122(a,1,1)),rewrite([5652(5)]),flip(b),merge(b)].
% 2.43/2.75 10728 sk_c4 = sk_c10 | inverse(sk_c9) = sk_c8. [back_rewrite(8798),rewrite([10496(2)])].
% 2.43/2.75 10740 sk_c4 = sk_c10 | multiply(sk_c6,sk_c9) = sk_c8. [back_rewrite(8778),rewrite([10496(2)])].
% 2.43/2.75 10797 sk_c4 = sk_c10 | sk_c6 != sk_c10. [back_rewrite(7529),rewrite([10496(2)])].
% 2.43/2.75 10817 sk_c4 = sk_c10 | inverse(sk_c9) = sk_c6. [back_rewrite(7040),rewrite([10496(2)])].
% 2.43/2.75 10877 sk_c4 = sk_c10 | multiply(sk_c6,sk_c9) = sk_c10. [back_rewrite(6073),rewrite([10496(2)])].
% 2.43/2.75 13327 sk_c4 = sk_c9 | sk_c8 = sk_c10. [para(6965(b,1),6317(b,1)),flip(c),merge(b)].
% 2.43/2.75 13329 sk_c4 = sk_c9. [resolve(13327,b,7133,b),merge(b)].
% 2.43/2.75 13584 multiply(sk_c6,sk_c9) = sk_c10. [back_rewrite(10877),rewrite([13329(1)]),unit_del(a,5562)].
% 2.43/2.75 13595 inverse(sk_c9) = sk_c6. [back_rewrite(10817),rewrite([13329(1)]),unit_del(a,5562)].
% 2.43/2.75 13607 sk_c6 != sk_c10. [back_rewrite(10797),rewrite([13329(1)]),unit_del(a,5562)].
% 2.43/2.75 13625 sk_c8 = sk_c10. [back_rewrite(10740),rewrite([13329(1),13584(6)]),flip(b),unit_del(a,5562)].
% 2.43/2.75 13632 $F. [back_rewrite(10728),rewrite([13329(1),13595(5),13625(5)]),unit_del(a,5562),unit_del(b,13607)].
% 2.43/2.75
% 2.43/2.75 % SZS output end Refutation
% 2.43/2.75 ============================== end of proof ==========================
% 2.43/2.75
% 2.43/2.75 ============================== STATISTICS ============================
% 2.43/2.75
% 2.43/2.75 Given=611. Generated=33628. Kept=13631. proofs=1.
% 2.43/2.75 Usable=213. Sos=3716. Demods=41. Limbo=303, Disabled=9452. Hints=0.
% 2.43/2.75 Megabytes=13.05.
% 2.43/2.75 User_CPU=1.74, System_CPU=0.03, Wall_clock=1.
% 2.43/2.75
% 2.43/2.75 ============================== end of statistics =====================
% 2.43/2.75
% 2.43/2.75 ============================== end of search =========================
% 2.43/2.75
% 2.43/2.75 THEOREM PROVED
% 2.43/2.75 % SZS status Unsatisfiable
% 2.43/2.75
% 2.43/2.75 Exiting with 1 proof.
% 2.43/2.75
% 2.43/2.75 Process 12533 exit (max_proofs) Mon Jun 13 20:11:24 2022
% 2.43/2.75 Prover9 interrupted
%------------------------------------------------------------------------------