TSTP Solution File: SWB012+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWB012+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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 2.96s 3.15s
% Output : Refutation 2.96s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWB012+2 : TPTP v8.1.0. Released v5.2.0.
% 0.13/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 1 05:52:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.41/0.59 ----- Otter 3.2, August 2001 -----
% 0.41/0.59 The process was started by sandbox2 on n026.cluster.edu,
% 0.41/0.59 Wed Jun 1 05:52:56 2022
% 0.41/0.59 The command was "./sos". The process ID is 26096.
% 0.41/0.59
% 0.41/0.59 set(prolog_style_variables).
% 0.41/0.59 set(auto).
% 0.41/0.59 dependent: set(auto1).
% 0.41/0.59 dependent: set(process_input).
% 0.41/0.59 dependent: clear(print_kept).
% 0.41/0.59 dependent: clear(print_new_demod).
% 0.41/0.59 dependent: clear(print_back_demod).
% 0.41/0.59 dependent: clear(print_back_sub).
% 0.41/0.59 dependent: set(control_memory).
% 0.41/0.59 dependent: assign(max_mem, 12000).
% 0.41/0.59 dependent: assign(pick_given_ratio, 4).
% 0.41/0.59 dependent: assign(stats_level, 1).
% 0.41/0.59 dependent: assign(pick_semantic_ratio, 3).
% 0.41/0.59 dependent: assign(sos_limit, 5000).
% 0.41/0.59 dependent: assign(max_weight, 60).
% 0.41/0.59 clear(print_given).
% 0.41/0.59
% 0.41/0.59 formula_list(usable).
% 0.41/0.59
% 0.41/0.59 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=15.
% 0.41/0.59
% 0.41/0.59 This is a non-Horn set without equality. The strategy
% 0.41/0.59 will be ordered hyper_res, ur_res, unit deletion, and
% 0.41/0.59 factoring, with satellites in sos and nuclei in usable.
% 0.41/0.59
% 0.41/0.59 dependent: set(hyper_res).
% 0.41/0.59 dependent: set(factor).
% 0.41/0.59 dependent: set(unit_deletion).
% 0.41/0.59
% 0.41/0.59 ------------> process usable:
% 0.41/0.59 74 back subsumes 64.
% 0.41/0.59 82 back subsumes 75.
% 0.41/0.59 82 back subsumes 65.
% 0.41/0.59 132 back subsumes 109.
% 0.41/0.59 140 back subsumes 120.
% 0.41/0.59 147 back subsumes 103.
% 0.41/0.59 197 back subsumes 183.
% 0.41/0.59 201 back subsumes 188.
% 0.41/0.59 206 back subsumes 177.
% 0.41/0.59
% 0.41/0.59 ------------> process sos:
% 0.41/0.59
% 0.41/0.59 ======= end of input processing =======
% 0.47/0.70
% 0.47/0.70 Model 1 (0.00 seconds, 0 Inserts)
% 0.47/0.70
% 0.47/0.70 Stopped by limit on number of solutions
% 0.47/0.70
% 0.47/0.70
% 0.47/0.70 -------------- Softie stats --------------
% 0.47/0.70
% 0.47/0.70 UPDATE_STOP: 300
% 0.47/0.70 SFINDER_TIME_LIMIT: 2
% 0.47/0.70 SHORT_CLAUSE_CUTOFF: 4
% 0.47/0.70 number of clauses in intial UL: 230
% 0.47/0.70 number of clauses initially in problem: 243
% 0.47/0.70 percentage of clauses intially in UL: 94
% 0.47/0.70 percentage of distinct symbols occuring in initial UL: 61
% 0.47/0.70 percent of all initial clauses that are short: 100
% 0.47/0.70 absolute distinct symbol count: 26
% 0.47/0.70 distinct predicate count: 3
% 0.47/0.70 distinct function count: 2
% 0.47/0.70 distinct constant count: 21
% 0.47/0.70
% 0.47/0.70 ---------- no more Softie stats ----------
% 0.47/0.70
% 0.47/0.70
% 0.47/0.70
% 0.47/0.70 =========== start of search ===========
% 2.96/3.15
% 2.96/3.15 -------- PROOF --------
% 2.96/3.15 % SZS status Theorem
% 2.96/3.15 % SZS output start Refutation
% 2.96/3.15
% 2.96/3.15 Stopped by limit on insertions
% 2.96/3.15
% 2.96/3.15 Model 2 (0.00 seconds, 0 Inserts)
% 2.96/3.15
% 2.96/3.15 Stopped by limit on number of solutions
% 2.96/3.15
% 2.96/3.15 Stopped by limit on insertions
% 2.96/3.15
% 2.96/3.15 Stopped by limit on insertions
% 2.96/3.15
% 2.96/3.15 Model 3 [ 2 11 33069 ] (0.00 seconds, 250000 Inserts)
% 2.96/3.15
% 2.96/3.15 Model 4 (0.00 seconds, 250000 Inserts)
% 2.96/3.15
% 2.96/3.15 Stopped by limit on number of solutions
% 2.96/3.15
% 2.96/3.15 Model 5 (0.00 seconds, 250000 Inserts)
% 2.96/3.15
% 2.96/3.15 Stopped by limit on number of solutions
% 2.96/3.15
% 2.96/3.15 Stopped by limit on insertions
% 2.96/3.15
% 2.96/3.15 Model 6 [ 1 8 59892 ] (0.00 seconds, 250000 Inserts)
% 2.96/3.15
% 2.96/3.15 Stopped by limit on insertions
% 2.96/3.15
% 2.96/3.15 Model 7 [ 1 12 18651 ] (0.00 seconds, 250000 Inserts)
% 2.96/3.15
% 2.96/3.15 Stopped by limit on insertions
% 2.96/3.15
% 2.96/3.15 Model 8 [ 1 6 67143 ] (0.00 seconds, 250000 Inserts)
% 2.96/3.15
% 2.96/3.15 Stopped by limit on insertions
% 2.96/3.15
% 2.96/3.15 Stopped by limit on insertions
% 2.96/3.15
% 2.96/3.15 Stopped by limit on insertions
% 2.96/3.15
% 2.96/3.15 Model 9 [ 2 7 7506 ] (0.00 seconds, 250000 Inserts)
% 2.96/3.15
% 2.96/3.15 Stopped by limit on insertions
% 2.96/3.15
% 2.96/3.15 Model 10 [ 2 8 10659 ] (0.00 seconds, 250000 Inserts)
% 2.96/3.15
% 2.96/3.15 Stopped by limit on insertions
% 2.96/3.15
% 2.96/3.15 Model 11 [ 2 22 61666 ] (0.00 seconds, 250000 Inserts)
% 2.96/3.15
% 2.96/3.15 Stopped by limit on insertions
% 2.96/3.15
% 2.96/3.15 Model 12 [ 2 9 82212 ] (0.00 seconds, 250000 Inserts)
% 2.96/3.15
% 2.96/3.15 Stopped by limit on insertions
% 2.96/3.15
% 2.96/3.15 Model 13 [ 8 5 34122 ] (0.00 seconds, 250000 Inserts)
% 2.96/3.15
% 2.96/3.15 -----> EMPTY CLAUSE at 2.75 sec ----> 276 [hyper,274,18,266] {-} $F.
% 2.96/3.15
% 2.96/3.15 Length of proof is 7. Level of proof is 5.
% 2.96/3.15
% 2.96/3.15 ---------------- PROOF ----------------
% 2.96/3.15 % SZS status Theorem
% 2.96/3.15 % SZS output start Refutation
% 2.96/3.15
% 2.96/3.15 1 [] {+} -iext(uri_rdf_type,A,B)|icext(B,A).
% 2.96/3.15 2 [] {+} iext(uri_rdf_type,A,B)| -icext(B,A).
% 2.96/3.15 3 [] {+} -iext(uri_rdfs_domain,A,B)| -iext(A,C,D)|icext(B,C).
% 2.96/3.15 9 [] {+} -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_intersectionOf,G,A)| -icext(G,H)|icext(D,H).
% 2.96/3.15 10 [] {+} -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_intersectionOf,G,A)| -icext(G,H)|icext(F,H).
% 2.96/3.15 16 [] {+} -iext(uri_owl_hasValue,A,B)| -iext(uri_owl_onProperty,A,C)| -icext(A,D)|iext(C,D,B).
% 2.96/3.15 18 [] {+} -iext(uri_rdf_type,uri_ex_name,uri_owl_FunctionalProperty)| -iext(uri_rdf_type,uri_ex_alice,uri_foaf_Person).
% 2.96/3.15 241 [] {-} iext(uri_owl_intersectionOf,uri_ex_PersonAttribute,$c4).
% 2.96/3.15 242 [] {+} iext(uri_rdf_first,$c4,uri_owl_DatatypeProperty).
% 2.96/3.15 243 [] {+} iext(uri_rdf_rest,$c4,$c3).
% 2.96/3.15 244 [] {-} iext(uri_rdf_first,$c3,uri_owl_FunctionalProperty).
% 2.96/3.15 245 [] {+} iext(uri_rdf_rest,$c3,$c2).
% 2.96/3.15 246 [] {+} iext(uri_rdf_first,$c2,$c1).
% 2.96/3.15 247 [] {+} iext(uri_rdf_rest,$c2,uri_rdf_nil).
% 2.96/3.15 249 [] {-} iext(uri_owl_onProperty,$c1,uri_rdfs_domain).
% 2.96/3.15 250 [] {+} iext(uri_owl_hasValue,$c1,uri_foaf_Person).
% 2.96/3.15 251 [] {+} iext(uri_rdf_type,uri_ex_name,uri_ex_PersonAttribute).
% 2.96/3.15 252 [] {-} iext(uri_ex_name,uri_ex_alice,literal_plain(dat_str_alice)).
% 2.96/3.15 259 [hyper,251,1] {+} icext(uri_ex_PersonAttribute,uri_ex_name).
% 2.96/3.15 263 [hyper,259,10,242,243,244,245,246,247,241] {+} icext($c1,uri_ex_name).
% 2.96/3.15 264 [hyper,259,9,242,243,244,245,246,247,241] {+} icext(uri_owl_FunctionalProperty,uri_ex_name).
% 2.96/3.15 266 [hyper,264,2] {+} iext(uri_rdf_type,uri_ex_name,uri_owl_FunctionalProperty).
% 2.96/3.15 268 [hyper,263,16,250,249] {+} iext(uri_rdfs_domain,uri_ex_name,uri_foaf_Person).
% 2.96/3.15 273 [hyper,268,3,252] {+} icext(uri_foaf_Person,uri_ex_alice).
% 2.96/3.15 274 [hyper,273,2] {+} iext(uri_rdf_type,uri_ex_alice,uri_foaf_Person).
% 2.96/3.15 276 [hyper,274,18,266] {-} $F.
% 2.96/3.15
% 2.96/3.15 % SZS output end Refutation
% 2.96/3.15 ------------ end of proof -------------
% 2.96/3.15
% 2.96/3.15
% 2.96/3.15 Search stopped by max_proofs option.
% 2.96/3.15
% 2.96/3.15
% 2.96/3.15 Search stopped by max_proofs option.
% 2.96/3.15
% 2.96/3.15 ============ end of search ============
% 2.96/3.15
% 2.96/3.15 ----------- soft-scott stats ----------
% 2.96/3.15
% 2.96/3.15 true clauses given 13 (40.6%)
% 2.96/3.15 false clauses given 19
% 2.96/3.15
% 2.96/3.15 FALSE TRUE
% 2.96/3.15 4 1 0
% 2.96/3.15 15 0 3
% 2.96/3.15 tot: 1 3 (75.0% true)
% 2.96/3.15
% 2.96/3.15
% 2.96/3.15 Model 13 [ 8 5 34122 ] (0.00 seconds, 250000 Inserts)
% 2.96/3.15
% 2.96/3.15 That finishes the proof of the theorem.
% 2.96/3.15
% 2.96/3.15 Process 26096 finished Wed Jun 1 05:52:59 2022
%------------------------------------------------------------------------------