TSTP Solution File: SWB017+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWB017+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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:37 EDT 2022
% Result : Theorem 0.54s 0.78s
% Output : Refutation 0.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : SWB017+2 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.15 % Command : sos-script %s
% 0.12/0.36 % Computer : n017.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8042.1875MB
% 0.12/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 600
% 0.12/0.36 % DateTime : Wed Jun 1 10:45:27 EDT 2022
% 0.12/0.37 % CPUTime :
% 0.12/0.38 ----- Otter 3.2, August 2001 -----
% 0.12/0.38 The process was started by sandbox2 on n017.cluster.edu,
% 0.12/0.38 Wed Jun 1 10:45:27 2022
% 0.12/0.38 The command was "./sos". The process ID is 27172.
% 0.12/0.38
% 0.12/0.38 set(prolog_style_variables).
% 0.12/0.38 set(auto).
% 0.12/0.38 dependent: set(auto1).
% 0.12/0.38 dependent: set(process_input).
% 0.12/0.38 dependent: clear(print_kept).
% 0.12/0.38 dependent: clear(print_new_demod).
% 0.12/0.38 dependent: clear(print_back_demod).
% 0.12/0.38 dependent: clear(print_back_sub).
% 0.12/0.38 dependent: set(control_memory).
% 0.12/0.38 dependent: assign(max_mem, 12000).
% 0.12/0.38 dependent: assign(pick_given_ratio, 4).
% 0.12/0.38 dependent: assign(stats_level, 1).
% 0.12/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.38 dependent: assign(sos_limit, 5000).
% 0.12/0.38 dependent: assign(max_weight, 60).
% 0.12/0.38 clear(print_given).
% 0.12/0.38
% 0.12/0.38 formula_list(usable).
% 0.12/0.38
% 0.12/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.12/0.38
% 0.12/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.38 clauses in usable.
% 0.12/0.38
% 0.12/0.38 dependent: set(knuth_bendix).
% 0.12/0.38 dependent: set(para_from).
% 0.12/0.38 dependent: set(para_into).
% 0.12/0.38 dependent: clear(para_from_right).
% 0.12/0.38 dependent: clear(para_into_right).
% 0.12/0.38 dependent: set(para_from_vars).
% 0.12/0.38 dependent: set(eq_units_both_ways).
% 0.12/0.38 dependent: set(dynamic_demod_all).
% 0.12/0.38 dependent: set(dynamic_demod).
% 0.12/0.38 dependent: set(order_eq).
% 0.12/0.38 dependent: set(back_demod).
% 0.12/0.38 dependent: set(lrpo).
% 0.12/0.38 dependent: set(hyper_res).
% 0.12/0.38 dependent: set(unit_deletion).
% 0.12/0.38 dependent: set(factor).
% 0.12/0.38
% 0.12/0.38 ------------> process usable:
% 0.12/0.38
% 0.12/0.38 ------------> process sos:
% 0.12/0.38 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] {-} A=A.
% 0.12/0.38
% 0.12/0.38 ======= end of input processing =======
% 0.12/0.41
% 0.12/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.41
% 0.12/0.41 Stopped by limit on number of solutions
% 0.12/0.41
% 0.12/0.41
% 0.12/0.41 -------------- Softie stats --------------
% 0.12/0.41
% 0.12/0.41 UPDATE_STOP: 300
% 0.12/0.41 SFINDER_TIME_LIMIT: 2
% 0.12/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.41 number of clauses in intial UL: 12
% 0.12/0.41 number of clauses initially in problem: 17
% 0.12/0.41 percentage of clauses intially in UL: 70
% 0.12/0.41 percentage of distinct symbols occuring in initial UL: 75
% 0.12/0.41 percent of all initial clauses that are short: 100
% 0.12/0.41 absolute distinct symbol count: 12
% 0.12/0.41 distinct predicate count: 3
% 0.12/0.41 distinct function count: 2
% 0.12/0.41 distinct constant count: 7
% 0.12/0.41
% 0.12/0.41 ---------- no more Softie stats ----------
% 0.12/0.41
% 0.12/0.41
% 0.12/0.41
% 0.12/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.41
% 0.12/0.41 Stopped by limit on number of solutions
% 0.12/0.41
% 0.12/0.41 =========== start of search ===========
% 0.54/0.78
% 0.54/0.78 -------- PROOF --------
% 0.54/0.78 % SZS status Theorem
% 0.54/0.78 % SZS output start Refutation
% 0.54/0.78
% 0.54/0.78 Model 3 (0.00 seconds, 0 Inserts)
% 0.54/0.78
% 0.54/0.78 Stopped by limit on number of solutions
% 0.54/0.78
% 0.54/0.78 Stopped by limit on insertions
% 0.54/0.78
% 0.54/0.78 Model 4 [ 7 1 459 ] (0.00 seconds, 250000 Inserts)
% 0.54/0.78
% 0.54/0.78 Stopped by limit on insertions
% 0.54/0.78
% 0.54/0.78 Model 5 [ 1 1 11269 ] (0.00 seconds, 250000 Inserts)
% 0.54/0.78
% 0.54/0.78 Stopped by limit on insertions
% 0.54/0.78
% 0.54/0.78 Model 6 [ 2 0 934 ] (0.00 seconds, 250000 Inserts)
% 0.54/0.78
% 0.54/0.78 Stopped by limit on insertions
% 0.54/0.78
% 0.54/0.78 Model 7 [ 1 1 1117 ] (0.00 seconds, 250000 Inserts)
% 0.54/0.78
% 0.54/0.78 ----> UNIT CONFLICT at 0.37 sec ----> 198 [binary,197.1,7.1] {-} $F.
% 0.54/0.78
% 0.54/0.78 Length of proof is 2. Level of proof is 2.
% 0.54/0.78
% 0.54/0.78 ---------------- PROOF ----------------
% 0.54/0.78 % SZS status Theorem
% 0.54/0.78 % SZS output start Refutation
% 0.54/0.78
% 0.54/0.78 4 [] {+} -iext(uri_owl_propertyDisjointWith,A,B)| -iext(A,C,D)| -iext(B,C,D).
% 0.54/0.78 7 [] {+} -iext(uri_owl_differentFrom,uri_ex_w,uri_ex_u).
% 0.54/0.78 13 [] {+} iext(uri_owl_differentFrom,A,B)|A=B.
% 0.54/0.78 14 [] {+} iext(uri_owl_propertyDisjointWith,uri_ex_notInstanceOf,uri_rdf_type).
% 0.54/0.78 15 [] {+} iext(uri_rdf_type,uri_ex_w,uri_ex_c).
% 0.54/0.78 16 [] {+} iext(uri_ex_notInstanceOf,uri_ex_u,uri_ex_c).
% 0.54/0.78 67 [para_into,15.1.2,13.2.1] {-} iext(uri_rdf_type,A,uri_ex_c)|iext(uri_owl_differentFrom,uri_ex_w,A).
% 0.54/0.78 197 [hyper,67,4,14,16] {-} iext(uri_owl_differentFrom,uri_ex_w,uri_ex_u).
% 0.54/0.78 198 [binary,197.1,7.1] {-} $F.
% 0.54/0.78
% 0.54/0.78 % SZS output end Refutation
% 0.54/0.78 ------------ end of proof -------------
% 0.54/0.78
% 0.54/0.78
% 0.54/0.78 Search stopped by max_proofs option.
% 0.54/0.78
% 0.54/0.78
% 0.54/0.78 Search stopped by max_proofs option.
% 0.54/0.78
% 0.54/0.78 ============ end of search ============
% 0.54/0.78
% 0.54/0.78 ----------- soft-scott stats ----------
% 0.54/0.78
% 0.54/0.78 true clauses given 4 (26.7%)
% 0.54/0.78 false clauses given 11
% 0.54/0.78
% 0.54/0.78 FALSE TRUE
% 0.54/0.78 6 0 4
% 0.54/0.78 8 1 22
% 0.54/0.78 10 0 4
% 0.54/0.78 11 0 1
% 0.54/0.78 12 18 38
% 0.54/0.78 14 0 3
% 0.54/0.78 15 0 3
% 0.54/0.78 16 16 12
% 0.54/0.78 18 0 3
% 0.54/0.78 19 0 2
% 0.54/0.78 20 0 12
% 0.54/0.78 22 0 5
% 0.54/0.78 24 0 6
% 0.54/0.78 tot: 35 115 (76.7% true)
% 0.54/0.78
% 0.54/0.78
% 0.54/0.78 Model 7 [ 1 1 1117 ] (0.00 seconds, 250000 Inserts)
% 0.54/0.78
% 0.54/0.78 That finishes the proof of the theorem.
% 0.54/0.78
% 0.54/0.78 Process 27172 finished Wed Jun 1 10:45:27 2022
%------------------------------------------------------------------------------