↑ Up

SOS---2.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GEO069-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n009.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:53 EDT 2022

% Result   : Unsatisfiable 0.86s 1.06s
% Output   : Refutation 0.86s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : GEO069-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n009.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 Jun 18 15:42:52 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.37  ----- Otter 3.2, August 2001 -----
% 0.18/0.37  The process was started by sandbox2 on n009.cluster.edu,
% 0.18/0.37  Sat Jun 18 15:42:53 2022
% 0.18/0.37  The command was "./sos".  The process ID is 23308.
% 0.18/0.37  
% 0.18/0.37  set(prolog_style_variables).
% 0.18/0.37  set(auto).
% 0.18/0.37     dependent: set(auto1).
% 0.18/0.37     dependent: set(process_input).
% 0.18/0.37     dependent: clear(print_kept).
% 0.18/0.37     dependent: clear(print_new_demod).
% 0.18/0.37     dependent: clear(print_back_demod).
% 0.18/0.37     dependent: clear(print_back_sub).
% 0.18/0.37     dependent: set(control_memory).
% 0.18/0.37     dependent: assign(max_mem, 12000).
% 0.18/0.37     dependent: assign(pick_given_ratio, 4).
% 0.18/0.37     dependent: assign(stats_level, 1).
% 0.18/0.37     dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.37     dependent: assign(sos_limit, 5000).
% 0.18/0.37     dependent: assign(max_weight, 60).
% 0.18/0.37  clear(print_given).
% 0.18/0.37  
% 0.18/0.37  list(usable).
% 0.18/0.37  
% 0.18/0.37  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.18/0.37  
% 0.18/0.37  This ia a non-Horn set with equality.  The strategy will be
% 0.18/0.37  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.18/0.37  unit deletion, with positive clauses in sos and nonpositive
% 0.18/0.37  clauses in usable.
% 0.18/0.37  
% 0.18/0.37     dependent: set(knuth_bendix).
% 0.18/0.37     dependent: set(para_from).
% 0.18/0.37     dependent: set(para_into).
% 0.18/0.37     dependent: clear(para_from_right).
% 0.18/0.37     dependent: clear(para_into_right).
% 0.18/0.37     dependent: set(para_from_vars).
% 0.18/0.37     dependent: set(eq_units_both_ways).
% 0.18/0.37     dependent: set(dynamic_demod_all).
% 0.18/0.37     dependent: set(dynamic_demod).
% 0.18/0.37     dependent: set(order_eq).
% 0.18/0.37     dependent: set(back_demod).
% 0.18/0.37     dependent: set(lrpo).
% 0.18/0.37     dependent: set(hyper_res).
% 0.18/0.37     dependent: set(unit_deletion).
% 0.18/0.37     dependent: set(factor).
% 0.18/0.37  
% 0.18/0.37  ------------> process usable:
% 0.18/0.37    Following clause subsumed by 40 during input processing: 0 [] {-} -between(A,B,C)| -between(B,A,C)|A=B|B=C.
% 0.18/0.37    Following clause subsumed by 41 during input processing: 0 [] {-} -between(A,B,C)| -between(A,C,B)|A=B|B=C.
% 0.18/0.37  131 back subsumes 108.
% 0.18/0.37  
% 0.18/0.37  ------------> process sos:
% 0.18/0.37    Following clause subsumed by 153 during input processing: 0 [demod,156] {-} between(A,B,extension(A,B,A,B)).
% 0.18/0.37    Following clause subsumed by 154 during input processing: 0 [demod,156] {-} equidistant(A,extension(B,A,B,A),B,A).
% 0.18/0.37    Following clause subsumed by 153 during input processing: 0 [] {-} between(A,B,extension(A,B,lower_dimension_point_1,lower_dimension_point_2)).
% 0.18/0.37    Following clause subsumed by 164 during input processing: 0 [] {-} A=A.
% 0.18/0.37  152 back subsumes 150.
% 0.18/0.37  152 back subsumes 149.
% 0.18/0.37  152 back subsumes 148.
% 0.18/0.37  152 back subsumes 146.
% 0.18/0.37  152 back subsumes 145.
% 0.18/0.37  152 back subsumes 138.
% 0.18/0.37  159 back subsumes 117.
% 0.18/0.37  159 back subsumes 104.
% 0.18/0.37  159 back subsumes 90.
% 0.18/0.37    Following clause subsumed by 164 during input processing: 0 [copy,164,flip.1] {-} A=A.
% 0.18/0.37  164 back subsumes 107.
% 0.18/0.37  164 back subsumes 106.
% 0.18/0.37  164 back subsumes 105.
% 0.18/0.37  165 back subsumes 120.
% 0.18/0.37  165 back subsumes 119.
% 0.18/0.37  165 back subsumes 118.
% 0.18/0.37  165 back subsumes 114.
% 0.18/0.37  165 back subsumes 113.
% 0.18/0.37  165 back subsumes 91.
% 0.18/0.37  172 back subsumes 130.
% 0.18/0.37  172 back subsumes 128.
% 0.18/0.37  172 back subsumes 127.
% 0.18/0.37  172 back subsumes 125.
% 0.18/0.37  172 back subsumes 124.
% 0.18/0.37  172 back subsumes 103.
% 0.18/0.37  172 back subsumes 95.
% 0.18/0.37  172 back subsumes 94.
% 0.18/0.37  173 back subsumes 131.
% 0.18/0.37  173 back subsumes 129.
% 0.18/0.37  173 back subsumes 126.
% 0.18/0.37  173 back subsumes 96.
% 0.18/0.37  177 back subsumes 135.
% 0.18/0.37  177 back subsumes 133.
% 0.18/0.37  179 back subsumes 137.
% 0.18/0.37  179 back subsumes 136.
% 0.18/0.37  179 back subsumes 134.
% 0.18/0.37  
% 0.18/0.37  ======= end of input processing =======
% 0.18/0.47  
% 0.18/0.47  
% 0.18/0.47  Failed to model usable list: disabling FINDER
% 0.18/0.47  
% 0.18/0.47  
% 0.18/0.47  
% 0.18/0.47  -------------- Softie stats --------------
% 0.18/0.47  
% 0.18/0.47  UPDATE_STOP: 300
% 0.18/0.47  SFINDER_TIME_LIMIT: 2
% 0.18/0.47  SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.47  number of clauses in intial UL: 100
% 0.18/0.47  number of clauses initially in problem: 130
% 0.18/0.47  percentage of clauses intially in UL: 76
% 0.18/0.47  percentage of distinct symbols occuring in initial UL: 88
% 0.18/0.47  percent of all initial clauses that are short: 100
% 0.18/0.47  absolute distinct symbol count: 18
% 0.18/0.47     distinct predicate count: 4
% 0.18/0.47     distinct function count: 7
% 0.18/0.47     distinct constant count: 7
% 0.18/0.47  
% 0.18/0.47  ---------- no more Softie stats ----------
% 0.18/0.47  
% 0.18/0.47  
% 0.18/0.47  
% 0.18/0.47  =========== start of search ===========
% 0.86/1.06  
% 0.86/1.06  -------- PROOF -------- 
% 0.86/1.06  % SZS status Unsatisfiable
% 0.86/1.06  % SZS output start Refutation
% 0.86/1.06  
% 0.86/1.06  -----> EMPTY CLAUSE at   0.68 sec ----> 2450 [hyper,1654,89,1452] {-} $F.
% 0.86/1.06  
% 0.86/1.06  Length of proof is 7.  Level of proof is 3.
% 0.86/1.06  
% 0.86/1.06  ---------------- PROOF ----------------
% 0.86/1.06  % SZS status Unsatisfiable
% 0.86/1.06  % SZS output start Refutation
% 0.86/1.06  
% 0.86/1.06  77 [] {+} -colinear(A,B,C)|colinear(C,B,A).
% 0.86/1.06  78 [] {+} -colinear(A,B,C)|colinear(B,C,A).
% 0.86/1.06  85 [] {+} -colinear(A,B,C)| -colinear(A,B,D)|colinear(A,C,D)|A=B.
% 0.86/1.06  86 [] {+} -colinear(A,B,C)| -colinear(A,B,D)|colinear(B,C,D)|A=B.
% 0.86/1.06  87 [] {-} u!=v.
% 0.86/1.06  88 [copy,87,flip.1] {+} v!=u.
% 0.86/1.06  89 [] {+} -colinear(x,w,u)| -colinear(x,w,v).
% 0.86/1.06  180 [] {-} colinear(w,v,u).
% 0.86/1.06  181 [] {-} colinear(x,v,u).
% 0.86/1.06  310 [hyper,180,78] {-} colinear(v,u,w).
% 0.86/1.06  404 [hyper,181,78] {-} colinear(v,u,x).
% 0.86/1.06  1271 [hyper,404,86,310,unit_del,88] {-} colinear(u,w,x).
% 0.86/1.06  1273 [hyper,404,85,310,unit_del,88] {-} colinear(v,w,x).
% 0.86/1.06  1452 [hyper,1271,77] {-} colinear(x,w,u).
% 0.86/1.06  1654 [hyper,1273,77] {-} colinear(x,w,v).
% 0.86/1.06  2450 [hyper,1654,89,1452] {-} $F.
% 0.86/1.06  
% 0.86/1.06  % SZS output end Refutation
% 0.86/1.06  ------------ end of proof -------------
% 0.86/1.06  
% 0.86/1.06  
% 0.86/1.06  Search stopped by max_proofs option.
% 0.86/1.06  
% 0.86/1.06  
% 0.86/1.06  Search stopped by max_proofs option.
% 0.86/1.06  
% 0.86/1.06  ============ end of search ============
% 0.86/1.06  
% 0.86/1.06  That finishes the proof of the theorem.
% 0.86/1.06  
% 0.86/1.06  Process 23308 finished Sat Jun 18 15:42:53 2022
%------------------------------------------------------------------------------