↑ Up

SOS---2.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GEO035-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n008.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:34 EDT 2022

% Result   : Unsatisfiable 2.01s 2.26s
% Output   : Refutation 2.01s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : GEO035-2 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14  % Command  : sos-script %s
% 0.14/0.35  % Computer : n008.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Sat Jun 18 02:18:07 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.37  ----- Otter 3.2, August 2001 -----
% 0.14/0.37  The process was started by sandbox on n008.cluster.edu,
% 0.14/0.37  Sat Jun 18 02:18:07 2022
% 0.14/0.37  The command was "./sos".  The process ID is 24043.
% 0.14/0.37  
% 0.14/0.37  set(prolog_style_variables).
% 0.14/0.37  set(auto).
% 0.14/0.37     dependent: set(auto1).
% 0.14/0.37     dependent: set(process_input).
% 0.14/0.37     dependent: clear(print_kept).
% 0.14/0.37     dependent: clear(print_new_demod).
% 0.14/0.37     dependent: clear(print_back_demod).
% 0.14/0.37     dependent: clear(print_back_sub).
% 0.14/0.37     dependent: set(control_memory).
% 0.14/0.37     dependent: assign(max_mem, 12000).
% 0.14/0.37     dependent: assign(pick_given_ratio, 4).
% 0.14/0.37     dependent: assign(stats_level, 1).
% 0.14/0.37     dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37     dependent: assign(sos_limit, 5000).
% 0.14/0.37     dependent: assign(max_weight, 60).
% 0.14/0.37  clear(print_given).
% 0.14/0.37  
% 0.14/0.37  list(usable).
% 0.14/0.37  
% 0.14/0.37  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.14/0.37  
% 0.14/0.37  This ia a non-Horn set with equality.  The strategy will be
% 0.14/0.37  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.37  unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.37  clauses in usable.
% 0.14/0.37  
% 0.14/0.37     dependent: set(knuth_bendix).
% 0.14/0.37     dependent: set(para_from).
% 0.14/0.37     dependent: set(para_into).
% 0.14/0.37     dependent: clear(para_from_right).
% 0.14/0.37     dependent: clear(para_into_right).
% 0.14/0.37     dependent: set(para_from_vars).
% 0.14/0.37     dependent: set(eq_units_both_ways).
% 0.14/0.37     dependent: set(dynamic_demod_all).
% 0.14/0.37     dependent: set(dynamic_demod).
% 0.14/0.37     dependent: set(order_eq).
% 0.14/0.37     dependent: set(back_demod).
% 0.14/0.37     dependent: set(lrpo).
% 0.14/0.37     dependent: set(hyper_res).
% 0.14/0.37     dependent: set(unit_deletion).
% 0.14/0.37     dependent: set(factor).
% 0.14/0.37  
% 0.14/0.37  ------------> process usable:
% 0.14/0.37  
% 0.14/0.37  ------------> process sos:
% 0.14/0.37  36 back subsumes 33.
% 0.14/0.37    Following clause subsumed by 39 during input processing: 0 [copy,39,flip.1] {-} A=A.
% 0.14/0.37  
% 0.14/0.37  ======= end of input processing =======
% 0.22/0.48  
% 0.22/0.48  Model 1 (0.00 seconds, 0 Inserts)
% 0.22/0.48  
% 0.22/0.48  Stopped by limit on number of solutions
% 0.22/0.48  
% 0.22/0.48  
% 0.22/0.48  -------------- Softie stats --------------
% 0.22/0.48  
% 0.22/0.48  UPDATE_STOP: 300
% 0.22/0.48  SFINDER_TIME_LIMIT: 2
% 0.22/0.48  SHORT_CLAUSE_CUTOFF: 4
% 0.22/0.48  number of clauses in intial UL: 33
% 0.22/0.48  number of clauses initially in problem: 37
% 0.22/0.48  percentage of clauses intially in UL: 89
% 0.22/0.48  percentage of distinct symbols occuring in initial UL: 100
% 0.22/0.48  percent of all initial clauses that are short: 100
% 0.22/0.48  absolute distinct symbol count: 14
% 0.22/0.48     distinct predicate count: 3
% 0.22/0.48     distinct function count: 5
% 0.22/0.48     distinct constant count: 6
% 0.22/0.48  
% 0.22/0.48  ---------- no more Softie stats ----------
% 0.22/0.48  
% 0.22/0.48  
% 0.22/0.48  
% 0.22/0.48  Model 2 (0.00 seconds, 0 Inserts)
% 0.22/0.48  
% 0.22/0.48  Stopped by limit on number of solutions
% 0.22/0.48  
% 0.22/0.48  =========== start of search ===========
% 2.01/2.26  
% 2.01/2.26  -------- PROOF -------- 
% 2.01/2.26  % SZS status Unsatisfiable
% 2.01/2.26  % SZS output start Refutation
% 2.01/2.26  
% 2.01/2.26  Stopped by limit on insertions
% 2.01/2.26  
% 2.01/2.26  Model 3 [ 2 46 133690 ] (0.00 seconds, 250000 Inserts)
% 2.01/2.26  
% 2.01/2.26  Stopped by limit on insertions
% 2.01/2.26  
% 2.01/2.26  Model 4 [ 2 60 241725 ] (0.00 seconds, 250000 Inserts)
% 2.01/2.26  
% 2.01/2.26  ----> UNIT CONFLICT at   1.86 sec ----> 77 [binary,75.1,17.1] {-} $F.
% 2.01/2.26  
% 2.01/2.26  Length of proof is 2.  Level of proof is 1.
% 2.01/2.26  
% 2.01/2.26  ---------------- PROOF ----------------
% 2.01/2.26  % SZS status Unsatisfiable
% 2.01/2.26  % SZS output start Refutation
% 2.01/2.26  
% 2.01/2.26  2 [] {+} -equidistant(A,B,C,C)|A=B.
% 2.01/2.26  16 [] {-} v!=extension(u,v,w,w).
% 2.01/2.26  17 [copy,16,flip.1] {+} extension(u,v,w,w)!=v.
% 2.01/2.26  38 [] {-} equidistant(A,extension(B,A,C,D),C,D).
% 2.01/2.26  75 [hyper,38,2,flip.1] {-} extension(A,B,C,C)=B.
% 2.01/2.26  77 [binary,75.1,17.1] {-} $F.
% 2.01/2.26  
% 2.01/2.26  % SZS output end Refutation
% 2.01/2.26  ------------ end of proof -------------
% 2.01/2.26  
% 2.01/2.26  
% 2.01/2.26  Search stopped by max_proofs option.
% 2.01/2.26  
% 2.01/2.26  
% 2.01/2.26  Search stopped by max_proofs option.
% 2.01/2.26  
% 2.01/2.26  ============ end of search ============
% 2.01/2.26  
% 2.01/2.26  ----------- soft-scott stats ----------
% 2.01/2.26  
% 2.01/2.26  true clauses given           0      (0.0%)
% 2.01/2.26  false clauses given          4
% 2.01/2.26  
% 2.01/2.26        FALSE     TRUE
% 2.01/2.26     3  0         1
% 2.01/2.26    13  0         3
% 2.01/2.26    16  0         1
% 2.01/2.26    17  0         1
% 2.01/2.26    19  0         1
% 2.01/2.26    20  0         1
% 2.01/2.26    22  0         1
% 2.01/2.26    24  0         1
% 2.01/2.26    30  0         3
% 2.01/2.26    33  0         3
% 2.01/2.26    34  0         1
% 2.01/2.26    35  0         1
% 2.01/2.26    37  0         2
% 2.01/2.26    38  0         1
% 2.01/2.26    39  0         1
% 2.01/2.26    40  0         1
% 2.01/2.26    42  0         1
% 2.01/2.26    43  0         1
% 2.01/2.26    44  0         1
% 2.01/2.26    49  0         1
% 2.01/2.26  tot:  0         27      (100.0% true)
% 2.01/2.26  
% 2.01/2.26  
% 2.01/2.26  Model 4 [ 2 -3 241725 ] (0.00 seconds, 250000 Inserts)
% 2.01/2.26  
% 2.01/2.26  That finishes the proof of the theorem.
% 2.01/2.26  
% 2.01/2.26  Process 24043 finished Sat Jun 18 02:18:09 2022
%------------------------------------------------------------------------------