TSTP Solution File: NUM926+6 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM926+6 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.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:19 EDT 2022
% Result : Unknown 1.07s 1.30s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM926+6 : TPTP v8.1.0. Released v5.3.0.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n015.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 : Thu Jul 7 17:37:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.43 ----- Otter 3.2, August 2001 -----
% 0.20/0.43 The process was started by sandbox on n015.cluster.edu,
% 0.20/0.43 Thu Jul 7 17:37:35 2022
% 0.20/0.43 The command was "./sos". The process ID is 25285.
% 0.20/0.43
% 0.20/0.43 set(prolog_style_variables).
% 0.20/0.43 set(auto).
% 0.20/0.43 dependent: set(auto1).
% 0.20/0.43 dependent: set(process_input).
% 0.20/0.43 dependent: clear(print_kept).
% 0.20/0.43 dependent: clear(print_new_demod).
% 0.20/0.43 dependent: clear(print_back_demod).
% 0.20/0.43 dependent: clear(print_back_sub).
% 0.20/0.43 dependent: set(control_memory).
% 0.20/0.43 dependent: assign(max_mem, 12000).
% 0.20/0.43 dependent: assign(pick_given_ratio, 4).
% 0.20/0.43 dependent: assign(stats_level, 1).
% 0.20/0.43 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.43 dependent: assign(sos_limit, 5000).
% 0.20/0.43 dependent: assign(max_weight, 60).
% 0.20/0.43 clear(print_given).
% 0.20/0.43
% 0.20/0.43 formula_list(usable).
% 0.20/0.43
% 0.20/0.43 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.20/0.43
% 0.20/0.43 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.43 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.43 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.43 clauses in usable.
% 0.20/0.43
% 0.20/0.43 dependent: set(knuth_bendix).
% 0.20/0.43 dependent: set(para_from).
% 0.20/0.43 dependent: set(para_into).
% 0.20/0.43 dependent: clear(para_from_right).
% 0.20/0.43 dependent: clear(para_into_right).
% 0.20/0.43 dependent: set(para_from_vars).
% 0.20/0.43 dependent: set(eq_units_both_ways).
% 0.20/0.43 dependent: set(dynamic_demod_all).
% 0.20/0.43 dependent: set(dynamic_demod).
% 0.20/0.43 dependent: set(order_eq).
% 0.20/0.43 dependent: set(back_demod).
% 0.20/0.43 dependent: set(lrpo).
% 0.20/0.43 dependent: set(hyper_res).
% 0.20/0.43 dependent: set(unit_deletion).
% 0.20/0.43 dependent: set(factor).
% 0.20/0.43
% 0.20/0.43 ------------> process usable:
% 0.20/0.43 Following clause subsumed by 90 during input processing: 0 [] {-} -ord_less(int,bit1(A),bit1(B))|ord_less(int,A,B).
% 0.20/0.43 Following clause subsumed by 91 during input processing: 0 [] {-} ord_less(int,bit1(A),bit1(B))| -ord_less(int,A,B).
% 0.20/0.43 Following clause subsumed by 92 during input processing: 0 [] {-} -ord_less_eq(int,bit1(A),bit1(B))|ord_less_eq(int,A,B).
% 0.20/0.43 Following clause subsumed by 93 during input processing: 0 [] {-} ord_less_eq(int,bit1(A),bit1(B))| -ord_less_eq(int,A,B).
% 0.20/0.43 Following clause subsumed by 95 during input processing: 0 [] {-} -ord_less(int,bit0(A),bit0(B))|ord_less(int,A,B).
% 0.20/0.43 Following clause subsumed by 96 during input processing: 0 [] {-} ord_less(int,bit0(A),bit0(B))| -ord_less(int,A,B).
% 0.20/0.43 Following clause subsumed by 97 during input processing: 0 [] {-} -ord_less_eq(int,bit0(A),bit0(B))|ord_less_eq(int,A,B).
% 0.20/0.43 Following clause subsumed by 98 during input processing: 0 [] {-} ord_less_eq(int,bit0(A),bit0(B))| -ord_less_eq(int,A,B).
% 0.20/0.43 Following clause subsumed by 111 during input processing: 0 [] {-} -ord_less_eq(int,bit1(A),bit0(B))|ord_less(int,A,B).
% 0.20/0.43 Following clause subsumed by 112 during input processing: 0 [] {-} ord_less_eq(int,bit1(A),bit0(B))| -ord_less(int,A,B).
% 0.20/0.43 Following clause subsumed by 113 during input processing: 0 [] {-} -ord_less(int,bit0(A),bit1(B))|ord_less_eq(int,A,B).
% 0.20/0.43 Following clause subsumed by 114 during input processing: 0 [] {-} ord_less(int,bit0(A),bit1(B))| -ord_less_eq(int,A,B).
% 0.20/0.43 Following clause subsumed by 115 during input processing: 0 [] {-} ord_less_eq(int,plus_plus(int,A,one_one(int)),B)| -ord_less(int,A,B).
% 0.20/0.43 Following clause subsumed by 124 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.20/0.43 Following clause subsumed by 129 during input processing: 0 [flip.2] {-} -comm_semiring_1(A)|plus_plus(A,plus_plus(A,B,C),D)=plus_plus(A,B,plus_plus(A,C,D)).
% 0.20/0.43 Following clause subsumed by 142 during input processing: 0 [] {-} -ord_less(int,bit1(A),bit0(B))|ord_less(int,A,B).
% 0.20/0.43 Following clause subsumed by 143 during input processing: 0 [] {-} ord_less(int,bit1(A),bit0(B))| -ord_less(int,A,B).
% 0.20/0.43 Following clause subsumed by 150 during input processing: 0 [] {-} -ord_less_eq(int,bit0(A),bit1(B))|ord_less_eq(int,A,B).
% 0.20/0.43 Following clause subsumed by 151 during input processing: 0 [] {-} ord_less_eq(int,bit0(A),bit1(B))| -ord_less_eq(int,A,B).
% 0.20/0.44 Following clause subsumed by 172 during input processing: 0 [] {-} -comm_semiring_1(A)|times_times(A,plus_plus(A,B,C),D)=plus_plus(A,times_times(A,B,D),times_times(A,C,D)).
% 0.20/0.44 Following clause subsumed by 168 during input processing: 0 [] {-} -semiri456707255roduct(A)|ti(A,B)=ti(A,C)|ti(A,D)=ti(A,E)|plus_plus(A,times_times(A,B,D),times_times(A,C,E))!=plus_plus(A,times_times(A,B,E),times_times(A,C,D)).
% 0.20/0.44 Following clause subsumed by 169 during input processing: 0 [] {-} -semiri456707255roduct(A)|ti(A,B)!=ti(A,C)|plus_plus(A,times_times(A,B,D),times_times(A,C,E))=plus_plus(A,times_times(A,B,E),times_times(A,C,D)).
% 0.20/0.44 Following clause subsumed by 170 during input processing: 0 [] {-} -semiri456707255roduct(A)|ti(A,B)!=ti(A,C)|plus_plus(A,times_times(A,D,B),times_times(A,E,C))=plus_plus(A,times_times(A,D,C),times_times(A,E,B)).
% 0.20/0.44 Following clause subsumed by 178 during input processing: 0 [flip.1] {-} bit1(A)!=pls.
% 0.20/0.44 Following clause subsumed by 181 during input processing: 0 [flip.1,flip.2] {-} bit0(A)!=pls|ti(int,A)=pls.
% 0.20/0.44 Following clause subsumed by 182 during input processing: 0 [flip.1,flip.2] {-} bit0(A)=pls|ti(int,A)!=pls.
% 0.20/0.44 Following clause subsumed by 202 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.20/0.44 Following clause subsumed by 206 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.20/0.44 Following clause subsumed by 213 during input processing: 0 [] {-} -number_ring(A)|one_one(A)=number_number_of(A,bit1(pls)).
% 0.20/0.44 Following clause subsumed by 224 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.20/0.44 Following clause subsumed by 270 during input processing: 0 [flip.2] {-} -number_ring(A)|zero_zero(A)=number_number_of(A,pls).
% 0.20/0.44 Following clause subsumed by 238 during input processing: 0 [] {-} -ring_11004092258visors(A)|power_power(A,B,number_number_of(nat,bit0(bit1(pls))))!=zero_zero(A)|ti(A,B)=zero_zero(A).
% 0.20/0.44 Following clause subsumed by 260 during input processing: 0 [] {-} -linordered_semidom(A)| -ord_less(A,power_power(A,B,number_number_of(nat,bit0(bit1(pls)))),power_power(A,C,number_number_of(nat,bit0(bit1(pls)))))| -ord_less_eq(A,zero_zero(A),C)|ord_less(A,B,C).
% 0.20/0.44 Following clause subsumed by 347 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.20/0.44 Following clause subsumed by 348 during input processing: 0 [] {-} -linordered_semidom(A)| -ord_less(nat,B,C)| -ord_less(A,one_one(A),D)|ord_less(A,power_power(A,D,B),power_power(A,D,C)).
% 0.20/0.44 Following clause subsumed by 358 during input processing: 0 [] {-} -ord_less(nat,zero_zero(nat),power_power(nat,A,B))|B=zero_zero(nat)|ord_less(nat,zero_zero(nat),A).
% 0.20/0.44 Following clause subsumed by 360 during input processing: 0 [] {-} ord_less(nat,zero_zero(nat),power_power(nat,A,B))|B!=zero_zero(nat).
% 0.20/0.44 Following clause subsumed by 359 during input processing: 0 [] {-} ord_less(nat,zero_zero(nat),power_power(nat,A,B))| -ord_less(nat,zero_zero(nat),A).
% 0.20/0.44 Following clause subsumed by 358 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.20/0.44 Following clause subsumed by 360 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.20/0.44 Following clause subsumed by 359 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.20/0.44 Following clause subsumed by 362 during input processing: 0 [flip.1,flip.2] {-} bit1(A)!=min|ti(int,A)=min.
% 0.20/0.44 Following clause subsumed by 363 during input processing: 0 [flip.1,flip.2] {-} bit1(A)=min|ti(int,A)!=min.
% 0.20/0.44 Following clause subsumed by 364 during input processing: 0 [flip.1] {-} pls!=min.
% 0.20/0.44 Following clause subsumed by 365 during input processing: 0 [flip.1] {-} bit0(A)!=min.
% 0.20/0.45 Following clause subsumed by 390 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.20/0.45 Following clause subsumed by 405 during input processing: 0 [] {-} zcong(A,B,C)| -zcong(B,A,C).
% 0.20/0.45 Following clause subsumed by 227 during input processing: 0 [] {-} -power(A)| -mult_zero(A)| -no_zero_divisors(A)| -zero_neq_one(A)|power_power(A,B,number_number_of(nat,C))!=zero_zero(A)|ti(A,B)=zero_zero(A).
% 0.20/0.45 Following clause subsumed by 228 during input processing: 0 [] {-} -power(A)| -mult_zero(A)| -no_zero_divisors(A)| -zero_neq_one(A)|power_power(A,B,number_number_of(nat,C))!=zero_zero(A)|number_number_of(nat,C)!=zero_zero(nat).
% 0.20/0.45 Following clause subsumed by 229 during input processing: 0 [] {-} -power(A)| -mult_zero(A)| -no_zero_divisors(A)| -zero_neq_one(A)|power_power(A,B,number_number_of(nat,C))=zero_zero(A)|ti(A,B)!=zero_zero(A)|number_number_of(nat,C)=zero_zero(nat).
% 0.20/0.45 Following clause subsumed by 239 during input processing: 0 [] {-} -power(A)| -semiring_0(A)|number_number_of(nat,B)!=zero_zero(nat)|power_power(A,zero_zero(A),number_number_of(nat,B))=one_one(A).
% 0.20/0.45 Following clause subsumed by 240 during input processing: 0 [] {-} -power(A)| -semiring_0(A)|number_number_of(nat,B)=zero_zero(nat)|power_power(A,zero_zero(A),number_number_of(nat,B))=zero_zero(A).
% 0.20/0.45 Following clause subsumed by 458 during input processing: 0 [] {-} dvd_dvd(nat,times_times(nat,A,B),times_times(nat,C,B))| -dvd_dvd(nat,A,C).
% 0.20/0.45 Following clause subsumed by 481 during input processing: 0 [] {-} -zcong(A,zero_zero(int),B)|dvd_dvd(int,B,A).
% 0.20/0.45 Following clause subsumed by 482 during input processing: 0 [] {-} zcong(A,zero_zero(int),B)| -dvd_dvd(int,B,A).
% 0.20/0.45 Following clause subsumed by 455 during input processing: 0 [] {-} power_power(nat,A,B)=one_one(nat)|B!=zero_zero(nat).
% 0.20/0.45 Following clause subsumed by 422 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.20/0.45 Following clause subsumed by 487 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.20/0.45 Following clause subsumed by 487 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.20/0.45 Following clause subsumed by 269 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.20/0.45 Following clause subsumed by 500 during input processing: 0 [] {-} -ord_less_eq(real,A,B)|ord_less(real,A,B)|A=B.
% 0.20/0.45 Following clause subsumed by 498 during input processing: 0 [] {-} ord_less_eq(real,A,B)| -ord_less(real,A,B).
% 0.20/0.45 Following clause subsumed by 552 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.20/0.45 Following clause subsumed by 554 during input processing: 0 [] {-} -zero_neq_one(A)|zero_zero(A)!=one_one(A).
% 0.20/0.45 Following clause subsumed by 585 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.20/0.45 70 back subsumes 67.
% 0.20/0.45 124 back subsumes 122.
% 0.20/0.45 125 back subsumes 121.
% 0.20/0.45 Following clause subsumed by 180 during input processing: 0 [copy,179,flip.1] {-} bit0(A)!=bit1(B).
% 0.20/0.45 Following clause subsumed by 179 during input processing: 0 [copy,180,flip.1] {-} bit1(A)!=bit0(B).
% 0.20/0.45 394 back subsumes 304.
% 0.20/0.45 485 back subsumes 423.
% 0.20/0.45 532 back subsumes 239.
% 0.20/0.45 Following clause subsumed by 280 during input processing: 0 [copy,604,flip.1] {-} plus_plus(int,plus_plus(int,one_one(int),A),A)!=zero_zero(int).
% 0.20/0.45 Following clause subsumed by 586 during input processing: 0 [copy,682,flip.1] {-} plus_plus(int,power_power(int,A,number_number_of(nat,bit0(bit1(pls)))),power_power(int,B,number_number_of(nat,bit0(bit1(pls)))))!=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)).
% 0.20/0.46
% 0.20/0.49 ------------> process sos:
% 0.20/0.49 Following clause subsumed by 749 during input processing: 0 [] {-} ord_less_eq(int,pls,pls).
% 0.20/0.49 Following clause subsumed by 779 during input processing: 0 [demod,775,789] {-} plus_plus(int,pls,A)=plus_plus(int,A,pls).
% 0.20/0.49 Following clause subsumed by 779 during input processing: 0 [demod,862,775,789] {-} plus_plus(int,pls,A)=plus_plus(int,A,pls).
% 0.20/0.49 Following clause subsumed by 749 during input processing: 0 [] {-} ord_less_eq(int,min,min).
% 0.20/0.49 Following clause subsumed by 880 during input processing: 0 [demod,862] {-} ord_less(int,min,pls).
% 0.20/0.49 Following clause subsumed by 749 during input processing: 0 [demod,862,862] {-} ord_less_eq(int,pls,pls).
% 0.20/0.49 749 back subsumes 638.
% 0.20/0.49 749 back subsumes 617.
% 0.20/0.49 750 back subsumes 410.
% 0.20/0.49 Following clause subsumed by 1058 during input processing: 0 [copy,768,flip.1] {-} number_number_of(nat,bit1(pls))=number_number_of(nat,bit1(pls)).
% 0.20/0.49 Following clause subsumed by 772 during input processing: 0 [copy,772,flip.1] {-} times_times(int,A,B)=times_times(int,B,A).
% 0.20/0.49 Following clause subsumed by 778 during input processing: 0 [copy,778,flip.1] {-} plus_plus(int,A,plus_plus(int,B,C))=plus_plus(int,B,plus_plus(int,A,C)).
% 0.20/0.49 Following clause subsumed by 779 during input processing: 0 [copy,779,flip.1] {-} plus_plus(int,A,B)=plus_plus(int,B,A).
% 0.20/0.49 Following clause subsumed by 1058 during input processing: 0 [copy,864,flip.1,demod,906,906] {-} minus_minus(int,A,pls)=minus_minus(int,A,pls).
% 0.20/0.49 Following clause subsumed by 1058 during input processing: 0 [copy,886,flip.1] {-} number_number_of(nat,pls)=number_number_of(nat,pls).
% 0.20/0.49 Following clause subsumed by 1058 during input processing: 0 [copy,933,flip.1] {-} minus_minus(int,min,plus_plus(int,A,A))=minus_minus(int,min,plus_plus(int,A,A)).
% 0.20/0.49 Following clause subsumed by 957 during input processing: 0 [copy,957,flip.1] {-} times_times(real,A,B)=times_times(real,B,A).
% 0.20/0.49 Following clause subsumed by 1058 during input processing: 0 [copy,1058,flip.1] {-} A=A.
% 0.20/0.49 1058 back subsumes 933.
% 0.20/0.49 1058 back subsumes 886.
% 0.20/0.49 1058 back subsumes 768.
% 0.20/0.49 1058 back subsumes 665.
% 0.20/0.49 1058 back subsumes 660.
% 0.20/0.49 1058 back subsumes 629.
% 0.20/0.49 Following clause subsumed by 1206 during input processing: 0 [copy,1061,flip.1,demod,1072] {-} 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.20/0.49 Following clause subsumed by 752 during input processing: 0 [copy,1062,flip.1] {-} power_power(int,power_power(int,A,B),C)=power_power(int,A,times_times(nat,B,C)).
% 0.20/0.49 Following clause subsumed by 1420 during input processing: 0 [copy,1206,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.20/0.49 Following clause subsumed by 1256 during input processing: 0 [copy,1255,flip.1] {-} bit1(A)!=plus_plus(int,B,B).
% 0.20/0.49 Following clause subsumed by 1255 during input processing: 0 [copy,1256,flip.1] {-} plus_plus(int,A,A)!=bit1(B).
% 0.20/0.49 Following clause subsumed by 817 during input processing: 0 [copy,1281,flip.1] {-} plus_plus(int,A,plus_plus(int,A,bit1(B)))=plus_plus(int,bit1(A),plus_plus(int,B,B)).
% 0.20/0.49 Following clause subsumed by 1283 during input processing: 0 [copy,1282,flip.1] {-} bit1(A)=plus_plus(int,bit1(pls),plus_plus(int,A,A)).
% 0.20/0.49 Following clause subsumed by 1282 during input processing: 0 [copy,1283,flip.1] {-} plus_plus(int,bit1(pls),plus_plus(int,A,A))=bit1(A).
% 0.20/0.49 Following clause subsumed by 1426 during input processing: 0 [copy,1307,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.20/0.49 1322 back subsumes 1122.
% 0.20/0.49 Following clause subsumed by 1422 during input processing: 0 [copy,1408,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.20/0.49 Following clause subsumed by 1421 during input processing: 0 [copy,1411,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.20/0.49 1416 back subsumes 1243.
% 0.20/0.49 Following clause subsumed by 1206 during input processing: 0 [copy,1420,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.20/0.49 Following clause subsumed by 1411 during input processing: 0 [copy,1421,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.20/0.49 Following clause subsumed by 1408 during input processing: 0 [copy,1422,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.20/0.49 Following clause subsumed by 1307 during input processing: 0 [copy,1426,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.20/0.49 Following clause subsumed by 1201 during input processing: 0 [copy,1433,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.20/0.49 Following clause subsumed by 1409 during input processing: 0 [copy,1437,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,minus_minus(int,plus_plus(int,times_times(int,A,B),minus_minus(int,times_times(int,A,B),pls)),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.20/0.49 Following clause subsumed by 1410 during input processing: 0 [copy,1438,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,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),pls)),minus_minus(int,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),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.20/0.49 Following clause subsumed by 1412 during input processing: 0 [copy,1439,flip.1] {-} power_power(int,plus_plus(int,A,B),plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls))))=plus_plus(int,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),plus_plus(int,minus_minus(int,minus_minus(int,plus_plus(int,times_times(int,A,B),minus_minus(int,times_times(int,A,B),pls)),pls),pls),power_power(int,B,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))))).
% 0.20/0.49 Following clause subsumed by 1413 during input processing: 0 [copy,1440,flip.1] {-} power_power(int,plus_plus(int,A,B),number_number_of(nat,bit1(bit1(pls))))=plus_plus(int,power_power(int,A,number_number_of(nat,bit1(bit1(pls)))),plus_plus(int,minus_minus(int,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),pls),plus_plus(int,minus_minus(int,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),pls),power_power(int,B,number_number_of(nat,bit1(bit1(pls))))))).
% 0.20/0.49
% 0.20/0.49 ======= end of input processing =======
% 1.07/1.28
% 1.07/1.28 Stopped by limit on insertions
% 1.07/1.28
% 1.07/1.28
% 1.07/1.28 Failed to model usable list: disabling FINDER
% 1.07/1.28
% 1.07/1.28
% 1.07/1.28
% 1.07/1.28 -------------- Softie stats --------------
% 1.07/1.28
% 1.07/1.28 UPDATE_STOP: 300
% 1.07/1.28 SFINDER_TIME_LIMIT: 2
% 1.07/1.28 SHORT_CLAUSE_CUTOFF: 4
% 1.07/1.28 number of clauses in intial UL: 349
% 1.07/1.28 number of clauses initially in problem: 888
% 1.07/1.28 percentage of clauses intially in UL: 39
% 1.07/1.28 percentage of distinct symbols occuring in initial UL: 68
% 1.07/1.28 percent of all initial clauses that are short: 100
% 1.07/1.28 absolute distinct symbol count: 73
% 1.07/1.28 distinct predicate count: 40
% 1.07/1.28 distinct function count: 20
% 1.07/1.28 distinct constant count: 13
% 1.07/1.28
% 1.07/1.28 ---------- no more Softie stats ----------
% 1.07/1.28
% 1.07/1.28
% 1.07/1.28
% 1.07/1.28 =========== start of search ===========
% 1.07/1.28
% 1.07/1.28
% 1.07/1.28 Changing weight limit from 60 to 101.
% 1.07/1.28
% 1.07/1.28 Resetting weight limit to 101 after 5 givens.
% 1.07/1.28
% 1.07/1.29 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).
% 1.07/1.29
% 1.07/1.29 ------------- memory usage ------------
% 1.07/1.29 129 mallocs of 32700 bytes each, 4119.4 K.
% 1.07/1.29 type (bytes each) gets frees in use avail bytes
% 1.07/1.29 sym_ent ( 304) 256 0 256 0 76.0 K
% 1.07/1.29 term ( 32) 181172 162247 18925 72 593.7 K
% 1.07/1.29 rel ( 40) 156403 130167 26236 39 1026.4 K
% 1.07/1.29 term_ptr ( 16) 87869 28147 59722 83 934.5 K
% 1.07/1.29 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 1.07/1.29 fpa_head ( 24) 11359 3019 8340 7 195.6 K
% 1.07/1.29 fpa_tree ( 56) 13808 13808 0 71 3.9 K
% 1.07/1.29 context (1288) 14500 14500 0 7 8.8 K
% 1.07/1.29 trail ( 24) 40260 40260 0 7 0.2 K
% 1.07/1.29 imd_tree ( 32) 622 261 361 74 13.6 K
% 1.07/1.29 imd_pos (4024) 12132 12132 0 4 15.7 K
% 1.07/1.29 is_tree ( 24) 13337 4244 9093 34 213.9 K
% 1.07/1.29 is_pos (2424) 118480 118480 0 16 37.9 K
% 1.07/1.29 fsub_pos ( 16) 9874 9874 0 1 0.0 K
% 1.07/1.29 literal ( 32) 10520 4181 6339 0 198.1 K
% 1.07/1.29 clause ( 88) 3965 1264 2701 0 232.1 K
% 1.07/1.29 list ( 272) 664 657 7 2 2.4 K
% 1.07/1.29 clash_nd ( 80) 192 192 0 5 0.4 K
% 1.07/1.29 clause_ptr ( 16) 2702 683 2019 4 31.6 K
% 1.07/1.29 int_ptr ( 16) 15948 5438 10510 1 164.2 K
% 1.07/1.29 ci_ptr ( 24) 0 0 0 0 0.0 K
% 1.07/1.29 link_node ( 120) 0 0 0 0 0.0 K
% 1.07/1.29 ans_lit_node( 24) 0 0 0 0 0.0 K
% 1.07/1.29 formula_box( 168) 0 0 0 0 0.0 K
% 1.07/1.29 formula( 40) 5636 5636 0 3622 141.5 K
% 1.07/1.29 formula_ptr( 16) 654 654 0 654 10.2 K
% 1.07/1.29 cl_attribute( 24) 0 0 0 0 0.0 K
% 1.07/1.29
% 1.07/1.29 ********** ABNORMAL END **********
% 1.07/1.29
% 1.07/1.29 ********** is_delete, can't find end.
% 1.07/1.29 new demod time 0.00
% 1.07/1.29 post_process time 0.00
% 1.07/1.29 back demod time 0.00
% 1.07/1.29 back subsume 0.00
% 1.07/1.29 factor time 0.00
% 1.07/1.29 FINDER time 0.00
% 1.07/1.29 unindex time 0.00
% 1.07/1.29
% 1.07/1.29 Forward subsumption counts, subsumer:number_subsumed.
% 1.07/1.29 1:0 2:0 3:0 4:0 5:0 6:0 7:0 8:0 9:0 10:0
% 1.07/1.29 11:0 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:0
% 1.07/1.29 21:0 22:0 23:0 24:0 25:0 26:0 27:0 28:0 29:0 30:0
% 1.07/1.29 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 1.07/1.29 41:0 42:0 43:0 44:0 45:0 46:0 47:0 48:0 49:0 50:0
% 1.07/1.29 51:0 52:0 53:0 54:0 55:0 56:0 57:0 58:0 59:0 60:0
% 1.07/1.29 61:0 62:0 63:0 64:0 65:0 66:0 67:0 68:0 69:0 70:0
% 1.07/1.29 71:0 72:0 73:0 74:0 75:0 76:0 77:0 78:0 79:0 80:0
% 1.07/1.29 81:0 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:1 90:1
% 1.07/1.29 91:1 92:1 93:1 94:19 95:1 96:1 97:1 98:1 99:0
% 1.07/1.29 All others: 521.
% 1.07/1.29
% 1.07/1.29 ********** ABNORMAL END **********
% 1.07/1.29
% 1.07/1.29 ********** is_delete, can't find end.
%------------------------------------------------------------------------------