TSTP Solution File: SWB006+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWB006+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:33 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWB006+2 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n023.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 06:43:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n023.cluster.edu,
% 0.13/0.36 Wed Jun 1 06:43:41 2022
% 0.13/0.36 The command was "./sos". The process ID is 29724.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.13/0.36
% 0.13/0.36 This is a Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.36 sos and nonpositive clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.38
% 0.13/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 -------------- Softie stats --------------
% 0.13/0.38
% 0.13/0.38 UPDATE_STOP: 300
% 0.13/0.38 SFINDER_TIME_LIMIT: 2
% 0.13/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38 number of clauses in intial UL: 3
% 0.13/0.38 number of clauses initially in problem: 7
% 0.13/0.38 percentage of clauses intially in UL: 42
% 0.13/0.38 percentage of distinct symbols occuring in initial UL: 62
% 0.13/0.38 percent of all initial clauses that are short: 100
% 0.13/0.38 absolute distinct symbol count: 8
% 0.13/0.38 distinct predicate count: 2
% 0.13/0.38 distinct function count: 1
% 0.13/0.38 distinct constant count: 5
% 0.13/0.38
% 0.13/0.38 ---------- no more Softie stats ----------
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 =========== start of search ===========
% 0.20/0.52
% 0.20/0.52 -------- PROOF --------
% 0.20/0.52 % SZS status Theorem
% 0.20/0.52 % SZS output start Refutation
% 0.20/0.52
% 0.20/0.52 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.52
% 0.20/0.52 Stopped by limit on number of solutions
% 0.20/0.52
% 0.20/0.52 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.52
% 0.20/0.52 Stopped by limit on number of solutions
% 0.20/0.52
% 0.20/0.52 Stopped by limit on insertions
% 0.20/0.52
% 0.20/0.52 Model 4 [ 1 0 77 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.52
% 0.20/0.52 ----> UNIT CONFLICT at 0.13 sec ----> 23 [binary,22.1,14.1] {+} $F.
% 0.20/0.52
% 0.20/0.52 Length of proof is 7. Level of proof is 4.
% 0.20/0.52
% 0.20/0.52 ---------------- PROOF ----------------
% 0.20/0.52 % SZS status Theorem
% 0.20/0.52 % SZS output start Refutation
% 0.20/0.52
% 0.20/0.52 1 [] {+} -iext(uri_owl_sameAs,A,B)|A=B.
% 0.20/0.52 3 [] {+} -iext(uri_owl_sameAs,uri_ex_u,uri_ex_w).
% 0.20/0.52 4 [] {-} iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)).
% 0.20/0.52 5 [] {+} iext(uri_owl_sameAs,$c1,literal_plain(dat_str_abc)).
% 0.20/0.52 6 [] {-} iext(uri_owl_sameAs,$c1,uri_ex_w).
% 0.20/0.52 9,8 [hyper,4,1,flip.1] {+} literal_plain(dat_str_abc)=uri_ex_u.
% 0.20/0.52 10 [back_demod,5,demod,9] {+} iext(uri_owl_sameAs,$c1,uri_ex_u).
% 0.20/0.52 13,12 [hyper,6,1,flip.1] {-} uri_ex_w=$c1.
% 0.20/0.52 14 [back_demod,6,demod,13] {+} iext(uri_owl_sameAs,$c1,$c1).
% 0.20/0.52 15 [back_demod,3,demod,13] {-} -iext(uri_owl_sameAs,uri_ex_u,$c1).
% 0.20/0.52 19,18 [hyper,10,1,flip.1] {-} uri_ex_u=$c1.
% 0.20/0.52 22 [back_demod,15,demod,19] {-} -iext(uri_owl_sameAs,$c1,$c1).
% 0.20/0.52 23 [binary,22.1,14.1] {+} $F.
% 0.20/0.52
% 0.20/0.52 % SZS output end Refutation
% 0.20/0.52 ------------ end of proof -------------
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 Search stopped by max_proofs option.
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 Search stopped by max_proofs option.
% 0.20/0.52
% 0.20/0.52 ============ end of search ============
% 0.20/0.52
% 0.20/0.52 ----------- soft-scott stats ----------
% 0.20/0.52
% 0.20/0.52 true clauses given 0 (0.0%)
% 0.20/0.52 false clauses given 4
% 0.20/0.52
% 0.20/0.52 FALSE TRUE
% 0.20/0.52 3 1 1
% 0.20/0.52 4 1 2
% 0.20/0.52 5 0 1
% 0.20/0.52 7 0 1
% 0.20/0.52 8 0 1
% 0.20/0.52 tot: 2 6 (75.0% true)
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 Model 4 [ 1 0 77 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.52
% 0.20/0.52 That finishes the proof of the theorem.
% 0.20/0.52
% 0.20/0.52 Process 29724 finished Wed Jun 1 06:43:41 2022
%------------------------------------------------------------------------------