↑ Up

SOS---2.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GEO026-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n006.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:30 EDT 2022

% Result   : Unsatisfiable 4.19s 4.45s
% Output   : Refutation 4.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO026-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n006.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jun 18 13:49:55 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.36  ----- Otter 3.2, August 2001 -----
% 0.18/0.36  The process was started by sandbox on n006.cluster.edu,
% 0.18/0.36  Sat Jun 18 13:49:55 2022
% 0.18/0.36  The command was "./sos".  The process ID is 8256.
% 0.18/0.36  
% 0.18/0.36  set(prolog_style_variables).
% 0.18/0.36  set(auto).
% 0.18/0.36     dependent: set(auto1).
% 0.18/0.36     dependent: set(process_input).
% 0.18/0.36     dependent: clear(print_kept).
% 0.18/0.36     dependent: clear(print_new_demod).
% 0.18/0.36     dependent: clear(print_back_demod).
% 0.18/0.36     dependent: clear(print_back_sub).
% 0.18/0.36     dependent: set(control_memory).
% 0.18/0.36     dependent: assign(max_mem, 12000).
% 0.18/0.36     dependent: assign(pick_given_ratio, 4).
% 0.18/0.36     dependent: assign(stats_level, 1).
% 0.18/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.36     dependent: assign(sos_limit, 5000).
% 0.18/0.36     dependent: assign(max_weight, 60).
% 0.18/0.36  clear(print_given).
% 0.18/0.36  
% 0.18/0.36  list(usable).
% 0.18/0.36  
% 0.18/0.36  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.18/0.36  
% 0.18/0.36  This ia a non-Horn set with equality.  The strategy will be
% 0.18/0.36  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.18/0.36  unit deletion, with positive clauses in sos and nonpositive
% 0.18/0.36  clauses in usable.
% 0.18/0.36  
% 0.18/0.36     dependent: set(knuth_bendix).
% 0.18/0.36     dependent: set(para_from).
% 0.18/0.36     dependent: set(para_into).
% 0.18/0.36     dependent: clear(para_from_right).
% 0.18/0.36     dependent: clear(para_into_right).
% 0.18/0.36     dependent: set(para_from_vars).
% 0.18/0.36     dependent: set(eq_units_both_ways).
% 0.18/0.36     dependent: set(dynamic_demod_all).
% 0.18/0.36     dependent: set(dynamic_demod).
% 0.18/0.36     dependent: set(order_eq).
% 0.18/0.36     dependent: set(back_demod).
% 0.18/0.36     dependent: set(lrpo).
% 0.18/0.36     dependent: set(hyper_res).
% 0.18/0.36     dependent: set(unit_deletion).
% 0.18/0.36     dependent: set(factor).
% 0.18/0.36  
% 0.18/0.36  ------------> process usable:
% 0.18/0.36  
% 0.18/0.36  ------------> process sos:
% 0.18/0.36    Following clause subsumed by 52 during input processing: 0 [demod,55] {-} between(A,B,extension(A,B,A,B)).
% 0.18/0.36    Following clause subsumed by 53 during input processing: 0 [demod,55] {-} equidistant(A,extension(B,A,B,A),B,A).
% 0.18/0.36    Following clause subsumed by 61 during input processing: 0 [] {-} A=A.
% 0.18/0.36  51 back subsumes 48.
% 0.18/0.36  56 back subsumes 47.
% 0.18/0.36  56 back subsumes 34.
% 0.18/0.36    Following clause subsumed by 61 during input processing: 0 [copy,61,flip.1] {-} A=A.
% 0.18/0.36  62 back subsumes 35.
% 0.18/0.36  
% 0.18/0.36  ======= end of input processing =======
% 1.00/1.21  
% 1.00/1.21  Model 1 (0.00 seconds, 0 Inserts)
% 1.00/1.21  
% 1.00/1.21  Stopped by limit on number of solutions
% 1.00/1.21  
% 1.00/1.21  
% 1.00/1.21  -------------- Softie stats --------------
% 1.00/1.21  
% 1.00/1.21  UPDATE_STOP: 300
% 1.00/1.21  SFINDER_TIME_LIMIT: 2
% 1.00/1.21  SHORT_CLAUSE_CUTOFF: 4
% 1.00/1.21  number of clauses in intial UL: 40
% 1.00/1.21  number of clauses initially in problem: 55
% 1.00/1.21  percentage of clauses intially in UL: 72
% 1.00/1.21  percentage of distinct symbols occuring in initial UL: 93
% 1.00/1.21  percent of all initial clauses that are short: 100
% 1.00/1.21  absolute distinct symbol count: 16
% 1.00/1.21     distinct predicate count: 3
% 1.00/1.21     distinct function count: 6
% 1.00/1.21     distinct constant count: 7
% 1.00/1.21  
% 1.00/1.21  ---------- no more Softie stats ----------
% 1.00/1.21  
% 1.00/1.21  
% 1.00/1.21  
% 1.00/1.21  Model 2 (0.00 seconds, 0 Inserts)
% 1.00/1.21  
% 1.00/1.21  Stopped by limit on number of solutions
% 1.00/1.21  
% 1.00/1.21  =========== start of search ===========
% 4.19/4.45  
% 4.19/4.45  -------- PROOF -------- 
% 4.19/4.45  % SZS status Unsatisfiable
% 4.19/4.45  % SZS output start Refutation
% 4.19/4.45  
% 4.19/4.45  Model 3 (0.00 seconds, 0 Inserts)
% 4.19/4.45  
% 4.19/4.45  Stopped by limit on number of solutions
% 4.19/4.45  
% 4.19/4.45  Stopped by limit on insertions
% 4.19/4.45  
% 4.19/4.45  Model 4 [ 7 16 64381 ] (0.00 seconds, 250000 Inserts)
% 4.19/4.45  
% 4.19/4.45  Stopped by limit on insertions
% 4.19/4.45  
% 4.19/4.45  Model 5 [ 1 59 214123 ] (0.00 seconds, 250000 Inserts)
% 4.19/4.45  
% 4.19/4.45  Stopped by limit on insertions
% 4.19/4.45  
% 4.19/4.45  Model 6 [ 1 21 82834 ] (0.00 seconds, 250000 Inserts)
% 4.19/4.45  
% 4.19/4.45  Stopped by limit on insertions
% 4.19/4.45  
% 4.19/4.45  Model 7 [ 2 63 217964 ] (0.00 seconds, 250000 Inserts)
% 4.19/4.45  
% 4.19/4.45  Stopped by limit on insertions
% 4.19/4.45  
% 4.19/4.45  Model 8 [ 2 24 105075 ] (0.00 seconds, 250000 Inserts)
% 4.19/4.45  
% 4.19/4.45  Stopped by limit on insertions
% 4.19/4.45  
% 4.19/4.45  Model 9 [ 42 29 117664 ] (0.00 seconds, 250000 Inserts)
% 4.19/4.45  
% 4.19/4.45  ----> UNIT CONFLICT at   4.07 sec ----> 582 [binary,580.1,33.1] {+} $F.
% 4.19/4.45  
% 4.19/4.45  Length of proof is 4.  Level of proof is 3.
% 4.19/4.45  
% 4.19/4.45  ---------------- PROOF ----------------
% 4.19/4.45  % SZS status Unsatisfiable
% 4.19/4.45  % SZS output start Refutation
% 4.19/4.45  
% 4.19/4.45  2 [] {+} -equidistant(A,B,C,C)|A=B.
% 4.19/4.45  3 [] {+} -equidistant(A,B,C,D)| -equidistant(B,E,D,F)| -equidistant(A,G,C,H)| -equidistant(B,G,D,H)| -between(A,B,E)| -between(C,D,F)|A=B|equidistant(E,G,F,H).
% 4.19/4.45  30 [] {-} u!=v.
% 4.19/4.45  31 [copy,30,flip.1] {+} v!=u.
% 4.19/4.45  32 [] {-} w!=x.
% 4.19/4.45  33 [copy,32,flip.1] {+} x!=w.
% 4.19/4.45  56 [] {+} equidistant(A,B,A,B).
% 4.19/4.45  63 [] {+} between(u,v,w).
% 4.19/4.45  64 [] {+} between(u,v,x).
% 4.19/4.45  65 [] {+} equidistant(v,w,v,x).
% 4.19/4.45  227 [hyper,65,3,56,56,56,63,64,unit_del,31] {-} equidistant(w,A,x,A).
% 4.19/4.45  580 [hyper,227,2,flip.1] {-} x=w.
% 4.19/4.45  582 [binary,580.1,33.1] {+} $F.
% 4.19/4.45  
% 4.19/4.45  % SZS output end Refutation
% 4.19/4.45  ------------ end of proof -------------
% 4.19/4.45  
% 4.19/4.45  
% 4.19/4.45  Search stopped by max_proofs option.
% 4.19/4.45  
% 4.19/4.45  
% 4.19/4.45  Search stopped by max_proofs option.
% 4.19/4.45  
% 4.19/4.45  ============ end of search ============
% 4.19/4.45  
% 4.19/4.45  ----------- soft-scott stats ----------
% 4.19/4.45  
% 4.19/4.45  true clauses given           4      (28.6%)
% 4.19/4.45  false clauses given         10
% 4.19/4.45  
% 4.19/4.45        FALSE     TRUE
% 4.19/4.45     5  8         5
% 4.19/4.45     7  1         0
% 4.19/4.45     8  3         7
% 4.19/4.45     9  26        35
% 4.19/4.45    10  5         11
% 4.19/4.45    11  0         3
% 4.19/4.45    12  1         1
% 4.19/4.45    13  6         16
% 4.19/4.45    14  4         16
% 4.19/4.45    15  1         0
% 4.19/4.45    16  1         8
% 4.19/4.45    17  8         27
% 4.19/4.45    18  1         24
% 4.19/4.45    19  0         5
% 4.19/4.45    20  1         2
% 4.19/4.45    21  7         18
% 4.19/4.45    22  10        39
% 4.19/4.45    23  1         23
% 4.19/4.45    24  0         13
% 4.19/4.45    26  6         18
% 4.19/4.45    27  8         22
% 4.19/4.45    29  1         3
% 4.19/4.45    30  0         3
% 4.19/4.45    31  3         10
% 4.19/4.45    32  4         8
% 4.19/4.45    33  0         13
% 4.19/4.45    34  3         1
% 4.19/4.45    35  1         1
% 4.19/4.45    36  0         1
% 4.19/4.45    37  0         14
% 4.19/4.45    38  1         13
% 4.19/4.45    39  1         1
% 4.19/4.45    42  0         1
% 4.19/4.45    43  1         1
% 4.19/4.45    44  1         0
% 4.19/4.45    45  0         1
% 4.19/4.45    49  0         1
% 4.19/4.45    50  0         1
% 4.19/4.45  tot:  114       366      (76.2% true)
% 4.19/4.45  
% 4.19/4.45  
% 4.19/4.45  Model 9 [ 42 -15 117664 ] (0.00 seconds, 250000 Inserts)
% 4.19/4.45  
% 4.19/4.45  That finishes the proof of the theorem.
% 4.19/4.45  
% 4.19/4.45  Process 8256 finished Sat Jun 18 13:49:59 2022
%------------------------------------------------------------------------------