%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWB020+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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:39 EDT 2022
% Result : Theorem 9.01s 9.27s
% Output : Refutation 9.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWB020+2 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 1 07:35:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.46/0.63 ----- Otter 3.2, August 2001 -----
% 0.46/0.63 The process was started by sandbox2 on n022.cluster.edu,
% 0.46/0.63 Wed Jun 1 07:35:37 2022
% 0.46/0.63 The command was "./sos". The process ID is 10983.
% 0.46/0.63
% 0.46/0.63 set(prolog_style_variables).
% 0.46/0.63 set(auto).
% 0.46/0.63 dependent: set(auto1).
% 0.46/0.63 dependent: set(process_input).
% 0.46/0.63 dependent: clear(print_kept).
% 0.46/0.63 dependent: clear(print_new_demod).
% 0.46/0.63 dependent: clear(print_back_demod).
% 0.46/0.63 dependent: clear(print_back_sub).
% 0.46/0.63 dependent: set(control_memory).
% 0.46/0.63 dependent: assign(max_mem, 12000).
% 0.46/0.63 dependent: assign(pick_given_ratio, 4).
% 0.46/0.63 dependent: assign(stats_level, 1).
% 0.46/0.63 dependent: assign(pick_semantic_ratio, 3).
% 0.46/0.63 dependent: assign(sos_limit, 5000).
% 0.46/0.63 dependent: assign(max_weight, 60).
% 0.46/0.63 clear(print_given).
% 0.46/0.63
% 0.46/0.63 formula_list(usable).
% 0.46/0.63
% 0.46/0.63 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=15.
% 0.46/0.63
% 0.46/0.63 This is a non-Horn set without equality. The strategy
% 0.46/0.63 will be ordered hyper_res, ur_res, unit deletion, and
% 0.46/0.63 factoring, with satellites in sos and nuclei in usable.
% 0.46/0.63
% 0.46/0.63 dependent: set(hyper_res).
% 0.46/0.63 dependent: set(factor).
% 0.46/0.63 dependent: set(unit_deletion).
% 0.46/0.63
% 0.46/0.63 ------------> process usable:
% 0.46/0.63 Following clause subsumed by 1 during input processing: 0 [] {-} -iext(uri_owl_disjointWith,A,B)|ic(A).
% 0.46/0.63 Following clause subsumed by 2 during input processing: 0 [] {-} -iext(uri_owl_disjointWith,A,B)|ic(B).
% 0.46/0.63 54 back subsumes 51.
% 0.46/0.63 117 back subsumes 107.
% 0.46/0.63 125 back subsumes 118.
% 0.46/0.63 125 back subsumes 108.
% 0.46/0.63 202 back subsumes 179.
% 0.46/0.63 210 back subsumes 190.
% 0.46/0.63 217 back subsumes 173.
% 0.46/0.63 274 back subsumes 260.
% 0.46/0.63 278 back subsumes 265.
% 0.46/0.63 283 back subsumes 254.
% 0.46/0.63
% 0.46/0.63 ------------> process sos:
% 0.46/0.63
% 0.46/0.63 ======= end of input processing =======
% 0.59/0.85
% 0.59/0.85 Model 1 (0.00 seconds, 0 Inserts)
% 0.59/0.85
% 0.59/0.85 Stopped by limit on number of solutions
% 0.59/0.85
% 0.59/0.85
% 0.59/0.85 -------------- Softie stats --------------
% 0.59/0.85
% 0.59/0.85 UPDATE_STOP: 300
% 0.59/0.85 SFINDER_TIME_LIMIT: 2
% 0.59/0.85 SHORT_CLAUSE_CUTOFF: 4
% 0.59/0.85 number of clauses in intial UL: 283
% 0.59/0.85 number of clauses initially in problem: 298
% 0.59/0.85 percentage of clauses intially in UL: 94
% 0.59/0.85 percentage of distinct symbols occuring in initial UL: 62
% 0.59/0.85 percent of all initial clauses that are short: 100
% 0.59/0.85 absolute distinct symbol count: 27
% 0.59/0.85 distinct predicate count: 3
% 0.59/0.85 distinct function count: 4
% 0.59/0.85 distinct constant count: 20
% 0.59/0.85
% 0.59/0.85 ---------- no more Softie stats ----------
% 0.59/0.85
% 0.59/0.85
% 0.59/0.85
% 0.59/0.85 Stopped by limit on insertions
% 0.59/0.85
% 0.59/0.85 =========== start of search ===========
% 9.01/9.27
% 9.01/9.27 -------- PROOF --------
% 9.01/9.27 % SZS status Theorem
% 9.01/9.27 % SZS output start Refutation
% 9.01/9.27
% 9.01/9.27 Model 2 (0.00 seconds, 0 Inserts)
% 9.01/9.27
% 9.01/9.27 Stopped by limit on number of solutions
% 9.01/9.27
% 9.01/9.27 Model 3 (0.00 seconds, 0 Inserts)
% 9.01/9.27
% 9.01/9.27 Stopped by limit on number of solutions
% 9.01/9.27
% 9.01/9.27 Model 4 (0.00 seconds, 0 Inserts)
% 9.01/9.27
% 9.01/9.27 Stopped by limit on number of solutions
% 9.01/9.27
% 9.01/9.27 Model 5 (0.00 seconds, 0 Inserts)
% 9.01/9.27
% 9.01/9.27 Stopped by limit on number of solutions
% 9.01/9.27
% 9.01/9.27 Model 6 (0.00 seconds, 0 Inserts)
% 9.01/9.27
% 9.01/9.27 Stopped by limit on number of solutions
% 9.01/9.27
% 9.01/9.27 Stopped by limit on insertions
% 9.01/9.27
% 9.01/9.27 Model 7 [ 1 7 18803 ] (0.00 seconds, 250000 Inserts)
% 9.01/9.27
% 9.01/9.27 Stopped by limit on insertions
% 9.01/9.27
% 9.01/9.27 Model 8 [ 3 35 86178 ] (0.00 seconds, 250000 Inserts)
% 9.01/9.27
% 9.01/9.27 Model 9 (0.00 seconds, 250000 Inserts)
% 9.01/9.27
% 9.01/9.27 Stopped by limit on number of solutions
% 9.01/9.27
% 9.01/9.27 Model 10 (0.00 seconds, 250000 Inserts)
% 9.01/9.27
% 9.01/9.27 Stopped by limit on number of solutions
% 9.01/9.27
% 9.01/9.27 Stopped by limit on insertions
% 9.01/9.27
% 9.01/9.27 Model 11 [ 4 12 27731 ] (0.00 seconds, 250000 Inserts)
% 9.01/9.27
% 9.01/9.27 Stopped by limit on insertions
% 9.01/9.27
% 9.01/9.27 Model 12 [ 2 77 140731 ] (0.00 seconds, 250000 Inserts)
% 9.01/9.27
% 9.01/9.27 Model 13 (0.00 seconds, 250000 Inserts)
% 9.01/9.27
% 9.01/9.27 Stopped by limit on number of solutions
% 9.01/9.27
% 9.01/9.27 Stopped by limit on insertions
% 9.01/9.27
% 9.01/9.27 Model 14 [ 7 7 18528 ] (0.00 seconds, 250000 Inserts)
% 9.01/9.27
% 9.01/9.27 Stopped by limit on insertions
% 9.01/9.27
% 9.01/9.27 Model 15 [ 2 17 32498 ] (0.00 seconds, 250000 Inserts)
% 9.01/9.27
% 9.01/9.27 Stopped by limit on insertions
% 9.01/9.27
% 9.01/9.27 Model 16 [ 7 54 104683 ] (0.00 seconds, 250000 Inserts)
% 9.01/9.27
% 9.01/9.27 Stopped by limit on insertions
% 9.01/9.27
% 9.01/9.27 Model 17 [ 5 44 77247 ] (0.00 seconds, 250000 Inserts)
% 9.01/9.27
% 9.01/9.27 Model 18 (0.00 seconds, 250000 Inserts)
% 9.01/9.27
% 9.01/9.27 Stopped by limit on number of solutions
% 9.01/9.27
% 9.01/9.27 Stopped by limit on insertions
% 9.01/9.27
% 9.01/9.27 Model 19 [ 9 5 17183 ] (0.00 seconds, 250000 Inserts)
% 9.01/9.27
% 9.01/9.27 Stopped by limit on insertions
% 9.01/9.27
% 9.01/9.27 Model 20 [ 1 51 116591 ] (0.00 seconds, 250000 Inserts)
% 9.01/9.27
% 9.01/9.27 Stopped by limit on insertions
% 9.01/9.27
% 9.01/9.27 Model 21 [ 1 73 127720 ] (0.00 seconds, 250000 Inserts)
% 9.01/9.27
% 9.01/9.27 Stopped by limit on insertions
% 9.01/9.27
% 9.01/9.27 Model 22 [ 11 34 92297 ] (0.00 seconds, 250000 Inserts)
% 9.01/9.27
% 9.01/9.27 ----> UNIT CONFLICT at 8.88 sec ----> 605 [binary,604.1,36.1] {-} $F.
% 9.01/9.27
% 9.01/9.27 Length of proof is 10. Level of proof is 8.
% 9.01/9.27
% 9.01/9.27 ---------------- PROOF ----------------
% 9.01/9.27 % SZS status Theorem
% 9.01/9.27 % SZS output start Refutation
% 9.01/9.27
% 9.01/9.27 1 [] {+} -iext(uri_owl_disjointWith,A,B)|ic(A).
% 9.01/9.27 5 [] {+} -iext(uri_owl_complementOf,A,B)| -icext(A,C)| -icext(B,C).
% 9.01/9.27 10 [] {+} -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,C)| -iext(uri_rdf_first,C,D)| -iext(uri_rdf_rest,C,uri_rdf_nil)| -iext(uri_owl_intersectionOf,E,A)| -icext(E,F)|icext(B,F).
% 9.01/9.27 11 [] {+} -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,C)| -iext(uri_rdf_first,C,D)| -iext(uri_rdf_rest,C,uri_rdf_nil)| -iext(uri_owl_intersectionOf,E,A)| -icext(E,F)|icext(D,F).
% 9.01/9.27 19 [] {+} -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,C)| -iext(uri_rdf_first,C,D)| -iext(uri_rdf_rest,C,E)| -iext(uri_rdf_first,E,F)| -iext(uri_rdf_rest,E,uri_rdf_nil)| -iext(uri_owl_unionOf,G,A)|ic(F).
% 9.01/9.27 20 [] {+} -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,C)| -iext(uri_rdf_first,C,D)| -iext(uri_rdf_rest,C,E)| -iext(uri_rdf_first,E,F)| -iext(uri_rdf_rest,E,uri_rdf_nil)| -iext(uri_owl_unionOf,G,A)| -icext(G,H)|icext(B,H)|icext(D,H)|icext(F,H).
% 9.01/9.27 30 [] {+} -iext(uri_rdfs_subClassOf,A,B)| -icext(A,C)|icext(B,C).
% 9.01/9.27 31 [] {+} iext(uri_rdfs_subClassOf,A,B)| -ic(A)| -ic(B)|icext(A,$f3(A,B)).
% 9.01/9.27 32 [] {+} iext(uri_rdfs_subClassOf,A,B)| -ic(A)| -ic(B)| -icext(B,$f3(A,B)).
% 9.01/9.27 33 [] {+} -iext(uri_owl_disjointWith,A,B)| -icext(A,C)| -icext(B,C).
% 9.01/9.27 36 [] {+} -iext(uri_rdfs_subClassOf,uri_ex_d,uri_ex_c3).
% 9.01/9.27 294 [] {-} iext(uri_owl_unionOf,uri_ex_c,$c5).
% 9.01/9.27 295 [] {+} iext(uri_rdf_first,$c5,uri_ex_c1).
% 9.01/9.27 296 [] {+} iext(uri_rdf_rest,$c5,$c4).
% 9.01/9.27 297 [] {+} iext(uri_rdf_first,$c4,uri_ex_c2).
% 9.01/9.27 298 [] {+} iext(uri_rdf_rest,$c4,$c3).
% 9.01/9.27 299 [] {+} iext(uri_rdf_first,$c3,uri_ex_c3).
% 9.01/9.27 300 [] {+} iext(uri_rdf_rest,$c3,uri_rdf_nil).
% 9.01/9.27 301 [] {+} iext(uri_owl_disjointWith,uri_ex_d,uri_ex_c1).
% 9.01/9.27 302 [] {+} iext(uri_rdfs_subClassOf,uri_ex_d,$c7).
% 9.01/9.27 303 [] {+} iext(uri_owl_intersectionOf,$c7,$c2).
% 9.01/9.27 304 [] {+} iext(uri_rdf_first,$c2,uri_ex_c).
% 9.01/9.27 305 [] {+} iext(uri_rdf_rest,$c2,$c1).
% 9.01/9.27 306 [] {+} iext(uri_rdf_first,$c1,$c6).
% 9.01/9.27 307 [] {+} iext(uri_rdf_rest,$c1,uri_rdf_nil).
% 9.01/9.27 308 [] {+} iext(uri_owl_complementOf,$c6,uri_ex_c2).
% 9.01/9.27 309 [hyper,300,19,295,296,297,298,299,294] {+} ic(uri_ex_c3).
% 9.01/9.27 325 [hyper,301,1] {+} ic(uri_ex_d).
% 9.01/9.27 363 [hyper,325,31,309,unit_del,36] {+} icext(uri_ex_d,$f3(uri_ex_d,uri_ex_c3)).
% 9.01/9.27 480 [hyper,363,30,302] {+} icext($c7,$f3(uri_ex_d,uri_ex_c3)).
% 9.01/9.27 483 [hyper,480,11,304,305,306,307,303] {-} icext($c6,$f3(uri_ex_d,uri_ex_c3)).
% 9.01/9.27 484 [hyper,480,10,304,305,306,307,303] {+} icext(uri_ex_c,$f3(uri_ex_d,uri_ex_c3)).
% 9.01/9.27 486 [hyper,484,20,295,296,297,298,299,300,294] {-} icext(uri_ex_c1,$f3(uri_ex_d,uri_ex_c3))|icext(uri_ex_c2,$f3(uri_ex_d,uri_ex_c3))|icext(uri_ex_c3,$f3(uri_ex_d,uri_ex_c3)).
% 9.01/9.27 597 [hyper,486,33,301,363] {-} icext(uri_ex_c2,$f3(uri_ex_d,uri_ex_c3))|icext(uri_ex_c3,$f3(uri_ex_d,uri_ex_c3)).
% 9.01/9.27 602 [hyper,597,5,308,483] {+} icext(uri_ex_c3,$f3(uri_ex_d,uri_ex_c3)).
% 9.01/9.27 604 [hyper,602,32,325,309] {-} iext(uri_rdfs_subClassOf,uri_ex_d,uri_ex_c3).
% 9.01/9.27 605 [binary,604.1,36.1] {-} $F.
% 9.01/9.27
% 9.01/9.27 % SZS output end Refutation
% 9.01/9.27 ------------ end of proof -------------
% 9.01/9.27
% 9.01/9.27
% 9.01/9.27 Search stopped by max_proofs option.
% 9.01/9.27
% 9.01/9.27
% 9.01/9.27 Search stopped by max_proofs option.
% 9.01/9.27
% 9.01/9.27 ============ end of search ============
% 9.01/9.27
% 9.01/9.27 ----------- soft-scott stats ----------
% 9.01/9.27
% 9.01/9.27 true clauses given 86 (61.9%)
% 9.01/9.27 false clauses given 53
% 9.01/9.27
% 9.01/9.27 FALSE TRUE
% 9.01/9.27 5 0 1
% 9.01/9.27 9 0 120
% 9.01/9.27 12 0 3
% 9.01/9.27 14 0 6
% 9.01/9.27 19 0 3
% 9.01/9.27 20 0 13
% 9.01/9.27 24 0 3
% 9.01/9.27 34 0 6
% 9.01/9.27 44 0 5
% 9.01/9.27 tot: 0 160 (100.0% true)
% 9.01/9.27
% 9.01/9.27
% 9.01/9.27 Model 22 [ 11 34 92297 ] (0.00 seconds, 250000 Inserts)
% 9.01/9.27
% 9.01/9.27 That finishes the proof of the theorem.
% 9.01/9.27
% 9.01/9.27 Process 10983 finished Wed Jun 1 07:35:46 2022
%------------------------------------------------------------------------------