TSTP Solution File: GRP180-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP180-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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:17:57 EDT 2022
% Result : Unsatisfiable 8.94s 9.26s
% Output : Refutation 8.94s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP180-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n024.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 : Tue Jun 14 14:04:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 3.47/3.72 ============================== Prover9 ===============================
% 3.47/3.72 Prover9 (32) version 2009-11A, November 2009.
% 3.47/3.72 Process 5870 was started by sandbox on n024.cluster.edu,
% 3.47/3.72 Tue Jun 14 14:04:34 2022
% 3.47/3.72 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5703_n024.cluster.edu".
% 3.47/3.72 ============================== end of head ===========================
% 3.47/3.72
% 3.47/3.72 ============================== INPUT =================================
% 3.47/3.72
% 3.47/3.72 % Reading from file /tmp/Prover9_5703_n024.cluster.edu
% 3.47/3.72
% 3.47/3.72 set(prolog_style_variables).
% 3.47/3.72 set(auto2).
% 3.47/3.72 % set(auto2) -> set(auto).
% 3.47/3.72 % set(auto) -> set(auto_inference).
% 3.47/3.72 % set(auto) -> set(auto_setup).
% 3.47/3.72 % set(auto_setup) -> set(predicate_elim).
% 3.47/3.72 % set(auto_setup) -> assign(eq_defs, unfold).
% 3.47/3.72 % set(auto) -> set(auto_limits).
% 3.47/3.72 % set(auto_limits) -> assign(max_weight, "100.000").
% 3.47/3.72 % set(auto_limits) -> assign(sos_limit, 20000).
% 3.47/3.72 % set(auto) -> set(auto_denials).
% 3.47/3.72 % set(auto) -> set(auto_process).
% 3.47/3.72 % set(auto2) -> assign(new_constants, 1).
% 3.47/3.72 % set(auto2) -> assign(fold_denial_max, 3).
% 3.47/3.72 % set(auto2) -> assign(max_weight, "200.000").
% 3.47/3.72 % set(auto2) -> assign(max_hours, 1).
% 3.47/3.72 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 3.47/3.72 % set(auto2) -> assign(max_seconds, 0).
% 3.47/3.72 % set(auto2) -> assign(max_minutes, 5).
% 3.47/3.72 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 3.47/3.72 % set(auto2) -> set(sort_initial_sos).
% 3.47/3.72 % set(auto2) -> assign(sos_limit, -1).
% 3.47/3.72 % set(auto2) -> assign(lrs_ticks, 3000).
% 3.47/3.72 % set(auto2) -> assign(max_megs, 400).
% 3.47/3.72 % set(auto2) -> assign(stats, some).
% 3.47/3.72 % set(auto2) -> clear(echo_input).
% 3.47/3.72 % set(auto2) -> set(quiet).
% 3.47/3.72 % set(auto2) -> clear(print_initial_clauses).
% 3.47/3.72 % set(auto2) -> clear(print_given).
% 3.47/3.72 assign(lrs_ticks,-1).
% 3.47/3.72 assign(sos_limit,10000).
% 3.47/3.72 assign(order,kbo).
% 3.47/3.72 set(lex_order_vars).
% 3.47/3.72 clear(print_given).
% 3.47/3.72
% 3.47/3.72 % formulas(sos). % not echoed (16 formulas)
% 3.47/3.72
% 3.47/3.72 ============================== end of input ==========================
% 3.47/3.72
% 3.47/3.72 % From the command line: assign(max_seconds, 300).
% 3.47/3.72
% 3.47/3.72 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 3.47/3.72
% 3.47/3.72 % Formulas that are not ordinary clauses:
% 3.47/3.72
% 3.47/3.72 ============================== end of process non-clausal formulas ===
% 3.47/3.72
% 3.47/3.72 ============================== PROCESS INITIAL CLAUSES ===============
% 3.47/3.72
% 3.47/3.72 ============================== PREDICATE ELIMINATION =================
% 3.47/3.72
% 3.47/3.72 ============================== end predicate elimination =============
% 3.47/3.72
% 3.47/3.72 Auto_denials:
% 3.47/3.72 % copying label prove_p11 to answer in negative clause
% 3.47/3.72
% 3.47/3.72 Term ordering decisions:
% 3.47/3.72
% 3.47/3.72 % Assigning unary symbol inverse kb_weight 0 and highest precedence (8).
% 3.47/3.72 Function symbol KB weights: identity=1. a=1. b=1. multiply=1. greatest_lower_bound=1. least_upper_bound=1. inverse=0.
% 3.47/3.72
% 3.47/3.72 ============================== end of process initial clauses ========
% 3.47/3.72
% 3.47/3.72 ============================== CLAUSES FOR SEARCH ====================
% 3.47/3.72
% 3.47/3.72 ============================== end of clauses for search =============
% 3.47/3.72
% 3.47/3.72 ============================== SEARCH ================================
% 3.47/3.72
% 3.47/3.72 % Starting search at 0.01 seconds.
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=37.000, iters=3366
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=36.000, iters=3360
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=35.000, iters=3385
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=32.000, iters=3422
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=31.000, iters=3394
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=30.000, iters=3334
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=29.000, iters=3483
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=28.000, iters=3393
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=27.000, iters=3365
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=26.000, iters=3338
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=25.000, iters=3360
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=24.000, iters=3336
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=23.000, iters=3350
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=22.000, iters=3337
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=21.000, iters=3333
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=20.000, iters=3341
% 3.47/3.72
% 3.47/3.72 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 21 (0.00 of 2.18 sec).
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=19.000, iters=3340
% 3.47/3.72
% 3.47/3.72 Low Water (keep): wt=18.000, iters=3341
% 3.47/3.72
% 3.47/3.72 Low Water (displace): id=5287, wt=43.000
% 3.47/3.72
% 3.47/3.72 Low Water (displace): id=5749, wt=41.000
% 3.47/3.72
% 3.47/3.72 Low Water (displace): id=6150, wt=40.000
% 3.47/3.72
% 3.47/3.72 Low Water (displace): id=5691, wt=39.000
% 3.47/3.72
% 3.47/3.72 Low Water (displace): id=5690, wt=38.000
% 3.47/3.72
% 3.47/3.72 Low Water (displace): id=6240, wt=37.000
% 8.94/9.26
% 8.94/9.26 Low Water (displace): id=12570, wt=17.000
% 8.94/9.26
% 8.94/9.26 Low Water (displace): id=12653, wt=16.000
% 8.94/9.26
% 8.94/9.26 Low Water (displace): id=13157, wt=15.000
% 8.94/9.26
% 8.94/9.26 Low Water (keep): wt=17.000, iters=3345
% 8.94/9.26
% 8.94/9.26 Low Water (displace): id=13350, wt=14.000
% 8.94/9.26
% 8.94/9.26 Low Water (displace): id=15116, wt=13.000
% 8.94/9.26
% 8.94/9.26 ============================== PROOF =================================
% 8.94/9.26 % SZS status Unsatisfiable
% 8.94/9.26 % SZS output start Refutation
% 8.94/9.26
% 8.94/9.26 % Proof 1 at 8.07 (+ 0.20) seconds: prove_p11.
% 8.94/9.26 % Length of proof is 98.
% 8.94/9.26 % Level of proof is 17.
% 8.94/9.26 % Maximum clause weight is 19.000.
% 8.94/9.26 % Given clauses 1060.
% 8.94/9.26
% 8.94/9.26 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 8.94/9.26 4 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 8.94/9.26 5 greatest_lower_bound(A,B) = greatest_lower_bound(B,A) # label(symmetry_of_glb) # label(axiom). [assumption].
% 8.94/9.26 6 least_upper_bound(A,B) = least_upper_bound(B,A) # label(symmetry_of_lub) # label(axiom). [assumption].
% 8.94/9.26 7 least_upper_bound(A,greatest_lower_bound(A,B)) = A # label(lub_absorbtion) # label(axiom). [assumption].
% 8.94/9.26 8 greatest_lower_bound(A,least_upper_bound(A,B)) = A # label(glb_absorbtion) # label(axiom). [assumption].
% 8.94/9.26 9 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 8.94/9.26 10 greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C) # label(associativity_of_glb) # label(axiom). [assumption].
% 8.94/9.26 11 greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(C,greatest_lower_bound(A,B)). [copy(10),rewrite([5(4)])].
% 8.94/9.26 12 least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C) # label(associativity_of_lub) # label(axiom). [assumption].
% 8.94/9.26 13 least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(C,least_upper_bound(A,B)). [copy(12),rewrite([6(4)])].
% 8.94/9.26 14 multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)) # label(monotony_lub1) # label(axiom). [assumption].
% 8.94/9.26 15 least_upper_bound(multiply(A,B),multiply(A,C)) = multiply(A,least_upper_bound(B,C)). [copy(14),flip(a)].
% 8.94/9.26 16 multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)) # label(monotony_glb1) # label(axiom). [assumption].
% 8.94/9.26 17 greatest_lower_bound(multiply(A,B),multiply(A,C)) = multiply(A,greatest_lower_bound(B,C)). [copy(16),flip(a)].
% 8.94/9.26 18 multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)) # label(monotony_lub2) # label(axiom). [assumption].
% 8.94/9.26 19 least_upper_bound(multiply(A,B),multiply(C,B)) = multiply(least_upper_bound(A,C),B). [copy(18),flip(a)].
% 8.94/9.26 20 multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)) # label(monotony_glb2) # label(axiom). [assumption].
% 8.94/9.26 21 greatest_lower_bound(multiply(A,B),multiply(C,B)) = multiply(greatest_lower_bound(A,C),B). [copy(20),flip(a)].
% 8.94/9.26 22 multiply(a,multiply(inverse(greatest_lower_bound(a,b)),b)) != least_upper_bound(a,b) # label(prove_p11) # label(negated_conjecture) # answer(prove_p11). [assumption].
% 8.94/9.26 23 multiply(inverse(A),multiply(A,B)) = B. [para(4(a,1),9(a,1,1)),rewrite([1(2)]),flip(a)].
% 8.94/9.26 27 least_upper_bound(A,least_upper_bound(B,greatest_lower_bound(A,C))) = least_upper_bound(A,B). [para(7(a,1),13(a,2,2)),rewrite([6(2),6(4)])].
% 8.94/9.26 28 least_upper_bound(identity,multiply(inverse(A),B)) = multiply(inverse(A),least_upper_bound(A,B)). [para(4(a,1),15(a,1,1))].
% 8.94/9.26 29 greatest_lower_bound(identity,multiply(inverse(A),B)) = multiply(inverse(A),greatest_lower_bound(A,B)). [para(4(a,1),17(a,1,1))].
% 8.94/9.26 30 least_upper_bound(A,multiply(B,A)) = multiply(least_upper_bound(B,identity),A). [para(1(a,1),19(a,1,1)),rewrite([6(4)])].
% 8.94/9.26 31 least_upper_bound(identity,multiply(A,B)) = multiply(least_upper_bound(A,inverse(B)),B). [para(4(a,1),19(a,1,1)),rewrite([6(5)])].
% 8.94/9.26 34 greatest_lower_bound(A,multiply(B,A)) = multiply(greatest_lower_bound(B,identity),A). [para(1(a,1),21(a,1,1)),rewrite([5(4)])].
% 8.94/9.26 35 greatest_lower_bound(identity,multiply(A,B)) = multiply(greatest_lower_bound(A,inverse(B)),B). [para(4(a,1),21(a,1,1)),rewrite([5(5)])].
% 8.94/9.26 36 greatest_lower_bound(multiply(A,multiply(B,C)),multiply(D,C)) = multiply(greatest_lower_bound(D,multiply(A,B)),C). [para(9(a,1),21(a,1,1)),rewrite([5(6)])].
% 8.94/9.26 37 greatest_lower_bound(multiply(A,B),multiply(C,multiply(D,B))) = multiply(greatest_lower_bound(A,multiply(C,D)),B). [para(9(a,1),21(a,1,2))].
% 8.94/9.26 39 multiply(inverse(inverse(A)),identity) = A. [para(4(a,1),23(a,1,2))].
% 8.94/9.26 41 multiply(inverse(A),least_upper_bound(B,multiply(A,C))) = least_upper_bound(C,multiply(inverse(A),B)). [para(23(a,1),15(a,1,1)),rewrite([6(6)]),flip(a)].
% 8.94/9.26 42 multiply(inverse(A),greatest_lower_bound(B,multiply(A,C))) = greatest_lower_bound(C,multiply(inverse(A),B)). [para(23(a,1),17(a,1,1)),rewrite([5(6)]),flip(a)].
% 8.94/9.26 45 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(23(a,1),23(a,1,2))].
% 8.94/9.26 46 multiply(A,identity) = A. [back_rewrite(39),rewrite([45(4)])].
% 8.94/9.26 48 least_upper_bound(A,multiply(A,B)) = multiply(A,least_upper_bound(B,identity)). [para(46(a,1),15(a,1,1)),rewrite([6(4)])].
% 8.94/9.26 49 greatest_lower_bound(A,multiply(A,B)) = multiply(A,greatest_lower_bound(B,identity)). [para(46(a,1),17(a,1,1)),rewrite([5(4)])].
% 8.94/9.26 53 multiply(A,inverse(A)) = identity. [para(45(a,1),4(a,1))].
% 8.94/9.26 58 multiply(A,multiply(inverse(A),B)) = B. [para(45(a,1),23(a,1))].
% 8.94/9.26 59 inverse(inverse(A)) = A. [para(45(a,1),46(a,1)),rewrite([46(2)]),flip(a)].
% 8.94/9.26 60 multiply(A,multiply(B,inverse(multiply(A,B)))) = identity. [para(53(a,1),9(a,1)),flip(a)].
% 8.94/9.26 61 least_upper_bound(identity,multiply(A,B)) = multiply(A,least_upper_bound(B,inverse(A))). [para(53(a,1),15(a,1,1)),rewrite([6(5)])].
% 8.94/9.26 66 multiply(A,least_upper_bound(B,multiply(inverse(A),C))) = least_upper_bound(C,multiply(A,B)). [para(58(a,1),15(a,1,1)),rewrite([6(5)]),flip(a)].
% 8.94/9.26 78 multiply(A,inverse(multiply(B,A))) = inverse(B). [para(60(a,1),23(a,1,2)),rewrite([46(3)]),flip(a)].
% 8.94/9.26 86 inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)). [para(78(a,1),23(a,1,2)),flip(a)].
% 8.94/9.26 87 multiply(least_upper_bound(inverse(A),identity),A) = least_upper_bound(A,identity). [para(4(a,1),30(a,1,2)),flip(a)].
% 8.94/9.26 88 greatest_lower_bound(A,multiply(least_upper_bound(B,identity),A)) = A. [para(30(a,1),8(a,1,2))].
% 8.94/9.26 103 multiply(inverse(least_upper_bound(A,identity)),least_upper_bound(B,multiply(A,B))) = B. [para(30(a,2),23(a,1,2))].
% 8.94/9.26 107 multiply(least_upper_bound(A,identity),inverse(A)) = least_upper_bound(inverse(A),identity). [para(53(a,1),30(a,1,2)),flip(a)].
% 8.94/9.26 113 multiply(A,least_upper_bound(identity,multiply(inverse(B),C))) = multiply(A,multiply(inverse(B),least_upper_bound(B,C))). [para(28(a,2),9(a,2,2)),rewrite([9(4)]),flip(a)].
% 8.94/9.26 125 multiply(inverse(A),least_upper_bound(A,identity)) = least_upper_bound(identity,inverse(A)). [para(46(a,1),28(a,1,2)),flip(a)].
% 8.94/9.26 128 least_upper_bound(identity,multiply(inverse(A),least_upper_bound(B,greatest_lower_bound(A,C)))) = multiply(inverse(A),least_upper_bound(A,B)). [para(27(a,1),28(a,2,2))].
% 8.94/9.26 133 greatest_lower_bound(identity,least_upper_bound(A,identity)) = identity. [para(46(a,1),88(a,1,2))].
% 8.94/9.26 136 greatest_lower_bound(A,multiply(A,least_upper_bound(B,identity))) = A. [para(133(a,1),17(a,2,2)),rewrite([46(2),46(6)])].
% 8.94/9.26 138 greatest_lower_bound(A,greatest_lower_bound(B,multiply(A,least_upper_bound(C,identity)))) = greatest_lower_bound(A,B). [para(136(a,1),11(a,2,2)),rewrite([5(4),5(6)])].
% 8.94/9.26 167 multiply(inverse(A),greatest_lower_bound(A,identity)) = greatest_lower_bound(identity,inverse(A)). [para(46(a,1),29(a,1,2)),flip(a)].
% 8.94/9.26 188 greatest_lower_bound(identity,multiply(least_upper_bound(A,inverse(B)),B)) = identity. [para(31(a,1),8(a,1,2))].
% 8.94/9.26 205 multiply(inverse(least_upper_bound(A,inverse(B))),least_upper_bound(identity,multiply(A,B))) = B. [para(31(a,2),23(a,1,2))].
% 8.94/9.26 264 greatest_lower_bound(identity,multiply(least_upper_bound(A,B),inverse(B))) = identity. [para(59(a,1),188(a,1,2,1,2))].
% 8.94/9.26 320 multiply(greatest_lower_bound(inverse(A),identity),A) = greatest_lower_bound(A,identity). [para(4(a,1),34(a,1,2)),flip(a)].
% 8.94/9.26 338 multiply(greatest_lower_bound(A,identity),inverse(A)) = greatest_lower_bound(inverse(A),identity). [para(53(a,1),34(a,1,2)),flip(a)].
% 8.94/9.26 364 multiply(greatest_lower_bound(identity,inverse(A)),A) = greatest_lower_bound(A,identity). [para(5(a,1),320(a,1,1))].
% 8.94/9.26 382 least_upper_bound(identity,multiply(greatest_lower_bound(A,inverse(B)),B)) = identity. [para(35(a,1),7(a,1,2))].
% 8.94/9.26 394 multiply(greatest_lower_bound(A,inverse(greatest_lower_bound(B,C))),greatest_lower_bound(B,C)) = greatest_lower_bound(identity,multiply(A,greatest_lower_bound(B,C))). [para(35(a,2),17(a,2)),rewrite([17(9)])].
% 8.94/9.26 405 greatest_lower_bound(identity,least_upper_bound(A,multiply(B,A))) = multiply(greatest_lower_bound(least_upper_bound(B,identity),inverse(A)),A). [para(30(a,2),35(a,1,2))].
% 8.94/9.26 431 least_upper_bound(identity,multiply(greatest_lower_bound(A,B),inverse(B))) = identity. [para(59(a,1),382(a,1,2,1,2))].
% 8.94/9.26 476 multiply(greatest_lower_bound(A,multiply(B,C)),multiply(inverse(C),D)) = multiply(greatest_lower_bound(B,multiply(A,inverse(C))),D). [para(58(a,1),36(a,1,1,2)),rewrite([37(5)]),flip(a)].
% 8.94/9.26 597 least_upper_bound(inverse(A),inverse(greatest_lower_bound(B,A))) = inverse(greatest_lower_bound(B,A)). [para(431(a,1),41(a,1,2)),rewrite([46(4),46(7)]),flip(a)].
% 8.94/9.26 644 greatest_lower_bound(inverse(A),inverse(least_upper_bound(B,A))) = inverse(least_upper_bound(B,A)). [para(264(a,1),42(a,1,2)),rewrite([46(4),46(7)]),flip(a)].
% 8.94/9.26 759 multiply(A,least_upper_bound(inverse(A),identity)) = least_upper_bound(A,identity). [para(53(a,1),48(a,1,2)),flip(a)].
% 8.94/9.26 781 least_upper_bound(greatest_lower_bound(A,identity),greatest_lower_bound(inverse(A),identity)) = multiply(greatest_lower_bound(inverse(A),identity),least_upper_bound(A,identity)). [para(320(a,1),48(a,1,2)),rewrite([6(6)])].
% 8.94/9.26 784 least_upper_bound(greatest_lower_bound(A,identity),greatest_lower_bound(identity,inverse(A))) = multiply(greatest_lower_bound(identity,inverse(A)),least_upper_bound(A,identity)). [para(364(a,1),48(a,1,2)),rewrite([6(6)])].
% 8.94/9.26 812 greatest_lower_bound(least_upper_bound(A,identity),least_upper_bound(inverse(A),identity)) = multiply(greatest_lower_bound(A,identity),least_upper_bound(inverse(A),identity)). [para(759(a,1),34(a,1,2)),rewrite([5(6)])].
% 8.94/9.26 925 multiply(A,greatest_lower_bound(inverse(A),identity)) = greatest_lower_bound(A,identity). [para(53(a,1),49(a,1,2)),flip(a)].
% 8.94/9.26 931 multiply(least_upper_bound(inverse(A),identity),greatest_lower_bound(A,identity)) = multiply(greatest_lower_bound(A,identity),least_upper_bound(inverse(A),identity)). [para(87(a,1),49(a,1,2)),rewrite([5(6),812(6)]),flip(a)].
% 8.94/9.26 976 multiply(least_upper_bound(A,identity),greatest_lower_bound(inverse(A),identity)) = multiply(greatest_lower_bound(inverse(A),identity),least_upper_bound(A,identity)). [para(925(a,1),30(a,1,2)),rewrite([6(6),781(6)]),flip(a)].
% 8.94/9.26 1026 multiply(greatest_lower_bound(inverse(A),identity),least_upper_bound(A,identity)) = multiply(greatest_lower_bound(A,identity),least_upper_bound(inverse(A),identity)). [para(107(a,1),49(a,1,2)),rewrite([812(6),976(12)]),flip(a)].
% 8.94/9.26 1028 least_upper_bound(greatest_lower_bound(A,identity),greatest_lower_bound(inverse(A),identity)) = multiply(greatest_lower_bound(A,identity),least_upper_bound(inverse(A),identity)). [back_rewrite(781),rewrite([1026(12)])].
% 8.94/9.26 1128 multiply(inverse(greatest_lower_bound(A,identity)),A) = inverse(greatest_lower_bound(identity,inverse(A))). [para(167(a,1),86(a,1,1)),rewrite([59(9)]),flip(a)].
% 8.94/9.26 1257 multiply(greatest_lower_bound(A,B),least_upper_bound(C,inverse(greatest_lower_bound(A,B)))) = least_upper_bound(identity,multiply(greatest_lower_bound(A,B),C)). [para(61(a,2),21(a,2)),rewrite([21(9)])].
% 8.94/9.26 1608 multiply(inverse(least_upper_bound(A,identity)),multiply(greatest_lower_bound(A,identity),least_upper_bound(inverse(A),identity))) = greatest_lower_bound(inverse(A),identity). [para(925(a,1),103(a,1,2,2)),rewrite([6(9),1028(9)])].
% 8.94/9.26 1634 multiply(A,multiply(least_upper_bound(inverse(A),inverse(B)),B)) = least_upper_bound(A,B). [para(31(a,1),66(a,1,2)),rewrite([46(7),6(6)])].
% 8.94/9.26 4535 multiply(inverse(least_upper_bound(identity,multiply(inverse(A),B))),multiply(inverse(A),least_upper_bound(A,B))) = identity. [para(113(a,1),4(a,1))].
% 8.94/9.26 5022 greatest_lower_bound(inverse(greatest_lower_bound(A,identity)),inverse(greatest_lower_bound(identity,inverse(A)))) = identity. [para(1128(a,1),49(a,1,2)),rewrite([4(14)])].
% 8.94/9.26 6397 greatest_lower_bound(A,multiply(greatest_lower_bound(A,B),least_upper_bound(C,identity))) = greatest_lower_bound(A,multiply(B,least_upper_bound(C,identity))). [para(21(a,1),138(a,1,2)),rewrite([5(1)])].
% 8.94/9.26 9537 least_upper_bound(identity,multiply(greatest_lower_bound(A,identity),least_upper_bound(B,identity))) = least_upper_bound(identity,multiply(greatest_lower_bound(A,identity),B)). [para(5022(a,1),128(a,1,2,2,2)),rewrite([59(5),59(11),6(13),1257(14)])].
% 8.94/9.26 11215 inverse(least_upper_bound(A,greatest_lower_bound(B,A))) = inverse(A). [para(431(a,1),205(a,1,2)),rewrite([59(3),6(2),46(5)])].
% 8.94/9.26 11243 greatest_lower_bound(inverse(A),inverse(greatest_lower_bound(B,A))) = inverse(A). [para(11215(a,1),644(a,1,2)),rewrite([5(4),11215(7)])].
% 8.94/9.26 11290 least_upper_bound(A,greatest_lower_bound(B,A)) = A. [para(11243(a,1),597(a,1,2,1)),rewrite([59(3),59(3),6(2),11243(6),59(4)])].
% 8.94/9.26 17003 greatest_lower_bound(identity,multiply(greatest_lower_bound(A,identity),least_upper_bound(inverse(A),identity))) = identity. [para(167(a,1),405(a,1,2,2)),rewrite([784(7),6397(8),125(5),8(5),394(11),931(8)]),flip(a)].
% 8.94/9.26 17017 multiply(greatest_lower_bound(A,identity),least_upper_bound(inverse(A),identity)) = identity. [para(17003(a,1),11290(a,1,2)),rewrite([6(8),9537(8),338(5),11290(5)]),flip(a)].
% 8.94/9.26 17021 inverse(least_upper_bound(A,identity)) = greatest_lower_bound(inverse(A),identity). [back_rewrite(1608),rewrite([17017(9),46(5)])].
% 8.94/9.26 17257 inverse(least_upper_bound(identity,multiply(A,B))) = greatest_lower_bound(identity,multiply(inverse(B),inverse(A))). [para(86(a,1),17021(a,2,1)),rewrite([6(3),5(9)])].
% 8.94/9.26 17348 multiply(greatest_lower_bound(inverse(A),inverse(B)),least_upper_bound(A,B)) = identity. [back_rewrite(4535),rewrite([17257(5),59(4),476(8),1(4),5(3)])].
% 8.94/9.26 17728 inverse(greatest_lower_bound(inverse(A),inverse(B))) = least_upper_bound(A,B). [para(17348(a,1),23(a,1,2)),rewrite([46(6)])].
% 8.94/9.26 17764 inverse(greatest_lower_bound(A,inverse(B))) = least_upper_bound(B,inverse(A)). [para(59(a,1),17728(a,1,1,1)),rewrite([6(5)])].
% 8.94/9.26 18545 inverse(greatest_lower_bound(A,B)) = least_upper_bound(inverse(A),inverse(B)). [para(59(a,1),17764(a,1,1,2)),rewrite([6(5)])].
% 8.94/9.26 19431 $F # answer(prove_p11). [back_rewrite(22),rewrite([18545(5),1634(9)]),xx(a)].
% 8.94/9.26
% 8.94/9.26 % SZS output end Refutation
% 8.94/9.26 ============================== end of proof ==========================
% 8.94/9.26
% 8.94/9.26 ============================== STATISTICS ============================
% 8.94/9.26
% 8.94/9.26 Given=1060. Generated=391446. Kept=19424. proofs=1.
% 8.94/9.26 Usable=558. Sos=4672. Demods=5475. Limbo=886, Disabled=13324. Hints=0.
% 8.94/9.26 Megabytes=16.98.
% 8.94/9.26 User_CPU=8.07, System_CPU=0.20, Wall_clock=8.
% 8.94/9.26
% 8.94/9.26 ============================== end of statistics =====================
% 8.94/9.26
% 8.94/9.26 ============================== end of search =========================
% 8.94/9.26
% 8.94/9.26 THEOREM PROVED
% 8.94/9.26 % SZS status Unsatisfiable
% 8.94/9.26
% 8.94/9.26 Exiting with 1 proof.
% 8.94/9.26
% 8.94/9.26 Process 5870 exit (max_proofs) Tue Jun 14 14:04:42 2022
% 8.94/9.26 Prover9 interrupted
%------------------------------------------------------------------------------