0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.13/0.34 % Computer : n025.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 : 960 0.13/0.34 % DateTime : Thu Jul 2 08:29:33 EDT 2020 0.13/0.34 % CPUTime : 0.74/1.01 ============================== Prover9 =============================== 0.74/1.01 Prover9 (32) version 2009-11A, November 2009. 0.74/1.01 Process 11113 was started by sandbox2 on n025.cluster.edu, 0.74/1.01 Thu Jul 2 08:29:33 2020 0.74/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_10960_n025.cluster.edu". 0.74/1.01 ============================== end of head =========================== 0.74/1.01 0.74/1.01 ============================== INPUT ================================= 0.74/1.01 0.74/1.01 % Reading from file /tmp/Prover9_10960_n025.cluster.edu 0.74/1.01 0.74/1.01 set(prolog_style_variables). 0.74/1.01 set(auto2). 0.74/1.01 % set(auto2) -> set(auto). 0.74/1.01 % set(auto) -> set(auto_inference). 0.74/1.01 % set(auto) -> set(auto_setup). 0.74/1.01 % set(auto_setup) -> set(predicate_elim). 0.74/1.01 % set(auto_setup) -> assign(eq_defs, unfold). 0.74/1.01 % set(auto) -> set(auto_limits). 0.74/1.01 % set(auto_limits) -> assign(max_weight, "100.000"). 0.74/1.01 % set(auto_limits) -> assign(sos_limit, 20000). 0.74/1.01 % set(auto) -> set(auto_denials). 0.74/1.01 % set(auto) -> set(auto_process). 0.74/1.01 % set(auto2) -> assign(new_constants, 1). 0.74/1.01 % set(auto2) -> assign(fold_denial_max, 3). 0.74/1.01 % set(auto2) -> assign(max_weight, "200.000"). 0.74/1.01 % set(auto2) -> assign(max_hours, 1). 0.74/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.74/1.01 % set(auto2) -> assign(max_seconds, 0). 0.74/1.01 % set(auto2) -> assign(max_minutes, 5). 0.74/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.74/1.01 % set(auto2) -> set(sort_initial_sos). 0.74/1.01 % set(auto2) -> assign(sos_limit, -1). 0.74/1.01 % set(auto2) -> assign(lrs_ticks, 3000). 0.74/1.01 % set(auto2) -> assign(max_megs, 400). 0.74/1.01 % set(auto2) -> assign(stats, some). 0.74/1.01 % set(auto2) -> clear(echo_input). 0.74/1.01 % set(auto2) -> set(quiet). 0.74/1.01 % set(auto2) -> clear(print_initial_clauses). 0.74/1.01 % set(auto2) -> clear(print_given). 0.74/1.01 assign(lrs_ticks,-1). 0.74/1.01 assign(sos_limit,10000). 0.74/1.01 assign(order,kbo). 0.74/1.01 set(lex_order_vars). 0.74/1.01 clear(print_given). 0.74/1.01 0.74/1.01 % formulas(sos). % not echoed (17 formulas) 0.74/1.01 0.74/1.01 ============================== end of input ========================== 0.74/1.01 0.74/1.01 % From the command line: assign(max_seconds, 960). 0.74/1.01 0.74/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.74/1.01 0.74/1.01 % Formulas that are not ordinary clauses: 0.74/1.01 1 (all A leq(addition(one,multiplication(star(A),A)),star(A))) # label(star_unfold_left) # label(axiom) # label(non_clause). [assumption]. 0.74/1.01 2 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption]. 0.74/1.01 3 (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.01 4 (all A A = multiplication(A,one)) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption]. 0.74/1.01 5 (all A leq(addition(one,multiplication(A,star(A))),star(A))) # label(star_unfold_right) # label(axiom) # label(non_clause). [assumption]. 0.74/1.01 6 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption]. 0.74/1.01 7 (all A A = addition(A,A)) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption]. 0.74/1.01 8 (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.01 9 (all A all B all C multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C)) # label(multiplicative_associativity) # label(axiom) # label(non_clause). [assumption]. 0.74/1.01 10 (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]. 0.74/1.01 11 (all A A = addition(A,zero)) # label(additive_identity) # label(axiom) # label(non_clause). [assumption]. 0.74/1.01 12 (all A all B all C multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C))) # label(left_distributivity) # label(axiom) # label(non_clause). [assumption]. 0.74/1.01 13 (all A zero = multiplication(A,zero)) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption]. 0.74/1.01 14 (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]. 3.21/3.53 15 (all A all B addition(B,A) = addition(A,B)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption]. 3.21/3.53 16 (all A all B (B = addition(A,B) <-> leq(A,B))) # label(order) # label(axiom) # label(non_clause). [assumption]. 3.21/3.53 3.21/3.53 ============================== end of process non-clausal formulas === 3.21/3.53 3.21/3.53 ============================== PROCESS INITIAL CLAUSES =============== 3.21/3.53 3.21/3.53 ============================== PREDICATE ELIMINATION ================= 3.21/3.53 3.21/3.53 ============================== end predicate elimination ============= 3.21/3.53 3.21/3.53 Auto_denials: 3.21/3.53 % copying label a to answer in negative clause 3.21/3.53 3.21/3.53 Term ordering decisions: 3.21/3.53 3.21/3.53 % Assigning unary symbol star kb_weight 0 and highest precedence (8). 3.21/3.53 Function symbol KB weights: zero=1. one=1. a=1. multiplication=1. addition=1. star=0. 3.21/3.53 3.21/3.53 ============================== end of process initial clauses ======== 3.21/3.53 3.21/3.53 ============================== CLAUSES FOR SEARCH ==================== 3.21/3.53 3.21/3.53 ============================== end of clauses for search ============= 3.21/3.53 3.21/3.53 ============================== SEARCH ================================ 3.21/3.53 3.21/3.53 % Starting search at 0.01 seconds. 3.21/3.53 3.21/3.53 Low Water (keep): wt=34.000, iters=3342 3.21/3.53 3.21/3.53 Low Water (keep): wt=33.000, iters=3393 3.21/3.53 3.21/3.53 Low Water (keep): wt=32.000, iters=3543 3.21/3.53 3.21/3.53 Low Water (keep): wt=30.000, iters=3365 3.21/3.53 3.21/3.53 Low Water (keep): wt=29.000, iters=3335 3.21/3.53 3.21/3.53 Low Water (keep): wt=28.000, iters=3362 3.21/3.53 3.21/3.53 Low Water (keep): wt=27.000, iters=3376 3.21/3.53 3.21/3.53 Low Water (keep): wt=25.000, iters=3335 3.21/3.53 3.21/3.53 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 53 (0.00 of 0.86 sec). 3.21/3.53 3.21/3.53 Low Water (keep): wt=24.000, iters=3355 3.21/3.53 3.21/3.53 Low Water (keep): wt=23.000, iters=3340 3.21/3.53 3.21/3.53 Low Water (keep): wt=22.000, iters=3344 3.21/3.53 3.21/3.53 Low Water (keep): wt=21.000, iters=3357 3.21/3.53 3.21/3.53 Low Water (keep): wt=20.000, iters=3360 3.21/3.53 3.21/3.53 Low Water (keep): wt=19.000, iters=3338 3.21/3.53 3.21/3.53 Low Water (displace): id=5643, wt=46.000 3.21/3.53 3.21/3.53 Low Water (displace): id=5617, wt=44.000 3.21/3.53 3.21/3.53 Low Water (displace): id=6317, wt=43.000 3.21/3.53 3.21/3.53 Low Water (displace): id=5880, wt=42.000 3.21/3.53 3.21/3.53 Low Water (displace): id=6333, wt=41.000 3.21/3.53 3.21/3.53 Low Water (displace): id=6313, wt=40.000 3.21/3.53 3.21/3.53 Low Water (displace): id=6256, wt=39.000 3.21/3.53 3.21/3.53 Low Water (displace): id=6297, wt=38.000 3.21/3.53 3.21/3.53 Low Water (displace): id=6229, wt=37.000 3.21/3.53 3.21/3.53 Low Water (displace): id=11615, wt=18.000 3.21/3.53 3.21/3.53 Low Water (displace): id=11963, wt=15.000 3.21/3.53 3.21/3.53 Low Water (displace): id=12664, wt=14.000 3.21/3.53 3.21/3.53 Low Water (displace): id=12665, wt=13.000 3.21/3.53 3.21/3.53 Low Water (displace): id=12675, wt=12.000 3.21/3.53 3.21/3.53 Low Water (keep): wt=18.000, iters=3415 3.21/3.53 3.21/3.53 Low Water (displace): id=14599, wt=10.000 3.21/3.53 3.21/3.53 ============================== PROOF ================================= 3.21/3.53 % SZS status Theorem 3.21/3.53 % SZS output start Refutation 3.21/3.53 3.21/3.53 % Proof 1 at 2.43 (+ 0.07) seconds: a. 3.21/3.53 % Length of proof is 111. 3.21/3.53 % Level of proof is 23. 3.21/3.53 % Maximum clause weight is 20.000. 3.21/3.53 % Given clauses 1364. 3.21/3.53 3.21/3.53 1 (all A leq(addition(one,multiplication(star(A),A)),star(A))) # label(star_unfold_left) # label(axiom) # label(non_clause). [assumption]. 3.21/3.53 2 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption]. 3.21/3.53 3 (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.21/3.53 4 (all A A = multiplication(A,one)) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption]. 3.21/3.53 5 (all A leq(addition(one,multiplication(A,star(A))),star(A))) # label(star_unfold_right) # label(axiom) # label(non_clause). [assumption]. 3.21/3.53 7 (all A A = addition(A,A)) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption]. 3.21/3.53 8 (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.21/3.53 9 (all A all B all C multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C)) # label(multiplicative_associativity) # label(axiom) # label(non_clause). [assumption]. 3.21/3.53 10 (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.21/3.53 12 (all A all B all C multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C))) # label(left_distributivity) # label(axiom) # label(non_clause). [assumption]. 3.21/3.53 14 (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]. 3.21/3.53 15 (all A all B addition(B,A) = addition(A,B)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption]. 3.21/3.53 16 (all A all B (B = addition(A,B) <-> leq(A,B))) # label(order) # label(axiom) # label(non_clause). [assumption]. 3.21/3.53 17 multiplication(one,A) = A # label(multiplicative_left_identity) # label(axiom). [clausify(2)]. 3.21/3.53 18 multiplication(A,one) = A # label(multiplicative_right_identity) # label(axiom). [clausify(4)]. 3.21/3.53 20 addition(A,A) = A # label(additive_idempotence) # label(axiom). [clausify(7)]. 3.21/3.53 23 addition(A,B) = addition(B,A) # label(additive_commutativity) # label(axiom). [clausify(15)]. 3.21/3.53 24 leq(addition(one,multiplication(star(A),A)),star(A)) # label(star_unfold_left) # label(axiom). [clausify(1)]. 3.21/3.53 25 leq(addition(one,multiplication(A,star(A))),star(A)) # label(star_unfold_right) # label(axiom). [clausify(5)]. 3.21/3.53 26 addition(addition(A,B),C) = addition(A,addition(B,C)) # label(additive_associativity) # label(axiom). [clausify(3)]. 3.21/3.53 27 addition(A,addition(B,C)) = addition(C,addition(A,B)). [copy(26),rewrite([23(2)]),flip(a)]. 3.21/3.53 28 multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)) # label(multiplicative_associativity) # label(axiom). [clausify(9)]. 3.21/3.53 29 addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C)) # label(right_distributivity) # label(axiom). [clausify(10)]. 3.21/3.53 30 addition(multiplication(A,B),multiplication(C,B)) = multiplication(addition(A,C),B) # label(left_distributivity) # label(axiom). [clausify(12)]. 3.21/3.53 31 -leq(multiplication(a,multiplication(a,multiplication(a,a))),star(a)) # label(a) # label(negated_conjecture) # answer(a). [assumption]. 3.21/3.53 32 addition(A,B) != B | leq(A,B) # label(order) # label(axiom). [clausify(16)]. 3.21/3.53 33 addition(A,B) = B | -leq(A,B) # label(order) # label(axiom). [clausify(16)]. 3.21/3.53 34 -leq(addition(multiplication(A,B),C),A) | leq(multiplication(C,star(B)),A) # label(star_induction_right) # label(axiom). [clausify(8)]. 3.21/3.53 35 -leq(addition(A,multiplication(B,C)),B) | leq(multiplication(A,star(C)),B). [copy(34),rewrite([23(2)])]. 3.21/3.53 36 -leq(addition(multiplication(A,B),C),B) | leq(multiplication(star(A),C),B) # label(star_induction_left) # label(axiom). [clausify(14)]. 3.21/3.53 37 -leq(addition(A,multiplication(B,C)),C) | leq(multiplication(star(B),A),C). [copy(36),rewrite([23(2)])]. 3.21/3.53 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.21/3.53 42 addition(A,multiplication(A,B)) = multiplication(A,addition(B,one)). [para(18(a,1),29(a,1,1)),rewrite([23(4)])]. 3.21/3.53 44 addition(A,multiplication(B,A)) = multiplication(addition(B,one),A). [para(17(a,1),30(a,1,1)),rewrite([23(4)])]. 3.21/3.53 48 leq(A,A). [hyper(32,a,20,a)]. 3.21/3.53 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.21/3.53 53 addition(A,addition(B,C)) != addition(A,B) | leq(C,addition(A,B)). [para(27(a,2),32(a,1))]. 3.21/3.53 56 addition(star(A),addition(one,multiplication(A,star(A)))) = star(A). [hyper(33,b,25,a),rewrite([23(6)])]. 3.21/3.53 57 addition(star(A),addition(one,multiplication(star(A),A))) = star(A). [hyper(33,b,24,a),rewrite([23(6)])]. 3.21/3.53 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.21/3.53 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.21/3.53 64 -leq(multiplication(A,addition(B,C)),A) | leq(multiplication(A,multiplication(B,star(C))),A). [para(29(a,1),35(a,1)),rewrite([28(6)])]. 3.21/3.53 65 -leq(multiplication(addition(A,B),C),B) | leq(multiplication(A,multiplication(C,star(C))),B). [para(30(a,1),35(a,1)),rewrite([28(6)])]. 3.21/3.53 69 -leq(multiplication(A,B),B) | leq(multiplication(star(A),multiplication(A,B)),B). [para(20(a,1),37(a,1))]. 3.21/3.53 79 leq(A,addition(A,B)). [hyper(32,a,40,a)]. 3.21/3.53 80 leq(multiplication(A,B),multiplication(A,addition(B,C))). [para(29(a,1),79(a,2))]. 3.21/3.53 138 addition(addition(A,multiplication(B,A)),multiplication(addition(B,one),C)) = multiplication(addition(B,one),addition(A,C)). [para(44(a,2),29(a,1,1))]. 3.21/3.53 145 -leq(multiplication(addition(A,one),B),B) | leq(multiplication(star(A),B),B). [para(44(a,1),37(a,1))]. 3.21/3.53 199 leq(A,addition(B,A)). [para(20(a,1),52(a,1,2)),xx(a)]. 3.21/3.53 205 leq(A,addition(B,addition(A,C))). [para(40(a,1),52(a,1,2)),xx(a)]. 3.21/3.53 208 addition(A,multiplication(addition(B,one),C)) != addition(A,multiplication(B,C)) | leq(C,addition(A,multiplication(B,C))). [para(44(a,1),52(a,1,2))]. 3.21/3.53 212 leq(addition(A,B),addition(A,addition(B,C))). [para(27(a,1),199(a,2)),rewrite([23(2),27(3,R),23(2)])]. 3.21/3.53 213 leq(multiplication(A,B),addition(C,multiplication(A,addition(B,D)))). [para(29(a,1),205(a,2,2))]. 3.21/3.53 214 leq(multiplication(A,B),addition(C,multiplication(addition(A,D),B))). [para(30(a,1),205(a,2,2))]. 3.21/3.53 216 leq(A,addition(B,multiplication(addition(C,one),A))). [para(44(a,1),205(a,2,2))]. 3.21/3.53 250 addition(A,addition(B,multiplication(addition(C,one),A))) = addition(B,multiplication(addition(C,one),A)). [hyper(33,b,216,a)]. 3.21/3.53 251 leq(A,multiplication(addition(B,one),addition(A,C))). [para(29(a,1),216(a,2)),rewrite([23(3)])]. 3.21/3.53 287 addition(one,multiplication(addition(A,one),star(addition(A,one)))) = star(addition(A,one)). [para(44(a,2),56(a,1,2,2)),rewrite([44(12),250(12)])]. 3.21/3.53 290 leq(one,star(A)). [para(56(a,1),205(a,2))]. 3.21/3.53 292 addition(star(A),one) != star(A) | leq(multiplication(A,star(A)),addition(star(A),one)). [para(56(a,1),53(a,1)),flip(a)]. 3.21/3.53 293 leq(addition(star(A),one),star(A)). [para(56(a,1),212(a,2))]. 3.21/3.53 296 addition(one,star(A)) = star(A). [hyper(33,b,290,a)]. 3.21/3.53 297 addition(star(A),one) = star(A). [hyper(33,b,293,a),rewrite([23(5),40(5)])]. 3.21/3.53 298 leq(multiplication(A,star(A)),star(A)). [back_rewrite(292),rewrite([297(3),297(8)]),xx(a)]. 3.21/3.53 299 addition(A,multiplication(A,star(B))) = multiplication(A,star(B)). [para(296(a,1),29(a,2,2)),rewrite([18(2)])]. 3.21/3.53 302 leq(A,multiplication(A,star(B))). [para(296(a,1),80(a,2,2)),rewrite([18(2)])]. 3.21/3.53 308 leq(one,multiplication(addition(A,one),star(B))). [para(296(a,1),251(a,2,2))]. 3.21/3.53 309 leq(multiplication(A,B),multiplication(A,multiplication(B,star(C)))). [para(28(a,1),302(a,2))]. 3.21/3.53 311 addition(star(A),multiplication(star(A),A)) = star(A). [para(57(a,1),27(a,1)),rewrite([297(6),23(5)]),flip(a)]. 3.21/3.53 316 leq(multiplication(star(A),A),star(A)). [para(57(a,1),53(a,1)),rewrite([297(4),297(8)]),xx(a)]. 3.21/3.53 322 leq(A,addition(B,multiplication(star(C),A))). [para(297(a,1),216(a,2,2,1))]. 3.21/3.53 328 addition(star(A),multiplication(A,star(A))) = star(A). [hyper(33,b,298,a),rewrite([23(4)])]. 3.21/3.53 364 addition(one,multiplication(addition(A,one),star(B))) = multiplication(addition(A,one),star(B)). [hyper(33,b,308,a)]. 3.21/3.53 366 multiplication(addition(A,one),star(addition(A,one))) = star(addition(A,one)). [back_rewrite(287),rewrite([364(8)])]. 3.21/3.53 396 -leq(multiplication(A,addition(one,multiplication(B,C))),multiplication(A,B)) | leq(multiplication(A,star(C)),multiplication(A,B)). [para(42(a,1),63(a,1)),rewrite([23(3)])]. 3.21/3.53 423 leq(multiplication(star(addition(A,B)),multiplication(A,star(B))),star(addition(A,B))). [hyper(64,a,316,a)]. 3.21/3.53 452 -leq(multiplication(star(A),B),star(A)) | leq(multiplication(B,star(B)),star(A)). [para(296(a,1),65(a,1,1)),rewrite([17(8)])]. 3.21/3.53 471 multiplication(star(A),addition(A,one)) = star(A). [para(311(a,1),42(a,1)),flip(a)]. 3.21/3.53 477 leq(A,star(A)). [para(311(a,1),322(a,2))]. 3.21/3.53 495 addition(A,star(A)) = star(A). [hyper(33,b,477,a)]. 3.21/3.53 584 multiplication(star(star(A)),star(A)) = star(star(A)). [para(297(a,1),471(a,1,2))]. 3.21/3.53 652 multiplication(addition(A,one),star(A)) = star(A). [para(328(a,1),44(a,1)),flip(a)]. 3.21/3.53 678 leq(multiplication(A,addition(B,one)),multiplication(A,star(B))). [para(652(a,1),309(a,2,2))]. 3.21/3.53 805 multiplication(star(star(A)),multiplication(star(A),B)) = multiplication(star(star(A)),B). [para(584(a,1),28(a,1,1)),flip(a)]. 3.21/3.53 1372 leq(multiplication(star(star(A)),addition(A,one)),star(star(A))). [para(584(a,1),678(a,2))]. 3.21/3.53 1896 leq(multiplication(A,B),addition(C,multiplication(A,star(B)))). [para(495(a,1),213(a,2,2,2))]. 3.21/3.53 1926 leq(multiplication(A,A),star(A)). [para(328(a,1),1896(a,2))]. 3.21/3.53 1942 addition(star(A),multiplication(A,A)) = star(A). [hyper(33,b,1926,a),rewrite([23(3)])]. 3.21/3.53 2318 leq(multiplication(A,star(addition(A,B))),star(addition(A,B))). [para(328(a,1),214(a,2))]. 3.21/3.53 4020 leq(multiplication(star(A),star(addition(A,one))),star(addition(A,one))). [hyper(145,a,298,a)]. 3.21/3.53 7364 leq(multiplication(star(star(A)),star(addition(A,one))),star(star(A))). [hyper(61,a,1372,a),rewrite([366(8)])]. 3.21/3.53 7982 multiplication(addition(A,one),star(addition(A,B))) = star(addition(A,B)). [hyper(33,b,2318,a),rewrite([23(6),44(6)])]. 3.21/3.53 8837 leq(A,multiplication(addition(B,one),addition(C,A))). [para(138(a,1),208(a,2)),rewrite([23(6),27(6,R),20(5),138(6),138(15)]),xx(a)]. 3.21/3.53 8847 leq(multiplication(A,A),multiplication(addition(B,one),star(A))). [para(1942(a,1),8837(a,2,2))]. 3.21/3.53 8859 leq(multiplication(A,A),multiplication(star(B),star(A))). [para(297(a,1),8847(a,2,1))]. 3.21/3.53 13733 -leq(addition(one,multiplication(A,B)),A) | leq(star(B),A). [para(17(a,1),396(a,1)),rewrite([17(5),17(7),17(7)])]. 3.21/3.53 13760 -leq(star(A),star(A)) | leq(star(addition(A,one)),star(A)). [para(471(a,1),13733(a,1,2)),rewrite([296(3)])]. 3.21/3.53 13936 leq(multiplication(star(star(A)),star(multiplication(A,A))),star(star(A))). [para(1942(a,1),423(a,1,1,1)),rewrite([805(7),1942(8)])]. 3.21/3.53 14167 leq(multiplication(star(star(A)),star(addition(A,one))),star(addition(A,one))). [hyper(69,a,4020,a),rewrite([805(8)])]. 3.21/3.53 14576 leq(star(addition(A,one)),star(star(A))). [hyper(452,a,1372,a),rewrite([7982(6)])]. 3.21/3.53 14581 addition(star(star(A)),star(addition(A,one))) = star(star(A)). [hyper(33,b,14576,a),rewrite([23(6)])]. 3.21/3.53 14780 multiplication(star(star(A)),star(addition(A,one))) = star(star(A)). [hyper(33,b,7364,a),rewrite([23(9),299(9)])]. 3.21/3.53 14781 leq(star(star(A)),star(addition(A,one))). [back_rewrite(14167),rewrite([14780(6)])]. 3.21/3.53 14782 star(addition(A,one)) = star(star(A)). [hyper(33,b,14781,a),rewrite([14581(6)]),flip(a)]. 3.21/3.53 14825 -leq(star(A),star(A)) | leq(star(star(A)),star(A)). [back_rewrite(13760),rewrite([14782(6)])]. 3.21/3.53 15208 leq(star(star(A)),star(A)). [hyper(14825,a,48,a)]. 3.21/3.53 15210 star(star(A)) = star(A). [hyper(33,b,15208,a),rewrite([23(4),495(4)])]. 3.21/3.53 15394 leq(multiplication(star(A),star(multiplication(A,A))),star(A)). [back_rewrite(13936),rewrite([15210(2),15210(6)])]. 3.21/3.53 15897 multiplication(star(A),star(multiplication(A,A))) = star(A). [hyper(33,b,15394,a),rewrite([23(6),299(6)])]. 3.21/3.53 15935 leq(multiplication(A,multiplication(A,multiplication(A,A))),star(A)). [para(15897(a,1),8859(a,2)),rewrite([28(3)])]. 3.21/3.53 15936 $F # answer(a). [resolve(15935,a,31,a)]. 3.21/3.53 3.21/3.53 % SZS output end Refutation 3.21/3.53 ============================== end of proof ========================== 3.21/3.53 3.21/3.53 ============================== STATISTICS ============================ 3.21/3.53 3.21/3.53 Given=1364. Generated=101093. Kept=15916. proofs=1. 3.21/3.53 Usable=989. Sos=8107. Demods=414. Limbo=23, Disabled=6814. Hints=0. 3.21/3.53 Megabytes=11.78. 3.21/3.53 User_CPU=2.43, System_CPU=0.07, Wall_clock=3. 3.21/3.53 3.21/3.53 ============================== end of statistics ===================== 3.21/3.53 3.21/3.53 ============================== end of search ========================= 3.21/3.53 3.21/3.53 THEOREM PROVED 3.21/3.53 % SZS status Theorem 3.21/3.53 3.21/3.53 Exiting with 1 proof. 3.21/3.53 3.21/3.53 Process 11113 exit (max_proofs) Thu Jul 2 08:29:36 2020 3.21/3.53 Prover9 interrupted 3.21/3.53 EOF