TSTP Solution File: GEO117-1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GEO117-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n007.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:18:15 EDT 2022

% Result   : Unsatisfiable 2.74s 3.00s
% Output   : Refutation 2.74s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GEO117-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12  % Command  : sos-script %s
% 0.13/0.34  % Computer : n007.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 04:36:43 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.36  ----- Otter 3.2, August 2001 -----
% 0.13/0.36  The process was started by sandbox on n007.cluster.edu,
% 0.13/0.36  Sat Jun 18 04:36:43 2022
% 0.13/0.36  The command was "./sos".  The process ID is 11834.
% 0.13/0.36  
% 0.13/0.36  set(prolog_style_variables).
% 0.13/0.36  set(auto).
% 0.13/0.36     dependent: set(auto1).
% 0.13/0.36     dependent: set(process_input).
% 0.13/0.36     dependent: clear(print_kept).
% 0.13/0.36     dependent: clear(print_new_demod).
% 0.13/0.36     dependent: clear(print_back_demod).
% 0.13/0.36     dependent: clear(print_back_sub).
% 0.13/0.36     dependent: set(control_memory).
% 0.13/0.36     dependent: assign(max_mem, 12000).
% 0.13/0.36     dependent: assign(pick_given_ratio, 4).
% 0.13/0.36     dependent: assign(stats_level, 1).
% 0.13/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36     dependent: assign(sos_limit, 5000).
% 0.13/0.36     dependent: assign(max_weight, 60).
% 0.13/0.36  clear(print_given).
% 0.13/0.36  
% 0.13/0.36  list(usable).
% 0.13/0.36  
% 0.13/0.36  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=12.
% 0.13/0.36  
% 0.13/0.36  This ia a non-Horn set with equality.  The strategy will be
% 0.13/0.36  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36  unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36  clauses in usable.
% 0.13/0.36  
% 0.13/0.36     dependent: set(knuth_bendix).
% 0.13/0.36     dependent: set(para_from).
% 0.13/0.36     dependent: set(para_into).
% 0.13/0.36     dependent: clear(para_from_right).
% 0.13/0.36     dependent: clear(para_into_right).
% 0.13/0.36     dependent: set(para_from_vars).
% 0.13/0.36     dependent: set(eq_units_both_ways).
% 0.13/0.36     dependent: set(dynamic_demod_all).
% 0.13/0.36     dependent: set(dynamic_demod).
% 0.13/0.36     dependent: set(order_eq).
% 0.13/0.36     dependent: set(back_demod).
% 0.13/0.36     dependent: set(lrpo).
% 0.13/0.36     dependent: set(hyper_res).
% 0.13/0.36     dependent: set(unit_deletion).
% 0.13/0.36     dependent: set(factor).
% 0.13/0.36  
% 0.13/0.36  ------------> process usable:
% 0.13/0.36  
% 0.13/0.36  ------------> process sos:
% 0.13/0.36    Following clause subsumed by 114 during input processing: 0 [copy,114,flip.1] {-} A=A.
% 0.13/0.36  114 back subsumes 103.
% 0.13/0.36  114 back subsumes 102.
% 0.13/0.36  114 back subsumes 101.
% 0.13/0.36  114 back subsumes 98.
% 0.13/0.36  114 back subsumes 97.
% 0.13/0.36  114 back subsumes 91.
% 0.13/0.36  114 back subsumes 90.
% 0.13/0.36  
% 0.13/0.36  ======= end of input processing =======
% 0.90/1.09  
% 0.90/1.09  Model 1 (0.00 seconds, 0 Inserts)
% 0.90/1.09  
% 0.90/1.09  Stopped by limit on number of solutions
% 0.90/1.09  
% 0.90/1.09  
% 0.90/1.09  -------------- Softie stats --------------
% 0.90/1.09  
% 0.90/1.09  UPDATE_STOP: 300
% 0.90/1.09  SFINDER_TIME_LIMIT: 2
% 0.90/1.09  SHORT_CLAUSE_CUTOFF: 4
% 0.90/1.09  number of clauses in intial UL: 91
% 0.90/1.09  number of clauses initially in problem: 106
% 0.90/1.09  percentage of clauses intially in UL: 85
% 0.90/1.09  percentage of distinct symbols occuring in initial UL: 88
% 0.90/1.09  percent of all initial clauses that are short: 100
% 0.90/1.09  absolute distinct symbol count: 42
% 0.90/1.09     distinct predicate count: 14
% 0.90/1.09     distinct function count: 26
% 0.90/1.09     distinct constant count: 2
% 0.90/1.09  
% 0.90/1.09  ---------- no more Softie stats ----------
% 0.90/1.09  
% 0.90/1.09  
% 0.90/1.09  
% 0.90/1.09  Stopped by limit on insertions
% 0.90/1.09  
% 0.90/1.09  =========== start of search ===========
% 2.74/3.00  
% 2.74/3.00  -------- PROOF -------- 
% 2.74/3.00  % SZS status Unsatisfiable
% 2.74/3.00  % SZS output start Refutation
% 2.74/3.00  
% 2.74/3.00  Stopped by limit on insertions
% 2.74/3.00  
% 2.74/3.00  Model 2 [ 5 32 193243 ] (0.00 seconds, 250000 Inserts)
% 2.74/3.00  
% 2.74/3.00  Stopped by limit on insertions
% 2.74/3.00  
% 2.74/3.00  Model 3 [ 5 9 51419 ] (0.00 seconds, 250000 Inserts)
% 2.74/3.00  
% 2.74/3.00  Stopped by limit on insertions
% 2.74/3.00  
% 2.74/3.00  Model 4 [ 8 8 55015 ] (0.00 seconds, 250000 Inserts)
% 2.74/3.00  
% 2.74/3.00  Stopped by limit on insertions
% 2.74/3.00  
% 2.74/3.00  Model 5 [ 8 6 41354 ] (0.00 seconds, 250000 Inserts)
% 2.74/3.00  
% 2.74/3.00  Stopped by limit on insertions
% 2.74/3.00  
% 2.74/3.00  -----> EMPTY CLAUSE at   2.62 sec ----> 1638 [hyper,114,42,888] {-} $F.
% 2.74/3.00  
% 2.74/3.00  Length of proof is 3.  Level of proof is 3.
% 2.74/3.00  
% 2.74/3.00  ---------------- PROOF ----------------
% 2.74/3.00  % SZS status Unsatisfiable
% 2.74/3.00  % SZS output start Refutation
% 2.74/3.00  
% 2.74/3.00  42 [] {+} -between_c(A,B,C,D)|B!=D.
% 2.74/3.00  52 [] {+} -ordered_by(A,B,C)| -ordered_by(A,C,D)|between_o(A,B,C,D).
% 2.74/3.00  72 [] {+} -between_o(A,B,C,D)|between_c(ax2_sk4(A,D,C,B),B,C,D).
% 2.74/3.00  96 [factor,52.1.2] {+} -ordered_by(A,B,B)|between_o(A,B,B,B).
% 2.74/3.00  113 [] {-} ordered_by(sk25,sk26,sk26).
% 2.74/3.00  114 [] {+} A=A.
% 2.74/3.00  182 [hyper,113,96] {-} between_o(sk25,sk26,sk26,sk26).
% 2.74/3.00  888 [hyper,182,72] {-} between_c(ax2_sk4(sk25,sk26,sk26,sk26),sk26,sk26,sk26).
% 2.74/3.00  1638 [hyper,114,42,888] {-} $F.
% 2.74/3.00  
% 2.74/3.00  % SZS output end Refutation
% 2.74/3.00  ------------ end of proof -------------
% 2.74/3.00  
% 2.74/3.00  
% 2.74/3.00  Search stopped by max_proofs option.
% 2.74/3.00  
% 2.74/3.00  
% 2.74/3.00  Search stopped by max_proofs option.
% 2.74/3.00  
% 2.74/3.00  ============ end of search ============
% 2.74/3.00  
% 2.74/3.00  ----------- soft-scott stats ----------
% 2.74/3.00  
% 2.74/3.00  true clauses given           2      (15.4%)
% 2.74/3.00  false clauses given         11
% 2.74/3.00  
% 2.74/3.00        FALSE     TRUE
% 2.74/3.00     4  0         2
% 2.74/3.00     5  0         1
% 2.74/3.00     6  0         1
% 2.74/3.00     7  0         1
% 2.74/3.00     8  0         5
% 2.74/3.00     9  0         5
% 2.74/3.00    10  1         11
% 2.74/3.00    11  3         10
% 2.74/3.00    12  5         6
% 2.74/3.00    13  11        11
% 2.74/3.00    14  12        14
% 2.74/3.00    15  20        15
% 2.74/3.00    16  10        7
% 2.74/3.00    17  22        26
% 2.74/3.00    18  21        19
% 2.74/3.00    19  60        26
% 2.74/3.00    20  30        37
% 2.74/3.00    21  1         19
% 2.74/3.00    22  21        32
% 2.74/3.00    23  48        19
% 2.74/3.00    24  31        7
% 2.74/3.00    25  15        31
% 2.74/3.00    26  8         34
% 2.74/3.00    27  14        22
% 2.74/3.00    28  15        2
% 2.74/3.00    29  28        19
% 2.74/3.00    30  4         29
% 2.74/3.00    31  12        25
% 2.74/3.00    32  7         22
% 2.74/3.00    33  10        18
% 2.74/3.00    34  15        15
% 2.74/3.00    35  12        23
% 2.74/3.00    36  4         27
% 2.74/3.00    37  19        62
% 2.74/3.00    38  1         15
% 2.74/3.00    39  12        13
% 2.74/3.00    40  9         26
% 2.74/3.00    41  2         10
% 2.74/3.00    42  6         15
% 2.74/3.00    43  22        28
% 2.74/3.00    44  0         17
% 2.74/3.00    45  0         23
% 2.74/3.00    46  6         43
% 2.74/3.00    47  15        2
% 2.74/3.00    48  12        2
% 2.74/3.00    49  6         26
% 2.74/3.00    50  2         14
% 2.74/3.00    51  2         21
% 2.74/3.00    52  0         11
% 2.74/3.00    53  0         2
% 2.74/3.00    54  12        0
% 2.74/3.00    55  12        12
% 2.74/3.00    56  0         16
% 2.74/3.00    57  2         12
% 2.74/3.00    58  2         12
% 2.74/3.00    60  0         2
% 2.74/3.00  tot:  582       925      (61.4% true)
% 2.74/3.00  
% 2.74/3.00  
% 2.74/3.00  Model 5 [ 8 -79 41354 ] (0.00 seconds, 250000 Inserts)
% 2.74/3.00  
% 2.74/3.00  That finishes the proof of the theorem.
% 2.74/3.00  
% 2.74/3.00  Process 11834 finished Sat Jun 18 04:36:45 2022
%------------------------------------------------------------------------------