↑ Up

SOS---2.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GEO036-3 : TPTP v8.1.0. Released v1.0.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 : Sat Jul 16 06:17:35 EDT 2022

% Result   : Unsatisfiable 1.94s 2.15s
% Output   : Refutation 1.94s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GEO036-3 : TPTP v8.1.0. Released v1.0.0.
% 0.13/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 : Sat Jun 18 01:20:58 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.36  ----- Otter 3.2, August 2001 -----
% 0.19/0.36  The process was started by sandbox2 on n003.cluster.edu,
% 0.19/0.36  Sat Jun 18 01:20:58 2022
% 0.19/0.36  The command was "./sos".  The process ID is 3075.
% 0.19/0.36  
% 0.19/0.36  set(prolog_style_variables).
% 0.19/0.36  set(auto).
% 0.19/0.36     dependent: set(auto1).
% 0.19/0.36     dependent: set(process_input).
% 0.19/0.36     dependent: clear(print_kept).
% 0.19/0.36     dependent: clear(print_new_demod).
% 0.19/0.36     dependent: clear(print_back_demod).
% 0.19/0.36     dependent: clear(print_back_sub).
% 0.19/0.36     dependent: set(control_memory).
% 0.19/0.36     dependent: assign(max_mem, 12000).
% 0.19/0.36     dependent: assign(pick_given_ratio, 4).
% 0.19/0.36     dependent: assign(stats_level, 1).
% 0.19/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36     dependent: assign(sos_limit, 5000).
% 0.19/0.36     dependent: assign(max_weight, 60).
% 0.19/0.36  clear(print_given).
% 0.19/0.36  
% 0.19/0.36  list(usable).
% 0.19/0.36  
% 0.19/0.36  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.19/0.36  
% 0.19/0.36  This ia a non-Horn set with equality.  The strategy will be
% 0.19/0.36  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.36  unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.36  clauses in usable.
% 0.19/0.36  
% 0.19/0.36     dependent: set(knuth_bendix).
% 0.19/0.36     dependent: set(para_from).
% 0.19/0.36     dependent: set(para_into).
% 0.19/0.36     dependent: clear(para_from_right).
% 0.19/0.36     dependent: clear(para_into_right).
% 0.19/0.36     dependent: set(para_from_vars).
% 0.19/0.36     dependent: set(eq_units_both_ways).
% 0.19/0.36     dependent: set(dynamic_demod_all).
% 0.19/0.36     dependent: set(dynamic_demod).
% 0.19/0.36     dependent: set(order_eq).
% 0.19/0.36     dependent: set(back_demod).
% 0.19/0.36     dependent: set(lrpo).
% 0.19/0.36     dependent: set(hyper_res).
% 0.19/0.36     dependent: set(unit_deletion).
% 0.19/0.36     dependent: set(factor).
% 0.19/0.36  
% 0.19/0.36  ------------> process usable:
% 0.19/0.36    Following clause subsumed by 36 during input processing: 0 [] {-} -between(A,B,C)| -between(B,A,C)|A=B|B=C.
% 0.19/0.36    Following clause subsumed by 37 during input processing: 0 [] {-} -between(A,B,C)| -between(A,C,B)|A=B|B=C.
% 0.19/0.36  
% 0.19/0.36  ------------> process sos:
% 0.19/0.36    Following clause subsumed by 65 during input processing: 0 [demod,68] {-} between(A,B,extension(A,B,A,B)).
% 0.19/0.36    Following clause subsumed by 66 during input processing: 0 [demod,68] {-} equidistant(A,extension(B,A,B,A),B,A).
% 0.19/0.36    Following clause subsumed by 74 during input processing: 0 [] {-} A=A.
% 0.19/0.36  64 back subsumes 61.
% 0.19/0.36  69 back subsumes 56.
% 0.19/0.36  69 back subsumes 43.
% 0.19/0.36    Following clause subsumed by 74 during input processing: 0 [copy,74,flip.1] {-} A=A.
% 0.19/0.36  74 back subsumes 59.
% 0.19/0.36  74 back subsumes 58.
% 0.19/0.36  74 back subsumes 57.
% 0.19/0.36  75 back subsumes 44.
% 0.19/0.36  82 back subsumes 60.
% 0.19/0.36  82 back subsumes 48.
% 0.19/0.36  82 back subsumes 47.
% 0.19/0.36  83 back subsumes 49.
% 0.19/0.36  
% 0.19/0.36  ======= end of input processing =======
% 0.76/0.99  
% 0.76/0.99  Model 1 (0.00 seconds, 0 Inserts)
% 0.76/0.99  
% 0.76/0.99  Stopped by limit on number of solutions
% 0.76/0.99  
% 0.76/0.99  
% 0.76/0.99  -------------- Softie stats --------------
% 0.76/0.99  
% 0.76/0.99  UPDATE_STOP: 300
% 0.76/0.99  SFINDER_TIME_LIMIT: 2
% 0.76/0.99  SHORT_CLAUSE_CUTOFF: 4
% 0.76/0.99  number of clauses in intial UL: 47
% 0.76/0.99  number of clauses initially in problem: 65
% 0.76/0.99  percentage of clauses intially in UL: 72
% 0.76/0.99  percentage of distinct symbols occuring in initial UL: 91
% 0.76/0.99  percent of all initial clauses that are short: 100
% 0.76/0.99  absolute distinct symbol count: 12
% 0.76/0.99     distinct predicate count: 3
% 0.76/0.99     distinct function count: 6
% 0.76/0.99     distinct constant count: 3
% 0.76/0.99  
% 0.76/0.99  ---------- no more Softie stats ----------
% 0.76/0.99  
% 0.76/0.99  
% 0.76/0.99  
% 0.76/0.99  Model 2 (0.00 seconds, 0 Inserts)
% 0.76/0.99  
% 0.76/0.99  Stopped by limit on number of solutions
% 0.76/0.99  
% 0.76/0.99  =========== start of search ===========
% 1.94/2.15  
% 1.94/2.15  -------- PROOF -------- 
% 1.94/2.15  % SZS status Unsatisfiable
% 1.94/2.15  % SZS output start Refutation
% 1.94/2.15  
% 1.94/2.15  Model 3 (0.00 seconds, 0 Inserts)
% 1.94/2.15  
% 1.94/2.15  Stopped by limit on number of solutions
% 1.94/2.15  
% 1.94/2.15  Model 4 (0.00 seconds, 0 Inserts)
% 1.94/2.15  
% 1.94/2.15  Stopped by limit on number of solutions
% 1.94/2.15  
% 1.94/2.15  Model 5 [ 36 39 172130 ] (0.00 seconds, 179113 Inserts)
% 1.94/2.15  
% 1.94/2.15  ----> UNIT CONFLICT at   1.76 sec ----> 307 [binary,306.1,83.1] {-} $F.
% 1.94/2.15  
% 1.94/2.15  Length of proof is 5.  Level of proof is 5.
% 1.94/2.15  
% 1.94/2.15  ---------------- PROOF ----------------
% 1.94/2.15  % SZS status Unsatisfiable
% 1.94/2.15  % SZS output start Refutation
% 1.94/2.15  
% 1.94/2.15  8 [] {+} -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.94/2.15  9 [] {+} -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.94/2.15  82 [] {+} between(A,B,B).
% 1.94/2.15  83 [] {+} between(A,A,B).
% 1.94/2.15  84 [] {-} lower_dimension_point_1=lower_dimension_point_2|lower_dimension_point_2=lower_dimension_point_3|lower_dimension_point_1=lower_dimension_point_3.
% 1.94/2.15  85 [copy,84,flip.1,flip.2,flip.3] {-} lower_dimension_point_2=lower_dimension_point_1|lower_dimension_point_3=lower_dimension_point_2|lower_dimension_point_3=lower_dimension_point_1.
% 1.94/2.15  236 [para_from,85.1.1,9.1.3,unit_del,82] {-} lower_dimension_point_3=lower_dimension_point_2|lower_dimension_point_3=lower_dimension_point_1.
% 1.94/2.15  303,302 [para_from,236.1.1,8.1.2,unit_del,83] {-} lower_dimension_point_3=lower_dimension_point_1.
% 1.94/2.15  305,304 [para_from,236.2.1,9.1.1,demod,303,unit_del,83,flip.1] {-} lower_dimension_point_2=lower_dimension_point_1.
% 1.94/2.15  306 [back_demod,9,demod,303,305] {-} -between(lower_dimension_point_1,lower_dimension_point_1,lower_dimension_point_1).
% 1.94/2.15  307 [binary,306.1,83.1] {-} $F.
% 1.94/2.15  
% 1.94/2.15  % SZS output end Refutation
% 1.94/2.15  ------------ end of proof -------------
% 1.94/2.15  
% 1.94/2.15  
% 1.94/2.15  Search stopped by max_proofs option.
% 1.94/2.15  
% 1.94/2.15  
% 1.94/2.15  Search stopped by max_proofs option.
% 1.94/2.15  
% 1.94/2.15  ============ end of search ============
% 1.94/2.15  
% 1.94/2.15  ----------- soft-scott stats ----------
% 1.94/2.15  
% 1.94/2.15  true clauses given           3      (30.0%)
% 1.94/2.15  false clauses given          7
% 1.94/2.15  
% 1.94/2.15        FALSE     TRUE
% 1.94/2.15     4  0         1
% 1.94/2.15     5  0         1
% 1.94/2.15     6  2         0
% 1.94/2.15     7  0         1
% 1.94/2.15     8  0         2
% 1.94/2.15     9  7         2
% 1.94/2.15    10  1         2
% 1.94/2.15    11  0         1
% 1.94/2.15    12  0         3
% 1.94/2.15    13  1         2
% 1.94/2.15    14  1         3
% 1.94/2.15    15  1         4
% 1.94/2.15    16  0         6
% 1.94/2.15    17  2         4
% 1.94/2.15    18  0         2
% 1.94/2.15    19  0         4
% 1.94/2.15    20  0         7
% 1.94/2.15    21  3         3
% 1.94/2.15    22  1         1
% 1.94/2.15    23  0         3
% 1.94/2.15    24  1         2
% 1.94/2.15    25  1         2
% 1.94/2.15    27  1         0
% 1.94/2.15    28  0         4
% 1.94/2.15    29  4         1
% 1.94/2.15    30  0         1
% 1.94/2.15    31  0         1
% 1.94/2.15    33  0         3
% 1.94/2.15    34  3         0
% 1.94/2.15    35  0         1
% 1.94/2.15    36  1         1
% 1.94/2.15    37  0         1
% 1.94/2.15    38  0         1
% 1.94/2.15    39  1         1
% 1.94/2.15    42  0         1
% 1.94/2.15    43  1         1
% 1.94/2.15    44  1         0
% 1.94/2.15    45  0         1
% 1.94/2.15    49  0         1
% 1.94/2.15    50  1         0
% 1.94/2.15  tot:  34        75      (68.8% true)
% 1.94/2.15  
% 1.94/2.15  
% 1.94/2.15  Model 5 [ 36 39 172130 ] (0.00 seconds, 179113 Inserts)
% 1.94/2.15  
% 1.94/2.15  That finishes the proof of the theorem.
% 1.94/2.15  
% 1.94/2.15  Process 3075 finished Sat Jun 18 01:20:59 2022
%------------------------------------------------------------------------------