↑ Up

SOS---2.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SET051-6 : TPTP v8.1.0. Bugfixed v2.1.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 : Tue Jul 19 05:14:55 EDT 2022

% Result   : Unsatisfiable 5.84s 6.04s
% Output   : Refutation 5.84s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SET051-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n003.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 Jul  9 16:13:58 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.35  ----- Otter 3.2, August 2001 -----
% 0.18/0.35  The process was started by sandbox2 on n003.cluster.edu,
% 0.18/0.35  Sat Jul  9 16:13:58 2022
% 0.18/0.35  The command was "./sos".  The process ID is 23683.
% 0.18/0.35  
% 0.18/0.35  set(prolog_style_variables).
% 0.18/0.35  set(auto).
% 0.18/0.35     dependent: set(auto1).
% 0.18/0.35     dependent: set(process_input).
% 0.18/0.35     dependent: clear(print_kept).
% 0.18/0.35     dependent: clear(print_new_demod).
% 0.18/0.35     dependent: clear(print_back_demod).
% 0.18/0.35     dependent: clear(print_back_sub).
% 0.18/0.35     dependent: set(control_memory).
% 0.18/0.35     dependent: assign(max_mem, 12000).
% 0.18/0.35     dependent: assign(pick_given_ratio, 4).
% 0.18/0.35     dependent: assign(stats_level, 1).
% 0.18/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.35     dependent: assign(sos_limit, 5000).
% 0.18/0.35     dependent: assign(max_weight, 60).
% 0.18/0.35  clear(print_given).
% 0.18/0.35  
% 0.18/0.35  list(usable).
% 0.18/0.35  
% 0.18/0.35  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.18/0.35  
% 0.18/0.35  This ia a non-Horn set with equality.  The strategy will be
% 0.18/0.35  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.18/0.35  unit deletion, with positive clauses in sos and nonpositive
% 0.18/0.35  clauses in usable.
% 0.18/0.35  
% 0.18/0.35     dependent: set(knuth_bendix).
% 0.18/0.35     dependent: set(para_from).
% 0.18/0.35     dependent: set(para_into).
% 0.18/0.35     dependent: clear(para_from_right).
% 0.18/0.35     dependent: clear(para_into_right).
% 0.18/0.35     dependent: set(para_from_vars).
% 0.18/0.35     dependent: set(eq_units_both_ways).
% 0.18/0.35     dependent: set(dynamic_demod_all).
% 0.18/0.35     dependent: set(dynamic_demod).
% 0.18/0.35     dependent: set(order_eq).
% 0.18/0.35     dependent: set(back_demod).
% 0.18/0.35     dependent: set(lrpo).
% 0.18/0.35     dependent: set(hyper_res).
% 0.18/0.35     dependent: set(unit_deletion).
% 0.18/0.35     dependent: set(factor).
% 0.18/0.35  
% 0.18/0.35  ------------> process usable:
% 0.18/0.35  
% 0.18/0.35  ------------> process sos:
% 0.18/0.35    Following clause subsumed by 136 during input processing: 0 [copy,136,flip.1] {-} A=A.
% 0.18/0.35  136 back subsumes 61.
% 0.18/0.35  
% 0.18/0.35  ======= end of input processing =======
% 0.84/1.04  
% 0.84/1.04  Model 1 (0.00 seconds, 0 Inserts)
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on number of solutions
% 0.84/1.04  
% 0.84/1.04  
% 0.84/1.04  -------------- Softie stats --------------
% 0.84/1.04  
% 0.84/1.04  UPDATE_STOP: 300
% 0.84/1.04  SFINDER_TIME_LIMIT: 2
% 0.84/1.04  SHORT_CLAUSE_CUTOFF: 4
% 0.84/1.04  number of clauses in intial UL: 49
% 0.84/1.04  number of clauses initially in problem: 120
% 0.84/1.04  percentage of clauses intially in UL: 40
% 0.84/1.04  percentage of distinct symbols occuring in initial UL: 61
% 0.84/1.04  percent of all initial clauses that are short: 100
% 0.84/1.04  absolute distinct symbol count: 52
% 0.84/1.04     distinct predicate count: 10
% 0.84/1.04     distinct function count: 30
% 0.84/1.04     distinct constant count: 12
% 0.84/1.04  
% 0.84/1.04  ---------- no more Softie stats ----------
% 0.84/1.04  
% 0.84/1.04  
% 0.84/1.04  
% 0.84/1.04  Stopped by limit on insertions
% 0.84/1.04  
% 0.84/1.04  =========== start of search ===========
% 5.84/6.04  
% 5.84/6.04  -------- PROOF -------- 
% 5.84/6.04  % SZS status Unsatisfiable
% 5.84/6.04  % SZS output start Refutation
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Model 2 [ 14 1 7910 ] (0.00 seconds, 250000 Inserts)
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Model 3 [ 13 1 5536 ] (0.00 seconds, 250000 Inserts)
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Model 4 [ 9 2 13230 ] (0.00 seconds, 250000 Inserts)
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Model 5 [ 15 1 8448 ] (0.00 seconds, 250000 Inserts)
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Model 6 [ 9 2 17885 ] (0.00 seconds, 250000 Inserts)
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Model 7 [ 20 0 529 ] (0.00 seconds, 250000 Inserts)
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Model 8 [ 12 2 18305 ] (0.00 seconds, 250000 Inserts)
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  Model 9 [ 37 1 3545 ] (0.00 seconds, 250000 Inserts)
% 5.84/6.04  
% 5.84/6.04  Stopped by limit on insertions
% 5.84/6.04  
% 5.84/6.04  ----> UNIT CONFLICT at   5.66 sec ----> 1344 [binary,1343.1,60.1] {-} $F.
% 5.84/6.04  
% 5.84/6.04  Length of proof is 3.  Level of proof is 3.
% 5.84/6.04  
% 5.84/6.04  ---------------- PROOF ----------------
% 5.84/6.04  % SZS status Unsatisfiable
% 5.84/6.04  % SZS output start Refutation
% 5.84/6.04  
% 5.84/6.04  1 [] {+} -subclass(A,B)| -member(C,A)|member(C,B).
% 5.84/6.04  8 [] {+} -member(A,universal_class)|member(A,unordered_pair(B,A)).
% 5.84/6.04  10 [] {+} -member(ordered_pair(A,B),cross_product(C,D))|member(B,D).
% 5.84/6.04  60 [] {+} -member(y,unordered_pair(x,y)).
% 5.84/6.04  70 [] {-} subclass(A,universal_class).
% 5.84/6.04  135 [] {-} member(ordered_pair(x,y),cross_product(u,v)).
% 5.84/6.04  1203 [hyper,135,10] {+} member(y,v).
% 5.84/6.04  1290 [hyper,1203,1,70] {-} member(y,universal_class).
% 5.84/6.04  1343 [hyper,1290,8] {-} member(y,unordered_pair(A,y)).
% 5.84/6.04  1344 [binary,1343.1,60.1] {-} $F.
% 5.84/6.04  
% 5.84/6.04  % SZS output end Refutation
% 5.84/6.04  ------------ end of proof -------------
% 5.84/6.04  
% 5.84/6.04  
% 5.84/6.04  Search stopped by max_proofs option.
% 5.84/6.04  
% 5.84/6.04  
% 5.84/6.04  Search stopped by max_proofs option.
% 5.84/6.04  
% 5.84/6.04  ============ end of search ============
% 5.84/6.04  
% 5.84/6.04  ----------- soft-scott stats ----------
% 5.84/6.04  
% 5.84/6.04  true clauses given           5      (13.2%)
% 5.84/6.04  false clauses given         33
% 5.84/6.04  
% 5.84/6.04        FALSE     TRUE
% 5.84/6.04     3  0         1
% 5.84/6.04     5  3         1
% 5.84/6.04     6  3         0
% 5.84/6.04     7  42        18
% 5.84/6.04     8  26        21
% 5.84/6.04     9  130       37
% 5.84/6.04    10  8         76
% 5.84/6.04    11  138       63
% 5.84/6.04    12  12        29
% 5.84/6.04    13  77        92
% 5.84/6.04    14  13        31
% 5.84/6.04    15  14        60
% 5.84/6.04    16  10        6
% 5.84/6.04    17  7         35
% 5.84/6.04    18  3         11
% 5.84/6.04    19  10        10
% 5.84/6.04    20  7         8
% 5.84/6.04    21  5         9
% 5.84/6.04    22  8         3
% 5.84/6.04    23  4         9
% 5.84/6.04    24  0         4
% 5.84/6.04    25  0         2
% 5.84/6.04    26  2         4
% 5.84/6.04    27  1         23
% 5.84/6.04    28  0         2
% 5.84/6.04    29  0         11
% 5.84/6.04    30  0         6
% 5.84/6.04    31  2         10
% 5.84/6.04    32  0         11
% 5.84/6.04    33  0         3
% 5.84/6.04    34  1         8
% 5.84/6.04    36  0         1
% 5.84/6.04    37  0         1
% 5.84/6.04    39  0         1
% 5.84/6.04    46  0         2
% 5.84/6.04    48  0         4
% 5.84/6.04    50  0         2
% 5.84/6.04    55  0         1
% 5.84/6.04    57  0         2
% 5.84/6.04    59  0         1
% 5.84/6.04  tot:  526       619      (54.1% true)
% 5.84/6.04  
% 5.84/6.04  
% 5.84/6.04  Model 9 [ 37 -10 3545 ] (0.00 seconds, 250000 Inserts)
% 5.84/6.04  
% 5.84/6.04  That finishes the proof of the theorem.
% 5.84/6.04  
% 5.84/6.04  Process 23683 finished Sat Jul  9 16:14:04 2022
%------------------------------------------------------------------------------