TSTP Solution File: NUM924+6 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM924+6 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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 : Mon Jul 18 14:23:11 EDT 2022
% Result : Unknown 0.81s 1.00s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM924+6 : TPTP v8.1.0. Released v5.3.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n021.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 Jul 5 21:25:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.43 ----- Otter 3.2, August 2001 -----
% 0.19/0.43 The process was started by sandbox on n021.cluster.edu,
% 0.19/0.43 Tue Jul 5 21:25:18 2022
% 0.19/0.43 The command was "./sos". The process ID is 24479.
% 0.19/0.43
% 0.19/0.43 set(prolog_style_variables).
% 0.19/0.43 set(auto).
% 0.19/0.43 dependent: set(auto1).
% 0.19/0.43 dependent: set(process_input).
% 0.19/0.43 dependent: clear(print_kept).
% 0.19/0.43 dependent: clear(print_new_demod).
% 0.19/0.43 dependent: clear(print_back_demod).
% 0.19/0.43 dependent: clear(print_back_sub).
% 0.19/0.43 dependent: set(control_memory).
% 0.19/0.43 dependent: assign(max_mem, 12000).
% 0.19/0.43 dependent: assign(pick_given_ratio, 4).
% 0.19/0.43 dependent: assign(stats_level, 1).
% 0.19/0.43 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.43 dependent: assign(sos_limit, 5000).
% 0.19/0.43 dependent: assign(max_weight, 60).
% 0.19/0.43 clear(print_given).
% 0.19/0.43
% 0.19/0.43 formula_list(usable).
% 0.19/0.43
% 0.19/0.43 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.19/0.43
% 0.19/0.43 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.43 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.43 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.43 clauses in usable.
% 0.19/0.43
% 0.19/0.43 dependent: set(knuth_bendix).
% 0.19/0.43 dependent: set(para_from).
% 0.19/0.43 dependent: set(para_into).
% 0.19/0.43 dependent: clear(para_from_right).
% 0.19/0.43 dependent: clear(para_into_right).
% 0.19/0.43 dependent: set(para_from_vars).
% 0.19/0.43 dependent: set(eq_units_both_ways).
% 0.19/0.43 dependent: set(dynamic_demod_all).
% 0.19/0.43 dependent: set(dynamic_demod).
% 0.19/0.43 dependent: set(order_eq).
% 0.19/0.43 dependent: set(back_demod).
% 0.19/0.43 dependent: set(lrpo).
% 0.19/0.43 dependent: set(hyper_res).
% 0.19/0.43 dependent: set(unit_deletion).
% 0.19/0.43 dependent: set(factor).
% 0.19/0.43
% 0.19/0.43 ------------> process usable:
% 0.19/0.43 Following clause subsumed by 87 during input processing: 0 [] {-} -ord_less_eq(int,bit1(A),bit1(B))|ord_less_eq(int,A,B).
% 0.19/0.43 Following clause subsumed by 88 during input processing: 0 [] {-} ord_less_eq(int,bit1(A),bit1(B))| -ord_less_eq(int,A,B).
% 0.19/0.43 Following clause subsumed by 89 during input processing: 0 [] {-} -ord_less_eq(int,bit0(A),bit0(B))|ord_less_eq(int,A,B).
% 0.19/0.43 Following clause subsumed by 90 during input processing: 0 [] {-} ord_less_eq(int,bit0(A),bit0(B))| -ord_less_eq(int,A,B).
% 0.19/0.43 Following clause subsumed by 104 during input processing: 0 [] {-} -number_ring(A)|number_number_of(A,times_times(int,B,C))=times_times(A,number_number_of(A,B),number_number_of(A,C)).
% 0.19/0.43 Following clause subsumed by 119 during input processing: 0 [] {-} -ord_less_eq(int,bit0(A),bit1(B))|ord_less_eq(int,A,B).
% 0.19/0.43 Following clause subsumed by 120 during input processing: 0 [] {-} ord_less_eq(int,bit0(A),bit1(B))| -ord_less_eq(int,A,B).
% 0.19/0.43 Following clause subsumed by 136 during input processing: 0 [] {-} -ord_less_eq(int,bit1(A),bit0(B))|ord_less(int,A,B).
% 0.19/0.43 Following clause subsumed by 137 during input processing: 0 [] {-} ord_less_eq(int,bit1(A),bit0(B))| -ord_less(int,A,B).
% 0.19/0.43 Following clause subsumed by 138 during input processing: 0 [] {-} -ord_less(int,bit0(A),bit1(B))|ord_less_eq(int,A,B).
% 0.19/0.43 Following clause subsumed by 139 during input processing: 0 [] {-} ord_less(int,bit0(A),bit1(B))| -ord_less_eq(int,A,B).
% 0.19/0.43 Following clause subsumed by 145 during input processing: 0 [] {-} ord_less_eq(int,plus_plus(int,A,one_one(int)),B)| -ord_less(int,A,B).
% 0.19/0.43 Following clause subsumed by 187 during input processing: 0 [flip.1] {-} bit1(A)!=pls.
% 0.19/0.43 Following clause subsumed by 190 during input processing: 0 [flip.1,flip.2] {-} bit0(A)!=pls|ti(int,A)=pls.
% 0.19/0.43 Following clause subsumed by 191 during input processing: 0 [flip.1,flip.2] {-} bit0(A)=pls|ti(int,A)!=pls.
% 0.19/0.43 Following clause subsumed by 192 during input processing: 0 [] {-} -ord_less(int,bit1(A),bit1(B))|ord_less(int,A,B).
% 0.19/0.43 Following clause subsumed by 193 during input processing: 0 [] {-} ord_less(int,bit1(A),bit1(B))| -ord_less(int,A,B).
% 0.19/0.43 Following clause subsumed by 195 during input processing: 0 [] {-} -ord_less(int,bit0(A),bit0(B))|ord_less(int,A,B).
% 0.19/0.43 Following clause subsumed by 196 during input processing: 0 [] {-} ord_less(int,bit0(A),bit0(B))| -ord_less(int,A,B).
% 0.19/0.43 Following clause subsumed by 211 during input processing: 0 [] {-} -number_ring(A)|zero_zero(A)=number_number_of(A,pls).
% 0.19/0.44 Following clause subsumed by 221 during input processing: 0 [] {-} -number_ring(A)|number_number_of(A,plus_plus(int,B,C))=plus_plus(A,number_number_of(A,B),number_number_of(A,C)).
% 0.19/0.44 Following clause subsumed by 224 during input processing: 0 [] {-} -ord_less(int,bit1(A),bit0(B))|ord_less(int,A,B).
% 0.19/0.44 Following clause subsumed by 225 during input processing: 0 [] {-} ord_less(int,bit1(A),bit0(B))| -ord_less(int,A,B).
% 0.19/0.44 Following clause subsumed by 205 during input processing: 0 [] {-} -monoid_mult(A)| -number(A)|power_power(A,number_number_of(A,B),number_number_of(nat,bit0(bit1(pls))))=times_times(A,number_number_of(A,B),number_number_of(A,B)).
% 0.19/0.44 Following clause subsumed by 245 during input processing: 0 [] {-} -number_ring(A)|one_one(A)=number_number_of(A,bit1(pls)).
% 0.19/0.44 Following clause subsumed by 286 during input processing: 0 [flip.2] {-} -comm_semiring_1(A)|times_times(A,times_times(A,B,C),D)=times_times(A,B,times_times(A,C,D)).
% 0.19/0.44 Following clause subsumed by 292 during input processing: 0 [] {-} -comm_semiring_1(A)|plus_plus(A,plus_plus(A,B,C),D)=plus_plus(A,B,plus_plus(A,C,D)).
% 0.19/0.44 Following clause subsumed by 263 during input processing: 0 [] {-} -ord_less(nat,zero_zero(nat),power_power(nat,A,number_number_of(nat,B)))|number_number_of(nat,B)=zero_zero(nat)|ord_less(nat,zero_zero(nat),A).
% 0.19/0.44 Following clause subsumed by 264 during input processing: 0 [] {-} ord_less(nat,zero_zero(nat),power_power(nat,A,number_number_of(nat,B)))|number_number_of(nat,B)!=zero_zero(nat).
% 0.19/0.44 Following clause subsumed by 265 during input processing: 0 [] {-} ord_less(nat,zero_zero(nat),power_power(nat,A,number_number_of(nat,B)))| -ord_less(nat,zero_zero(nat),A).
% 0.19/0.44 Following clause subsumed by 310 during input processing: 0 [flip.2] {-} -comm_semiring_1(A)|times_times(A,plus_plus(A,B,D),C)=plus_plus(A,times_times(A,B,C),times_times(A,D,C)).
% 0.19/0.44 Following clause subsumed by 307 during input processing: 0 [] {-} -semiri456707255roduct(A)|plus_plus(A,times_times(A,B,C),times_times(A,D,E))!=plus_plus(A,times_times(A,B,E),times_times(A,D,C))|ti(A,B)=ti(A,D)|ti(A,C)=ti(A,E).
% 0.19/0.44 Following clause subsumed by 308 during input processing: 0 [] {-} -semiri456707255roduct(A)|plus_plus(A,times_times(A,B,C),times_times(A,D,E))=plus_plus(A,times_times(A,B,E),times_times(A,D,C))|ti(A,B)!=ti(A,D).
% 0.19/0.44 Following clause subsumed by 309 during input processing: 0 [] {-} -semiri456707255roduct(A)|plus_plus(A,times_times(A,B,C),times_times(A,D,E))=plus_plus(A,times_times(A,B,E),times_times(A,D,C))|ti(A,C)!=ti(A,E).
% 0.19/0.44 Following clause subsumed by 350 during input processing: 0 [] {-} bit1(A)!=min|ti(int,A)=min.
% 0.19/0.44 Following clause subsumed by 352 during input processing: 0 [] {-} bit1(A)=min|ti(int,A)!=min.
% 0.19/0.44 Following clause subsumed by 354 during input processing: 0 [] {-} pls!=min.
% 0.19/0.44 Following clause subsumed by 356 during input processing: 0 [] {-} bit0(A)!=min.
% 0.19/0.44 Following clause subsumed by 377 during input processing: 0 [] {-} times_times(int,A,B)!=one_one(int)|ti(int,A)=one_one(int)|ti(int,A)=number_number_of(int,min).
% 0.19/0.44 Following clause subsumed by 383 during input processing: 0 [] {-} zcong(A,B,C)| -zcong(B,A,C).
% 0.19/0.44 Following clause subsumed by 434 during input processing: 0 [] {-} -zcong(A,zero_zero(int),B)|dvd_dvd(int,B,A).
% 0.19/0.44 Following clause subsumed by 435 during input processing: 0 [] {-} zcong(A,zero_zero(int),B)| -dvd_dvd(int,B,A).
% 0.19/0.44 Following clause subsumed by 397 during input processing: 0 [] {-} -ord_less_eq(int,zero_zero(int),A)| -ord_less(int,A,B)| -zcong(A,zero_zero(int),B)|ti(int,A)=zero_zero(int).
% 0.19/0.44 Following clause subsumed by 438 during input processing: 0 [] {-} -zprime(A)| -ord_less(int,zero_zero(int),B)|zcong(B,zero_zero(int),A)|zcong(C,zero_zero(int),A)| -zcong(times_times(int,B,C),zero_zero(int),A).
% 0.19/0.44 Following clause subsumed by 438 during input processing: 0 [] {-} -zprime(A)| -ord_less(int,zero_zero(int),B)| -zcong(times_times(int,B,C),zero_zero(int),A)|zcong(B,zero_zero(int),A)|zcong(C,zero_zero(int),A).
% 0.19/0.44 Following clause subsumed by 266 during input processing: 0 [] {-} -zprime(A)| -dvd_dvd(int,A,power_power(int,B,C))| -ord_less(nat,zero_zero(nat),C)|dvd_dvd(int,A,B).
% 0.19/0.49 Following clause subsumed by 455 during input processing: 0 [] {-} -ord_less_eq(real,A,B)|ord_less(real,A,B)|A=B.
% 0.19/0.49 Following clause subsumed by 453 during input processing: 0 [] {-} ord_less_eq(real,A,B)| -ord_less(real,A,B).
% 0.19/0.49 Following clause subsumed by 446 during input processing: 0 [] {-} power_power(nat,A,B)=one_one(nat)|B!=zero_zero(nat).
% 0.19/0.49 Following clause subsumed by 263 during input processing: 0 [] {-} -ord_less(nat,zero_zero(nat),power_power(nat,A,B))|ord_less(nat,zero_zero(nat),A)|B=zero_zero(nat).
% 0.19/0.49 Following clause subsumed by 265 during input processing: 0 [] {-} ord_less(nat,zero_zero(nat),power_power(nat,A,B))| -ord_less(nat,zero_zero(nat),A).
% 0.19/0.49 Following clause subsumed by 264 during input processing: 0 [] {-} ord_less(nat,zero_zero(nat),power_power(nat,A,B))|B!=zero_zero(nat).
% 0.19/0.49 Following clause subsumed by 488 during input processing: 0 [] {-} -power(A)| -semiring_0(A)|B!=zero_zero(nat)|power_power(A,zero_zero(A),B)=one_one(A).
% 0.19/0.49 Following clause subsumed by 523 during input processing: 0 [] {-} -linordered_semidom(A)| -ord_less(A,one_one(A),B)| -ord_less(A,power_power(A,B,C),power_power(A,B,D))|ord_less(nat,C,D).
% 0.19/0.49 Following clause subsumed by 522 during input processing: 0 [] {-} -linordered_semidom(A)| -ord_less(A,one_one(A),B)|ord_less(A,power_power(A,B,C),power_power(A,B,D))| -ord_less(nat,C,D).
% 0.19/0.49 Following clause subsumed by 529 during input processing: 0 [] {-} -linordered_semidom(A)| -ord_less(A,one_one(A),B)| -ord_less_eq(A,power_power(A,B,C),power_power(A,B,D))|ord_less_eq(nat,C,D).
% 0.19/0.49 Following clause subsumed by 542 during input processing: 0 [] {-} dvd_dvd(nat,times_times(nat,A,B),times_times(nat,C,B))| -dvd_dvd(nat,A,C).
% 0.19/0.49 Following clause subsumed by 558 during input processing: 0 [] {-} -no_zero_divisors(A)|times_times(A,B,C)!=zero_zero(A)|ti(A,B)=zero_zero(A)|ti(A,C)=zero_zero(A).
% 0.19/0.49 Following clause subsumed by 560 during input processing: 0 [] {-} -zero_neq_one(A)|zero_zero(A)!=one_one(A).
% 0.19/0.49 Following clause subsumed by 592 during input processing: 0 [] {-} -ordere453448008miring(A)| -ord_less_eq(A,B,zero_zero(A))| -ord_less_eq(A,zero_zero(A),C)|ord_less_eq(A,times_times(A,B,C),zero_zero(A)).
% 0.19/0.49 Following clause subsumed by 189 during input processing: 0 [copy,188,flip.1] {-} bit0(A)!=bit1(B).
% 0.19/0.49 Following clause subsumed by 188 during input processing: 0 [copy,189,flip.1] {-} bit1(A)!=bit0(B).
% 0.19/0.49 286 back subsumes 284.
% 0.19/0.49 287 back subsumes 283.
% 0.19/0.49 381 back subsumes 184.
% 0.19/0.49 436 back subsumes 400.
% 0.19/0.49 488 back subsumes 332.
% 0.19/0.49 494 back subsumes 77.
% 0.19/0.49 508 back subsumes 325.
% 0.19/0.49 509 back subsumes 326.
% 0.19/0.49 510 back subsumes 327.
% 0.19/0.49 518 back subsumes 171.
% 0.19/0.49 521 back subsumes 333.
% 0.19/0.49 Following clause subsumed by 235 during input processing: 0 [copy,607,flip.1] {-} plus_plus(int,plus_plus(int,one_one(int),A),A)!=zero_zero(int).
% 0.19/0.49
% 0.19/0.49 ------------> process sos:
% 0.19/0.49 Following clause subsumed by 747 during input processing: 0 [] {-} ord_less_eq(int,pls,pls).
% 0.19/0.49 Following clause subsumed by 796 during input processing: 0 [demod,750,811] {-} plus_plus(int,pls,A)=plus_plus(int,A,pls).
% 0.19/0.49 Following clause subsumed by 747 during input processing: 0 [demod,798,811,798,811] {-} ord_less_eq(int,plus_plus(int,pls,pls),plus_plus(int,pls,pls)).
% 0.19/0.49 Following clause subsumed by 747 during input processing: 0 [] {-} ord_less_eq(int,min,min).
% 0.19/0.49 747 back subsumes 647.
% 0.19/0.49 747 back subsumes 629.
% 0.19/0.49 Following clause subsumed by 751 during input processing: 0 [copy,751,flip.1] {-} times_times(int,A,B)=times_times(int,B,A).
% 0.19/0.49 752 back subsumes 386.
% 0.19/0.49 Following clause subsumed by 1064 during input processing: 0 [copy,765,flip.1] {-} number_number_of(nat,pls)=number_number_of(nat,pls).
% 0.19/0.49 Following clause subsumed by 1064 during input processing: 0 [copy,788,flip.1] {-} number_number_of(nat,bit1(pls))=number_number_of(nat,bit1(pls)).
% 0.19/0.49 Following clause subsumed by 795 during input processing: 0 [copy,795,flip.1] {-} plus_plus(int,A,plus_plus(int,B,C))=plus_plus(int,B,plus_plus(int,A,C)).
% 0.19/0.49 Following clause subsumed by 796 during input processing: 0 [copy,796,flip.1] {-} plus_plus(int,A,B)=plus_plus(int,B,A).
% 0.19/0.49 Following clause subsumed by 1064 during input processing: 0 [copy,943,flip.1] {-} minus_minus(int,min,plus_plus(int,A,A))=minus_minus(int,min,plus_plus(int,A,A)).
% 0.19/0.49 Following clause subsumed by 967 during input processing: 0 [copy,967,flip.1] {-} times_times(real,A,B)=times_times(real,B,A).
% 0.19/0.49 Following clause subsumed by 1064 during input processing: 0 [copy,1064,flip.1] {-} A=A.
% 0.19/0.49 1064 back subsumes 943.
% 0.19/0.49 1064 back subsumes 788.
% 0.19/0.49 1064 back subsumes 765.
% 0.19/0.49 1064 back subsumes 671.
% 0.19/0.49 1064 back subsumes 659.
% 0.19/0.49 1228 back subsumes 1087.
% 0.19/0.49 Following clause subsumed by 1352 during input processing: 0 [copy,1351,flip.1] {-} bit1(A)!=plus_plus(int,B,B).
% 0.19/0.49 Following clause subsumed by 1351 during input processing: 0 [copy,1352,flip.1] {-} plus_plus(int,A,A)!=bit1(B).
% 0.19/0.49 Following clause subsumed by 826 during input processing: 0 [copy,1386,flip.1] {-} plus_plus(int,A,plus_plus(int,A,bit1(B)))=plus_plus(int,bit1(A),plus_plus(int,B,B)).
% 0.19/0.49 Following clause subsumed by 1429 during input processing: 0 [copy,1387,flip.1] {-} bit1(A)=plus_plus(int,bit1(pls),plus_plus(int,A,A)).
% 0.19/0.49 Following clause subsumed by 1443 during input processing: 0 [copy,1390,flip.1] {-} times_times(int,A,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))))=power_power(int,A,number_number_of(nat,bit1(bit1(pls)))).
% 0.19/0.49 Following clause subsumed by 865 during input processing: 0 [copy,1391,flip.1] {-} power_power(int,power_power(int,A,B),C)=power_power(int,A,times_times(nat,B,C)).
% 0.19/0.49 Following clause subsumed by 1437 during input processing: 0 [copy,1392,flip.1] {-} power_power(int,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls))))=power_power(int,A,number_number_of(nat,plus_plus(int,bit1(pls),plus_plus(int,bit1(pls),plus_plus(int,bit1(pls),bit1(pls)))))).
% 0.19/0.49 Following clause subsumed by 1433 during input processing: 0 [copy,1421,flip.1] {-} minus_minus(int,plus_plus(int,times_times(int,A,A),times_times(int,B,A)),plus_plus(int,times_times(int,A,B),times_times(int,B,B)))=minus_minus(int,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),power_power(int,B,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls))))).
% 0.19/0.49 Following clause subsumed by 1432 during input processing: 0 [copy,1424,flip.1] {-} minus_minus(nat,power_power(nat,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),power_power(nat,B,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))))=times_times(nat,plus_plus(nat,A,B),minus_minus(nat,A,B)).
% 0.19/0.49 Following clause subsumed by 1387 during input processing: 0 [copy,1429,flip.1] {-} plus_plus(int,bit1(pls),plus_plus(int,A,A))=bit1(A).
% 0.19/0.49 Following clause subsumed by 1424 during input processing: 0 [copy,1432,flip.1] {-} times_times(nat,plus_plus(nat,A,B),minus_minus(nat,A,B))=minus_minus(nat,power_power(nat,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),power_power(nat,B,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls))))).
% 0.19/0.49 Following clause subsumed by 1421 during input processing: 0 [copy,1433,flip.1] {-} minus_minus(int,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),power_power(int,B,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))))=minus_minus(int,plus_plus(int,times_times(int,A,A),times_times(int,B,A)),plus_plus(int,times_times(int,A,B),times_times(int,B,B))).
% 0.19/0.49 Following clause subsumed by 1392 during input processing: 0 [copy,1437,flip.1] {-} power_power(int,A,number_number_of(nat,plus_plus(int,bit1(pls),plus_plus(int,bit1(pls),plus_plus(int,bit1(pls),bit1(pls))))))=power_power(int,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))).
% 0.19/0.49 Following clause subsumed by 1390 during input processing: 0 [copy,1443,flip.1] {-} power_power(int,A,number_number_of(nat,bit1(bit1(pls))))=times_times(int,A,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls))))).
% 0.19/0.49 Following clause subsumed by 1309 during input processing: 0 [copy,1446,flip.1] {-} plus_plus(int,A,plus_plus(int,B,plus_plus(int,A,B)))=plus_plus(int,A,plus_plus(int,A,plus_plus(int,B,B))).
% 0.19/0.49 Following clause subsumed by 1388 during input processing: 0 [copy,1447,flip.1] {-} plus_plus(int,power_power(int,A,number_number_of(nat,bit1(bit1(pls)))),minus_minus(int,plus_plus(int,times_times(int,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),B),minus_minus(int,plus_plus(int,times_times(int,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),B),plus_plus(int,times_times(int,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),B),minus_minus(int,plus_plus(int,times_times(int,A,power_power(int,B,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls))))),minus_minus(int,plus_plus(int,times_times(int,A,power_power(int,B,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls))))),plus_plus(int,times_times(int,A,power_power(int,B,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls))))),minus_minus(int,power_power(int,B,number_number_of(nat,bit1(bit1(pls)))),pls))),pls)),pls))),pls)),pls))=power_power(int,plus_plus(int,A,B),number_number_of(nat,bit1(bit1(pls)))).
% 0.19/0.49 Following clause subsumed by 1389 during input processing: 0 [copy,1448,flip.1] {-} plus_plus(int,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),minus_minus(int,plus_plus(int,times_times(int,A,B),minus_minus(int,plus_plus(int,times_times(int,A,B),minus_minus(int,power_power(int,B,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),pls)),pls)),pls))=power_power(int,plus_plus(int,A,B),plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))).
% 0.19/0.49 Following clause subsumed by 1422 during input processing: 0 [copy,1453,flip.1] {-} plus_plus(int,minus_minus(int,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),minus_minus(int,plus_plus(int,times_times(int,A,B),minus_minus(int,times_times(int,A,B),pls)),pls)),power_power(int,B,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))))=power_power(int,minus_minus(int,A,B),plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))).
% 0.19/0.49 Following clause subsumed by 1423 during input processing: 0 [copy,1454,flip.1] {-} minus_minus(int,plus_plus(int,minus_minus(int,power_power(int,A,number_number_of(nat,bit1(bit1(pls)))),minus_minus(int,plus_plus(int,times_times(int,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),B),plus_plus(int,times_times(int,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),B),times_times(int,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),B))),pls)),minus_minus(int,plus_plus(int,times_times(int,A,power_power(int,B,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls))))),plus_plus(int,times_times(int,A,power_power(int,B,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls))))),times_times(int,A,power_power(int,B,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls))))))),pls)),power_power(int,B,number_number_of(nat,bit1(bit1(pls)))))=power_power(int,minus_minus(int,A,B),number_number_of(nat,bit1(bit1(pls)))).
% 0.19/0.49 1459 back subsumes 1357.
% 0.19/0.49
% 0.19/0.49 ======= end of input processing =======
% 0.75/0.98
% 0.75/0.98 Stopped by limit on insertions
% 0.75/0.98
% 0.75/0.98
% 0.75/0.98 Failed to model usable list: disabling FINDER
% 0.75/0.98
% 0.75/0.98
% 0.75/0.98
% 0.75/0.98 -------------- Softie stats --------------
% 0.75/0.98
% 0.75/0.98 UPDATE_STOP: 300
% 0.75/0.98 SFINDER_TIME_LIMIT: 2
% 0.75/0.98 SHORT_CLAUSE_CUTOFF: 4
% 0.75/0.98 number of clauses in intial UL: 348
% 0.75/0.98 number of clauses initially in problem: 889
% 0.75/0.98 percentage of clauses intially in UL: 39
% 0.75/0.98 percentage of distinct symbols occuring in initial UL: 71
% 0.75/0.98 percent of all initial clauses that are short: 100
% 0.75/0.98 absolute distinct symbol count: 71
% 0.75/0.98 distinct predicate count: 41
% 0.75/0.98 distinct function count: 16
% 0.75/0.98 distinct constant count: 14
% 0.75/0.98
% 0.75/0.98 ---------- no more Softie stats ----------
% 0.75/0.98
% 0.75/0.98
% 0.75/0.98
% 0.75/0.98 =========== start of search ===========
% 0.75/0.98
% 0.75/0.98
% 0.75/0.98 Changing weight limit from 60 to 101.
% 0.75/0.98
% 0.75/0.98 Resetting weight limit to 101 after 5 givens.
% 0.75/0.98
% 0.75/0.99 minus_minus(int,minus_minus(int,times_times(int,A,B),pls),minus_minus(int,times_times(int,A,pls),pls))=minus_minus(int,times_times(int,A,B),pls).
% 0.75/0.99
% 0.75/0.99 ------------- memory usage ------------
% 0.75/0.99 129 mallocs of 32700 bytes each, 4119.4 K.
% 0.75/0.99 type (bytes each) gets frees in use avail bytes
% 0.75/0.99 sym_ent ( 304) 249 0 249 0 73.9 K
% 0.75/0.99 term ( 32) 181744 162981 18763 20 587.0 K
% 0.75/0.99 rel ( 40) 157012 131098 25914 14 1012.8 K
% 0.75/0.99 term_ptr ( 16) 88050 27966 60084 21 939.1 K
% 0.75/0.99 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 0.75/0.99 fpa_head ( 24) 11163 2835 8328 4 195.3 K
% 0.75/0.99 fpa_tree ( 56) 13764 13764 0 83 4.5 K
% 0.75/0.99 context (1288) 14152 14152 0 7 8.8 K
% 0.75/0.99 trail ( 24) 39478 39478 0 7 0.2 K
% 0.75/0.99 imd_tree ( 32) 632 284 348 59 12.7 K
% 0.75/0.99 imd_pos (4024) 12507 12507 0 4 15.7 K
% 0.75/0.99 is_tree ( 24) 13351 4092 9259 8 217.2 K
% 0.75/0.99 is_pos (2424) 113571 113571 0 16 37.9 K
% 0.75/0.99 fsub_pos ( 16) 9607 9607 0 1 0.0 K
% 0.75/0.99 literal ( 32) 10318 3998 6320 2 197.6 K
% 0.75/0.99 clause ( 88) 3863 1185 2678 1 230.2 K
% 0.75/0.99 list ( 272) 661 654 7 2 2.4 K
% 0.75/0.99 clash_nd ( 80) 192 192 0 5 0.4 K
% 0.75/0.99 clause_ptr ( 16) 2677 672 2005 4 31.4 K
% 0.75/0.99 int_ptr ( 16) 16879 5376 11503 5 179.8 K
% 0.75/0.99 ci_ptr ( 24) 0 0 0 0 0.0 K
% 0.75/0.99 link_node ( 120) 0 0 0 0 0.0 K
% 0.75/0.99 ans_lit_node( 24) 0 0 0 0 0.0 K
% 0.75/0.99 formula_box( 168) 0 0 0 0 0.0 K
% 0.75/0.99 formula( 40) 5620 5620 0 3609 141.0 K
% 0.75/0.99 formula_ptr( 16) 651 651 0 651 10.2 K
% 0.75/0.99 cl_attribute( 24) 0 0 0 0 0.0 K
% 0.75/0.99
% 0.75/0.99 ********** ABNORMAL END **********
% 0.75/0.99
% 0.75/0.99 ********** is_delete, can't find end.
% 0.75/0.99 new demod time 0.00
% 0.75/0.99 post_process time 0.00
% 0.75/0.99 back demod time 0.00
% 0.75/0.99 back subsume 0.00
% 0.75/0.99 factor time 0.00
% 0.75/0.99 FINDER time 0.00
% 0.75/0.99 unindex time 0.00
% 0.75/0.99
% 0.75/0.99 Forward subsumption counts, subsumer:number_subsumed.
% 0.75/0.99 1:0 2:0 3:0 4:0 5:0 6:0 7:0 8:0 9:0 10:0
% 0.75/0.99 11:0 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:0
% 0.75/0.99 21:0 22:0 23:0 24:0 25:0 26:0 27:0 28:0 29:0 30:0
% 0.75/0.99 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 0.75/0.99 41:0 42:0 43:0 44:0 45:0 46:0 47:0 48:0 49:0 50:0
% 0.75/0.99 51:0 52:0 53:0 54:0 55:0 56:0 57:0 58:0 59:0 60:0
% 0.75/0.99 61:0 62:0 63:0 64:0 65:0 66:0 67:0 68:0 69:0 70:0
% 0.75/0.99 71:0 72:0 73:0 74:0 75:0 76:0 77:0 78:0 79:0 80:0
% 0.75/0.99 81:0 82:0 83:0 84:0 85:0 86:0 87:1 88:1 89:1 90:1
% 0.75/0.99 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 0.75/0.99 All others: 508.
% 0.75/0.99
% 0.75/0.99 ********** ABNORMAL END **********
% 0.75/0.99
% 0.75/0.99 ********** is_delete, can't find end.
%------------------------------------------------------------------------------