↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n025.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 : Tue Jul 19 05:15:08 EDT 2022

% Result   : Unsatisfiable 0.57s 0.83s
% Output   : Refutation 0.57s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem  : SET062-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.13/0.14  % Command  : sos-script %s
% 0.14/0.36  % Computer : n025.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 : Sun Jul 10 01:18:46 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 sandbox2 on n025.cluster.edu,
% 0.14/0.39  Sun Jul 10 01:18:46 2022
% 0.14/0.39  The command was "./sos".  The process ID is 22538.
% 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=5.
% 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 135 during input processing: 0 [copy,135,flip.1] {-} A=A.
% 0.14/0.39  135 back subsumes 61.
% 0.14/0.39  
% 0.14/0.39  ======= end of input processing =======
% 0.45/0.66  
% 0.45/0.66  Stopped by limit on insertions
% 0.45/0.66  
% 0.45/0.66  
% 0.45/0.66  Failed to model usable list: disabling FINDER
% 0.45/0.66  
% 0.45/0.66  
% 0.45/0.66  
% 0.45/0.66  -------------- Softie stats --------------
% 0.45/0.66  
% 0.45/0.66  UPDATE_STOP: 300
% 0.45/0.66  SFINDER_TIME_LIMIT: 2
% 0.45/0.66  SHORT_CLAUSE_CUTOFF: 4
% 0.45/0.66  number of clauses in intial UL: 49
% 0.45/0.66  number of clauses initially in problem: 119
% 0.45/0.66  percentage of clauses intially in UL: 41
% 0.45/0.66  percentage of distinct symbols occuring in initial UL: 63
% 0.45/0.66  percent of all initial clauses that are short: 100
% 0.45/0.66  absolute distinct symbol count: 49
% 0.45/0.66     distinct predicate count: 10
% 0.45/0.66     distinct function count: 30
% 0.45/0.66     distinct constant count: 9
% 0.45/0.66  
% 0.45/0.66  ---------- no more Softie stats ----------
% 0.45/0.66  
% 0.45/0.66  
% 0.45/0.66  
% 0.45/0.66  =========== start of search ===========
% 0.57/0.83  
% 0.57/0.83  -------- PROOF -------- 
% 0.57/0.83  % SZS status Unsatisfiable
% 0.57/0.83  % SZS output start Refutation
% 0.57/0.83  
% 0.57/0.83  ----> UNIT CONFLICT at   0.42 sec ----> 5570 [binary,5569.1,60.1] {-} $F.
% 0.57/0.83  
% 0.57/0.83  Length of proof is 6.  Level of proof is 5.
% 0.57/0.83  
% 0.57/0.83  ---------------- PROOF ----------------
% 0.57/0.83  % SZS status Unsatisfiable
% 0.57/0.83  % SZS output start Refutation
% 0.57/0.83  
% 0.57/0.83  2 [] {+} -member(not_subclass_element(A,B),B)|subclass(A,B).
% 0.57/0.83  4 [] {+} A!=B|subclass(B,A).
% 0.57/0.83  15 [] {+} -member(A,intersection(B,C))|member(A,B).
% 0.57/0.83  60 [] {+} -subclass(null_class,x).
% 0.57/0.83  69 [] {-} member(not_subclass_element(A,B),A)|subclass(A,B).
% 0.57/0.83  119 [] {-} A=null_class|intersection(A,regular(A))=null_class.
% 0.57/0.83  135 [] {-} A=A.
% 0.57/0.83  154 [hyper,69,60] {-} member(not_subclass_element(null_class,x),null_class).
% 0.57/0.83  221 [hyper,135,4] {-} subclass(A,A).
% 0.57/0.83  5152 [para_from,119.1.1,60.1.2,unit_del,221] {-} intersection(x,regular(x))=null_class.
% 0.57/0.83  5451 [para_from,5152.1.1,15.1.2] {-} -member(A,null_class)|member(A,x).
% 0.57/0.83  5454 [hyper,5451,154] {-} member(not_subclass_element(null_class,x),x).
% 0.57/0.83  5569 [hyper,5454,2] {-} subclass(null_class,x).
% 0.57/0.83  5570 [binary,5569.1,60.1] {-} $F.
% 0.57/0.83  
% 0.57/0.83  % SZS output end Refutation
% 0.57/0.83  ------------ end of proof -------------
% 0.57/0.83  
% 0.57/0.83  
% 0.57/0.83  Search stopped by max_proofs option.
% 0.57/0.83  
% 0.57/0.83  
% 0.57/0.83  Search stopped by max_proofs option.
% 0.57/0.83  
% 0.57/0.83  ============ end of search ============
% 0.57/0.83  
% 0.57/0.83  That finishes the proof of the theorem.
% 0.57/0.83  
% 0.57/0.83  Process 22538 finished Sun Jul 10 01:18:46 2022
%------------------------------------------------------------------------------