TSTP Solution File: SWC164-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWC164-1 : TPTP v8.1.0. Released v2.4.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 : Tue Jul 19 21:59:41 EDT 2022
% Result : Unknown 1.05s 1.29s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC164-1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : sos-script %s
% 0.13/0.35 % Computer : n021.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 : Sun Jun 12 04:27:55 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.45 ----- Otter 3.2, August 2001 -----
% 0.20/0.45 The process was started by sandbox2 on n021.cluster.edu,
% 0.20/0.45 Sun Jun 12 04:27:55 2022
% 0.20/0.45 The command was "./sos". The process ID is 4345.
% 0.20/0.45
% 0.20/0.45 set(prolog_style_variables).
% 0.20/0.45 set(auto).
% 0.20/0.45 dependent: set(auto1).
% 0.20/0.45 dependent: set(process_input).
% 0.20/0.45 dependent: clear(print_kept).
% 0.20/0.45 dependent: clear(print_new_demod).
% 0.20/0.45 dependent: clear(print_back_demod).
% 0.20/0.45 dependent: clear(print_back_sub).
% 0.20/0.45 dependent: set(control_memory).
% 0.20/0.45 dependent: assign(max_mem, 12000).
% 0.20/0.45 dependent: assign(pick_given_ratio, 4).
% 0.20/0.45 dependent: assign(stats_level, 1).
% 0.20/0.45 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.45 dependent: assign(sos_limit, 5000).
% 0.20/0.45 dependent: assign(max_weight, 60).
% 0.20/0.45 clear(print_given).
% 0.20/0.45
% 0.20/0.45 list(usable).
% 0.20/0.45
% 0.20/0.45 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 0.20/0.45
% 0.20/0.45 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.45 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.45 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.45 clauses in usable.
% 0.20/0.45
% 0.20/0.45 dependent: set(knuth_bendix).
% 0.20/0.45 dependent: set(para_from).
% 0.20/0.45 dependent: set(para_into).
% 0.20/0.45 dependent: clear(para_from_right).
% 0.20/0.45 dependent: clear(para_into_right).
% 0.20/0.45 dependent: set(para_from_vars).
% 0.20/0.45 dependent: set(eq_units_both_ways).
% 0.20/0.45 dependent: set(dynamic_demod_all).
% 0.20/0.45 dependent: set(dynamic_demod).
% 0.20/0.45 dependent: set(order_eq).
% 0.20/0.45 dependent: set(back_demod).
% 0.20/0.45 dependent: set(lrpo).
% 0.20/0.45 dependent: set(hyper_res).
% 0.20/0.45 dependent: set(unit_deletion).
% 0.20/0.45 dependent: set(factor).
% 0.20/0.45
% 0.20/0.45 ------------> process usable:
% 0.20/0.45 Following clause subsumed by 23 during input processing: 0 [] {-} -ssList(A)|ssList(tl(A))|nil=A.
% 0.20/0.45 Following clause subsumed by 24 during input processing: 0 [] {-} -ssList(A)|ssItem(hd(A))|nil=A.
% 0.20/0.45 Following clause subsumed by 67 during input processing: 0 [] {-} -leq(A,B)| -ssItem(B)| -ssItem(A)|lt(A,B)|A=B.
% 0.20/0.45 140 back subsumes 139.
% 0.20/0.45 150 back subsumes 144.
% 0.20/0.45
% 0.20/0.45 ------------> process sos:
% 0.20/0.45 Following clause subsumed by 447 during input processing: 0 [copy,447,flip.1] {-} A=A.
% 0.20/0.45 447 back subsumes 337.
% 0.20/0.45 447 back subsumes 281.
% 0.20/0.45 447 back subsumes 280.
% 0.20/0.45 447 back subsumes 279.
% 0.20/0.45 447 back subsumes 269.
% 0.20/0.45 447 back subsumes 256.
% 0.20/0.45 447 back subsumes 255.
% 0.20/0.45 447 back subsumes 254.
% 0.20/0.45 447 back subsumes 217.
% 0.20/0.45 447 back subsumes 205.
% 0.20/0.45 447 back subsumes 204.
% 0.20/0.45 447 back subsumes 203.
% 0.20/0.45 447 back subsumes 202.
% 0.20/0.45 447 back subsumes 185.
% 0.20/0.45 447 back subsumes 182.
% 0.20/0.45 447 back subsumes 180.
% 0.20/0.45 447 back subsumes 176.
% 0.20/0.45 447 back subsumes 173.
% 0.20/0.45 447 back subsumes 150.
% 0.20/0.45 447 back subsumes 149.
% 0.20/0.45 447 back subsumes 148.
% 0.20/0.45 447 back subsumes 147.
% 0.20/0.45 447 back subsumes 146.
% 0.20/0.45 447 back subsumes 138.
% 0.20/0.45 447 back subsumes 137.
% 0.20/0.45
% 0.20/0.45 ======= end of input processing =======
% 0.20/0.51
% 0.20/0.51 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.51
% 0.20/0.51 Stopped by limit on number of solutions
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 -------------- Softie stats --------------
% 0.20/0.51
% 0.20/0.51 UPDATE_STOP: 300
% 0.20/0.51 SFINDER_TIME_LIMIT: 2
% 0.20/0.51 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.51 number of clauses in intial UL: 335
% 0.20/0.51 number of clauses initially in problem: 408
% 0.20/0.51 percentage of clauses intially in UL: 82
% 0.20/0.51 percentage of distinct symbols occuring in initial UL: 91
% 0.20/0.51 percent of all initial clauses that are short: 100
% 0.20/0.51 absolute distinct symbol count: 78
% 0.20/0.51 distinct predicate count: 20
% 0.20/0.51 distinct function count: 46
% 0.20/0.51 distinct constant count: 12
% 0.20/0.51
% 0.20/0.51 ---------- no more Softie stats ----------
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 =========== start of search ===========
% 1.05/1.29
% 1.05/1.29 Stopped by limit on insertions
% 1.05/1.29
% 1.05/1.29 Stopped by limit on insertions
% 1.05/1.29
% 1.05/1.29 Model 2 (0.00 seconds, 0 Inserts)
% 1.05/1.29
% 1.05/1.29 Stopped by limit on number of solutions
% 1.05/1.29
% 1.05/1.29 Stopped by limit on insertions
% 1.05/1.29
% 1.05/1.29 Model 3 (0.00 seconds, 0 Inserts)
% 1.05/1.29
% 1.05/1.29 Stopped by limit on number of solutions
% 1.05/1.29
% 1.05/1.29 Model 4 (0.00 seconds, 0 Inserts)
% 1.05/1.29
% 1.05/1.29 Stopped by limit on number of solutions
% 1.05/1.29
% 1.05/1.29 Stopped by limit on insertions
% 1.05/1.29
% 1.05/1.29 Stopped by limit on insertions
% 1.05/1.29
% 1.05/1.29 Stopped by limit on insertions
% 1.05/1.29 cons(skac2,app(sk1,nil))=app(cons(skac2,sk1),nil).
% 1.05/1.29
% 1.05/1.29 ------------- memory usage ------------
% 1.05/1.29 45 mallocs of 32700 bytes each, 1437.0 K.
% 1.05/1.29 type (bytes each) gets frees in use avail bytes
% 1.05/1.29 sym_ent ( 304) 185 0 185 0 54.9 K
% 1.05/1.29 term ( 32) 89316 82859 6457 7 202.0 K
% 1.05/1.29 rel ( 40) 64478 57399 7079 3 276.6 K
% 1.05/1.29 term_ptr ( 16) 26907 2853 24054 51 376.6 K
% 1.05/1.29 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 1.05/1.29 fpa_head ( 24) 2197 68 2129 4 50.0 K
% 1.05/1.29 fpa_tree ( 56) 13696 13696 0 20 1.1 K
% 1.05/1.29 context (1288) 19991 19991 0 11 13.8 K
% 1.05/1.29 trail ( 24) 103993 103993 0 6 0.1 K
% 1.05/1.29 imd_tree ( 32) 76 15 61 7 2.1 K
% 1.05/1.29 imd_pos (4024) 0 0 0 0 0.0 K
% 1.05/1.29 is_tree ( 24) 1551 132 1419 33 34.0 K
% 1.05/1.29 is_pos (2424) 71172 71172 0 6 14.2 K
% 1.05/1.29 fsub_pos ( 16) 10381 10381 0 1 0.0 K
% 1.05/1.29 literal ( 32) 21511 17127 4384 0 137.0 K
% 1.05/1.29 clause ( 88) 3949 2851 1098 0 94.4 K
% 1.05/1.29 list ( 272) 10 3 7 1 2.1 K
% 1.05/1.29 clash_nd ( 80) 7252 7252 0 9 0.7 K
% 1.05/1.29 clause_ptr ( 16) 1052 140 912 4 14.3 K
% 1.05/1.29 int_ptr ( 16) 9847 4815 5032 0 78.6 K
% 1.05/1.29 ci_ptr ( 24) 0 0 0 0 0.0 K
% 1.05/1.29 link_node ( 120) 0 0 0 0 0.0 K
% 1.05/1.29 ans_lit_node( 24) 0 0 0 0 0.0 K
% 1.05/1.29 formula_box( 168) 0 0 0 0 0.0 K
% 1.05/1.29 formula( 40) 0 0 0 0 0.0 K
% 1.05/1.29 formula_ptr( 16) 0 0 0 0 0.0 K
% 1.05/1.29 cl_attribute( 24) 0 0 0 0 0.0 K
% 1.05/1.29
% 1.05/1.29 ********** is_delete, can't find end.
% 1.05/1.29 ties 0.00
% 1.05/1.29 unit deleletion 0.00
% 1.05/1.29 factor simplify 0.00
% 1.05/1.29 weigh cl time 0.00
% 1.05/1.29 hints keep time 0.00
% 1.05/1.29 sort lits time 0.00
% 1.05/1.29 forward subsume 0.00
% 1.05/1.29 delete cl time 0.00
% 1.05/1.29 keep cl time 0.00
% 1.05/1.29 hints time 0.00
% 1.05/1.29 print_cl time 0.00
% 1.05/1.29 conflict time 0.00
% 1.05/1.29 new demod time 0.00
% 1.05/1.29 post_process time 0.00
% 1.05/1.29 back demod time 0.00
% 1.05/1.29 back subsume 0.00
% 1.05/1.29 factor time 0.00
% 1.05/1.29 FINDER time 0.00
% 1.05/1.29 unindex time 0.00
% 1.05/1.29
% 1.05/1.29 ----------- soft-scott stats ----------
% 1.05/1.29
% 1.05/1.29 true clauses given 1 (10.0%)
% 1.05/1.29 false clauses given 9
% 1.05/1.29
% 1.05/1.29 FALSE TRUE
% 1.05/1.29 2 5 1
% 1.05/1.29 3 38 6
% 1.05/1.29 4 8 7
% 1.05/1.29 5 0 3
% 1.05/1.29 6 2 2
% 1.05/1.29 7 0 41
% 1.05/1.29 8 0 2
% 1.05/1.29 9 0 31
% 1.05/1.29 10 0 2
% 1.05/1.29 11 0 64
% 1.05/1.29 12 0 27
% 1.05/1.29 13 0 40
% 1.05/1.29 14 0 14
% 1.05/1.29 15 0 33
% 1.05/1.29 16 0 20
% 1.05/1.29 17 0 17
% 1.05/1.29 19 0 8
% 1.05/1.29 21 0 24
% 1.05/1.29 22 0 15
% 1.05/1.29 23 0 8
% 1.05/1.29 tot: 53 365 (87.3% true)
% 1.05/1.29
% 1.05/1.29
% 1.05/1.29 Model 4 (0.00 seconds, 0 Inserts)
% 1.05/1.29
% 1.05/1.29 Forward subsumption counts, subsumer:number_subsumed.
% 1.05/1.29 1:0 2:0 3:2 4:0 5:11 6:0 7:4 8:0 9:6 10:47
% 1.05/1.29 11:6 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:1
% 1.05/1.29 21:0 22:0 23:1 24:1 25:0 26:0 27:0 28:0 29:0 30:0
% 1.05/1.29 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 1.05/1.29 41:0 42:0 43:0 44:0 45:0 46:0 47:0 48:0 49:0 50:0
% 1.05/1.29 51:0 52:0 53:0 54:0 55:0 56:1 57:0 58:0 59:0 60:1
% 1.05/1.29 61:0 62:0 63:0 64:0 65:0 66:0 67:1 68:0 69:0 70:0
% 1.05/1.29 71:0 72:0 73:0 74:0 75:0 76:0 77:0 78:0 79:0 80:0
% 1.05/1.29 81:0 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 1.05/1.29 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 1.05/1.29 All others: 688.
% 1.05/1.29
% 1.05/1.29 ********** ABNORMAL END **********
% 1.05/1.29
% 1.05/1.29 ********** is_delete, can't find end.
%------------------------------------------------------------------------------