TSTP Solution File: SWB001+4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWB001+4 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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:31 EDT 2022
% Result : Theorem 2.23s 2.45s
% Output : Refutation 2.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWB001+4 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n022.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 01:24:22 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox on n022.cluster.edu,
% 0.13/0.35 Wed Jun 1 01:24:22 2022
% 0.13/0.35 The command was "./sos". The process ID is 9939.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 formula_list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.35
% 0.13/0.35 This is a Horn set without equality. The strategy will
% 0.13/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.35 in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: clear(order_hyper).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 Following clause subsumed by 39 during input processing: 0 [] {-} iext(uri_rdf_type,uri_rdf_type,uri_rdf_Property).
% 0.13/0.35 Following clause subsumed by 77 during input processing: 0 [] {-} iext(uri_rdfs_range,uri_rdf_predicate,uri_rdfs_Resource).
% 0.13/0.35 29 back subsumes 14.
% 0.13/0.35 29 back subsumes 2.
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 26
% 0.13/0.39 number of clauses initially in problem: 90
% 0.13/0.39 percentage of clauses intially in UL: 28
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 47
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 46
% 0.13/0.39 distinct predicate count: 6
% 0.13/0.39 distinct function count: 0
% 0.13/0.39 distinct constant count: 40
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 2.23/2.45
% 2.23/2.45 -------- PROOF --------
% 2.23/2.45 % SZS status Theorem
% 2.23/2.45 % SZS output start Refutation
% 2.23/2.45
% 2.23/2.45 Model 3 (0.00 seconds, 0 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on number of solutions
% 2.23/2.45
% 2.23/2.45 Model 4 (0.00 seconds, 0 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on number of solutions
% 2.23/2.45
% 2.23/2.45 Model 5 (0.00 seconds, 0 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on number of solutions
% 2.23/2.45
% 2.23/2.45 Model 6 (0.00 seconds, 0 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on number of solutions
% 2.23/2.45
% 2.23/2.45 Stopped by limit on insertions
% 2.23/2.45
% 2.23/2.45 Model 7 (0.00 seconds, 0 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on number of solutions
% 2.23/2.45
% 2.23/2.45 Stopped by limit on insertions
% 2.23/2.45
% 2.23/2.45 Model 8 [ 1 1 833 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Model 9 (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on number of solutions
% 2.23/2.45
% 2.23/2.45 Model 10 (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on number of solutions
% 2.23/2.45
% 2.23/2.45 Stopped by limit on insertions
% 2.23/2.45
% 2.23/2.45 Model 11 [ 1 1 704 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on insertions
% 2.23/2.45
% 2.23/2.45 Model 12 [ 1 0 816 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on insertions
% 2.23/2.45
% 2.23/2.45 Model 13 [ 1 0 1675 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Model 14 (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on number of solutions
% 2.23/2.45
% 2.23/2.45 Model 15 (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on number of solutions
% 2.23/2.45
% 2.23/2.45 Stopped by limit on insertions
% 2.23/2.45
% 2.23/2.45 Model 16 [ 1 1 244 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on insertions
% 2.23/2.45
% 2.23/2.45 Model 17 [ 1 1 2016 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Model 18 (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on number of solutions
% 2.23/2.45
% 2.23/2.45 Model 19 (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on number of solutions
% 2.23/2.45
% 2.23/2.45 Stopped by limit on insertions
% 2.23/2.45
% 2.23/2.45 Model 20 [ 1 1 873 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on insertions
% 2.23/2.45
% 2.23/2.45 Model 21 [ 1 1 818 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on insertions
% 2.23/2.45
% 2.23/2.45 Model 22 [ 1 0 2061 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on insertions
% 2.23/2.45
% 2.23/2.45 Model 23 [ 1 1 1237 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on insertions
% 2.23/2.45
% 2.23/2.45 Model 24 [ 1 1 1169 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Model 25 (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on number of solutions
% 2.23/2.45
% 2.23/2.45 Model 26 (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on number of solutions
% 2.23/2.45
% 2.23/2.45 Stopped by limit on insertions
% 2.23/2.45
% 2.23/2.45 Model 27 [ 1 0 1082 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on insertions
% 2.23/2.45
% 2.23/2.45 Model 28 [ 1 1 1001 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Model 29 (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 Stopped by limit on number of solutions
% 2.23/2.45
% 2.23/2.45 Stopped by limit on insertions
% 2.23/2.45
% 2.23/2.45 Model 30 [ 1 0 943 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 -----> EMPTY CLAUSE at 2.08 sec ----> 241 [hyper,90,28,91] {-} $F.
% 2.23/2.45
% 2.23/2.45 Length of proof is 0. Level of proof is 0.
% 2.23/2.45
% 2.23/2.45 ---------------- PROOF ----------------
% 2.23/2.45 % SZS status Theorem
% 2.23/2.45 % SZS output start Refutation
% 2.23/2.45
% 2.23/2.45 28 [] {+} -iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction)| -iext(uri_owl_onProperty,uri_ex_r,uri_ex_p).
% 2.23/2.45 90 [] {+} iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction).
% 2.23/2.45 91 [] {-} iext(uri_owl_onProperty,uri_ex_r,uri_ex_p).
% 2.23/2.45 241 [hyper,90,28,91] {-} $F.
% 2.23/2.45
% 2.23/2.45 % SZS output end Refutation
% 2.23/2.45 ------------ end of proof -------------
% 2.23/2.45
% 2.23/2.45
% 2.23/2.45 Search stopped by max_proofs option.
% 2.23/2.45
% 2.23/2.45
% 2.23/2.45 Search stopped by max_proofs option.
% 2.23/2.45
% 2.23/2.45 ============ end of search ============
% 2.23/2.45
% 2.23/2.45 ----------- soft-scott stats ----------
% 2.23/2.45
% 2.23/2.45 true clauses given 106 (77.9%)
% 2.23/2.45 false clauses given 30
% 2.23/2.45
% 2.23/2.45 FALSE TRUE
% 2.23/2.45 4 0 76
% 2.23/2.45 tot: 0 76 (100.0% true)
% 2.23/2.45
% 2.23/2.45
% 2.23/2.45 Model 30 [ 1 0 943 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.45
% 2.23/2.45 That finishes the proof of the theorem.
% 2.23/2.45
% 2.23/2.45 Process 9939 finished Wed Jun 1 01:24:24 2022
%------------------------------------------------------------------------------