↑ Up

SOS---2.0.THM-Ref.s

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

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

% Result   : Theorem 1.95s 2.22s
% Output   : Refutation 1.95s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SWB010+2 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.13/0.33  % Computer : n024.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Wed Jun  1 14:30:21 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.35  ----- Otter 3.2, August 2001 -----
% 0.19/0.35  The process was started by sandbox2 on n024.cluster.edu,
% 0.19/0.35  Wed Jun  1 14:30:21 2022
% 0.19/0.35  The command was "./sos".  The process ID is 2414.
% 0.19/0.35  
% 0.19/0.35  set(prolog_style_variables).
% 0.19/0.35  set(auto).
% 0.19/0.35     dependent: set(auto1).
% 0.19/0.35     dependent: set(process_input).
% 0.19/0.35     dependent: clear(print_kept).
% 0.19/0.35     dependent: clear(print_new_demod).
% 0.19/0.35     dependent: clear(print_back_demod).
% 0.19/0.35     dependent: clear(print_back_sub).
% 0.19/0.35     dependent: set(control_memory).
% 0.19/0.35     dependent: assign(max_mem, 12000).
% 0.19/0.35     dependent: assign(pick_given_ratio, 4).
% 0.19/0.35     dependent: assign(stats_level, 1).
% 0.19/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35     dependent: assign(sos_limit, 5000).
% 0.19/0.35     dependent: assign(max_weight, 60).
% 0.19/0.35  clear(print_given).
% 0.19/0.35  
% 0.19/0.35  formula_list(usable).
% 0.19/0.35  
% 0.19/0.35  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.19/0.35  
% 0.19/0.35  This ia a non-Horn set with equality.  The strategy will be
% 0.19/0.35  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.35  unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.35  clauses in usable.
% 0.19/0.35  
% 0.19/0.35     dependent: set(knuth_bendix).
% 0.19/0.35     dependent: set(para_from).
% 0.19/0.35     dependent: set(para_into).
% 0.19/0.35     dependent: clear(para_from_right).
% 0.19/0.35     dependent: clear(para_into_right).
% 0.19/0.35     dependent: set(para_from_vars).
% 0.19/0.35     dependent: set(eq_units_both_ways).
% 0.19/0.35     dependent: set(dynamic_demod_all).
% 0.19/0.35     dependent: set(dynamic_demod).
% 0.19/0.35     dependent: set(order_eq).
% 0.19/0.35     dependent: set(back_demod).
% 0.19/0.35     dependent: set(lrpo).
% 0.19/0.35     dependent: set(hyper_res).
% 0.19/0.35     dependent: set(unit_deletion).
% 0.19/0.35     dependent: set(factor).
% 0.19/0.35  
% 0.19/0.35  ------------> process usable:
% 0.19/0.35  
% 0.19/0.35  ------------> process sos:
% 0.19/0.35  30 back subsumes 4.
% 0.19/0.35    Following clause subsumed by 39 during input processing: 0 [copy,39,flip.1] {-} A=A.
% 0.19/0.35  
% 0.19/0.35  ======= end of input processing =======
% 0.19/0.54  
% 0.19/0.54  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.54  
% 0.19/0.54  Stopped by limit on number of solutions
% 0.19/0.54  
% 0.19/0.54  
% 0.19/0.54  -------------- Softie stats --------------
% 0.19/0.54  
% 0.19/0.54  UPDATE_STOP: 300
% 0.19/0.54  SFINDER_TIME_LIMIT: 2
% 0.19/0.54  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.54  number of clauses in intial UL: 28
% 0.19/0.54  number of clauses initially in problem: 38
% 0.19/0.54  percentage of clauses intially in UL: 73
% 0.19/0.54  percentage of distinct symbols occuring in initial UL: 83
% 0.19/0.54  percent of all initial clauses that are short: 100
% 0.19/0.54  absolute distinct symbol count: 30
% 0.19/0.54     distinct predicate count: 6
% 0.19/0.54     distinct function count: 3
% 0.19/0.54     distinct constant count: 21
% 0.19/0.54  
% 0.19/0.54  ---------- no more Softie stats ----------
% 0.19/0.54  
% 0.19/0.54  
% 0.19/0.54  
% 0.19/0.54  Stopped by limit on insertions
% 0.19/0.54  
% 0.19/0.54  =========== start of search ===========
% 1.95/2.22  
% 1.95/2.22  -------- PROOF -------- 
% 1.95/2.22  % SZS status Theorem
% 1.95/2.22  % SZS output start Refutation
% 1.95/2.22  
% 1.95/2.22  Stopped by limit on insertions
% 1.95/2.22  
% 1.95/2.22  Stopped by limit on insertions
% 1.95/2.22  
% 1.95/2.22  Model 2 [ 3 1 2671 ] (0.00 seconds, 250000 Inserts)
% 1.95/2.22  
% 1.95/2.22  Stopped by limit on insertions
% 1.95/2.22  
% 1.95/2.22  Stopped by limit on insertions
% 1.95/2.22  
% 1.95/2.22  Model 3 [ 1 0 3368 ] (0.00 seconds, 250000 Inserts)
% 1.95/2.22  
% 1.95/2.22  Stopped by limit on insertions
% 1.95/2.22  
% 1.95/2.22  Model 4 [ 1 1 3238 ] (0.00 seconds, 250000 Inserts)
% 1.95/2.22  
% 1.95/2.22  Stopped by limit on insertions
% 1.95/2.22  
% 1.95/2.22  Stopped by limit on insertions
% 1.95/2.22  
% 1.95/2.22  Model 5 [ 5 1 11159 ] (0.00 seconds, 250000 Inserts)
% 1.95/2.22  
% 1.95/2.22  Stopped by limit on insertions
% 1.95/2.22  
% 1.95/2.22  Stopped by limit on insertions
% 1.95/2.22  
% 1.95/2.22  Model 6 [ 5 1 21903 ] (0.00 seconds, 250000 Inserts)
% 1.95/2.22  
% 1.95/2.22  Stopped by limit on insertions
% 1.95/2.22  
% 1.95/2.22  Stopped by limit on insertions
% 1.95/2.22  
% 1.95/2.22  Model 7 [ 5 1 14187 ] (0.00 seconds, 250000 Inserts)
% 1.95/2.22  
% 1.95/2.22  Stopped by limit on insertions
% 1.95/2.22  
% 1.95/2.22  Model 8 [ 5 2 37364 ] (0.00 seconds, 250000 Inserts)
% 1.95/2.22  
% 1.95/2.22  Stopped by limit on insertions
% 1.95/2.22  
% 1.95/2.22  Model 9 [ 6 1 7643 ] (0.00 seconds, 250000 Inserts)
% 1.95/2.22  
% 1.95/2.22  -----> EMPTY CLAUSE at   1.83 sec ----> 1339 [hyper,1333,9,35,78] {-} $F.
% 1.95/2.22  
% 1.95/2.22  Length of proof is 14.  Level of proof is 6.
% 1.95/2.22  
% 1.95/2.22  ---------------- PROOF ----------------
% 1.95/2.22  % SZS status Theorem
% 1.95/2.22  % SZS output start Refutation
% 1.95/2.22  
% 1.95/2.22  1 [] {+} -iext(uri_rdf_type,A,B)|icext(B,A).
% 1.95/2.22  2 [] {+} iext(uri_rdf_type,A,B)| -icext(B,A).
% 1.95/2.22  3 [] {+} -iext(uri_owl_sourceIndividual,A,B)|icext(uri_owl_NegativePropertyAssertion,A).
% 1.95/2.22  6 [] {+} -iext(uri_owl_onProperty,A,B)|ip(B).
% 1.95/2.22  9 [] {+} -iext(uri_owl_complementOf,A,B)| -icext(A,C)| -icext(B,C).
% 1.95/2.22  13 [] {+} -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,uri_rdf_nil)| -iext(uri_owl_oneOf,C,A)|icext(C,D)|D!=B.
% 1.95/2.22  16 [] {+} -iext(uri_owl_allValuesFrom,A,B)| -iext(uri_owl_onProperty,A,C)| -icext(A,D)| -iext(C,D,E)|icext(B,E).
% 1.95/2.22  19 [] {+} -ir(A)| -ip(B)| -ir(C)|iext(B,A,C)|iext(uri_owl_sourceIndividual,$f3(B,A,C),A).
% 1.95/2.22  20 [] {+} -ir(A)| -ip(B)| -ir(C)|iext(B,A,C)|iext(uri_owl_assertionProperty,$f3(B,A,C),B).
% 1.95/2.22  21 [] {+} -ir(A)| -ip(B)| -ir(C)|iext(B,A,C)|iext(uri_owl_targetIndividual,$f3(B,A,C),C).
% 1.95/2.22  22 [] {+} -iext(uri_rdf_type,A,uri_owl_NegativePropertyAssertion)| -iext(uri_owl_sourceIndividual,A,uri_ex_s)| -iext(uri_owl_assertionProperty,A,uri_ex_p)| -iext(uri_owl_targetIndividual,A,uri_ex_o).
% 1.95/2.22  30 [] {-} ir(A).
% 1.95/2.22  32 [] {+} iext(uri_rdf_type,uri_ex_s,$c4).
% 1.95/2.22  33 [] {-} iext(uri_owl_onProperty,$c4,uri_ex_p).
% 1.95/2.22  34 [] {+} iext(uri_owl_allValuesFrom,$c4,$c3).
% 1.95/2.22  35 [] {-} iext(uri_owl_complementOf,$c3,$c2).
% 1.95/2.22  36 [] {+} iext(uri_owl_oneOf,$c2,$c1).
% 1.95/2.22  37 [] {+} iext(uri_rdf_first,$c1,uri_ex_o).
% 1.95/2.22  38 [] {+} iext(uri_rdf_rest,$c1,uri_rdf_nil).
% 1.95/2.22  39 [] {+} A=A.
% 1.95/2.22  40 [hyper,33,6] {+} ip(uri_ex_p).
% 1.95/2.22  56 [hyper,40,21,30,30] {-} iext(uri_ex_p,A,B)|iext(uri_owl_targetIndividual,$f3(uri_ex_p,A,B),B).
% 1.95/2.22  57 [hyper,40,20,30,30] {-} iext(uri_ex_p,A,B)|iext(uri_owl_assertionProperty,$f3(uri_ex_p,A,B),uri_ex_p).
% 1.95/2.22  58 [hyper,40,19,30,30] {-} iext(uri_ex_p,A,B)|iext(uri_owl_sourceIndividual,$f3(uri_ex_p,A,B),A).
% 1.95/2.22  60 [hyper,32,1] {-} icext($c4,uri_ex_s).
% 1.95/2.22  78 [hyper,38,13,37,36,39] {+} icext($c2,uri_ex_o).
% 1.95/2.22  533 [hyper,57,16,34,33,60] {-} iext(uri_owl_assertionProperty,$f3(uri_ex_p,uri_ex_s,A),uri_ex_p)|icext($c3,A).
% 1.95/2.22  546 [hyper,533,9,35,78] {-} iext(uri_owl_assertionProperty,$f3(uri_ex_p,uri_ex_s,uri_ex_o),uri_ex_p).
% 1.95/2.22  693 [hyper,58,16,34,33,60] {-} iext(uri_owl_sourceIndividual,$f3(uri_ex_p,uri_ex_s,A),uri_ex_s)|icext($c3,A).
% 1.95/2.22  695 [hyper,58,3] {-} iext(uri_ex_p,A,B)|icext(uri_owl_NegativePropertyAssertion,$f3(uri_ex_p,A,B)).
% 1.95/2.22  705 [hyper,693,9,35,78] {-} iext(uri_owl_sourceIndividual,$f3(uri_ex_p,uri_ex_s,uri_ex_o),uri_ex_s).
% 1.95/2.22  788 [hyper,695,2] {-} iext(uri_ex_p,A,B)|iext(uri_rdf_type,$f3(uri_ex_p,A,B),uri_owl_NegativePropertyAssertion).
% 1.95/2.22  1318 [hyper,788,22,705,546,56,factor_simp] {+} iext(uri_ex_p,uri_ex_s,uri_ex_o).
% 1.95/2.22  1333 [hyper,1318,16,34,33,60] {+} icext($c3,uri_ex_o).
% 1.95/2.22  1339 [hyper,1333,9,35,78] {-} $F.
% 1.95/2.22  
% 1.95/2.22  % SZS output end Refutation
% 1.95/2.22  ------------ end of proof -------------
% 1.95/2.22  
% 1.95/2.22  
% 1.95/2.22  Search stopped by max_proofs option.
% 1.95/2.22  
% 1.95/2.22  
% 1.95/2.22  Search stopped by max_proofs option.
% 1.95/2.22  
% 1.95/2.22  ============ end of search ============
% 1.95/2.22  
% 1.95/2.22  ----------- soft-scott stats ----------
% 1.95/2.22  
% 1.95/2.22  true clauses given          32      (37.6%)
% 1.95/2.22  false clauses given         53
% 1.95/2.22  
% 1.95/2.22        FALSE     TRUE
% 1.95/2.22     6  1         3
% 1.95/2.22     7  5         36
% 1.95/2.22     8  0         1
% 1.95/2.22     9  0         16
% 1.95/2.22    10  4         32
% 1.95/2.22    11  0         10
% 1.95/2.22    12  1         8
% 1.95/2.22    13  2         63
% 1.95/2.22    14  10        77
% 1.95/2.22    15  1         1
% 1.95/2.22    16  2         4
% 1.95/2.22    17  8         15
% 1.95/2.22    18  8         18
% 1.95/2.22    19  1         29
% 1.95/2.22    20  0         17
% 1.95/2.22    21  0         45
% 1.95/2.22    22  0         172
% 1.95/2.22    23  0         16
% 1.95/2.22    24  0         8
% 1.95/2.22    25  0         98
% 1.95/2.22    26  0         234
% 1.95/2.22    28  0         12
% 1.95/2.22    29  0         12
% 1.95/2.22    30  0         156
% 1.95/2.22    32  0         5
% 1.95/2.22    34  0         72
% 1.95/2.22  tot:  43        1160      (96.4% true)
% 1.95/2.22  
% 1.95/2.22  
% 1.95/2.22  Model 9 [ 6 1 7643 ] (0.00 seconds, 250000 Inserts)
% 1.95/2.22  
% 1.95/2.22  That finishes the proof of the theorem.
% 1.95/2.22  
% 1.95/2.22  Process 2414 finished Wed Jun  1 14:30:23 2022
%------------------------------------------------------------------------------