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

View Problem - Process Solution

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

% Computer : n029.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:35 EDT 2022

% Result   : Theorem 169.98s 170.19s
% Output   : Refutation 169.98s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWB013+2 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.13/0.33  % Computer : n029.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 11:32:15 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 13.12/13.29  ----- Otter 3.2, August 2001 -----
% 13.12/13.29  The process was started by sandbox2 on n029.cluster.edu,
% 13.12/13.29  Wed Jun  1 11:32:15 2022
% 13.12/13.29  The command was "./sos".  The process ID is 10777.
% 13.12/13.29  
% 13.12/13.29  set(prolog_style_variables).
% 13.12/13.29  set(auto).
% 13.12/13.29     dependent: set(auto1).
% 13.12/13.29     dependent: set(process_input).
% 13.12/13.29     dependent: clear(print_kept).
% 13.12/13.29     dependent: clear(print_new_demod).
% 13.12/13.29     dependent: clear(print_back_demod).
% 13.12/13.29     dependent: clear(print_back_sub).
% 13.12/13.29     dependent: set(control_memory).
% 13.12/13.29     dependent: assign(max_mem, 12000).
% 13.12/13.29     dependent: assign(pick_given_ratio, 4).
% 13.12/13.29     dependent: assign(stats_level, 1).
% 13.12/13.29     dependent: assign(pick_semantic_ratio, 3).
% 13.12/13.29     dependent: assign(sos_limit, 5000).
% 13.12/13.29     dependent: assign(max_weight, 60).
% 13.12/13.29  clear(print_given).
% 13.12/13.29  
% 13.12/13.29  formula_list(usable).
% 13.12/13.29  
% 13.12/13.29  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=12.
% 13.12/13.29  
% 13.12/13.29  This ia a non-Horn set with equality.  The strategy will be
% 13.12/13.29  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 13.12/13.29  unit deletion, with positive clauses in sos and nonpositive
% 13.12/13.29  clauses in usable.
% 13.12/13.29  
% 13.12/13.29     dependent: set(knuth_bendix).
% 13.12/13.29     dependent: set(para_from).
% 13.12/13.29     dependent: set(para_into).
% 13.12/13.29     dependent: clear(para_from_right).
% 13.12/13.29     dependent: clear(para_into_right).
% 13.12/13.29     dependent: set(para_from_vars).
% 13.12/13.29     dependent: set(eq_units_both_ways).
% 13.12/13.29     dependent: set(dynamic_demod_all).
% 13.12/13.29     dependent: set(dynamic_demod).
% 13.12/13.29     dependent: set(order_eq).
% 13.12/13.29     dependent: set(back_demod).
% 13.12/13.29     dependent: set(lrpo).
% 13.12/13.29     dependent: set(hyper_res).
% 13.12/13.29     dependent: set(unit_deletion).
% 13.12/13.29     dependent: set(factor).
% 13.12/13.29  
% 13.12/13.29  ------------> process usable:
% 13.12/13.29  1227 back subsumes 1221.
% 13.12/13.29  1240 back subsumes 1032.
% 13.12/13.29  1344 back subsumes 1264.
% 13.12/13.29  1344 back subsumes 1262.
% 13.12/13.29  1347 back subsumes 1289.
% 13.12/13.29  1455 back subsumes 1287.
% 13.12/13.29  1887 back subsumes 1801.
% 13.12/13.29  
% 13.12/13.29  ------------> process sos:
% 13.12/13.29    Following clause subsumed by 1990 during input processing: 0 [copy,1990,flip.1] {-} A=A.
% 13.12/13.29  
% 13.12/13.29  ======= end of input processing =======
% 24.04/24.26  
% 24.04/24.26  Model 1 (0.00 seconds, 0 Inserts)
% 24.04/24.26  
% 24.04/24.26  Stopped by limit on number of solutions
% 24.04/24.26  
% 24.04/24.26  
% 24.04/24.26  -------------- Softie stats --------------
% 24.04/24.26  
% 24.04/24.26  UPDATE_STOP: 300
% 24.04/24.26  SFINDER_TIME_LIMIT: 2
% 24.04/24.26  SHORT_CLAUSE_CUTOFF: 4
% 24.04/24.26  number of clauses in intial UL: 1963
% 24.04/24.26  number of clauses initially in problem: 1983
% 24.04/24.26  percentage of clauses intially in UL: 98
% 24.04/24.26  percentage of distinct symbols occuring in initial UL: 70
% 24.04/24.26  percent of all initial clauses that are short: 100
% 24.04/24.26  absolute distinct symbol count: 41
% 24.04/24.26     distinct predicate count: 5
% 24.04/24.26     distinct function count: 10
% 24.04/24.26     distinct constant count: 26
% 24.04/24.26  
% 24.04/24.26  ---------- no more Softie stats ----------
% 24.04/24.26  
% 24.04/24.26  
% 24.04/24.26  
% 24.04/24.26  Stopped by limit on insertions
% 24.04/24.26  
% 24.04/24.26  =========== start of search ===========
% 169.98/170.19  
% 169.98/170.19  -- HEY sandbox2, WE HAVE A PROOF!! -- 
% 169.98/170.19  
% 169.98/170.19  Model 2 (0.00 seconds, 0 Inserts)
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on number of solutions
% 169.98/170.19  
% 169.98/170.19  Model 3 (0.00 seconds, 0 Inserts)
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on number of solutions
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Model 4 (0.00 seconds, 0 Inserts)
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on number of solutions
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Model 5 (0.00 seconds, 0 Inserts)
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on number of solutions
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Model 6 [ 3 645 247556 ] (0.00 seconds, 250000 Inserts)
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Model 7 [ 5 245 88318 ] (0.00 seconds, 250000 Inserts)
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Model 8 [ 2 464 198175 ] (0.00 seconds, 250000 Inserts)
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Model 9 [ 3 350 132938 ] (0.00 seconds, 250000 Inserts)
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Model 10 [ 9 529 240310 ] (0.00 seconds, 250000 Inserts)
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Model 11 [ 1 590 221837 ] (0.00 seconds, 250000 Inserts)
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  Stopped by limit on insertions
% 169.98/170.19  
% 169.98/170.19  ----> UNIT CONFLICT at 169.63 sec ----> 2365 [binary,2364.1,33.1] {-} $F.
% 169.98/170.19  
% 169.98/170.19  Length of proof is 11.  Level of proof is 7.
% 169.98/170.19  
% 169.98/170.19  ---------------- PROOF ----------------
% 169.98/170.19  % SZS status Theorem
% 169.98/170.19  % SZS output start Refutation
% 169.98/170.19  
% 169.98/170.19  1 [] {+} -iext(uri_rdf_type,A,B)|icext(B,A).
% 169.98/170.19  3 [] {+} -iext(uri_owl_someValuesFrom,A,B)| -iext(uri_owl_onProperty,A,C)| -icext(A,D)|iext(C,D,$f1(A,C,B,D)).
% 169.98/170.19  4 [] {+} -iext(uri_owl_someValuesFrom,A,B)| -iext(uri_owl_onProperty,A,C)| -icext(A,D)|icext(B,$f1(A,C,B,D)).
% 169.98/170.19  8 [] {+} -iext(uri_rdfs_subClassOf,A,B)| -icext(A,C)|icext(B,C).
% 169.98/170.19  13 [] {+} -iext(uri_rdfs_subPropertyOf,A,B)| -iext(A,C,D)|iext(B,C,D).
% 169.98/170.19  16 [] {+} -iext(uri_owl_sameAs,A,B)|A=B.
% 169.98/170.19  22 [] {+} -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,C)| -iext(uri_rdf_first,C,D)| -iext(uri_rdf_rest,C,E)| -iext(uri_rdf_first,E,F)| -iext(uri_rdf_rest,E,uri_rdf_nil)| -iext(uri_owl_propertyChainAxiom,G,A)| -iext(B,H,I)| -iext(D,I,J)| -iext(F,J,K)|iext(G,H,K).
% 169.98/170.19  30 [] {+} -iext(uri_owl_inverseOf,A,B)|iext(A,C,D)| -iext(B,D,C).
% 169.98/170.19  33 [] {+} -iext(uri_foaf_knows,uri_ex_alice,uri_ex_bob).
% 169.98/170.19  1972 [] {-} iext(uri_rdfs_subPropertyOf,uri_ex_sameCliqueAs,uri_owl_sameAs).
% 169.98/170.19  1974 [] {+} iext(uri_rdfs_subClassOf,uri_ex_Clique,$c5).
% 169.98/170.19  1976 [] {+} iext(uri_owl_onProperty,$c5,uri_ex_sameCliqueAs).
% 169.98/170.19  1977 [] {+} iext(uri_owl_someValuesFrom,$c5,uri_ex_Clique).
% 169.98/170.19  1979 [] {-} iext(uri_owl_propertyChainAxiom,uri_foaf_knows,$c3).
% 169.98/170.19  1980 [] {+} iext(uri_rdf_first,$c3,uri_rdf_type).
% 169.98/170.19  1981 [] {-} iext(uri_rdf_rest,$c3,$c2).
% 169.98/170.19  1982 [] {-} iext(uri_rdf_first,$c2,uri_ex_sameCliqueAs).
% 169.98/170.19  1983 [] {-} iext(uri_rdf_rest,$c2,$c1).
% 169.98/170.19  1984 [] {-} iext(uri_rdf_first,$c1,$c4).
% 169.98/170.19  1985 [] {-} iext(uri_rdf_rest,$c1,uri_rdf_nil).
% 169.98/170.19  1986 [] {-} iext(uri_owl_inverseOf,$c4,uri_rdf_type).
% 169.98/170.19  1987 [] {+} iext(uri_rdf_type,uri_ex_JoesGang,uri_ex_Clique).
% 169.98/170.19  1988 [] {+} iext(uri_rdf_type,uri_ex_alice,uri_ex_JoesGang).
% 169.98/170.19  1989 [] {+} iext(uri_rdf_type,uri_ex_bob,uri_ex_JoesGang).
% 169.98/170.19  2126 [hyper,1987,1] {+} icext(uri_ex_Clique,uri_ex_JoesGang).
% 169.98/170.19  2130 [hyper,1989,30,1986] {+} iext($c4,uri_ex_JoesGang,uri_ex_bob).
% 169.98/170.19  2148 [hyper,2126,8,1974] {+} icext($c5,uri_ex_JoesGang).
% 169.98/170.19  2184 [hyper,2148,4,1977,1976] {-} icext(uri_ex_Clique,$f1($c5,uri_ex_sameCliqueAs,uri_ex_Clique,uri_ex_JoesGang)).
% 169.98/170.19  2185 [hyper,2148,3,1977,1976] {-} iext(uri_ex_sameCliqueAs,uri_ex_JoesGang,$f1($c5,uri_ex_sameCliqueAs,uri_ex_Clique,uri_ex_JoesGang)).
% 169.98/170.19  2191 [hyper,2184,8,1974] {-} icext($c5,$f1($c5,uri_ex_sameCliqueAs,uri_ex_Clique,uri_ex_JoesGang)).
% 169.98/170.19  2200 [hyper,2191,3,1977,1976] {-} iext(uri_ex_sameCliqueAs,$f1($c5,uri_ex_sameCliqueAs,uri_ex_Clique,uri_ex_JoesGang),$f1($c5,uri_ex_sameCliqueAs,uri_ex_Clique,$f1($c5,uri_ex_sameCliqueAs,uri_ex_Clique,uri_ex_JoesGang))).
% 169.98/170.19  2261 [hyper,2185,13,1972] {-} iext(uri_owl_sameAs,uri_ex_JoesGang,$f1($c5,uri_ex_sameCliqueAs,uri_ex_Clique,uri_ex_JoesGang)).
% 169.98/170.19  2294,2293 [hyper,2261,16,flip.1] {-} $f1($c5,uri_ex_sameCliqueAs,uri_ex_Clique,uri_ex_JoesGang)=uri_ex_JoesGang.
% 169.98/170.19  2302 [back_demod,2200,demod,2294,2294,2294] {+} iext(uri_ex_sameCliqueAs,uri_ex_JoesGang,uri_ex_JoesGang).
% 169.98/170.19  2364 [hyper,2302,22,1980,1981,1982,1983,1984,1985,1979,1988,2130] {-} iext(uri_foaf_knows,uri_ex_alice,uri_ex_bob).
% 169.98/170.19  2365 [binary,2364.1,33.1] {-} $F.
% 169.98/170.19  
% 169.98/170.19  % SZS output end Refutation
% 169.98/170.19  ------------ end of proof -------------
% 169.98/170.19  
% 169.98/170.19  
% 169.98/170.19  Search stopped by max_proofs option.
% 169.98/170.19  
% 169.98/170.19  
% 169.98/170.19  Search stopped by max_proofs option.
% 169.98/170.19  
% 169.98/170.19  ============ end of search ============
% 169.98/170.19  
% 169.98/170.19  ----------- soft-scott stats ----------
% 169.98/170.19  
% 169.98/170.19  true clauses given          29      (32.6%)
% 169.98/170.19  false clauses given         60
% 169.98/170.19  
% 169.98/170.19        FALSE     TRUE
% 169.98/170.19     6  0         6
% 169.98/170.19     7  0         12
% 169.98/170.19     8  0         63
% 169.98/170.19     9  0         3
% 169.98/170.19    10  0         2
% 169.98/170.19    11  17        11
% 169.98/170.19    12  74        51
% 169.98/170.19    15  24        0
% 169.98/170.19    16  1         0
% 169.98/170.19    20  0         24
% 169.98/170.19    22  0         12
% 169.98/170.19  tot:  116       184      (61.3% true)
% 169.98/170.19  
% 169.98/170.19  
% 169.98/170.19  Model 11 [ 1 -651 221837 ] (0.00 seconds, 250000 Inserts)
% 169.98/170.19  
% 169.98/170.19  That finishes the proof of the theorem.
% 169.98/170.19  
% 169.98/170.19  Process 10777 finished Wed Jun  1 11:35:05 2022
%------------------------------------------------------------------------------