TSTP Solution File: SWB023+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWB023+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:40 EDT 2022
% Result : Theorem 1.01s 1.21s
% Output : Refutation 1.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWB023+2 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n026.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 03:41:11 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 n026.cluster.edu,
% 0.13/0.35 Wed Jun 1 03:41:11 2022
% 0.13/0.35 The command was "./sos". The process ID is 10023.
% 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=0, equality=1, symmetry=0, max_lits=6.
% 0.13/0.35
% 0.13/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.35 clauses in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(knuth_bendix).
% 0.13/0.35 dependent: set(para_from).
% 0.13/0.35 dependent: set(para_into).
% 0.13/0.35 dependent: clear(para_from_right).
% 0.13/0.35 dependent: clear(para_into_right).
% 0.13/0.35 dependent: set(para_from_vars).
% 0.13/0.35 dependent: set(eq_units_both_ways).
% 0.13/0.35 dependent: set(dynamic_demod_all).
% 0.13/0.35 dependent: set(dynamic_demod).
% 0.13/0.35 dependent: set(order_eq).
% 0.13/0.35 dependent: set(back_demod).
% 0.13/0.35 dependent: set(lrpo).
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: set(unit_deletion).
% 0.13/0.35 dependent: set(factor).
% 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 24 during input processing: 0 [copy,24,flip.1] {-} A=A.
% 0.13/0.35 24 back subsumes 16.
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.19/0.37
% 0.19/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.37
% 0.19/0.37 Stopped by limit on number of solutions
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37 -------------- Softie stats --------------
% 0.19/0.37
% 0.19/0.37 UPDATE_STOP: 300
% 0.19/0.37 SFINDER_TIME_LIMIT: 2
% 0.19/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.37 number of clauses in intial UL: 15
% 0.19/0.37 number of clauses initially in problem: 23
% 0.19/0.37 percentage of clauses intially in UL: 65
% 0.19/0.37 percentage of distinct symbols occuring in initial UL: 86
% 0.19/0.37 percent of all initial clauses that are short: 100
% 0.19/0.37 absolute distinct symbol count: 22
% 0.19/0.37 distinct predicate count: 5
% 0.19/0.37 distinct function count: 4
% 0.19/0.37 distinct constant count: 13
% 0.19/0.37
% 0.19/0.37 ---------- no more Softie stats ----------
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37 =========== start of search ===========
% 1.01/1.21
% 1.01/1.21 -------- PROOF --------
% 1.01/1.21 % SZS status Theorem
% 1.01/1.21 % SZS output start Refutation
% 1.01/1.21
% 1.01/1.21 Model 2 (0.00 seconds, 0 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on number of solutions
% 1.01/1.21
% 1.01/1.21 Model 3 (0.00 seconds, 0 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on number of solutions
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 4 [ 1 1 1114 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 5 (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on number of solutions
% 1.01/1.21
% 1.01/1.21 Model 6 (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on number of solutions
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 7 [ 1 0 152 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 8 [ 2 1 445 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 9 [ 2 1 142 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 ----> UNIT CONFLICT at 0.84 sec ----> 135 [binary,134.1,86.1] {-} $F.
% 1.01/1.21
% 1.01/1.21 Length of proof is 7. Level of proof is 4.
% 1.01/1.21
% 1.01/1.21 ---------------- PROOF ----------------
% 1.01/1.21 % SZS status Theorem
% 1.01/1.21 % SZS output start Refutation
% 1.01/1.21
% 1.01/1.21 1 [] {+} -iext(uri_rdf_type,A,B)|icext(B,A).
% 1.01/1.21 4 [] {+} -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.01/1.21 9 [] {+} -icext(uri_owl_FunctionalProperty,A)| -iext(A,B,C)| -iext(A,B,D)|C=D.
% 1.01/1.21 14 [] {+} iext(uri_owl_sameAs,A,B)|A!=B.
% 1.01/1.21 15 [] {+} -iext(uri_owl_sameAs,uri_ex_w,uri_ex_u)| -iext(uri_owl_sameAs,uri_ex_w,uri_ex_v).
% 1.01/1.21 17 [] {+} iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty).
% 1.01/1.21 18 [] {+} iext(uri_rdf_type,uri_ex_w,$c2).
% 1.01/1.21 20 [] {-} iext(uri_owl_oneOf,$c2,$c1).
% 1.01/1.21 21 [] {+} iext(uri_rdf_first,$c1,uri_ex_u).
% 1.01/1.21 22 [] {+} iext(uri_rdf_first,$c1,uri_ex_v).
% 1.01/1.21 23 [] {+} iext(uri_rdf_rest,$c1,uri_rdf_nil).
% 1.01/1.21 24 [] {+} A=A.
% 1.01/1.21 25 [hyper,17,1] {+} icext(uri_owl_FunctionalProperty,uri_rdf_first).
% 1.01/1.21 35 [hyper,18,1] {+} icext($c2,uri_ex_w).
% 1.01/1.21 84,83 [hyper,22,9,25,21,flip.1] {-} uri_ex_v=uri_ex_u.
% 1.01/1.21 85 [back_demod,15,demod,84,factor_simp] {+} -iext(uri_owl_sameAs,uri_ex_w,uri_ex_u).
% 1.01/1.21 86 [hyper,24,14] {+} iext(uri_owl_sameAs,A,A).
% 1.01/1.21 133,132 [hyper,35,4,21,23,20] {-} uri_ex_w=uri_ex_u.
% 1.01/1.21 134 [back_demod,85,demod,133] {-} -iext(uri_owl_sameAs,uri_ex_u,uri_ex_u).
% 1.01/1.21 135 [binary,134.1,86.1] {-} $F.
% 1.01/1.21
% 1.01/1.21 % SZS output end Refutation
% 1.01/1.21 ------------ end of proof -------------
% 1.01/1.21
% 1.01/1.21
% 1.01/1.21 Search stopped by max_proofs option.
% 1.01/1.21
% 1.01/1.21
% 1.01/1.21 Search stopped by max_proofs option.
% 1.01/1.21
% 1.01/1.21 ============ end of search ============
% 1.01/1.21
% 1.01/1.21 ----------- soft-scott stats ----------
% 1.01/1.21
% 1.01/1.21 true clauses given 5 (33.3%)
% 1.01/1.21 false clauses given 10
% 1.01/1.21
% 1.01/1.21 FALSE TRUE
% 1.01/1.21 3 0 1
% 1.01/1.21 4 1 2
% 1.01/1.21 6 0 2
% 1.01/1.21 7 2 3
% 1.01/1.21 8 3 14
% 1.01/1.21 11 0 1
% 1.01/1.21 12 0 4
% 1.01/1.21 13 0 2
% 1.01/1.21 14 2 2
% 1.01/1.21 15 3 21
% 1.01/1.21 17 0 2
% 1.01/1.21 18 1 4
% 1.01/1.21 19 1 24
% 1.01/1.21 23 0 4
% 1.01/1.21 tot: 13 86 (86.9% true)
% 1.01/1.21
% 1.01/1.21
% 1.01/1.21 Model 9 [ 2 1 142 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 That finishes the proof of the theorem.
% 1.01/1.21
% 1.01/1.21 Process 10023 finished Wed Jun 1 03:41:12 2022
%------------------------------------------------------------------------------