TSTP Solution File: KLE011+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KLE011+1 : TPTP v6.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : ./sos-script %s
% Computer : n016.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 16127.75MB
% OS : Linux 2.6.32-431.17.1.el6.x86_64
% CPULimit : 300s
% DateTime : Sat Jun 28 08:16:18 EDT 2014
% Result : Unknown 1.12s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : KLE011+1 : TPTP v6.1.0. Released v4.0.0.
% % Command : ./sos-script %s
% % Computer : n016.star.cs.uiowa.edu
% % Model : x86_64 x86_64
% % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory : 16127.75MB
% % OS : Linux 2.6.32-431.17.1.el6.x86_64
% % CPULimit : 300
% % DateTime : Fri Jun 27 09:43:29 CDT 2014
% % CPUTime : 1.12
% ----- Otter 3.2, August 2001 -----
% The process was started by sandbox on n016.star.cs.uiowa.edu,
% Fri Jun 27 09:43:30 2014
% The command was "./sos". The process ID is 55613.
%
% set(prolog_style_variables).
% set(tptp_eq).
% set(auto).
% dependent: set(auto1).
% dependent: set(process_input).
% dependent: clear(print_kept).
% dependent: clear(print_new_demod).
% dependent: clear(print_back_demod).
% dependent: clear(print_back_sub).
% dependent: set(control_memory).
% dependent: assign(max_mem, 12000).
% dependent: assign(pick_given_ratio, 4).
% dependent: assign(stats_level, 1).
% dependent: assign(pick_semantic_ratio, 3).
% dependent: assign(sos_limit, 5000).
% dependent: assign(max_weight, 60).
% clear(print_given).
%
% formula_list(sos).
%
% formula_list(usable).
% WARNING: Sos list not accepted in auto1 mode:
% sos clauses are being moved to usable list.
%
% SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
%
% This ia a non-Horn set with equality. The strategy will be
% Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% unit deletion, with positive clauses in sos and nonpositive
% clauses in usable.
%
% dependent: set(knuth_bendix).
% dependent: set(para_from).
% dependent: set(para_into).
% dependent: clear(para_from_right).
% dependent: clear(para_into_right).
% dependent: set(para_from_vars).
% dependent: set(eq_units_both_ways).
% dependent: set(dynamic_demod_all).
% dependent: set(dynamic_demod).
% dependent: set(order_eq).
% dependent: set(back_demod).
% dependent: set(lrpo).
% dependent: set(hyper_res).
% dependent: set(unit_deletion).
% dependent: set(factor).
%
% ------------> process usable:
%
% ------------> process sos:
% Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] {-} equal(A,A).
% Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] {-} equal(addition(A,B),addition(B,A)).
%
% ======= end of input processing =======
%
% Model 1 (0.00 seconds, 0 Inserts)
%
% Stopped by limit on number of solutions
%
%
% -------------- Softie stats --------------
%
% UPDATE_STOP: 300
% SFINDER_TIME_LIMIT: 2
% SHORT_CLAUSE_CUTOFF: 4
% number of clauses in intial UL: 10
% number of clauses initially in problem: 37
% percentage of clauses intially in UL: 27
% percentage of distinct symbols occuring in initial UL: 83
% percent of all initial clauses that are short: 100
% absolute distinct symbol count: 12
% distinct predicate count: 4
% distinct function count: 4
% distinct constant count: 4
%
% ---------- no more Softie stats ----------
%
%
%
% =========== start of search ===========
%
% Model 2 (0.00 seconds, 0 Inserts)
%
% Stopped by limit on number of solutions
%
% Model 3 (0.00 seconds, 0 Inserts)
%
% Stopped by limit on number of solutions
%
% Model 4 (0.00 seconds, 0 Inserts)
%
% Stopped by limit on number of solutions
%
% Model 5 (0.00 seconds, 0 Inserts)
%
% Stopped by limit on number of solutions
%
% Model 6 (0.00 seconds, 0 Inserts)
%
% Stopped by limit on number of solutions
%
% Model 7 (0.00 seconds, 0 Inserts)
%
% Stopped by limit on number of solutions
%
% Model 8 (0.00 seconds, 0 Inserts)
%
% Stopped by limit on number of solutions
%
% Model 9 (0.00 seconds, 0 Inserts)
%
% Stopped by limit on number of solutions
%
% Model 10 (0.00 seconds, 0 Inserts)
%
% Stopped by limit on number of solutions
%
% Model 11 (0.00 seconds, 0 Inserts)
%
% Stopped by limit on number of solutions
%
% Stopped by limit on insertions
%
% Model 12 [ 8 10 231766 ] (0.00 seconds, 250000 Inserts)
%
% Model 13 (0.00 seconds, 250000 Inserts)
%
% Stopped by limit on number of solutions
% equal(addition(A,addition(B,addition(A,B))),addition(A,B)).
%
% ------------- memory usage ------------
% 40 mallocs of 32700 bytes each, 1277.3 K.
% type (bytes each) gets frees in use avail bytes
% sym_ent ( 300) 126 0 126 0 36.9 K
% term ( 20) 79440 71859 7581 17 148.4 K
% rel ( 20) 59502 45486 14016 18 274.1 K
% term_ptr ( 8) 47665 10302 37363 18 292.0 K
% formula_ptr_2 ( 28) 0 0 0 0 0.0 K
% fpa_head ( 12) 1431 120 1311 3 15.4 K
% fpa_tree ( 28) 14080 14080 0 207 5.7 K
% context ( 776) 26506 26506 0 6 4.5 K
% trail ( 12) 234145 234145 0 6 0.1 K
% imd_tree ( 20) 93 9 84 3 1.7 K
% imd_pos (2016) 9814 9814 0 5 9.8 K
% is_tree ( 12) 2716 113 2603 8 30.6 K
% is_pos (1216) 142132 142132 0 16 19.0 K
% fsub_pos ( 8) 23086 23086 0 1 0.0 K
% literal ( 16) 19161 12671 6490 1 101.4 K
% clause ( 52) 6065 3931 2134 1 108.4 K
% list ( 264) 30 23 7 2 2.3 K
% clash_nd ( 44) 281 281 0 4 0.2 K
% clause_ptr ( 8) 2509 397 2112 4 16.5 K
% int_ptr ( 8) 43428 22892 20536 5 160.5 K
% ci_ptr ( 12) 0 0 0 0 0.0 K
% link_node ( 68) 0 0 0 0 0.0 K
% ans_lit_node( 12) 0 0 0 0 0.0 K
% formula_box( 148) 0 0 0 0 0.0 K
% formula( 20) 120 120 0 64 1.2 K
% formula_ptr( 8) 18 18 0 17 0.1 K
% cl_attribute( 16) 0 0 0 0 0.0 K
%
% ********** is_delete, can't find end.
% 11
%
% ----------- soft-scott stats ----------
%
% true clauses given 48 (36.6%)
% false clauses given 83
%
% FALSE TRUE
% 5 0 1
% 6 0 52
% 7 0 51
% 8 0 43
% 9 21 192
% 10 0 23
% 11 0 41
% 12 69 243
% 13 5 28
% 14 5 70
% 15 54 99
% 16 6 28
% 17 11 37
% 18 4 30
% 19 10 24
% 20 10 24
% 21 21 46
% 22 16 24
% 23 29 41
% 24 44 45
% 25 17 17
% 26 30 38
% 27 5 8
% 28 4 16
% 29 1 6
% 30 1 9
% 31 0 4
% 32 1 2
% 33 1 2
% 34 0 2
% 35 1 1
% 37 1 1
% 39 1 1
% 41 0 1
% 44 1 1
% 46 0 1
% 47 0 1
% tot: 369 1253 (77.3% true)
%
%
% Model 13 (0.00 seconds, 250000 Inserts)
%
% Forward subsumption counts, subsumer:number_subsumed.
% 1:4 2:1 3:0 4:24 5:0 6:0 7:2 8:1 9:0 10:0
% 11:0 12:0 13:0 14:298 15:5 16:0 17:0 18:0 19:0 20:0
% 21:0 22:0 23:0 24:0 25:0 26:0 27:0 28:0 29:0 30:0
% 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:6 40:19
% 41:0 42:11 43:0 44:0 45:0 46:11 47:12 48:8 49:10 50:4
% 51:10 52:19 53:7 54:23 55:0 56:0 57:0 58:0 59:1 60:2
% 61:0 62:0 63:11 64:13 65:4 66:4 67:8 68:10 69:26 70:10
% 71:0 72:0 73:1 74:0 75:0 76:0 77:0 78:1 79:1 80:1
% 81:2 82:2 83:0 84:20 85:0 86:0 87:0 88:0 89:0 90:1
% 91:1 92:1 93:0 94:0 95:1 96:1 97:0 98:0 99:0
% All others: 1806.
%
% ********** ABNORMAL END **********
%
% ********** is_delete, can't find end.
% EOF
%------------------------------------------------------------------------------