TSTP Solution File: NUM926+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM926+1 : 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:16 EDT 2022
% Result : Theorem 0.18s 0.41s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM926+1 : TPTP v8.1.0. Released v5.3.0.
% 0.10/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 5 14:55:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n021.cluster.edu,
% 0.12/0.36 Tue Jul 5 14:55:47 2022
% 0.12/0.36 The command was "./sos". The process ID is 1676.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=1, max_lits=3.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 There is a clause for symmetry of equality, so it is
% 0.12/0.36 assumed that equality is fully axiomatized; therefore,
% 0.12/0.36 paramodulation is disabled.
% 0.12/0.36
% 0.12/0.36 dependent: clear(para_from).
% 0.12/0.36 dependent: clear(para_into).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36 Following clause subsumed by 15 during input processing: 0 [] {-} -ord_less_int(bit1(A),bit1(B))|ord_less_int(A,B).
% 0.12/0.36 Following clause subsumed by 16 during input processing: 0 [] {-} ord_less_int(bit1(A),bit1(B))| -ord_less_int(A,B).
% 0.12/0.36 Following clause subsumed by 17 during input processing: 0 [] {-} -ord_less_eq_int(bit1(A),bit1(B))|ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 18 during input processing: 0 [] {-} ord_less_eq_int(bit1(A),bit1(B))| -ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 20 during input processing: 0 [] {-} -ord_less_int(bit0(A),bit0(B))|ord_less_int(A,B).
% 0.12/0.36 Following clause subsumed by 21 during input processing: 0 [] {-} ord_less_int(bit0(A),bit0(B))| -ord_less_int(A,B).
% 0.12/0.36 Following clause subsumed by 22 during input processing: 0 [] {-} -ord_less_eq_int(bit0(A),bit0(B))|ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 23 during input processing: 0 [] {-} ord_less_eq_int(bit0(A),bit0(B))| -ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 10 during input processing: 0 [] {-} -ord_less_int(number_number_of_int(A),number_number_of_int(B))|ord_less_int(A,B).
% 0.12/0.36 Following clause subsumed by 11 during input processing: 0 [] {-} ord_less_int(number_number_of_int(A),number_number_of_int(B))| -ord_less_int(A,B).
% 0.12/0.36 Following clause subsumed by 12 during input processing: 0 [] {-} -ord_less_eq_int(number_number_of_int(A),number_number_of_int(B))|ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 13 during input processing: 0 [] {-} ord_less_eq_int(number_number_of_int(A),number_number_of_int(B))| -ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 32 during input processing: 0 [] {-} -ord_less_eq_int(bit1(A),bit0(B))|ord_less_int(A,B).
% 0.12/0.36 Following clause subsumed by 33 during input processing: 0 [] {-} ord_less_eq_int(bit1(A),bit0(B))| -ord_less_int(A,B).
% 0.12/0.36 Following clause subsumed by 34 during input processing: 0 [] {-} -ord_less_int(bit0(A),bit1(B))|ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 35 during input processing: 0 [] {-} ord_less_int(bit0(A),bit1(B))| -ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 36 during input processing: 0 [] {-} ord_less_eq_int(plus_plus_int(A,one_one_int),B)| -ord_less_int(A,B).
% 0.12/0.36 Following clause subsumed by 53 during input processing: 0 [] {-} -ord_less_int(bit1(A),bit0(B))|ord_less_int(A,B).
% 0.12/0.36 Following clause subsumed by 54 during input processing: 0 [] {-} ord_less_int(bit1(A),bit0(B))| -ord_less_int(A,B).
% 0.12/0.36 Following clause subsumed by 61 during input processing: 0 [] {-} -ord_less_eq_int(bit0(A),bit1(B))|ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 62 during input processing: 0 [] {-} ord_less_eq_int(bit0(A),bit1(B))| -ord_less_eq_int(A,B).
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 106 during input processing: 0 [] {-} power_power_int(power_power_int(A,B),C)=power_power_int(A,times_times_nat(B,C)).
% 0.12/0.36 Following clause subsumed by 103 during input processing: 0 [] {-} ord_less_eq_int(pls,pls).
% 0.12/0.36 Following clause subsumed by 150 during input processing: 0 [demod,146] {-} times_times_int(A,times_times_int(B,C))=times_times_int(A,times_times_int(B,C)).
% 0.12/0.36 Following clause subsumed by 155 during input processing: 0 [] {-} times_times_int(A,B)=times_times_int(B,A).
% 0.12/0.36 Following clause subsumed by 166 during input processing: 0 [demod,162] {-} plus_plus_int(A,plus_plus_int(B,C))=plus_plus_int(A,plus_plus_int(B,C)).
% 0.12/0.36 Following clause subsumed by 169 during input processing: 0 [] {-} plus_plus_int(A,plus_plus_int(B,C))=plus_plus_int(B,plus_plus_int(A,C)).
% 0.12/0.36 Following clause subsumed by 171 during input processing: 0 [] {-} plus_plus_int(A,B)=plus_plus_int(B,A).
% 0.12/0.36 Following clause subsumed by 175 during input processing: 0 [copy,85,flip.1,demod,126,182] {-} power_power_int(A,plus_plus_nat(one_one_nat,one_one_nat))=power_power_int(A,plus_plus_nat(one_one_nat,one_one_nat)).
% 0.12/0.36 Following clause subsumed by 175 during input processing: 0 [copy,87,flip.1,demod,182,126] {-} power_power_int(A,plus_plus_nat(one_one_nat,one_one_nat))=power_power_int(A,plus_plus_nat(one_one_nat,one_one_nat)).
% 0.12/0.36 87 back subsumes 78.
% 0.12/0.36 Following clause subsumed by 175 during input processing: 0 [copy,88,flip.1,demod,187,126] {-} power_power_nat(A,plus_plus_nat(one_one_nat,one_one_nat))=power_power_nat(A,plus_plus_nat(one_one_nat,one_one_nat)).
% 0.12/0.36 88 back subsumes 79.
% 0.12/0.36 Following clause subsumed by 175 during input processing: 0 [copy,119,flip.1] {-} power_power_int(A,plus_plus_nat(B,C))=power_power_int(A,plus_plus_nat(B,C)).
% 0.12/0.36 Following clause subsumed by 175 during input processing: 0 [copy,132,flip.1] {-} one_one_nat=one_one_nat.
% 0.12/0.36 Following clause subsumed by 175 during input processing: 0 [copy,150,flip.1] {-} times_times_int(A,times_times_int(B,C))=times_times_int(A,times_times_int(B,C)).
% 0.12/0.36 Following clause subsumed by 175 during input processing: 0 [copy,152,flip.1] {-} times_times_nat(A,times_times_nat(B,C))=times_times_nat(A,times_times_nat(B,C)).
% 0.12/0.36 Following clause subsumed by 153 during input processing: 0 [copy,153,flip.1] {-} times_times_int(A,times_times_int(B,C))=times_times_int(B,times_times_int(A,C)).
% 0.12/0.36 Following clause subsumed by 154 during input processing: 0 [copy,154,flip.1] {-} times_times_nat(A,times_times_nat(B,C))=times_times_nat(B,times_times_nat(A,C)).
% 0.12/0.36 Following clause subsumed by 155 during input processing: 0 [copy,155,flip.1] {-} times_times_int(A,B)=times_times_int(B,A).
% 0.12/0.36 Following clause subsumed by 156 during input processing: 0 [copy,156,flip.1] {-} times_times_nat(A,B)=times_times_nat(B,A).
% 0.12/0.36 Following clause subsumed by 175 during input processing: 0 [copy,166,flip.1] {-} plus_plus_int(A,plus_plus_int(B,C))=plus_plus_int(A,plus_plus_int(B,C)).
% 0.12/0.36 Following clause subsumed by 175 during input processing: 0 [copy,168,flip.1] {-} plus_plus_nat(A,plus_plus_nat(B,C))=plus_plus_nat(A,plus_plus_nat(B,C)).
% 0.12/0.36 Following clause subsumed by 169 during input processing: 0 [copy,169,flip.1] {-} plus_plus_int(A,plus_plus_int(B,C))=plus_plus_int(B,plus_plus_int(A,C)).
% 0.12/0.36 Following clause subsumed by 170 during input processing: 0 [copy,170,flip.1] {-} plus_plus_nat(A,plus_plus_nat(B,C))=plus_plus_nat(B,plus_plus_nat(A,C)).
% 0.12/0.36 Following clause subsumed by 171 during input processing: 0 [copy,171,flip.1] {-} plus_plus_int(A,B)=plus_plus_int(B,A).
% 0.12/0.36 Following clause subsumed by 172 during input processing: 0 [copy,172,flip.1] {-} plus_plus_nat(A,B)=plus_plus_nat(B,A).
% 0.12/0.36 Following clause subsumed by 175 during input processing: 0 [copy,175,flip.1] {-} A=A.
% 0.12/0.36 175 back subsumes 168.
% 0.12/0.36 175 back subsumes 166.
% 0.12/0.36 175 back subsumes 152.
% 0.12/0.36 175 back subsumes 150.
% 0.12/0.36 175 back subsumes 132.
% 0.12/0.36 175 back subsumes 119.
% 0.12/0.36 175 back subsumes 64.
% 0.12/0.36 Following clause subsumed by 208 during input processing: 0 [copy,178,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(times_times_int(bit1(bit1(pls)),times_times_int(power_power_int(A,plus_plus_nat(one_one_nat,one_one_nat)),B)),plus_plus_int(times_times_int(bit1(bit1(pls)),times_times_int(A,power_power_int(B,plus_plus_nat(one_one_nat,one_one_nat)))),power_power_int(B,number_number_of_nat(bit1(bit1(pls))))))).
% 0.12/0.36 Following clause subsumed by 207 during input processing: 0 [copy,185,flip.1] {-} times_times_int(A,power_power_int(A,plus_plus_nat(one_one_nat,one_one_nat)))=power_power_int(A,number_number_of_nat(bit1(bit1(pls)))).
% 0.12/0.36 Following clause subsumed by 106 during input processing: 0 [copy,193,flip.1] {-} power_power_int(power_power_int(A,B),C)=power_power_int(A,times_times_nat(B,C)).
% 0.12/0.36 Following clause subsumed by 107 during input processing: 0 [copy,194,flip.1] {-} power_power_nat(power_power_nat(A,B),C)=power_power_nat(A,times_times_nat(B,C)).
% 0.12/0.36 Following clause subsumed by 175 during input processing: 0 [copy,195,flip.1,demod,240,202] {-} power_power_int(A,plus_plus_nat(B,B))=power_power_int(A,plus_plus_nat(B,B)).
% 0.12/0.36 Following clause subsumed by 175 during input processing: 0 [copy,196,flip.1,demod,242,202] {-} power_power_nat(A,plus_plus_nat(B,B))=power_power_nat(A,plus_plus_nat(B,B)).
% 0.12/0.36 Following clause subsumed by 185 during input processing: 0 [copy,207,flip.1] {-} power_power_int(A,number_number_of_nat(bit1(bit1(pls))))=times_times_int(A,power_power_int(A,plus_plus_nat(one_one_nat,one_one_nat))).
% 0.12/0.36 Following clause subsumed by 178 during input processing: 0 [copy,208,flip.1] {-} plus_plus_int(power_power_int(A,number_number_of_nat(bit1(bit1(pls)))),plus_plus_int(times_times_int(bit1(bit1(pls)),times_times_int(power_power_int(A,plus_plus_nat(one_one_nat,one_one_nat)),B)),plus_plus_int(times_times_int(bit1(bit1(pls)),times_times_int(A,power_power_int(B,plus_plus_nat(one_one_nat,one_one_nat)))),power_power_int(B,number_number_of_nat(bit1(bit1(pls)))))))=power_power_int(plus_plus_int(A,B),number_number_of_nat(bit1(bit1(pls)))).
% 0.12/0.36 Following clause subsumed by 213 during input processing: 0 [copy,213,flip.1] {-} times_times_int(A,times_times_int(B,times_times_int(C,D)))=times_times_int(A,times_times_int(C,times_times_int(B,D))).
% 0.12/0.36 Following clause subsumed by 214 during input processing: 0 [copy,214,flip.1] {-} times_times_nat(A,times_times_nat(B,times_times_nat(C,D)))=times_times_nat(A,times_times_nat(C,times_times_nat(B,D))).
% 0.12/0.36 Following clause subsumed by 217 during input processing: 0 [copy,215,flip.1] {-} times_times_int(A,times_times_int(B,times_times_int(C,D)))=times_times_int(C,times_times_int(A,times_times_int(B,D))).
% 0.12/0.36 Following clause subsumed by 218 during input processing: 0 [copy,216,flip.1] {-} times_times_nat(A,times_times_nat(B,times_times_nat(C,D)))=times_times_nat(C,times_times_nat(A,times_times_nat(B,D))).
% 0.12/0.36 Following clause subsumed by 215 during input processing: 0 [copy,217,flip.1] {-} times_times_int(A,times_times_int(B,times_times_int(C,D)))=times_times_int(B,times_times_int(C,times_times_int(A,D))).
% 0.12/0.36 Following clause subsumed by 216 during input processing: 0 [copy,218,flip.1] {-} times_times_nat(A,times_times_nat(B,times_times_nat(C,D)))=times_times_nat(B,times_times_nat(C,times_times_nat(A,D))).
% 0.12/0.36 Following clause subsumed by 219 during input processing: 0 [copy,219,flip.1] {-} times_times_int(A,times_times_int(B,C))=times_times_int(A,times_times_int(C,B)).
% 0.12/0.36 Following clause subsumed by 220 during input processing: 0 [copy,220,flip.1] {-} times_times_nat(A,times_times_nat(B,C))=times_times_nat(A,times_times_nat(C,B)).
% 0.12/0.36 Following clause subsumed by 221 during input processing: 0 [copy,221,flip.1] {-} plus_plus_int(A,plus_plus_int(B,plus_plus_int(C,D)))=plus_plus_int(A,plus_plus_int(C,plus_plus_int(B,D))).
% 0.12/0.36 Following clause subsumed by 222 during input processing: 0 [copy,222,flip.1] {-} plus_plus_nat(A,plus_plus_nat(B,plus_plus_nat(C,D)))=plus_plus_nat(A,plus_plus_nat(C,plus_plus_nat(B,D))).
% 0.12/0.36 Following clause subsumed by 223 during input processing: 0 [copy,223,flip.1] {-} plus_plus_int(A,plus_plus_int(B,C))=plus_plus_int(A,plus_plus_int(C,B)).
% 0.12/0.36 Following clause subsumed by 224 during input processing: 0 [copy,224,flip.1] {-} plus_plus_nat(A,plus_plus_nat(B,C))=plus_plus_nat(A,plus_plus_nat(C,B)).
% 0.12/0.36 236 back subsumes 44.
% 0.12/0.36 236 back subsumes 43.
% 0.12/0.36 Following clause subsumed by 251 during input processing: 0 [copy,246,flip.1] {-} plus_plus_int(power_power_int(A,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int(B,plus_plus_nat(one_one_nat,one_one_nat)))!=plus_plus_int(times_times_int(bit0(plus_plus_int(one_one_int,one_one_int)),m),one_one_int).
% 0.12/0.36 Following clause subsumed by 246 during input processing: 0 [copy,251,flip.1] {-} plus_plus_int(times_times_int(bit0(plus_plus_int(one_one_int,one_one_int)),m),one_one_int)!=plus_plus_int(power_power_int(A,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int(B,plus_plus_nat(one_one_nat,one_one_nat))).
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.18/0.41
% 0.18/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.41
% 0.18/0.41 Stopped by limit on number of solutions
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 -------------- Softie stats --------------
% 0.18/0.41
% 0.18/0.41 UPDATE_STOP: 300
% 0.18/0.41 SFINDER_TIME_LIMIT: 2
% 0.18/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.41 number of clauses in intial UL: 49
% 0.18/0.41 number of clauses initially in problem: 151
% 0.18/0.41 percentage of clauses intially in UL: 32
% 0.18/0.41 percentage of distinct symbols occuring in initial UL: 58
% 0.18/0.41 percent of all initial clauses that are short: 100
% 0.18/0.41 absolute distinct symbol count: 24
% 0.18/0.41 distinct predicate count: 7
% 0.18/0.41 distinct function count: 10
% 0.18/0.41 distinct constant count: 7
% 0.18/0.41
% 0.18/0.41 ---------- no more Softie stats ----------
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 =========== start of search ===========
% 0.18/0.41
% 0.18/0.41 -------- PROOF --------
% 0.18/0.41 % SZS status Theorem
% 0.18/0.41 % SZS output start Refutation
% 0.18/0.41
% 0.18/0.41 -----> EMPTY CLAUSE at 0.03 sec ----> 267 [hyper,66,5,unit_del,250,249] {-} $F.
% 0.18/0.41
% 0.18/0.41 Length of proof is 9. Level of proof is 4.
% 0.18/0.41
% 0.18/0.41 ---------------- PROOF ----------------
% 0.18/0.41 % SZS status Theorem
% 0.18/0.41 % SZS output start Refutation
% 0.18/0.41
% 0.18/0.41 1 [] {-} t!=one_one_int|plus_plus_int(power_power_int($c2,number_number_of_nat(bit0(bit1(pls)))),power_power_int($c1,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.18/0.41 2 [] {-} -ord_less_int(one_one_int,t)|plus_plus_int(power_power_int($c4,number_number_of_nat(bit0(bit1(pls)))),power_power_int($c3,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.18/0.41 5 [] {+} ord_less_int(A,B)| -ord_less_eq_int(A,B)|A=B.
% 0.18/0.41 63 [] {-} 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.18/0.41 66 [] {-} ord_less_eq_int(one_one_int,t).
% 0.18/0.41 97 [] {-} plus_plus_int(one_one_int,one_one_int)=number_number_of_int(bit0(bit1(pls))).
% 0.18/0.41 98 [copy,97,flip.1] {-} number_number_of_int(bit0(bit1(pls)))=plus_plus_int(one_one_int,one_one_int).
% 0.18/0.41 124 [] {-} plus_plus_nat(one_one_nat,one_one_nat)=number_number_of_nat(bit0(bit1(pls))).
% 0.18/0.41 126,125 [copy,124,flip.1] {-} number_number_of_nat(bit0(bit1(pls)))=plus_plus_nat(one_one_nat,one_one_nat).
% 0.18/0.41 174,173 [] {-} number_number_of_int(A)=A.
% 0.18/0.41 209 [back_demod,63,demod,126,126,174] {-} plus_plus_int(power_power_int(A,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int(B,plus_plus_nat(one_one_nat,one_one_nat)))!=plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int).
% 0.18/0.41 210 [back_demod,2,demod,126,126,174,flip.2] {-} -ord_less_int(one_one_int,t)|plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int)=plus_plus_int(power_power_int($c4,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int($c3,plus_plus_nat(one_one_nat,one_one_nat))).
% 0.18/0.41 211 [back_demod,1,demod,126,126,174,flip.2] {-} t!=one_one_int|plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int)=plus_plus_int(power_power_int($c2,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int($c1,plus_plus_nat(one_one_nat,one_one_nat))).
% 0.18/0.41 229,228 [back_demod,98,demod,174] {-} bit0(bit1(pls))=plus_plus_int(one_one_int,one_one_int).
% 0.18/0.41 246 [copy,209,flip.1,demod,229] {-} plus_plus_int(times_times_int(bit0(plus_plus_int(one_one_int,one_one_int)),m),one_one_int)!=plus_plus_int(power_power_int(A,plus_plus_nat(one_one_nat,one_one_nat)),power_power_int(B,plus_plus_nat(one_one_nat,one_one_nat))).
% 0.18/0.41 249 [back_demod,211,demod,229,unit_del,246] {+} t!=one_one_int.
% 0.18/0.41 250 [back_demod,210,demod,229,unit_del,246] {+} -ord_less_int(one_one_int,t).
% 0.18/0.41 267 [hyper,66,5,unit_del,250,249] {-} $F.
% 0.18/0.41
% 0.18/0.41 % SZS output end Refutation
% 0.18/0.41 ------------ end of proof -------------
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 Search stopped by max_proofs option.
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 Search stopped by max_proofs option.
% 0.18/0.41
% 0.18/0.41 ============ end of search ============
% 0.18/0.41
% 0.18/0.41 ----------- soft-scott stats ----------
% 0.18/0.41
% 0.18/0.41 true clauses given 0 (0.0%)
% 0.18/0.41 false clauses given 1
% 0.18/0.41
% 0.18/0.41 FALSE TRUE
% 0.18/0.41 3 1 3
% 0.18/0.41 4 1 1
% 0.18/0.41 5 3 0
% 0.18/0.41 6 2 2
% 0.18/0.41 7 6 1
% 0.18/0.41 8 4 1
% 0.18/0.41 9 5 1
% 0.18/0.41 10 2 0
% 0.18/0.41 11 15 1
% 0.18/0.41 13 5 0
% 0.18/0.41 14 2 0
% 0.18/0.41 15 7 1
% 0.18/0.41 16 1 0
% 0.18/0.41 18 2 0
% 0.18/0.41 20 2 0
% 0.18/0.41 27 3 0
% 0.18/0.41 46 2 0
% 0.18/0.41 tot: 63 11 (14.9% true)
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.41
% 0.18/0.41 That finishes the proof of the theorem.
% 0.18/0.41
% 0.18/0.41 Process 1676 finished Tue Jul 5 14:55:48 2022
%------------------------------------------------------------------------------