TSTP Solution File: SWB008+2 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SWB008+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n019.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 19:20:33 EDT 2022

% Result   : Theorem 0.21s 0.44s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13  % Problem  : SWB008+2 : TPTP v8.1.0. Released v5.2.0.
% 0.10/0.13  % Command  : sos-script %s
% 0.14/0.35  % Computer : n019.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 : Wed Jun  1 02:37:40 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.36  ----- Otter 3.2, August 2001 -----
% 0.14/0.36  The process was started by sandbox on n019.cluster.edu,
% 0.14/0.36  Wed Jun  1 02:37:40 2022
% 0.14/0.36  The command was "./sos".  The process ID is 9080.
% 0.14/0.36  
% 0.14/0.36  set(prolog_style_variables).
% 0.14/0.36  set(auto).
% 0.14/0.36     dependent: set(auto1).
% 0.14/0.36     dependent: set(process_input).
% 0.14/0.36     dependent: clear(print_kept).
% 0.14/0.36     dependent: clear(print_new_demod).
% 0.14/0.36     dependent: clear(print_back_demod).
% 0.14/0.36     dependent: clear(print_back_sub).
% 0.14/0.36     dependent: set(control_memory).
% 0.14/0.36     dependent: assign(max_mem, 12000).
% 0.14/0.36     dependent: assign(pick_given_ratio, 4).
% 0.14/0.36     dependent: assign(stats_level, 1).
% 0.14/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36     dependent: assign(sos_limit, 5000).
% 0.14/0.36     dependent: assign(max_weight, 60).
% 0.14/0.36  clear(print_given).
% 0.14/0.36  
% 0.14/0.36  formula_list(usable).
% 0.14/0.36  
% 0.14/0.36  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.14/0.36  
% 0.14/0.36  This ia a non-Horn set with equality.  The strategy will be
% 0.14/0.36  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.36  unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.36  clauses in usable.
% 0.14/0.36  
% 0.14/0.36     dependent: set(knuth_bendix).
% 0.14/0.36     dependent: set(para_from).
% 0.14/0.36     dependent: set(para_into).
% 0.14/0.36     dependent: clear(para_from_right).
% 0.14/0.36     dependent: clear(para_into_right).
% 0.14/0.36     dependent: set(para_from_vars).
% 0.14/0.36     dependent: set(eq_units_both_ways).
% 0.14/0.36     dependent: set(dynamic_demod_all).
% 0.14/0.36     dependent: set(dynamic_demod).
% 0.14/0.36     dependent: set(order_eq).
% 0.14/0.36     dependent: set(back_demod).
% 0.14/0.36     dependent: set(lrpo).
% 0.14/0.36     dependent: set(hyper_res).
% 0.14/0.36     dependent: set(unit_deletion).
% 0.14/0.36     dependent: set(factor).
% 0.14/0.36  
% 0.14/0.36  ------------> process usable:
% 0.14/0.36  
% 0.14/0.36  ------------> process sos:
% 0.14/0.36    Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] {-} A=A.
% 0.14/0.36  16 back subsumes 11.
% 0.14/0.36  
% 0.14/0.36  ======= end of input processing =======
% 0.14/0.41  
% 0.14/0.41  Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.41  
% 0.14/0.41  Stopped by limit on number of solutions
% 0.14/0.41  
% 0.14/0.41  
% 0.14/0.41  -------------- Softie stats --------------
% 0.14/0.41  
% 0.14/0.41  UPDATE_STOP: 300
% 0.14/0.41  SFINDER_TIME_LIMIT: 2
% 0.14/0.41  SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.41  number of clauses in intial UL: 10
% 0.14/0.41  number of clauses initially in problem: 15
% 0.14/0.41  percentage of clauses intially in UL: 66
% 0.14/0.41  percentage of distinct symbols occuring in initial UL: 75
% 0.14/0.41  percent of all initial clauses that are short: 100
% 0.14/0.41  absolute distinct symbol count: 16
% 0.14/0.41     distinct predicate count: 4
% 0.14/0.41     distinct function count: 4
% 0.14/0.41     distinct constant count: 8
% 0.14/0.41  
% 0.14/0.41  ---------- no more Softie stats ----------
% 0.14/0.41  
% 0.14/0.41  
% 0.14/0.41  
% 0.14/0.41  Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.41  
% 0.14/0.41  Stopped by limit on number of solutions
% 0.14/0.41  
% 0.14/0.41  =========== start of search ===========
% 0.21/0.44  
% 0.21/0.44  -------- PROOF -------- 
% 0.21/0.44  % SZS status Theorem
% 0.21/0.44  % SZS output start Refutation
% 0.21/0.44  
% 0.21/0.44  Model 3 (0.00 seconds, 0 Inserts)
% 0.21/0.44  
% 0.21/0.44  Stopped by limit on number of solutions
% 0.21/0.44  
% 0.21/0.44  ----> UNIT CONFLICT at   0.04 sec ----> 229 [binary,228.1,53.1] {-} $F.
% 0.21/0.44  
% 0.21/0.44  Length of proof is 4.  Level of proof is 3.
% 0.21/0.44  
% 0.21/0.44  ---------------- PROOF ----------------
% 0.21/0.44  % SZS status Theorem
% 0.21/0.44  % SZS output start Refutation
% 0.21/0.44  
% 0.21/0.44  1 [] {+} -iext(uri_rdf_type,A,B)|icext(B,A).
% 0.21/0.44  4 [] {+} iext(uri_owl_sameAs,A,B)|A!=B.
% 0.21/0.44  6 [] {+} -icext(uri_owl_InverseFunctionalProperty,A)| -iext(A,B,C)| -iext(A,D,C)|B=D.
% 0.21/0.44  10 [] {+} -iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert).
% 0.21/0.44  13 [] {+} iext(uri_rdf_type,uri_foaf_mbox_sha1sum,uri_owl_InverseFunctionalProperty).
% 0.21/0.44  14 [] {+} iext(uri_foaf_mbox_sha1sum,uri_ex_bob,literal_plain(dat_str_xyz)).
% 0.21/0.44  15 [] {-} iext(uri_foaf_mbox_sha1sum,uri_ex_robert,literal_plain(dat_str_xyz)).
% 0.21/0.44  16 [] {+} A=A.
% 0.21/0.44  24 [hyper,13,1] {+} icext(uri_owl_InverseFunctionalProperty,uri_foaf_mbox_sha1sum).
% 0.21/0.44  53 [hyper,16,4] {+} iext(uri_owl_sameAs,A,A).
% 0.21/0.44  151,150 [hyper,24,6,15,14] {-} uri_ex_robert=uri_ex_bob.
% 0.21/0.44  228 [back_demod,10,demod,151] {-} -iext(uri_owl_sameAs,uri_ex_bob,uri_ex_bob).
% 0.21/0.44  229 [binary,228.1,53.1] {-} $F.
% 0.21/0.44  
% 0.21/0.44  % SZS output end Refutation
% 0.21/0.44  ------------ end of proof -------------
% 0.21/0.44  
% 0.21/0.44  
% 0.21/0.44  Search stopped by max_proofs option.
% 0.21/0.44  
% 0.21/0.44  
% 0.21/0.44  Search stopped by max_proofs option.
% 0.21/0.44  
% 0.21/0.44  ============ end of search ============
% 0.21/0.44  
% 0.21/0.44  ----------- soft-scott stats ----------
% 0.21/0.44  
% 0.21/0.44  true clauses given           5      (38.5%)
% 0.21/0.44  false clauses given          8
% 0.21/0.44  
% 0.21/0.44        FALSE     TRUE
% 0.21/0.44     4  0         1
% 0.21/0.44     7  0         2
% 0.21/0.44     8  0         6
% 0.21/0.44     9  0         4
% 0.21/0.44    11  0         1
% 0.21/0.44    13  14        2
% 0.21/0.44    14  0         2
% 0.21/0.44    15  0         10
% 0.21/0.44    16  7         12
% 0.21/0.44    17  7         2
% 0.21/0.44    19  0         11
% 0.21/0.44    20  22        9
% 0.21/0.44    23  0         3
% 0.21/0.44    24  6         0
% 0.21/0.44    26  0         4
% 0.21/0.44  tot:  56        69      (55.2% true)
% 0.21/0.44  
% 0.21/0.44  
% 0.21/0.44  Model 3 (0.00 seconds, 0 Inserts)
% 0.21/0.44  
% 0.21/0.44  That finishes the proof of the theorem.
% 0.21/0.44  
% 0.21/0.44  Process 9080 finished Wed Jun  1 02:37:40 2022
%------------------------------------------------------------------------------