TSTP Solution File: SWB031+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWB031+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:43 EDT 2022
% Result : Unsatisfiable 0.83s 1.06s
% Output : Refutation 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SWB031+2 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 1 00:41:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox2 on n028.cluster.edu,
% 0.12/0.34 Wed Jun 1 00:41:21 2022
% 0.12/0.34 The command was "./sos". The process ID is 7853.
% 0.12/0.34
% 0.12/0.34 set(prolog_style_variables).
% 0.12/0.34 set(auto).
% 0.12/0.34 dependent: set(auto1).
% 0.12/0.34 dependent: set(process_input).
% 0.12/0.34 dependent: clear(print_kept).
% 0.12/0.34 dependent: clear(print_new_demod).
% 0.12/0.34 dependent: clear(print_back_demod).
% 0.12/0.34 dependent: clear(print_back_sub).
% 0.12/0.34 dependent: set(control_memory).
% 0.12/0.34 dependent: assign(max_mem, 12000).
% 0.12/0.34 dependent: assign(pick_given_ratio, 4).
% 0.12/0.34 dependent: assign(stats_level, 1).
% 0.12/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34 dependent: assign(sos_limit, 5000).
% 0.12/0.34 dependent: assign(max_weight, 60).
% 0.12/0.34 clear(print_given).
% 0.12/0.34
% 0.12/0.34 formula_list(usable).
% 0.12/0.34
% 0.12/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.12/0.34
% 0.12/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.34 clauses in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(knuth_bendix).
% 0.12/0.34 dependent: set(para_from).
% 0.12/0.34 dependent: set(para_into).
% 0.12/0.34 dependent: clear(para_from_right).
% 0.12/0.34 dependent: clear(para_into_right).
% 0.12/0.34 dependent: set(para_from_vars).
% 0.12/0.34 dependent: set(eq_units_both_ways).
% 0.12/0.34 dependent: set(dynamic_demod_all).
% 0.12/0.34 dependent: set(dynamic_demod).
% 0.12/0.34 dependent: set(order_eq).
% 0.12/0.34 dependent: set(back_demod).
% 0.12/0.34 dependent: set(lrpo).
% 0.12/0.34 dependent: set(hyper_res).
% 0.12/0.34 dependent: set(unit_deletion).
% 0.12/0.34 dependent: set(factor).
% 0.12/0.34
% 0.12/0.34 ------------> process usable:
% 0.12/0.34
% 0.12/0.34 ------------> process sos:
% 0.12/0.34 17 back subsumes 1.
% 0.12/0.34 Following clause subsumed by 22 during input processing: 0 [copy,22,flip.1] {-} A=A.
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 15
% 0.12/0.38 number of clauses initially in problem: 21
% 0.12/0.38 percentage of clauses intially in UL: 71
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 82
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 17
% 0.12/0.38 distinct predicate count: 5
% 0.12/0.38 distinct function count: 2
% 0.12/0.38 distinct constant count: 10
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 0.83/1.06
% 0.83/1.06 -------- PROOF --------
% 0.83/1.06 % SZS status Theorem
% 0.83/1.06 % SZS output start Refutation
% 0.83/1.06
% 0.83/1.06 Stopped by limit on insertions
% 0.83/1.06
% 0.83/1.06 Model 3 [ 1 1 221 ] (0.00 seconds, 250000 Inserts)
% 0.83/1.06
% 0.83/1.06 Stopped by limit on insertions
% 0.83/1.06
% 0.83/1.06 Model 4 [ 1 1 503 ] (0.00 seconds, 250000 Inserts)
% 0.83/1.06
% 0.83/1.06 Stopped by limit on insertions
% 0.83/1.06
% 0.83/1.06 Model 5 [ 3 1 180 ] (0.00 seconds, 250000 Inserts)
% 0.83/1.06
% 0.83/1.06 Model 6 (0.00 seconds, 250000 Inserts)
% 0.83/1.06
% 0.83/1.06 Stopped by limit on number of solutions
% 0.83/1.06
% 0.83/1.06 Stopped by limit on insertions
% 0.83/1.06
% 0.83/1.06 Model 7 [ 4 0 527 ] (0.00 seconds, 250000 Inserts)
% 0.83/1.06
% 0.83/1.06 Model 8 (0.00 seconds, 250000 Inserts)
% 0.83/1.06
% 0.83/1.06 Stopped by limit on number of solutions
% 0.83/1.06
% 0.83/1.06 ----> UNIT CONFLICT at 0.69 sec ----> 143 [binary,142.1,92.1] {-} $F.
% 0.83/1.06
% 0.83/1.06 Length of proof is 5. Level of proof is 4.
% 0.83/1.06
% 0.83/1.06 ---------------- PROOF ----------------
% 0.83/1.06 % SZS status Theorem
% 0.83/1.06 % SZS output start Refutation
% 0.83/1.06
% 0.83/1.06 2 [] {+} icext(uri_owl_Thing,A)| -ir(A).
% 0.83/1.06 3 [] {+} -icext(uri_owl_Nothing,A).
% 0.83/1.06 5 [] {+} -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.
% 0.83/1.06 11 [] {+} -iext(uri_owl_equivalentClass,A,B)| -icext(A,C)|icext(B,C).
% 0.83/1.06 17 [] {+} ir(A).
% 0.83/1.06 18 [] {+} iext(uri_owl_equivalentClass,uri_owl_Thing,$c2).
% 0.83/1.06 19 [] {+} iext(uri_owl_oneOf,$c2,$c1).
% 0.83/1.06 20 [] {+} iext(uri_rdf_first,$c1,uri_ex_w).
% 0.83/1.06 21 [] {+} iext(uri_rdf_rest,$c1,uri_rdf_nil).
% 0.83/1.06 23 [hyper,17,2] {+} icext(uri_owl_Thing,A).
% 0.83/1.06 29 [hyper,23,11,18] {+} icext($c2,A).
% 0.83/1.06 43 [hyper,20,5,21,19,29] {-} A=uri_ex_w.
% 0.83/1.06 92 [para_from,43.1.1,29.1.1] {-} icext(uri_ex_w,A).
% 0.83/1.06 142 [para_from,43.1.1,3.1.1] {-} -icext(uri_ex_w,A).
% 0.83/1.06 143 [binary,142.1,92.1] {-} $F.
% 0.83/1.06
% 0.83/1.06 % SZS output end Refutation
% 0.83/1.06 ------------ end of proof -------------
% 0.83/1.06
% 0.83/1.06
% 0.83/1.06 Search stopped by max_proofs option.
% 0.83/1.06
% 0.83/1.06
% 0.83/1.06 Search stopped by max_proofs option.
% 0.83/1.06
% 0.83/1.06 ============ end of search ============
% 0.83/1.06
% 0.83/1.06 ----------- soft-scott stats ----------
% 0.83/1.06
% 0.83/1.06 true clauses given 4 (33.3%)
% 0.83/1.06 false clauses given 8
% 0.83/1.06
% 0.83/1.06 FALSE TRUE
% 0.83/1.06 3 1 0
% 0.83/1.06 4 0 4
% 0.83/1.06 17 0 2
% 0.83/1.06 18 0 2
% 0.83/1.06 19 0 11
% 0.83/1.06 22 0 6
% 0.83/1.06 26 0 12
% 0.83/1.06 30 0 14
% 0.83/1.06 34 0 7
% 0.83/1.06 tot: 1 58 (98.3% true)
% 0.83/1.06
% 0.83/1.06
% 0.83/1.06 Model 8 (0.00 seconds, 250000 Inserts)
% 0.83/1.06
% 0.83/1.06 That finishes the proof of the theorem.
% 0.83/1.06
% 0.83/1.06 Process 7853 finished Wed Jun 1 00:41:22 2022
%------------------------------------------------------------------------------