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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GEO053-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n022.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:44 EDT 2022

% Result   : Unsatisfiable 0.16s 0.51s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : GEO053-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12  % Command  : sos-script %s
% 0.11/0.31  % Computer : n022.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 600
% 0.11/0.31  % DateTime : Fri Jun 17 16:07:32 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.16/0.34  ----- Otter 3.2, August 2001 -----
% 0.16/0.34  The process was started by sandbox2 on n022.cluster.edu,
% 0.16/0.34  Fri Jun 17 16:07:32 2022
% 0.16/0.34  The command was "./sos".  The process ID is 23913.
% 0.16/0.34  
% 0.16/0.34  set(prolog_style_variables).
% 0.16/0.34  set(auto).
% 0.16/0.34     dependent: set(auto1).
% 0.16/0.34     dependent: set(process_input).
% 0.16/0.34     dependent: clear(print_kept).
% 0.16/0.34     dependent: clear(print_new_demod).
% 0.16/0.34     dependent: clear(print_back_demod).
% 0.16/0.34     dependent: clear(print_back_sub).
% 0.16/0.34     dependent: set(control_memory).
% 0.16/0.34     dependent: assign(max_mem, 12000).
% 0.16/0.34     dependent: assign(pick_given_ratio, 4).
% 0.16/0.34     dependent: assign(stats_level, 1).
% 0.16/0.34     dependent: assign(pick_semantic_ratio, 3).
% 0.16/0.34     dependent: assign(sos_limit, 5000).
% 0.16/0.34     dependent: assign(max_weight, 60).
% 0.16/0.34  clear(print_given).
% 0.16/0.34  
% 0.16/0.34  list(usable).
% 0.16/0.34  
% 0.16/0.34  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.16/0.34  
% 0.16/0.34  This ia a non-Horn set with equality.  The strategy will be
% 0.16/0.34  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.16/0.34  unit deletion, with positive clauses in sos and nonpositive
% 0.16/0.34  clauses in usable.
% 0.16/0.34  
% 0.16/0.34     dependent: set(knuth_bendix).
% 0.16/0.34     dependent: set(para_from).
% 0.16/0.34     dependent: set(para_into).
% 0.16/0.34     dependent: clear(para_from_right).
% 0.16/0.34     dependent: clear(para_into_right).
% 0.16/0.34     dependent: set(para_from_vars).
% 0.16/0.34     dependent: set(eq_units_both_ways).
% 0.16/0.34     dependent: set(dynamic_demod_all).
% 0.16/0.34     dependent: set(dynamic_demod).
% 0.16/0.34     dependent: set(order_eq).
% 0.16/0.34     dependent: set(back_demod).
% 0.16/0.34     dependent: set(lrpo).
% 0.16/0.34     dependent: set(hyper_res).
% 0.16/0.34     dependent: set(unit_deletion).
% 0.16/0.34     dependent: set(factor).
% 0.16/0.34  
% 0.16/0.34  ------------> process usable:
% 0.16/0.34    Following clause subsumed by 36 during input processing: 0 [] {-} -between(A,B,C)| -between(B,A,C)|A=B|B=C.
% 0.16/0.34    Following clause subsumed by 37 during input processing: 0 [] {-} -between(A,B,C)| -between(A,C,B)|A=B|B=C.
% 0.16/0.34  111 back subsumes 88.
% 0.16/0.34  
% 0.16/0.34  ------------> process sos:
% 0.16/0.34    Following clause subsumed by 128 during input processing: 0 [demod,131] {-} between(A,B,extension(A,B,A,B)).
% 0.16/0.34    Following clause subsumed by 129 during input processing: 0 [demod,131] {-} equidistant(A,extension(B,A,B,A),B,A).
% 0.16/0.34    Following clause subsumed by 128 during input processing: 0 [] {-} between(A,B,extension(A,B,lower_dimension_point_1,lower_dimension_point_2)).
% 0.16/0.34    Following clause subsumed by 139 during input processing: 0 [] {-} A=A.
% 0.16/0.34  127 back subsumes 125.
% 0.16/0.34  127 back subsumes 124.
% 0.16/0.34  127 back subsumes 123.
% 0.16/0.34  127 back subsumes 121.
% 0.16/0.34  127 back subsumes 120.
% 0.16/0.34  127 back subsumes 113.
% 0.16/0.34  134 back subsumes 97.
% 0.16/0.34  134 back subsumes 84.
% 0.16/0.34  134 back subsumes 71.
% 0.16/0.34    Following clause subsumed by 139 during input processing: 0 [copy,139,flip.1] {-} A=A.
% 0.16/0.34  139 back subsumes 87.
% 0.16/0.34  139 back subsumes 86.
% 0.16/0.34  139 back subsumes 85.
% 0.16/0.34  140 back subsumes 100.
% 0.16/0.34  140 back subsumes 99.
% 0.16/0.34  140 back subsumes 98.
% 0.16/0.34  140 back subsumes 94.
% 0.16/0.34  140 back subsumes 93.
% 0.16/0.34  140 back subsumes 72.
% 0.16/0.34  147 back subsumes 110.
% 0.16/0.34  147 back subsumes 108.
% 0.16/0.34  147 back subsumes 107.
% 0.16/0.34  147 back subsumes 105.
% 0.16/0.34  147 back subsumes 104.
% 0.16/0.34  147 back subsumes 76.
% 0.16/0.34  147 back subsumes 75.
% 0.16/0.34  148 back subsumes 111.
% 0.16/0.34  148 back subsumes 109.
% 0.16/0.34  148 back subsumes 106.
% 0.16/0.34  148 back subsumes 77.
% 0.16/0.34  
% 0.16/0.34  ======= end of input processing =======
% 0.16/0.41  
% 0.16/0.41  
% 0.16/0.41  Failed to model usable list: disabling FINDER
% 0.16/0.41  
% 0.16/0.41  
% 0.16/0.41  
% 0.16/0.41  -------------- Softie stats --------------
% 0.16/0.41  
% 0.16/0.41  UPDATE_STOP: 300
% 0.16/0.41  SFINDER_TIME_LIMIT: 2
% 0.16/0.41  SHORT_CLAUSE_CUTOFF: 4
% 0.16/0.41  number of clauses in intial UL: 81
% 0.16/0.41  number of clauses initially in problem: 108
% 0.16/0.41  percentage of clauses intially in UL: 75
% 0.16/0.41  percentage of distinct symbols occuring in initial UL: 81
% 0.16/0.41  percent of all initial clauses that are short: 100
% 0.16/0.41  absolute distinct symbol count: 16
% 0.16/0.41     distinct predicate count: 3
% 0.16/0.41     distinct function count: 7
% 0.16/0.41     distinct constant count: 6
% 0.16/0.41  
% 0.16/0.41  ---------- no more Softie stats ----------
% 0.16/0.41  
% 0.16/0.41  
% 0.16/0.41  
% 0.16/0.41  =========== start of search ===========
% 0.16/0.51  
% 0.16/0.51  -------- PROOF -------- 
% 0.16/0.51  % SZS status Unsatisfiable
% 0.16/0.51  % SZS output start Refutation
% 0.16/0.51  
% 0.16/0.51  ----> UNIT CONFLICT at   0.15 sec ----> 777 [binary,775.1,70.1] {-} $F.
% 0.16/0.51  
% 0.16/0.51  Length of proof is 4.  Level of proof is 2.
% 0.16/0.51  
% 0.16/0.51  ---------------- PROOF ----------------
% 0.16/0.51  % SZS status Unsatisfiable
% 0.16/0.51  % SZS output start Refutation
% 0.16/0.51  
% 0.16/0.51  54 [] {+} -between(A,B,C)| -between(D,E,F)| -equidistant(A,B,D,E)| -equidistant(A,C,D,F)|equidistant(B,C,E,F).
% 0.16/0.51  56 [] {+} -between(A,B,C)| -equidistant(A,B,A,D)| -equidistant(C,B,C,D)|B=D.
% 0.16/0.51  69 [] {-} v!=w.
% 0.16/0.51  70 [copy,69,flip.1] {+} w!=v.
% 0.16/0.51  103 [factor,56.2.3] {+} -between(A,B,A)| -equidistant(A,B,A,C)|B=C.
% 0.16/0.51  134 [] {-} equidistant(A,B,A,B).
% 0.16/0.51  147 [] {-} between(A,B,B).
% 0.16/0.51  148 [] {-} between(A,A,B).
% 0.16/0.51  152 [] {-} between(u,v,w).
% 0.16/0.51  153 [] {-} equidistant(u,v,u,w).
% 0.16/0.51  575 [hyper,153,54,147,152,134] {-} equidistant(v,v,v,w).
% 0.16/0.51  775 [hyper,575,103,148,flip.1] {-} w=v.
% 0.16/0.51  777 [binary,775.1,70.1] {-} $F.
% 0.16/0.51  
% 0.16/0.51  % SZS output end Refutation
% 0.16/0.51  ------------ end of proof -------------
% 0.16/0.51  
% 0.16/0.51  
% 0.16/0.51  Search stopped by max_proofs option.
% 0.16/0.51  
% 0.16/0.51  
% 0.16/0.51  Search stopped by max_proofs option.
% 0.16/0.51  
% 0.16/0.51  ============ end of search ============
% 0.16/0.51  
% 0.16/0.51  That finishes the proof of the theorem.
% 0.16/0.51  
% 0.16/0.51  Process 23913 finished Fri Jun 17 16:07:32 2022
%------------------------------------------------------------------------------