TSTP Solution File: GEO040-2 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GEO040-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n032.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:37 EDT 2022

% Result   : Unsatisfiable 4.29s 4.51s
% Output   : Refutation 4.29s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.09  % Problem  : GEO040-2 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.10  % Command  : sos-script %s
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 600
% 0.10/0.29  % DateTime : Fri Jun 17 19:31:46 EDT 2022
% 0.10/0.29  % CPUTime  : 
% 0.10/0.31  ----- Otter 3.2, August 2001 -----
% 0.10/0.31  The process was started by sandbox2 on n032.cluster.edu,
% 0.10/0.31  Fri Jun 17 19:31:46 2022
% 0.10/0.31  The command was "./sos".  The process ID is 19162.
% 0.10/0.31  
% 0.10/0.31  set(prolog_style_variables).
% 0.10/0.31  set(auto).
% 0.10/0.31     dependent: set(auto1).
% 0.10/0.31     dependent: set(process_input).
% 0.10/0.31     dependent: clear(print_kept).
% 0.10/0.31     dependent: clear(print_new_demod).
% 0.10/0.31     dependent: clear(print_back_demod).
% 0.10/0.31     dependent: clear(print_back_sub).
% 0.10/0.31     dependent: set(control_memory).
% 0.10/0.31     dependent: assign(max_mem, 12000).
% 0.10/0.31     dependent: assign(pick_given_ratio, 4).
% 0.10/0.31     dependent: assign(stats_level, 1).
% 0.10/0.31     dependent: assign(pick_semantic_ratio, 3).
% 0.10/0.31     dependent: assign(sos_limit, 5000).
% 0.10/0.31     dependent: assign(max_weight, 60).
% 0.10/0.31  clear(print_given).
% 0.10/0.31  
% 0.10/0.31  list(usable).
% 0.10/0.31  
% 0.10/0.31  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.10/0.31  
% 0.10/0.31  This ia a non-Horn set with equality.  The strategy will be
% 0.10/0.31  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.10/0.31  unit deletion, with positive clauses in sos and nonpositive
% 0.10/0.31  clauses in usable.
% 0.10/0.31  
% 0.10/0.31     dependent: set(knuth_bendix).
% 0.10/0.31     dependent: set(para_from).
% 0.10/0.31     dependent: set(para_into).
% 0.10/0.31     dependent: clear(para_from_right).
% 0.10/0.31     dependent: clear(para_into_right).
% 0.10/0.31     dependent: set(para_from_vars).
% 0.10/0.31     dependent: set(eq_units_both_ways).
% 0.10/0.31     dependent: set(dynamic_demod_all).
% 0.10/0.31     dependent: set(dynamic_demod).
% 0.10/0.31     dependent: set(order_eq).
% 0.10/0.31     dependent: set(back_demod).
% 0.10/0.31     dependent: set(lrpo).
% 0.10/0.31     dependent: set(hyper_res).
% 0.10/0.31     dependent: set(unit_deletion).
% 0.10/0.31     dependent: set(factor).
% 0.10/0.31  
% 0.10/0.31  ------------> process usable:
% 0.10/0.31  
% 0.10/0.31  ------------> process sos:
% 0.10/0.31  36 back subsumes 33.
% 0.10/0.31    Following clause subsumed by 41 during input processing: 0 [copy,41,flip.1] {-} A=A.
% 0.10/0.31  
% 0.10/0.31  ======= end of input processing =======
% 0.37/0.62  
% 0.37/0.62  Model 1 (0.00 seconds, 0 Inserts)
% 0.37/0.62  
% 0.37/0.62  Stopped by limit on number of solutions
% 0.37/0.62  
% 0.37/0.62  
% 0.37/0.62  -------------- Softie stats --------------
% 0.37/0.62  
% 0.37/0.62  UPDATE_STOP: 300
% 0.37/0.62  SFINDER_TIME_LIMIT: 2
% 0.37/0.62  SHORT_CLAUSE_CUTOFF: 4
% 0.37/0.62  number of clauses in intial UL: 33
% 0.37/0.62  number of clauses initially in problem: 39
% 0.37/0.62  percentage of clauses intially in UL: 84
% 0.37/0.62  percentage of distinct symbols occuring in initial UL: 85
% 0.37/0.62  percent of all initial clauses that are short: 100
% 0.37/0.62  absolute distinct symbol count: 14
% 0.37/0.62     distinct predicate count: 3
% 0.37/0.62     distinct function count: 5
% 0.37/0.62     distinct constant count: 6
% 0.37/0.62  
% 0.37/0.62  ---------- no more Softie stats ----------
% 0.37/0.62  
% 0.37/0.62  
% 0.37/0.62  
% 0.37/0.62  Model 2 (0.00 seconds, 0 Inserts)
% 0.37/0.62  
% 0.37/0.62  Stopped by limit on number of solutions
% 0.37/0.62  
% 0.37/0.62  =========== start of search ===========
% 4.29/4.51  
% 4.29/4.51  -------- PROOF -------- 
% 4.29/4.51  % SZS status Unsatisfiable
% 4.29/4.51  % SZS output start Refutation
% 4.29/4.51  
% 4.29/4.51  Model 3 (0.00 seconds, 0 Inserts)
% 4.29/4.51  
% 4.29/4.51  Stopped by limit on number of solutions
% 4.29/4.51  
% 4.29/4.51  Stopped by limit on insertions
% 4.29/4.51  
% 4.29/4.51  Model 4 [ 3 68 212812 ] (0.00 seconds, 250000 Inserts)
% 4.29/4.51  
% 4.29/4.51  Stopped by limit on insertions
% 4.29/4.51  
% 4.29/4.51  Model 5 [ 5 9 25745 ] (0.00 seconds, 250000 Inserts)
% 4.29/4.51  
% 4.29/4.51  Stopped by limit on insertions
% 4.29/4.51  
% 4.29/4.51  Model 6 [ 3 54 180661 ] (0.00 seconds, 250000 Inserts)
% 4.29/4.51  
% 4.29/4.51  Stopped by limit on insertions
% 4.29/4.51  
% 4.29/4.51  Model 7 [ 45 45 153305 ] (0.00 seconds, 250000 Inserts)
% 4.29/4.51  
% 4.29/4.51  Stopped by limit on insertions
% 4.29/4.51  
% 4.29/4.51  Model 8 [ 42 30 135720 ] (0.00 seconds, 250000 Inserts)
% 4.29/4.51  
% 4.29/4.51  ----> UNIT CONFLICT at   4.17 sec ----> 1690 [binary,1688.1,17.1] {-} $F.
% 4.29/4.51  
% 4.29/4.51  Length of proof is 6.  Level of proof is 4.
% 4.29/4.51  
% 4.29/4.51  ---------------- PROOF ----------------
% 4.29/4.51  % SZS status Unsatisfiable
% 4.29/4.51  % SZS output start Refutation
% 4.29/4.51  
% 4.29/4.51  4 [] {+} -between(A,B,A)|A=B.
% 4.29/4.51  5 [] {+} -between(A,B,C)| -between(D,E,C)|between(B,inner_pasch(A,B,C,E,D),D).
% 4.29/4.51  6 [] {+} -between(A,B,C)| -between(D,E,C)|between(E,inner_pasch(A,B,C,E,D),A).
% 4.29/4.51  16 [] {-} u!=v.
% 4.29/4.51  17 [copy,16,flip.1] {+} v!=u.
% 4.29/4.51  39 [] {+} between(u,v,w).
% 4.29/4.51  40 [] {+} between(v,u,w).
% 4.29/4.51  105 [hyper,40,6,39] {-} between(u,inner_pasch(u,v,w,u,v),u).
% 4.29/4.51  107 [hyper,40,5,39] {+} between(v,inner_pasch(u,v,w,u,v),v).
% 4.29/4.51  1641,1640 [hyper,105,4,flip.1] {-} inner_pasch(u,v,w,u,v)=u.
% 4.29/4.51  1642 [back_demod,107,demod,1641] {-} between(v,u,v).
% 4.29/4.51  1688 [hyper,1642,4] {-} v=u.
% 4.29/4.51  1690 [binary,1688.1,17.1] {-} $F.
% 4.29/4.51  
% 4.29/4.51  % SZS output end Refutation
% 4.29/4.51  ------------ end of proof -------------
% 4.29/4.51  
% 4.29/4.51  
% 4.29/4.51  Search stopped by max_proofs option.
% 4.29/4.51  
% 4.29/4.51  
% 4.29/4.51  Search stopped by max_proofs option.
% 4.29/4.51  
% 4.29/4.51  ============ end of search ============
% 4.29/4.51  
% 4.29/4.51  ----------- soft-scott stats ----------
% 4.29/4.51  
% 4.29/4.51  true clauses given           6      (24.0%)
% 4.29/4.51  false clauses given         19
% 4.29/4.51  
% 4.29/4.51        FALSE     TRUE
% 4.29/4.51     7  0         1
% 4.29/4.51     8  1         1
% 4.29/4.51     9  11        23
% 4.29/4.51    10  0         5
% 4.29/4.51    11  2         3
% 4.29/4.51    12  11        13
% 4.29/4.51    13  19        40
% 4.29/4.51    14  11        31
% 4.29/4.51    15  2         0
% 4.29/4.51    16  7         3
% 4.29/4.51    17  14        22
% 4.29/4.51    18  4         14
% 4.29/4.51    19  3         22
% 4.29/4.51    20  5         2
% 4.29/4.51    21  23        59
% 4.29/4.51    22  21        66
% 4.29/4.51    23  8         22
% 4.29/4.51    24  2         12
% 4.29/4.51    25  25        29
% 4.29/4.51    26  38        61
% 4.29/4.51    27  29        82
% 4.29/4.51    28  9         21
% 4.29/4.51    29  3         1
% 4.29/4.51    30  13        16
% 4.29/4.51    31  32        80
% 4.29/4.51    32  11        61
% 4.29/4.51    33  3         23
% 4.29/4.51    34  3         3
% 4.29/4.51    35  5         21
% 4.29/4.51    36  5         58
% 4.29/4.51    37  10        48
% 4.29/4.51    38  1         4
% 4.29/4.51    39  3         1
% 4.29/4.51    40  2         3
% 4.29/4.51    41  13        30
% 4.29/4.51    42  11        43
% 4.29/4.51    43  2         2
% 4.29/4.51    44  1         0
% 4.29/4.51    45  1         0
% 4.29/4.51    46  1         6
% 4.29/4.51    47  2         22
% 4.29/4.51    49  2         3
% 4.29/4.51    50  3         0
% 4.29/4.51    51  0         2
% 4.29/4.51    52  0         22
% 4.29/4.51    55  0         1
% 4.29/4.51    57  0         3
% 4.29/4.51    59  2         0
% 4.29/4.51  tot:  374       985      (72.5% true)
% 4.29/4.51  
% 4.29/4.51  
% 4.29/4.51  Model 8 [ 42 -77 135720 ] (0.00 seconds, 250000 Inserts)
% 4.29/4.51  
% 4.29/4.51  That finishes the proof of the theorem.
% 4.29/4.51  
% 4.29/4.51  Process 19162 finished Fri Jun 17 19:31:50 2022
%------------------------------------------------------------------------------