TSTP Solution File: SWB030+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWB030+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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.66s 0.85s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWB030+2 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n025.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 04:51:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n025.cluster.edu,
% 0.12/0.35 Wed Jun 1 04:51:43 2022
% 0.12/0.35 The command was "./sos". The process ID is 8095.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= 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: 12
% 0.12/0.38 number of clauses initially in problem: 17
% 0.12/0.38 percentage of clauses intially in UL: 70
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 50
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 14
% 0.12/0.38 distinct predicate count: 3
% 0.12/0.38 distinct function count: 1
% 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.66/0.85
% 0.66/0.85 -------- PROOF --------
% 0.66/0.85 % SZS status Theorem
% 0.66/0.85 % SZS output start Refutation
% 0.66/0.85
% 0.66/0.85 Model 3 (0.00 seconds, 0 Inserts)
% 0.66/0.85
% 0.66/0.85 Stopped by limit on number of solutions
% 0.66/0.85
% 0.66/0.85 Model 4 (0.00 seconds, 0 Inserts)
% 0.66/0.85
% 0.66/0.85 Stopped by limit on number of solutions
% 0.66/0.85
% 0.66/0.85 Stopped by limit on insertions
% 0.66/0.85
% 0.66/0.85 Model 5 [ 3 1 80 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 Stopped by limit on insertions
% 0.66/0.85
% 0.66/0.85 Model 6 [ 1 0 343 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 Stopped by limit on insertions
% 0.66/0.85
% 0.66/0.85 Model 7 [ 1 0 215 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 Stopped by limit on insertions
% 0.66/0.85
% 0.66/0.85 Model 8 [ 2 0 307 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 Stopped by limit on insertions
% 0.66/0.85
% 0.66/0.85 Model 9 [ 1 0 511 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 -----> EMPTY CLAUSE at 0.48 sec ----> 32 [hyper,30,7,14,29] {-} $F.
% 0.66/0.85
% 0.66/0.85 Length of proof is 6. Level of proof is 5.
% 0.66/0.85
% 0.66/0.85 ---------------- PROOF ----------------
% 0.66/0.85 % SZS status Theorem
% 0.66/0.85 % SZS output start Refutation
% 0.66/0.85
% 0.66/0.85 1 [] {+} -iext(uri_rdf_type,A,B)|icext(B,A).
% 0.66/0.85 2 [] {+} iext(uri_rdf_type,A,B)| -icext(B,A).
% 0.66/0.85 3 [] {+} -iext(uri_owl_hasSelf,A,B)| -iext(uri_owl_onProperty,A,C)| -icext(A,D)|iext(C,D,D).
% 0.66/0.85 4 [] {+} -iext(uri_owl_hasSelf,A,B)| -iext(uri_owl_onProperty,A,C)|icext(A,D)| -iext(C,D,D).
% 0.66/0.85 7 [] {+} -iext(uri_owl_complementOf,A,B)| -icext(A,C)| -icext(B,C).
% 0.66/0.85 8 [] {+} -iext(uri_owl_complementOf,A,B)|icext(A,C)|icext(B,C).
% 0.66/0.85 14 [] {+} iext(uri_owl_complementOf,uri_ex_c,$c1).
% 0.66/0.85 16 [] {+} iext(uri_owl_onProperty,$c1,uri_rdf_type).
% 0.66/0.85 17 [] {-} iext(uri_owl_hasSelf,$c1,literal_typed(dat_str_true,uri_xsd_boolean)).
% 0.66/0.85 19 [hyper,14,8] {+} icext(uri_ex_c,A)|icext($c1,A).
% 0.66/0.85 23 [hyper,19,2] {+} icext($c1,A)|iext(uri_rdf_type,A,uri_ex_c).
% 0.66/0.85 26 [hyper,23,3,17,16] {+} iext(uri_rdf_type,A,uri_ex_c)|iext(uri_rdf_type,A,A).
% 0.66/0.85 28 [factor,26.1.2] {+} iext(uri_rdf_type,uri_ex_c,uri_ex_c).
% 0.66/0.85 29 [hyper,28,4,17,16] {+} icext($c1,uri_ex_c).
% 0.66/0.85 30 [hyper,28,1] {+} icext(uri_ex_c,uri_ex_c).
% 0.66/0.85 32 [hyper,30,7,14,29] {-} $F.
% 0.66/0.85
% 0.66/0.85 % SZS output end Refutation
% 0.66/0.85 ------------ end of proof -------------
% 0.66/0.85
% 0.66/0.85
% 0.66/0.85 Search stopped by max_proofs option.
% 0.66/0.85
% 0.66/0.85
% 0.66/0.85 Search stopped by max_proofs option.
% 0.66/0.85
% 0.66/0.85 ============ end of search ============
% 0.66/0.85
% 0.66/0.85 ----------- soft-scott stats ----------
% 0.66/0.85
% 0.66/0.85 true clauses given 6 (40.0%)
% 0.66/0.85 false clauses given 9
% 0.66/0.85
% 0.66/0.85 FALSE TRUE
% 0.66/0.85 4 0 1
% 0.66/0.85 7 0 1
% 0.66/0.85 8 0 2
% 0.66/0.85 tot: 0 4 (100.0% true)
% 0.66/0.85
% 0.66/0.85
% 0.66/0.85 Model 9 [ 1 0 511 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 That finishes the proof of the theorem.
% 0.66/0.85
% 0.66/0.85 Process 8095 finished Wed Jun 1 04:51:44 2022
%------------------------------------------------------------------------------