TSTP Solution File: RNG029-7 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : RNG029-7 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n019.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 20:40:58 EDT 2022
% Result : Unknown 0.46s 0.65s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : RNG029-7 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon May 30 15:26:10 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox2 on n019.cluster.edu,
% 0.13/0.37 Mon May 30 15:26:10 2022
% 0.13/0.37 The command was "./sos". The process ID is 30769.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.13/0.37
% 0.13/0.37 All clauses are units, and equality is present; the
% 0.13/0.37 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] {-} add(A,B)=add(B,A).
% 0.13/0.37 Following clause subsumed by 50 during input processing: 0 [copy,45,flip.1] {-} add(multiply(A,B),multiply(additive_inverse(C),B))=add(multiply(A,B),multiply(additive_inverse(C),B)).
% 0.13/0.37 Following clause subsumed by 50 during input processing: 0 [copy,47,flip.1] {-} add(multiply(additive_inverse(A),B),multiply(additive_inverse(A),C))=add(multiply(additive_inverse(A),B),multiply(additive_inverse(A),C)).
% 0.13/0.37 Following clause subsumed by 50 during input processing: 0 [copy,50,flip.1] {-} A=A.
% 0.13/0.37 50 back subsumes 47.
% 0.13/0.37 50 back subsumes 45.
% 0.13/0.37 Following clause subsumed by 41 during input processing: 0 [copy,55,flip.1] {-} multiply(A,additive_inverse(B))=multiply(additive_inverse(A),B).
% 0.13/0.37 Following clause subsumed by 43 during input processing: 0 [copy,56,flip.1] {-} add(multiply(A,B),multiply(A,additive_inverse(C)))=add(multiply(A,B),multiply(additive_inverse(A),C)).
% 0.13/0.37 Following clause subsumed by 49 during input processing: 0 [copy,57,flip.1] {-} add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B)))=add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B)).
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.13/0.41
% 0.13/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.41
% 0.13/0.41 Stopped by limit on number of solutions
% 0.13/0.41
% 0.13/0.41
% 0.13/0.41 -------------- Softie stats --------------
% 0.13/0.41
% 0.13/0.41 UPDATE_STOP: 300
% 0.13/0.41 SFINDER_TIME_LIMIT: 2
% 0.13/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.41 number of clauses in intial UL: 1
% 0.13/0.41 number of clauses initially in problem: 41
% 0.13/0.41 percentage of clauses intially in UL: 2
% 0.13/0.41 percentage of distinct symbols occuring in initial UL: 50
% 0.13/0.41 percent of all initial clauses that are short: 100
% 0.13/0.41 absolute distinct symbol count: 10
% 0.13/0.41 distinct predicate count: 1
% 0.13/0.41 distinct function count: 5
% 0.13/0.41 distinct constant count: 4
% 0.13/0.41
% 0.13/0.41 ---------- no more Softie stats ----------
% 0.13/0.41
% 0.13/0.41
% 0.13/0.41
% 0.13/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.41
% 0.13/0.41 Stopped by limit on number of solutions
% 0.13/0.41
% 0.13/0.41 =========== start of search ===========
% 0.46/0.65
% 0.46/0.65 Model 3 (0.00 seconds, 0 Inserts)
% 0.46/0.65
% 0.46/0.65 Stopped by limit on number of solutions
% 0.46/0.65
% 0.46/0.65 Model 4 (0.00 seconds, 0 Inserts)
% 0.46/0.65
% 0.46/0.65 Stopped by limit on number of solutions
% 0.46/0.65
% 0.46/0.65 Model 5 (0.00 seconds, 0 Inserts)
% 0.46/0.65
% 0.46/0.65 Stopped by limit on number of solutions
% 0.46/0.65
% 0.46/0.65 Stopped by limit on insertions
% 0.46/0.65
% 0.46/0.65 Stopped by limit on insertions
% 0.46/0.65
% 0.46/0.65 Model 6 [ 5 0 862 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.65
% 0.46/0.65 Model 7 (0.00 seconds, 250000 Inserts)
% 0.46/0.65
% 0.46/0.65 Stopped by limit on number of solutions
% 0.46/0.65
% 0.46/0.65 Model 8 (0.00 seconds, 250000 Inserts)
% 0.46/0.65
% 0.46/0.65 Stopped by limit on number of solutions
% 0.46/0.65 add(multiply(A,B),multiply(B,additive_inverse(A)))=commutator(additive_inverse(B),additive_inverse(A)).
% 0.46/0.65
% 0.46/0.65 ------------- memory usage ------------
% 0.46/0.65 16 mallocs of 32700 bytes each, 510.9 K.
% 0.46/0.65 type (bytes each) gets frees in use avail bytes
% 0.46/0.65 sym_ent ( 304) 112 0 112 0 33.2 K
% 0.46/0.65 term ( 32) 9071 8128 943 16 30.0 K
% 0.46/0.65 rel ( 40) 8463 6930 1533 9 60.2 K
% 0.46/0.65 term_ptr ( 16) 7496 556 6940 19 108.7 K
% 0.46/0.65 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 0.46/0.65 fpa_head ( 24) 864 20 844 0 19.8 K
% 0.46/0.65 fpa_tree ( 56) 1304 1304 0 15 0.8 K
% 0.46/0.65 context (1288) 1506 1506 0 4 5.0 K
% 0.46/0.65 trail ( 24) 1534 1534 0 4 0.1 K
% 0.46/0.65 imd_tree ( 32) 426 29 397 0 12.4 K
% 0.46/0.65 imd_pos (4024) 5729 5729 0 12 47.2 K
% 0.46/0.65 is_tree ( 24) 1299 81 1218 5 28.7 K
% 0.46/0.65 is_pos (2424) 1934 1934 0 16 37.9 K
% 0.46/0.65 fsub_pos ( 16) 309 309 0 1 0.0 K
% 0.46/0.65 literal ( 32) 555 310 245 1 7.7 K
% 0.46/0.65 clause ( 88) 555 310 245 1 21.1 K
% 0.46/0.65 list ( 272) 10 3 7 1 2.1 K
% 0.46/0.65 clash_nd ( 80) 0 0 0 0 0.0 K
% 0.46/0.65 clause_ptr ( 16) 405 173 232 2 3.7 K
% 0.46/0.65 int_ptr ( 16) 4899 3455 1444 5 22.6 K
% 0.46/0.65 ci_ptr ( 24) 0 0 0 0 0.0 K
% 0.46/0.65 link_node ( 120) 0 0 0 0 0.0 K
% 0.46/0.65 ans_lit_node( 24) 0 0 0 0 0.0 K
% 0.46/0.65 formula_box( 168) 0 0 0 0 0.0 K
% 0.46/0.65 formula( 40) 0 0 0 0 0.0 K
% 0.46/0.65 formula_ptr( 16) 0 0 0 0 0.0 K
% 0.46/0.65 cl_attribute( 24) 0 0 0 0 0.0 K
% 0.46/0.65
% 0.46/0.65 ********** is_delete, can't find end.
% 0.46/0.65 0
% 0.46/0.65 demod time 0.00
% 0.46/0.65 order equalities 0.00
% 0.46/0.65 unit deleletion 0.00
% 0.46/0.65 factor simplify 0.00
% 0.46/0.65 weigh cl time 0.00
% 0.46/0.65 hints keep time 0.00
% 0.46/0.65 sort lits time 0.00
% 0.46/0.65 forward subsume 0.00
% 0.46/0.65 delete cl time 0.00
% 0.46/0.65 keep cl time 0.00
% 0.46/0.65 hints time 0.00
% 0.46/0.65 print_cl time 0.00
% 0.46/0.65 conflict time 0.00
% 0.46/0.65 new demod time 0.00
% 0.46/0.65 post_process time 0.00
% 0.46/0.65 back demod time 0.00
% 0.46/0.65 back subsume 0.00
% 0.46/0.65 factor time 0.00
% 0.46/0.65 FINDER time 0.00
% 0.46/0.65 unindex time 0.00
% 0.46/0.65
% 0.46/0.65 ----------- soft-scott stats ----------
% 0.46/0.65
% 0.46/0.65 true clauses given 4 (14.8%)
% 0.46/0.65 false clauses given 23
% 0.46/0.65
% 0.46/0.65 FALSE TRUE
% 0.46/0.65 8 0 2
% 0.46/0.65 10 0 1
% 0.46/0.65 11 0 3
% 0.46/0.65 12 4 2
% 0.46/0.65 13 11 4
% 0.46/0.65 14 10 4
% 0.46/0.65 15 2 1
% 0.46/0.65 16 8 0
% 0.46/0.65 17 6 0
% 0.46/0.65 18 1 0
% 0.46/0.65 19 8 1
% 0.46/0.65 21 4 0
% 0.46/0.65 25 10 0
% 0.46/0.65 31 0 2
% 0.46/0.65 32 2 0
% 0.46/0.65 47 3 0
% 0.46/0.65 tot: 69 20 (22.5% true)
% 0.46/0.65
% 0.46/0.65
% 0.46/0.65 Model 8 (0.00 seconds, 250000 Inserts)
% 0.46/0.65
% 0.46/0.65 Forward subsumption counts, subsumer:number_subsumed.
% 0.46/0.65 1:0 2:0 3:0 4:0 5:0 6:0 7:0 8:0 9:0 10:0
% 0.46/0.65 11:0 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:0
% 0.46/0.65 21:3 22:0 23:0 24:0 25:0 26:0 27:0 28:0 29:0 30:0
% 0.46/0.65 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 0.46/0.65 41:3 42:0 43:1 44:0 45:0 46:0 47:0 48:0 49:1 50:261
% 0.46/0.65 51:0 52:0 53:0 54:0 55:4 56:0 57:0 58:0 59:0 60:0
% 0.46/0.65 61:0 62:0 63:0 64:0 65:0 66:0 67:0 68:1 69:0 70:1
% 0.46/0.65 71:0 72:0 73:0 74:0 75:0 76:0 77:0 78:0 79:0 80:1
% 0.46/0.65 81:1 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 0.46/0.65 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 0.46/0.65 All others: 32.
% 0.46/0.65
% 0.46/0.65 ********** ABNORMAL END **********
% 0.46/0.65
% 0.46/0.65 ********** is_delete, can't find end.
%------------------------------------------------------------------------------