TSTP Solution File: GEO039-3 by SOS---2.0

View Problem - Process Solution

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

% Computer : n010.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 2.21s 2.42s
% Output   : Refutation 2.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : GEO039-3 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14  % Command  : sos-script %s
% 0.14/0.36  % Computer : n010.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Sat Jun 18 05:16:53 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.14/0.39  ----- Otter 3.2, August 2001 -----
% 0.14/0.39  The process was started by sandbox on n010.cluster.edu,
% 0.14/0.39  Sat Jun 18 05:16:53 2022
% 0.14/0.39  The command was "./sos".  The process ID is 1059.
% 0.14/0.39  
% 0.14/0.39  set(prolog_style_variables).
% 0.14/0.39  set(auto).
% 0.14/0.39     dependent: set(auto1).
% 0.14/0.39     dependent: set(process_input).
% 0.14/0.39     dependent: clear(print_kept).
% 0.14/0.39     dependent: clear(print_new_demod).
% 0.14/0.39     dependent: clear(print_back_demod).
% 0.14/0.39     dependent: clear(print_back_sub).
% 0.14/0.39     dependent: set(control_memory).
% 0.14/0.39     dependent: assign(max_mem, 12000).
% 0.14/0.39     dependent: assign(pick_given_ratio, 4).
% 0.14/0.39     dependent: assign(stats_level, 1).
% 0.14/0.39     dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.39     dependent: assign(sos_limit, 5000).
% 0.14/0.39     dependent: assign(max_weight, 60).
% 0.14/0.39  clear(print_given).
% 0.14/0.39  
% 0.14/0.39  list(usable).
% 0.14/0.39  
% 0.14/0.39  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.14/0.39  
% 0.14/0.39  This ia a non-Horn set with equality.  The strategy will be
% 0.14/0.39  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.39  unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.39  clauses in usable.
% 0.14/0.39  
% 0.14/0.39     dependent: set(knuth_bendix).
% 0.14/0.39     dependent: set(para_from).
% 0.14/0.39     dependent: set(para_into).
% 0.14/0.39     dependent: clear(para_from_right).
% 0.14/0.39     dependent: clear(para_into_right).
% 0.14/0.39     dependent: set(para_from_vars).
% 0.14/0.39     dependent: set(eq_units_both_ways).
% 0.14/0.39     dependent: set(dynamic_demod_all).
% 0.14/0.39     dependent: set(dynamic_demod).
% 0.14/0.39     dependent: set(order_eq).
% 0.14/0.39     dependent: set(back_demod).
% 0.14/0.39     dependent: set(lrpo).
% 0.14/0.39     dependent: set(hyper_res).
% 0.14/0.39     dependent: set(unit_deletion).
% 0.14/0.39     dependent: set(factor).
% 0.14/0.39  
% 0.14/0.39  ------------> process usable:
% 0.14/0.39  
% 0.14/0.39  ------------> process sos:
% 0.14/0.39    Following clause subsumed by 54 during input processing: 0 [demod,57] {-} between(A,B,extension(A,B,A,B)).
% 0.14/0.39    Following clause subsumed by 55 during input processing: 0 [demod,57] {-} equidistant(A,extension(B,A,B,A),B,A).
% 0.14/0.39    Following clause subsumed by 63 during input processing: 0 [] {-} A=A.
% 0.14/0.39  53 back subsumes 50.
% 0.14/0.39  58 back subsumes 48.
% 0.14/0.39  58 back subsumes 35.
% 0.14/0.39    Following clause subsumed by 63 during input processing: 0 [copy,63,flip.1] {-} A=A.
% 0.14/0.39  63 back subsumes 49.
% 0.14/0.39  64 back subsumes 36.
% 0.14/0.39  71 back subsumes 40.
% 0.14/0.39  71 back subsumes 39.
% 0.14/0.39  
% 0.14/0.39  ======= end of input processing =======
% 0.94/1.16  
% 0.94/1.16  Model 1 (0.00 seconds, 0 Inserts)
% 0.94/1.16  
% 0.94/1.16  Stopped by limit on number of solutions
% 0.94/1.16  
% 0.94/1.16  
% 0.94/1.16  -------------- Softie stats --------------
% 0.94/1.16  
% 0.94/1.16  UPDATE_STOP: 300
% 0.94/1.16  SFINDER_TIME_LIMIT: 2
% 0.94/1.16  SHORT_CLAUSE_CUTOFF: 4
% 0.94/1.16  number of clauses in intial UL: 39
% 0.94/1.16  number of clauses initially in problem: 59
% 0.94/1.16  percentage of clauses intially in UL: 66
% 0.94/1.16  percentage of distinct symbols occuring in initial UL: 68
% 0.94/1.16  percent of all initial clauses that are short: 100
% 0.94/1.16  absolute distinct symbol count: 16
% 0.94/1.16     distinct predicate count: 3
% 0.94/1.16     distinct function count: 6
% 0.94/1.16     distinct constant count: 7
% 0.94/1.16  
% 0.94/1.16  ---------- no more Softie stats ----------
% 0.94/1.16  
% 0.94/1.16  
% 0.94/1.16  
% 0.94/1.16  Model 2 (0.00 seconds, 0 Inserts)
% 0.94/1.16  
% 0.94/1.16  Stopped by limit on number of solutions
% 0.94/1.16  
% 0.94/1.16  =========== start of search ===========
% 2.21/2.42  
% 2.21/2.42  -------- PROOF -------- 
% 2.21/2.42  % SZS status Unsatisfiable
% 2.21/2.42  % SZS output start Refutation
% 2.21/2.42  
% 2.21/2.42  Model 3 (0.00 seconds, 0 Inserts)
% 2.21/2.42  
% 2.21/2.42  Stopped by limit on number of solutions
% 2.21/2.42  
% 2.21/2.42  Model 4 (0.00 seconds, 0 Inserts)
% 2.21/2.42  
% 2.21/2.42  Stopped by limit on number of solutions
% 2.21/2.42  
% 2.21/2.42  Stopped by limit on insertions
% 2.21/2.42  
% 2.21/2.42  Model 5 [ 5 27 115669 ] (0.00 seconds, 250000 Inserts)
% 2.21/2.42  
% 2.21/2.42  ----> UNIT CONFLICT at   2.01 sec ----> 195 [binary,194.1,162.1] {-} $F.
% 2.21/2.42  
% 2.21/2.42  Length of proof is 12.  Level of proof is 6.
% 2.21/2.42  
% 2.21/2.42  ---------------- PROOF ----------------
% 2.21/2.42  % SZS status Unsatisfiable
% 2.21/2.42  % SZS output start Refutation
% 2.21/2.42  
% 2.21/2.42  4 [] {+} -between(A,B,A)|A=B.
% 2.21/2.42  5 [] {+} -between(A,B,C)| -between(D,E,C)|between(B,inner_pasch(A,B,C,E,D),D).
% 2.21/2.42  30 [] {+} -between(A,B,C)| -between(A,B,D)| -equidistant(B,C,B,D)|A=B|C=D.
% 2.21/2.42  34 [] {-} -between(v,w,x).
% 2.21/2.42  38 [factor,5.1.2] {+} -between(A,B,C)|between(B,inner_pasch(A,B,C,B,A),A).
% 2.21/2.42  64 [] {-} equidistant(A,A,B,B).
% 2.21/2.42  71 [] {+} between(A,B,B).
% 2.21/2.42  72 [] {-} between(u,w,x).
% 2.21/2.42  73 [] {-} u=x.
% 2.21/2.42  75,74 [copy,73,flip.1] {+} x=u.
% 2.21/2.42  78 [back_demod,72,demod,75] {+} between(u,w,u).
% 2.21/2.42  79 [back_demod,34,demod,75] {+} -between(v,w,u).
% 2.21/2.42  117 [para_into,79.1.2,30.5.1] {-} -between(v,A,u)| -between(B,C,w)| -between(B,C,A)| -equidistant(C,w,C,A)|B=C.
% 2.21/2.42  123 [para_into,79.1.2,4.2.1] {-} -between(v,A,u)| -between(w,A,w).
% 2.21/2.42  146 [factor,117.1.3,unit_del,71] {+} -between(v,u,w)| -equidistant(u,w,u,u)|v=u.
% 2.21/2.42  158 [hyper,78,38] {-} between(w,inner_pasch(u,w,u,w,u),u).
% 2.21/2.42  161,160 [hyper,78,4,flip.1] {-} w=u.
% 2.21/2.42  162 [back_demod,158,demod,161,161,161] {-} between(u,inner_pasch(u,u,u,u,u),u).
% 2.21/2.42  172,171 [back_demod,146,demod,161,161,unit_del,71,64] {-} v=u.
% 2.21/2.42  194 [back_demod,123,demod,172,161,161,factor_simp] {-} -between(u,A,u).
% 2.21/2.42  195 [binary,194.1,162.1] {-} $F.
% 2.21/2.42  
% 2.21/2.42  % SZS output end Refutation
% 2.21/2.42  ------------ end of proof -------------
% 2.21/2.42  
% 2.21/2.42  
% 2.21/2.42  Search stopped by max_proofs option.
% 2.21/2.42  
% 2.21/2.42  
% 2.21/2.42  Search stopped by max_proofs option.
% 2.21/2.42  
% 2.21/2.42  ============ end of search ============
% 2.21/2.42  
% 2.21/2.42  ----------- soft-scott stats ----------
% 2.21/2.42  
% 2.21/2.42  true clauses given           0      (0.0%)
% 2.21/2.42  false clauses given          4
% 2.21/2.42  
% 2.21/2.42        FALSE     TRUE
% 2.21/2.42     3  0         1
% 2.21/2.42     4  0         1
% 2.21/2.42     5  2         0
% 2.21/2.42     7  1         1
% 2.21/2.42     8  3         2
% 2.21/2.42     9  5         0
% 2.21/2.42    10  2         0
% 2.21/2.42    12  0         2
% 2.21/2.42    13  0         2
% 2.21/2.42    14  0         2
% 2.21/2.42    15  4         0
% 2.21/2.42    16  0         2
% 2.21/2.42    17  3         7
% 2.21/2.42    18  1         0
% 2.21/2.42    19  0         3
% 2.21/2.42    20  6         5
% 2.21/2.42    21  6         1
% 2.21/2.42    22  5         1
% 2.21/2.42    23  3         0
% 2.21/2.42    25  0         1
% 2.21/2.42    26  3         0
% 2.21/2.42    30  0         1
% 2.21/2.42    31  0         3
% 2.21/2.42    33  0         3
% 2.21/2.42    36  0         1
% 2.21/2.42    37  0         3
% 2.21/2.42  tot:  44        42      (48.8% true)
% 2.21/2.42  
% 2.21/2.42  
% 2.21/2.42  Model 5 [ 5 27 115669 ] (0.00 seconds, 250000 Inserts)
% 2.21/2.42  
% 2.21/2.42  That finishes the proof of the theorem.
% 2.21/2.42  
% 2.21/2.42  Process 1059 finished Sat Jun 18 05:16:55 2022
%------------------------------------------------------------------------------