0.12/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.35	% Computer   : n020.cluster.edu
0.13/0.35	% Model      : x86_64 x86_64
0.13/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory     : 8042.1875MB
0.13/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 1200
0.13/0.35	% DateTime   : Tue Jul 13 16:04:21 EDT 2021
0.13/0.35	% CPUTime    : 
0.74/1.03	============================== Prover9 ===============================
0.74/1.03	Prover9 (32) version 2009-11A, November 2009.
0.74/1.03	Process 16835 was started by sandbox2 on n020.cluster.edu,
0.74/1.03	Tue Jul 13 16:04:21 2021
0.74/1.03	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_16680_n020.cluster.edu".
0.74/1.03	============================== end of head ===========================
0.74/1.03	
0.74/1.03	============================== INPUT =================================
0.74/1.03	
0.74/1.03	% Reading from file /tmp/Prover9_16680_n020.cluster.edu
0.74/1.03	
0.74/1.03	set(prolog_style_variables).
0.74/1.03	set(auto2).
0.74/1.03	    % set(auto2) -> set(auto).
0.74/1.03	    % set(auto) -> set(auto_inference).
0.74/1.03	    % set(auto) -> set(auto_setup).
0.74/1.03	    % set(auto_setup) -> set(predicate_elim).
0.74/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.74/1.03	    % set(auto) -> set(auto_limits).
0.74/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.74/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.74/1.03	    % set(auto) -> set(auto_denials).
0.74/1.03	    % set(auto) -> set(auto_process).
0.74/1.03	    % set(auto2) -> assign(new_constants, 1).
0.74/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.74/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.74/1.03	    % set(auto2) -> assign(max_hours, 1).
0.74/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.74/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.74/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.74/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.74/1.03	    % set(auto2) -> set(sort_initial_sos).
0.74/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.74/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.74/1.03	    % set(auto2) -> assign(max_megs, 400).
0.74/1.03	    % set(auto2) -> assign(stats, some).
0.74/1.03	    % set(auto2) -> clear(echo_input).
0.74/1.03	    % set(auto2) -> set(quiet).
0.74/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.74/1.03	    % set(auto2) -> clear(print_given).
0.74/1.03	assign(lrs_ticks,-1).
0.74/1.03	assign(sos_limit,10000).
0.74/1.03	assign(order,kbo).
0.74/1.03	set(lex_order_vars).
0.74/1.03	clear(print_given).
0.74/1.03	
0.74/1.03	% formulas(sos).  % not echoed (17 formulas)
0.74/1.03	
0.74/1.03	============================== end of input ==========================
0.74/1.03	
0.74/1.03	% From the command line: assign(max_seconds, 1200).
0.74/1.03	
0.74/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.74/1.03	
0.74/1.03	% Formulas that are not ordinary clauses:
0.74/1.03	1 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	2 (all A A = multiplication(A,one)) # label(multiplicative_right_identity) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	3 (all A all B all C addition(multiplication(A,C),multiplication(B,C)) = multiplication(addition(A,B),C)) # label(left_distributivity) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	4 (all A zero = multiplication(zero,A)) # label(left_annihilation) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	5 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	6 (all A leq(addition(one,multiplication(A,star(A))),star(A))) # label(star_unfold_right) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	7 (all C all B all A addition(A,addition(B,C)) = addition(addition(A,B),C)) # label(additive_associativity) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	8 (all A all B all C multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C))) # label(multiplicative_associativity) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	9 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	10 (all A all B all C (leq(addition(multiplication(A,B),C),A) -> leq(multiplication(C,star(B)),A))) # label(star_induction_right) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	11 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	12 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	13 (all A all B all C (leq(addition(multiplication(A,B),C),B) -> leq(multiplication(star(A),C),B))) # label(star_induction_left) # label(axiom) # label(non_clause).  [assumption].
0.74/1.03	14 (all A leq(addition(one,multiplication(star(A),A)),star(A))) # label(star_unfold_left) # label(axiom) # label(non_clause).  [assumption].
3.05/3.34	15 (all A all B all C addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C))) # label(right_distributivity) # label(axiom) # label(non_clause).  [assumption].
3.05/3.34	16 (all A all B (B = addition(A,B) <-> leq(A,B))) # label(order) # label(axiom) # label(non_clause).  [assumption].
3.05/3.34	
3.05/3.34	============================== end of process non-clausal formulas ===
3.05/3.34	
3.05/3.34	============================== PROCESS INITIAL CLAUSES ===============
3.05/3.34	
3.05/3.34	============================== PREDICATE ELIMINATION =================
3.05/3.34	
3.05/3.34	============================== end predicate elimination =============
3.05/3.34	
3.05/3.34	Auto_denials:
3.05/3.34	  % copying label a to answer in negative clause
3.05/3.34	
3.05/3.34	Term ordering decisions:
3.05/3.34	
3.05/3.34	% Assigning unary symbol star kb_weight 0 and highest precedence (8).
3.05/3.34	Function symbol KB weights:  zero=1. one=1. a=1. multiplication=1. addition=1. star=0.
3.05/3.34	
3.05/3.34	============================== end of process initial clauses ========
3.05/3.34	
3.05/3.34	============================== CLAUSES FOR SEARCH ====================
3.05/3.34	
3.05/3.34	============================== end of clauses for search =============
3.05/3.34	
3.05/3.34	============================== SEARCH ================================
3.05/3.34	
3.05/3.34	% Starting search at 0.01 seconds.
3.05/3.34	
3.05/3.34	Low Water (keep): wt=35.000, iters=3344
3.05/3.34	
3.05/3.34	Low Water (keep): wt=33.000, iters=3360
3.05/3.34	
3.05/3.34	Low Water (keep): wt=30.000, iters=3357
3.05/3.34	
3.05/3.34	Low Water (keep): wt=29.000, iters=3366
3.05/3.34	
3.05/3.34	Low Water (keep): wt=28.000, iters=3333
3.05/3.34	
3.05/3.34	Low Water (keep): wt=27.000, iters=3378
3.05/3.34	
3.05/3.34	Low Water (keep): wt=26.000, iters=3334
3.05/3.34	
3.05/3.34	Low Water (keep): wt=25.000, iters=3344
3.05/3.34	
3.05/3.34	Low Water (keep): wt=24.000, iters=3340
3.05/3.34	
3.05/3.34	Low Water (keep): wt=23.000, iters=3347
3.05/3.34	
3.05/3.34	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 64 (0.00 of 0.88 sec).
3.05/3.34	
3.05/3.34	Low Water (keep): wt=22.000, iters=3335
3.05/3.34	
3.05/3.34	Low Water (keep): wt=21.000, iters=3352
3.05/3.34	
3.05/3.34	Low Water (keep): wt=20.000, iters=3336
3.05/3.34	
3.05/3.34	Low Water (keep): wt=19.000, iters=3333
3.05/3.34	
3.05/3.34	Low Water (displace): id=1249, wt=42.000
3.05/3.34	
3.05/3.34	Low Water (displace): id=5016, wt=40.000
3.05/3.34	
3.05/3.34	Low Water (displace): id=5397, wt=39.000
3.05/3.34	
3.05/3.34	Low Water (displace): id=5858, wt=38.000
3.05/3.34	
3.05/3.34	Low Water (displace): id=5908, wt=37.000
3.05/3.34	
3.05/3.34	Low Water (displace): id=6184, wt=36.000
3.05/3.34	
3.05/3.34	Low Water (displace): id=6103, wt=35.000
3.05/3.34	
3.05/3.34	Low Water (displace): id=5745, wt=34.000
3.05/3.34	
3.05/3.34	Low Water (displace): id=11430, wt=18.000
3.05/3.34	
3.05/3.34	Low Water (displace): id=11445, wt=16.000
3.05/3.34	
3.05/3.34	Low Water (displace): id=11653, wt=15.000
3.05/3.34	
3.05/3.34	Low Water (displace): id=12264, wt=13.000
3.05/3.34	
3.05/3.34	Low Water (keep): wt=18.000, iters=3348
3.05/3.34	
3.05/3.34	Low Water (displace): id=13096, wt=12.000
3.05/3.34	
3.05/3.34	Low Water (keep): wt=17.000, iters=3370
3.05/3.34	
3.05/3.34	============================== PROOF =================================
3.05/3.34	% SZS status Theorem
3.05/3.34	% SZS output start Refutation
3.05/3.34	
3.05/3.34	% Proof 1 at 2.26 (+ 0.07) seconds: a.
3.05/3.34	% Length of proof is 103.
3.05/3.34	% Level of proof is 25.
3.05/3.34	% Maximum clause weight is 19.000.
3.05/3.34	% Given clauses 1399.
3.05/3.34	
3.05/3.34	2 (all A A = multiplication(A,one)) # label(multiplicative_right_identity) # label(axiom) # label(non_clause).  [assumption].
3.05/3.34	3 (all A all B all C addition(multiplication(A,C),multiplication(B,C)) = multiplication(addition(A,B),C)) # label(left_distributivity) # label(axiom) # label(non_clause).  [assumption].
3.05/3.34	5 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause).  [assumption].
3.05/3.34	6 (all A leq(addition(one,multiplication(A,star(A))),star(A))) # label(star_unfold_right) # label(axiom) # label(non_clause).  [assumption].
3.05/3.34	7 (all C all B all A addition(A,addition(B,C)) = addition(addition(A,B),C)) # label(additive_associativity) # label(axiom) # label(non_clause).  [assumption].
3.05/3.34	8 (all A all B all C multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C))) # label(multiplicative_associativity) # label(axiom) # label(non_clause).  [assumption].
3.05/3.34	10 (all A all B all C (leq(addition(multiplication(A,B),C),A) -> leq(multiplication(C,star(B)),A))) # label(star_induction_right) # label(axiom) # label(non_clause).  [assumption].
3.05/3.34	11 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause).  [assumption].
3.05/3.34	12 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause).  [assumption].
3.05/3.34	14 (all A leq(addition(one,multiplication(star(A),A)),star(A))) # label(star_unfold_left) # label(axiom) # label(non_clause).  [assumption].
3.05/3.34	15 (all A all B all C addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C))) # label(right_distributivity) # label(axiom) # label(non_clause).  [assumption].
3.05/3.34	16 (all A all B (B = addition(A,B) <-> leq(A,B))) # label(order) # label(axiom) # label(non_clause).  [assumption].
3.05/3.34	18 multiplication(A,one) = A # label(multiplicative_right_identity) # label(axiom).  [clausify(2)].
3.05/3.34	20 addition(A,A) = A # label(additive_idempotence) # label(axiom).  [clausify(5)].
3.05/3.34	22 multiplication(one,A) = A # label(multiplicative_left_identity) # label(axiom).  [clausify(11)].
3.05/3.34	23 addition(A,B) = addition(B,A) # label(additive_commutativity) # label(axiom).  [clausify(12)].
3.05/3.34	24 leq(addition(one,multiplication(A,star(A))),star(A)) # label(star_unfold_right) # label(axiom).  [clausify(6)].
3.05/3.34	25 leq(addition(one,multiplication(star(A),A)),star(A)) # label(star_unfold_left) # label(axiom).  [clausify(14)].
3.05/3.34	26 addition(addition(A,B),C) = addition(A,addition(B,C)) # label(additive_associativity) # label(axiom).  [clausify(7)].
3.05/3.34	27 addition(A,addition(B,C)) = addition(C,addition(A,B)).  [copy(26),rewrite([23(2)]),flip(a)].
3.05/3.34	28 multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)) # label(multiplicative_associativity) # label(axiom).  [clausify(8)].
3.05/3.34	29 addition(multiplication(A,B),multiplication(C,B)) = multiplication(addition(A,C),B) # label(left_distributivity) # label(axiom).  [clausify(3)].
3.05/3.34	30 addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C)) # label(right_distributivity) # label(axiom).  [clausify(15)].
3.05/3.34	31 -leq(multiplication(a,multiplication(a,multiplication(a,multiplication(a,multiplication(a,a))))),star(a)) # label(a) # label(negated_conjecture) # answer(a).  [assumption].
3.05/3.34	32 addition(A,B) != B | leq(A,B) # label(order) # label(axiom).  [clausify(16)].
3.05/3.34	33 addition(A,B) = B | -leq(A,B) # label(order) # label(axiom).  [clausify(16)].
3.05/3.34	34 -leq(addition(multiplication(A,B),C),A) | leq(multiplication(C,star(B)),A) # label(star_induction_right) # label(axiom).  [clausify(10)].
3.05/3.34	35 -leq(addition(A,multiplication(B,C)),B) | leq(multiplication(A,star(C)),B).  [copy(34),rewrite([23(2)])].
3.05/3.34	40 addition(A,addition(A,B)) = addition(A,B).  [para(27(a,1),20(a,1)),rewrite([23(1),23(2),27(2,R),20(1),23(3)])].
3.05/3.34	43 addition(A,multiplication(B,A)) = multiplication(addition(B,one),A).  [para(22(a,1),29(a,1,1)),rewrite([23(4)])].
3.05/3.34	46 addition(A,multiplication(A,B)) = multiplication(A,addition(B,one)).  [para(18(a,1),30(a,1,1)),rewrite([23(4)])].
3.05/3.34	48 leq(A,A).  [hyper(32,a,20,a)].
3.05/3.34	52 addition(A,addition(B,C)) != addition(A,C) | leq(B,addition(A,C)).  [para(27(a,1),32(a,1)),rewrite([23(3),23(5)])].
3.05/3.34	53 addition(A,addition(B,C)) != addition(A,B) | leq(C,addition(A,B)).  [para(27(a,2),32(a,1))].
3.05/3.34	56 addition(star(A),addition(one,multiplication(star(A),A))) = star(A).  [hyper(33,b,25,a),rewrite([23(6)])].
3.05/3.34	57 addition(star(A),addition(one,multiplication(A,star(A)))) = star(A).  [hyper(33,b,24,a),rewrite([23(6)])].
3.05/3.34	61 -leq(multiplication(A,B),A) | leq(multiplication(A,multiplication(B,star(B))),A).  [para(20(a,1),35(a,1)),rewrite([28(5)])].
3.05/3.34	63 -leq(addition(A,multiplication(B,multiplication(C,D))),multiplication(B,C)) | leq(multiplication(A,star(D)),multiplication(B,C)).  [para(28(a,1),35(a,1,2))].
3.05/3.34	64 -leq(multiplication(addition(A,B),C),B) | leq(multiplication(A,multiplication(C,star(C))),B).  [para(29(a,1),35(a,1)),rewrite([28(6)])].
3.05/3.34	65 -leq(multiplication(A,addition(B,C)),A) | leq(multiplication(A,multiplication(B,star(C))),A).  [para(30(a,1),35(a,1)),rewrite([28(6)])].
3.05/3.34	79 leq(A,addition(A,B)).  [hyper(32,a,40,a)].
3.05/3.34	81 leq(multiplication(A,B),multiplication(A,addition(B,C))).  [para(30(a,1),79(a,2))].
3.05/3.34	165 -leq(multiplication(A,addition(B,one)),A) | leq(multiplication(A,star(B)),A).  [para(46(a,1),35(a,1))].
3.05/3.34	197 leq(A,addition(B,A)).  [para(20(a,1),52(a,1,2)),xx(a)].
3.05/3.34	203 leq(A,addition(B,addition(A,C))).  [para(40(a,1),52(a,1,2)),xx(a)].
3.05/3.34	210 leq(addition(A,B),addition(A,addition(B,C))).  [para(27(a,1),197(a,2)),rewrite([23(2),27(3,R),23(2)])].
3.05/3.34	212 leq(multiplication(A,B),addition(C,multiplication(addition(A,D),B))).  [para(29(a,1),203(a,2,2))].
3.05/3.34	216 leq(A,addition(B,multiplication(A,addition(C,one)))).  [para(46(a,1),203(a,2,2))].
3.05/3.34	289 leq(one,star(A)).  [para(56(a,1),203(a,2))].
3.05/3.34	291 addition(star(A),one) != star(A) | leq(multiplication(star(A),A),addition(star(A),one)).  [para(56(a,1),53(a,1)),flip(a)].
3.05/3.34	292 leq(addition(star(A),one),star(A)).  [para(56(a,1),210(a,2))].
3.05/3.34	295 addition(one,star(A)) = star(A).  [hyper(33,b,289,a)].
3.05/3.34	296 addition(star(A),one) = star(A).  [hyper(33,b,292,a),rewrite([23(5),40(5)])].
3.05/3.34	297 leq(multiplication(star(A),A),star(A)).  [back_rewrite(291),rewrite([296(3),296(8)]),xx(a)].
3.05/3.34	299 addition(A,multiplication(A,star(B))) = multiplication(A,star(B)).  [para(295(a,1),30(a,2,2)),rewrite([18(2)])].
3.05/3.34	302 leq(A,multiplication(A,star(B))).  [para(295(a,1),81(a,2,2)),rewrite([18(2)])].
3.05/3.34	309 addition(star(A),multiplication(A,star(A))) = star(A).  [para(57(a,1),27(a,1)),rewrite([296(6),23(5)]),flip(a)].
3.05/3.34	317 leq(multiplication(A,B),multiplication(A,multiplication(B,star(C)))).  [para(28(a,1),302(a,2))].
3.05/3.34	321 leq(A,addition(B,multiplication(A,star(C)))).  [para(296(a,1),216(a,2,2,2))].
3.05/3.34	327 addition(star(A),multiplication(star(A),A)) = star(A).  [hyper(33,b,297,a),rewrite([23(4)])].
3.05/3.34	348 leq(multiplication(star(A),multiplication(A,star(A))),star(A)).  [hyper(61,a,297,a)].
3.05/3.34	399 -leq(multiplication(A,addition(one,multiplication(B,C))),multiplication(A,B)) | leq(multiplication(A,star(C)),multiplication(A,B)).  [para(46(a,1),63(a,1)),rewrite([23(3)])].
3.05/3.34	429 -leq(multiplication(star(A),B),star(A)) | leq(multiplication(B,star(B)),star(A)).  [para(295(a,1),64(a,1,1)),rewrite([22(8)])].
3.05/3.34	441 leq(multiplication(star(addition(A,B)),multiplication(A,star(B))),star(addition(A,B))).  [hyper(65,a,297,a)].
3.05/3.34	483 multiplication(addition(A,one),star(A)) = star(A).  [para(309(a,1),43(a,1)),flip(a)].
3.05/3.34	488 leq(A,star(A)).  [para(309(a,1),321(a,2))].
3.05/3.34	493 addition(A,star(A)) = star(A).  [hyper(33,b,488,a)].
3.05/3.34	576 multiplication(star(A),star(star(A))) = star(star(A)).  [para(296(a,1),483(a,1,1))].
3.05/3.34	650 leq(multiplication(A,addition(B,one)),multiplication(A,star(B))).  [para(483(a,1),317(a,2,2))].
3.05/3.34	653 multiplication(star(A),addition(A,one)) = star(A).  [para(327(a,1),46(a,1)),flip(a)].
3.05/3.34	690 multiplication(star(star(A)),star(A)) = star(star(A)).  [para(296(a,1),653(a,1,2))].
3.05/3.34	823 leq(multiplication(star(star(A)),star(star(A))),star(star(A))).  [para(576(a,1),348(a,1,2))].
3.05/3.34	1359 multiplication(star(star(A)),multiplication(star(A),B)) = multiplication(star(star(A)),B).  [para(690(a,1),28(a,1,1)),flip(a)].
3.05/3.34	1375 leq(multiplication(star(star(A)),addition(A,one)),star(star(A))).  [para(690(a,1),650(a,2))].
3.05/3.34	1740 leq(multiplication(A,star(addition(A,B))),star(addition(A,B))).  [para(309(a,1),212(a,2))].
3.05/3.34	1741 leq(multiplication(A,B),addition(C,multiplication(star(A),B))).  [para(493(a,1),212(a,2,2,1))].
3.05/3.34	1764 leq(multiplication(A,B),multiplication(star(A),addition(B,C))).  [para(30(a,1),1741(a,2)),rewrite([23(3)])].
3.05/3.34	1770 leq(multiplication(A,A),star(A)).  [para(327(a,1),1741(a,2))].
3.05/3.34	1783 addition(star(A),multiplication(A,A)) = star(A).  [hyper(33,b,1770,a),rewrite([23(3)])].
3.05/3.34	1847 leq(multiplication(A,B),multiplication(star(A),star(B))).  [para(493(a,1),1764(a,2,2))].
3.05/3.34	3798 multiplication(star(star(A)),star(star(A))) = star(star(A)).  [hyper(33,b,823,a),rewrite([23(8),299(8)])].
3.05/3.34	5900 leq(multiplication(star(addition(A,one)),star(A)),star(addition(A,one))).  [hyper(165,a,297,a)].
3.05/3.34	6750 multiplication(addition(A,one),star(addition(A,B))) = star(addition(A,B)).  [hyper(33,b,1740,a),rewrite([23(6),43(6)])].
3.05/3.34	13395 -leq(addition(one,multiplication(A,B)),A) | leq(star(B),A).  [para(22(a,1),399(a,1)),rewrite([22(5),22(7),22(7)])].
3.05/3.34	13400 -leq(star(A),star(A)) | leq(star(addition(A,one)),star(A)).  [para(653(a,1),13395(a,1,2)),rewrite([295(3)])].
3.05/3.34	13763 leq(star(addition(A,one)),star(star(A))).  [hyper(429,a,1375,a),rewrite([6750(6)])].
3.05/3.34	13766 addition(star(star(A)),star(addition(A,one))) = star(star(A)).  [hyper(33,b,13763,a),rewrite([23(6)])].
3.05/3.34	13895 leq(multiplication(star(star(A)),star(multiplication(A,A))),star(star(A))).  [para(1783(a,1),441(a,1,1,1)),rewrite([1359(7),1783(8)])].
3.05/3.34	14097 leq(star(star(A)),star(addition(A,one))).  [hyper(429,a,5900,a),rewrite([576(4)])].
3.05/3.34	14100 star(addition(A,one)) = star(star(A)).  [hyper(33,b,14097,a),rewrite([13766(6)]),flip(a)].
3.05/3.34	14143 -leq(star(A),star(A)) | leq(star(star(A)),star(A)).  [back_rewrite(13400),rewrite([14100(6)])].
3.05/3.34	14415 leq(star(star(A)),star(A)).  [hyper(14143,a,48,a)].
3.05/3.34	14416 star(star(A)) = star(A).  [hyper(33,b,14415,a),rewrite([23(4),493(4)])].
3.05/3.34	14579 leq(multiplication(star(A),star(multiplication(A,A))),star(A)).  [back_rewrite(13895),rewrite([14416(2),14416(6)])].
3.05/3.34	14681 multiplication(star(A),star(A)) = star(A).  [back_rewrite(3798),rewrite([14416(2),14416(3),14416(5)])].
3.05/3.34	15067 leq(star(multiplication(A,A)),star(A)).  [hyper(429,a,14579,a),rewrite([14416(5),14681(5)])].
3.05/3.34	15068 multiplication(star(A),star(multiplication(A,A))) = star(A).  [hyper(33,b,14579,a),rewrite([23(6),299(6)])].
3.05/3.34	15071 addition(star(A),star(multiplication(A,A))) = star(A).  [hyper(33,b,15067,a),rewrite([23(4)])].
3.05/3.34	15088 leq(multiplication(A,multiplication(A,A)),star(A)).  [para(15068(a,1),1847(a,2))].
3.05/3.34	15143 addition(star(A),multiplication(A,multiplication(A,A))) = star(A).  [hyper(33,b,15088,a),rewrite([23(4)])].
3.05/3.34	17043 leq(multiplication(A,multiplication(A,A)),addition(B,star(A))).  [para(15143(a,1),53(a,1,2)),xx(a)].
3.05/3.34	17076 leq(multiplication(A,multiplication(A,multiplication(A,multiplication(A,multiplication(A,A))))),star(A)).  [para(15071(a,1),17043(a,2)),rewrite([28(4),28(5)])].
3.05/3.34	17077 $F # answer(a).  [resolve(17076,a,31,a)].
3.05/3.34	
3.05/3.34	% SZS output end Refutation
3.05/3.34	============================== end of proof ==========================
3.05/3.34	
3.05/3.34	============================== STATISTICS ============================
3.05/3.34	
3.05/3.34	Given=1399. Generated=113105. Kept=17057. proofs=1.
3.05/3.34	Usable=1038. Sos=9821. Demods=485. Limbo=1, Disabled=6214. Hints=0.
3.05/3.34	Megabytes=12.04.
3.05/3.34	User_CPU=2.26, System_CPU=0.07, Wall_clock=3.
3.05/3.34	
3.05/3.34	============================== end of statistics =====================
3.05/3.34	
3.05/3.34	============================== end of search =========================
3.05/3.34	
3.05/3.34	THEOREM PROVED
3.05/3.34	% SZS status Theorem
3.05/3.34	
3.05/3.34	Exiting with 1 proof.
3.05/3.34	
3.05/3.34	Process 16835 exit (max_proofs) Tue Jul 13 16:04:24 2021
3.05/3.34	Prover9 interrupted
3.05/3.34	EOF