TSTP Solution File: SWB022+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWB022+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:40 EDT 2022
% Result : Theorem 2.75s 2.97s
% Output : Refutation 2.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWB022+2 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n028.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 11:27:22 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.39 ----- Otter 3.2, August 2001 -----
% 0.14/0.39 The process was started by sandbox on n028.cluster.edu,
% 0.14/0.39 Wed Jun 1 11:27:22 2022
% 0.14/0.39 The command was "./sos". The process ID is 8736.
% 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 formula_list(usable).
% 0.14/0.39
% 0.14/0.39 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=9.
% 0.14/0.39
% 0.14/0.39 This is a non-Horn set without equality. The strategy
% 0.14/0.39 will be ordered hyper_res, ur_res, unit deletion, and
% 0.14/0.39 factoring, with satellites in sos and nuclei in usable.
% 0.14/0.39
% 0.14/0.39 dependent: set(hyper_res).
% 0.14/0.39 dependent: set(factor).
% 0.14/0.39 dependent: set(unit_deletion).
% 0.14/0.39
% 0.14/0.39 ------------> process usable:
% 0.14/0.39
% 0.14/0.39 ------------> process sos:
% 0.14/0.39
% 0.14/0.39 ======= end of input processing =======
% 0.21/0.46
% 0.21/0.46 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.46
% 0.21/0.46 Stopped by limit on number of solutions
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46 -------------- Softie stats --------------
% 0.21/0.46
% 0.21/0.46 UPDATE_STOP: 300
% 0.21/0.46 SFINDER_TIME_LIMIT: 2
% 0.21/0.46 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.46 number of clauses in intial UL: 124
% 0.21/0.46 number of clauses initially in problem: 143
% 0.21/0.46 percentage of clauses intially in UL: 86
% 0.21/0.46 percentage of distinct symbols occuring in initial UL: 57
% 0.21/0.46 percent of all initial clauses that are short: 100
% 0.21/0.46 absolute distinct symbol count: 26
% 0.21/0.46 distinct predicate count: 2
% 0.21/0.46 distinct function count: 3
% 0.21/0.46 distinct constant count: 21
% 0.21/0.46
% 0.21/0.46 ---------- no more Softie stats ----------
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.46
% 0.21/0.46 Stopped by limit on number of solutions
% 0.21/0.46
% 0.21/0.46 =========== start of search ===========
% 2.75/2.97
% 2.75/2.97 -------- PROOF --------
% 2.75/2.97 % SZS status Theorem
% 2.75/2.97 % SZS output start Refutation
% 2.75/2.97
% 2.75/2.97 Model 3 (0.00 seconds, 0 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on number of solutions
% 2.75/2.97
% 2.75/2.97 Model 4 (0.00 seconds, 0 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on number of solutions
% 2.75/2.97
% 2.75/2.97 Model 5 (0.00 seconds, 0 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on number of solutions
% 2.75/2.97
% 2.75/2.97 Model 6 (0.00 seconds, 0 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on number of solutions
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Model 7 [ 1 1 1532 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 Model 8 (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on number of solutions
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Model 9 [ 1 2 7605 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Model 10 [ 1 2 1456 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Model 11 [ 1 5 112661 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Model 12 [ 2 2 10852 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Model 13 [ 2 2 2482 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Model 14 [ 2 1 1000 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Model 15 [ 2 2 27654 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Model 16 [ 6 2 4508 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Model 17 [ 3 2 2223 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Model 18 [ 2 4 44781 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Model 19 [ 2 4 54539 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Model 20 [ 3 2 11783 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Model 21 [ 3 2 906 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Model 22 [ 3 2 6253 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Model 23 [ 5 1 15278 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 Stopped by limit on insertions
% 2.75/2.97
% 2.75/2.97 Model 24 [ 6 2 20778 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 -----> EMPTY CLAUSE at 2.58 sec ----> 184 [hyper,183,11,167,171] {-} $F.
% 2.75/2.97
% 2.75/2.97 Length of proof is 6. Level of proof is 4.
% 2.75/2.97
% 2.75/2.97 ---------------- PROOF ----------------
% 2.75/2.97 % SZS status Theorem
% 2.75/2.97 % SZS output start Refutation
% 2.75/2.97
% 2.75/2.97 3 [] {+} -iext(uri_rdfs_subPropertyOf,A,B)| -iext(A,C,D)|iext(B,C,D).
% 2.75/2.97 7 [] {+} -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,C)| -iext(uri_rdf_first,C,D)| -iext(uri_rdf_rest,C,uri_rdf_nil)| -iext(uri_owl_propertyChainAxiom,E,A)| -iext(B,F,G)| -iext(D,G,H)|iext(E,F,H).
% 2.75/2.97 11 [] {+} -iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_X)| -iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_Y)| -iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_Z).
% 2.75/2.97 125 [] {+} iext(uri_rdfs_subPropertyOf,uri_skos_memberList,$c8).
% 2.75/2.97 126 [] {+} iext(uri_owl_propertyChainAxiom,uri_skos_member,$c7).
% 2.75/2.97 127 [] {+} iext(uri_rdf_first,$c7,$c8).
% 2.75/2.97 128 [] {+} iext(uri_rdf_rest,$c7,$c6).
% 2.75/2.97 129 [] {+} iext(uri_rdf_first,$c6,uri_rdf_first).
% 2.75/2.97 130 [] {+} iext(uri_rdf_rest,$c6,uri_rdf_nil).
% 2.75/2.97 131 [] {+} iext(uri_owl_propertyChainAxiom,$c8,$c5).
% 2.75/2.97 132 [] {+} iext(uri_rdf_first,$c5,$c8).
% 2.75/2.97 133 [] {+} iext(uri_rdf_rest,$c5,$c4).
% 2.75/2.97 134 [] {+} iext(uri_rdf_first,$c4,uri_rdf_rest).
% 2.75/2.97 135 [] {+} iext(uri_rdf_rest,$c4,uri_rdf_nil).
% 2.75/2.97 137 [] {-} iext(uri_skos_memberList,uri_ex_MyOrderedCollection,$c3).
% 2.75/2.97 138 [] {+} iext(uri_rdf_first,$c3,uri_ex_X).
% 2.75/2.97 139 [] {+} iext(uri_rdf_rest,$c3,$c2).
% 2.75/2.97 140 [] {+} iext(uri_rdf_first,$c2,uri_ex_Y).
% 2.75/2.97 141 [] {+} iext(uri_rdf_rest,$c2,$c1).
% 2.75/2.97 142 [] {+} iext(uri_rdf_first,$c1,uri_ex_Z).
% 2.75/2.97 155 [hyper,137,3,125] {+} iext($c8,uri_ex_MyOrderedCollection,$c3).
% 2.75/2.97 166 [hyper,155,7,132,133,134,135,131,139] {+} iext($c8,uri_ex_MyOrderedCollection,$c2).
% 2.75/2.97 167 [hyper,155,7,127,128,129,130,126,138] {+} iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_X).
% 2.75/2.97 169 [hyper,166,7,132,133,134,135,131,141] {+} iext($c8,uri_ex_MyOrderedCollection,$c1).
% 2.75/2.97 171 [hyper,166,7,127,128,129,130,126,140] {+} iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_Y).
% 2.75/2.97 183 [hyper,169,7,127,128,129,130,126,142] {+} iext(uri_skos_member,uri_ex_MyOrderedCollection,uri_ex_Z).
% 2.75/2.97 184 [hyper,183,11,167,171] {-} $F.
% 2.75/2.97
% 2.75/2.97 % SZS output end Refutation
% 2.75/2.97 ------------ end of proof -------------
% 2.75/2.97
% 2.75/2.97
% 2.75/2.97 Search stopped by max_proofs option.
% 2.75/2.97
% 2.75/2.97
% 2.75/2.97 Search stopped by max_proofs option.
% 2.75/2.97
% 2.75/2.97 ============ end of search ============
% 2.75/2.97
% 2.75/2.97 ----------- soft-scott stats ----------
% 2.75/2.97
% 2.75/2.97 true clauses given 9 (25.7%)
% 2.75/2.97 false clauses given 26
% 2.75/2.97
% 2.75/2.97 FALSE TRUE
% 2.75/2.97 18 4 20
% 2.75/2.97 tot: 4 20 (83.3% true)
% 2.75/2.97
% 2.75/2.97
% 2.75/2.97 Model 24 [ 6 2 20778 ] (0.00 seconds, 250000 Inserts)
% 2.75/2.97
% 2.75/2.97 That finishes the proof of the theorem.
% 2.75/2.97
% 2.75/2.97 Process 8736 finished Wed Jun 1 11:27:25 2022
%------------------------------------------------------------------------------