%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM925+1 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n003.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:12 EDT 2022
% Result : Timeout 300.01s 300.17s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM925+1 : TPTP v8.1.0. Released v5.3.0.
% 0.04/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n003.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 : Tue Jul 5 06:48:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n003.cluster.edu,
% 0.13/0.36 Tue Jul 5 06:48:55 2022
% 0.13/0.36 The command was "./sos". The process ID is 9170.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=1, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 There is a clause for symmetry of equality, so it is
% 0.13/0.36 assumed that equality is fully axiomatized; therefore,
% 0.13/0.36 paramodulation is disabled.
% 0.13/0.36
% 0.13/0.36 dependent: clear(para_from).
% 0.13/0.36 dependent: clear(para_into).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36 Following clause subsumed by 8 during input processing: 0 [] {-} -ord_less_int(number_number_of_int(A),number_number_of_int(B))|ord_less_int(A,B).
% 0.13/0.36 Following clause subsumed by 9 during input processing: 0 [] {-} ord_less_int(number_number_of_int(A),number_number_of_int(B))| -ord_less_int(A,B).
% 0.13/0.36 Following clause subsumed by 12 during input processing: 0 [] {-} -ord_less_int(bit1(A),bit1(B))|ord_less_int(A,B).
% 0.13/0.36 Following clause subsumed by 13 during input processing: 0 [] {-} ord_less_int(bit1(A),bit1(B))| -ord_less_int(A,B).
% 0.13/0.36 Following clause subsumed by 15 during input processing: 0 [] {-} -ord_less_int(bit0(A),bit0(B))|ord_less_int(A,B).
% 0.13/0.36 Following clause subsumed by 16 during input processing: 0 [] {-} ord_less_int(bit0(A),bit0(B))| -ord_less_int(A,B).
% 0.13/0.36 Following clause subsumed by 40 during input processing: 0 [] {-} -ord_less_int(bit1(A),bit0(B))|ord_less_int(A,B).
% 0.13/0.36 Following clause subsumed by 41 during input processing: 0 [] {-} ord_less_int(bit1(A),bit0(B))| -ord_less_int(A,B).
% 0.13/0.36 Following clause subsumed by 63 during input processing: 0 [flip.1] {-} bit1(A)!=pls.
% 0.13/0.36 Following clause subsumed by 65 during input processing: 0 [copy,64,flip.1] {-} bit0(A)!=bit1(B).
% 0.13/0.36 Following clause subsumed by 64 during input processing: 0 [copy,65,flip.1] {-} bit1(A)!=bit0(B).
% 0.13/0.36 73 back subsumes 4.
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 117 during input processing: 0 [demod,115] {-} one_one_int=one_one_int.
% 0.13/0.36 Following clause subsumed by 173 during input processing: 0 [demod,162,166] {-} A=A.
% 0.13/0.36 Following clause subsumed by 173 during input processing: 0 [demod,125,162,162] {-} pls=pls.
% 0.13/0.36 Following clause subsumed by 173 during input processing: 0 [demod,140] {-} zero_zero_nat=zero_zero_nat.
% 0.13/0.36 Following clause subsumed by 173 during input processing: 0 [demod,125,162,162] {-} pls=pls.
% 0.13/0.36 Following clause subsumed by 173 during input processing: 0 [demod,162,125,162] {-} pls=pls.
% 0.13/0.36 Following clause subsumed by 173 during input processing: 0 [demod,125,162,166] {-} A=A.
% 0.13/0.36 Following clause subsumed by 173 during input processing: 0 [demod,125,162,164] {-} A=A.
% 0.13/0.36 Following clause subsumed by 173 during input processing: 0 [demod,122,154] {-} plus_plus_int(number_number_of_int(A),plus_plus_int(number_number_of_int(B),C))=plus_plus_int(number_number_of_int(A),plus_plus_int(number_number_of_int(B),C)).
% 0.13/0.37 Following clause subsumed by 173 during input processing: 0 [demod,122] {-} plus_plus_int(number_number_of_int(A),number_number_of_int(B))=plus_plus_int(number_number_of_int(A),number_number_of_int(B)).
% 0.13/0.37 Following clause subsumed by 173 during input processing: 0 [demod,122] {-} plus_plus_int(number_number_of_int(A),number_number_of_int(B))=plus_plus_int(number_number_of_int(A),number_number_of_int(B)).
% 0.13/0.37 Following clause subsumed by 173 during input processing: 0 [] {-} A=A.
% 0.13/0.37 Following clause subsumed by 173 during input processing: 0 [copy,105,flip.1] {-} plus_plus_int(one_one_int,one_one_int)=plus_plus_int(one_one_int,one_one_int).
% 0.13/0.37 Following clause subsumed by 173 during input processing: 0 [copy,117,flip.1] {-} one_one_int=one_one_int.
% 0.13/0.37 Following clause subsumed by 173 during input processing: 0 [copy,130,flip.1] {-} power_power_int(semiri1621563631at_int(A),B)=power_power_int(semiri1621563631at_int(A),B).
% 0.13/0.37 Following clause subsumed by 173 during input processing: 0 [copy,142,flip.1] {-} zero_zero_nat=zero_zero_nat.
% 0.13/0.37 Following clause subsumed by 173 during input processing: 0 [copy,146,flip.1] {-} plus_plus_nat(one_one_nat,one_one_nat)=plus_plus_nat(one_one_nat,one_one_nat).
% 0.13/0.37 Following clause subsumed by 173 during input processing: 0 [copy,152,flip.1] {-} one_one_nat=one_one_nat.
% 0.13/0.37 Following clause subsumed by 155 during input processing: 0 [copy,155,flip.1] {-} plus_plus_int(A,plus_plus_int(B,C))=plus_plus_int(B,plus_plus_int(A,C)).
% 0.13/0.37 Following clause subsumed by 156 during input processing: 0 [copy,156,flip.1] {-} plus_plus_int(A,B)=plus_plus_int(B,A).
% 0.13/0.37 156 back subsumes 105.
% 0.13/0.37 Following clause subsumed by 173 during input processing: 0 [copy,173,flip.1] {-} A=A.
% 0.13/0.37 173 back subsumes 152.
% 0.13/0.37 173 back subsumes 146.
% 0.13/0.37 173 back subsumes 142.
% 0.13/0.37 173 back subsumes 130.
% 0.13/0.37 173 back subsumes 117.
% 0.13/0.37 Following clause subsumed by 246 during input processing: 0 [copy,213,flip.1] {-} power_power_int(power_power_int(A,plus_plus_nat(one_one_nat,one_one_nat)),plus_plus_nat(one_one_nat,one_one_nat))=power_power_int(A,number_number_of_nat(plus_plus_int(one_one_int,plus_plus_int(one_one_int,plus_plus_int(one_one_int,one_one_int))))).
% 0.13/0.37 Following clause subsumed by 213 during input processing: 0 [copy,246,flip.1] {-} power_power_int(A,number_number_of_nat(plus_plus_int(one_one_int,plus_plus_int(one_one_int,plus_plus_int(one_one_int,one_one_int)))))=power_power_int(power_power_int(A,plus_plus_nat(one_one_nat,one_one_nat)),plus_plus_nat(one_one_nat,one_one_nat)).
% 0.13/0.37 Following clause subsumed by 254 during input processing: 0 [copy,253,flip.1] {-} plus_plus_int(one_one_int,plus_plus_int(A,A))!=plus_plus_int(B,B).
% 0.13/0.37 Following clause subsumed by 253 during input processing: 0 [copy,254,flip.1] {-} plus_plus_int(A,A)!=plus_plus_int(one_one_int,plus_plus_int(B,B)).
% 0.13/0.37 Following clause subsumed by 264 during input processing: 0 [copy,263,flip.1] {-} plus_plus_int(A,plus_plus_int(A,plus_plus_int(one_one_int,plus_plus_int(B,B))))=plus_plus_int(one_one_int,plus_plus_int(A,plus_plus_int(A,plus_plus_int(B,B)))).
% 0.13/0.37 Following clause subsumed by 263 during input processing: 0 [copy,264,flip.1] {-} plus_plus_int(one_one_int,plus_plus_int(A,plus_plus_int(A,plus_plus_int(B,B))))=plus_plus_int(A,plus_plus_int(A,plus_plus_int(one_one_int,plus_plus_int(B,B)))).
% 0.13/0.37 Following clause subsumed by 245 during input processing: 0 [copy,280,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.13/0.37 Following clause subsumed by 265 during input processing: 0 [copy,301,flip.1] {-} plus_plus_int(one_one_int,plus_plus_int(A,plus_plus_int(B,plus_plus_int(A,B))))=plus_plus_int(one_one_int,plus_plus_int(A,plus_plus_int(A,plus_plus_int(B,B)))).
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.20/0.45
% 0.20/0.45 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.45
% 0.20/0.45 Stopped by limit on number of solutions
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 -------------- Softie stats --------------
% 0.20/0.45
% 0.20/0.45 UPDATE_STOP: 300
% 0.20/0.45 SFINDER_TIME_LIMIT: 2
% 0.20/0.45 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.45 number of clauses in intial UL: 21
% 0.20/0.45 number of clauses initially in problem: 138
% 0.20/0.45 percentage of clauses intially in UL: 15
% 0.20/0.45 percentage of distinct symbols occuring in initial UL: 60
% 0.20/0.45 percent of all initial clauses that are short: 100
% 0.20/0.45 absolute distinct symbol count: 20
% 0.20/0.45 distinct predicate count: 3
% 0.20/0.45 distinct function count: 10
% 0.20/0.45 distinct constant count: 7
% 0.20/0.45
% 0.20/0.45 ---------- no more Softie stats ----------
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 =========== start of search ===========
% 300.01/300.17 Wow, sos-wrapper got a signal XCPU
%------------------------------------------------------------------------------